結果

問題 No.260 世界のなんとか3
ユーザー torus711
提出日時 2015-07-31 23:16:34
言語 C++11
(gcc 13.3.0)
結果
AC  
実行時間 79 ms / 2,000 ms
コード長 3,224 bytes
コンパイル時間 842 ms
コンパイル使用メモリ 93,408 KB
実行使用メモリ 11,648 KB
最終ジャッジ日時 2024-11-07 17:59:57
合計ジャッジ時間 2,778 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

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

#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 = 1000000007;
int dp[ 1 << 14 ][ 32 ][ 2 ][ 2 ];
int solve( const string &S )
{
const int L = SZ( S );
fill( AALL( dp, int ), 0 );
dp[0][0][0][0] = 1;
// dp[ ][ mod 24 ][ includes 3 ][ less S ]
REP( i, L )
{
const int D = S[i] - '0';
REP( j, 24 )
{
REP( k, 2 )
{
REP( l, 2 )
{
REP( d, l ? 10 : D + 1 )
{
( dp[ i + 1 ][ ( j * 10 + d ) % 24 ][ k || d == 3 ][ l || d < D ] += dp[i][j][k][l] ) %= MOD;
}
}
}
}
}
int res = 0;
REP( j, 24 )
{
REP( k, 2 )
{
REP( l, 2 )
{
if ( ( j % 3 == 0 || k ) && j % 8 )
{
( res += dp[L][j][k][l] ) %= MOD;
}
}
}
}
return res;
}
int main()
{
cin.tie( 0 );
ios::sync_with_stdio( false );
string A, B;
cin >> A >> B;
{
int i;
for ( i = SZ( A ) - 1; A[i] == '0'; --i );
// --A[i];
for ( ; i < SZ( A ); i++ )
{
A[i] = A[i] == '0' ? '9' : A[i] - 1;
}
for ( i = 0; i < SZ( A ) && A[i] == '0'; ++i );
A = A.substr( i );
}
cout << ( solve( B ) + MOD - solve( A ) ) % MOD << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0