ZOJ 1115 Digital Roots
2012-10-31 08:26
344 查看
典型大数加法题
#include <stdio.h> #include <string> #include <iostream> #include <string.h> using namespace std; int main() { string num; while (cin >> num, num[0] != '0') { while (num.length() > 1) { string sum = "0"; for (int i = 0; i < num.length(); i++) { int temp = num[i] - '0'; int index = 0; while (temp > 0) { if (index == sum.length()) { sum += "0"; } int s = (sum[index] - '0') + temp; sum[index++] = '0' + s % 10; temp = s / 10; } } num = sum; } printf("%s\n", num.c_str()); } return 0; }
相关文章推荐
- 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 Problem Set - 1115||Digital Roots
- ZOJ 1115 Digital Roots
- ZOJ_1115_Digital Roots
- ZOJ 1115-Digital Roots
- zoj1115-Digital Roots
- zoj 1115 Digital Roots
- zoj1115 Digital Roots
- zoj 1115 Digital Roots
- ZOJ Problem 1115 Digital Roots
- php - zoj 1115 Digital Roots
- zoj 1115 Digital Roots
- ZOJ 1115 Digital Roots(简单,字符串与数)
- ZOJ Problem Set - 1115 Digital Roots
- ZOJ 1115 Digital Roots