Cod sursa(job #2365763)
Utilizator | Data | 4 martie 2019 16:18:08 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | pregatire_cls12_oji | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
std::ifstream in("combinari.in");
std::ofstream out("combinari.out");
using namespace std;
int n ,k;
int sol[20];
bool esol(int t)
{
return (t == k);
}
void afis()
{
for(int i = 1;i<=k ; i++)
out<<sol[i]<<" ";
out<<'\n';
}
void backt(int t)
{
for(int i = sol[t-1] + 1; i <= n; i++)
{
sol[t] = i;
if(esol(t))
afis();
else backt(t+1);
}
}
int main()
{
in>>n>>k;
backt(1);
return 0;
}