結果
問題 | No.1339 循環小数 |
ユーザー | hirono999 |
提出日時 | 2021-01-15 22:21:41 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 69 ms / 2,000 ms |
コード長 | 6,152 bytes |
コンパイル時間 | 6,795 ms |
コンパイル使用メモリ | 303,684 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-05-05 00:22:22 |
合計ジャッジ時間 | 8,603 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
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 | 2 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 | 3 ms
5,376 KB |
testcase_12 | AC | 3 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 27 ms
5,376 KB |
testcase_22 | AC | 30 ms
5,376 KB |
testcase_23 | AC | 30 ms
5,376 KB |
testcase_24 | AC | 28 ms
5,376 KB |
testcase_25 | AC | 30 ms
5,376 KB |
testcase_26 | AC | 32 ms
5,376 KB |
testcase_27 | AC | 31 ms
5,376 KB |
testcase_28 | AC | 31 ms
5,376 KB |
testcase_29 | AC | 25 ms
5,376 KB |
testcase_30 | AC | 28 ms
5,376 KB |
testcase_31 | AC | 69 ms
5,376 KB |
testcase_32 | AC | 69 ms
5,376 KB |
testcase_33 | AC | 30 ms
5,376 KB |
testcase_34 | AC | 14 ms
5,376 KB |
testcase_35 | AC | 66 ms
5,376 KB |
testcase_36 | AC | 30 ms
5,376 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> constexpr long long INF = 1LL << 60; double PI = acos(-1.0); #define rep(i, n) for (ll i = 0; i < (n); ++i) #define rep1(i, n) for (ll i = 1; i <= (n); ++i) #define rrep(i, n) for (ll i = (n - 1); i >= 0; --i) #define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c))) #define ALL(obj) (obj).begin(), (obj).end() #define RALL(obj) (obj).rbegin(), (obj).rend() #define pb push_back #define to_s to_string #define len(v) (ll)v.size() #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define print(x) cout << (x) << '\n' #define drop(x) cout << (x) << '\n', exit(0) #define debug(x) cout << #x << ": " << (x) << '\n' using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll, ll> P; typedef tuple<ll, ll, ll> tpl; typedef vector<ll> vec; typedef vector<vector<ll>> vec2; typedef vector<vector<vector<ll>>> vec3; template<class S, class T> inline bool chmax(S &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class S, class T> inline bool chmin(S &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } inline ll msb(ll v) { return 1 << (31 - __builtin_clzll(v)); } inline ll devc(ll x, ll y) { return (x + y - 1) / y; } inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } inline ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); } struct IoSetup { IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; template< typename T1, typename T2 > ostream &operator << (ostream &os, const pair< T1, T2 > &p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > istream &operator >> (istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T1, typename T2, typename T3 > ostream &operator << (ostream &os, const tuple< T1, T2, T3 > &t) { os << get<0>(t) << " " << get<1>(t) << " " << get<2>(t); return os; } template< typename T1, typename T2, typename T3 > istream &operator >> (istream &is, tuple< T1, T2, T3 > &t) { is >> get<0>(t) >> get<1>(t) >> get<2>(t); return is; } template< typename T > ostream &operator << (ostream &os, const vector< T > &v){ for (int i = 0; i < (int)v.size(); ++i) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > istream &operator >> (istream &is, vector< T > &v){ for(T &in : v) is >> in; return is; } template< typename T > ostream &operator << (ostream &os, const set< T > &st){ int ct = 0; for(auto& s : st) cout << s << (++ct != st.size() ? " " : ""); return os; } template <typename T> constexpr set<T> &operator|= (set<T> &st1, const set<T> &st2) { for(auto& s : st2) st1.insert(s); return st1; } template <typename T> constexpr set<T> &operator-= (set<T> &st1, const set<T> &st2) { for(auto& s : st2) if(st1.count(s)) st1.erase(s); return st1; } template <typename T> constexpr set<T> &operator&= (set<T> &st1, const set<T> &st2) { auto itr = st1.begin(); while(itr != st1.end()){ if(!st2.count(*itr)) itr = st1.erase(itr); else ++itr; } return st1; } template <typename T> constexpr set<T> operator| (const set<T> &st1, const set<T> &st2) { set<T> res = st1; res |= st2; return res; } template <typename T> constexpr set<T> operator- (const set<T> &st1, const set<T> &st2) { set<T> res = st1; res -= st2; return res; } template <typename T> constexpr set<T> operator& (const set<T> &st1, const set<T> &st2) { set<T> res = st1; res &= st2; return res; } /*--------------------------------- Tools ------------------------------------------*/ template< typename T > vector<T> cumsum(const vector<T> &X){ vector<T> res(X.size() + 1, 0); for(int i = 0; i < X.size(); ++i) res[i + 1] += res[i] + X[i]; return res; } template< typename S, typename T, typename F> pair<T, T> bisearch(S left, T right, F f) { while(abs(right - left) > 1){ T mid = (right + left) / 2; if(f(mid)) right = mid; else left = mid; } return {left, right}; } template< typename S, typename T, typename F> double trisearch(S left, T right, F f, int maxLoop = 90){ double low = left, high = right; while(maxLoop--){ double mid_left = high / 3 + low * 2 / 3; double mid_right = high * 2 / 3 + low / 3; if(f(mid_left) >= f(mid_right)) low = mid_left; else high = mid_right; } return (low + high) * 0.5; } template< typename F > ll ternarySearch(ll L, ll R, F f) { //[L, R) ll lo = L - 1, hi = R - 1; while (lo + 1 != hi) { ll mi = (lo + hi) / 2; if (f(mi) <= f(mi + 1)) hi = mi; else lo = mi; } return hi; } #include <atcoder/all> using namespace atcoder; constexpr long long MOD = 1000000007; ll euler_phi(ll n) { ll ret = n; for(ll i = 2; i * i <= n; ++i){ if(n % i == 0) { ret -= ret / i; while(n % i == 0) n /= i; } } if(n > 1) ret -= ret / n; return ret; } vector<ll> divisor(ll n) { vector<ll> ret; for(ll i = 1; i * i <= n; i++) { if(n % i == 0) { ret.push_back(i); if(i * i != n) ret.push_back(n / i); } } sort(begin(ret), end(ret)); return (ret); } /*------------------------------- Main Code Here -----------------------------------------*/ int main() { ll T; cin >> T; while(T--){ ll N; cin >> N; while(N % 2 == 0) N /= 2; while(N % 5 == 0) N /= 5; if(N == 1){ print(1); continue; } ll ret = euler_phi(N); vec div = divisor(ret); modint x; x.set_mod(N); x = 10; for(auto d : div){ if(x.pow(d).val() == 1){ print(d); break; } } } return 0; }