Submission

Score: 100

User: Kidmaiok

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-07 14:53:07

#include<bits/stdc++.h>
using namespace std;
bool isitprime(int x){
    if(x <2){
        return false;
    }
    for(int i =2;i*i<= x;i++){
        if(x%i == 0){
            return false;
        }   
    }return true;
}
int main(){
    cin.tie(NULL)->sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> num;
    for(int i = n;i>0;i--){
        if(isitprime(i)){
        num.push_back(i);
        }
    }
    sort(num.begin(),num.end());
    for(int i =0;i < num.size();i++){
        if(num[i] != n){
            cout << num[i] << "\n";
        }
        
    }

    
    
}