杭电 Problem 1047 Integer Inquiry【大数水题】

最新推荐文章于 2024-11-15 18:38:47 发布

weixin_34162629

最新推荐文章于 2024-11-15 18:38:47 发布

阅读量92

点赞数

文章标签： java

原文链接：http://www.cnblogs.com/cniwoq/p/6770942.html

版权

Integer Inquiry

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 17765 Accepted Submission(s): 4625

Problem Description

One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.
``This supercomputer is great,'' remarked Chip. ``I only wish Timothy were here to see these results.'' (Chip moved to a new apartment, once one became available on the third floor of the Lemon Sky apartments on Third Street.)

Input

The input will consist of at most 100 lines of text, each of which contains a single VeryLongInteger. Each VeryLongInteger will be 100 or fewer characters in length, and will only contain digits (no VeryLongInteger will be negative).

The final input line will contain a single zero on a line by itself.

Output

Your program should output the sum of the VeryLongIntegers given in the input.

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

Sample Input

    1 123456789012345678901234567890 123456789012345678901234567890 123456789012345678901234567890 0 
  

Sample Output

    370370367037037036703703703670 
  

Source

East Central North America 1996

只是要注意测试数据

就在这里WA了n次。。。

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <iostream>
#define MAX_N   205
#define MAX(a, b) (a > b)? a: b
#define MIN(a, b) (a < b)? a: b
using namespace std;

char c[MAX_N], s[MAX_N];
int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        memset(c, '0', sizeof(c));
        while (scanf("%s", s) != EOF) {
            int len2 = strlen(s);
            if (strcmp(s, "0") == 0) break;
            for (int i = 0; i < len2; i++) {
                c[i] = c[i] + s[len2 - 1 - i] - '0' - '0';
                if (c[i] > 9) {
                    c[i] -= 10;
                    c[i + 1] += 1;
                }
                c[i] += '0';
            }
        }
        int i;
        for (i = 200; i >= 0; i--) {
            if (c[i] != '0') break;
        }
        if (i == -1)    printf("0");
        for (; i >= 0; i--) {
            printf("%c", c[i]);
        }
        printf("\n");
        if (t) {
            printf("\n");
        }
    }
    return 0;
}

转载于:https://www.cnblogs.com/cniwoq/p/6770942.html