日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

HDOJ 1047 Integer Inquiry

發布時間:2025/3/8 编程问答 18 豆豆
生活随笔 收集整理的這篇文章主要介紹了 HDOJ 1047 Integer Inquiry 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.


JAVA瞼板....

Integer Inquiry

Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12042????Accepted Submission(s): 3037


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


import java.util.*; import java.math.*;public class Main {public static void main(String[] args){Scanner cin= new Scanner(System.in);int n=cin.nextInt();boolean flag=false;while(n-->0){if(flag==false) flag=true;else System.out.println("");BigInteger ans=BigInteger.ZERO;while(cin.hasNextBigInteger()){BigInteger m=cin.nextBigInteger();if(m.equals(BigInteger.ZERO))break;ans=ans.add(m);}System.out.println(ans);}} }


版權聲明:本文博客原創文章,博客,未經同意,不得轉載。

總結

以上是生活随笔為你收集整理的HDOJ 1047 Integer Inquiry的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。