Cod sursa(job #1126836)
Utilizator | Data | 27 februarie 2014 09:57:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
bool ciur[2000001];
int n,i,j,contor=0;
fin>>n;
for(i=2;i<=n;++i)
ciur[i]=true;
for(i=2;i<=n;++i)
if(ciur[i]==true)
for(j=i+i;j<=n;j=j+i)
ciur[j]=false;
for(i=2;i<=n;++i)
if(ciur[i]) contor++;
fout<<contor;
return 0;
}