結果

問題 No.372 It's automatic
ユーザー uwiuwi
提出日時 2016-05-13 23:09:01
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,590 ms / 6,000 ms
コード長 3,321 bytes
コンパイル時間 3,302 ms
コンパイル使用メモリ 87,204 KB
実行使用メモリ 39,040 KB
最終ジャッジ日時 2024-10-05 17:33:07
合計ジャッジ時間 22,982 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
36,992 KB
testcase_01 AC 43 ms
36,828 KB
testcase_02 AC 45 ms
36,600 KB
testcase_03 AC 45 ms
36,728 KB
testcase_04 AC 1,418 ms
38,784 KB
testcase_05 AC 1,585 ms
38,912 KB
testcase_06 AC 1,243 ms
38,816 KB
testcase_07 AC 1,412 ms
39,040 KB
testcase_08 AC 1,250 ms
38,808 KB
testcase_09 AC 1,417 ms
38,516 KB
testcase_10 AC 1,420 ms
38,592 KB
testcase_11 AC 1,244 ms
38,576 KB
testcase_12 AC 1,432 ms
38,976 KB
testcase_13 AC 1,590 ms
38,516 KB
testcase_14 AC 1,272 ms
38,892 KB
testcase_15 AC 1,290 ms
38,784 KB
testcase_16 AC 46 ms
36,860 KB
testcase_17 AC 45 ms
36,864 KB
testcase_18 AC 46 ms
36,764 KB
testcase_19 AC 45 ms
36,844 KB
testcase_20 AC 46 ms
36,728 KB
testcase_21 AC 138 ms
38,836 KB
testcase_22 AC 140 ms
38,528 KB
testcase_23 AC 140 ms
38,732 KB
testcase_24 AC 147 ms
38,704 KB
testcase_25 AC 137 ms
38,616 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++){
			System.arraycopy(pre, 0, cur, 0, m);
			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