Cod sursa(job #1910398)
Utilizator | Data | 7 martie 2017 16:44:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
short n, nr, i, d, ciur[2000001];
int main()
{
f >> n;
ciur[1]=1;
ciur[0]=1;
for(d=2;d*d<=n;d++)
if(ciur[d]==0)
for(i=d+d;i<=n;i=i+d) ciur[i]=1;
for(i=1;i<=n;i++)
if(ciur[i]==0) nr++;
g << nr;
return 0;
}