HDU1098 Ignatius's puzzle [number theory], hdu1098ignatius
Ignatius's puzzle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission (s): 6559 Accepted Submission (s): 4540
Problem DescriptionIgnatius is poor at math, he falls into ss 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 ".
InputThe input contains several test cases. Each test case consists of a nonegative integer k, More details in the Sample Input.
OutputThe output contains a string "no", if you can't find a, or you shoshould output a line contains the. More details in the Sample Output.
Sample Input
111009999
Sample Output
22no43
Authoreddy: obtain the minimum a value that enables f (x) To be divisible by 65 when x is any value. If no output is made, no is obtained. Question: If any f (x) can be divisible by 65, f (1) % 65 = 0, (f (x + 1)-f (x )) % 65 = 0, the binary type is expanded (18 + k * a) % 65 = 0, so you only need to traverse to find.
#include <stdio.h>int main() {int k, a;while(~scanf("%d", &k)) {for(a = 0; a <= 65; ++a)if((18 + k*a) % 65 == 0) {printf("%d\n", a);break;}if(a > 65) printf("no\n");}return 0;}
What is Helen's puzzle?
Helen's puzzle or Helen's confusion.
Who sang she's puzzle of my heart?
Westlife
