|
||||||||||
Ignatius's puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15486 Accepted Submission(s): 10803 Problem Description Ignatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that:f(x)=5*x^13+13*x^5+k*a*x,input a nonegative integer k(k<10000),to find the minimal nonegative integer a,make the arbitrary integer x ,65|f(x)if no exists that a,then print "no". Input The input contains several test cases. Each test case consists of a nonegative integer k, More details in the Sample Input. Output The output contains a string "no",if you can't find a,or you should output a line contains the a.More details in the Sample Output. Sample Input
Sample Output
Author eddy | ||||||||||
|