Cod sursa(job #1645470)
Utilizator | Data | 10 martie 2016 12:27:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
bool ciur[2000000];
void stuff(int n){
for(int i=2;i<n;i++){
for(int j=i;j<n;j+=i){
ciur[j]=false;
}
}
}
int main() {
for(int i=0; i<n; i++)
ciur[i]=true;
fin>>n;
stuff(n);
int cnt=0;
for(int i=0;i<n;i++){
if(ciur[i]==true)
cnt++;
}
fout<<cnt;
return 0;
}