Cod sursa(job #999736)
Utilizator | Data | 21 septembrie 2013 12:46:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int a[2000000+10];
int main()
{
long long int n;
fin >> n;
int i,d,z=0;
a[0]=a[1]=1;
for(i=2;i<=n;i++)
{
if(a[i]==0)
{for(d=i*i;d<=n;d+=i)
a[d]=1;
z++;
}
}
fout << z << "\n";
return 0;
}