Cod sursa(job #633065)

Utilizator lox010Andrei Ion lox010 Data 12 noiembrie 2011 22:20:54
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
# include <iostream>
# include <conio.h>
# include<fstream>
# include <stdio.h>

using namespace std;

void main ()
{
	ifstream filein;
	ofstream fileout;
	filein.open ( "ciur.in" ) ;
	fileout.open ( "ciur.out" );

	int v[100], p[500];
	int n, i, j;
	filein >> n;

	for ( i = 2; i < n; i++ )
		v[i] = 1;

	for ( i = 2; i <= n; i++ )
		if ( v[i] == 1 )
			for ( j = i; i * j <= n; j++ )
				v[i*j] = 0;
	j = 0;
	fileout << "Numerele prime pana la " << n << " sunt: " << endl;
	for ( i = 2; i <= n; i++ )
		if ( v[i] )
		{
			p[j] = i;
			fileout << p[j] << ' ';
			j++;
			
		}
getch();
}