Pagini recente » Cod sursa (job #494186) | Cod sursa (job #2985259) | Cod sursa (job #617710) | Cod sursa (job #3169587) | Cod sursa (job #2661516)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int x[19], N, K;
void afis()
{
for(int i = 1; i <= K; ++ i)
g << x[i] << " ";
g << "\n";
}
bool valid(int l)
{
for(int i = 1; i < l; ++ i)
if(x[i] >= x[l]) return 0;
return 1;
}
void back(int l)
{
for(int i = 1; i <= N; ++ i)
{
x[l] = i;
if(valid(l))
{
if(l == K) afis();
else back(l + 1);
}
}
}
int main()
{
f >> N >> K;
back(1);
return 0;
}