Cod sursa(job #1616544)
Utilizator | Data | 27 februarie 2016 11:27:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#include <bitset>
#include <cmath>
using namespace std;
bitset <2000005> v;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>>n;
v[1]=1;
for(int i=2;i<=sqrt(n);++i)
{
for(int j=2;j<=n/i;++j)
{
v[j*i]=1;
}
}
int s=1;
for(int i=3;i<=n;++i)
{
if(v[i]==0) s++;
}
g<<s;
return 0;
}