Cod sursa(job #2374906)
Utilizator | Data | 7 martie 2019 21:11:17 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | pregatire_cls10_oji | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, st[20];
void BK(int p)
{
if(p == k + 1)
{
for(int i = 1; i <= k; ++ i)
fout << st[i] <<' ';
fout <<'\n';
}
else
{
for(int i = 1 + st[p-1]; i <= n; ++ i)
{
st[p] = i;
BK(p+1);
}
}
}
int main()
{
fin >> n >> k;
BK(1);
return 0;
}