Cod sursa(job #2927733)
Utilizator | Data | 21 octombrie 2022 11:13:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <iostream>
#include <bitset>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
const int NMAX = 2e6;
bitset<NMAX+1> c;
int main()
{
for(int i=2; i*i<=NMAX; i++)
if(!c[i])
for(int j=i*i; j<=NMAX; j+=i)
c[j] = 1;
int n, cnt=0;
f>>n;
for(int i=2; i<=n; i++)
if(c[i] == 0)
cnt++;
g<<cnt;
return 0;
}