Pagini recente » Cod sursa (job #2926817) | Cod sursa (job #2826021) | Cod sursa (job #2363694) | Cod sursa (job #3157113) | Cod sursa (job #1038206)
#include <fstream>
#include <iostream>
using namespace std;
int n, x[10], nrsol;
int m; // combinari de n luate cate m
ofstream fout("combinari.out");
ifstream fin("combinari.in");
void Afisare();
void Back(int k);
int main()
{
fin >> n >> m;
Back(1);
fin.close();
fout.close();
return 0;
}
void Afisare()
{
for(int i = 1; i <= m; i++)
fout << x[i] << " ";
fout << '\n';
}
void Back(int k)
{
int j;
if( k > m ) Afisare();
else
for( j = x[k-1] + 1; j <= n; j++)
{
x[k] = j;
Back(k+1);
}
}