#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using lint = long long; using pint = pair; using plint = pair; struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; } template bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; } const std::vector> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); } template T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); } template std::pair operator+(const std::pair &l, const std::pair &r) { return std::make_pair(l.first + r.first, l.second + r.second); } template std::pair operator-(const std::pair &l, const std::pair &r) { return std::make_pair(l.first - r.first, l.second - r.second); } template std::vector sort_unique(std::vector vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template int arglb(const std::vector &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); } template int argub(const std::vector &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); } template IStream &operator>>(IStream &is, std::vector &vec) { for (auto &v : vec) is >> v; return is; } template OStream &operator<<(OStream &os, const std::vector &vec); template OStream &operator<<(OStream &os, const std::array &arr); template OStream &operator<<(OStream &os, const std::unordered_set &vec); template OStream &operator<<(OStream &os, const pair &pa); template OStream &operator<<(OStream &os, const std::deque &vec); template OStream &operator<<(OStream &os, const std::set &vec); template OStream &operator<<(OStream &os, const std::multiset &vec); template OStream &operator<<(OStream &os, const std::unordered_multiset &vec); template OStream &operator<<(OStream &os, const std::pair &pa); template OStream &operator<<(OStream &os, const std::map &mp); template OStream &operator<<(OStream &os, const std::unordered_map &mp); template OStream &operator<<(OStream &os, const std::tuple &tpl); template OStream &operator<<(OStream &os, const std::vector &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template OStream &operator<<(OStream &os, const std::array &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } template std::istream &operator>>(std::istream &is, std::tuple &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template OStream &operator<<(OStream &os, const std::tuple &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; } template OStream &operator<<(OStream &os, const std::unordered_set &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::deque &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template OStream &operator<<(OStream &os, const std::set &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::multiset &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::unordered_multiset &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::pair &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; } template OStream &operator<<(OStream &os, const std::map &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::unordered_map &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m"; #define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl #define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr) #else #define dbg(x) ((void)0) #define dbgif(cond, x) ((void)0) #endif // Aho-Corasick algorithm // Verify: // // Complexity: // - add(): O(|keyword_i|) // - build_aho_corasick(): O(\sum_i |keyword_i|) // - match() : O(\sum_i |keyword_i| + |str|) template struct AhoCorasick { bool built; const int D; std::vector node; AhoCorasick(int D_) : built(false), D(D_), node(1, D) {} AhoCorasick operator=(const AhoCorasick &rhs) { return AhoCorasick(rhs.D); } void enter_child(int n, int nn, int c) { node[n].setch(c, nn); } std::vector endpos; int add(const std::string &keyword) { // Enter_in_tree() in [1] built = false; int n = 0; for (const auto &cc : keyword) { int c = char2int(cc), nn = node[n].Goto(c); if (!nn) { nn = node.size(); enter_child(n, nn, c), node.emplace_back(D); } n = nn; } return endpos.push_back(n), n; } void complete_failure(int n, int nn, int c) { int m = node[n].fail, mm = node[m].Goto(c); while (m and !mm) m = node[m].fail, mm = node[m].Goto(c); node[nn].fail = mm; } std::vector visorder; // BFS order of node ids void build() { // Build_failure() in [1] visorder.clear(); for (auto p : node[0]) { if (p.second) visorder.push_back(p.second); } for (size_t p = 0; p < visorder.size(); p++) { int n = visorder[p]; for (auto p : node[n]) { int c = p.first, nn = p.second; if (nn) visorder.push_back(nn), complete_failure(n, nn, c); } } built = true; } int step(int now, int d) { while (now and !node[now].Goto(d)) now = node[now].fail; return node[now].Goto(d); } // Count occurences of each added keywords in `str` std::vector match(const std::string &str) { if (!built) build(); std::vector freq(node.size()); int now = 0; for (const auto &c : str) freq[now = step(now, char2int(c))]++; for (auto i = visorder.rbegin(); i != visorder.rend(); i++) freq[node[*i].fail] += freq[*i]; std::vector ret; for (auto x : endpos) ret.push_back(freq[x]); return ret; } }; struct TrieNodeV { std::vector ch; // 全 bit が行き先 int fail; TrieNodeV(int D = 0) : ch(D), fail(0) {} int Goto(int d) { return ch[d]; } void setch(int d, int i) { ch[d] = i; } struct iterator { int i; std::vector::iterator iter; iterator operator++() { return {++i, ++iter}; } std::pair operator*() { return std::make_pair(i, *iter); } bool operator!=(const iterator &rhs) { return iter != rhs.iter; } }; iterator begin() { return {0, ch.begin()}; } iterator end() { return {int(ch.size()), ch.end()}; } }; struct TrieNodeUM : std::unordered_map { int fail; TrieNodeUM(int = 0) : fail(0) {} int Goto(int d) { return count(d) ? (*this)[d] : 0; } void setch(int d, int i) { (*this)[d] = i; } }; int c2i0aA(char c) { return c - '0'; } #include using mint = atcoder::modint998244353; int main() { string S; cin >> S; const int n = S.size(); AhoCorasick ac(10); ac.add(S); ac.build(); vector dp(n + 1); for (int i = 0; i < n; ++i) { mint sum = 0; for (int d = 0; d < 10; ++d) { const int nxt = ac.step(i, d); // dbg(make_tuple(i, d, nxt)); if (nxt == i + 1) continue; sum += dp.at(i) - dp.at(nxt); } dp.at(i + 1) = dp.at(i) + 10 + sum; // e = 1 + 9/10 * (e + sum / 9) // e / 10 = 1 + sum / 10 } cout << (dp.back() + 1 - n).val() << '\n'; }