Cod sursa(job #2546127)
Utilizator | Data | 13 februarie 2020 20:40:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
int prim(int x)
{
int d;
if(x<=1)
return 0;
if(x==2)
return 1;
if(x%2==0)
return 0;
for(d=3;d*d<=x;d++)
if(x%d==0)
return 0;
return 1;
}
int main()
{
int n,nr=0;
fi>>n;
for(int i=1;i<=n;i++)
if(prim(i))
nr++;
fo<<nr;
return 0;
}