結果
| 問題 | No.2891 Mint |
| ユーザー |
👑  AngrySadEight
|
| 提出日時 | 2024-09-13 23:30:50 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 45 ms / 2,000 ms |
| コード長 | 4,147 bytes |
| コンパイル時間 | 17,310 ms |
| コンパイル使用メモリ | 258,232 KB |
| 最終ジャッジ日時 | 2025-02-24 08:16:40 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 54 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <algorithm>#include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>using mint = modint998244353;template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}int main() {ll N, M;cin >> N >> M;ll ans = 0;// 100 万以下は愚直for (ll k = 1; k <= min(1000000LL, N); k++) {ans += M % k;ans %= mod2;}// 100 万以上は、商の値ごとにまとめて考えるif (N > 1000000) {if (N > M) {ll times = (N - max(M, 1000000LL)) % mod2;times = (times * (M % mod2)) % mod2;ans += times;ans %= mod2;}for (ll l = 1; l <= 1000000; l++) {ll k_max = M / l;ll k_min = M / (l + 1) + 1;if (k_max <= 1000000) {continue;}if (k_min > N) {continue;}k_min = max(k_min, 1000001LL);ll mod_min = M % l;if (k_max > N) {mod_min += (((k_max - N) % mod2) * l) % mod2;mod_min %= mod2;k_max = N;}ll prod1 = mod_min % mod2;prod1 = (prod1 * ((k_max - k_min + 1) % mod2)) % mod2;ans += prod1;ans %= mod2;ll prod2 = (k_max - k_min + 1) % mod2;prod2 = (prod2 * ((k_max - k_min) % mod2)) % mod2;prod2 = (prod2 * ((mod2 + 1) / 2)) % mod2;prod2 = (prod2 * l) % mod2;ans += prod2;ans %= mod2;}}/*ll ans2 = 0;for (ll k = 1; k <= N; k++) {ans2 += M % k;ans2 %= mod2;}cout << ans2 << endl;*/cout << ans << endl;}