Cod sursa(job #1510963)
| Utilizator | Data | 25 octombrie 2015 20:45:58 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
#define MAX 2000100
int i;
char a[MAX / 8 + 5];
int n, s;
long long j;
int main()
{
// cout << sizeof(a) << " ";
fin >> n;
for(i = 2 ; i <= n ; i++)
{
if((a[i>>3]&(1<<(i&7))) == 0)
{
// cout << i << " ";
s++;
for(j = 1LL * i * i ; j <= n ; j += i)
a[j>>3] |= (1<<(j & 7));
}
}
fout << s << "\n";
}
