Cod sursa(job #1478625)
Utilizator | Data | 29 august 2015 03:08:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool viz[2000001];
int main()
{ int nr,n,i,j;
f>>n;
for( i=2;i<=n;i++)
{
if(viz[i]==0)
for(j=i*2;j<=n;j=j+i)
viz[j]=1;
}
for(i=2;i<=n;i++)
if(viz[i]==0)
nr++;
g<<nr;
return 0;
}