Eddy's digital Roots
2015-08-18 11:46
337 查看
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5238 Accepted Submission(s): 2925
[align=left]Problem Description[/align]
The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those digits are
summed and the process is repeated. This is continued as long as necessary to obtain a single digit.
For example, consider the positive integer 24. Adding the 2 and the 4 yields a value of 6. Since 6 is a single digit, 6 is the digital root of 24. Now consider the positive integer 39. Adding the 3 and the 9 yields 12. Since 12 is not a single digit, the process
must be repeated. Adding the 1 and the 2 yeilds 3, a single digit and also the digital root of 39.
The Eddy's easy problem is that : give you the n,want you to find the n^n's digital Roots.
[align=left]Input[/align]
The input file will contain a list of positive integers n, one per line. The end of the input will be indicated by an integer value of zero. Notice:For each integer in the input n(n<10000).
[align=left]Output[/align]
Output n^n's digital root on a separate line of the output.
[align=left]Sample Input[/align]
[align=left]Sample Output[/align]
本题考查九余定理
Total Submission(s): 5238 Accepted Submission(s): 2925
[align=left]Problem Description[/align]
The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those digits are
summed and the process is repeated. This is continued as long as necessary to obtain a single digit.
For example, consider the positive integer 24. Adding the 2 and the 4 yields a value of 6. Since 6 is a single digit, 6 is the digital root of 24. Now consider the positive integer 39. Adding the 3 and the 9 yields 12. Since 12 is not a single digit, the process
must be repeated. Adding the 1 and the 2 yeilds 3, a single digit and also the digital root of 39.
The Eddy's easy problem is that : give you the n,want you to find the n^n's digital Roots.
[align=left]Input[/align]
The input file will contain a list of positive integers n, one per line. The end of the input will be indicated by an integer value of zero. Notice:For each integer in the input n(n<10000).
[align=left]Output[/align]
Output n^n's digital root on a separate line of the output.
[align=left]Sample Input[/align]
2 4 0
[align=left]Sample Output[/align]
4 4
本题考查九余定理
#include<stdio.h> int main(){ int n,i,a; while(scanf("%d",&n),n) { a=n; for(i=2;i<=n;i++) a=a*n%9; if(a==0) printf("9\n"); else printf("%d\n",a); } return 0; }
相关文章推荐
- sqlce 创建数据库过程
- hdu-2680-Choose the best route(dijkstra)
- IOS UITableview 的Cell 封装
- UE3 材质概要
- ios中KeyChain用途
- SpringMVC注解@RequestParam全面解析
- 玩坏JVM很简单--toString的递归调用
- 编写高质量代码改善C#程序的157个建议——建议67:慎用自定义异常
- Python执行Shell命令测试脚本
- Web攻防之XSS,CSRF,SQL注入
- HDU 2112:HDU Today【Dijkstra & SPFA & Floyd】
- android自定义布局中的平滑移动
- 希腊字母怎么读?
- Intellij IDEA+Tomcat+JRebel热部署
- 复选框选中提示车牌号正则表达式
- informix11.7配置文件汇总
- 正则表达式
- jquery对象与dom对象的相互转化
- html+css下拉菜单
- 趁着没发霉重写库函数之strstr