Cod sursa(job #2364707)
Utilizator | Imbuzan Radu ImbuzanRadu | Data | 4 martie 2019 10:33:42 |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | pregatire_cls12_oji | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
std::ifstream f("combinari.in");
std::ofstream g("combinari.out");
using namespace std;
int n,k, sol[1000];
void afisare()
{
for(int i = 1; i <= k; i++)
g<<sol[i]<<" ";
g<<'\n';
}
void bk(int p)
{
for(int i = p + 1; i <= n; i++)
{
sol[p] = i;
if(p < k)
bk(p + 1);
else afisare();
}
}
int main()
{
f>>n>>k;
bk(1);
return 0;
}