Cod sursa(job #1156131)
| Utilizator | Data | 27 martie 2014 14:14:38 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <vector>
#include <math.h>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,contor;
std::bitset<2000005> k;
int main()
{
fin>>n;
contor = 1;
for(int i=3;i<=sqrt(n);i+=2)
{
if(!k[i])
{
for(int j=i*i;j<=n;j+=i)k[j]=true;
}
}
for(int i=3;i<=n;i+=2)
{
if(!k[i])contor++;
}
fout<<contor;
return 0;
}
