結果

問題 No.600 かい文回
ユーザー uwiuwi
提出日時 2017-11-24 23:27:48
言語 Java21
(openjdk 21)
結果
AC  
実行時間 102 ms / 2,000 ms
コード長 3,574 bytes
コンパイル時間 4,410 ms
コンパイル使用メモリ 81,472 KB
実行使用メモリ 53,600 KB
最終ジャッジ日時 2023-08-18 05:24:12
合計ジャッジ時間 7,805 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 94 ms
52,524 KB
testcase_01 AC 96 ms
52,792 KB
testcase_02 AC 95 ms
52,396 KB
testcase_03 AC 89 ms
52,304 KB
testcase_04 AC 95 ms
52,516 KB
testcase_05 AC 102 ms
52,836 KB
testcase_06 AC 96 ms
52,520 KB
testcase_07 AC 96 ms
52,560 KB
testcase_08 AC 93 ms
52,536 KB
testcase_09 AC 92 ms
52,300 KB
testcase_10 AC 83 ms
52,568 KB
testcase_11 AC 82 ms
53,600 KB
testcase_12 AC 91 ms
52,628 KB
testcase_13 AC 89 ms
52,452 KB
testcase_14 AC 80 ms
52,780 KB
testcase_15 AC 48 ms
49,344 KB
testcase_16 AC 84 ms
52,692 KB
testcase_17 AC 84 ms
52,556 KB
testcase_18 AC 99 ms
52,648 KB
testcase_19 AC 86 ms
53,060 KB
testcase_20 AC 87 ms
52,412 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest171124;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class D2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		
		if(n == 1){
			out.println("a");
		}else{
			dfs(n, 0, "");
		}
	}
	
	boolean dfs(int n, int x, String s)
	{
		if(s.length() > 100)return false;
//		if(x > 30)return false;
		if(n == x+1){
			StringBuilder sb = new StringBuilder(s);
			out.println(s + sb.reverse());
			return true;
		}
		if(n < x+1)return false;
		char c = (char)('a'+x%26);
		String t = s + c;
		
		int m = n;
		while((n+x) % 2 == 0 && (n+x) / 2 < n){
			n = (n+x)/2;
			if(dfs(n, x+1, t += c))return true;
		}
		
		if(dfs(m, x+1, s + c))return true;
		return false;
	}
	
	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 D2().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