結果
問題 |
No.443 GCD of Permutation
|
ユーザー |
![]() |
提出日時 | 2024-12-05 00:28:03 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 1,000 ms |
コード長 | 3,954 bytes |
コンパイル時間 | 6,510 ms |
コンパイル使用メモリ | 170,588 KB |
最終ジャッジ日時 | 2025-02-26 10:56:04 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 28 |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <algorithm> // #include <atcoder/all> #include <bitset> #include <cassert> #include <cmath> #include <ctime> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; // using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int, int> #define pil pair<int, ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int, int>> #define vpll vector<pair<ll, ll>> #define vvpii vector<vector<pair<int, int>>> #define vvpll vector<vector<pair<ll, ll>>> // using mint = modint998244353; template <typename T> void debug(T e) { cerr << e << endl; } template <typename T> void debug(vector<T> &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template <typename T> void debug(vector<vector<T>> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template <typename T> void debug(vector<pair<T, T>> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template <typename T> void debug(set<T> &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(multiset<T> &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(map<T, T> &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } ll my_gcd(ll a, ll b) { ll ret = 0; if (a < b) { swap(a, b); } if (b == 0) { ret = a; } else { ret = my_gcd(b, a % b); } return ret; } int main() { string N; cin >> N; ll M = N.size(); vector<ll> cnt(10, 0); for (ll i = 0; i < M; i++) { cnt[(ll)(N[i] - '0')]++; } bool all_same = true; for (ll i = 0; i < M; i++) { if (N[i] != N[0]) { all_same = false; } } if (all_same) { cout << N << endl; } else { ll g = -1; for (ll i = 0; i < 10; i++) { for (ll j = i + 1; j < 10; j++) { if (cnt[i] > 0 && cnt[j] > 0) { ll q = 9 * (j - i); if (g == -1) { g = q; } else { g = my_gcd(g, q); } } } } // debug(g); ll ans = 1; for (ll i = 1; i <= g; i++) { if (g % i == 0) { ll now_rem = 0; for (ll j = 0; j < M; j++) { now_rem = (now_rem * 10 + (ll)(N[j] - '0')) % i; } if (now_rem == 0) { ans = max(ans, i); } } } cout << ans << endl; } }