結果
問題 | No.372 It's automatic |
ユーザー | uwi |
提出日時 | 2016-05-13 23:09:01 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,687 ms / 6,000 ms |
コード長 | 3,321 bytes |
コンパイル時間 | 3,802 ms |
コンパイル使用メモリ | 83,684 KB |
実行使用メモリ | 39,128 KB |
最終ジャッジ日時 | 2024-04-15 16:53:44 |
合計ジャッジ時間 | 23,886 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 50 ms
37,020 KB |
testcase_01 | AC | 49 ms
36,676 KB |
testcase_02 | AC | 51 ms
36,676 KB |
testcase_03 | AC | 50 ms
36,648 KB |
testcase_04 | AC | 1,399 ms
38,948 KB |
testcase_05 | AC | 1,687 ms
38,860 KB |
testcase_06 | AC | 1,398 ms
38,860 KB |
testcase_07 | AC | 1,409 ms
39,120 KB |
testcase_08 | AC | 1,413 ms
38,752 KB |
testcase_09 | AC | 1,420 ms
39,100 KB |
testcase_10 | AC | 1,402 ms
38,832 KB |
testcase_11 | AC | 1,398 ms
38,972 KB |
testcase_12 | AC | 1,404 ms
38,912 KB |
testcase_13 | AC | 1,687 ms
39,020 KB |
testcase_14 | AC | 1,399 ms
39,128 KB |
testcase_15 | AC | 1,406 ms
39,128 KB |
testcase_16 | AC | 51 ms
37,112 KB |
testcase_17 | AC | 51 ms
37,076 KB |
testcase_18 | AC | 52 ms
36,544 KB |
testcase_19 | AC | 51 ms
36,892 KB |
testcase_20 | AC | 51 ms
36,836 KB |
testcase_21 | AC | 153 ms
38,912 KB |
testcase_22 | AC | 154 ms
38,828 KB |
testcase_23 | AC | 153 ms
38,724 KB |
testcase_24 | AC | 154 ms
39,068 KB |
testcase_25 | AC | 155 ms
38,924 KB |
ソースコード
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)); } }