数根计算ZOJ 1115 Digital Roots
2014-04-20 21:57
288 查看
提交地址http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1115
Digital Roots
Time Limit: 2 Seconds
Memory Limit: 65536 KB
Background
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.
Example
Input
Output
数根的问题从经不知一次的遇到,经常遇到一些不同的做法
先说一下我们常规思维,把每位相加
今天我看到一个数学的方法 , 首先将各个数加起来,一个整数模9的结果与这个整数每位模9之和相等。
我感觉模很神奇,经常遇到,明天写篇关于模运算的。
好了!
感谢自己继续坚持!
Digital Roots
Time Limit: 2 Seconds
Memory Limit: 65536 KB
Background
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.
Example
Input
24 39 0
Output
6 3
数根的问题从经不知一次的遇到,经常遇到一些不同的做法
先说一下我们常规思维,把每位相加
#include<string.h> #include<stdio.h> int main() { char a[1001]; while(scanf("%s",a)!=EOF) { if(strcmp(a,"0")==0) { return 0; } int sum =0; for(int i=0;i<strlen(a);i++) { sum+=a[i]-'0'; } while(sum/10!=0) { int t = sum; sum=0; while(t!=0) { sum+=t%10; t/=10; } } printf("%d\n",sum); } }
今天我看到一个数学的方法 , 首先将各个数加起来,一个整数模9的结果与这个整数每位模9之和相等。
我感觉模很神奇,经常遇到,明天写篇关于模运算的。
#include<stdio.h> #include<string.h> int main() { char a[1001]; while(scanf("%s",a)==1) { if(strcmp(a,"0")==0) { break; } int sum =0; for(int i=0;i<strlen(a);i++) { sum+=a[i]-'0'; } if(sum%9==0) printf("9\n"); else printf("%d\n",sum%9); } }
好了!
感谢自己继续坚持!
相关文章推荐
- ZOJ 1115 Digital Roots
- hdu 1013 Digital Roots【数根计算 余九解法】
- ZOJ 1115 Digital Roots(简单,字符串与数)
- zoj 1115 Digital Roots
- zoj 1115 Digital Roots
- zoj 1115 Digital Roots
- zoj 1115 Digital Roots
- php - zoj 1115 Digital Roots
- ZOJ 1115 Digital Roots
- ZOJ Problem 1115 Digital Roots
- ZOJ 1115 Digital Roots
- ZOJ 1115-Digital Roots
- ZOJ Problem Set - 1115||Digital Roots
- zoj 1115 Digital Roots
- ZOJ_1115_Digital Roots
- zoj 1115 Digital Roots
- ZOJ 1115 Digital Roots 水题
- ZOJ 1115 Digital Roots
- zoj1115-Digital Roots
- zoj1115 Digital Roots