Cod sursa(job #727110)
Utilizator | Data | 27 martie 2012 19:11:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#define dim 2000001
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char a[dim];
int nr=0,i,j;
int n;
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;
}