Pagini recente » Cod sursa (job #1555266) | Cod sursa (job #444378) | Cod sursa (job #2773752) | Cod sursa (job #333597) | Cod sursa (job #605378)
Cod sursa(job #605378)
#include<cstdio>
int n,k,x[20];
void back(int,int);
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
back(1,0);
return 0;
}
void back(int v, int p)
{
//d=n-v+1
//r=k-p
if(p==k)
{
for(int j=1;j<k;j++)printf("%d ",x[j]);printf("%d\n",x[k]);return;
}
if(n-v+1==k-p)
{
x[p+1]=v;back(v+1,p+1);return;
}
x[p+1]=v;back(v+1,p+1);
back(v+1,p);
}