Cod sursa(job #2428473)
| Utilizator | Data | 5 iunie 2019 15:03:23 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream cin ("combinari.in");
ofstream cout ("combinari.out");
int n,k,sol[20];
void afisare()
{
for (int i=1;i<=k;i++)
{
cout << sol[i] << " ";
}
cout << '\n';
}
bool verif(int poz)
{
for (int i=1;i<poz;i++)
{
if (sol[i]>=sol[poz]) return false;
}
return true;
}
void bkt(int poz)
{
if (poz>k) afisare();
else
{
for (int i=1;i<=n;i++)
{
sol[poz]=i;
if (verif(poz)==true) bkt(poz+1);
}
}
}
int main()
{
cin >> n >> k;
bkt(1);
}
