Pagini recente » Cod sursa (job #380711) | Cod sursa (job #1833223) | Cod sursa (job #1842506) | Cod sursa (job #2285035) | Cod sursa (job #873118)
Cod sursa(job #873118)
#include<stdio.h>
int x[18],k,n;
int verificare(int f)
{
int i;
for(i=1;i<=f-1;i++)
if(x[i]==x[f]) return 0;
for(i=1;i<=f-1;i++)
if(x[i]>x[i+1]) return 0;
return 1;
}
void back(int f)
{
int i;
if(f==k+1)
{
for(i=1;i<=k;i++)
printf("%d ",x[i]);
printf("\n");
}
else
{
for(i=1;i<=n;i++)
{
x[f]=i;
if(verificare(f)==1) back(f+1);
}
}
}
int main()
{
freopen("combinari.in","rt",stdin);
freopen("combinari.out","wt",stdout);
scanf("%d%d",&n,&k);
back(1);
}