結果

問題 No.443 GCD of Permutation
コンテスト
ユーザー kuhaku
提出日時 2025-05-09 18:31:28
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,873 bytes
コンパイル時間 4,246 ms
コンパイル使用メモリ 317,928 KB
実行使用メモリ 7,844 KB
最終ジャッジ日時 2025-05-09 18:31:34
合計ジャッジ時間 5,250 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 20 WA * 8
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /usr/include/c++/13/bits/stl_pair.h:61,
                 from /usr/include/c++/13/bits/stl_algobase.h:64,
                 from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from main.cpp:6:
In function ‘constexpr std::_Require<std::__not_<std::__is_tuple_like<_Tp> >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = char]’,
    inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = __gnu_cxx::__normal_iterator<char*, vector<char> >; _ForwardIterator2 = __gnu_cxx::__normal_iterator<char*, vector<char> >]’ at /usr/include/c++/13/bits/stl_algobase.h:185:11,
    inlined from ‘constexpr void std::__reverse(_RandomAccessIterator, _RandomAccessIterator, random_access_iterator_tag) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<char*, vector<char> >]’ at /usr/include/c++/13/bits/stl_algo.h:1110:18,
    inlined from ‘constexpr bool std::__next_permutation(_BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<char*, vector<char> >; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/13/bits/stl_algo.h:2959:22,
    inlined from ‘constexpr bool std::next_permutation(_BIter, _BIter) [with _BIter = __gnu_cxx::__normal_iterator<char*, vector<char> >]’ at /usr/include/c++/13/bits/stl_algo.h:2993:2,
    inlined from ‘int main()’ at main.cpp:96:34:
/usr/include/c++/13/bits/move.h:198:11: warning: writing 16 bytes into a region of size between 1 and 10 [-Wstringop-overflow=]
  198 |       __a = _GLIBCXX_MOVE(__b);
      |           ^
In file included from /usr/include/x86_64-linux-gnu/c++/13/bits/c++allocator.h:33,
                 from /usr/include/c++/13/bits/allocator.h:46,
                 from /usr/include/c++/13/string:43,
                 from /usr/include/c++/13

ソースコード

diff # 

// competitive-verifier: PROBLEM
#ifdef ATCODER
#pragma GCC target("sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2")
#endif
#pragma GCC optimize("Ofast,fast-math,unroll-all-loops")
#include <bits/stdc++.h>
#ifndef ATCODER
#pragma GCC target("sse4.2,avx2,bmi2")
#endif
template <class T, class U>
constexpr bool chmax(T &a, const U &b) {
    return a < (T)b ? a = (T)b, true : false;
}
template <class T, class U>
constexpr bool chmin(T &a, const U &b) {
    return (T)b < a ? a = (T)b, true : false;
}
constexpr std::int64_t INF = 1000000000000000003;
constexpr int Inf = 1000000003;
constexpr double EPS = 1e-7;
constexpr double PI = 3.14159265358979323846;
#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)
#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)
#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)
#define rep(i, n) FOR (i, 0, n)
#define repn(i, n) FOR (i, 1, n + 1)
#define repr(i, n) FORR (i, n, 0)
#define repnr(i, n) FORR (i, n + 1, 1)
#define all(s) (s).begin(), (s).end()
struct Sonic {
    Sonic() {
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
        std::cout << std::fixed << std::setprecision(20);
    }
    constexpr void operator()() const {}
} sonic;
using namespace std;
using ll = std::int64_t;
using ld = long double;
template <class T, class U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {
    return is >> p.first >> p.second;
}
template <class T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
    for (T &i : v) is >> i;
    return is;
}
template <class T, class U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {
    return os << '(' << p.first << ',' << p.second << ')';
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {
    for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? "" : " ") << *it;
    return os;
}
template <class Head, class... Tail>
void co(Head &&head, Tail &&...tail) {
    if constexpr (sizeof...(tail) == 0) std::cout << head << '\n';
    else std::cout << head << ' ', co(std::forward<Tail>(tail)...);
}
template <class Head, class... Tail>
void ce(Head &&head, Tail &&...tail) {
    if constexpr (sizeof...(tail) == 0) std::cerr << head << '\n';
    else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);
}
void Yes(bool is_correct = true) { std::cout << (is_correct ? "Yes\n" : "No\n"); }
void No(bool is_not_correct = true) { Yes(!is_not_correct); }
void YES(bool is_correct = true) { std::cout << (is_correct ? "YES\n" : "NO\n"); }
void NO(bool is_not_correct = true) { YES(!is_not_correct); }
void Takahashi(bool is_correct = true) { std::cout << (is_correct ? "Takahashi" : "Aoki") << '\n'; }
void Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }
int main(void) {
    string s;
    cin >> s;
    if (all_of(s.begin(), s.end(), [&](char c) {
            return s.front() == c;
        })) {
        co(s);
    } else if (s.size() <= 10) {
        vector<char> v(s.begin(), s.end());
        sort(all(v));
        ll ans = -1;
        do {
            ll x = 0;
            for (auto c : v) {
                x *= 10;
                x += c - '0';
            }
            if (ans == -1)
                ans = x;
            else
                ans = gcd(ans, x);
        } while (next_permutation(all(v)));
        co(ans);
    } else {
        bool f2 = true;
        bool f5 = true;
        int sum = 0;
        for (auto c : s) {
            int x = c - '0';
            f2 &= x % 2 == 0;
            f5 &= x % 5 == 0;
            sum += c;
        }
        ll ans = 1;
        if (sum % 9 == 0)
            ans *= 3;
        if (sum % 3 == 0)
            ans *= 3;
        if (f2)
            ans *= 2;
        if (f5)
            ans *= 5;
        co(ans);
    }
    return 0;
}
0