Cod sursa(job #2749884)
Utilizator | Data | 8 mai 2021 21:25:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int prim(long int x)
{
int d=2, ok=1;
while(d<=x/2 && ok==1)
if(x%d==0)
ok=0;
else
d++;
return ok;
}
int main()
{long int n, i;
int nr=0;
ifstream f("ciur.in");
f>>n;
f.close();
for(i=2; i<=n; i++)
if(prim(i)==1)
nr++;
ofstream g("ciur.out");
g<<nr;
g.close();
return 0;
}