Pagini recente » Cod sursa (job #2198226) | Cod sursa (job #556816) | Cod sursa (job #1137440) | Cod sursa (job #2184212) | Cod sursa (job #3222503)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("submultimi.in");
ofstream fout ("submultimi.out");
int n;
int v[20];
void print_solution(int pos)
{
for(int i = 1; i <= pos; i ++)
fout << v[i] << " ";
fout << '\n';
}
bool valid (int n)
{
for (int i = 1; i < n; i ++)
if (v[i] >= v[n])
return false;
return true;
}
void submultimi(int pos)
{
for (int i = 1; i <= n; i ++)
{
v[pos] = i;
if (valid(pos))
if (pos <= n)
{
print_solution(pos);
submultimi(pos + 1);
}
else
if (pos < n)
submultimi(pos + 1);
}
}
int main()
{
fin >> n;
submultimi(1);
return 0;
}