Pagini recente » Cod sursa (job #3167882) | Cod sursa (job #2786709) | Cod sursa (job #3166594) | Cod sursa (job #247720) | Cod sursa (job #1550730)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int n, m;
int st[19];
void write()
{
for (int i = 1; i <= m; i++)
fo << st[i] << " ";
fo << "\n";
}
bool check(int k)
{
for (int i = 1; i < k; i++)
if (st[i] == st[k])
return false;
return true;
}
void comb(int k)
{
for (int i = 1; i <= n; i++)
{
st[k] = i;
if (check(k) && st[k] > st[k-1])
{
if (k == m)
write();
else
comb(k + 1);
}
}
}
int main()
{
fi >> n >> m;
comb(1);
return 0;
}