Pagini recente » Borderou de evaluare (job #2506699) | Cod sursa (job #2392769) | Borderou de evaluare (job #2699612) | Cod sursa (job #2450652) | Cod sursa (job #875477)
Cod sursa(job #875477)
#include <fstream>
#include <bitset>
using namespace std;
int main() {
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n; cin >> n;
bitset<2000001> sieve;
for (int i=3,j; i<=n; ) {
for (j=i+i+i; j<=n; j+=(i<<1))
sieve.set(j);
while ((i+=2)<=n && sieve[i]);
}
cout << n-n/2-sieve.count();//1 mark,2 not mark
return 0;
}