Pagini recente » Cod sursa (job #2718926) | Cod sursa (job #1620953) | Cod sursa (job #864919) | Cod sursa (job #1779161) | Cod sursa (job #881411)
Cod sursa(job #881411)
#include<cstdio>
using namespace std;
int n,i=1,x[20];
bool bun(int a)
{
for(int i=1;i<a;++i)
if(x[i]==x[a])
return 0;
return 1;
}
void bkt()
{
if(i>n)
{
for(int j=1;j<=n;++j)
printf("%d ",x[j]);
printf("\n");
}
for(int k=1;k<=n;++k)
{
x[i]=k;
if(bun(i))
++i,bkt(),--i;
}
}
int main()
{
freopen("combinari.in","r",stdin);freopen("combinari.out","w",stdout);
scanf("%d",&n);
bkt();
}