Cod sursa(job #1861136)

Utilizator shantih1Alex S Hill shantih1 Data 28 ianuarie 2017 17:02:21
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.52 kb
#include <fstream>
#include <iostream>
#include <cmath>
using namespace std;

ifstream fin("ciur.in");
ofstream fout("ciur.out");

int n, i, j, s, nr, k;

int main() {

    fin>>n;
    int v[n+1];
    for (i=2; i<=n; i++)    v[i]=i;
    
    for (i=2; i<=n; i++)
    {
        if (v[i]!=0 && i*i<=n)
        {
            for (j=i*2; j<=n; j+=i)   v[j]=0;
            //for (j=2; j<=n; j++)    fout << v[j] << " ";
            //fout << "\n";
        }
    }
    
    for (i=2; i<=n; i++)
        if (v[i]!=0)    fout << v[i] << " ";
}