結果

問題 No.499 7進数変換
ユーザー hiromi_ayasehiromi_ayase
提出日時 2017-04-07 22:58:39
言語 Java21
(openjdk 21)
結果
AC  
実行時間 87 ms / 1,000 ms
コード長 2,843 bytes
コンパイル時間 2,322 ms
コンパイル使用メモリ 75,968 KB
実行使用メモリ 53,556 KB
最終ジャッジ日時 2023-09-23 02:29:12
合計ジャッジ時間 6,250 ms
ジャッジサーバーID
(参考情報)
judge12 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
47,196 KB
testcase_01 AC 80 ms
53,556 KB
testcase_02 AC 77 ms
52,368 KB
testcase_03 AC 78 ms
53,116 KB
testcase_04 AC 87 ms
52,380 KB
testcase_05 AC 76 ms
51,028 KB
testcase_06 AC 78 ms
52,088 KB
testcase_07 AC 78 ms
53,136 KB
testcase_08 AC 77 ms
53,336 KB
testcase_09 AC 76 ms
53,236 KB
testcase_10 AC 78 ms
53,108 KB
testcase_11 AC 79 ms
52,648 KB
testcase_12 AC 81 ms
53,512 KB
testcase_13 AC 80 ms
52,428 KB
testcase_14 AC 76 ms
53,048 KB
testcase_15 AC 76 ms
52,912 KB
testcase_16 AC 86 ms
52,896 KB
testcase_17 AC 83 ms
52,344 KB
testcase_18 AC 82 ms
52,312 KB
testcase_19 AC 82 ms
53,080 KB
testcase_20 AC 79 ms
52,616 KB
testcase_21 AC 82 ms
53,260 KB
testcase_22 AC 76 ms
53,188 KB
testcase_23 AC 83 ms
53,196 KB
testcase_24 AC 79 ms
52,312 KB
testcase_25 AC 85 ms
52,712 KB
testcase_26 AC 75 ms
53,416 KB
testcase_27 AC 78 ms
53,172 KB
testcase_28 AC 78 ms
53,132 KB
testcase_29 AC 79 ms
52,420 KB
testcase_30 AC 77 ms
53,508 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;


public class Main {
  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    int N = sc.nextInt();
    String ret = "";
    while (N > 0) {
      ret = (N % 7) + ret;
      N /= 7;
    }
    if (ret.equals("")) ret = "0";
    System.out.println(ret);
  }

}


class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else 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 isEOS() {
		return this.eos;
	}

	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() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}
0