Cod sursa(job #556340)
Utilizator | Data | 16 martie 2011 08:45:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
int main(){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char ciur[200000];
int n,i,j,nr=0;
fin>>n;
for(i=2;i<n;i++) ciur[i]=1;
for(i=2;i*i<=n;i++)
if(ciur[i])
for(j=2;j*i<n;j++)
ciur[i*j]=0;
for(i=2;i<n;i++)
if(ciur[i]) nr++;
fout<<nr;
fin.close();
fout.close();
return 0;
}