Submission

Score: 80

User: sundopoz

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

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-08 20:00:37

/*
this is my template :>
*/
#include<iostream>
#include<cmath>
#include<array>
#include<vector>
#include<algorithm>
#include<string>
/*
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <queue>
// */

// #include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef size_t st;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
template <typename T>
istream& operator>>(istream& is, vector<T>& v){
    for (T& x:v) cin>>x;
    return is;
}
template <typename T>
using ar = std::array<T,2>;
const int mod107=1000000007;
const int mod67=676767677;
ll n,m,q;
vi primes;
void sieve(){
    ll mx= 1000;
    vector<bool> ip(mx+1,true);
    ip[0] = ip[1] =false;
    for (ll i=2;i*i<=mx;i++){
        if (ip[i]){
            for (ll j=i*i;j<=mx;j+=i){
                ip[j]=false;
            }
        }
    } 
    for (int i=2;i<mx;i++){
        if (ip[i]==true){
            primes.push_back(i);
        }
    }
}
// this is my solution
auto solve(){
    sieve();
    cin>>n;
    for (int x:primes){
        if (x>n) break;
        cout<<x<<'\n';
    }
    return;
}
int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    size_t testcase=1;
    //cin>>testcase;
    while(testcase--){
        solve();
    }
    return 0;
}