Cod sursa(job #1964759)
Utilizator | Data | 13 aprilie 2017 17:31:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 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;
f>>n;
int cont=0;
for(int i=2; i*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){
++cont;
}
}
g<<cont;
return 0;
}