Cod sursa(job #1964756)
Utilizator | Data | 13 aprilie 2017 17:29:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
bitset<2000001>pr;
int main(){
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nrprime=0;
f>>n;
for(int i=2;i<=n;++i){
if(pr[i]==0){
for(int j=i+i;j<=n;j+=i){
pr[j]=1;
}
}
}
for(int i=2;i<=n;++i){
if(pr[i]==0){
++nrprime;
}
}
g << nrprime;
return 0;
}