Pagini recente » Cod sursa (job #2685841) | Cod sursa (job #2967674) | Cod sursa (job #2732258) | Cod sursa (job #2441308) | Cod sursa (job #521478)
Cod sursa(job #521478)
#include <fstream>
using namespace std;
int x[20], n, z;
ifstream f("combinari.in");
ofstream g("combinari.out");
void afisare(int x[20])
{
for(int i = 1; i <= z; ++i)
g << x[i] << " ";
g << '\n';
}
int valid(int k)
{
if(x[k - 1] >= x[k])return 0;
return 1;
}
void back(int k)
{
for(int i = 1; i <= n; ++i)
{
x[k] = i;
if(valid(k))
if(k == z)
afisare(x);
else back(k + 1);
}
}
int main()
{
f >> n >> z;
back(1);
f.close();
g.close();
return 0;
}