Cod sursa(job #1494933)
Utilizator | Data | 1 octombrie 2015 23:56:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bitset <2000005> v;
int ciur(int n)
{
int nr = 1;
for(int i = 3; i <= n ; i += 2){
if(v[i] == 0){
nr ++;
for(int j = 3*i; j <= n;j += i << 1)
v[j] = 1;
}
}
return nr;
}
int main()
{
int n;
fin >> n;
fout << ciur(n);
return 0;
}