hdu---1098Ignatius's puzzle

Ignatius's puzzle

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

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

 

 

 

//水题一枚，只要分析清楚题意，找到最小的a ，使得18+k*a  是65的倍数即可！

//对于每一个k，a的枚举量不会超过65，直接枚举计算看其是否满足条件即可。

//  看到题目不要慌，认真分析，有些并没有想象中那么难。

代码：

#include<stdio.h>
int main()
{ 
int k,i,temp; 
while(scanf("%d",&k)!=EOF)
{ 
if(k%65==0)
{ 
　　printf("no\n"); 
　　continue;
} 
for(i=1;i<=65;i++)
{ 
　　temp=k*i+18; 
if(temp%65==0)
{ 
　　printf("%d\n",i); 
　　break;
}
} 
　　if(i>=66) 
　　printf("no\n");
} 
return 0;
}

 

转载于:https://www.cnblogs.com/songacm/p/3537147.html