結果

問題 No.372 It's automatic
ユーザー uwiuwi
提出日時 2016-05-13 22:57:34
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,897 ms / 6,000 ms
コード長 3,336 bytes
コンパイル時間 4,483 ms
コンパイル使用メモリ 82,080 KB
実行使用メモリ 39,732 KB
最終ジャッジ日時 2024-04-15 16:47:56
合計ジャッジ時間 28,232 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
36,880 KB
testcase_01 AC 58 ms
36,716 KB
testcase_02 AC 55 ms
36,864 KB
testcase_03 AC 55 ms
36,844 KB
testcase_04 AC 1,871 ms
39,068 KB
testcase_05 AC 1,660 ms
39,716 KB
testcase_06 AC 1,630 ms
39,096 KB
testcase_07 AC 1,894 ms
39,528 KB
testcase_08 AC 1,695 ms
39,652 KB
testcase_09 AC 1,663 ms
39,676 KB
testcase_10 AC 1,897 ms
39,288 KB
testcase_11 AC 1,642 ms
39,508 KB
testcase_12 AC 1,673 ms
39,584 KB
testcase_13 AC 1,646 ms
39,456 KB
testcase_14 AC 1,696 ms
39,732 KB
testcase_15 AC 1,890 ms
39,212 KB
testcase_16 AC 54 ms
36,884 KB
testcase_17 AC 55 ms
37,088 KB
testcase_18 AC 54 ms
36,688 KB
testcase_19 AC 54 ms
37,164 KB
testcase_20 AC 56 ms
36,716 KB
testcase_21 AC 170 ms
38,712 KB
testcase_22 AC 181 ms
38,504 KB
testcase_23 AC 175 ms
39,216 KB
testcase_24 AC 183 ms
38,740 KB
testcase_25 AC 173 ms
38,760 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 Q598 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		char[] s = ns().toCharArray();
		int m = ni();
		int[] pre = new int[m];
		int[] cur = new int[m];
		pre[0] = 1;
		int mod = 1000000007;
		int n = s.length;
		int z = 0;
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				cur[j] = pre[j];
			}
			for(int j = 0, k = s[i]-'0';j < m;j++,k+=10){
				while(k >= m)k -= m;
				cur[k] += pre[j];
				if(cur[k] >= mod)cur[k] -= mod;
			}
			if(s[i] == '0'){
				cur[0]--;
				if(cur[0] < 0)cur[0] += mod;
				z++;
			}
			int[] dum = pre; pre = cur; cur = dum;
		}
		out.println((pre[0]+z+mod-1)%mod);
	}
	
	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 Q598().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