Cod sursa(job #282015)
Utilizator | Data | 16 martie 2009 19:16:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
using namespace std;
long int n;
char ciur[2000002];
int main()
{
int k,i,j;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;k=0;
for(i=2;i<=n;i++)
if(ciur[i]==0)
{
k++;
for(j=i+i;j<=n;j=j+i)
ciur[j]=1;
}
fout<<k;
return 0;
}