HDU 1013 Digital Roots (无限大数)
发布时间:2020-12-14 05:01:41 所属栏目:大数据 来源:网络整理
导读:Time limit 1000 ms Memory limit 32768 kB 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 tw
Time limit 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 24 39 0 Sample Output 6 3 思路: 代码: #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
long long Sep(long long N){
int mid=0;
while(N){
mid += N%10;
N /= 10;
}
return mid;
}
int main(){
string N;
while(cin>>N){
if(N == "0")break;
int len = N.length();
long long mid = 0;
for(int i=0 ; i<len ; i++){
mid += (long long)(N[i] - '0');
}
while(mid>=10)mid = Sep(mid);
printf("%lldn",mid);
}
return 0;
}
(编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |