Cod sursa(job #1338064)
Utilizator | Data | 9 februarie 2015 19:21:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
#define N 2000000
using namespace std;
int main(){
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
long n,i,j;
bool ciur[N+1];
fin>>n;
for(i=1;i<=n;i++) ciur[i]=true;
int cnt=0;
for(i=2;i<=n;i++)
if(ciur[i]==true)
{ cnt++;
for(j=i+i;j<=n;j=j+i)
ciur[j]=false;
}
fout<<cnt;
fin.close();
fout.close();
//incarca l
return 0;
}