Pagini recente » Cod sursa (job #2650642) | Cod sursa (job #2177311) | Cod sursa (job #3268767) | Cod sursa (job #3279582) | Cod sursa (job #153581)
Cod sursa(job #153581)
#include<stdio.h>
int n,m,x[20];
void afis()
{
for (int i=1;i<=m;i++)
printf("%d ",x[i]);
printf("\n");
}
void back(int k)
{
if (k==m+1)
afis();
else
{
for (int i=x[k-1]+1;i<=n-m+k;i++)
{
x[k]=i;
back(k+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
back(1);
return 0;
}