Pagini recente » Cod sursa (job #2176901) | Cod sursa (job #3242770) | Cod sursa (job #3281281) | Cod sursa (job #3281499) | Cod sursa (job #3264963)
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 20;
int n,k,st[NMAX],vf[NMAX];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void bkt(int pas){
if(pas == k+1){
for(int i = 1; i <= k; i++){
fout << st[i] << " ";
}
fout << "\n";
}else{
for(int i = st[pas-1]+1; i <= n; i++){
if(vf[i] == 0){
vf[i] = 1;
st[pas] = i;
bkt(pas+1);
vf[i] = 0;
}
}
}
}
int main() {
fin >> n >> k;
bkt(1);
return 0;
}