ZOJ Problem Set - 1115||Digital Roots

Digital Roots

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

Background

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.

Example

Input

24390

Output

63

一开始以为只需要用int来存储输入的数字，后来觉得应该用字符串来存储，开了个20大的字符串，无奈之下开了1000，竟然AC了~~

#include <iostream>#include <stdio.h>#include <string.h>using namespace std;int main(){char s[1000];int sum, i,len,n;while (scanf("%s", s) != EOF){sum = 0;for (i = 0; i < strlen(s); i++){sum += s[i] - '0';}if (sum==0)break;else{while (sum >= 10){n = sum;sum = 0;while (n){sum += n % 10;n = n / 10;}}cout << sum << endl;}}return 0;}