Cod sursa(job #2292295)
| Utilizator | Data | 29 noiembrie 2018 12:22:35 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
short n, m, x[19];
void bkt(int k)
{
if(k-1 == m)
{
for(int i = 1; i <= m; i++) out << x[i] << ' ';
out << '\n';
}
else
for(int i = x[k-1]+1; i <= n-m+k; i++)
{
x[k] = i;
bkt(k+1);
}
}
int main()
{
ios_base::sync_with_stdio(0);
in.tie(0);
in >> n >> m;
bkt(1);
return 0;
}
