Problem 1098. -- Ignatius's puzzle
HDU_1098: Ignatius's puzzleTime Limit: 1000 MS Memory Limit: 32 MB   64bit IO Format: %I64d
Submitted: 5 Accepted: 5
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".
The input contains several test cases. Each test case consists of a nonegative integer k, More details in the Sample Input.
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.