Pagini recente » Cod sursa (job #2646155) | Cod sursa (job #227004) | Cod sursa (job #1899225) | Cod sursa (job #660797) | Cod sursa (job #2860735)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,pos,x[20];
void afis(){
for(int i=1;i<=k;i++)
g<<x[i]<<" ";
g<<'\n';
}
void backt(int pos){
if(pos==k+1)
afis();
else{
for(int i=x[pos-1]+1;i<=n;i++){
x[pos]=i;
backt(pos+1);
}
}
}
int main()
{
f>>n>>k;
x[0]=0;
backt(1);
return 0;
}