Cod sursa(job #2571295)
Utilizator | Data | 4 martie 2020 22:10:34 | |
---|---|---|---|
Problema | Combinari | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, p, v[16];
int solutie(int k)
{
return k == p;
}
void afisare(int k)
{
for(int i = 1; i <= k; i++) g << v[i] << " ";
g << endl;
}
void bk(int k)
{
int i;
for(i = v[k-1]+1; i <= n;i ++)
{
v[k] = i;
if(solutie(k)) afisare(k);
else
bk(k+1);
}
}
int main()
{
f >> n >> p;
bk(1);
return 0;
}