Cod sursa(job #3339583)
| Utilizator | Data | 8 februarie 2026 23:02:14 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,cnt=0;
bitset <2000005> A;
void ciur(int n)
{
for(int i=2;i<=n;i++)
{
if(A[i]==0)
{
cnt++;
for(int j=i*2;j<=n;j+=i)
A[j]=1;
}
}
fout<<cnt;
}
int main()
{
fin>>n;
ciur(n);
}
