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