Cod sursa(job #1384974)
Utilizator | Data | 11 martie 2015 16:21:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#define MAXI 2000000
using namespace std;
char v[250010];
int i,j,n,nr;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
fin>>n;
for(i=2 ; i<=n ; ++i)
{
if(! ( (int)v[i/8] & (1 << (i % 8)) ))
{
for(j=i+i ; j<=n ; j+=i)
{
if(!( (int)v[j/8] & (1 << (j % 8))))
v[j/8]+=1 << (j % 8);
}
++nr;
}
}
fout<<nr;
return 0;
}