Pagini recente » Cod sursa (job #1646618) | Cod sursa (job #2553791) | Cod sursa (job #21098) | Cod sursa (job #1363568) | Cod sursa (job #778087)
Cod sursa(job #778087)
#include <cstdio>
using namespace std;
const int N = 25;
int n, m;
int v[N];
bool viz[N];
void afiseaza()
{
for (int i = 1; i <= m; ++i)
printf("%d ", v[i]);
printf("\n");
}
void back(int k)
{
if (k > m)
afiseaza();
else
for (int i = v[k - 1] + 1; i <= n; ++i) {
if (!viz[i]) {
viz[i] = true;
v[k] = i;
back(k + 1);
viz[i] = false;
}
}
}
int main()
{
freopen ("combinari.in", "r", stdin);
freopen ("combinari.out", "w", stdout);
scanf("%d %d", &n, &m);
back(1);
}