Pagini recente » infoarena 2.0 | Cod sursa (job #851338) | Cod sursa (job #2963270) | Cod sursa (job #2871001) | Cod sursa (job #2961865)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
const int MAX_LENGTH_FREQ = 26;
const int MAX_LENGTH_SIR = 11;
int n, k, freq[MAX_LENGTH_FREQ];
void gen(int lg, int sir[MAX_LENGTH_SIR]) {
if (lg == k + 1) {
for (int i = 1; i <= k; ++i) {
fout << sir[i] << ' ';
}
fout << '\n';
return;
}
for (int i = 1; i <= n; ++i) {
if (freq[i] == 0 && i > sir[lg - 1]) {
sir[lg] = i;
freq[i] = 1;
gen(lg + 1, sir);
freq[i] = 0;
}
}
}
int main() {
fin >> n >> k;
int sir[MAX_LENGTH_SIR];
gen(1, sir);
return 0;
}