Cod sursa(job #1317832)
Utilizator | Data | 15 ianuarie 2015 11:27:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include<fstream>
#define NMAX 2000005
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{ int ciur[NMAX],n,i,j;
cout<<"n= ";cin>>n;
for (i=2;i<n;i++)
ciur[i]=1;
for (i=2;i*i<=n;i++)
if (ciur[i])
for (j=2;j*i<n;j++)
ciur[i*j]=0;
for (i=2;i<n;i++)
if (ciur[i]) cout<<i<<' ';
return 0;
}