Pagini recente » Cod sursa (job #1487592) | Cod sursa (job #3316283) | Cod sursa (job #3317334) | Cod sursa (job #343025) | Cod sursa (job #3307267)
#include <iostream>
#include <fstream>
using namespace std;
int n, m, x[11];
ifstream f("combinari.in");
ofstream g("combinari.out");
int afis()
{
for(int i = 1; i <= m; i++)
g << x[i] << ' ';
g << '\n';
}
void bt(int k)
{
if(k <= m)
{
for(int i = x[k - 1] + 1; i <= n - m + k; i++)
{
x[k] = i;
bt(k + 1);
}
}
else afis();
}
int main()
{
f >> n >> m;
bt(1);
f.close();
g.close();
return 0;
}