Eddy's digital Roots
2015-08-13 15:13
246 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1163
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5203 Accepted Submission(s): 2910
Problem Description
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.
Input
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).
Output
Output n^n's digital root on a separate line of the output.
Sample Input
Sample Output
Author
eddy
提醒一下,因为最后的答案是每一位相加,所以在前面计算的过程中个位和十位是没啥区别的,可以先相加起来在计算也是对的,自己体会。当然这一题也可以同九余数定理。
Eddy's digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5203 Accepted Submission(s): 2910
Problem Description
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.
Input
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).
Output
Output n^n's digital root on a separate line of the output.
Sample Input
2 4 0
Sample Output
4 4
Author
eddy
提醒一下,因为最后的答案是每一位相加,所以在前面计算的过程中个位和十位是没啥区别的,可以先相加起来在计算也是对的,自己体会。当然这一题也可以同九余数定理。
#include <cstdio> int fun(int n) { int ans=1; for(int i=0;i<n;i++){ ans*=n; while(ans>=10){ int sum=0; while(ans){ sum+=ans%10; ans/=10; } ans=sum; } } return ans; } int main() { int n; while(scanf("%d",&n)!=EOF){ if(n==0)break; printf("%d\n",fun(n)); } return 0; }
相关文章推荐
- 《序列》游戏攻略【37~42】
- 【转】Android 之 下拉框(Spinner)的使用
- 反射——反射的属性和方法
- Memcached在windows下安装与使用
- android—sqlite
- WCF扩展系列 - 行为扩展(Behaviors)
- 对于jQuery性能的一些优化建议
- 常用的shell命令汇总,夯实Linux基础
- hdoj1272
- C语言函数调用性能测试
- mac 10.10.4 Yosemite jenv 多版本 java 安装 切换
- Spring3.0框架结构
- Unity答疑(一)
- jQuery库(noConflict)冲突解决机制
- HDU 1102 Constructing Roads
- 剑指offer第38题 数字在排序数组中出现的次数
- INSERT INTO .. ON DUPLICATE KEY更新多行记录
- android工程更改api版本
- oracle数据库自带功能
- 文本编辑器EditPlus