#872368 (C++14) No.2318 Phys Bone Maker

• 問題: No.2318 Phys Bone Maker
• ユーザー: xyz2606
• 提出日時: 2023-05-26 21:53:02
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 334 ms / 3,000 ms
• コード長: 5,066 bytes
• コンパイル時間: 2,174 ms
• コンパイル使用メモリ: 161,108 KB
• 実行使用メモリ: 4,384 KB
• 最終ジャッジ日時: 2023-08-26 11:18:33
• 合計ジャッジ時間: 6,905 ms
• ジャッジサーバーID （参考情報）: judge13 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	21 ms; 4,376 KB
testcase_01	AC	21 ms; 4,376 KB
testcase_02	AC	334 ms; 4,380 KB
testcase_03	AC	20 ms; 4,376 KB
testcase_04	AC	21 ms; 4,380 KB
testcase_05	AC	21 ms; 4,384 KB
testcase_06	AC	22 ms; 4,376 KB
testcase_07	AC	20 ms; 4,376 KB
testcase_08	AC	22 ms; 4,376 KB
testcase_09	AC	21 ms; 4,376 KB
testcase_10	AC	21 ms; 4,380 KB
testcase_11	AC	21 ms; 4,380 KB
testcase_12	AC	21 ms; 4,380 KB
testcase_13	AC	21 ms; 4,380 KB
testcase_14	AC	21 ms; 4,380 KB
testcase_15	AC	22 ms; 4,380 KB
testcase_16	AC	21 ms; 4,380 KB
testcase_17	AC	23 ms; 4,380 KB
testcase_18	AC	22 ms; 4,380 KB
testcase_19	AC	22 ms; 4,384 KB
testcase_20	AC	21 ms; 4,380 KB
testcase_21	AC	21 ms; 4,376 KB
testcase_22	AC	21 ms; 4,376 KB
testcase_23	AC	20 ms; 4,376 KB
testcase_24	AC	20 ms; 4,376 KB
testcase_25	AC	20 ms; 4,384 KB
testcase_26	AC	21 ms; 4,376 KB
testcase_27	AC	20 ms; 4,376 KB
testcase_28	AC	20 ms; 4,376 KB
testcase_29	AC	20 ms; 4,380 KB
testcase_30	AC	21 ms; 4,380 KB
testcase_31	AC	20 ms; 4,380 KB
testcase_32	AC	21 ms; 4,376 KB
testcase_33	AC	21 ms; 4,380 KB
testcase_34	AC	21 ms; 4,380 KB
testcase_35	AC	56 ms; 4,380 KB
testcase_36	AC	178 ms; 4,376 KB
testcase_37	AC	176 ms; 4,380 KB
testcase_38	AC	172 ms; 4,376 KB
testcase_39	AC	259 ms; 4,376 KB
testcase_40	AC	261 ms; 4,380 KB
testcase_41	AC	292 ms; 4,376 KB
testcase_42	AC	285 ms; 4,380 KB
testcase_43	AC	21 ms; 4,380 KB
testcase_44	AC	50 ms; 4,376 KB
testcase_45	AC	50 ms; 4,380 KB
testcase_46	AC	301 ms; 4,376 KB
testcase_47	AC	22 ms; 4,380 KB

ソースコード

#include<vector>
#include<set>
#include<map>
#include<queue>
#include<string>
#include<algorithm>
#include<iostream>
#include<bitset>
#include<functional>
#include<chrono>
#include<numeric>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cassert>
#include<cmath>
#include<iomanip>
#include<random>
#include<ctime>
#include<complex>
#include<type_traits>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long LL;
typedef double D;
#define all(v) (v).begin(), (v).end()
mt19937 gene(chrono::system_clock::now().time_since_epoch().count());
typedef complex<double> Complex;
#define fi first
#define se second
#define ins insert
#define pb push_back
inline char GET_CHAR(){
    const int maxn = 131072;
    static char buf[maxn],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,maxn,stdin),p1==p2)?EOF:*p1++;
}
inline int getInt() {
    int res(0);
    char c = getchar();
    while(c < '0') c = getchar();
    while(c >= '0') {
        res = res * 10 + (c - '0');
        c = getchar();
    }
    return res;
}
inline LL fastpo(LL x, LL n, LL mod) {
    LL res(1);
    while(n) {
        if(n & 1) {
            res = res * (LL)x % mod;
        }
        x = x * (LL) x % mod;
        n /= 2;
    }
    return res;
}
template<LL mod> struct Num {
	LL a;
	Num operator + (const Num & b) { return Num{(a + b.a) % mod}; }
	Num operator - (const Num & b) { return Num{(a - b.a + mod) % mod}; }
	Num operator * (const Num & b) { return Num{a * b.a % mod}; }
	Num operator / (const Num & b) { return Num{a * fastpo(b.a, mod - 2, mod) % mod}; }
	void operator += (const Num & b) {if((a += b.a) >= mod) a -= mod;}
	void operator -= (const Num & b) {if((a -= b.a) < 0) a += mod;}
	void operator *= (const Num & b) { a = a * b.a % mod; }
	void operator /= (const Num & b) { a = a * fastpo(b.a, mod - 2, mod) % mod; }
	void operator = (const Num & b) { a = b.a; }
	void operator = (const LL & b) { a = b; }
};
template<LL mod> ostream & operator << (ostream & os, const Num<mod> & a) {
	os << a.a;
	return os;
}
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }

inline string itoa(LL x, int width = 0) {
	string res;
	if(x == 0) res.push_back('0');
	while(x) {
		res.push_back('0' + x % 10);
		x /= 10;
	}
	while((int)res.size() < width) res.push_back('0');
	reverse(res.begin(), res.end());
	return res;
}
const int _B = 131072;
char buf[_B];
int _bl = 0;
inline void flush() {
	fwrite(buf, 1, _bl, stdout);
	_bl = 0;
}
__inline void _putchar(char c) {
	if(_bl == _B) flush();
	buf[_bl++] = c;
}
inline void print(LL x, char c) {
	static char tmp[20];
	int l = 0;
	if(!x) tmp[l++] = '0';
	else {
		while(x) {
			tmp[l++] = x % 10 + '0';
			x /= 10;
		}
	}
	for(int i = l - 1; i >= 0; i--) _putchar(tmp[i]);
	_putchar(c);
}
typedef double C;
struct P {
	C x, y;
	void scan() {
		double _x, _y;
		scanf("%lf%lf", &_x, &_y);
		x = _x; y = _y;
	}
	void print() {
		cout << '(' << x << ' ' << y << ')' << endl;
	}
	P operator + (const P & b) const { return P{x + b.x, y + b.y}; }
	P operator - (const P & b) const { return P{x - b.x, y - b.y}; }
	C operator * (const P & b) const { return x * b.y - y * b.x; }
	C operator % (const P & b) const { return x * b.x + y * b.y; }
};
P operator * (const C & x, const P & b) { return P{x * b.x, x * b.y}; }
const int N = 300033;
const int LOG = 20;
const int mod = 998244353;
const int inf = 1e9 + 7;
int n, m;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int rela[N];
int getr(int x) {
    int p = x;
    while(rela[p] != p) p = rela[p];
    int p1 = p; p = x;
    while(rela[p] != p) {
        int p2 = rela[p];
        rela[p] = p1;
        p = p2;
    }
    return p1;
}
int main() {
	LL n, bak;
	cin >> n;
	bak = n;
	vector<pair<LL, int> > vec;
	vector<vector<LL> > f;
	for(int i = 2; i <= 1000000; i++) {
		if(n % i) continue;
		vec.push_back(make_pair(i, 0));
		while(n % i == 0) {
			vec.back().se++;
			n /= i;
		}
	}
	if(n != 1) {
		vec.push_back(make_pair(n, 1));
	}
	n = bak;
	for(int i = 1; i <= 1000000; i++) {
		if(n % i == 0 && i <= n / i) {
			LL x = i;
			vector<LL> tmp(1, i);
			for(int j = 0; j < vec.size(); j++) {
				tmp.pb(0);
				while(x % vec[j].fi == 0) {
					x /= vec[j].fi;
					tmp.back()++;
				}
			}
			f.pb(tmp);

			if(n / i != i) {
				LL x = n / i;
				vector<LL> tmp(1, x);
				for(int j = 0; j < vec.size(); j++) {
					tmp.pb(0);
					while(x % vec[j].fi == 0) {
						x /= vec[j].fi;
						tmp.back()++;
					}
				}
				f.pb(tmp);

			}


		}
	}
	sort(all(f));
	vector<int> dp(f.size());
	dp[0] = 1;
	for(int i = 1; i < f.size(); i++) {
		for(int j = 0; j < i; j++) {
			if(f[i][0] % f[j][0]) continue;
			int tmp = 1;
			for(int k = 0; k < vec.size(); k++) {
				if(f[i][k + 1] == f[j][k + 1]) {
					tmp = (LL)tmp * (f[i][k + 1] + 1) % mod;
				}else {
					
				}
			}
			dp[i] = (dp[i] + (LL)tmp * dp[j]) % mod;
		}
	}
	cout << dp[(int)f.size() - 1] << endl;

}