Pagini recente » Cod sursa (job #2393874) | Cod sursa (job #3293398) | Cod sursa (job #1698252) | Cod sursa (job #2202671) | Cod sursa (job #1680741)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int v[20], n, k;
void back(int count){
int i, j;
bool ok;
if (count == k){
for (i = 0; i < k; i++){
fout << v[i] << ' ';
}
fout << '\n';
} else{
int start = 1;
if(count > 0){
start = v[count - 1];
}
for (i = start; i <= n; i++){
ok = true;
for (j = 0; j < count; j++){
if (v[j] == i){
ok = false;
break;
}
}
if (ok){
v[count] = i;
back(count + 1);
}
}
}
}
int main(){
fin >> n >> k;
back(0);
return 0;
}