HDOJ Eddy's digital Roots
来源:互联网 发布:淘宝主板为什么要交换 编辑:程序博客网 时间:2024/05/21 12:07
Eddy's digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3576 Accepted Submission(s): 2025
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>
int mi_mod(int n,int m,int mod)//二进制快速幂取模模板
{
int sum;
n%=mod;
sum=1;
while(m)
{
if(m%2)
sum=sum*n%mod;
m/=2;
n=n*n%mod;
}
return sum;
}
int dig(int x)//数的各位和模板
{
return (x+8)%9+1;
}
int main()
{
int n;
//freopen("in.txt","r",stdin);
while(scanf("%d",&n),n)
printf("%d\n",dig(mi_mod(n,n,9)));
return 0;
}
int mi_mod(int n,int m,int mod)//二进制快速幂取模模板
{
int sum;
n%=mod;
sum=1;
while(m)
{
if(m%2)
sum=sum*n%mod;
m/=2;
n=n*n%mod;
}
return sum;
}
int dig(int x)//数的各位和模板
{
return (x+8)%9+1;
}
int main()
{
int n;
//freopen("in.txt","r",stdin);
while(scanf("%d",&n),n)
printf("%d\n",dig(mi_mod(n,n,9)));
return 0;
}
- HDOJ Eddy's digital Roots
- 【HDOJ】1163 -> Eddy's digital Roots
- hdoj 1163 Eddy's digital Roots
- hdoj.1163 Eddy's digital Roots 20140813
- hdoj 1163 Eddy's digital Roots
- HDOJ 1163 Eddy's digital Roots
- Eddy's digital Roots
- Eddy's digital Roots
- Eddy's digital Roots
- Eddy's digital Roots
- Eddy's digital Roots
- HDOJ 1163 Eddy's digital Roots [简单数论]
- HDOJ 1163 Eddy's digital Roots [简单数论]
- HDOJ 1163 Eddy's digital Roots(简单数论)
- hdoj-1163-Eddy's digital Roots【九余数定理】
- HDU1163 Eddy's digital Roots
- HDU1163:Eddy's digital Roots
- hdu1163-Eddy's digital Roots
- HDOJ 1300
- 兴趣点分享的活用
- 零碎知识点
- ACM计算几何题目推荐
- 原来C语言也有正则表达式的库
- HDOJ Eddy's digital Roots
- Run-Time Check Failure #0错误
- 什么是REST?以及RESTful的实现之二
- cocos2d-06 粒子效果
- struts传送json到前台报错getHibernateLazyInitializer的解决方法
- jQuery EasyUI datagrid 无法选中多行
- 二进制快速幂取模模板
- linux定时器用法
- 项目估算与计划不是一般的难!(4)——计划有什么内容?