HDOJ 1098 Ignatius's puzzle

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)=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".

 

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

111009999

 

Sample Output

22no43
已AC：
#include <iostream>int main(){    using namespace std;    int k;    while(cin >> k)    {        k = k%65;        int a = 0;        for(int i=1; i<65; ++i)        {            if((i*k)%65==47)            {                a = i;                break;            }        }        if(a)            cout << a << endl;        else            cout << "no" << endl;    }    return 0;}