結果
問題 | No.1339 循環小数 |
ユーザー |
|
提出日時 | 2021-01-16 00:03:17 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 80 ms / 2,000 ms |
コード長 | 2,041 bytes |
コンパイル時間 | 2,835 ms |
コンパイル使用メモリ | 206,508 KB |
最終ジャッジ日時 | 2025-01-17 20:53:54 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 36 |
ソースコード
/*** author: yuji9511 ***/#include <bits/stdc++.h>// #include <atcoder/all>// using namespace atcoder;using namespace std;using ll = long long;using lpair = pair<ll, ll>;using vll = vector<ll>;const ll MOD = 1e9+7;const ll INF = 1e18;#define rep(i,m,n) for(ll i=(m);i<(n);i++)#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)ostream& operator<<(ostream& os, lpair& h){ os << "(" << h.first << ", " << h.second << ")"; return os;}#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};void print() {}template <class H,class... T>void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}vector<ll> factor(ll M){vector<ll> fac;if(M == 1){fac.push_back(1); return fac;}for(ll i = 2; i*i <= M; i++){while(M % i == 0){fac.push_back(i); M /= i;}}if(M != 1) fac.push_back(M);sort(fac.begin(), fac.end());return fac;}vector<ll> divisor(ll M){vector<ll> div;for(ll i = 1; i * i <= M; i++){if(M % i == 0){div.push_back(i); if(i * i != M) div.push_back(M / i);}}sort(div.begin(), div.end());return div;}ll power(ll x, ll n, ll m = MOD){if(n == 0) return 1LL;ll res = power(x * x % m, n/2, m);if(n % 2 == 1) (res *= x) %= m;return res;}void solve(){ll N;cin >> N;while(N % 2 == 0) N /= 2;while(N % 5 == 0) N /= 5;if(N == 1){print(1);return;}auto dd = factor(N);map<ll,ll> mp;for(auto &e: dd) mp[e]++;ll r2 = 1;for(auto &e: mp){if(e.second > 1){rep(i,0,e.second-1){r2 *= e.first;}}}for(auto &e: mp){r2 *= e.first - 1;}auto div = divisor(r2);for(auto &e: div){if(power(10,e,N) == 1){print(e);return;}}}int main(){cin.tie(0);ios::sync_with_stdio(false);ll t;cin >> t;while(t--) solve();}