Cod sursa(job #3340071)
| Utilizator | Data | 11 februarie 2026 23:01:39 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <bitset>
#define M 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset <M> B;
int n,cnt=1;
int main()
{
fin>>n;
for(int j=4;j<=n;j+=2)
B[j]=1;
for(int i=3;i<=n;i++)
{
if(B[i]==0)
{
cnt++;
for(int j=i+i; j<=n; j+=i)
{
B[j]=1;
}
}
}
fout<<cnt;
return 0;
}
