Cod sursa(job #2245218)
Utilizator | Data | 24 septembrie 2018 21:07:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int a[2000000];
int nr=0,n=2000000,i,j,x;
int main()
{ f>>x;
for (int i=2;i<=n;i++)
a[i]=1;
for (i=2;i<=sqrt(n);i++)
if (a[i]!=0)
for (j=2;j<=n/i;j++)
a[i*j] = 0;
for(i=2;i<=x;i++)
if (a[i]==1)
g<<i<<" ";
return 0;
}