Cod sursa(job #556021)

Utilizator spadasinoIulian spadasino Data 15 martie 2011 21:30:41
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.53 kb
#include "stdafx.h"
#include<iostream>
#include<math.h>
#include<stdio.h>
using namespace std;

int prim (int x)
{
int d;

for(d=2;d<=x/2;d++)
if(x%d==0) return 0;

return 1;

}

int main()
{int v[100],i,n,j;
	
freopen("nr.txt","r",stdin);
cin>>n;
    
     
	for(i=2;i<=n;i++)
		v[i]=1;

	for(i=2;i<=n;i++)
	{ 
	if( prim(i)==1 ) for(j=i+1;j<=n;j++)
		               if(j%i==0) v[j]=0;
	  
	}
for(i=2;i<=n;i++)
cout<<i<<" ";

cout<< endl;

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

cin>>i;
return 0;


}