当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1098:Ignatius's puzzle

题目描述
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".

输入解释
The input contains several test cases. Each test case consists of a nonegative integer k, More details in the Sample Input.
输出解释
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.
输入样例
11
100
9999
输出样例
22
no
43
来自杭电HDUOJ的附加信息
Author eddy
Recommend

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-1098

最后修改于 2020-10-25T22:42:09+00:00 由爬虫自动更新

共提交 5

通过率 80.0%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/32768K(Java/Others)