Cod sursa(job #2664434)
Utilizator | Data | 28 octombrie 2020 17:19:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bitset <2000005> V;
int n;
int main()
{
f>>n;
if(n<2)
{
g<<0;
return 0;
}
for(int i=4; i<=n; i+=2)
V[i]=true;
int cnt=1;
for(int i=3; i<=n; i+=2)
if(!V[i])
{
cnt++;
for(int j=2; i*j<=n; j++)
V[i*j]=true;
}
g<<cnt;
return 0;
}