結果

問題 No.40 多項式の割り算
ユーザー hhgfhn1hhgfhn1
提出日時 2018-12-27 18:42:18
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 3,176 bytes
コンパイル時間 2,015 ms
コンパイル使用メモリ 80,140 KB
実行使用メモリ 46,816 KB
最終ジャッジ日時 2024-10-01 14:53:27
合計ジャッジ時間 7,335 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
37,088 KB
testcase_01 AC 56 ms
37,216 KB
testcase_02 AC 60 ms
37,756 KB
testcase_03 AC 58 ms
37,540 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 RE -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 AC 55 ms
37,380 KB
testcase_33 WA -
testcase_34 WA -
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
public static void main(String args[]) {
FastScanner scanner = new FastScanner();
int d=scanner.nextInt();
int[] a=new int[d+1];
for(int i=0;i<=d;i++) {
a[i]=scanner.nextInt();
}
int s = d;
while (s != 2) {
for (int i = 9; i >= 0; i--) {
if (a[s] < 1 * i)
continue;
else if (a[s] == 1 * i && a[s - 1] < 0)
continue;
else if (a[s] == 1 * i && a[s - 1] == 0 && a[s - 2] < -1 * i)
continue;
else if (a[s] == 1 * i && a[s - 1] == 0 && a[s - 2] == -1 * i && a[s - 3] < 0)
continue;
a[s] = a[s] - 1 * i;
a[s - 1] = a[s - 1] - 0;
a[s - 2] = a[s - 2] - (-1 * i);
a[s - 3] = a[s - 3] - 0;
break;
}
s--;
}
int st=0;
for(int i=0;i<=d;i++) {
if(a[i]!=0) {
st=i;
break;
}
}
int en=0;
for(int i=d;i>=0;i--) {
if(a[i]!=0) {
en=i;
break;
}
}
System.out.println(en);
for(int i=st;i<=en;i++) {
System.out.print(a[i]+" ");
}
System.out.println();
}
}
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;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; 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() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0