結果
問題 | No.1611 Minimum Multiple with Double Divisors |
ユーザー | theory_and_me |
提出日時 | 2021-07-21 21:59:33 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 429 ms / 2,000 ms |
コード長 | 3,166 bytes |
コンパイル時間 | 3,019 ms |
コンパイル使用メモリ | 210,708 KB |
実行使用メモリ | 4,384 KB |
最終ジャッジ日時 | 2023-07-26 15:23:31 |
合計ジャッジ時間 | 10,153 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 429 ms
4,384 KB |
testcase_01 | AC | 210 ms
4,380 KB |
testcase_02 | AC | 211 ms
4,380 KB |
testcase_03 | AC | 211 ms
4,380 KB |
testcase_04 | AC | 211 ms
4,380 KB |
testcase_05 | AC | 208 ms
4,380 KB |
testcase_06 | AC | 208 ms
4,384 KB |
testcase_07 | AC | 211 ms
4,384 KB |
testcase_08 | AC | 211 ms
4,384 KB |
testcase_09 | AC | 209 ms
4,384 KB |
testcase_10 | AC | 175 ms
4,384 KB |
testcase_11 | AC | 181 ms
4,384 KB |
testcase_12 | AC | 181 ms
4,380 KB |
testcase_13 | AC | 179 ms
4,380 KB |
testcase_14 | AC | 177 ms
4,380 KB |
testcase_15 | AC | 177 ms
4,384 KB |
testcase_16 | AC | 183 ms
4,380 KB |
testcase_17 | AC | 179 ms
4,380 KB |
testcase_18 | AC | 178 ms
4,380 KB |
testcase_19 | AC | 4 ms
4,380 KB |
testcase_20 | AC | 5 ms
4,384 KB |
testcase_21 | AC | 4 ms
4,384 KB |
testcase_22 | AC | 4 ms
4,380 KB |
testcase_23 | AC | 5 ms
4,384 KB |
testcase_24 | AC | 5 ms
4,384 KB |
testcase_25 | AC | 4 ms
4,380 KB |
testcase_26 | AC | 4 ms
4,380 KB |
testcase_27 | AC | 4 ms
4,380 KB |
testcase_28 | AC | 2 ms
4,384 KB |
testcase_29 | AC | 3 ms
4,380 KB |
testcase_30 | AC | 2 ms
4,384 KB |
testcase_31 | AC | 2 ms
4,384 KB |
testcase_32 | AC | 2 ms
4,384 KB |
testcase_33 | AC | 2 ms
4,384 KB |
testcase_34 | AC | 2 ms
4,380 KB |
testcase_35 | AC | 2 ms
4,380 KB |
testcase_36 | AC | 2 ms
4,380 KB |
testcase_37 | AC | 2 ms
4,380 KB |
testcase_38 | AC | 2 ms
4,384 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define REP(i,n) for(ll i=0;i<(ll)n;i++) #define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n"; #define spa << " " << #define fi first #define se second #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() using ld = long double; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<ld, ld>; template<typename T> using V = vector<T>; template<typename T> using P = pair<T, T>; template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); } template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); } template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;} template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; } template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;} struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());} template<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 (a>b) { a=b; return 1; } return 0; } void fail() { cout << -1 << '\n'; exit(0); } inline int popcount(const int x) { return __builtin_popcount(x); } inline int popcount(const ll x) { return __builtin_popcountll(x); } template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++) {cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}}; template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0]; for(ll i=1;i<n;i++)cerr spa v[i]; cerr<<"\n";}; const ll INF = (1ll<<62); // const ld EPS = 1e-10; // const ld PI = acos(-1.0); const ll mod = (int)1e9 + 7; //const ll mod = 998244353; map< int64_t, int > prime_factor(int64_t n) { map< int64_t, int > ret; for(int64_t i = 2; i * i <= n; i++) { while(n % i == 0) { ret[i]++; n /= i; } } if(n != 1) ret[n] = 1; return ret; } V<map<int64_t, int>> prime; ll MA = 1000; void solve(){ ll X; cin >> X; // dump(X) for(ll k=2;k<MA;k++){ ll bunbo = 1; ll bunshi = 1; for(auto x: prime[k]){ ll v = x.first; ll cnt = x.second; ll tmp = X; ll kazu = 0; while(tmp % v == 0){ kazu++; tmp /= v; } bunbo *= (1 + kazu); bunshi *= (1 + kazu + cnt); } if(bunshi == 2 * bunbo){ cout << k * X << endl; return; } } return; } int main(){ ll t; cin >> t; prime.resize(MA); for(ll k=2;k<MA;k++){ auto mp = prime_factor(k); prime[k] = mp; } while(t--) solve(); return 0; }