hdu--1013--Digital Roots(字符串)
2024-10-18 22:30:15
Digital Roots
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 77503 Accepted Submission(s): 24224
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
/* Name: hdu--1013--Digital Roots Copyright: ©2017 日天大帝 Author: 日天大帝 Date: 22/04/17 10:34 Description: 这个题,就是特别坑 如果你一开始把所有的值设置为int型,恭喜你,你会得到一个WA 接着你大概会改成unsigned型,恭喜你,你会得到一个超时 然后你终于恍然大悟,用字符串!! */ #include<iostream> #include<string> using namespace std; int main(){ ios::sync_with_stdio(false); string str; ") { ; ; ){ int temp = sum; sum = ; while(temp){ sum += temp%; temp /= ; } } cout<<sum<<endl; } ; }
最新文章
- visual studio installer 打包123
- Redis系列(四)-低成本高可用方案设计
- BOOST.Asio——扫盲
- TCP Fast Open
- Scalaz(47)- scalaz-stream: 深入了解-Source
- [转]PHP中fopen,file_get_contents,curl的区别
- bzoj1227 [SDOI2009]虔诚的墓主人(组合公式+离散化+线段树)
- Android CTS 测试总结【转】
- vim粘贴代码问题
- Java List Remove时要注意的细节
- 使用ACR122U NFC读卡器对M1卡进行读写操作(可以读写中文)
- testXSS <;img src=";aa"; onerror=";javascript:alert(&#39;XSS&#39;);";/>;
- Day7--Python--基础数据类型补充,集合,深浅拷贝
- yolov3实践(二)
- 第七章 :分布式监控与SNMP监控
- 【转】28个Unix/Linux的命令行神器
- vcenter server appliance(vcsa) 配置IP的方法
- python datetime unix时间戳以及字符串时间戳转换
- 007-Redi-命令-脚本命令、链接命令、服务器命令、事务、HyperLogLog
- Linux博客系统服务器搭建