Pagini recente » Cod sursa (job #863646) | Cod sursa (job #2466916) | Cod sursa (job #3219781) | Cod sursa (job #2956537) | Cod sursa (job #270019)
Cod sursa(job #270019)
#include <cstdio>
#define FIN "combinari.in"
#define FOUT "combinari.out"
#define N 30
int n,v[N],k;
void read()
{
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
scanf("%d %d", &n, &k);
}
void write()
{
for (int i = 1; i < k; ++i)
printf("%d ", v[i]);
printf("%d\n", v[k]);
}
void solve(int u ,int l)
{
if (l == k)
{
write();
return;
}
for (int i = u + 1; i <= n; ++i)
{
v[l + 1] = i;
solve(i, l + 1);
}
return;
}
int main()
{
read();
for (int i = 1; i <= n - k + 1; ++i)
{
v[1] = i;
solve(i, 1);
}
}