C语言程序统计100以内质数和合数

#include <stdio.h>

int is_prime(int n) {
    if (n <= 1) {
        return 0;
    }
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            return 0;
        }
    }
    return 1;
}

int main() {
    int prime_count = 0, composite_count = 0;
    printf('Prime numbers:\n');
    for (int i = 1; i <= 100; i++) {
        if (is_prime(i)) {
            printf('%d ', i);
            prime_count++;
        } else {
            composite_count++;
        }
    }
    printf('\n\nComposite numbers:\n');
    for (int i = 1; i <= 100; i++) {
        if (!is_prime(i)) {
            printf('%d ', i);
        }
    }
    printf('\n\nTotal prime numbers: %d\n', prime_count);
    printf('Total composite numbers: %d\n', composite_count);
    return 0;
}

输出结果：

Prime numbers:
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 

Composite numbers:
1 4 6 8 9 10 12 14 15 16 18 20 21 22 24 25 26 27 28 30 32 33 34 35 36 38 39 40 42 44 45 46 48 49 50 51 52 54 55 56 57 58 60 62 63 64 65 66 68 69 70 72 74 75 76 77 78 80 81 82 84 85 86 87 88 90 91 92 93 94 95 96 98 99 100 

Total prime numbers: 25
Total composite numbers: 75