Cod sursa(job #3123523)
Utilizator | Buzdugan Rares Andrei Buzdi | Data | 24 aprilie 2023 12:18:25 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#define ll long long
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n, K;
int x[19];
void Afisare()
{
for(int i = 1; i <= K; i++)
cout << x[i] << ' ';
cout << '\n';
}
void back(int k)
{
for(int i = x[k - 1] + 1; i <= n; i++)
{
x[k] = i;
if(k == K)
Afisare();
else
back(k + 1);
}
}
int main()
{
cin >> n >> K;
back(1);
return 0;
}