Submission

Score: 85

User: YoruoniVamp

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

Language: cpp

Time: 1.091 second

Submitted On: 2025-09-30 16:15:59

#include <bits/stdc++.h>
using namespace std;


bool is_prime(int n) {
	if (n < 2) return false;
	if (n == 2) return true;
	for(int i = 2; i < sqrt(n)+1; ++i) {
		if (n % i == 0) return false; 
	}
	return true;
}

int main() {
	int n; cin >> n;
	int last_n;
	for(int i = 2; i < n; ++i) {
		if (is_prime(i)) {
			last_n = i;
		}
	}
	int arr[5];
	arr[0] = last_n;
	int ct = 1;
	for(int i = last_n-2; i >= 0; --i) {
		if (is_prime(i)) {
			arr[ct] = i;
			ct++;
		}
		if (ct == 5) break;
	}
	
	for(int i = 4; i >= 0; --i) {
		cout << arr[i] << ' ';
	}
	return 0;
}