专栏首页小樱的经验随笔HDU 1013 Digital Roots【字符串,水】

HDU 1013 Digital Roots【字符串,水】

Digital Roots

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 79339    Accepted Submission(s): 24800

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.

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

Source

Greater New York 2000

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1013

分析:很智障的题,我当时一直在想这怎么处理数字问题,没考虑这输入数字无限大的问题,sb啊,直接字符串从低到高位搞一下就好了,每一位处理即可! 下面给出AC代码:

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 int main()
 4 {
 5     string str;
 6     while(cin>>str&&str!="0")
 7     {
 8         int num=0;
 9         for(int i=0;i<str.length();i++)
10         {
11             num+=str[i]-'0';
12             if(num>9)
13                 num=num/10+num%10;
14         }
15         cout<<num<<endl;
16     }
17     return 0;
18 }

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

我来说两句

0 条评论
登录 后参与评论

相关文章

  • Codeforces Round #345 (Div. 2)【A.模拟,B,暴力,C,STL,容斥原理】

    A. Joysticks time limit per test:1 second memory limit per test:256 megabytes in...

    Angel_Kitty
  • Codeforces Round #301 (Div. 2)(A,【模拟】B,【贪心构造】C,【DFS】)

    A. Combination Lock time limit per test:2 seconds memory limit per test:256 mega...

    Angel_Kitty
  • Codeforces Round #426 (Div. 2)【A.枚举,B.思维,C,二分+数学】

    A. The Useless Toy time limit per test:1 second memory limit per test:256 megaby...

    Angel_Kitty
  • 在线matlab代码学习神器Octave Online

    Octave与MATLAB完全兼容,免安装使用方便。注册和非注册功能会有不同,如下:

    zhangrelay
  • 在线matlab代码学习神器Octave Online

    Octave与MATLAB完全兼容,免安装使用方便。注册和非注册功能会有不同,如下:

    zhangrelay
  • SAP WebClient UI页面标签的决定逻辑介绍

    In this blog we have discussed the logic how the correct UI view configuration i...

    Jerry Wang
  • Analyze tweets in under 30 minutes using Node-RED

    I created a Node-RED app in Bluemix which searches for a specified keyword, user...

    首席架构师智库
  • 统计学中的区间估计

    统计学中有两大分支——描述性统计学(description stats)和推断性统计学(inference stats)。 推断性统计学中,很重要的一点就是...

    用户1147754
  • AIX6.1 线程模型说明

    引文:线程模型(Threading Model)默认从进程域 (M:N 模型 ) 改为系统全局域 (1:1 模型 )

    数据饕餮
  • Python Context Managers

    Sometimes, there is a need to execute some operations between another pair of op...

    用户2936342

扫码关注云+社区

领取腾讯云代金券