Cod sursa(job #1997713)
| Utilizator | Data | 5 iulie 2017 10:37:30 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int used[20], v[20];
int n, k;
void afisare()
{
for(int i = 1; i <= k; ++i)
fout << v[i] << ' ';
fout << '\n';
}
void bkt(int poz)
{
if(poz > k)
{
afisare();
return;
}
for(int i = v[poz - 1] + 1; i <= n; ++i)
if(!used[i])
{
v[poz] = i;
used[i] = 1;
bkt(poz + 1);
used[i] = 0;
}
}
int main()
{
fin >> n >> k;
bkt(1);
return 0;
}
