Pagini recente » Cod sursa (job #2441902) | Cod sursa (job #2172623) | Cod sursa (job #2985698) | Cod sursa (job #99023) | Cod sursa (job #2660388)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[20], n, p;
void afisare()
{
for(int i = 1; i <= p; ++ i)
g << x[i] << " ";
g << "\n";
}
bool valid(int k)
{
for(int i = 1; i < k; ++ i)
if(x[i] >= x[k]) return false;
return true;
}
void back(int k)
{
for(int i = 1; i <= n; ++ i)
{
x[k] = i;
if(valid(k))
if(k == p)
afisare();
else back(k + 1);
}
}
int main()
{
f >> n >> p;
back(1);
return 0;
}