Problems
Status
Contests
Events
Standings
Topic
IDE Online
Login
Description
Editorial
My Submission
1033.整数拆分 Ver.2
Look up all submission
Status
Time
Memory
Lang.
Submit Date
1033.整数拆分 Ver.2
Time Limit:1000MS Memory Limit:65535KB
Description
The problem is, given an positive integer N, we define an equation like this: N=a[1]+a[2]+a[3]+...+a[m]; a[i]>0,1<=m<=N; For example, assume N is 5, we can find: 5=1+1+1+1+1 5=1+1+1+2 5=1+1+3 5=1+2+2 5=1+4 5=2+3 5=5 Note that "5 = 3 + 2" and "5 = 2 + 3" is the same in this problem. Now, you do it!" But now , you must ouput all the equations in **lexicographical** order;
Input
The input contains several test cases. Each test case contains a positive integer N(1\<=N\<=20) which is mentioned above. The input is terminated by the end of file.
Output
For each test case, you have to output several lines indicate the different equations you have found.
Sample test
Sample input
3 4
Sample output
3=1+1+1 3=1+2 3=3 4=1+1+1+1 4=1+1+2 4=1+3 4=2+2 4=4
Note
The first case,you can't print 3=2+1(it's not lexicographical order),and you must print 3=1+1+1 before 3=1+2 .
Tags
Post editorial
Editorials
GNU C++ 9.3.0
GNU C 9.3.0
Java 1.8
Python 3.8.4
Lua 5.3
GO 1.12.4
JS - (nodejs 10.19.0)
Login before submit
Test Input
Test Output
3 4
Please run you code firstly.
Console
IDE Setting
字体设置
调整适合你的字体大小。
12px
13px
14px
15px
16px
18px
20px
主题设置
切换不同的代码编辑器主题，选择适合你的语法高亮。
Visual Studio
Visual Studio Dark
High Contrast Dark
行宽限制
设置每一行代码的最大字符个数，设置为0则不限制。
0
80
100
120
Login before submit
