Scribd Logo
Upload

Welcome to Scribd!

  • 71 views

    Link sex tập thể

    Uploaded by

    nguyendinhmanh2006rok

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd

    Link sex tập thể

    Uploaded by

    nguyendinhmanh2006rok
    71 views2 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    71 views2 pages

    Link sex tập thể

    Uploaded by

    nguyendinhmanh2006rok

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    You are on page 1of 2

    #include <stdio.

    h>

    void NHAPMANG(int a[], int n) {


    for (int i = 1; i <= n; i++) {
    printf("Nhap phan tu thu %d: ", i);
    scanf("%d", &a[i]);
    }
    }

    int TIMGTLN(int a[], int n) {


    int max = a[1];
    for (int i = 2; i <= n; i++) {
    if (a[i] > max) {
    max = a[i];
    }
    }
    return max;
    }

    int KIEMTRACHANLE(int x) {
    return (x % 2 == 0);
    }

    int TICHCACSOCHAN(int a[], int n) {


    int tich = 1;
    int kt = 0;
    for (int i = 1; i <= n; i++) {
    if (KIEMTRACHANLE(a[i])) {
    tich *= a[i];
    kt = 1;
    }
    }
    return kt ? tich : 0;
    }

    void THAYTHE(int a[], int n, int k) {


    if (n >= 2) {
    a[2] = k;
    }
    }

    void HOANVI(int *a, int *b) {


    int tg = *a;
    *a = *b;
    *b = tg;
    }

    void SAPXEPMANG(int a[], int n) {


    for (int i = 1; i <= n; i++) {
    for (int j = i + 1; j <= n; j++) {
    if (a[i] > a[j]) {
    HOANVI(&a[i], &a[j]);
    }
    }
    }
    }

    void XUATMANG(int a[], int n) {


    printf("Mang sau khi sap xep: ");
    for (int i = 1; i <= n; i++) {
    printf("%d ", a[i]);
    }
    printf("\n");
    }

    int main() {
    int n;
    printf("Nhap so phan tu cua mang: ");
    scanf("%d", &n);

    int a[n];
    NHAPMANG(a, n);
    int max = TIMGTLN(a, n);
    printf("Gia tri lon nhat trong mang: %d\n", max);

    int tich = TICHCACSOCHAN(a, n);


    if (tich == 0)
    printf("Không co so chan trong mang.\n");
    else
    printf("Tich cac so chan trong mang: %d\n", tich);
    int k;
    printf("Nhap gia tri K de thay vao phan tu thu 2: ");
    scanf("%d", &k);

    THAYTHE(a,n,k);
    SAPXEPMANG(a, n);
    XUATMANG(a, n);

    return 0;
    }

    You might also like