Submission

PPPPPPPPPP

Score: 100

User: Spongebob

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

Language: c

Time: 0.002 second

Submitted On: 2024-10-16 23:39:47

#include <stdio.h>
#include <math.h>

int isPrime (int n);

int main () {
    int N;
    scanf("%d", &N);
    int i;
    if (N >= 2) printf("2\n");
    for (i = 3; i < N; i+=2) {
        if (isPrime(i)) {
           printf("%d\n", i);
        }
    }
    
    return 0;
}

int isPrime (int n) {
    int i;
    if (n % 2 == 0) return 0;
    for (i = 3; i <= sqrt(n); i+=2) {
        if (n % i == 0) return 0;
    }
    return 1;
}