Cod sursa(job #1912162)
Utilizator | Data | 7 martie 2017 23:42:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr,i,d;
bool ciur[20000001];
int main()
{
f>>n;
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=2;i<=n;i++)
if(ciur[i]==0) nr++;
g<<nr;
return 0;
}