Cod sursa(job #2618349)
Utilizator | Angelescu Andreea AndreeaChitu | Data | 24 mai 2020 18:27:33 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
//#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream cin("ciur.in");
ofstream cout(" ciur.out");
long long int bun[100000], i, n, nr=0;
cin >> n;
for(i=2; i<=10000; i++)
bun[i] = true;
for(i = 2; i<=10000; i++)
{
if(bun[i]==true)
{
for(int j=2; j*i<=10000; j++)
bun[i*j]= false;
}
}
for( i=2; i<=n; i++)
if(bun[i])
cout << i << " ";
// cout << nr;
cin.close();
cout.close();
return 0;
}