Cod sursa(job #709211)
Utilizator | Data | 7 martie 2012 20:18:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long n;
bool x[2000000];
int ciur(int n)
{
int i,j,cont=0;
for(i=0;i<=n;i++) {x[i]=true;}
for(i=2;i<=n;i++)
if(x[i]==true)
{
cont++;
for(j=i+i;j<=n;j+=i) { x[j]=false; }
}
return cont;
}
int main()
{
fin>>n;
fout<<ciur(n);
return 0;
}