Cod sursa(job #2122690)
| Utilizator | Data | 5 februarie 2018 13:35:45 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#define st short
#define lim 18
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
st n, m, x[lim];
void afisare(int n)
{
for (int i = 1; i <= n; ++i)
g << x[i] << ' ';
g << '\n';
}
void backtrack(int k)
{
for (int i = x[k-1]+1; i <= n; ++i)
{
x[k] = i;
if (k == m)
afisare(m);
else backtrack(k+1);
}
}
int main()
{
f >> n >> m;
backtrack(1);
return 0;
}
