Cod sursa(job #2322081)
| Utilizator | Data | 17 ianuarie 2019 12:19:47 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, m, x[25];
void afisare()
{
for(int i = 1; i <= m; i ++)
g << x[i] << " ";
g << "\n";
}
bool valid(int k)
{
if(x[k] > x[k - 1])return true;
return false;
}
void backtrack(int k)
{
for(int i = 1; i <= n; i ++)
{
x[k] = i;
if(valid(k))
{
if(k == m)afisare();
else backtrack(k + 1);
}
}
}
int main()
{
f >> n >> m;
backtrack(1);
return 0;
}
