Cod sursa(job #2636521)
Utilizator | Data | 18 iulie 2020 15:56:07 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
using namespace std;
int n, k;
int v[19];
void combinari(int pos)
{
if (pos == k + 1)
{
for (int i = 1; i <= k; i++)
cout << v[i] << " ";
cout << '\n';
}
else
for (int i = v[pos - 1] + 1; i <= n; i++)
v[pos] = i, combinari(pos + 1);
}
int main()
{
cin >> n >> k;
combinari(1);
return 0;
}