結果
問題 | No.81 すべて足すだけの簡単なお仕事です。 |
ユーザー | watarimaycry2 |
提出日時 | 2021-02-07 00:35:03 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 63 ms / 5,000 ms |
コード長 | 3,201 bytes |
コンパイル時間 | 5,105 ms |
コンパイル使用メモリ | 79,852 KB |
実行使用メモリ | 50,800 KB |
最終ジャッジ日時 | 2023-09-29 22:58:12 |
合計ジャッジ時間 | 5,774 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
50,528 KB |
testcase_01 | AC | 55 ms
50,400 KB |
testcase_02 | AC | 56 ms
50,480 KB |
testcase_03 | AC | 44 ms
49,720 KB |
testcase_04 | AC | 55 ms
50,684 KB |
testcase_05 | AC | 47 ms
50,116 KB |
testcase_06 | AC | 51 ms
50,024 KB |
testcase_07 | AC | 48 ms
49,968 KB |
testcase_08 | AC | 48 ms
50,128 KB |
testcase_09 | AC | 50 ms
50,768 KB |
testcase_10 | AC | 53 ms
50,188 KB |
testcase_11 | AC | 53 ms
50,476 KB |
testcase_12 | AC | 57 ms
50,396 KB |
testcase_13 | AC | 53 ms
50,360 KB |
testcase_14 | AC | 56 ms
50,800 KB |
testcase_15 | AC | 59 ms
50,704 KB |
testcase_16 | AC | 63 ms
50,740 KB |
testcase_17 | AC | 59 ms
50,272 KB |
testcase_18 | AC | 57 ms
50,280 KB |
testcase_19 | AC | 58 ms
50,448 KB |
testcase_20 | AC | 59 ms
50,508 KB |
testcase_21 | AC | 58 ms
50,320 KB |
testcase_22 | AC | 58 ms
50,272 KB |
testcase_23 | AC | 59 ms
50,508 KB |
testcase_24 | AC | 58 ms
50,376 KB |
testcase_25 | AC | 53 ms
50,284 KB |
testcase_26 | AC | 56 ms
50,320 KB |
testcase_27 | AC | 54 ms
50,168 KB |
testcase_28 | AC | 54 ms
50,404 KB |
testcase_29 | AC | 55 ms
50,440 KB |
ソースコード
import java.util.*; import java.io.*; import java.math.*; public class Main{ //Don't have to see. start------------------------------------------ static class InputIterator{ ArrayList<String> inputLine = new ArrayList<>(1024); int index = 0; int max; String read; InputIterator(){ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); try{ while((read = br.readLine()) != null){ inputLine.addAll(Arrays.asList(read.split(" "))); } }catch(IOException e){} max = inputLine.size(); } boolean hasNext(){return (index < max);} String next(){ if(hasNext()){ return inputLine.get(index++); }else{ throw new IndexOutOfBoundsException("There is no more input"); } } } static HashMap<Integer, String> CONVSTR = new HashMap<>(); static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem. static PrintWriter out = new PrintWriter(System.out); static void flush(){out.flush();} static void myout(Object t){out.println(t);} static void myerr(Object t){System.err.print("debug:");System.err.println(t);} static String next(){return ii.next();} static boolean hasNext(){return ii.hasNext();} static int nextInt(){return Integer.parseInt(next());} static long nextLong(){return Long.parseLong(next());} static double nextDouble(){return Double.parseDouble(next());} static ArrayList<String> nextCharArray(){return myconv(next(), 0);} static ArrayList<String> nextStrArray(int size){ ArrayList<String> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(next()); } return ret; } static ArrayList<Integer> nextIntArray(int size){ ArrayList<Integer> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Integer.parseInt(next())); } return ret; } static ArrayList<Long> nextLongArray(int size){ ArrayList<Long> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Long.parseLong(next())); } return ret; } @SuppressWarnings("unchecked") static String myconv(Object list, int no){//only join String joinString = CONVSTR.get(no); if(list instanceof String[]){ return String.join(joinString, (String[])list); }else if(list instanceof ArrayList){ return String.join(joinString, (ArrayList)list); }else{ throw new ClassCastException("Don't join"); } } static ArrayList<String> myconv(String str, int no){//only split String splitString = CONVSTR.get(no); return new ArrayList<String>(Arrays.asList(str.split(splitString))); } public static void main(String[] args){ CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, ""); solve();flush(); } //Don't have to see. end------------------------------------------ static void solve(){//Here is the main function int N = nextInt(); BigDecimal sum = new BigDecimal("0"); for(int i = 0; i < N; i++){ sum = sum.add(new BigDecimal(next())); } String s = sum.toString(); if(!s.contains(".")){ s += ".0000000000"; }else{ int index = s.indexOf("."); while(s.substring(index + 1, s.length()).length() < 10){ s += "0"; } } myout(s); } //Method addition frame start //Method addition frame end }