Pagini recente » Cod sursa (job #51654) | Monitorul de evaluare | Cod sursa (job #1895876) | Cod sursa (job #2156082) | Cod sursa (job #277951)
Cod sursa(job #277951)
#include<stdio.h>
int a[19],b[19];
void back(int k,int len,int max)
{
if(k-1 == max)
{
for(int i = 1; i <= max;i++)
printf("%d ",a[i]);
printf("\n");
}
else
{
for(int i = 1; i <= len; i++)
{ if(!b[i] && a[k-1] < i)
{
a[k] = i;
b[i] = 1;
back(k+1,len,max);
b[i] = 0;
}
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
int n,p;
scanf("%d %d",&n,&p);
back(1,n,p);
fclose(stdin); fclose(stdout);
return 0;
}