Cod sursa(job #475321)
Utilizator | Data | 6 august 2010 16:51:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream.h>
ifstream f("ciur.in"); ofstream g("ciur.out");
long x[100],i,n,k,j,mk,c;
int main(){
f>>n;
for(i=2;i<=n;i++)
x[i]=i;
i=2;
while(i<=n/2){
mk=i;
while(mk<=n){
x[mk]=0;
mk+=i;
}
do{
i++;
}while(x[i]!=0);
}
for(i=1;i<=n;i++)
if(x[i]!=0)
c++;
g<<c;
f.close();g.close();
return 0;
}