[1499] The sum of square number
- 时间限制: 1000 ms 内存限制: 65535 K
- 问题描述
-
The input is an integer N .Your task is to calculate that there're how many ways to split N to the sum of several integers' square.
For example,Input 10, there are four kinds of circumstances. 10= 1^2+1^2+……=2^2+1^2+……=2^2+2^2+1^2+1^2=3^2+1^2.
- 输入
-
Input contains multiple test cases. Each test case contains an integer N ( 0 < N <= 1000)
- 输出
-
Your task is to calculate that there're how many ways to split N to the sum of several integers' square in one line.
One integer per line.
- 样例输入
-
10 50
- 样例输出
-
4 104
- 提示
-
无
- 来源
-
二胖
- 操作
-
