Pagini recente » Cod sursa (job #3170633) | Cod sursa (job #2687772) | Cod sursa (job #663015) | Cod sursa (job #2847426) | Cod sursa (job #1596736)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int st[20], n, m;
void afisare() {
for (int i = 1; i <= m; ++i)
g << st[i] << " ";
g << "\n";
}
int valid(int k) {
for (int i = 1; i < k; ++i) {
if (st[i] == st[k] || st[k] < st[k - 1])
return 0;
}
return 1;
}
void BK(int k) {
for (int i = 1; i <= n; ++i) {
st[k] = i;
if (valid(k)) {
if (k == m)
afisare();
else
BK(k + 1);
}
}
}
int main()
{
f >> n;
f >> m;
BK(1);
return 0;
}