結果

問題 No.782 マイナス進数
ユーザー kusomushikusomushi
提出日時 2019-07-10 19:24:08
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,894 bytes
コンパイル時間 2,580 ms
コンパイル使用メモリ 79,252 KB
実行使用メモリ 59,536 KB
最終ジャッジ日時 2024-10-15 20:13:53
合計ジャッジ時間 29,320 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
37,224 KB
testcase_01 AC 54 ms
37,276 KB
testcase_02 AC 583 ms
58,324 KB
testcase_03 AC 680 ms
58,576 KB
testcase_04 AC 764 ms
56,064 KB
testcase_05 AC 598 ms
58,692 KB
testcase_06 AC 582 ms
58,412 KB
testcase_07 AC 960 ms
58,432 KB
testcase_08 AC 731 ms
58,508 KB
testcase_09 AC 586 ms
51,316 KB
testcase_10 AC 569 ms
55,148 KB
testcase_11 AC 924 ms
57,012 KB
testcase_12 AC 887 ms
59,212 KB
testcase_13 AC 1,521 ms
56,680 KB
testcase_14 AC 890 ms
59,132 KB
testcase_15 AC 976 ms
59,020 KB
testcase_16 AC 853 ms
55,076 KB
testcase_17 AC 1,264 ms
59,152 KB
testcase_18 AC 864 ms
59,352 KB
testcase_19 AC 1,065 ms
54,036 KB
testcase_20 AC 802 ms
51,976 KB
testcase_21 AC 1,177 ms
59,536 KB
testcase_22 AC 933 ms
59,328 KB
testcase_23 AC 770 ms
54,880 KB
testcase_24 AC 1,395 ms
56,432 KB
testcase_25 AC 880 ms
59,360 KB
testcase_26 AC 1,016 ms
58,860 KB
testcase_27 AC 938 ms
55,168 KB
testcase_28 AC 840 ms
58,256 KB
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.Arrays;
import java.util.StringJoiner;
import java.util.StringTokenizer;

public class Main {

    static int T, B;
    static int[] N;

    public static void main(String[] args) {
        FastScanner sc = new FastScanner(System.in);
        T = sc.nextInt();
        B = sc.nextInt();
        N = sc.nextIntArray(T);

        PrintWriter pw = new PrintWriter(System.out);
        solve(pw);
        pw.flush();
    }

    static void solve(PrintWriter pw) {
        long cur = 0;
        for (int i = 0; i < T; i++) {
            int n = N[i];
            StringBuilder b = new StringBuilder();
            while(n != 0) {
                debug(n);
                int r = n % B;
                if( r < 0 ) r += Math.abs(B);
                n -= r;
                b.append(r);
                n = n/B;
            }
            pw.println(b.reverse().toString());
        }
    }

    @SuppressWarnings("unused")
    static class FastScanner {
        private BufferedReader reader;
        private StringTokenizer tokenizer;

        FastScanner(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
            tokenizer = null;
        }

        String next() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        String nextLine() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    return reader.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken("\n");
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt();
            return a;
        }

        int[] nextIntArray(int n, int delta) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt() + delta;
            return a;
        }

        long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) a[i] = nextLong();
            return a;
        }
    }

    static void writeLines(int[] as) {
        PrintWriter pw = new PrintWriter(System.out);
        for (int a : as) pw.println(a);
        pw.flush();
    }

    static void writeLines(long[] as) {
        PrintWriter pw = new PrintWriter(System.out);
        for (long a : as) pw.println(a);
        pw.flush();
    }

    static void writeSingleLine(int[] as) {
        PrintWriter pw = new PrintWriter(System.out);
        for (int i = 0; i < as.length; i++) {
            if (i != 0) pw.print(" ");
            pw.print(as[i]);
        }
        pw.println();
        pw.flush();
    }

    static int max(int... as) {
        int max = Integer.MIN_VALUE;
        for (int a : as) max = Math.max(a, max);
        return max;
    }

    static int min(int... as) {
        int min = Integer.MAX_VALUE;
        for (int a : as) min = Math.min(a, min);
        return min;
    }

    static void debug(Object... args) {
        StringJoiner j = new StringJoiner(" ");
        for (Object arg : args) {
            if (arg == null) j.add("null");
            else if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg));
            else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg));
            else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg));
            else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg));
            else j.add(arg.toString());
        }
        System.err.println(j.toString());
    }

    static void printSingleLine(int[] array) {
        PrintWriter pw = new PrintWriter(System.out);
        for (int i = 0; i < array.length; i++) {
            if (i != 0) pw.print(" ");
            pw.print(array[i]);
        }
        pw.println();
        pw.flush();
    }

    static int lowerBound(int[] array, int value) {
        int lo = 0, hi = array.length, mid;
        while (lo < hi) {
            mid = (hi + lo) / 2;
            if (array[mid] < value) lo = mid + 1;
            else hi = mid;
        }
        return lo;
    }

    static int upperBound(int[] array, int value) {
        int lo = 0, hi = array.length, mid;
        while (lo < hi) {
            mid = (hi + lo) / 2;
            if (array[mid] <= value) lo = mid + 1;
            else hi = mid;
        }
        return lo;
    }
}
0