結果

問題 No.189 SUPER HAPPY DAY
ユーザー eitaho
提出日時 2015-04-22 18:17:58
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 133 ms / 5,000 ms
コード長 3,277 bytes
コンパイル時間 2,062 ms
コンパイル使用メモリ 109,440 KB
実行使用メモリ 21,376 KB
最終ジャッジ日時 2024-07-05 00:17:52
合計ジャッジ時間 4,147 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
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.Linq;
using System.Text;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;
class Program
{
    static readonly int MaxSum = 9 * 200;
    static readonly int Mod = (int)1e9 + 9;
    void Add(ref int a, int b) { if ((a += b) >= Mod) a -= Mod; }
    public void Solve()
    {
        string M = Reader.String(), D = Reader.String();
        int[] A = DP(M), B = DP(D);
        long ans = 0;
        for (int i = 1; i < A.Length; i++)
            ans = (ans + (long)A[i] * B[i]) % Mod;
        Console.WriteLine(ans);
    }
    int[] DP(string S)
    {
        var res = new int[MaxSum + 1];
        var dp = new int[S.Length + 1, MaxSum + 1, 2]; // len, sum, lesser
        dp[0, 0, 0] = 1;
        for (int i = 0; i < S.Length; i++)
            for (int sum = 0; sum <= 9 * i; sum++)
                for (int lesser = 0; lesser < 2; lesser++)
                    if (dp[i, sum, lesser] > 0)
                        for (int d = 0; d <= 9; d++)
                        {
                            if (d > S[i] - '0' && lesser == 0) break;
                            int nextLesser = lesser | (d < S[i] - '0' ? 1 : 0);
                            Add(ref dp[i + 1, sum + d, nextLesser], dp[i, sum, lesser]);
                        }
        for (int sum = 1; sum < res.Length; sum++)
            for (int lesser = 0; lesser < 2; lesser++)
                Add(ref res[sum], dp[S.Length, sum, lesser]);
        return res;
    }
}
class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    private static TextReader reader = Console.In;
    private static readonly char[] separator = { ' ' };
    private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    private static string[] A = new string[0];
    private static int i;
    private static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }
    public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
    public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); }
    public static string Line() { return reader.ReadLine().Trim(); }
    private static string[] Split(string s) { return s.Split(separator, op); }
    private static string Next() { CheckNext(); return A[i++]; }
    private static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0