Submission

Score: 100

User: YoruoniVamp

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-09-30 16:20:38

#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 arr[5];
	int ct = 0;
	for(int i = n-1; i >= 0; --i) {
		if (is_prime(i)) {
			arr[4-ct] = i;
			ct++;
		}
		if (ct == 5) break;
	}
	for(int i = 0; i < 5; ++i) cout << arr[i] << ' ';
	return 0;
}