杭电OJ——1098 Ignatius's puzzle
来源:互联网 发布:遛狗啦淘宝店 编辑:程序博客网 时间:2024/05/22 06:54
Ignatius's puzzle
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".
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
这道题目难点不在编程,在数学!数学归纳法证明! 最后只要证明 18 + k * a 能整除65就可以了。
代码:
#include<stdio.h> int main () { int a = 0; int k = 0; while ( scanf ( "%d" , &k ) != EOF ) { if ( k % 65 == 0 ) { printf ( "no\n" ) ; continue ; } for ( a = 1 ; a <= 65 ; ++ a ) { if ( ( 18 + k * a ) % 65 == 0 ) { printf ( "%d\n" , a ) ; break ; } } if ( a > 65 ) { printf ( "no\n" ) ; } } return 0 ; }
- 杭电OJ——1098 Ignatius's puzzle
- 杭电OJ 1098:Ignatius's puzzle
- 杭电 HDU 1098 Ignatius's puzzle
- 杭电1098 Ignatius's puzzle
- 杭电ACM1098——Ignatius's puzzle
- 杭电acm1098 Ignatius's puzzle
- 杭电ACM1098 Ignatius's puzzle
- hdu 1098——Ignatius's puzzle
- hdu 1098 Ignatius's puzzle
- hdu 1098 Ignatius's puzzle
- HDU 1098 Ignatius's puzzle
- HDU 1098 Ignatius's puzzle
- Hdu 1098 - Ignatius's puzzle
- HDOJ 1098 Ignatius's puzzle
- hdu 1098 Ignatius's puzzle
- HDOJ 1098 Ignatius's puzzle
- hdu 1098 Ignatius's puzzle
- HDU 1098 Ignatius's puzzle
- Android高仿360安全卫士--布局篇
- Using Selenium 2 ( WebDriver ) to run qUnit test page
- 高性能mysql基础知识1
- fasf
- HTTP_FILTER_CONTEXT结构具有如下形式:
- 杭电OJ——1098 Ignatius's puzzle
- zoj 1760.Doubles
- 二叉树中的那些常见的面试题
- 1000瓶水中找 出有毒的那瓶,毒性一周后发作,一周内最少需要多少只老鼠
- jquery判断滚动条是否到达窗口顶部和底部
- 换个角度读人
- 空类中成员函数
- 23种设计模式(1):单例模式
- C经典指针越界问题