結果

問題 No.372 It's automatic
ユーザー uafr_cs
提出日時 2016-05-15 20:17:29
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,926 ms / 6,000 ms
コード長 2,083 bytes
コンパイル時間 2,273 ms
コンパイル使用メモリ 79,236 KB
実行使用メモリ 40,536 KB
最終ジャッジ日時 2024-10-06 04:06:27
合計ジャッジ時間 25,147 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
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[2][M + 1];
        mods[0][0] = 1;
        
        int zero_count = 0;
        for(int cur = 0; cur < S.length; cur++){
            final int turn = cur % 2;
            final int cur_num = Character.getNumericValue(S[cur]);
            
            if(cur_num == 0){ zero_count++; }
            for(int i = 0; i <= M; i++){
                mods[1 - turn][i] = mods[turn][i];
            }
            
            for(int mod = (cur_num != 0 ? 0 : 1); mod <= M; mod++){
                if(mods[turn][mod] == 0){ continue; }
                
                final int next_mod = (mod * 10 + cur_num) % M;
                if(next_mod == 0){
                    mods[1 - turn][M] += mods[turn][mod];
                    mods[1 - turn][M] %= MOD;
                }else{
                    mods[1 - turn][next_mod] += mods[turn][mod];
                    mods[1 - turn][next_mod] %= MOD;
                }
            }
        }
        
        System.out.println((mods[S.length % 2][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