#21217 (C++11) No.189 SUPER HAPPY DAY

• 問題: No.189 SUPER HAPPY DAY
• ユーザー: torus711
• 提出日時: 2015-04-22 00:20:49
• 言語: C++11 (gcc 13.3.0)
• 結果: AC
• 実行時間: 29 ms / 5,000 ms
• コード長: 3,100 bytes
• コンパイル時間: 916 ms
• コンパイル使用メモリ: 99,288 KB
• 実行使用メモリ: 7,552 KB
• 最終ジャッジ日時: 2024-07-04 20:14:22
• 合計ジャッジ時間: 1,852 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 23

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
#include <cassert>
#include <cstdio>
using namespace std; using namespace placeholders;
using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using SS = stringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;
template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i 
    ) << v[i]; } return s; }
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; };
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &e : c )
#define ALL( c ) ( c ).begin(), ( c ).end()
#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + p, ( c ).end()
#define SZ( v ) ( (int)( v ).size() )
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )
#define MP make_pair
#define fst first
#define snd second
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
constexpr int MOD = 1000000009;
int dp[ 256 ][ 2 ][ 2048 ];
VI solve( const string &s, const int total )
{
    const int L = SZ( s );
    fill( AALL( dp, int ), 0 );
    dp[0][0][0] = 1;
    // dp[ 桁数 ][ s 未満確定フラグ ] := 総数
    REP( i, L )
    {
        const int D = s[i] - '0';
        REP( j, 2 )
        {
            REP( k, total + 1 )
            {
                for ( int d = 0; d <= ( j ? 9 : D ); ++d )
                {
                    ( dp[ i + 1 ][ j || d < D ][ k + d ] += dp[i][j][k] ) %= MOD;
                }
            }
        }
    }
    VI res;
    transform( AALL( dp[L][0], int ), dp[L][1], BI( res ), plus< int >() );
    transform( ALL( res ), res.begin(), bind( modulus< int >(), _1, MOD ) );
    return res;
}
int main()
{
    cin.tie( 0 );
    ios::sync_with_stdio( false );
    string s, t;
    cin >> s >> t;
    const int L = min( SZ( s ), SZ( t ) );
    VI as = solve( s, L * 9 ), bs = solve( t, L * 9 );
    LL res = 0;
    REP( i, 1, L * 9 + 1 )
    {
        ( res += LL( as[i] ) * bs[i] % MOD ) %= MOD;
    }
    cout << res << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX