結果

問題 No.260 世界のなんとか3
ユーザー akusyounin2412akusyounin2412
提出日時 2018-07-19 19:00:42
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 2,805 bytes
コンパイル時間 1,256 ms
コンパイル使用メモリ 123,820 KB
実行使用メモリ 22,112 KB
最終ジャッジ日時 2023-08-25 20:48:39
合計ジャッジ時間 7,184 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
13,580 KB
testcase_01 AC 4 ms
13,892 KB
testcase_02 AC 4 ms
13,668 KB
testcase_03 WA -
testcase_04 AC 324 ms
21,804 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 88 ms
17,708 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 142 ms
19,924 KB
testcase_13 WA -
testcase_14 AC 212 ms
21,852 KB
testcase_15 AC 59 ms
15,024 KB
testcase_16 AC 185 ms
19,800 KB
testcase_17 WA -
testcase_18 AC 142 ms
17,780 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 164 ms
19,748 KB
testcase_25 AC 214 ms
21,788 KB
testcase_26 AC 119 ms
21,872 KB
testcase_27 AC 5 ms
13,664 KB
testcase_28 AC 325 ms
21,812 KB
testcase_29 AC 420 ms
21,932 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# 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) {
			int lim = (j == 1 ? 9 : x[i] - '0');
			
				rep(m, 2)
					rep(l, 3) {
					rep(n, 8) {rep(k, lim + 1) {
						dp[i + 1][j || k < lim][m || k == 3][(l + k) % 3][(n + d[x.size() - i - 1] * k) % 8] += dp[i][j][m][l][n];
						dp[i + 1][j || k < lim][m || k == 3][(l + k) % 3][(n + d[x.size() - i - 1] * 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];
	d[0] = 1;
	rep(i, str[1].size()) {
		d[i + 1] = (d[i] * 10) % 8;
	}
	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]) << endl;
	return 0;
}
0