Ignatius's puzzle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7934 Accepted Submission(s): 5504
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
题目大意:
给定一个方程式f(x)=5*x^13+13*x^5+k*a*x,给定一个非负整数k,求能不能找到一个尽量小的非负整数a,使得上述方程式中的x任意取值,结果都能被65整除,如果有,输出a的值,否则输出no
代码实现:
#include<iostream>
using namespace std;
int main()
{
int k,i;
while(cin>>k)
{
bool flag=1;
for(i=1;i<=65;i++)
{
if((18+i*k)%65==0)
{
cout<<i<<endl;
flag=0;
break;
}
}
if(flag)
cout<<"no"<<endl;
}
return 0;
}