HDU-1098 Ignatius's puzzle

Ignatius’s puzzle

Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/32768 K (Java/Others)

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)=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\mid 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

11
100
9999

Sample Output

22
no
43

Reference Code

#include<bits/stdc++.h>
using namespace std;
int a,k,t;
void exgcd(int a,int b,int &x,int &y){
    if (!b) x=1,y=0;
    else exgcd(b,a%b,y,x),y-=a/b*x;
}
int main(){
    while(~scanf("%d",&a)){
        if (!(a%5)||!(a%13))
            printf("no\n");
        else{
            exgcd(a,65,k,t);
            k=(k*(-18)%65+65)%65;
            printf("%d\n",k);
        }
    }
    return 0;
}

Tips

看了Discuss里面的解答，似乎都不够严谨，笔者试着写一下自己的过程。
题目中要求$$65\mid 5x^{13}+13x^5+kax,\forall x\in \mathbb{Z},$$就等价于
$$\{\begin{array}{r}5\mid 13x^5+kax\\ 13\mid 5x^{13}+kax\end{array},\forall x\in \mathbb{Z}.$$
这两个式子在当$5\mid x$和$13\mid x$时显然成立，下面讨论$5\nmid x$和$13\nmid x$的情形。此时，该式转化为$$\{\begin{array}{rl}& 5\mid 13(x^4-1)+13+ka\\ & 13\mid 5(x^{12}-1)+5+ka\end{array}.$$
由费马小定理，$$\{\begin{array}{rl}& 5\mid x^4-1,5\nmid x\\ & 13\mid x^{12}-1,13\nmid x\end{array}$$
则该式继续等价为
$$\{\begin{array}{r}5\mid 13+ka\\ 13\mid 5+ka\end{array},$$
则有$$ka=5x-13=13y-5,x,y\in \mathbb{Z}$$解得$$\{\begin{array}{rl}& x=-1-13t\\ & y=-1-5t\\ & ka=-18-65t\end{array},t\in \mathbb{Z},$$
因而，本题转化为求解不定方程$$ak+65t=-18,k,t\in \mathbb{Z}$$
的解中$k$的最小正值。
由拓展欧几里得算法，该方程有解的条件为$$\text{gcd}(a,65)|-18$$而$$\text{gcd}(65,-18)=1$$所以要求$a$必须满足$$\text{gcd}(a,65)=1$$当方程有解时，先求解出不定方程$$ak+65t=1,k,t\in \mathbb{Z}$$的一个特解，再将其乘以$-18$即为原方程的一个特解。然后再根据这个特解求$k$的最小正值。
至于特解的求解，可以利用
$$\begin{gathered} b{y}_0+(a\%b)x_0=\gcd (b,a\%b) \\ \iff a{x}_0+b(y_0-\lfloor \frac{a}{b}\rfloor x_0)=\gcd (a,b). \end{gathered}$$
当然，最后这一部分也可以用暴力法，在$1$~$65$中寻找是否存在$k$满足$65\mid ak+18.$