結果

問題 No.1085 桁和の桁和
ユーザー uwiuwi
提出日時 2020-06-19 21:37:00
言語 Java21
(openjdk 21)
結果
AC  
実行時間 136 ms / 2,000 ms
コード長 3,808 bytes
コンパイル時間 4,626 ms
コンパイル使用メモリ 90,684 KB
実行使用メモリ 43,796 KB
最終ジャッジ日時 2024-11-06 17:31:28
合計ジャッジ時間 9,531 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
37,284 KB
testcase_01 AC 52 ms
36,932 KB
testcase_02 AC 52 ms
37,276 KB
testcase_03 AC 55 ms
36,976 KB
testcase_04 AC 81 ms
39,020 KB
testcase_05 AC 54 ms
37,276 KB
testcase_06 AC 53 ms
36,888 KB
testcase_07 AC 52 ms
37,032 KB
testcase_08 AC 53 ms
37,284 KB
testcase_09 AC 53 ms
37,284 KB
testcase_10 AC 53 ms
36,820 KB
testcase_11 AC 52 ms
36,980 KB
testcase_12 AC 51 ms
37,260 KB
testcase_13 AC 90 ms
39,532 KB
testcase_14 AC 113 ms
42,300 KB
testcase_15 AC 121 ms
43,332 KB
testcase_16 AC 119 ms
43,376 KB
testcase_17 AC 101 ms
42,824 KB
testcase_18 AC 102 ms
40,688 KB
testcase_19 AC 118 ms
43,376 KB
testcase_20 AC 84 ms
39,040 KB
testcase_21 AC 112 ms
43,024 KB
testcase_22 AC 135 ms
43,176 KB
testcase_23 AC 86 ms
38,424 KB
testcase_24 AC 56 ms
37,188 KB
testcase_25 AC 105 ms
43,276 KB
testcase_26 AC 119 ms
43,388 KB
testcase_27 AC 113 ms
43,132 KB
testcase_28 AC 132 ms
43,680 KB
testcase_29 AC 107 ms
42,884 KB
testcase_30 AC 106 ms
42,708 KB
testcase_31 AC 119 ms
43,252 KB
testcase_32 AC 109 ms
42,908 KB
testcase_33 AC 135 ms
43,088 KB
testcase_34 AC 136 ms
43,328 KB
testcase_35 AC 136 ms
43,796 KB
testcase_36 AC 135 ms
43,572 KB
testcase_37 AC 133 ms
43,288 KB
testcase_38 AC 129 ms
43,204 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200619;
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 E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		char[] T = ns().toCharArray();
		int D = ni();
		int n = T.length;
		
		boolean incnz = false;
		for(int i = 0;i < n;i++){
			if(T[i] != '?' && T[i] != '0'){
				incnz = true;
			}
		}
		
		if(D == 0){
			out.println(incnz ? 0 : 1);
			return;
		}
		
		long[] dp = new long[9];
		dp[0] = 1;
		int mod = 1000000007;
		for(char c : T){
			long[] ndp = new long[9];
			if(c == '?'){
				for(int i = 0;i < 9;i++){
					for(int j = 0, k = i;j <= 9;j++, k++){
						if(k == 9)k = 0;
						ndp[k] += dp[i];
						if(ndp[k] >= mod)ndp[k] -= mod;
					}
				}
			}else{
				for(int i = 0, k = (c-'0')%9;i < 9;i++,k++){
					if(k == 9)k = 0;
					ndp[k] += dp[i];
					if(ndp[k] >= mod)ndp[k] -= mod;
				}
			}
			dp = ndp;
		}
		if(!incnz){
			dp[0] = (dp[0]+mod-1)%mod;
		}
		out.println(dp[D%9]);
	}
	
	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 E().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