#include //Spiridon Rudolf void main() { int a,i=2,f,x=1,n; cout<<"Primele n numere prime"<>n; cout<<"2 "; while(x<=n-1) { f=2; while((f<=i)&&(i%f!=0)) { f++; if(i==f) { cout<