Cod sursa(job #2068574)
| Utilizator | Data | 18 noiembrie 2017 09:23:47 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void bkt(int);
int n, m;
int sol[20];
bool uz[20];
int main()
{
fin >> n >> m;
bkt(1);
return 0;
}
void bkt(int k)
{
if (k == m + 1)
{
for (int i = 1; i <= m; i++)
fout << sol[i] << ' ';
fout << '\n';
}
else
{
for (int i = sol[k - 1] + 1; i <= n; i++)
if (!uz[i])
{
uz[i] = true;
sol[k] = i;
bkt(k + 1);
uz[i] = false;
}
}
}
