Merge bine pentru n mai mic decat 6.
#include <iostream>
#include <cmath>
using namespace std;
int n,i,nr,aux,x,ok;
int prim(int y)
{
while (y)
{
int d;
if (y>=2)
{
for (d=2;d<=sqrt(y);d++)
if (y%d==0)
{
return 0;
}
}
y/=10;
}
if (y==0)
return 1;
}
int main()
{
cin>>n;
x=2;
for (i=1;i<n;i++)
x=x*10;
for (aux=x;aux<x*5;aux++)
{
if (aux%2)
{
ok=prim(aux);
if (ok)
cout<<aux<<" ";
}
}
return 0;
}
