Pagini recente » Borderou de evaluare (job #2619662) | Cod sursa (job #79156) | Cod sursa (job #814073) | Cod sursa (job #38229) | Cod sursa (job #741043)
Cod sursa(job #741043)
#include<stdio.h>
int v[20],n,t;
void back ( int k )
{
if(k>t)
{
for(register int i=1; i<=t; ++i )
printf("%d ",v[i]);
printf("\n");
}
else
{
if(v[k-1]!=n)
for(register int i=v[k-1]+1 ; i<= n; ++i)
{
v[k]=i;
back(k+1);
}
}
}
int main ()
{
freopen("comb.in","r",stdin);
freopen("comb.out","w",stdout);
scanf("%d%d",&n,&t);
back ( 1 );
return 0;
}