Cod sursa(job #2443392)
| Utilizator | Data | 27 iulie 2019 18:48:01 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
bool viz[100];
int st[100], n, m;
void Backtracking(int k, int m)
{
if(k == m + 1)
{
for(int i = 1; i <= m; ++i)
fout << st[i] << " ";
fout << "\n";
}
else
{
for(int i = st[k - 1] + 1; i <= n; ++i)
{
st[k] = i;
Backtracking(k + 1, m);
st[k] = 0;
}
}
}
int main()
{
fin >> n >> m;
Backtracking(1, m);
return 0;
}
