結果

問題 No.254 文字列の構成
ユーザー uwiuwi
提出日時 2015-07-24 23:02:50
言語 Java21
(openjdk 21)
結果
AC  
実行時間 94 ms / 5,000 ms
コード長 3,460 bytes
コンパイル時間 8,702 ms
コンパイル使用メモリ 83,492 KB
実行使用メモリ 53,092 KB
最終ジャッジ日時 2023-09-22 22:48:00
合計ジャッジ時間 8,129 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
49,216 KB
testcase_01 AC 49 ms
49,196 KB
testcase_02 AC 47 ms
49,528 KB
testcase_03 AC 47 ms
49,232 KB
testcase_04 AC 49 ms
49,188 KB
testcase_05 AC 46 ms
49,192 KB
testcase_06 AC 46 ms
49,192 KB
testcase_07 AC 48 ms
49,252 KB
testcase_08 AC 46 ms
49,256 KB
testcase_09 AC 47 ms
49,192 KB
testcase_10 AC 48 ms
49,220 KB
testcase_11 AC 47 ms
49,324 KB
testcase_12 AC 47 ms
49,020 KB
testcase_13 AC 48 ms
49,280 KB
testcase_14 AC 54 ms
49,964 KB
testcase_15 AC 58 ms
50,320 KB
testcase_16 AC 84 ms
52,396 KB
testcase_17 AC 94 ms
52,056 KB
testcase_18 AC 87 ms
52,636 KB
testcase_19 AC 93 ms
52,324 KB
testcase_20 AC 90 ms
52,376 KB
testcase_21 AC 91 ms
52,388 KB
testcase_22 AC 88 ms
52,224 KB
testcase_23 AC 87 ms
52,468 KB
testcase_24 AC 91 ms
52,232 KB
testcase_25 AC 94 ms
52,068 KB
testcase_26 AC 92 ms
52,452 KB
testcase_27 AC 93 ms
52,196 KB
testcase_28 AC 90 ms
53,092 KB
testcase_29 AC 94 ms
52,596 KB
testcase_30 AC 90 ms
52,680 KB
testcase_31 AC 81 ms
52,056 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

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 Q676 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long[] dp = new long[100002];
		for(int i = 1;i <= 100000;i+=2){
			dp[i] = 1;
		}
		for(int i = 1;i <= 100000;i++){
			dp[i] += dp[i-1];
		}
		for(int i = 1;i <= 100000;i++){
			dp[i] += dp[i-1];
		}
		int n = ni();
		char A = 'a', B = 'b';
		while(n > 0){
			int ind = upperBound(dp, n);
			for(int i = 1;i <= ind;i++){
				if(i % 2 == 1){
					out.print(A);
				}else{
					out.print(B);
				}
			}
			n -= dp[ind];
			A += 2;
			B += 2;
		}
		out.println();
	}
	
	public static int upperBound(long[] a, long v)
	{
		int low = -1, high = a.length;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] <= v){
				low = h;
			}else{
				high = h;
			}
		}
		return low;
	}

	
	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");
	}
	
	public static void main(String[] args) throws Exception { new Q676().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, 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 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