Pagini recente » Borderou de evaluare (job #1988586) | Borderou de evaluare (job #3188711) | Cod sursa (job #2298037) | Cod sursa (job #612501) | Cod sursa (job #279906)
Cod sursa(job #279906)
#include<iostream.h>
int n,st[10];
int valid(int p)
{
if(p>1)
for(int i=1;i<p;i++)
if(st[i]==st[p])
return 0;
return 1;
}
void bkt(int p)
{
for(int val=1;val<=n;val++)
{
st[p]=val;
if(valid(p)==1)
if(p==n)
{
for(int i=1;i<=n;i++) cout<<st[i]<<" ";
cout<<endl;
}
else bkt(p+1);
}
}
void main()
{
cin>>n;
bkt(1);
}