Submission

Status:

-PPPPPPPPPPPPPPPPPPP

Score: 95

User: Pera

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

Language: cpp

Time: 0.002 second

Submitted On: 2024-11-28 11:33:13

#include <bits/stdc++.h>

int isprime(int n);

int main(void) {
    int num{};
    std::cin >> num;

    int arr[5];

    int count {0};
    int n {num - 1};
    while (count < 5) {
        if (isprime(n)) {
            count++;
            arr[count] = n;
        }
        n--;
    }

    for (int i{5}; i > 0; i--) {
        std::cout << arr[i] << " ";
    }

    std::cout << '\n';

    return 0;
    // (isprime(num)) ? std::cout << num << " is a prime number" << '\n' : std::cout << num << " is not a prime number" << '\n';
}

int isprime(int n) {
    for (int i{2}; i * i < n; i++) {
        if (n % i == 0) {
            return 0;
        }
    }
    return 1;
}