Cod sursa(job #2847036)
| Utilizator | Data | 10 februarie 2022 05:42:53 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<bits/stdc++.h>
using namespace std;
const int Max = 2e6 + 1;
#define int long long
void nos()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int n;
bool a[Max];
void solve()
{
cin >> n;
for(int d=2;d*d<=n;d++)
if(a[d] == 0)
for(int i=d*d;i<=n;i+=d)
a[i] = 1;
for(int i=2;i<=50;i++)
if(a[i] == 0)
cout<<i<<" ";
}
int32_t main()
{
solve();
return 0;
}