KPEQU - Equation
You are given integer positive number N. Find the number of solutions in positive integer numbers of the following equation:
Input
Each line of input file contains one integer number N (1 ≤ N ≤ 104). The last line contains 0 and shouldn't be processed. Number of lines in the input does not exceed 30.
Output
For every line in the input write the answer on a separate line.
Example
Input: 1 2 0 Output: 1 3
hide comments
David:
2021-06-29 21:05:34
Yes. For n=10, result=2295 |
|
ankitdtu007:
2019-04-02 14:54:28
For n=10 , is the output 2295 ? Last edit: 2019-04-02 15:13:03 |
|
rk:
2015-05-06 10:50:30
sry even ouput given by users plz help.
|
|
THE_SCORPION:
2013-08-29 15:42:36
I don't understand what's the benefit of the Y & X
|
|
Ouditchya Sinha:
2013-04-25 10:59:49
My AC solution for N = 10^4 begins with 221454 & ends with 984375 and is 1019 characters long. :) |
|
Srijan Khare:
2012-12-29 18:04:36
my AC solution gives beginning with 3273...and ending with...4375 for N=50000 |
|
Osschef Wum Enear:
2012-04-06 11:20:23
So the answer for N=50000 has 6966 digits, beginning with 3467... and ending in 1129 zeros.
|
|
Lureohc Otnafifa:
2011-04-24 03:51:02
is there any modulus for the answer..?
|
|
Anuj Mahajan:
2011-03-07 22:08:48
plz.....some test cases
|
|
Egor:
2011-02-20 15:31:41
How to optimize solution? Last edit: 2011-02-20 16:13:53 |
Added by: | Pavel Kuznetsov |
Date: | 2007-03-27 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |
Resource: | Vologda 2007 |