Pagini recente » Cod sursa (job #782859) | Cod sursa (job #246247) | Cod sursa (job #1349435) | Cod sursa (job #676561) | Cod sursa (job #3209874)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int NMAX = 20;
int x[NMAX + 1];
int n,k;
void afiseaza(){
for(int i = 1;i<=k;++i)
fout << x[i] << ' ';
fout << '\n';
}
void back(int pas){
for(int i = x[pas - 1] + 1;i <= n - k + pas;++i){
x[pas] = i;
if(pas < k)
back(pas + 1);
else
afiseaza();
}
}
int main(){
fin >> n >> k;
back(1);
return 0;
}