HDU1163
来源:互联网 发布:mac强制卸载程序 编辑:程序博客网 时间:2024/05/22 11:43
Eddy's digital Roots
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.
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
240
Sample Output
44
Author
eddy
// HDU1163 基础题// Eddy's digital Roots http://acm.hdu.edu.cn/showproblem.php?pid=1163// 2017.08.28 by wyj/*计算方法是:这个数字根等于原数除以9的余数,因此这个计算过程常常称为“合九法”。如39/9=3.成立同余定理:如果两个乘积除以m的余数等于这两个数分别除以m的余数积。例如:7%3=1 5%3=2 7*5/3=2=1*2*/#includeusing namespace std;int main(){int n, a, sum, i;while (cin >> n&&n){sum = 1;for (i = 0; i
阅读全文
0 0
- hdu1163
- hdu1163
- hdu1163
- hdu1163
- HDU1163
- hdu1163
- HDU1163
- hdu1163 树根
- !hdu1163(求数根)
- HDU1163九余数定理
- HDU1163 Eddy's digital Roots
- HDU1163:Eddy's digital Roots
- hdu1163-Eddy's digital Roots
- HDU1163【九余数定理】【水题】
- hdu1163 Eddy's digital Roots
- HDU1163 Eddy's digital Roots
- HDU1163 Eddy's digital Roots
- HDU1163 快速幂+九余数
- 对比两个字符串
- Python2.x与3.x版本区别
- WebService 的创建,部署和使用
- 【选择题】Java基础测试二(15道)
- Xshell 连接到虚拟机的ubuntu
- HDU1163
- Rewrite – Apache转Lighttpd的伪静态rewrite方法
- Django blog
- 在同一台服务器上配置多个Tomcat
- Xcode9 无线调试教程
- 数组中只出现一次的数字
- jquery easyUI 日期格式化,DateBox只显示年
- Facebook在代码里下毒,百度身受重伤。。。
- MySQL聚簇索引和非聚簇索引的原理及使用