#include <stdio.h>
#include <math.h>
#include <stdbool.h>
 
// Function to check if a number is prime
bool isPrime(int n) {
    // 0 and 1 are not prime numbers
    if (n <= 1) {
        return false;
    }
    // Check for divisibility from 2 to sqrt(n)
    for (int i = 2; i <= sqrt(n); i++) {
        if (n % i == 0) {
            return false; // n is divisible by i, hence not prime
        }
    }
    return true; // n is prime
}
 
int main() {
    printf("Prime numbers between 1 and 100 are:\n");
    // Iterate through numbers from 1 to 100
    for (int i = 1; i <= 100; i++) {
        if (isPrime(i)) {
            printf("%d ", i); // Print the prime number
        }
    }
    printf("\n");
    return 0;
}

I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxtYXRoLmg+CiNpbmNsdWRlIDxzdGRib29sLmg+CgovLyBGdW5jdGlvbiB0byBjaGVjayBpZiBhIG51bWJlciBpcyBwcmltZQpib29sIGlzUHJpbWUoaW50IG4pIHsKICAgIC8vIDAgYW5kIDEgYXJlIG5vdCBwcmltZSBudW1iZXJzCiAgICBpZiAobiA8PSAxKSB7CiAgICAgICAgcmV0dXJuIGZhbHNlOwogICAgfQogICAgLy8gQ2hlY2sgZm9yIGRpdmlzaWJpbGl0eSBmcm9tIDIgdG8gc3FydChuKQogICAgZm9yIChpbnQgaSA9IDI7IGkgPD0gc3FydChuKTsgaSsrKSB7CiAgICAgICAgaWYgKG4gJSBpID09IDApIHsKICAgICAgICAgICAgcmV0dXJuIGZhbHNlOyAvLyBuIGlzIGRpdmlzaWJsZSBieSBpLCBoZW5jZSBub3QgcHJpbWUKICAgICAgICB9CiAgICB9CiAgICByZXR1cm4gdHJ1ZTsgLy8gbiBpcyBwcmltZQp9CgppbnQgbWFpbigpIHsKICAgIHByaW50ZigiUHJpbWUgbnVtYmVycyBiZXR3ZWVuIDEgYW5kIDEwMCBhcmU6XG4iKTsKICAgIC8vIEl0ZXJhdGUgdGhyb3VnaCBudW1iZXJzIGZyb20gMSB0byAxMDAKICAgIGZvciAoaW50IGkgPSAxOyBpIDw9IDEwMDsgaSsrKSB7CiAgICAgICAgaWYgKGlzUHJpbWUoaSkpIHsKICAgICAgICAgICAgcHJpbnRmKCIlZCAiLCBpKTsgLy8gUHJpbnQgdGhlIHByaW1lIG51bWJlcgogICAgICAgIH0KICAgIH0KICAgIHByaW50ZigiXG4iKTsKICAgIHJldHVybiAwOwp9

MTAw

100