Pagini recente » Cod sursa (job #2906064) | Cod sursa (job #2321855) | Cod sursa (job #1796689) | Cod sursa (job #177445) | Cod sursa (job #239898)
Cod sursa(job #239898)
#include <stdio.h>
int n, m, v [25];
void print ()
{
int i;
for (i=1; i<=m; ++i)
printf ("%d ", v [i]);
printf ("\n");
}
void comb (int k)
{
int c;
if (k == m+1)
{
print ();
return ;
}
for (c=v [k-1]+1; c<=n-(m-k); ++c)
{
v [k]=c;
comb (k+1);
}
}
int main ()
{
freopen ("combinari.in", "r", stdin);
freopen ("combinari.out", "w", stdout);
scanf ("%d%d", &n, &m);
comb (1);
return 0;
}