zoukankan      html  css  js  c++  java
  • 杭电1407--Integer Inquiry

    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
     

     

    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
    ") ;
    37             if(n != 0)
    38             printf("
    ") ;
    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("
    ") ;
    49         if(n != 0)
    50         printf("
    ") ;
    51     }
    52     return 0 ;    
    53 } 
  • 相关阅读:
    aspnet_Membership_SetPassword
    FlipView使用
    结构之法字符串及链表的探索编程之美第3章
    window和linux下svn的使用
    【算法导论第13章】红黑树
    【算法导论】第16章贪心算法
    【算法导论】第15章动态规划
    ubuntu11.04下myeclipse开发环境的搭建(jdk6+tomcat6+myeclipse8.0+mysql)
    【matlab】在vc6.0中调用matlab中的正态分布产生随机数
    gnome/gtk+开发环境搭建
  • 原文地址:https://www.cnblogs.com/soTired/p/4674621.html
Copyright © 2011-2022 走看看