Ignatius's puzzle

Ignatius’s puzzle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12770 Accepted Submission(s): 8980

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|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
这题的解题思路，题意对于任意的x都是成立，不妨取x=1，故有18x+a*k。
代码如下：

#include<iostream>
using namespace std;
int main(){
    int i,n,k;
    while(cin>>k){
        for(i=1;i<=65;i++){
            if((18+i*k)%65==0){     //对于任意x都是成立的，不妨设x=1
                cout<<i<<endl;
                break;
            }
        }
        if(i>=66)
            cout<<"no"<<endl;
    }
    return 0;
}