Pagini recente » Cod sursa (job #1912244) | Cod sursa (job #2314216) | Cod sursa (job #2161804) | Cod sursa (job #1215485) | Cod sursa (job #1088240)
#include <fstream>
#include <cstring>
using namespace std;
short int N, Stack[17];
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int Valid(int k)
{
for(short int i=1; i<k; ++i)
if(Stack[i]>=Stack[k])
return 0;
return 1;
}
void Show(int k)
{
for(short int i=1; i<=k; ++i)
fout<<Stack[i]<<' ';
fout<<'\n';
}
void Permut(int k)
{
for(Stack[k]=1; Stack[k]<=N; Stack[k]++)
if (Valid(k))
{
Show(k);
Permut(k+1);
}
}
int main()
{
memset (Stack, 1, sizeof(Stack));
fin>>N;
Permut(1);
}