Cod sursa(job #2908817)
Utilizator | Data | 6 iunie 2022 00:21:14 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n, k;
int x[16];
void afis();
void back(int p);
int main()
{
cin >> n >> k;
back(1);
return 0;
}
void afis()
{
for (int i = 1; i <= k; i++)
cout << x[i] << ' ';
cout << '\n';
}
void back(int p)
{
for (int i = x[p - 1] + 1; i <= n; i++)
{
x[p] = i;
if (p == k) afis();
else back(p + 1);
}
}