hdu 1098

Ignatius's puzzle

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4199    Accepted Submission(s): 2843

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

  
  

   
   11
100
9999
  
  

 

Sample Output

  
  

   
   22
no
43
  
  

 

Author

eddy

 

#include <iostream>
using namespace std;
int main()
{
    int k, a;
    while(cin>>k)
    {
        for(a = 1; a <= 64; a++)
            if((k*a%13 == 8) && (k*a%5 == 2))
                break;
        if(a != 65)
            cout<<a<<endl;
        else
            cout<<"no"<<endl;

    }
    return 0;
}