Ignatius's puzzle
Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4935????Accepted Submission(s): 3359
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
?
若對任意x成立,則當x=1時必然成立.若當x=1時成立,則對任意正整數x都成立.
觀察題目中給出的式子可以看出每一項都有公因子x,所以f(x)必然是f(1)的x倍,若f(1)是65的倍數,則f(x)必然也是65的倍數.
#include<stdio.h>
int
main()
{
int
k;
while
(scanf(
"
%d
"
,&k)!=
EOF)
{
if
(k==
1
|| (k%
5
!=
0
&& k%
13
!=
0
&& k%
65
!=
0
))
{
for
(
int
i=
1
;;i++
)
if
((
18
+k*i)%
65
==
0
)
{
printf(
"
%d\n
"
,i);
break
;
}
}
else
printf(
"
no\n
"
);
}
return
0
;
}
?
更多文章、技術交流、商務合作、聯系博主
微信掃碼或搜索：z360901061
微信掃一掃加我為好友
QQ號聯系： 360901061
您的支持是博主寫作最大的動力，如果您喜歡我的文章，感覺我的文章對您有幫助，請用微信掃描下面二維碼支持博主2元、5元、10元、20元等您想捐的金額吧，狠狠點擊下面給點支持吧，站長非常感激您！手機微信長按不能支付解決辦法：請將微信支付二維碼保存到相冊，切換到微信，然后點擊微信右上角掃一掃功能，選擇支付二維碼完成支付。
【本文對您有幫助就好】元
