Cod sursa(job #1112990)
Utilizator | Data | 20 februarie 2014 11:04:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr=0,j,i;
bool a[2000005];
int main()
{
f>>n;
for(i=2;i<=n;i++)
a[i]=1;
for( i=2;i<=n;i++)
if(a[i])
{
nr++;
for( j=i+i;j<=n;j=j+i)
a[j]=0;
}
g<<nr;
return 0;
}