Cod sursa(job #1584506)
Utilizator | Data | 30 ianuarie 2016 10:59:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <bitset>
const int N=2000000;
using namespace std;
ifstream fin("ciur.in");
ofstream cout("ciur.out");
int main(){
int n,k=0;
fin>>n;
bitset<N> ciur;
ciur.set(); // 1
for(int i=2;i<=n;i++)
if(ciur[i]==1){k++;
for(int j=i+i;j<=n;j+=i)ciur[j]=0;
}
cout<<k<<" ";
}