結果
問題 | No.8072 Sum of sqrt(x) |
ユーザー | watarimaycry2 |
提出日時 | 2020-09-12 18:54:48 |
言語 | Java21 (openjdk 21) |
結果 |
OLE
|
実行時間 | - |
コード長 | 3,029 bytes |
コンパイル時間 | 3,177 ms |
コンパイル使用メモリ | 82,296 KB |
実行使用メモリ | 167,308 KB |
最終ジャッジ日時 | 2024-06-10 17:58:22 |
合計ジャッジ時間 | 22,845 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
43,128 KB |
testcase_01 | AC | 55 ms
37,784 KB |
testcase_02 | AC | 55 ms
37,684 KB |
testcase_03 | AC | 57 ms
37,604 KB |
testcase_04 | AC | 55 ms
37,884 KB |
testcase_05 | AC | 56 ms
37,240 KB |
testcase_06 | AC | 57 ms
37,576 KB |
testcase_07 | OLE | - |
testcase_08 | AC | 1,046 ms
134,284 KB |
testcase_09 | OLE | - |
testcase_10 | OLE | - |
testcase_11 | OLE | - |
testcase_12 | TLE | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
ソースコード
import java.util.*; import java.io.*; import java.math.*; public class Main{ static void solve(){//Here is the main function int N = nextInt(); BigDecimal sum = new BigDecimal("0.000000000000000000"); for(int i = 0; i < N; i++){ long xi = nextLong(); sum = sum.add(new BigDecimal(String.valueOf(Math.sqrt(xi)))); myout(sum.toString()); } } //Method addition frame start //Method addition frame end //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.add(read); } }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> nextStrArray(){return myconv(next(), 8);} static ArrayList<String> nextCharArray(){return myconv(next(), 0);} static ArrayList<Integer> nextIntArray(){ ArrayList<String> input = nextStrArray(); ArrayList<Integer> ret = new ArrayList<>(input.size()); for(int i = 0; i < input.size(); i++){ ret.add(Integer.parseInt(input.get(i))); } return ret; } static ArrayList<Long> nextLongArray(){ ArrayList<String> input = nextStrArray(); ArrayList<Long> ret = new ArrayList<>(input.size()); for(int i = 0; i < input.size(); i++){ ret.add(Long.parseLong(input.get(i))); } return ret; } 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------------------------------------------ }