結果

問題 No.372 It's automatic
ユーザー uafr_cs
提出日時 2016-05-13 23:31:01
言語 Java
(openjdk 23)
結果
AC  
実行時間 2,038 ms / 6,000 ms
コード長 2,069 bytes
コンパイル時間 2,566 ms
コンパイル使用メモリ 78,804 KB
実行使用メモリ 53,740 KB
最終ジャッジ日時 2024-10-05 18:07:24
合計ジャッジ時間 28,728 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
final char[] S = sc.next().toCharArray();
final int M = sc.nextInt();
final long MOD = 1000000007;
long[] mods = new long[M + 1];
mods[0] = 1;
int zero_count = 0;
long[] next_tmp = new long[M + 1];
for(int cur = 0; cur < S.length; cur++){
final int cur_num = Character.getNumericValue(S[cur]);
Arrays.fill(next_tmp, 0);
if(cur_num == 0){ zero_count++; }
for(int mod = (cur_num != 0 ? 0 : 1); mod <= M; mod++){
if(mods[mod] == 0){ continue; }
final int next_mod = (mod * 10 + cur_num) % M;
if(next_mod == 0){
next_tmp[M] += mods[mod];
next_tmp[M] %= MOD;
}else{
next_tmp[next_mod] += mods[mod];
next_tmp[next_mod] %= MOD;
}
}
for(int i = 0; i <= M; i++){
mods[i] += next_tmp[i];
mods[i] %= MOD;
}
}
System.out.println((mods[M] + zero_count) % MOD);
}
public static class Scanner implements Closeable {
private BufferedReader br;
private StringTokenizer tok;
public Scanner(InputStream is) throws IOException {
br = new BufferedReader(new InputStreamReader(is));
}
private void getLine() throws IOException {
while (!hasNext()) {
tok = new StringTokenizer(br.readLine());
}
}
private boolean hasNext() {
return tok != null && tok.hasMoreTokens();
}
public String next() throws IOException {
getLine();
return tok.nextToken();
}
public int nextInt() throws IOException {
return Integer.parseInt(next());
}
public long nextLong() throws IOException {
return Long.parseLong(next());
}
public void close() throws IOException {
br.close();
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0