Cod sursa(job #1236577)
| Utilizator | Data | 2 octombrie 2014 09:29:44 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long n,i,j,nr;
bool Ok[2000000];
int main(){
f>>n;
for(i=1;i<=n;i++) Ok[i]=true;
for(i=2;i*i<n;i++){
if(Ok[i]) {for(j=i*i;j<=n;j+=i) Ok[j]=false;}
}
for(i=2;i<=n;i++) {if(Ok[i]) nr++;}
g<<nr;
return 0;
}
