結果
| 問題 | No.2954 Calculation of Exponentiation |
| ユーザー |
 siganai
|
| 提出日時 | 2024-11-08 22:27:51 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2 ms / 2,000 ms |
| コード長 | 6,847 bytes |
| コンパイル時間 | 2,535 ms |
| コンパイル使用メモリ | 206,700 KB |
| 最終ジャッジ日時 | 2025-02-25 02:52:22 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 28 |
ソースコード
#line 1 "main.cpp"#include<bits/stdc++.h>using namespace std;//#pragma GCC target("avx,avx2")//#pragma GCC optimize("O3")//#pragma GCC optimize("unroll-loops")#ifdef LOCAL#include <debug.hpp>#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else#define debug(...) (static_cast<void>(0))#endifusing namespace std;using ll = long long;using ull = unsigned long long;using ld = long double;using pll = pair<ll,ll>;using pii = pair<int,int>;using vi = vector<int>;using vvi = vector<vi>;using vvvi = vector<vvi>;using vl = vector<ll>;using vvl = vector<vl>;using vvvl = vector<vvl>;using vul = vector<ull>;using vpii = vector<pii>;using vvpii = vector<vpii>;using vpll = vector<pll>;using vs = vector<string>;template<class T> using pq = priority_queue<T,vector<T>, greater<T>>;#define overload4(_1, _2, _3, _4, name, ...) name#define overload3(a,b,c,name,...) name#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)#define rep2(i, n) for (ll i = 0; i < (n); ++i)#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)#define all1(i) begin(i) , end(i)#define all2(i,a) begin(i) , begin(i) + a#define all3(i,a,b) begin(i) + a , begin(i) + b#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)#define sum(...) accumulate(all(__VA_ARGS__),0LL)template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }template<class T> auto min(const T& a){return *min_element(all(a));}template<class T> auto max(const T& a){return *max_element(all(a));}template<class... Ts> void in(Ts&... t);#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)#define VEC(type, name, size) vector<type> name(size); in(name)#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)ll intpow(ll a, ll b){ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;}void Yes() {cout << "Yes\n";return;}void No() {cout << "No\n";return;}void YES() {cout << "YES\n";return;}void NO() {cout << "NO\n";return;}template <typename T>T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}template <typename T>T ceil(T x, T y) {return floor(x + y - 1, y);}template <typename T>T bmod(T x, T y) {return x - y * floor(x, y);}template <typename T>pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}namespace IO{#define VOID(a) decltype(void(a))struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(15);}} setting;template<int I> struct P : P<I-1>{};template<> struct P<0>{};template<class T> void i(T& t){ i(t, P<3>{}); }void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});}#undef VOID}#define unpack(a) (void)initializer_list<int>{(a, 0)...}template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }#undef unpackconstexpr long double PI = 3.141592653589793238462643383279L;template <class F> struct REC {F f;REC(F &&f_) : f(forward<F>(f_)) {}template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};//constexpr int mod = 998244353;constexpr int mod = 1000000007;#line 2 "library/math/factorize.hpp"vector<pair<long long,int>> prime_factorization(long long n) {vector<pair<long long,int>> ret;int c = 0;while(n % 2 == 0) {c++;n >>= 1;}if(c) ret.emplace_back(2,c);for(long long i = 3; i * i <= n; i += 2) {c = 0;while(n % i == 0) {n /= i;c++;}if(c) ret.emplace_back(i,c);}if (n != 1) ret.emplace_back(n,1);return ret;}vector<long long> divisor(long long n) {vector<long long> ret;for(long long i = 1; i * i <= n; i++) {if (n % i == 0) {ret.push_back(i);if(i * i != n) {ret.push_back(n / i);}}}sort(ret.begin(),ret.end());return ret;}#line 100 "main.cpp"int main() {STR(a,b);if(b == "0.0000") {Yes();return 0;}if(a.substr((int)a.size()-4,4) != "0000" && a[0] != '0') {if(b == "0.0000") {Yes();}else {No();}return 0;}if(a == "1.0000") {Yes();return 0;}int aden = 10000;int anum = stoi(a.substr(0,(int)a.size()-5)) * 10000 + stoi(a.substr((int)a.size()-4,4));int gca = gcd(aden,anum);aden /= gca;anum /= gca;if(b[0] == '-') {if(a[0] != '0') {No();return 0;}swap(aden,anum);if(aden != 1) {No();return 0;}int bden = 10000;int bnum = stoi(b.substr((int)b.size()-4,4));int gcb = gcd(bden,bnum);bden /= gcb;bnum /= gcb;auto ps = prime_factorization(anum);for(auto &[p,c]:ps) {if(c % bden) {No();return 0;}}Yes();}else {if(aden != 1) {No();return 0;}int bden = 10000;int bnum = stoi(b.substr((int)b.size()-4,4));int gcb = gcd(bden,bnum);bden /= gcb;bnum /= gcb;auto ps = prime_factorization(anum);for(auto &[p,c]:ps) {if(c % bden) {No();return 0;}}Yes();}}