結果

問題 No.757 チャンパーノウン定数 (2)
ユーザー uwiuwi
提出日時 2018-12-04 23:00:23
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 3,922 bytes
コンパイル時間 3,676 ms
コンパイル使用メモリ 91,800 KB
実行使用メモリ 74,276 KB
最終ジャッジ日時 2024-07-08 10:14:08
合計ジャッジ時間 25,945 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 WA -
testcase_03 RE -
testcase_04 WA -
testcase_05 WA -
testcase_06 RE -
testcase_07 WA -
testcase_08 AC 49 ms
37,492 KB
testcase_09 AC 50 ms
37,228 KB
testcase_10 RE -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 52 ms
37,112 KB
testcase_17 WA -
testcase_18 AC 49 ms
37,072 KB
testcase_19 RE -
testcase_20 RE -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 51 ms
37,196 KB
testcase_28 RE -
testcase_29 RE -
testcase_30 AC 131 ms
40,724 KB
testcase_31 WA -
testcase_32 AC 54 ms
37,620 KB
testcase_33 WA -
testcase_34 AC 491 ms
46,380 KB
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 RE -
testcase_40 AC 1,345 ms
53,724 KB
testcase_41 AC 1,234 ms
53,020 KB
testcase_42 RE -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 RE -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 AC 49 ms
37,376 KB
testcase_51 AC 51 ms
37,548 KB
testcase_52 WA -
testcase_53 AC 51 ms
36,880 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2018;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Day5 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int b = ni();
		String x = ns();
		out.println(getOfChampernowneConstant(new BigInteger(x), b));
	}
	
	public static int getOfChampernowneConstant(BigInteger n, int b)
	{
		n = n.subtract(BigInteger.ONE);
		int high = n.toString(b).length() + 1;
		int low = 0;
		while(high - low > 1) {
			int h = high+low>>1;
			BigInteger S = b((b-1)*h-1).multiply(BigInteger.valueOf(b).pow(h)).add(BigInteger.ONE).divide(b(b-1));
			if(n.compareTo(S) >= 0) {
				low = h;
			}else {
				high = h;
			}
		}
		// len = high
		BigInteger S = b((b-1)*low-1).multiply(BigInteger.valueOf(b).pow(low)).add(BigInteger.ONE).divide(b(b-1));
		n = n.subtract(S);
		BigInteger[] qr = n.divideAndRemainder(b(high));
		String ret = BigInteger.valueOf(b).pow(low).add(qr[0]).toString();
		return ret.charAt(qr[1].intValue()) - '0';
	}
	
	public static BigInteger b(long x){ return BigInteger.valueOf(x); }

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new Day5().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0