Cod sursa(job #2525924)
| Utilizator | Data | 18 ianuarie 2020 00:35:21 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int n, k, sol[20];
bool ok (int poz)
{
for (int i=1; i<poz; i++)
if (sol[i] >= sol[poz])
return false;
return true;
}
void afisare ()
{
for (int i=1; i<=k; i++)
g << sol[i] << " ";
g << '\n';
}
void bkt (int poz)
{
for (int i=1; i<=n; i++)
{
sol[poz] = i;
if (ok(poz))
{
if (poz == k)
afisare();
else {
bkt(poz+1);
}
}
}
}
int main()
{
f >> n >> k;
bkt(1);
return 0;
}
