Submission

Status:

PPPP-P--P-

Score: 60

User: Cmoss9

Problemset: จำนวนเฉพาะ (2560)

Language: c

Time: 0.002 second

Submitted On: 2024-10-09 20:26:35

#include <stdio.h>

int isPrime(int num) {
    if (num < 2) return 0; // Numbers less than 2 are not prime
    for (int j = 2; j * j <= num; j++) {
        if (num % j == 0) return 0; // Not prime if divisible
    }
    return 1; // Number is prime
}

int main() {
    int n;
    scanf("%d", &n);
    // Generate and check prime numbers
    for (int i = 2; i < 2 + n; i++) {
        if (isPrime(i)) {
            printf("%d\n", i); // Print the prime number
        }
    }
    
    return 0;
}