Pagini recente » Cod sursa (job #1253906) | Cod sursa (job #1284569) | Cod sursa (job #1648685) | Cod sursa (job #722581) | Cod sursa (job #2419313)
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int n, ans[19], cate;
bool check(int n)
{
for(int i = 1; i < n; ++i) if(ans[i] > ans[n] || ans[i] == ans[n]) return 0;
return 1;
}
void solve(int k) {
for(int i = 1; i <= n; ++i) {
ans[k] = i;
if(check(k)) {
if(k == cate) {
for(int j = 1; j <= cate; ++j) fout << ans[j] << " ";
fout << "\n";
}
else solve(k + 1);
}
}
}
int main()
{
fin >> n >> cate;
solve(1);
return 0;
}