Cod sursa(job #870964)
Utilizator | Data | 4 februarie 2013 10:21:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int main (){
long long n,i,j,m=0;
char prim[2000005];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for (i=2;i<=n;i++){
prim[i]=1;
}
for (i=2;i<=n;i++){
if (prim[i]==1){
m++;
for (j=i*i;j<=n;j=j+i){
prim[j]=0;
}
}
}
fout<<m;
return 0;
}