Cod sursa(job #2398455)
| Utilizator | Data | 5 aprilie 2019 15:42:06 | |
|---|---|---|---|
| Problema | Combinari | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n, k, sol[20];
void bkt(int poz);
int main()
{
cin >> n >> k;
bkt(1);
return 0;
}
void bkt(int poz)
{
if(poz == k + 1)
{
for(int i = 1; i <= k; i++)
cout << sol[i] << " ";
cout << endl;
}
else
{
for(int i = sol[poz - 1] + 1; i <= n; i++)
{
sol[poz] = i;
bkt(poz + 1);
sol[poz] = 0;
}
}
}
