Cod sursa(job #875371)
Utilizator | Data | 9 februarie 2013 23:33:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int ciur[2000000];
int main()
{
int n, cate=0, i, j;
in >> n;
for(i=2;i<=n;i++)
if(ciur[i]==0)
for(j=i*i;j<=n;j+=i)
ciur[j]=1;
for(i=2;i<=n;i++)
if(ciur[i]==0)
cate++;
out << cate;
in.close();
out.close();
return 0;
}