Cod sursa(job #2855421)
Utilizator | Data | 22 februarie 2022 13:49:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
bitset <2000001> a;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{ int n,i,j,c=0;
f>>n;
a[0]=a[1]=1;
for(i=2;i<=2000000;i++)
{
if(a[i]==0)
{
for(j=i*2;j<=2000000;j+=i)
a[j]=1;
}
}
for(i=1;i<=n;i++)
{
if(a[i]==0)
c++;
}
g<<c;
return 0;
}