Pagini recente » Borderou de evaluare (job #1989364) | Borderou de evaluare (job #505639) | Borderou de evaluare (job #1545064) | Borderou de evaluare (job #1791590) | Cod sursa (job #220113)
Cod sursa(job #220113)
#include<stdio.h>
int n,m,a[100];
void back(int k)
{
int j,i;
if(k-1==m)
{
for(j=1;j<=m;j++)
{
printf("%d",a[j]);
}
printf(" \n");
}
else
{
for(i=a[k-1]+1;i<=n-m+k;i++)
{
a[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;
}