結果

問題 No.782 マイナス進数
ユーザー kusomushikusomushi
提出日時 2019-07-10 19:25:51
言語 Java21
(openjdk 21)
結果
AC  
実行時間 213 ms / 2,000 ms
コード長 4,967 bytes
コンパイル時間 2,508 ms
コンパイル使用メモリ 78,864 KB
実行使用メモリ 42,772 KB
最終ジャッジ日時 2024-10-15 20:15:24
合計ジャッジ時間 9,426 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
37,084 KB
testcase_01 AC 53 ms
37,160 KB
testcase_02 AC 161 ms
41,532 KB
testcase_03 AC 168 ms
41,448 KB
testcase_04 AC 173 ms
41,988 KB
testcase_05 AC 176 ms
41,644 KB
testcase_06 AC 167 ms
41,404 KB
testcase_07 AC 181 ms
41,968 KB
testcase_08 AC 166 ms
41,516 KB
testcase_09 AC 163 ms
41,404 KB
testcase_10 AC 164 ms
41,576 KB
testcase_11 AC 176 ms
41,764 KB
testcase_12 AC 178 ms
41,564 KB
testcase_13 AC 208 ms
42,376 KB
testcase_14 AC 180 ms
41,884 KB
testcase_15 AC 183 ms
41,952 KB
testcase_16 AC 189 ms
41,876 KB
testcase_17 AC 205 ms
42,628 KB
testcase_18 AC 178 ms
41,920 KB
testcase_19 AC 190 ms
42,772 KB
testcase_20 AC 182 ms
41,736 KB
testcase_21 AC 204 ms
42,468 KB
testcase_22 AC 185 ms
41,956 KB
testcase_23 AC 177 ms
41,672 KB
testcase_24 AC 213 ms
42,688 KB
testcase_25 AC 187 ms
41,736 KB
testcase_26 AC 189 ms
41,820 KB
testcase_27 AC 177 ms
42,032 KB
testcase_28 AC 178 ms
41,940 KB
testcase_29 AC 54 ms
37,152 KB
testcase_30 AC 54 ms
36,720 KB
testcase_31 AC 54 ms
36,952 KB
testcase_32 AC 55 ms
36,780 KB
testcase_33 AC 55 ms
36,640 KB
testcase_34 AC 54 ms
37,152 KB
testcase_35 AC 53 ms
37,216 KB
testcase_36 AC 55 ms
36,872 KB
testcase_37 AC 54 ms
36,624 KB
権限があれば一括ダウンロードができます

ソースコード

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];
            if( n == 0 ) {
                pw.println(0);
                continue;
            }

            StringBuilder b = new StringBuilder();
            while(n != 0) {
                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