Submission

Score: 80

User: Alif_Sama

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-09 18:24:59

#include <iostream>
#include <cmath>
using namespace std;

int main() {
    int n;
    cin >> n;
    int primecnt = 0;
    bool prime = true;
    for(int i = 2; i <= n; i++) {
        // Find primes
        for(int j = 2; j < i; j++) {
            if (i % j == 0) {
                prime = false;
                break;
            }
        }
        if (prime == true) {
            cout << i << "\n";
            primecnt += 1;
        }
        prime = true;
    }

    // if (primecnt == 0) {
    //     printf("There is no prime in 1 to %d.",n);
    //     return 0;
    // } else {
    //     printf("There are %d prime numbers between 1 to %d!\n",primecnt,n);
    // }
}