Cod sursa(job #693762)
Utilizator | Data | 27 februarie 2012 16:27:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
using namespace std;
int p=1,n,i,j, c[2000001];
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{ in>>n;
for (i=3;i<=n;i=i+2)
{ if (c[i] == 0)
{ p++;
for (j=i+i;j<=n;j=j+ i)
c[j] = 1;}}
out<<p;
return 0;
}