Cod sursa(job #1312233)
Utilizator | Data | 8 ianuarie 2015 23:55:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool a[2000001];
int64_t i, j, n;
int main()
{
f>>n;
for(i=2;i<=n;i++)
for(j=2;j*i<=n;j++)
if (i*j<2000000)
a[i*j]=true;
for(i=1;i<=n;i++)
if(!a[i]) g<<i<<' ';
return 0;
}