結果
問題 | No.72 そろばん Med |
ユーザー | watarimaycry2 |
提出日時 | 2020-06-28 18:14:57 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 85 ms / 5,000 ms |
コード長 | 3,527 bytes |
コンパイル時間 | 2,883 ms |
コンパイル使用メモリ | 77,608 KB |
実行使用メモリ | 51,180 KB |
最終ジャッジ日時 | 2023-09-22 06:40:24 |
合計ジャッジ時間 | 6,357 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
50,688 KB |
testcase_01 | AC | 77 ms
50,684 KB |
testcase_02 | AC | 77 ms
51,036 KB |
testcase_03 | AC | 77 ms
50,928 KB |
testcase_04 | AC | 79 ms
50,572 KB |
testcase_05 | AC | 77 ms
50,880 KB |
testcase_06 | AC | 77 ms
50,920 KB |
testcase_07 | AC | 78 ms
50,808 KB |
testcase_08 | AC | 78 ms
50,856 KB |
testcase_09 | AC | 77 ms
50,852 KB |
testcase_10 | AC | 79 ms
50,736 KB |
testcase_11 | AC | 78 ms
50,820 KB |
testcase_12 | AC | 78 ms
50,944 KB |
testcase_13 | AC | 79 ms
50,952 KB |
testcase_14 | AC | 79 ms
50,908 KB |
testcase_15 | AC | 77 ms
50,852 KB |
testcase_16 | AC | 77 ms
51,108 KB |
testcase_17 | AC | 77 ms
50,740 KB |
testcase_18 | AC | 79 ms
50,804 KB |
testcase_19 | AC | 78 ms
51,100 KB |
testcase_20 | AC | 78 ms
50,804 KB |
testcase_21 | AC | 79 ms
48,800 KB |
testcase_22 | AC | 78 ms
50,912 KB |
testcase_23 | AC | 77 ms
50,912 KB |
testcase_24 | AC | 78 ms
50,980 KB |
testcase_25 | AC | 77 ms
48,820 KB |
testcase_26 | AC | 85 ms
51,180 KB |
ソースコード
import java.util.*;import java.io.*;import java.math.*; public class Main{ //↓見なくていいよ!ここから------------------------------------------ static class InputIterator{ ArrayList<String> inputLine = new ArrayList<String>(1024); int index = 0; int max; InputIterator(){ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); while(true){ String read; try{ read = br.readLine(); }catch(IOException e){ read = null; } if(read != null){ inputLine.add(read); }else{ break; } } max = inputLine.size(); } boolean hasNext(){return (index < max);} String next(){ if(hasNext()){ String returnStr = inputLine.get(index); index++; return returnStr; }else{ throw new IndexOutOfBoundsException("これ以上入力はないよ"); } } } static InputIterator ii = new InputIterator();//リアクティブでは使えないので諦めてScanner使うこと 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 int nextInt(){return Integer.parseInt(next());} static long nextLong(){return Long.parseLong(next());} static ArrayList<String> nextStrArray(){return myHanSpSplit(next());} static ArrayList<String> myHanSpSplit(String str){return new ArrayList<String>(Arrays.asList(str.split(" ")));} static ArrayList<String> nextCharArray(){return mySingleSplit(next());} static ArrayList<String> mySingleSplit(String str){return new ArrayList<String>(Arrays.asList(str.split("")));} static ArrayList<Integer> nextIntArray(){ ArrayList<Integer> ret = new ArrayList<Integer>(); ArrayList<String> input = nextStrArray(); for(int i = 0; i < input.size(); i++){ ret.add(Integer.parseInt(input.get(i))); } return ret; } static ArrayList<Long> nextLongArray(){ ArrayList<Long> ret = new ArrayList<Long>(); ArrayList<String> input = nextStrArray(); for(int i = 0; i < input.size(); i++){ ret.add(Long.parseLong(input.get(i))); } return ret; } static String kaigyoToStr(String[] list){return String.join("\n",list);} static String kaigyoToStr(ArrayList<String> list){return String.join("\n",list);} static String hanSpToStr(String[] list){return String.join(" ",list);} static String hanSpToStr(ArrayList<String> list){return String.join(" ",list);} public static void main(String[] args){ Runtime rt = Runtime.getRuntime(); long mae = System.currentTimeMillis(); solve(); flush(); long ato = System.currentTimeMillis(); myerr("time : " + (ato - mae) + "ms"); myerr("memory : " + ((rt.totalMemory() - rt.getRuntime().freeMemory()) / 1024) + "KB"); } //↑見なくていいよ!ここまで------------------------------------------ static void solve(){//ここがメイン関数代わり BigInteger N = new BigInteger(next()); BigInteger low = N.divide(new BigInteger("2")); BigInteger high = N.add(new BigInteger("1")).divide(new BigInteger("2")); BigInteger mod = new BigInteger("1000007"); BigInteger output = low.add(high.multiply(low.add(new BigInteger("1")))).mod(mod); myout(output.toString()); } //Method addition frame start //Method addition frame end }