結果

提出番号 2077
提出者 inmir
言語 Java
提出日時 2018-08-04 15:11:51
問題名 (72)K-th DigitSum
結果 AC
点数 100%

テストケース

テストケース 結果 得点 実行時間 メモリ使用量
1 AC 100% 75ms 119520KB
2 AC 100% 84ms 115840KB
3 AC 100% 75ms 106624KB
4 AC 100% 54ms 97120KB
5 AC 100% 91ms 122928KB
6 AC 100% 104ms 124896KB
7 AC 100% 83ms 122496KB
8 AC 100% 56ms 99952KB
9 AC 100% 79ms 126256KB
10 AC 100% 78ms 124896KB
11 AC 100% 60ms 93696KB
12 AC 100% 55ms 100272KB
13 AC 100% 82ms 107040KB
14 AC 100% 77ms 116656KB
15 AC 100% 77ms 123136KB
16 AC 100% 79ms 118752KB
17 AC 100% 80ms 123616KB
18 AC 100% 82ms 123152KB
19 AC 100% 78ms 106512KB
20 AC 100% 79ms 122000KB
21 AC 100% 88ms 119216KB
22 AC 100% 67ms 98064KB
23 AC 100% 82ms 113376KB
24 AC 100% 64ms 96912KB
25 AC 100% 52ms 95536KB
26 AC 100% 61ms 94304KB
27 AC 100% 77ms 121808KB
28 AC 100% 89ms 124992KB
29 AC 100% 56ms 101552KB
30 AC 100% 79ms 125680KB
31 AC 100% 70ms 129440KB
32 AC 100% 94ms 115888KB
33 AC 100% 77ms 115344KB
34 AC 100% 67ms 111696KB
35 AC 100% 82ms 114656KB
36 AC 100% 91ms 126656KB
37 AC 100% 80ms 124384KB
38 AC 100% 79ms 106992KB
39 AC 100% 92ms 123600KB
40 AC 100% 81ms 122032KB
41 AC 100% 62ms 95728KB
42 AC 100% 72ms 116416KB
43 AC 100% 68ms 98400KB
44 AC 100% 60ms 109904KB
45 AC 100% 76ms 123520KB
46 AC 100% 62ms 111216KB
47 AC 100% 61ms 94592KB
48 AC 100% 60ms 96800KB
49 AC 100% 72ms 116192KB
50 AC 100% 53ms 99872KB
51 AC 100% 52ms 97232KB

ソースコード

import java.io.IOException; 
import java.io.InputStream; 
import java.io.PrintWriter; 

class Main{ 

	static void solve(){ 
		int n = ni();
		int k = ni();
		long[][] dp = new long[1001][n+1];
		dp[0][0]=1;
		StringBuilder ans = new StringBuilder();
		int index=0;
		for(int i=0;i<1000;++i){
			for(int j=0;j<=n;++j){
				for(int m=Math.max(0, j-9);m<=j;++m)dp[i+1][j]+=dp[i][m];
			}
			if(dp[i+1][n]>=k){
				index=i+1;break;
			}
		}

		for(int i=index;i>0;--i){
			int size = ans.length();
			long sum = 0;
			for(int j=0;j<=Math.min(9, n);++j){
				if(i==0){
//					ans.append(n);
					break;
				}else{
					if(sum + dp[i-1][n-j]>=k){
						ans.append(j);
						k-=sum;
						n-=j;
						break;
					}
					sum += dp[i-1][n-j];
				}
			}
			if(size == ans.length())ans.append(0);
		}
		out.println(ans.toString());
	} 
 
 
 
 
	public static void main(String[] args){ 
		 solve(); 
		 out.flush(); 
	 } 
	 private static InputStream in = System.in; 
	 private static PrintWriter out = new PrintWriter(System.out); 
 
	 private static final byte[] buffer = new byte[1<<15]; 
	 private static int ptr = 0; 
	 private static int buflen = 0; 
	 private static boolean hasNextByte(){ 
		 if(ptr<buflen)return true; 
		 ptr = 0; 
		 try{ 
			 buflen = in.read(buffer); 
		 } catch (IOException e){ 
			 e.printStackTrace(); 
		 } 
		 return buflen>0; 
	 } 
	 private static int readByte(){ if(hasNextByte()) return buffer[ptr++]; else return -1;} 
	 private static boolean isSpaceChar(int c){ return !(33<=c && c<=126);} 
	 private static int skip(){int res; while((res=readByte())!=-1 && isSpaceChar(res)); return res;} 
 
	 private static double nd(){ return Double.parseDouble(ns()); } 
	 private static char nc(){ return (char)skip(); } 
	 private static String ns(){ 
		 StringBuilder sb = new StringBuilder(); 
		 for(int b=skip();!isSpaceChar(b);b=readByte())sb.append((char)b); 
		 return sb.toString(); 
	 } 
	 private static int[] nia(int n){ 
		 int[] res = new int[n]; 
		 for(int i=0;i<n;++i)res[i]=ni(); 
		 return res; 
	 } 
	 private static long[] nla(int n){ 
		 long[] res = new long[n]; 
		 for(int i=0;i<n;++i)res[i]=nl(); 
		 return res; 
	 } 
	 private static int ni(){ 
		 int res=0,b; 
		 boolean minus=false; 
		 while((b=readByte())!=-1 && !((b>='0'&&b<='9') || b=='-')); 
		 if(b=='-'){ 
			 minus=true; 
			 b=readByte(); 
		 } 
		 for(;'0'<=b&&b<='9';b=readByte())res=res*10+(b-'0'); 
		 return minus ? -res:res; 
	 } 
	 private static long nl(){ 
		 long res=0,b; 
		 boolean minus=false; 
		 while((b=readByte())!=-1 && !((b>='0'&&b<='9') || b=='-')); 
		 if(b=='-'){ 
			 minus=true; 
			 b=readByte(); 
		 } 
		 for(;'0'<=b&&b<='9';b=readByte())res=res*10+(b-'0'); 
		 return minus ? -res:res; 
	} 
}