結果

問題 No.189 SUPER HAPPY DAY
ユーザー EmKjp
提出日時 2015-04-28 19:55:46
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 179 ms / 5,000 ms
コード長 3,949 bytes
コンパイル時間 1,001 ms
コンパイル使用メモリ 107,008 KB
実行使用メモリ 23,680 KB
最終ジャッジ日時 2024-07-05 05:02:51
合計ジャッジ時間 3,916 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

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

using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;
partial class Solver {
    const int mod = 1000000009;
    void Add(ref int x, int value) {
        x += value;
        x %= mod;
    }
    int[] Solve(string s) {
        const int maxSum = 10 * 200;
        var dp = new int[s.Length + 1, maxSum, 2];
        dp[0, 0, 0] = 1;
        for (int i = 0; i < s.Length; i++) {
            int digit = s[i] - '0';
            for (int j = 0; j + digit < maxSum; j++) {
                for (int d = 0; d <= digit; d++) {
                    if (j + d < maxSum) {
                        Add(ref dp[i + 1, j + d, (d < digit) ? 1 : 0], dp[i, j, 0]);
                    }
                }
                for (int d = 0; d <= 9; d++) {
                    if (j + d < maxSum) {
                        Add(ref dp[i + 1, j + d, 1], dp[i, j, 1]);
                    }
                }
            }
        }
        var result = new int[maxSum];
        for (int i = 0; i < maxSum; i++) {
            result[i] = (dp[s.Length, i, 0] + dp[s.Length, i, 1]) % mod;
        }
        result[0] = 0;
        return result;
    }
    public void Run() {
        string M, D;
        M = ns();
        D = ns();
        var dp1 = Solve(M);
        var dp2 = Solve(D);
        long ans = 0;
        for (int i = 0; i < dp1.Length; i++) {
            ans += 1L * dp1[i] * dp2[i];
            ans %= mod;
        }
        cout.WriteLine(ans);
    }
}
// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner {
    public static void Main(string[] args) {
        //new Solver("1000000 1000000", Console.Error).Run();
        new Solver(Console.In, Console.Out).Run();
    }
    TextReader cin;
    TextWriter cout;
    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }
    public int ni() {
        return NextInt();
    }
    public long nl() {
        return NextLong();
    }
    public string ns() {
        return Next();
    }
}
public class Scanner {
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;
    public Scanner()
        : this(Console.In) {
    }
    public Scanner(TextReader reader) {
        this.Reader = reader;
    }
    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size) {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }
    public long[] NextLongArray(int size) {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }
    public String Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }
    public bool HasNext() {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }
    private bool StockTokens() {
        while (true) {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0