Digital Roots
来源:互联网 发布:网络侵犯名誉权的法律 编辑:程序博客网 时间:2024/05/02 02:28
FJNU.1095
PKU.1519
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.
Input
The input file will contain a list of positive integers, one per line. The end of the input will be indicated by an integer value of zero.
Output
For each integer in the input, output its digital root on a separate line of the output.
Sample Input
24
39
0
Sample Output
6
3
Source
Greater New York 2000
My Program
#include<string.h>
#define M 500
#define N 1000
using namespace std;
int Count(char str[])
...{
int sum=0;
int i,n=strlen(str);
for(i=0;i<n;i++)
sum+=str[i]-'0';
if(sum>9)
...{
i=0;
while(sum>9)
...{
str[i++]='0'+sum%10;
sum/=10;
}
str[i++]='0'+sum;
str[i]='/0';
sum=Count(str);
}
return sum;
}
int main()
...{
int m=0;
int n[M]=...{0};
char str[N];
while(true)
...{
gets(str);
if(!strcmp(str,"0"))
break;
n[m++]=Count(str);
}
for(int i=0;i<m;i++)
cout<<n[i]<<endl;
return 0;
}
YOYO's Note:
高精度,一直加到个位数即可……
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- 数组与指针
- jet2的一些学习笔记(1)
- Financial Management
- 程序员成长最快的环境
- MUD中安全谈
- Digital Roots
- 信息与消防预案系统简介
- 分解素因子
- The different types of polymorphism in OOP-面向对象程序设计中的多态类型
- PMP精要
- 设定DIV最小高度还能被撑开(IE与FF都兼容)
- Hangover
- IE6/IE7和Firefox对Div处理的差异
- IE6,IE7,FF | CSS + DIV 兼容问题综合解决方案CSS HACK