Pagini recente » Cod sursa (job #1528701) | Cod sursa (job #2602548) | Cod sursa (job #636966) | Cod sursa (job #709223) | Cod sursa (job #2375673)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int v[20],n,k;
void afis(){
for(int i=1;i<=k;++i) out<<v[i]<<' ';
out<<'\n';
}
int backtrack(int j){
if(j-1==k) afis();
else {
for(int i=v[j-1]+1;i<=n-k+j;++i){
if(v[j-1]<i){
v[j]=i;
backtrack(j+1);}
}
}
}
int main()
{
in>>n>>k;
backtrack(1);
return 0;
}