poj 1519
来源:互联网 发布:百里守约 知乎 编辑:程序博客网 时间:2024/06/04 00:58
Digital Roots
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24050 Accepted: 7970
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
24390
Sample Output
63
Source
Greater New York 2000
#include<iostream>#include<string>using namespace std;int main(){ string str; cin>>str; while(str!="0"){ int i = str.size(); int j(0); for(int k=0;k<i;k++){ j = (j*10 + (str[k]-'0'))%9; } if(j==0){ j+=9; } cout<<j<<endl; cin>>str; } return 0;}
- poj 1519
- POJ 1519
- poj-1519
- POJ 1519 Digital Roots
- poj 1519 Digital Roots
- POJ 1519 - 水题找手感...
- POJ 1519 Digital Roots
- POJ 1519 digital root
- poj 1519 Digital Roots
- POJ 1519 Digital Roots
- POJ 1519 解题报告
- POJ 1519:Digital Roots
- POJ
- poj
- POJ
- POJ
- poj
- poj
- Struts2与JSON
- js中我最近使用到的2个时间方法,推荐一下
- 不用缓冲的IO和用缓冲的IO
- Eclipse中安装Maven插件 M2eclipse
- Linux时钟处理机制
- poj 1519
- 使用VirtualBox安装Android 4.2.2 x86
- 解决android sqlite 中"close() was never explicitly called on database" 与java线程同步
- 一致性哈希算法
- linux-2.6.32在mini2440开发板上移植(2)之移植yaffs2
- 一直想在RAM中跑uboot,省事,没想到
- v$sqltext
- java从零开始之一
- ubuntu无法安装vim软件包