結果
問題 | No.2880 Max Sigma Mod |
ユーザー |
![]() |
提出日時 | 2024-09-08 13:06:10 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 663 ms / 3,000 ms |
コード長 | 4,215 bytes |
コンパイル時間 | 5,868 ms |
コンパイル使用メモリ | 323,660 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-09-08 13:06:26 |
合計ジャッジ時間 | 16,031 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 48 |
ソースコード
#include <algorithm>#include <vector>#include <map>namespace neguse {std::vector<long long> divisor(long long n, bool sorted = true) {std::vector<long long> res;for (long long i = 1; i*i <= n; i++) {if (n % i == 0) {res.push_back(i);if (i*i != n) res.push_back(n/i);}}if (sorted) std::sort(res.begin(), res.end());return res;}std::map<long long, int> prime_factor(long long n) {std::map<long long, int> res;for (long long i = 2; i*i <= n; i++) {while (n % i == 0) {res[i]++;n /= i;}}if (n != 1) res[n] = 1;return res;}std::vector<int> spf(int n) {std::vector<int> spf(n+1);for (int i = 0; i <= n; i++) spf[i] = i;for (int i = 2; i*i <= n; i++) {if (spf[i] != i) continue;for (int j = i*i; j <= n; j += i) {if (spf[j] == j) spf[j] = i;}}return spf;}std::map<int, int> fast_prime_factor(int n, const std::vector<int>& spf) {std::map<int, int> res;while (n != 1) {res[spf[n]]++;n /= spf[n];}return res;}bool is_prime(long long n) {if (n <= 1) return false;for (long long i = 2; i*i <= n; i++) {if (n % i == 0) return false;}return true;}std::vector<bool> prime_table(int n) {std::vector<bool> is_prime(n+1, true);if (n >= 0) is_prime[0] = false;if (n >= 1) is_prime[1] = false;for (int i = 2; i*i <= n; i++) {if (!is_prime[i]) continue;for (int j = i*2; j <= n; j += i) {is_prime[j] = false;}}return is_prime;}}#include <bits/stdc++.h>#include <atcoder/all>namespace neguse {}using namespace std;using namespace atcoder;using namespace neguse;typedef long long ll;typedef long double ld;typedef pair<int, int> pii;typedef pair<ll, ll> pll;typedef vector<int> vi;typedef vector<ll> vll;typedef vector<ld> vld;typedef vector<vi> vvi;typedef vector<vll> vvll;typedef vector<string> vs;typedef vector<pii> vpii;typedef vector<pll> vpll;#define _overload3(_1,_2,_3,name,...) name#define _rep(i,n) repi(i,0,n)#define repi(i,a,b) for(int i=int(a);i<int(b);++i)#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)#define _rrep(i,n) rrepi(i,n-1,-1)#define rrepi(i,a,b) for(int i=int(a);i>int(b);--i)#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep)(__VA_ARGS__)#define _each1(i,v) for(auto& i:v)#define _each2(i,j,v) for(auto& [i,j]:v)#define each(...) _overload3(__VA_ARGS__,_each2,_each1,)(__VA_ARGS__)#define all(x) (x).begin(),(x).end()#define rall(x) (x).rbegin(),(x).rend()#define SORT(x) sort(all(x))#define RSORT(x) sort(rall(x))#define REVERSE(x) reverse(all(x))#define dump(x) cerr << #x << " = " << (x) << '\n'#define print(x) cout << (x) << '\n'#define yes(f) cout << ((f) ? "Yes" : "No") << '\n'#define ge(v, x) (int)(lower_bound(all(v), x) - v.begin())#define gt(v, x) (int)(upper_bound(all(v), x) - v.begin())#define le(v, x) (int)(upper_bound(all(v), x) - v.begin())-1#define lt(v, x) (int)(lower_bound(all(v), x) - v.begin())-1template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }ostream& operator<<(ostream& os, const modint998244353& a) { return os << a.val(); }ostream& operator<<(ostream& os, const modint1000000007& a) { return os << a.val(); }template<class T> istream& operator>>(istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }template<class T> ostream& operator<<(ostream& os, const vector<T>& vec) { for (const T& x : vec) os << x << ' '; return os; }int main() {int N, M;cin >> N >> M;vll A(N + 1);A[1] = M - 1;rep(n, 2, N + 1) {// nの約数の総和(ただしM以下)を求めるll res = 0;for (ll i = 1; i * i <= n; i++) {if (n % i == 0) {if (i <= M) res += i;if (i * i != n && n / i <= M) res += n / i;}}A[n] = A[n - 1] + M - res;}cout << *max_element(all(A)) << endl;}