Cod sursa(job #2782593)
Utilizator | Data | 12 octombrie 2021 19:13:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <bitset>
using namespace std;
int n,cnt=0;
bitset <2000001> v;
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
cin>>n;
for(int i=2;i*i<=n;i++)
if(v[i]==0)
for(int j=i*i;j<=n;j+=i)
v[j]=1;
for(int i=2;i<=n;i++)
if(v[i]==0)
cnt++;
cout<<cnt;
return 0;
}