Cod sursa(job #1528019)
| Utilizator | Data | 18 noiembrie 2015 22:47:21 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int N,M,X[10];
bool valid(int k)
{
return (X[k]>X[k-1]);
}
bool solutie(int k)
{
return (k==M);
}
void Print(int k)
{
for(int i=1;i<=k;++i)
fout<<X[i]<<" ";
fout<<"\n";
}
void backtr(int k)
{
for(int i=1;i<=N;++i)
{
X[k]=i;
if(valid(k))
{
if(solutie(k))
Print(k);
else
backtr(k+1);
}
}
}
int main()
{
fin>>N>>M;
backtr(1);
fin.close();
fout.close();
return 0;
}
