Cod sursa(job #2474696)
Utilizator | Data | 15 octombrie 2019 18:52:15 | |
---|---|---|---|
Problema | Combinari | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k;
int sol[20];
void Read()
{
fin >> n >> k;
fin.close();
}
void afisare()
{
for(int i = 1; i <= k; i++)
fout << sol[i] << " ";
fout << endl;
}
void bkt(int p)
{
for(int i = sol[p - 1] + 1; i <= n; i++)
{
sol[p] = i;
if(p == k)
afisare();
else bkt(p + 1);
}
}
int main()
{
Read();
bkt(1);
return 0;
}