Pagini recente » Cod sursa (job #1109129) | Cod sursa (job #1231514) | Cod sursa (job #1946660) | Cod sursa (job #1127842) | Cod sursa (job #2105332)
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, k;
int ans[20], vis[20];
void print() {
for (int i = 1; i <= k; ++i) {
out << ans[i] << " ";
}
out << "\n";
}
void back(int len, int start) {
if (len == k + 1) {
print();
return;
}
for (int i = start; i <= n; ++i) {
if (!vis[i]) {
vis[i] = 1;
ans[len] = i;
back(len + 1, i + 1);
vis[i] = 0;
}
}
}
int main() {
in >> n >> k;
back(1, 1);
}