poj 1519 Digital Roots (计算根数字)
来源:互联网 发布:蚁群算法和遗传算法 编辑:程序博客网 时间:2024/04/30 07:23
一、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.
二、题解
本来只用数字操作的,后来发现数字太大了。只能用字符串操作了。
三、java代码
二、题解
本来只用数字操作的,后来发现数字太大了。只能用字符串操作了。
三、java代码
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); String s; int i,sum; while(true){ s=cin.next(); if(s.charAt(0)==48) break; while(true){ sum=0; for(i=0;i<s.length();i++){ sum+=s.charAt(i)-48; } if(0<sum&&sum<=9){ System.out.println(sum); break; }else s=""; s+=sum; } } } }
- poj 1519 Digital Roots (计算根数字)
- POJ 1519 Digital Roots
- poj 1519 Digital Roots
- POJ 1519 Digital Roots
- poj 1519 Digital Roots
- POJ 1519 Digital Roots
- POJ 1519:Digital Roots
- POJ 1519 Digital Roots G++
- 数根计算ZOJ 1115 Digital Roots
- POJ 1519 Digital Roots -- from lanshui_Yang
- 1519 Digital Roots
- hdu 1013 Digital Roots【数根计算 余九解法】
- POJ 1519 && HDU 1013 Digital Roots(数论)
- HDU 1013 Digital Roots(模拟计算)
- Digital Roots
- Digital Roots
- Digital Roots
- Digital Roots
- 机器视觉相关代码集合
- 基于全志A20 android4.2平台如何支持三个SD卡
- 学生信息管理系统问题(二)
- android Sensor(二)介绍
- hdu 1465 不容易系列之一
- poj 1519 Digital Roots (计算根数字)
- The Linux Kernel Module Programming Guide
- android读取资源文件的方法
- 个人对jdk的安装流程见解
- android中控件ListView的简单实用例子
- Linux--9:Linux中的TTY
- 最长回文子串(Manacher算法)
- C语言可变参数的实现详解
- follow me