Cod sursa(job #412138)
Utilizator | Data | 5 martie 2010 13:08:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
#define nmax 2000001
char ciur[nmax];
int main()
{
long long n,s=0,i;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2;i<=n;++i) ciur[i]=1;
for(i=2;i<=n;++i)
if(ciur[i]) {
++s;
for(long long j=i;j<=n;j+=i) ciur[j]=0;
}
fout<<s;
fin.close();
fout.close();
return 0;
}