Pagini recente » Cod sursa (job #761412) | Cod sursa (job #2221012) | Cod sursa (job #691519) | Cod sursa (job #1084524) | Cod sursa (job #2823765)
#include <fstream>
#include <iostream>
using namespace std;
int n, k, sol[20];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
bool isValid(int p){
for(int i = 1; i < p; ++i){
if(sol[i] == sol[p]){
return 0;
}
}
if(sol[p - 1] > sol[p]){
return 0;
}
return 1;
}
void bkt(int p){
if(p == k + 1){
for(int i = 1; i <= k; ++i){
fout << sol[i] << " ";
}
fout << "\n";
return;
}
for(int i = 1; i <= n; ++i){
sol[p] = i;
if(isValid(p)){
bkt(p + 1);
}
}
}
int main(){
fin >> n >> k;
bkt(1);
return 0;
}