Pagini recente » Cod sursa (job #1224305) | Cod sursa (job #1822202) | Cod sursa (job #2505790) | Cod sursa (job #2533086) | Cod sursa (job #2242047)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int n, m, sol[40];
void back(int k)
{
if(k == m)
{
for (int i = 1; i <= m; ++i)
fout << sol[i] << ' ';
fout << endl;
}
else {
for (int i = sol[k] +1 ; i <= n; ++i){
sol[k+1]= i;
back(k+1);
}
}
}
int main()
{
fin >> n >> m;
back(0);
return 0;
}