結果
| 問題 | No.2703 FizzBuzz Letter Counting |
| ユーザー |
 maspy
|
| 提出日時 | 2024-03-29 23:26:29 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 1,476 ms / 3,000 ms |
| コード長 | 26,842 bytes |
| コンパイル時間 | 5,522 ms |
| コンパイル使用メモリ | 334,232 KB |
| 実行使用メモリ | 7,660 KB |
| 最終ジャッジ日時 | 2024-09-30 16:58:29 |
| 合計ジャッジ時間 | 45,483 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 3 ms
6,816 KB |
| testcase_01 | AC | 3 ms
6,816 KB |
| testcase_02 | AC | 3 ms
6,816 KB |
| testcase_03 | AC | 1,191 ms
6,816 KB |
| testcase_04 | AC | 165 ms
6,820 KB |
| testcase_05 | AC | 173 ms
6,816 KB |
| testcase_06 | AC | 529 ms
6,816 KB |
| testcase_07 | AC | 926 ms
6,816 KB |
| testcase_08 | AC | 66 ms
6,820 KB |
| testcase_09 | AC | 1,049 ms
6,816 KB |
| testcase_10 | AC | 551 ms
6,816 KB |
| testcase_11 | AC | 54 ms
6,820 KB |
| testcase_12 | AC | 737 ms
6,820 KB |
| testcase_13 | AC | 265 ms
6,820 KB |
| testcase_14 | AC | 1,242 ms
6,816 KB |
| testcase_15 | AC | 1,192 ms
6,816 KB |
| testcase_16 | AC | 1,170 ms
6,820 KB |
| testcase_17 | AC | 133 ms
6,820 KB |
| testcase_18 | AC | 854 ms
6,820 KB |
| testcase_19 | AC | 683 ms
6,816 KB |
| testcase_20 | AC | 834 ms
6,820 KB |
| testcase_21 | AC | 504 ms
6,816 KB |
| testcase_22 | AC | 272 ms
6,816 KB |
| testcase_23 | AC | 1,314 ms
6,820 KB |
| testcase_24 | AC | 636 ms
6,820 KB |
| testcase_25 | AC | 709 ms
6,820 KB |
| testcase_26 | AC | 1,231 ms
6,820 KB |
| testcase_27 | AC | 1,079 ms
6,820 KB |
| testcase_28 | AC | 1,364 ms
6,820 KB |
| testcase_29 | AC | 1,366 ms
6,816 KB |
| testcase_30 | AC | 1,476 ms
7,408 KB |
| testcase_31 | AC | 1,361 ms
6,820 KB |
| testcase_32 | AC | 1,374 ms
7,660 KB |
| testcase_33 | AC | 1,371 ms
6,816 KB |
| testcase_34 | AC | 1,367 ms
6,820 KB |
| testcase_35 | AC | 1,368 ms
6,820 KB |
| testcase_36 | AC | 1,366 ms
6,820 KB |
| testcase_37 | AC | 1,370 ms
6,816 KB |
| testcase_38 | AC | 1,365 ms
6,820 KB |
| testcase_39 | AC | 1,363 ms
6,816 KB |
| testcase_40 | AC | 1,362 ms
7,024 KB |
| testcase_41 | AC | 1,364 ms
6,820 KB |
| testcase_42 | AC | 1,363 ms
6,820 KB |
| testcase_43 | AC | 3 ms
6,816 KB |
| testcase_44 | AC | 1 ms
6,816 KB |
| testcase_45 | AC | 3 ms
6,816 KB |
| testcase_46 | AC | 3 ms
6,816 KB |
| testcase_47 | AC | 3 ms
6,816 KB |
| testcase_48 | AC | 3 ms
6,820 KB |
| testcase_49 | AC | 3 ms
6,816 KB |
| testcase_50 | AC | 3 ms
6,816 KB |
| testcase_51 | AC | 3 ms
6,816 KB |
| testcase_52 | AC | 3 ms
6,820 KB |
| testcase_53 | AC | 3 ms
6,816 KB |
| testcase_54 | AC | 3 ms
6,816 KB |
| testcase_55 | AC | 3 ms
6,820 KB |
| testcase_56 | AC | 4 ms
6,816 KB |
| testcase_57 | AC | 3 ms
6,816 KB |
| testcase_58 | AC | 1 ms
6,816 KB |
| testcase_59 | AC | 1 ms
6,820 KB |
| testcase_60 | AC | 2 ms
6,816 KB |
| testcase_61 | AC | 1 ms
6,816 KB |
| testcase_62 | AC | 1 ms
6,820 KB |
ソースコード
#line 1 "/home/maspy/compro/library/my_template.hpp"
#if defined(LOCAL)
#include <my_template_compiled.hpp>
#else
// https://codeforces.com/blog/entry/96344
#pragma GCC optimize("Ofast,unroll-loops")
// いまの CF だとこれ入れると動かない？
// #pragma GCC target("avx2,popcnt")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;
using u128 = unsigned __int128;
using f128 = __float128;
template <class T>
constexpr T infty = 0;
template <>
constexpr int infty<int> = 1'000'000'000;
template <>
constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;
template <>
constexpr u32 infty<u32> = infty<int>;
template <>
constexpr u64 infty<u64> = infty<ll>;
template <>
constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;
template <>
constexpr double infty<double> = infty<ll>;
template <>
constexpr long double infty<long double> = infty<ll>;
using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name( \
a, vector<vector<vector<type>>>( \
b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define overload4(a, b, c, d, e, ...) e
#define overload3(a, b, c, d, ...) d
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define FOR_subset(t, s) \
for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define stoi stoll
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
int popcnt_mod_2(int x) { return __builtin_parity(x); }
int popcnt_mod_2(u32 x) { return __builtin_parity(x); }
int popcnt_mod_2(ll x) { return __builtin_parityll(x); }
int popcnt_mod_2(u64 x) { return __builtin_parityll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
template <typename T>
T floor(T a, T b) {
return a / b - (a % b && (a ^ b) < 0);
}
template <typename T>
T ceil(T x, T y) {
return floor(x + y - 1, y);
}
template <typename T>
T bmod(T x, T y) {
return x - y * floor(x, y);
}
template <typename T>
pair<T, T> divmod(T x, T y) {
T q = floor(x, y);
return {q, x - q * y};
}
template <typename T, typename U>
T SUM(const vector<U> &A) {
T sm = 0;
for (auto &&a: A) sm += a;
return sm;
}
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) \
sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T>
T POP(deque<T> &que) {
T a = que.front();
que.pop_front();
return a;
}
template <typename T>
T POP(pq<T> &que) {
T a = que.top();
que.pop();
return a;
}
template <typename T>
T POP(pqg<T> &que) {
T a = que.top();
que.pop();
return a;
}
template <typename T>
T POP(vc<T> &que) {
T a = que.back();
que.pop_back();
return a;
}
template <typename F>
ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {
if (check_ok) assert(check(ok));
while (abs(ok - ng) > 1) {
auto x = (ng + ok) / 2;
(check(x) ? ok : ng) = x;
}
return ok;
}
template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
FOR(iter) {
double x = (ok + ng) / 2;
(check(x) ? ok : ng) = x;
}
return (ok + ng) / 2;
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
return (a > b ? a = b, 1 : 0);
}
// ? は -1
vc<int> s_to_vi(const string &S, char first_char) {
vc<int> A(S.size());
FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }
return A;
}
template <typename T, typename U>
vector<T> cumsum(vector<U> &A, int off = 1) {
int N = A.size();
vector<T> B(N + 1);
FOR(i, N) { B[i + 1] = B[i] + A[i]; }
if (off == 0) B.erase(B.begin());
return B;
}
// stable sort
template <typename T>
vector<int> argsort(const vector<T> &A) {
vector<int> ids(len(A));
iota(all(ids), 0);
sort(all(ids),
[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });
return ids;
}
// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
vc<T> B(len(I));
FOR(i, len(I)) B[i] = A[I[i]];
return B;
}
#endif
#line 1 "/home/maspy/compro/library/other/io.hpp"
#define FASTIO
#include <unistd.h>
// https://judge.yosupo.jp/submission/21623
namespace fastio {
static constexpr uint32_t SZ = 1 << 17;
char ibuf[SZ];
char obuf[SZ];
char out[100];
// pointer of ibuf, obuf
uint32_t pil = 0, pir = 0, por = 0;
struct Pre {
char num[10000][4];
constexpr Pre() : num() {
for (int i = 0; i < 10000; i++) {
int n = i;
for (int j = 3; j >= 0; j--) {
num[i][j] = n % 10 | '0';
n /= 10;
}
}
}
} constexpr pre;
inline void load() {
memcpy(ibuf, ibuf + pil, pir - pil);
pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);
pil = 0;
if (pir < SZ) ibuf[pir++] = '\n';
}
inline void flush() {
fwrite(obuf, 1, por, stdout);
por = 0;
}
void rd(char &c) {
do {
if (pil + 1 > pir) load();
c = ibuf[pil++];
} while (isspace(c));
}
void rd(string &x) {
x.clear();
char c;
do {
if (pil + 1 > pir) load();
c = ibuf[pil++];
} while (isspace(c));
do {
x += c;
if (pil == pir) load();
c = ibuf[pil++];
} while (!isspace(c));
}
template <typename T>
void rd_real(T &x) {
string s;
rd(s);
x = stod(s);
}
template <typename T>
void rd_integer(T &x) {
if (pil + 100 > pir) load();
char c;
do
c = ibuf[pil++];
while (c < '-');
bool minus = 0;
if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
if (c == '-') { minus = 1, c = ibuf[pil++]; }
}
x = 0;
while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; }
if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
if (minus) x = -x;
}
}
void rd(int &x) { rd_integer(x); }
void rd(ll &x) { rd_integer(x); }
void rd(i128 &x) { rd_integer(x); }
void rd(u32 &x) { rd_integer(x); }
void rd(u64 &x) { rd_integer(x); }
void rd(u128 &x) { rd_integer(x); }
void rd(double &x) { rd_real(x); }
void rd(long double &x) { rd_real(x); }
void rd(f128 &x) { rd_real(x); }
template <class T, class U>
void rd(pair<T, U> &p) {
return rd(p.first), rd(p.second);
}
template <size_t N = 0, typename T>
void rd_tuple(T &t) {
if constexpr (N < std::tuple_size<T>::value) {
auto &x = std::get<N>(t);
rd(x);
rd_tuple<N + 1>(t);
}
}
template <class... T>
void rd(tuple<T...> &tpl) {
rd_tuple(tpl);
}
template <size_t N = 0, typename T>
void rd(array<T, N> &x) {
for (auto &d: x) rd(d);
}
template <class T>
void rd(vc<T> &x) {
for (auto &d: x) rd(d);
}
void read() {}
template <class H, class... T>
void read(H &h, T &... t) {
rd(h), read(t...);
}
void wt(const char c) {
if (por == SZ) flush();
obuf[por++] = c;
}
void wt(const string s) {
for (char c: s) wt(c);
}
void wt(const char *s) {
size_t len = strlen(s);
for (size_t i = 0; i < len; i++) wt(s[i]);
}
template <typename T>
void wt_integer(T x) {
if (por > SZ - 100) flush();
if (x < 0) { obuf[por++] = '-', x = -x; }
int outi;
for (outi = 96; x >= 10000; outi -= 4) {
memcpy(out + outi, pre.num[x % 10000], 4);
x /= 10000;
}
if (x >= 1000) {
memcpy(obuf + por, pre.num[x], 4);
por += 4;
} else if (x >= 100) {
memcpy(obuf + por, pre.num[x] + 1, 3);
por += 3;
} else if (x >= 10) {
int q = (x * 103) >> 10;
obuf[por] = q | '0';
obuf[por + 1] = (x - q * 10) | '0';
por += 2;
} else
obuf[por++] = x | '0';
memcpy(obuf + por, out + outi + 4, 96 - outi);
por += 96 - outi;
}
template <typename T>
void wt_real(T x) {
ostringstream oss;
oss << fixed << setprecision(15) << double(x);
string s = oss.str();
wt(s);
}
void wt(int x) { wt_integer(x); }
void wt(ll x) { wt_integer(x); }
void wt(i128 x) { wt_integer(x); }
void wt(u32 x) { wt_integer(x); }
void wt(u64 x) { wt_integer(x); }
void wt(u128 x) { wt_integer(x); }
void wt(double x) { wt_real(x); }
void wt(long double x) { wt_real(x); }
void wt(f128 x) { wt_real(x); }
template <class T, class U>
void wt(const pair<T, U> val) {
wt(val.first);
wt(' ');
wt(val.second);
}
template <size_t N = 0, typename T>
void wt_tuple(const T t) {
if constexpr (N < std::tuple_size<T>::value) {
if constexpr (N > 0) { wt(' '); }
const auto x = std::get<N>(t);
wt(x);
wt_tuple<N + 1>(t);
}
}
template <class... T>
void wt(tuple<T...> tpl) {
wt_tuple(tpl);
}
template <class T, size_t S>
void wt(const array<T, S> val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i) wt(' ');
wt(val[i]);
}
}
template <class T>
void wt(const vector<T> val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i) wt(' ');
wt(val[i]);
}
}
void print() { wt('\n'); }
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
wt(head);
if (sizeof...(Tail)) wt(' ');
print(forward<Tail>(tail)...);
}
// gcc expansion. called automaticall after main.
void __attribute__((destructor)) _d() { flush(); }
} // namespace fastio
using fastio::read;
using fastio::print;
using fastio::flush;
#define INT(...) \
int __VA_ARGS__; \
read(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
read(__VA_ARGS__)
#define U32(...) \
u32 __VA_ARGS__; \
read(__VA_ARGS__)
#define U64(...) \
u64 __VA_ARGS__; \
read(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
read(__VA_ARGS__)
#define CHAR(...) \
char __VA_ARGS__; \
read(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
read(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
read(name)
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
read(name)
void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
#line 3 "main.cpp"
#line 2 "/home/maspy/compro/library/mod/modint_common.hpp"
struct has_mod_impl {
template <class T>
static auto check(T &&x) -> decltype(x.get_mod(), std::true_type{});
template <class T>
static auto check(...) -> std::false_type;
};
template <class T>
class has_mod : public decltype(has_mod_impl::check<T>(std::declval<T>())) {};
template <typename mint>
mint inv(int n) {
static const int mod = mint::get_mod();
static vector<mint> dat = {0, 1};
assert(0 <= n);
if (n >= mod) n %= mod;
while (len(dat) <= n) {
int k = len(dat);
int q = (mod + k - 1) / k;
dat.eb(dat[k * q - mod] * mint::raw(q));
}
return dat[n];
}
template <typename mint>
mint fact(int n) {
static const int mod = mint::get_mod();
assert(0 <= n && n < mod);
static vector<mint> dat = {1, 1};
while (len(dat) <= n) dat.eb(dat[len(dat) - 1] * mint::raw(len(dat)));
return dat[n];
}
template <typename mint>
mint fact_inv(int n) {
static vector<mint> dat = {1, 1};
if (n < 0) return mint(0);
while (len(dat) <= n) dat.eb(dat[len(dat) - 1] * inv<mint>(len(dat)));
return dat[n];
}
template <class mint, class... Ts>
mint fact_invs(Ts... xs) {
return (mint(1) * ... * fact_inv<mint>(xs));
}
template <typename mint, class Head, class... Tail>
mint multinomial(Head &&head, Tail &&... tail) {
return fact<mint>(head) * fact_invs<mint>(std::forward<Tail>(tail)...);
}
template <typename mint>
mint C_dense(int n, int k) {
static vvc<mint> C;
static int H = 0, W = 0;
auto calc = [&](int i, int j) -> mint {
if (i == 0) return (j == 0 ? mint(1) : mint(0));
return C[i - 1][j] + (j ? C[i - 1][j - 1] : 0);
};
if (W <= k) {
FOR(i, H) {
C[i].resize(k + 1);
FOR(j, W, k + 1) { C[i][j] = calc(i, j); }
}
W = k + 1;
}
if (H <= n) {
C.resize(n + 1);
FOR(i, H, n + 1) {
C[i].resize(W);
FOR(j, W) { C[i][j] = calc(i, j); }
}
H = n + 1;
}
return C[n][k];
}
template <typename mint, bool large = false, bool dense = false>
mint C(ll n, ll k) {
assert(n >= 0);
if (k < 0 || n < k) return 0;
if constexpr (dense) return C_dense<mint>(n, k);
if constexpr (!large) return multinomial<mint>(n, k, n - k);
k = min(k, n - k);
mint x(1);
FOR(i, k) x *= mint(n - i);
return x * fact_inv<mint>(k);
}
template <typename mint, bool large = false>
mint C_inv(ll n, ll k) {
assert(n >= 0);
assert(0 <= k && k <= n);
if (!large) return fact_inv<mint>(n) * fact<mint>(k) * fact<mint>(n - k);
return mint(1) / C<mint, 1>(n, k);
}
// [x^d](1-x)^{-n}
template <typename mint, bool large = false, bool dense = false>
mint C_negative(ll n, ll d) {
assert(n >= 0);
if (d < 0) return mint(0);
if (n == 0) { return (d == 0 ? mint(1) : mint(0)); }
return C<mint, large, dense>(n + d - 1, d);
}
#line 3 "/home/maspy/compro/library/mod/modint.hpp"
template <int mod>
struct modint {
static constexpr u32 umod = u32(mod);
static_assert(umod < u32(1) << 31);
u32 val;
static modint raw(u32 v) {
modint x;
x.val = v;
return x;
}
constexpr modint() : val(0) {}
constexpr modint(u32 x) : val(x % umod) {}
constexpr modint(u64 x) : val(x % umod) {}
constexpr modint(u128 x) : val(x % umod) {}
constexpr modint(int x) : val((x %= mod) < 0 ? x + mod : x){};
constexpr modint(ll x) : val((x %= mod) < 0 ? x + mod : x){};
constexpr modint(i128 x) : val((x %= mod) < 0 ? x + mod : x){};
bool operator<(const modint &other) const { return val < other.val; }
modint &operator+=(const modint &p) {
if ((val += p.val) >= umod) val -= umod;
return *this;
}
modint &operator-=(const modint &p) {
if ((val += umod - p.val) >= umod) val -= umod;
return *this;
}
modint &operator*=(const modint &p) {
val = u64(val) * p.val % umod;
return *this;
}
modint &operator/=(const modint &p) {
*this *= p.inverse();
return *this;
}
modint operator-() const { return modint::raw(val ? mod - val : u32(0)); }
modint operator+(const modint &p) const { return modint(*this) += p; }
modint operator-(const modint &p) const { return modint(*this) -= p; }
modint operator*(const modint &p) const { return modint(*this) *= p; }
modint operator/(const modint &p) const { return modint(*this) /= p; }
bool operator==(const modint &p) const { return val == p.val; }
bool operator!=(const modint &p) const { return val != p.val; }
modint inverse() const {
int a = val, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b), swap(u -= t * v, v);
}
return modint(u);
}
modint pow(ll n) const {
assert(n >= 0);
modint ret(1), mul(val);
while (n > 0) {
if (n & 1) ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
static constexpr int get_mod() { return mod; }
// (n, r), r は 1 の 2^n 乗根
static constexpr pair<int, int> ntt_info() {
if (mod == 120586241) return {20, 74066978};
if (mod == 167772161) return {25, 17};
if (mod == 469762049) return {26, 30};
if (mod == 754974721) return {24, 362};
if (mod == 880803841) return {23, 211};
if (mod == 943718401) return {22, 663003469};
if (mod == 998244353) return {23, 31};
if (mod == 1045430273) return {20, 363};
if (mod == 1051721729) return {20, 330};
if (mod == 1053818881) return {20, 2789};
return {-1, -1};
}
static constexpr bool can_ntt() { return ntt_info().fi != -1; }
};
#ifdef FASTIO
template <int mod>
void rd(modint<mod> &x) {
fastio::rd(x.val);
x.val %= mod;
// assert(0 <= x.val && x.val < mod);
}
template <int mod>
void wt(modint<mod> x) {
fastio::wt(x.val);
}
#endif
using modint107 = modint<1000000007>;
using modint998 = modint<998244353>;
#line 3 "/home/maspy/compro/library/linalg/matrix_mul.hpp"
template <class T, typename enable_if<has_mod<T>::value>::type* = nullptr>
vc<vc<T>> matrix_mul(const vc<vc<T>>& A, const vc<vc<T>>& B, int N1 = -1,
int N2 = -1, int N3 = -1) {
if (N1 == -1) { N1 = len(A), N2 = len(B), N3 = len(B[0]); }
vv(u32, b, N3, N2);
FOR(i, N2) FOR(j, N3) b[j][i] = B[i][j].val;
vv(T, C, N1, N3);
if ((T::get_mod() < (1 << 30)) && N2 <= 16) {
FOR(i, N1) FOR(j, N3) {
u64 sm = 0;
FOR(m, N2) sm += u64(A[i][m].val) * b[j][m];
C[i][j] = sm;
}
} else {
FOR(i, N1) FOR(j, N3) {
u128 sm = 0;
FOR(m, N2) sm += u64(A[i][m].val) * b[j][m];
C[i][j] = T::raw(sm % (T::get_mod()));
}
}
return C;
}
template <class T, typename enable_if<!has_mod<T>::value>::type* = nullptr>
vc<vc<T>> matrix_mul(const vc<vc<T>>& A, const vc<vc<T>>& B, int N1 = -1,
int N2 = -1, int N3 = -1) {
if (N1 == -1) { N1 = len(A), N2 = len(B), N3 = len(B[0]); }
vv(T, b, N2, N3);
FOR(i, N2) FOR(j, N3) b[j][i] = B[i][j];
vv(T, C, N1, N3);
FOR(n, N1) FOR(m, N2) FOR(k, N3) C[n][k] += A[n][m] * b[k][m];
return C;
}
// square-matrix defined as array
template <class T, int N>
array<array<T, N>, N> matrix_mul(const array<array<T, N>, N>& A,
const array<array<T, N>, N>& B) {
array<array<T, N>, N> C{};
if ((T::get_mod() < (1 << 30)) && N <= 16) {
FOR(i, N) FOR(k, N) {
u64 sm = 0;
FOR(j, N) sm += u64(A[i][j].val) * (B[j][k].val);
C[i][k] = sm;
}
} else {
FOR(i, N) FOR(k, N) {
u128 sm = 0;
FOR(j, N) sm += u64(A[i][j].val) * (B[j][k].val);
C[i][k] = sm;
}
}
return C;
}
#line 2 "/home/maspy/compro/library/linalg/matrix_pow.hpp"
template <typename T>
vc<vc<T>> matrix_pow(vc<vc<T>> A, ll n) {
int N = len(A);
vv(T, ret, N, N);
FOR(i, N) ret[i][i] = T(1);
while (n) {
if (n & 1) ret = matrix_mul(ret, A, N, N, N);
n /= 2;
if (n) A = matrix_mul(A, A, N, N, N);
}
return ret;
}
template <typename T, int N>
array<array<T, N>, N> matrix_pow(array<array<T, N>, N> A, ll n) {
array<array<T, N>, N> ret{};
FOR(i, N) ret[i][i] = T(1);
while (n) {
if (n & 1) ret = matrix_mul<T, N>(ret, A);
n /= 2;
if (n) A = matrix_mul<T, N>(A, A);
}
return ret;
}
#line 6 "main.cpp"
/*
最後の桁以外は、mod 3 だけでよい
個数、長さの和
12 状態
12*12*log*M
行列の種類数が少ないことを使って熱烈
*/
using mint = modint998;
void out(vc<pair<mint, mint>> dp) {
mint ans = 0;
FOR(k, 15) {
if (k % 15 == 0) { ans += mint(8) * dp[k].fi; }
if (k % 3 == 0 && k % 5 != 0) { ans += mint(4) * dp[k].fi; }
if (k % 3 != 0 && k % 5 == 0) { ans += mint(4) * dp[k].fi; }
if (k % 3 != 0 && k % 5 != 0) { ans += dp[k].se; }
}
return print(ans);
}
vc<mint> apply(vvc<mint> A, vc<mint> X) {
vc<mint> Y(13);
FOR(i, 13) FOR(j, 13) { Y[j] += A[i][j] * X[i]; }
return Y;
}
void solve() {
LL(M);
VEC(pi, dat, M);
{
auto [a, b] = dat.back();
if (b > 1) {
dat.back() = {a, b - 1};
dat.eb(a, 1);
}
}
{
auto [a, b] = dat[0];
if (b > 1) {
dat[0] = {a, b - 1};
dat.insert(dat.begin(), {a, 1});
}
}
if (len(dat) == 1) {
auto [a, b] = dat[0];
assert(b == 1);
vc<pair<mint, mint>> dp(15);
FOR(x, 1, a + 1) {
dp[x].fi += 1;
dp[x].se += 1;
}
return out(dp);
}
// string S;
// for (auto& [a, b]: dat) { FOR(b) S += '0' + a; }
auto idx = [&](int a, int b, int c) -> int { return 6 * a + 2 * b + c; };
auto make_mat = [&](bool i_zero, ll s) -> vvc<mint> {
vv(mint, mat, 13, 13);
// newdp[12] += dp[12];
mat[12][12] += 1;
FOR(d, 1, 10) {
if (i_zero) {
if (d < s) {
// newdp[idx(0, d % 3, 0)] += dp[12];
// newdp[idx(0, d % 3, 1)] += dp[12];
mat[12][idx(0, d % 3, 0)] += 1;
mat[12][idx(0, d % 3, 1)] += 1;
}
if (d == s) {
// newdp[idx(1, d % 3, 0)] += mint(1);
// newdp[idx(1, d % 3, 1)] += mint(1);
mat[12][idx(1, d % 3, 0)] += 1;
mat[12][idx(1, d % 3, 1)] += 1;
}
}
if (!i_zero) {
// newdp[idx(0, d % 3, 0)] += mint(1);
// newdp[idx(0, d % 3, 1)] += mint(1);
mat[12][idx(0, d % 3, 0)] += 1;
mat[12][idx(0, d % 3, 1)] += 1;
}
}
FOR(b, 3) {
FOR(d, 10) {
int c = (b + d) % 3;
if (d < s) {
// newdp[idx(0, c, 0)] += dp[idx(0, b, 0)];
// newdp[idx(0, c, 1)] += dp[idx(0, b, 0)] + dp[idx(0, b, 1)];
mat[idx(0, b, 0)][idx(0, c, 0)] += 1;
mat[idx(0, b, 0)][idx(0, c, 1)] += 1;
mat[idx(0, b, 1)][idx(0, c, 1)] += 1;
// newdp[idx(0, c, 0)] += dp[idx(1, b, 0)];
// newdp[idx(0, c, 1)] += dp[idx(1, b, 0)] + dp[idx(1, b, 1)];
mat[idx(1, b, 0)][idx(0, c, 0)] += 1;
mat[idx(1, b, 0)][idx(0, c, 1)] += 1;
mat[idx(1, b, 1)][idx(0, c, 1)] += 1;
}
if (d == s) {
// newdp[idx(0, c, 0)] += dp[idx(0, b, 0)];
// newdp[idx(0, c, 1)] += dp[idx(0, b, 0)] + dp[idx(0, b, 1)];
mat[idx(0, b, 0)][idx(0, c, 0)] += 1;
mat[idx(0, b, 0)][idx(0, c, 1)] += 1;
mat[idx(0, b, 1)][idx(0, c, 1)] += 1;
// newdp[idx(1, c, 0)] += dp[idx(1, b, 0)];
// newdp[idx(1, c, 1)] += dp[idx(1, b, 0)] + dp[idx(1, b, 1)];
mat[idx(1, b, 0)][idx(1, c, 0)] += 1;
mat[idx(1, b, 0)][idx(1, c, 1)] += 1;
mat[idx(1, b, 1)][idx(1, c, 1)] += 1;
}
if (d > s) {
// newdp[idx(0, c, 0)] += dp[idx(0, b, 0)];
// newdp[idx(0, c, 1)] += dp[idx(0, b, 0)] + dp[idx(0, b, 1)];
mat[idx(0, b, 0)][idx(0, c, 0)] += 1;
mat[idx(0, b, 0)][idx(0, c, 1)] += 1;
mat[idx(0, b, 1)][idx(0, c, 1)] += 1;
}
}
}
return mat;
};
using MAT = vvc<mint>;
vv(MAT, POW, 10, 50);
FOR(d, 10) {
MAT x = make_mat(false, d);
FOR(k, 50) {
POW[d][k] = x;
x = matrix_mul<mint>(x, x);
}
}
using P = pair<mint, mint>;
// FOR(i, len(S) - 1) {
// ll s = S[i] - '0';
// vc<mint> newdp(13);
// newdp[12] += dp[12];
// FOR(d, 1, 10) {
// if (i == 0) {
// if (d < s) {
// newdp[idx(0, d % 3, 0)] += dp[12];
// newdp[idx(0, d % 3, 1)] += dp[12];
// }
// if (d == s) {
// newdp[idx(1, d % 3, 0)] += mint(1);
// newdp[idx(1, d % 3, 1)] += mint(1);
// }
// }
// if (i > 0) {
// newdp[idx(0, d % 3, 0)] += mint(1);
// newdp[idx(0, d % 3, 1)] += mint(1);
// }
// }
// FOR(b, 3) {
// FOR(d, 10) {
// int c = (b + d) % 3;
// if (d < s) {
// newdp[idx(0, c, 0)] += dp[idx(0, b, 0)];
// newdp[idx(0, c, 1)] += dp[idx(0, b, 0)] + dp[idx(0, b, 1)];
// newdp[idx(0, c, 0)] += dp[idx(1, b, 0)];
// newdp[idx(0, c, 1)] += dp[idx(1, b, 0)] + dp[idx(1, b, 1)];
// }
// if (d == s) {
// newdp[idx(0, c, 0)] += dp[idx(0, b, 0)];
// newdp[idx(0, c, 1)] += dp[idx(0, b, 0)] + dp[idx(0, b, 1)];
// newdp[idx(1, c, 0)] += dp[idx(1, b, 0)];
// newdp[idx(1, c, 1)] += dp[idx(1, b, 0)] + dp[idx(1, b, 1)];
// }
// if (d > s) {
// newdp[idx(0, c, 0)] += dp[idx(0, b, 0)];
// newdp[idx(0, c, 1)] += dp[idx(0, b, 0)] + dp[idx(0, b, 1)];
// }
// }
// }
// swap(dp, newdp);
// }
vc<mint> dp(13);
dp[12] = 1;
FOR(i, len(dat) - 1) {
auto [a, b] = dat[i];
if (i == 0) {
assert(b == 1);
auto mat = make_mat(true, a);
dp = apply(mat, dp);
} else {
FOR(k, 50) {
if (b >> k & 1) { dp = apply(POW[a][k], dp); }
}
}
}
vv(P, DP, 2, 3);
FOR(i, 2) FOR(j, 3) {
DP[i][j].fi = dp[idx(i, j, 0)];
DP[i][j].se = dp[idx(i, j, 1)];
}
ll s = dat.back().fi;
vc<P> F(15);
FOR(d, 1, 10) {
F[d].fi += 1;
F[d].se += 1;
}
FOR(b, 3) {
FOR(d, 10) {
ll c = (10 * b + d) % 15;
if (d < s) {
F[c].fi += DP[0][b].fi;
F[c].se += DP[0][b].se + DP[0][b].fi;
F[c].fi += DP[1][b].fi;
F[c].se += DP[1][b].se + DP[1][b].fi;
}
if (d == s) {
F[c].fi += DP[0][b].fi;
F[c].se += DP[0][b].se + DP[0][b].fi;
F[c].fi += DP[1][b].fi;
F[c].se += DP[1][b].se + DP[1][b].fi;
}
if (d > s) {
F[c].fi += DP[0][b].fi;
F[c].se += DP[0][b].se + DP[0][b].fi;
}
}
}
out(F);
}
signed main() {
int T = 1;
// INT(T);
FOR(T) solve();
return 0;
}