Cod sursa(job #2133806)
Utilizator | Data | 17 februarie 2018 12:20:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, i, j, sol;
bitset <2000002>v;
int main(){
fin>>n;
for(i=2; i<=n; i++){
if(v[i]==0){
sol++;
for(j=i+i; j<=n; j=j+i){
v[j]=1;
}
}
}
fout<<sol;
}