Cod sursa(job #1158928)
Utilizator | Data | 29 martie 2014 10:50:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int n,i,j,b[1000000],p;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
int main(){
fi >> n;
for(i=2;i<=n;i++){
if(b[i] != 1) {
p++;
b[i]=1;
j=i;
while(j<=n){
j+=i;
if(b[j] != 1) b[j] = 1;
}
}
}
fo << p;
return 0;
}