結果
問題 | No.260 世界のなんとか3 |
ユーザー | akusyounin2412 |
提出日時 | 2018-07-19 19:05:34 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 430 ms / 2,000 ms |
コード長 | 2,708 bytes |
コンパイル時間 | 1,324 ms |
コンパイル使用メモリ | 126,880 KB |
実行使用メモリ | 15,744 KB |
最終ジャッジ日時 | 2024-12-24 07:11:12 |
合計ジャッジ時間 | 7,044 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
ソースコード
# include <iostream> # include <algorithm> #include <array> # include <cassert> #include <cctype> #include <climits> #include <numeric> # include <vector> # include <string> # include <set> # include <map> # include <cmath> # include <iomanip> # include <functional> # include <tuple> # include <utility> # include <stack> # include <queue> # include <list> # include <bitset> # include <complex> # include <chrono> # include <random> # include <limits.h> # include <unordered_map> # include <unordered_set> # include <deque> # include <cstdio> # include <cstring> #include <stdio.h> #include<time.h> #include <stdlib.h> #include <cstdint> #include <cfenv> //#include <bits/stdc++.h> using namespace std; using LL = long long; using ULL = unsigned long long; long long MOD = 1000000000+7; constexpr long long INF = numeric_limits<LL>::max(); const double PI = acos(-1); #define fir first #define sec second #define thi third #define debug(x) cerr<<#x<<": "<<x<<'\n' typedef pair<LL, LL> Pll; typedef pair<LL, pair<LL, LL>> Ppll; typedef pair<LL, pair<LL, bitset<100001>>> Pbll; typedef pair<LL, pair<LL, vector<LL>>> Pvll; typedef pair<LL, LL> Vec2; struct Tll { LL first, second, third; }; typedef pair<LL, Tll> Ptll; #define rep(i,rept) for(LL i=0;i<rept;i++) #define Mfor(i,mf) for(LL i=mf-1;i>=0;i--) LL h, w, n, m, k, t, s, q, last, cnt, sum[2000000], ans, d[200000], a[2000000], b[2000000],rnd[200000]; string str[2],ss; bool f; char c; int di[4][2] = { { 0,1 },{ 1,0 },{ -1,0 } ,{ 0,-1 } }; struct Edge { LL to, cost; }; vector<LL>vec[100000],hashs[100000]; vector<Pll>v; map<string, LL>ma; set<LL>st; void YN(bool f) { if (f) cout << "YES" << endl; else cout << "NO" << endl; } void yn(bool f) { if (f) cout << "Yes" << endl; else cout << "No" << endl; } LL dp[20000][2][2][3][8]; LL func(string x) { rep(i, x.size()+1)rep(j, 2)rep(n, 2)rep(k, 3)rep(l, 8) { dp[i][j][n][k][l] = 0; } dp[0][0][0][0][0] = 1; rep(i, x.size()) { rep(j, 2) { rep(m, 2) rep(l, 3) { rep(n, 8) { int lim = (j ? 9 : x[i] - '0'); rep(k, lim + 1) { dp[i + 1][j || k < lim][m || k == 3][(l + k) % 3][(10 * n + k) % 8] += dp[i][j][m][l][n]; dp[i + 1][j || k < lim][m || k == 3][(l + k) % 3][(10 * n + k) % 8] %= MOD; } } } } } ans = 0; rep(i, 2)rep(j, 3)rep(k, 8)rep(l, 2) { if ((j == 0 || l == 1) && k != 0) ans += dp[x.size()][i][l][j][k]; ans %= MOD; } return ans; } int main() { cin >> str[0] >> str[1]; rep(i, str[0].size()) { if (str[0][str[0].size() - 1 - i]=='0') { str[0][str[0].size() - 1 - i] += 9; } else { str[0][str[0].size() - 1 - i]--; break; } } cout << (func(str[1]) - func(str[0]) +MOD)%MOD<< endl; return 0; }