Cod sursa(job #3210608)
Utilizator | Data | 6 martie 2024 20:52:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset <2000100> a;
int n,cnt;
int main()
{
fin>>n;
for (int i=2;i<=n;i++)
{
if (a[i]==0)
{
cnt++;
for (int j=2*i;j<=n;j=j+i)
a[j]=1;
}
}
fout<<cnt;
}