hdu 1098

Ignatius's puzzle

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

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
  
  

 

解题分析;

  可以看出（5*x^13+13*x^5+k*a*x）%65==0  应该是恒成立的，不妨用a=1带入试试，发现只要求（18+a*k）%65==0即可；

打表发现循环节是65；

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