Eddy's digital Roots 1163 (数学+九余数定理)
来源:互联网 发布:rc4算法故事 编辑:程序博客网 时间:2024/05/17 08:30
Eddy's digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5278 Accepted Submission(s): 2952
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//九余数定理#include<stdio.h>#include<string.h>int main(){int n;while(scanf("%d",&n),n){int a;a=n;for(int i=2;i<=n;i++)a=a*n%9;if(a==0)printf("9\n");elseprintf("%d\n",a);}return 0;}
0 0
- Eddy's digital Roots 1163 (数学+九余数定理)
- [数学 九余数定理] HDU 1163 Eddy's digital Roots
- Hdu-1163 Eddy's digital Roots(九余数定理)
- Hdu 1163 Eddy's digital Roots(九余数定理)
- HDU 1163 Eddy's digital Roots(九余数定理)
- hdu 1163 Eddy's digital Roots(九余数定理)
- HDU 1163 Eddy's digital Roots(九余数定理)
- hdoj-1163-Eddy's digital Roots【九余数定理】
- [ACM - 数论]Eddy's digital Roots(九余数定理)
- HDU——1163Eddy's digital Roots(九余数定理+同余定理)
- HDU——1163Eddy's digital Roots(九余数定理+同余定理)
- 杭电1163--Eddy's digital Roots (九余数定理)
- hdu 1163 Eddy's digital Roots(九余数定理,快速幂)
- Hdu 1163 Eddy's digital Roots + NYOJ-485 A*B Problem(九余数定理)
- HDU-#1163 Eddy's digital Roots(九余数定理+同余)
- HDOJ 1163 Eddy's digital Roots(九余数定理的应用)
- HDU 1163 Eddy's digital Roots 【九余数定理 Or 规律(瞎搞)】
- 九余数定理——hdu_1163 Eddy's digital Roots
- WebRTC VideoEngine超详细教程(二)——集成OPENH264编解码器
- 机器学习-监督式学习
- IARforAVR中的EEPROM读写需要注意的小问题
- Eclipse+Pydev开发环境 Python
- aop的需求分析:错误异常分析
- Eddy's digital Roots 1163 (数学+九余数定理)
- WebRTC VideoEngine超详细教程(三)——集成X264编码和ffmpeg解码
- python实现快速排序
- TestLink的安装过程 Mantis的安装
- POJ 2096 Collecting Bugs(0)
- hdu 1003 max sum
- 【Retinex】【Frankle-McCann Retinex】matlab代码注释
- linux下重启tomcat报错(Error code 4 )
- Leetcode#6ZigZag Conversion