Submission

Score: 100

User: matcherbrainner

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

Language: cpp

Time: 0.003 second

Submitted On: 2026-10-01 20:56:07

#include<bits/stdc++.h>
using namespace std;
bool P(long long n){
	if(n<2)return 0;
	for(long long i=2;i*i<=n;i++)if(n%i==0)return 0;
	return 1;
}
int main(){
	long long n,ans[5];
	cin>>n;
	for(int c=4;c>=0;n--){
		if(P(n-1)){
			ans[c--]=n-1;
		}

	}
			for(int i=0;i<5;i++){
			cout<<ans[i]<<" ";
		}
}