Ignatius's puzzle

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

Total Submission(s): 9934    Accepted Submission(s): 6959

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

 

Problem :     Judge Status : Accepted

RunId : 21248504    Language : G++    Author :

Code Render Status : Rendered By HDOJ G++ Code Render Version 0.01 Beta

#include<iostream> #include<cstring> #include<cstdio> using namespace std; int main(){ int k,i; while(scanf("%d",&k)==1){ for(i=1;i<=65;i++) if((18 + i*k)%65==0) break; if(i<=65) printf("%d\n",i); else printf("no\n"); } }

#include
          
           #include
           
            #include
            
             using namespace std;int main(){
              int k,i;    while(scanf("%d",&k)==1){
                  for(i=1;i<=65;i++)            if((18 + i*k)%65==0)                break;        if(i<=65)            printf("%d\n",i);        else            printf("no\n");    }}