Cod sursa(job #1826332)
Utilizator | Data | 10 decembrie 2016 12:44:49 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
short n, k, combi[19];
void scrie()
{
for(int i=1; i<=k; i++)
fout<<combi[i]<<' ';
fout<<endl;
}
bool valid(short u, short i)
{
for(int j=1; j<u; j++)
if(combi[j]>=i)
return false;
return true;
}
short backtrack(short u)
{
if(u<=k)
{
bool flag=true;
for(short i=u; i<=n; i++)
if(valid(u, i))
{
combi[u]=i;
if(u==k)
scrie();
backtrack(u+1);
}
}
}
int main()
{
fin>>n>>k;
backtrack(1);
}