Cod sursa(job #2980461)
Utilizator | Dinca Robert sLinX | Data | 16 februarie 2023 15:41:30 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k, v[20], sol[20];
void Afisare()
{
for(int i =1; i<=k; i++)
fout << sol[i] << ' ';
fout << '\n';
}
void Bkt(int pos, int last)
{
for(int i =last+1 ; i <= n; i++)
{
if(v[i] == 1)continue;
else
{
v[i] = 1;
sol[pos] = i;
if(pos == k)Afisare();
else Bkt(pos+1, i);
v[i] = 0 ;
sol[pos] = 0;
}
}
}
int main()
{
fin >> n >> k;
Bkt(1,0);
return 0;
}