Digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 69567 Accepted Submission(s): 21759
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.
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 题目大意 考虑正整数24。添加2和4产生一个值为6。由于6是一个单一的数字,6是24的数字根。现在考虑正整数39。添加3和9的收益率12。由于12不是一个单一的数字, 这个过程必须重复。添加1和2产量的3,一个单一的数字,39个数字的根源。#include <stdio.h> #include<string.h> int main() { char a[1500]; int sum; while(scanf("%s",&a)!=EOF) { if(strlen(a)==1&&a[0]=='0') break; sum=0; for(int i=0;i<strlen(a);i++) { sum=sum+a[i]-'0'; if(sum>=10) sum=sum/10+sum%10; } printf("%d\n",sum); } return 0; }