Submission #47225493

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
using ModInt [[maybe_unused]] = atcoder::modint998244353;
using Num [[maybe_unused]] = long long int;
using Vec [[maybe_unused]] = std::vector<Num>;
using Set [[maybe_unused]] = std::set<Num>;
using Mset [[maybe_unused]] = std::multiset<Num>;
using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

template<typename T>
using Q [[maybe_unused]] = std::queue<T>;

template<typename T>
using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    Num nb {0};
    is >> nb;

    if (nb == 1) {
        os << "1\n";
        return;
    }

    const __int128 bb = nb;
    __int128 a {2};

    for(;;) {
        __int128 c {1};
        for(Num i{0}; i<a; ++i) {
            c *= a;
        }

        if (c == bb) {
            os << static_cast<Num>(a) << "\n";
            return;
        }

        if (c > bb) {
            break;
        }

        ++a;
    }

    os << "-1\n";
    return;
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result