Hduj 1098 Ignatius's puzzle

Ignatius's puzzle Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)
Total submission (s): 6222 accepted submission (s): 4283


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

#include<iostream>#include<cstring>using namespace std;int main(){int n;while(cin>>n){int m=0;for(int i=0;i<65;i++){if((18+n*i)%65==0){m=i;break;}}if(m)cout<<m<<endl;elsecout<<"no\n";}return 0;}

Hduj 1098 Ignatius's puzzle