結果

問題 No.260 世界のなんとか3
ユーザー HaarHaar
提出日時 2019-08-23 11:20:45
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 116 ms / 2,000 ms
コード長 4,905 bytes
コンパイル時間 1,938 ms
コンパイル使用メモリ 207,712 KB
実行使用メモリ 18,816 KB
最終ジャッジ日時 2024-10-13 14:20:50
合計ジャッジ時間 5,629 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 81 ms
18,760 KB
testcase_01 AC 90 ms
18,760 KB
testcase_02 AC 83 ms
18,660 KB
testcase_03 AC 86 ms
18,688 KB
testcase_04 AC 89 ms
18,688 KB
testcase_05 AC 87 ms
18,688 KB
testcase_06 AC 86 ms
18,660 KB
testcase_07 AC 89 ms
18,816 KB
testcase_08 AC 100 ms
18,760 KB
testcase_09 AC 88 ms
18,636 KB
testcase_10 AC 81 ms
18,668 KB
testcase_11 AC 89 ms
18,664 KB
testcase_12 AC 91 ms
18,656 KB
testcase_13 AC 81 ms
18,816 KB
testcase_14 AC 86 ms
18,696 KB
testcase_15 AC 82 ms
18,816 KB
testcase_16 AC 84 ms
18,688 KB
testcase_17 AC 83 ms
18,796 KB
testcase_18 AC 82 ms
18,688 KB
testcase_19 AC 92 ms
18,636 KB
testcase_20 AC 86 ms
18,688 KB
testcase_21 AC 88 ms
18,816 KB
testcase_22 AC 83 ms
18,816 KB
testcase_23 AC 81 ms
18,688 KB
testcase_24 AC 90 ms
18,816 KB
testcase_25 AC 116 ms
18,800 KB
testcase_26 AC 84 ms
18,816 KB
testcase_27 AC 82 ms
18,688 KB
testcase_28 AC 83 ms
18,688 KB
testcase_29 AC 76 ms
18,764 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false); 
  }
}init;


const LLI mod = 1e9+7;

template <uint32_t M> class ModInt{
public:
  uint64_t val;
  ModInt(): val(0){}
  ModInt(int64_t n): val(n>=M ? n%M : n){}
  
  inline constexpr ModInt operator+(const ModInt &a) const {return ModInt((val+a.val)%M);}
  inline constexpr ModInt operator-(const ModInt &a) const {return ModInt((val-a.val+M)%M);}
  inline constexpr ModInt operator*(const ModInt &a) const {return ModInt((val*a.val)%M);}
  inline constexpr ModInt operator/(const ModInt &a) const {return ModInt((val*a.inv().val)%M);}
  
  inline constexpr ModInt& operator=(const ModInt &a){val = a.val; return *this;}
  inline constexpr ModInt& operator+=(const ModInt &a){if((val += a.val) >= M) val -= M; return *this;}
  inline constexpr ModInt& operator-=(const ModInt &a){if(val < a.val) val += M; val -= a.val; return *this;}
  inline constexpr ModInt& operator*=(const ModInt &a){(val *= a.val) %= M; return *this;}
  inline constexpr ModInt& operator/=(const ModInt &a){(val *= a.inv().val) %= M; return *this;}

  inline constexpr bool operator==(const ModInt &a) const {return val==a.val;}
  inline constexpr bool operator!=(const ModInt &a) const {return val!=a.val;}
  
  inline constexpr static ModInt power(LLI n, LLI p){
    ModInt ret = 1, e = n;
    for(; p; e *= e, p >>= 1) if(p&1) ret *= e;

    return ret;
  }

  inline constexpr ModInt power(LLI p) const{return power(val,p);}
  
  inline constexpr ModInt inv() const{
    int64_t a = val, b = M, u = 1, v = 0;

    while(b){
      int64_t t = a/b;
      a -= t*b; swap(a,b);
      u -= t*v; swap(u,v);
    }
    u %= M;
    if(u < 0) u += M;
    
    return u;
  }
};

template <uint32_t M> ModInt<M> operator+(int64_t a, const ModInt<M> &b){return ModInt<M>(ModInt<M>(a)+b.val);}
template <uint32_t M> ModInt<M> operator-(int64_t a, const ModInt<M> &b){return ModInt<M>(ModInt<M>(a)-b.val);}
template <uint32_t M> ModInt<M> operator*(int64_t a, const ModInt<M> &b){return ModInt<M>(ModInt<M>(a)*b.val);}
template <uint32_t M> ModInt<M> operator/(int64_t a, const ModInt<M> &b){return ModInt<M>(ModInt<M>(a)/b.val);}

template <uint32_t M> istream& operator>>(istream &is, ModInt<M> &a){is >> a.val; return is;}
template <uint32_t M> ostream& operator<<(ostream &os, const ModInt<M> &a){ os << a.val; return os;}


using mint = ModInt<mod>;


// dp[桁数][8の剰余][3の剰余][3が既に出現][A<xが確定][x<Bが確定]
mint dp[10200][8][3][2][2][2];

const int N = 10100;

int main(){
  string A,B;
  while(cin >> A >> B){
    fill_array(dp, 0);

    reverse(ALL(A));
    A.resize(10100, '0');
    reverse(ALL(A));

    reverse(ALL(B));
    B.resize(10100, '0');
    reverse(ALL(B));

    dp[0][0][0][0][0][0] = 1;

    REP(i,N){
      REP(j,8){
        REP(k,3){
          REP(p,2){
            REP(q,2){
              REP(r,2){
                REP(x,10){
                  if((q or A[i]-'0' <= x) and (r or B[i]-'0' >= x)){
                    dp[i+1][(j*10+x)%8][(k*10+x)%3][x==3 or p][q or A[i]-'0' < x][r or B[i]-'0' > x] += dp[i][j][k][p][q][r];
                  }
                }
              }
            }
          }
        }
      }
    }

    mint ans = 0;
    
    FOR(i,1,8){
      REP(j,2){
        REP(k,2){
          ans += dp[N][i][0][0][j][k] + dp[N][i][0][1][j][k] + dp[N][i][1][1][j][k] + dp[N][i][2][1][j][k];
        }
      }
    }
    

    cout << ans << endl;
  }


  return 0;
}
0