Cod sursa(job #2644765)
Utilizator | Nastasa-Baras Luca Lolluckestar | Data | 25 august 2020 21:56:28 |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
using namespace std;
int n, m, st[101], fol[101];
void afisare()
{
for (int i = 1; i <= m; i++)
cout << st[i] << ' ';
cout << endl;
}
void generare(int k)
{
if (k == m + 1)
afisare();
else
for (int i = 1; i <= n; i++)
if (fol[i] == 0 && i > st[k - 1])
{
st[k] = i;
fol[i] = 1;
generare(k + 1);
fol[i] = 0;
}
}
int main()
{
cin >> n >> m;
generare(1);
}