Cod sursa(job #3286944)
Utilizator | Data | 14 martie 2025 20:38:57 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
#define cin fin
#define cout fout
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int MAX = 10;
int st[MAX], fre[MAX], n, k;
void afis()
{
for (int i = 1; i <= k; ++i)
cout << st[i] << " ";
cout << "\n";
}
void backt(int pos)
{
for (int i = st[pos-1]+1; i <= n; ++i)
{
st[pos] = i;
if (pos == k)
afis();
else
backt(pos+1);
}
}
int main()
{
cin >> n >> k;
backt(1);
return 0;
}