結果

問題 No.2318 Phys Bone Maker
ユーザー woodywoodywoodywoody
提出日時 2023-05-28 20:33:25
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,113 ms / 3,000 ms
コード長 12,844 bytes
コンパイル時間 6,218 ms
コンパイル使用メモリ 255,580 KB
実行使用メモリ 222,864 KB
最終ジャッジ日時 2024-12-27 18:03:08
合計ジャッジ時間 14,203 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 45
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif
namespace math{
vvi div,mul;
void div_init(int n){
div.resize(n+1);
mul.resize(n+1);
for(int i = 1;i <= n;i++){
for(int j = i;j <= n;j+=i){
div[j].pb(i);
mul[i].pb(j);
}
}
return;
}
vl divisor(ll x){
vl res;
for(ll i=1;i*i<=x;i++){
if (x%i != 0) continue;
res.pb(i);
if (i*i != x) res.pb(x/i);
}
sort(rng(res));
return res;
}
ll floorsqrt(ll x) {
ll l = 0, r = ll(2e9)+1;
while (l+1<r) {
ll c = (l+r)/2;
if (c*c <= x) l = c; else r = c;
}
return l;
}
ll floorlog(ll a,int x){
ll tmp=1; ll ret=0;
while(tmp <= x){
if (tmp >= LLONG_MAX/a) break;
tmp *= a;
ret++;
}
ret--;
return ret;
}
ll pow(ll x , ll a){
assert(x > 0);
assert(a >= 0);
ll ret = 1;
rep(_,a){
assert (ret < LLONG_MAX/x);
ret *= x;
}
return ret;
}
ll base(ll x,int a){
ll ans=0,y;
for (ll i=0;x>0;i++){
y = x/a;
ans += (x - y*a)*pow(10,i);
x = y;
}
return ans;
}
string baseS(ll x,int a){
string ans;
ll y;
for (ll i=0;x>0;i++){
y = x/a;
ans += '0' + (x - y*a);
x = y;
}
reverse(rng(ans));
return ans;
}
ll inv(vl& v){
int n = sz(v);
map<ll,int> mp;
fore(y,v) mp[y] = 0;
int m = 0;
fore(y,mp) y.se = m++;
fenwick_tree<ll> fw(m);
ll ret = 0;
rep(i,n){
int k = mp[v[i]];
ret += fw.sum(k+1,m);
fw.add(k,1);
}
return ret;
}
}
// namespace math
// .div.mul : div[i]mul[i]i
// .div_init(n) : div,mulnn < 3e5
// .divisor(x) : xx64bit
// .floorsqrt(x) : floor(sqrt(x))x64bit
// .floorlog(a , x) : floor(loga(x))x64bit
// .pow(x , a) : x^a
// .base(x , a) : x(10)a1 <= a <= 10ll
// .baseS(x , a) : x(10)a1 <= a <= 10string
// .inv(v) : v
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n=1):n(n), f(n+1) { //f[x] = (x)
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i]) continue;
primes.push_back(i);
f[i] = i;
for (ll j = i*i; j <= n; j += i) {
if (!f[j]) f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x;} //
vector<int> factorList(int x) {//x
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<pii> factor(int x) {//x()
vector<int> fl = factorList(x);
if (fl.size() == 0) return {};
vector<pii> res(1, pii(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
vector<pli> factor(ll x) {//-xll
vector<pli> res;
for (int p : primes) {
int y = 0;
while (x%p == 0) x /= p, ++y;
if (y != 0) res.emplace_back(p,y);
}
if (x != 1) res.emplace_back(x,1);
return res;
}
ll totient(ll x){
ll den = 1,num = 1;
if (x<=n){
vpii v = factor((int)x);
fore(y , v){
den *= y.fi;
num *= (y.fi-1);
}
}else{
vpli v = factor(x);
fore(y , v){
den *= y.fi;
num *= (y.fi-1);
}
}
assert(x%den==0);
ll ret = x/den*num;
return ret;
}
///////////////// / ////////////////
//
template <typename T>
void div_zeta_trans(vector<T> &a) {
int n = sz(a)-1;
fore(p, primes) {
if (p > n) break;
for (int i = 1; i * p <= n; ++i) a[i * p] += a[i];
}
}
template <typename T>
void div_mobius_trans(vector<T> &a) {
int n = sz(a)-1;
fore(p, primes) {
if (p > n) break;
for (int i = n / p; i > 0; --i) a[i * p] -= a[i];
}
}
template <typename I, typename T>
void div_zeta_trans(map<I, T> &a) {
for (auto p = a.rbegin(); p != a.rend(); p++) {
fore(y, a) {
if (p->fi == y.fi) break;
if (p->fi % y.fi == 0) p->se += y.se;
}
}
}
template <typename I, typename T>
void div_mobius_trans(map<I, T> &a) {
fore(y, a) {
for (auto p = a.rbegin(); p != a.rend(); p++) {
if (y.fi == p->fi) break;
if (p->fi % y.fi == 0) p->se -= y.se;
}
}
}
//
template <typename T>
void mul_zeta_trans(vector<T> &a) {
int n = sz(a)-1;
fore(p, primes) {
if (p > n) break;
for (int i = n / p; i > 0; --i) a[i] += a[i * p];
}
}
template <typename T>
void mul_mobius_trans(vector<T> &a) {
int n = sz(a)-1;
fore(p, primes) {
if (p > n) break;
for (int i = 1; i * p <= n; ++i) a[i] -= a[i * p];
}
}
template <typename I, typename T>
void mul_zeta_trans(map<I, T> &a) {
fore(y, a) {
for (auto p = a.rbegin(); p != a.rend(); p++) {
if (y.fi == p->fi) break;
if (p->fi % y.fi == 0) y.se += p->se;
}
}
}
template <typename I, typename T>
void mul_mobius_trans(map<I, T> &a) {
for (auto p1 = a.rbegin(); p1 != a.rend(); p1++) {
for (auto p2 = a.rbegin(); p2 != p1; p2++) {
if (p2->fi % p1->fi == 0) p1->se += p2->se;
}
}
}
} sieve(1e6);
//
// .primes : n
// .isPrime(int x) : xbool
// .factorList(int x) : xxvector<int>
// .factor(int x) : xpair<int int>{}vector<pii>xllok
// : n=1e6()
// : factorListfactor
// totient(ll x) :
// /
// f = Σg : g → f f → g
// map<I,T>I idx T
ll coef[8000][8000];
void solve(){
ll n; cin>>n;
vl d = math::divisor(n);
vpli vp = sieve.factor(n);
int k = sz(d);
vvl dp(k);
rep(i,k){
vl tmp(sz(vp));
rep(j,sz(vp)){
ll cnt = 0;
ll y = d[i];
while(y%vp[j].fi==0){
y /= vp[j].fi;
cnt++;
}
tmp[j] = cnt;
}
dp[i] = tmp;
}
vvi idx(k);
rep(i,k) repx(j,i+1,k){
coef[i][j] = 1;
rep(jj,sz(vp)){
if (dp[i][jj] < dp[j][jj]) coef[i][j] *= 1;
else if(dp[i][jj] > dp[j][jj]) coef[i][j] *= 0;
else coef[i][j] *= (dp[i][jj]+1);
if (coef[i][j]==0) break;
}
if (coef[i][j]!=0) idx[j].pb(i);
}
vm now(k);
now[k-1] = 1;
test(1);
while(1){
// test(1);
vm tmp(k);
swap(tmp,now);
bool ok = false;
rep(j,k){
if (tmp[j]==0) continue;
if (j) ok = true;
fore(i, idx[j]){
now[i] += mint(coef[i][j])*tmp[j];
}
}
now[0] += tmp[0];
if (!ok) break;
}
cout << now[0].val() << endl;
return;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
//cin>>t;
rep(i,t){
solve();
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0