Cod sursa(job #686918)
Utilizator | Data | 21 februarie 2012 22:35:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long n,i,j,nr;
bool ciur[2000001];
int main ()
{
f>>n;
for (i=2;i<=n;i++)
if (ciur[i]==0)
{
nr++;
for (j=i*i;j<=n;j=j+i)
ciur[j]=1;
}
g<<nr;
f.close();
g.close();
return 0;
}