結果

問題 No.294 SuperFizzBuzz
ユーザー uwiuwi
提出日時 2015-10-22 21:51:39
言語 Java16
(openjdk 16.0.1)
結果
AC  
実行時間 53 ms / 5,000 ms
コード長 3,669 Byte
コンパイル時間 3,462 ms
使用メモリ 31,976 KB
最終ジャッジ日時 2021-07-27 07:03:43
合計ジャッジ時間 6,028 ms
ジャッジサーバーID
(参考情報)
judge12 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 52 ms
31,468 KB
testcase_01 AC 52 ms
31,252 KB
testcase_02 AC 52 ms
31,668 KB
testcase_03 AC 52 ms
31,456 KB
testcase_04 AC 52 ms
31,400 KB
testcase_05 AC 52 ms
31,392 KB
testcase_06 AC 52 ms
31,428 KB
testcase_07 AC 53 ms
31,560 KB
testcase_08 AC 53 ms
31,972 KB
testcase_09 AC 52 ms
31,416 KB
testcase_10 AC 53 ms
31,264 KB
testcase_11 AC 52 ms
31,544 KB
testcase_12 AC 53 ms
31,416 KB
testcase_13 AC 53 ms
31,500 KB
testcase_14 AC 52 ms
31,460 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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 Q743_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		if(!(n >= 1 && n <= 10000000))throw new RuntimeException("n out of range");
		
		long[][] dp = new long[30][3];
		dp[1][2] = 1;
		for(int i = 1;i < 29;i++){
			for(int j = 0, k = 2;j < 3;j++,k++){
				if(k == 3)k = 0;
				dp[i+1][k] += dp[i][j]; // +2
				dp[i+1][j] += dp[i][j]; // +0
			}
		}
		
		for(int len = 1;len <= 25;len++){
			if(n - dp[len][0] <= 0){
				int cur3 = 0;
				for(int i = 0;i < len;i++){
					if(n - dp[len-i-1][(3-cur3)%3] <= 0){
						out.print(3);
						continue;
					}
					n -= dp[len-i-1][(3-cur3)%3];
					if(--cur3 < 0)cur3 += 3;
					out.print(5);
				}
				out.println();
				return;
			}
			n -= dp[len][0];
		}
	}
	
	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 Q743_2().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 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