Cod sursa(job #3005550)
Utilizator | Data | 17 martie 2023 08:40:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, i, j;
bitset <2000000> a;
int main()
{
fin >> n;
a[1]=1;
for (i=2; i*i<=n; i++) {
if(a[i]==0) {
for (j=i*i; j<=n; j+=i) a[j]=1;
}
}
for (i=2; i<=n; i++) {
if (a[i]==0) fout << i << " ";
}
}