九余数定理
来源:互联网 发布:大数据需要的java基础 编辑:程序博客网 时间:2024/06/06 03:00
hdu 1163
Eddy's digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4634 Accepted Submission(s): 2580
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九余数定理
一个数对九取余后的结果称为九余数。
一个数的各位数字之和想加后得到的<10的数字称为这个数的九余数(如果相加结果大于9,则继续各位相加)
很简单的一道题,做过之后就忘了,没想到这么简单代码:#include<stdio.h>int main(){int n;int t;int i;while(~scanf("%d",&n),n!=0){t=1;for(i=0;i<n;i++) { t*=n; t=t%9; } if(t==0) printf("%d\n",9); else printf("%d\n",t);}return 0;}
0 0
- 九余数定理
- 九余数定理
- 九余数定理
- 九余数定理
- 九余数定理
- HDU1163九余数定理
- 九余数定理扩展
- HDU1163【九余数定理】【水题】
- HDU-1013九余数定理
- nyoj 485 九余数定理
- nyoj 424 && 485(九余数定理)
- 九余数定理及证明 hdu 1163
- hdu 1163(九余数定理)
- hdu1013 Digital Roots (模拟||九余数定理)
- 九余数定理(hdu-P1163)
- hdu 1013 Digital Roots (九余数定理)
- 求a+b及九余数定理
- hdu1163Eddy's digital Roots(九余数定理+同余定理)
- fedora 20 , 64位系統下,rime 輸入法 ,五筆86, 簡繁轉換 之實現
- CQRS 和 EVENT SOURCING的例子读后感
- 【BZOJ】【P3524】【Poi2014】【Couriers】【题解】【整体二分】
- hibernate Select大全
- 基于PHP的简单文件WEB在线文件管理
- 九余数定理
- 程序计数器(计算运行该程序所需的时间)
- 如何下载chrome插件
- zoj 3288 Domination (概率dp)
- WebScarab-NG 打开时数据库选择问题
- hdu 2071 Max Num
- Struts2的ResultType和Action处理链
- Hadoop与分布式开发
- Linux /proc目录详解