Cod sursa(job #2518419)
Utilizator | Data | 5 ianuarie 2020 18:13:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int prim(int x)
{
if(x < 2 || (x > 2 && x % 2 == 0))
return 0;
for(int i = 3 ; i*i <= x ; i++)
if(x % i == 0)
return 0;
return 1;
}
int main()
{
int x;
fin >> x;
fout << prim(x);
return 0;
}