Cod sursa(job #1498129)
Utilizator | Data | 7 octombrie 2015 23:16:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool ok[2000005];
int n,i,j,contor;
int era(int n){
for(i=2;i<=n;i++){
if(ok[i]==0){
++contor;
for(j=i+i;j<=n;j+=i){
if(j>n)
break;
ok[j]=1;
}
}
}
return contor;
}
int main()
{
f>>n;
g<<era(n);
return 0;
}