Pagini recente » Cod sursa (job #342642) | Cod sursa (job #571725) | Cod sursa (job #301119) | Cod sursa (job #1113142) | Cod sursa (job #1782055)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, m, v[19];
void print()
{
for (int i = 1; i <= m; i++)
g << v[i] << " ";
g << "\n";
}
int valid(int k)
{
if(k>1 && v[k]<=v[k-1])return 0;
return 1;
}
void back(int k)
{
for (v[k] = 1; v[k] <= n; v[k]++)
if (valid(k))
if (k == m)
print();
else
back(k + 1);
}
int main()
{
f >> n >> m;
back(1);
f.close();
g.close();
return 0;;
}