#1163666 (C++23) No.3535 $E\times - Otogibanashi$

• 問題: No.3535 $E\times - Otogibanashi$
• ユーザー: 👑 sgfc
• 提出日時: 2026-05-08 21:37:20
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: WA
• 実行時間: -
• コード長: 4,363 bytes
• コンパイル時間: 8,977 ms
• コンパイル使用メモリ: 654,656 KB
• 実行使用メモリ: 102,016 KB
• 最終ジャッジ日時: 2026-05-08 21:37:45
• 合計ジャッジ時間: 23,727 ms
• ジャッジサーバーID （参考情報）: judge1_1 / judge3_1

ファイルパターン	結果
sample	WA * 2
other	WA * 21

ソースコード

#pragma GCC optimize("O3")

//import std;
#include "bits/stdc++.h"
#include <stdio.h>
#include "atcoder/all"
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;
const double eps = 1e-9;

#define OVERLOAD3(_1, _2, _3, call,...) call
#define REP1(i, n) for (ll i = 0; i < ll(n); ++i)
#define REP2(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define RREP1(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define RREP2(i, a, b) for (ll i = ll(a) - 1; i >= b; --i)
#define RREP(...) OVERLOAD3(__VA_ARGS__, RREP2, RREP1)(__VA_ARGS__)
#define REPE(i, c) for (auto&& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)

using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vb = vector<bool>;
using vd = vector<double>; using pl = pair<ll, ll>; using vpl = vector<pl>; using vvpl = vector<vpl>;

template<class T> void sc(T& x) { string s; if (cin >> s) from_chars(s.data(), s.data() + s.size(), x); }
template<> void sc(string& x) { cin >> x; }
template<class... T> void COMMON_IN(T&... a) { (sc(a), ...); }
#define LI(...) ll __VA_ARGS__; COMMON_IN(__VA_ARGS__);
#define SI(...) string __VA_ARGS__; COMMON_IN(__VA_ARGS__);
#define VLI(a, n) vector<ll> a(n); for(auto& x : a) sc(x);
#define DLI(a, n) deque<ll> a(n); for(auto& x : a) sc(x);
#define VSI(a, n) vector<string> a(n); for(auto& x : a) cin >> x;
#define VVLI(a, n, m) vector<vector<ll>> a(n, vector<ll>(m)); for(auto& x : a) for(auto& y : x) sc(y);
struct uv { ll u; ll v; }; struct uvc { ll u; ll v; ll c = 1; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0}); for(auto& x : a) {sc(x.u); sc(x.v); x.u--; x.v--;}
#define VUVCI(a, n) vector<uvc> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {sc(x.u); sc(x.v); sc(x.c); x.u--; x.v--;}

vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].emplace_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v); ret[x.v].emplace_back(x.u); } return ret; }
vvpl to_edge(const ll n, const vector<uvc>& v) { vvpl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v, x.c); } return ret; }
vvpl to_edge_d(const ll n, const vector<uvc>& v) { vvpl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v, x.c); ret[x.v].emplace_back(x.u, x.c); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>; using vvm = vector<vm>;

template <class T> requires std::is_base_of_v<atcoder::internal::modint_base, T> ostream& operator<<(ostream& os, const T& v) { os << v.val(); return os; }
void yn(bool f) { std::cout << (f ? "Yes" : "No") << "\n"; };
template<class T> void ovn(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; }  cout << "\n"; };

const ll llhuge = 1LL << 61; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; }
bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; }
void sort(auto& v) { std::ranges::sort(v); };
void rev(auto& v) { std::ranges::reverse(v); };
template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); }
long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }
template<class T, class U> pair<T, U> operator+(const pair<T, U>& a, const pair<T, U>& b) { return { a.first + b.first, a.second + b.second }; }

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	LI(n, p);

	modint::set_mod(p);
	modint ans = 1;
	set<ll> st;
	REP(i, 1, 10) REP(j, 10) REP(k, 10) {
		ll v = i * 110000 + j * 1001 + k * 110;
		for (int x = 1; x * v <= n; x++) {
			st.insert(x * v);
		}
	}
	for (auto& x : st) ans += x;
	ans *= -1;
	cout << ans << "\n";



}