Cod sursa(job #1308445)
Utilizator | Data | 4 ianuarie 2015 02:34:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define nmax 2000005
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int v[nmax];
int i, n, j;
int main(){
fin >> n;
for(i=2; i<=n; i++)
if(v[i]==0)
for(j=i*2; j<=n; j+=i) v[j]=1;
for(i=2; i<=n; i++)
if (v[i]!=1) fout << i << " ";
return 0;
}