Cod sursa(job #3274049)
Utilizator | Data | 4 februarie 2025 21:21:11 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int n, k, v[20];
void afis()
{
for (int i = 1; i <= k; i++)
fout << v[i] << " ";
fout << '\n';
}
void bt(int h)
{
if (h > k)
afis();
else
for (int i = 1; i <= n; i++)
{
v[h] = i;
if (v[h] > v[h - 1])
bt(h + 1);
}
}
int main()
{
fin >> n >> k;
bt(1);
return 0;
}