Cod sursa(job #1510960)
Utilizator | Data | 25 octombrie 2015 20:40:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 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];
int n, j, s;
int main()
{
fin >> n;
for(i = 2 ; i <= n ; i++)
{
if((a[(i>>3)]&(1<<(i&7))) == 0)
{
s++;
for(j = i * i ; j <= n ; j += i)
a[j>>3] |= (1<<(j & 7));
}
}
fout << s << "\n";
}