Cod sursa(job #411282)
Utilizator | Data | 4 martie 2010 20:12:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
char ciur[2000001];
int main()
{
long long n,s=0,i;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
fi>>n;
for(i=2;i<=n;++i) ++ciur[i];
for(i=2;i<=n;++i)
if(ciur[i]) {
++s;
for(long long j=i;j<=n;j+=i) ciur[j]=0;
}
fo<<s;
fi.close();
fo.close();
return 0;
}