Cod sursa(job #501371)
Utilizator | Data | 14 noiembrie 2010 20:55:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
#define dim 2000001
char v[dim];
int main()
{
long long unsigned n, i, j, f=1;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=3;i<=n;++i)
{
if(v[i]==0)
{
++f;
for(j=i*i;j<=n;j+=2*i)
v[j]=1;
}
++i;
}
fout<<f ;
return 0;
}