結果
問題 | No.40 多項式の割り算 |
ユーザー | nCk_cv |
提出日時 | 2016-07-21 16:14:19 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 247 ms / 5,000 ms |
コード長 | 3,458 bytes |
コンパイル時間 | 2,754 ms |
コンパイル使用メモリ | 82,468 KB |
実行使用メモリ | 47,404 KB |
最終ジャッジ日時 | 2024-04-23 20:22:21 |
合計ジャッジ時間 | 10,456 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 120 ms
41,664 KB |
testcase_01 | AC | 133 ms
41,652 KB |
testcase_02 | AC | 110 ms
41,412 KB |
testcase_03 | AC | 131 ms
41,560 KB |
testcase_04 | AC | 216 ms
46,444 KB |
testcase_05 | AC | 229 ms
46,044 KB |
testcase_06 | AC | 245 ms
46,620 KB |
testcase_07 | AC | 245 ms
47,344 KB |
testcase_08 | AC | 160 ms
42,064 KB |
testcase_09 | AC | 221 ms
45,956 KB |
testcase_10 | AC | 236 ms
46,652 KB |
testcase_11 | AC | 223 ms
46,084 KB |
testcase_12 | AC | 202 ms
45,004 KB |
testcase_13 | AC | 236 ms
47,404 KB |
testcase_14 | AC | 221 ms
45,992 KB |
testcase_15 | AC | 224 ms
46,116 KB |
testcase_16 | AC | 240 ms
47,272 KB |
testcase_17 | AC | 197 ms
43,976 KB |
testcase_18 | AC | 240 ms
46,732 KB |
testcase_19 | AC | 247 ms
47,268 KB |
testcase_20 | AC | 218 ms
46,104 KB |
testcase_21 | AC | 194 ms
43,556 KB |
testcase_22 | AC | 188 ms
43,572 KB |
testcase_23 | AC | 196 ms
46,028 KB |
testcase_24 | AC | 226 ms
46,060 KB |
testcase_25 | AC | 128 ms
40,244 KB |
testcase_26 | AC | 128 ms
41,488 KB |
testcase_27 | AC | 128 ms
41,460 KB |
testcase_28 | AC | 113 ms
41,488 KB |
testcase_29 | AC | 127 ms
41,876 KB |
testcase_30 | AC | 132 ms
41,804 KB |
testcase_31 | AC | 135 ms
41,952 KB |
testcase_32 | AC | 129 ms
42,032 KB |
testcase_33 | AC | 131 ms
41,360 KB |
testcase_34 | AC | 128 ms
41,632 KB |
ソースコード
import java.awt.geom.Point2D; import java.io.*; import java.math.*; import java.util.*; import java.util.Map.*; class Main { public static void main(String[] args) { //FastScanner sc = new FastScanner(); Scanner sc = new Scanner(System.in); int D = sc.nextInt(); int[] a = new int[D+1]; for(int i = 0; i <= D; i++) { a[i] = sc.nextInt(); } for(int i = D; i > 2; i--) { int tmp = a[i]; a[i] = 0; a[i-2] -= -tmp; } int[] DD = new int[10]; int tmp = 0; IN:for(int i = D; i >= 0; i--) { if(a[i] != 0) { tmp = i; for(int j = i; j >= 0; j--) { DD[j] = a[j]; } break IN; } } System.out.println(tmp); System.out.print(DD[0]); for(int i = 1; i <= tmp; i++) System.out.print(" " + DD[i]); System.out.println(); } static class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } } }