Cod sursa(job #2026924)
| Utilizator | Data | 25 septembrie 2017 12:53:16 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#define var auto
std::ifstream in("combinari.in");
std::ofstream out("combinari.out");
int n, m, *sol;
void TrackBack(int k)
{
if (k == m)
{
for (int i = 0; i < m; ++i)
out << sol[i] << ' ';
out << '\n';
return;
}
for (int v = (k == 0) ? 0 : sol[k - 1]; v < n; ++v)
{
sol[k] = v + 1;
bacc(k + 1);
}
}
int main()
{
in >> n >> m;
sol = new int[m];
TrackBack(0);
}
