Pagini recente » Cod sursa (job #2354174) | Cod sursa (job #2700321) | Cod sursa (job #2474212) | Cod sursa (job #2199157) | Cod sursa (job #2174320)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k,s[20];
bool vizitat[100];
void afisare(){
for(int ii=1; ii<=k;++ii)
out<<s[ii]<<' ';
out<<'\n';
}
int Back ( int t, int n, int k){
if(t-1==k) afisare();
else{
for(int i=s[t-1]+1;i<=n-k+t;++i)
{
if(s[t-1]<i){
s[t]=i;
Back(t+1,n,k);
}
}
}
}
int main()
{
in>>n>>k;
Back(1,n,k);
return 0;
}