Pagini recente » Cod sursa (job #1648894) | Cod sursa (job #1269152) | Cod sursa (job #705747) | Cod sursa (job #2293459) | Cod sursa (job #3350161)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int solutie[20];
int visited[20];
void bkt(int pos,int k,int n,int lastval)
{
if(pos>k)
{
int cnt=0;
for(int i=1;i<=k;i++)
fout<<solutie[i]<<" ";
fout<<"\n";
return;
}
for(int val=lastval+1;val<=n;val++)
{
if(visited[val]==1) continue;
solutie[pos]=val;
visited[val]=1;
bkt(pos+1,k,n,val);
visited[val]=0;
}
}
int main()
{
int n,k;
fin>>n>>k;
bkt(1,k,n,0);
return 0;
}