# HDU 1098 Ignatius‘s puzzle（数学推导，一层循环解决）

Ignatius’s puzzle

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)=5x^13+13x^5+kax,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 input contains several test cases. Each test case consists of a nonegative integer k, More details in the Sample Input.

Sample Input

11
100
9999


Sample Output

22
no
43


f(x + 1) = f(x)=5*(x + 1)^13+13*(x + 1)^5+ka(x + 1)

AC代码：

#include <stdio.h>

int main() {
int k;
while(scanf("%d", &k) != EOF) {
int i;
for(i = 0; i <= 64; i++) {
if((18 + k * i) % 65 == 0) {
printf("%d\n", i);
break;
}
}
if(i == 65) printf("no\n");
}
return 0;
}


End

08-20 2万+
08-07 5706
12-18 5444
01-13 991
03-18 1452
08-21 1145
01-04
09-19