Pagini recente » Cod sursa (job #1557150) | Cod sursa (job #3005158) | Cod sursa (job #2109912) | Cod sursa (job #687431) | Cod sursa (job #274020)
Cod sursa(job #274020)
#include <stdio.h>
int st[25], n, m;
int valid(int k)
{
for(register int i = 1; i < k; i++)
if(st[i] >= st[k])
return 0;
return 1;
}
void print(void)
{
for(register int i = 1; i <= m; i++)
printf("%d ",st[i]);
printf("\n");
}
void back(int k)
{
for(register int i = st[k-1] + 1; i <= n; i++)
{
st[k] = i;
if(valid(k))
if(k == m)
print();
else
back(k+1);
}
}
int main(void)
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d", &n, &m);
st[0] = 0;
back(1);
fcloseall();
return 0;
}