Cod sursa(job #1837599)
Utilizator | Data | 29 decembrie 2016 23:48:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{ int i,nr=0,k;
long long N,d;
in>>N;
for(i=2;i<=N;i++)
{ k=0;
for(d=2;d<=i/2;d++)
if(i%d==0)
{ k++;
}
if(k==0)
nr++;
}
out<<nr;
in.close();
out.close();
}