Submission

Score: 100

User: Phat12

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-09-23 11:55:36

/*
TASK: su67_lastprime.cpp
LANG: Cpp
AUTHOR: Phat
*/
#include <bits/stdc++.h>
#define FO(i,L,R) for (int i = L; i < R; i++)
using namespace std;
int arr[5];
int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    int cnt=5;
    while (cnt--){
        while (n--){
            if (n%2==0) continue;
            bool isprime=1;
            for (int i=3;i*i<=n;i+=2){
                if (n%i==0) {
                    isprime=0;
                    break;
                }
            }
            if (isprime){
                arr[cnt]=n;
                break;
            }
        }
    }
    for (int i=0;i<5;i++) cout << arr[i] << ' ';    
    return 0;
}