Pagini recente » Cod sursa (job #2950932) | Cod sursa (job #2340208) | Cod sursa (job #2369396) | Cod sursa (job #1725889) | Cod sursa (job #651798)
Cod sursa(job #651798)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k,sol[20];
int afisare()
{
for(int i=1;i<=k;i++)
out<<sol[i]<<" ";
out<<"\n";
}
bool valid(int p)
{
if(sol[p]<=sol[p-1])
return false;
return true;
}
void bkt(int p)
{
if(p-1==k)
{
afisare();
return ;
}
for(int i=1;i<=n;i++){
sol[p]=i;
if(sol[p]>sol[p-1])
bkt(p+1);
}
}
int main()
{
in>>n>>k;
bkt(1);
return 0;
}