Pagini recente » Cod sursa (job #2627971) | Cod sursa (job #2889916) | Cod sursa (job #302853) | Cod sursa (job #888874) | Cod sursa (job #1595827)
#include <iostream>
#include <fstream>
using namespace std;
int n, k, v[20];
ifstream in("combinari.in");
ofstream out("combinari.out");
void back(int i)
{
if (i > k)
{
for (int j = 1; j <= k; j++)
out << v[j] << " ";
out << '\n';
}
else
for (v[i] = 1; v[i] <= n; v[i]++)
{
if (v[i] > v[i-1])
back(i+1);
}
}
int main()
{
in >> n >> k;
back(1);
return 0;
}