Submission

Score: 100

User: dddrrrr

Problemset: จำนวนเฉพาะก่อนหน้า

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-13 15:59:49

#include <bits/stdc++.h>
using namespace std;
bool isprime(long long n){
	if(n<2)return false;
	if(n%2==0)return n==2;
	
	for(int i=3 ;i*i<=n ;i+=2){
		if(n % i == 0)return false;
	}
	return true;
	
}
int main(){
	cin.tie(0)->sync_with_stdio(0);
	long long n;cin >> n;
	
	vector <long long> ans;
	for(int i=n-1 ;i>=2 && ans.size() < 5;i--){
		if(isprime(i))ans.emplace_back(i);
	}
	
	for(int i=4 ;i>=0 ;i--)cout << ans[i] << ' ';
	
	
	return 0;
}