杭电1407--Integer Inquiry

最新推荐文章于 2024-09-13 17:30:19 发布

weixin_34389926

最新推荐文章于 2024-09-13 17:30:19 发布

阅读量97

点赞数

文章标签： java

原文链接：http://www.cnblogs.com/soTired/p/4674621.html

版权

Integer Inquiry

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

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

Recommend

We have carefully selected several similar problems for you: 1063 1316 1715 1753 1018

//AC:

 1 #include <stdio.h>
 2 #include <string.h>
 3 char str[110] ;
 4 int num[100], ans[10010] ; 
 5 int main()
 6 {
 7     int i, n, j ;
 8     int len, flag ;
 9     scanf("%d", &n) ;
10     while(n--)
11     {
12         int total = 0 ;
13         memset(ans, 0, sizeof(ans)) ;
14         while(~scanf("%s", str))
15         {
16             if(strcmp(str, "0") == 0)
17             break ;
18             total++ ;
19             
20             int len = strlen(str) ;
21             for(j=0, i=len-1; i>=0; i--)
22             num[j++] = str[i] - '0' ;
23             for(i = 0; i < len; i++)
24             ans[i] += num[i] ;
25             for(i=0; i<10009; i++)
26             {
27                 if(ans[i] > 9)
28                 {
29                     ans[i] -= 10 ;
30                     ans[i+1] += 1 ;    
31                 }    
32             } 
33         }
34         if(total == 0)    //只输入一个零 ；WA了很多次；  
35         {
36             printf("0\n") ;
37             if(n != 0)
38             printf("\n") ;
39             continue ;
40         }
41         for(i = 10008; i >= 0; i--)
42         {
43             if(ans[i])
44             break ;
45         }
46         for(; i>=0; i--)
47         printf("%d",ans[i]) ;
48         printf("\n") ;
49         if(n != 0)
50         printf("\n") ;
51     }
52     return 0 ;    
53 }