結果
問題 | No.1339 循環小数 |
ユーザー | suta28407928 |
提出日時 | 2021-01-15 23:43:56 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 68 ms / 2,000 ms |
コード長 | 3,376 bytes |
コンパイル時間 | 2,603 ms |
コンパイル使用メモリ | 194,852 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-26 18:40:54 |
合計ジャッジ時間 | 4,088 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 36 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;#define DEBUG#ifdef DEBUGtemplate <class T, class U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << '(' << p.first << ',' << p.second << ')';return os;}template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {os << '{';for(int i = 0; i < (int)v.size(); i++) {if(i) { os << ','; }os << v[i];}os << '}';return os;}void debugg() { cerr << endl; }template <class T, class... Args>void debugg(const T &x, const Args &... args) {cerr << " " << x;debugg(args...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endifusing namespace std;typedef long long ll;typedef vector<ll> vl;typedef vector<vl> vvl;typedef vector<char> vc;typedef vector<string> vs;typedef vector<bool> vb;typedef vector<double> vd;typedef pair<ll,ll> P;typedef pair<int,int> pii;typedef vector<P> vpl;typedef tuple<ll,ll,ll> tapu;#define rep(i,n) for(int i=0; i<(n); i++)#define REP(i,a,b) for(int i=(a); i<(b); i++)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()const int inf = 1<<30;const ll linf = 1LL<<61;const int MAX = 510000;int dy[8] = {0,1,0,-1,1,-1,-1,1};int dx[8] = {-1,0,1,0,1,-1,1,-1};const double pi = acos(-1);const double eps = 1e-7;template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){if(a>b){a = b; return true;}else return false;}template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){if(a<b){a = b; return true;}else return false;}template<typename T> inline void print(T &a){int sz = a.size();for(auto itr = a.begin(); itr != a.end(); itr++){cout << *itr;sz--;if(sz) cout << " ";}cout << "\n";}template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){cout << a << " " << b << " " << c << "\n";}void mark() {cout << "#" << "\n";}ll pcount(ll x) {return __builtin_popcountll(x);}const int mod = 1e9 + 7;//const int mod = 998244353;map<ll,ll> prime_factor(ll n){map<ll,ll> mp;for(ll i=2; i*i<=n; i++){while(n % i == 0){mp[i]++;n /= i;}}if(n != 1) mp[n] = 1;return mp;}vl divisor(ll k){vl c;for(ll i=1; i*i<=k; i++){if(k % i == 0){c.push_back(i);if((k / i) != i){c.push_back(k/i);}}}sort(c.begin(), c.end());return c;}ll modpow(ll x, ll n, ll mod){ll res = 1;while(n > 0){if(n & 1) res = res * x % mod;x = x * x % mod;n >>= 1;}return res;}int main(){int t; cin >> t;while(t--){int n; cin >> n;while(n % 2 == 0) n /= 2;while(n % 5 == 0) n /= 5;auto pri = prime_factor(n);if(n == 1){cout << "1\n";continue;}int N = n;for(auto x : pri){N /= x.first;N *= x.first-1;}auto div = divisor(N);int ans = inf;for(auto x : div){if(modpow(10,x,n) == 1){ans = x; break;}}cout << ans << "\n";}}