#605012 (C++17) No.1339 循環小数

• 問題: No.1339 循環小数
• ユーザー: packer_jp
• 提出日時: 2021-01-16 05:18:42
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,417 ms / 2,000 ms
• コード長: 4,020 bytes
• コンパイル時間: 2,415 ms
• コンパイル使用メモリ: 211,064 KB
• 実行使用メモリ: 5,504 KB
• 最終ジャッジ日時: 2024-05-05 08:29:20
• 合計ジャッジ時間: 16,427 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	3 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	5 ms; 5,376 KB
testcase_12	AC	6 ms; 5,376 KB
testcase_13	AC	5 ms; 5,376 KB
testcase_14	AC	5 ms; 5,376 KB
testcase_15	AC	5 ms; 5,376 KB
testcase_16	AC	5 ms; 5,376 KB
testcase_17	AC	4 ms; 5,376 KB
testcase_18	AC	4 ms; 5,376 KB
testcase_19	AC	4 ms; 5,376 KB
testcase_20	AC	4 ms; 5,376 KB
testcase_21	AC	697 ms; 5,376 KB
testcase_22	AC	794 ms; 5,504 KB
testcase_23	AC	770 ms; 5,376 KB
testcase_24	AC	703 ms; 5,504 KB
testcase_25	AC	781 ms; 5,504 KB
testcase_26	AC	795 ms; 5,376 KB
testcase_27	AC	770 ms; 5,504 KB
testcase_28	AC	788 ms; 5,376 KB
testcase_29	AC	636 ms; 5,376 KB
testcase_30	AC	712 ms; 5,504 KB
testcase_31	AC	1,201 ms; 5,504 KB
testcase_32	AC	1,238 ms; 5,504 KB
testcase_33	AC	774 ms; 5,504 KB
testcase_34	AC	440 ms; 5,376 KB
testcase_35	AC	1,417 ms; 5,376 KB
testcase_36	AC	745 ms; 5,504 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(a) (a).begin(), (a).end()
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define dump(a) cerr << #a " = " << (a) << endl
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int bit(int n) { return 1LL << n; }
int sign(int a) { return (a > 0) - (a < 0); }
int cdiv(int a, int b) { return (a - 1 + b) / b; }
template<typename T> T sq(T a) { return a * a; }
template<typename T> void fin(T a) {
    cout << a << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) {
    os << "(" << a.first << ", " << a.second << ")";
    return os;
}
template<typename T, typename U, typename V> ostream &operator<<(ostream &os, const tuple<T, U, V> &a) {
    os << "(" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &a) {
    os << "(";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const deque<T> &a) {
    os << "(";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const set<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    }
} setup;

int safe_mod(long long a, int m) {
    a %= m;
    if (a < 0) { a += m; }
    return a;
};

int mod_inv(long long a, int m) {
    long long b = m, x = 1, u = 0;
    while (b) {
        int t = a / b;
        std::swap(a -= t * b, b);
        std::swap(x -= t * u, u);
    }
    return safe_mod(x, m);
};

int mod_log(long long a, long long b, int m) {
    a %= m, b %= m;
    std::map<int, int> mp;
    int rt;
    long long ap = a;
    for (rt = 1; rt * rt < m; rt++) {
        if (!mp.count(ap)) { mp[ap] = rt; }
        (ap *= a) %= m;
    }
    ap = mod_inv(ap, m);
    if (mp.count(b)) { return mp[b]; }
    mp[1] = 0;
    for (int i = 1; i < rt; i++) {
        (b *= ap) %= m;
        if (mp.count(b)) { return i * rt + mp[b]; }
    }
    return -1;
}

signed main() {
    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        while (N % 2 == 0) { N /= 2; }
        while (N % 5 == 0) { N /= 5; }
        if (N == 1) {
            cout << 1 << endl;
            continue;
        }
        cout << mod_log(10, 1, N) << endl;
    }
}