Cod sursa(job #1471597)
Utilizator | Data | 14 august 2015 16:28:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool v[2000001];
int main()
{
int n,i,j;
in>>n;
for (i=2; i<=n; i++)
v[i]=1;
for (i=2; i<=sqrt(n); i++)
if (v[i]!=0)
for (j=2; j<=n/i; j++)
v[i*j]=0;
for (i=2; i<=n; i++)
if (v[i]==1)
out<<i<<" ";
return 0;
}