#include<iostream>
using namespace std;
void fj(int n,int qt)//qt记录递归时的嵌套次数
{
if (n < 0)
return;
if (n == 1)
{
cout << 1;
cout << endl;
}
if (n == 2)
{
cout << 1<<1;
cout << endl;
if (qt>0)
qt--;
return;
}
if (n>2)
{
cout << 1;
fj(n - 1,++qt);
int i = 1;
while (i <= n/2)
{
for (int i = 1; i < qt; i++)
cout << 1;
cout << i << n - i << endl;
i++;
}
}
}
int main()
{
fj(6,0);
return 0;
}
using namespace std;
void fj(int n,int qt)//qt记录递归时的嵌套次数
{
if (n < 0)
return;
if (n == 1)
{
cout << 1;
cout << endl;
}
if (n == 2)
{
cout << 1<<1;
cout << endl;
if (qt>0)
qt--;
return;
}
if (n>2)
{
cout << 1;
fj(n - 1,++qt);
int i = 1;
while (i <= n/2)
{
for (int i = 1; i < qt; i++)
cout << 1;
cout << i << n - i << endl;
i++;
}
}
}
int main()
{
fj(6,0);
return 0;
}