杭电1098
Ignatius's puzzle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7459 Accepted Submission(s): 5175
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
111009999
Sample Output
22no43
分析:
题目大意:对于f(x)=5*x^13+13*x^5+k*a*x,给定一个K值,求一个最小正整数a,满足f(x)恒能被65整除;
逐个枚举的话时间复杂度太高O(n*n),肯定会超时,那么,因为又是一道关于取余运算的算术题,果断想到找规律、
以下是引子某数学大神的推导过程:
题目的关键是函数式f(x)=5*x^13+13*x^5+k*a*x;事实上,由于x取任何值都需要能被65整除.那么用数学归纳法.只需找到f(1)成立的a,并在假设f(x)成立的基础上,证明f(x+1)也成立.那么把f(x+1)展开,得到5*( ( 13 0 )x^13 + (13 1 ) x^12 ...... .....+(13 13) x^0)+13*( ( 5 0 )x^5+(5 1 )x^4......其实就是二项式展开,这里就省略了 ......+ ( 5 5 )x^0 )+k*a*x+k*a;——————这里的( n m)表示组合数,相信学过2项式定理的朋友都能看明白.然后提取出5*x^13+13*x^5+k*a*x则f(x+1 ) = f (x) + 5*( (13 1 ) x^12 ...... .....+(13 13) x^0 )+ 13*( (5 1 )x^4+...........+ ( 5 5 )x^0 )+k*a;很容易证明,除了5*(13 13) x^0 、13*( 5 5 )x^0 和k*a三项以外,其余各项都能被65整除.那么也只要求出18+k*a能被65整除就可以了.而f(1)也正好等于18+k*a所以,只要找到a,使得18+k*a能被65整除,也就解决了这个题目.
因此,对于任给定的k,只需要把a从1开始枚举,但是最多只需要枚举到65,因为65是循环周期,K*(65+a)与k*a对于65的取余结果是相同的,所以65之内若找不到一个满足条件的a,便不存在满足条件的a。
代码:
#include <cstdio>
int main()
{
int k,a;
int flag;
while(scanf("%d",&k)==1)
{
flag=0;
for(a=1;a<=65;a++)
{
if((k*a+18)%65==0){printf("%d\n",a);flag=1;break;}
}
if(!flag)printf("no\n");
}
return 0;
}