时间限制:1秒 空间限制:65536K
题目描述:
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 input file will contain a list of positive integers, one per line.
The integer may consist of a large number of digits.
输出描述:
For each integer in the input, output its digital root on a separate line of the output.
输入:
24
39
输出:
6
3
#include <stdio.h>
int main() {
int ans;
while(scanf("%d" , &ans) != EOF) {
while(ans >= 10) {
int tmp = ans % 10;
ans = tmp + (ans / 10);
}
printf("%d\n" , ans);
}
return 0;
}
/**************************************************************
状态:答案正确 运行时间:4 ms 占用内存:428K 使用语言:C
****************************************************************/
题目大意是让求数根,例如39,3+9=12,1+2=3,由于3<10,则3为39这个数的数根。
这道题我使用了一个比较讨巧的办法,即猜测第一次各位累加后的和小于100。要是想让第一次各位累加和大于等于100,起码得给出一个12位的数,因此可推测第一次各位累加和大概率小于100。虽讨巧,但不推荐。
下面这种是较为健壮的方法:
#include <stdio.h>
int main() {
int ans;
while(scanf("%d" , &ans) != EOF) {
while(ans >= 10) {
int buf[20], size = 0;
while(ans != 0) {
buf[size++] = ans % 10;
ans /= 10;
}
for(int i = 0 ; i < size ; i++) {
ans += buf[i];
}
}
printf("%d\n" , ans);
}
return 0;
}
/**************************************************************
状态:答案正确 运行时间:4 ms 占用内存:612K 使用语言:C
****************************************************************/