Cod sursa(job #1486347)
Utilizator | Data | 14 septembrie 2015 18:32:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset<2000001>v;
inline void ciur(int n,int &p)
{
int i,j;
for(i=3;i*i<=n;i+=2)
{
if(v[i]==0)
{
for(j=i*i;j<=n;j+=i) v[j]=1;
}
}
p=1;
for(i=3;i<=n;i+=2)
{
if(v[i]==0) p++;
}
}
int main()
{
int n,p=0;
fin>>n;
ciur(n,p);
fout<<p;
}