Submission

Score: 100

User: Poon

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

Language: cpp

Time: 0.102 second

Submitted On: 2025-10-09 15:24:23

#include <iostream>
using namespace std;

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

int main()
{
    long long n;
    cin>>n;
    int c=5;
    int x[5];
    for(int k=n-1;k>1;k--)
    {

        if(is_prime(k)==1)
        {
            x[c-1]=k;
            c--;
        }
        if(c==0)
        {
            break;
        }
    }
    for(int k=0;k<5;k++)
    {
        cout<<x[k]<<" ";
    }
}