Pagini recente » Cod sursa (job #2442420) | Cod sursa (job #2309487) | Cod sursa (job #2555958) | Cod sursa (job #2760206) | Cod sursa (job #2189009)
//#include <ambitie>
#include <fstream>
using namespace std;
ifstream input("combinari.in");
ofstream print("combinari.out");
int n,k,st[20];
void backtrack(int p){
if(p==k+1){
for(int i=1;i<=k;++i)
print<<st[i]<<" ";
print<<"\n";
}
else
for(int i=st[p-1]+1 ;i<=n-k+p ;++i){
st[p]=i;
backtrack(p+1);
}
}
int main(){
input>>n>>k;
backtrack(1);
print.close();
input.close();
return 0;
}