結果

問題 No.1339 循環小数
ユーザー tokusakurai
提出日時 2021-01-15 21:56:10
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 78 ms / 2,000 ms
コード長 4,467 bytes
コンパイル時間 2,516 ms
コンパイル使用メモリ 209,772 KB
最終ジャッジ日時 2025-01-17 19:16:20
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
struct io_setup{
io_setup(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
template<typename T> vector<T> divisors(const T &n){
vector<T> ret;
for(T i = 1; i*i <= n; i++){
if(n%i == 0){
ret.pb(i);
if(i*i != n) ret.pb(n/i);
}
}
sort(all(ret));
return ret;
}
template<typename T> vector<pair<T, int>> prime_factor(T n){
vector<pair<T, int>> ret;
for(T i = 2; i*i <= n; i++){
int cnt = 0;
while(n%i == 0) cnt++, n /= i;
if(cnt > 0) ret.eb(i, cnt);
}
if(n > 1) ret.eb(n, 1);
return ret;
}
template<typename T> bool is_prime(const T &n){
if(n == 1) return false;
for(T i = 2; i*i <= n; i++){
if(n%i == 0) return false;
}
return true;
}
vector<bool> Eratosthenes(const int &n){
vector<bool> ret(n+1, true);
if(n >= 0) ret[0] = false;
if(n >= 1) ret[1] = false;
for(int i = 2; i*i <= n; i++){
if(!ret[i]) continue;
for(int j = i+i; j <= n; j += i) ret[j] = false;
}
return ret;
}
vector<int> Eratosthenes2(const int &n){
vector<int> ret(n+1);
iota(all(ret), 0);
if(n >= 0) ret[0] = -1;
if(n >= 1) ret[1] = -1;
for(int i = 2; i*i <= n; i++){
if(ret[i] < i) continue;
for(int j = i+i; j <= n; j += i) chmin(ret[j], i);
}
return ret;
}
struct Random_Number_Generator{
mt19937_64 mt;
Random_Number_Generator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}
int64_t operator () (int64_t l, int64_t r){
uniform_int_distribution<int64_t> dist(l, r-1);
return dist(mt);
}
int64_t operator () (int64_t r){
return (*this)(0, r);
}
};
ll modpow(ll x, ll n, const int &m){
ll ret = 1;
while(n){
if(n&1) ret *= x, ret %= m;
x *= x, x %= m;
n >>= 1;
}
return ret;
}
template<typename T> T Euler_Totient(T m){ //φ(xmx^φ(m)≡1(mod m))
T ret = m;
for(T i = 2; i*i <= m; i++){
if(m%i == 0) ret /= i, ret *= i-1;
while(m%i == 0) m /= i;
}
if(m > 1) ret /= m, ret *= m-1;
return ret;
}
int modlog(const int &x, ll y, const int &m){ //x^k=y(mod m)k(xm)
unordered_map<int, int> mp;
int n = 0; ll now = 1;
for(; n*n < m; n++){
if(!mp.count(now)) mp[now] = n;
now *= x, now %= m;
}
now = modpow(now, Euler_Totient(m)-1, m);
rep(i, n){
if(mp.count(y)) return n*i+mp[y];
y *= now, y %= m;
}
return -1;
}
template<typename T> T order(T x, const T &m){ //x^k=1(mod m)k(xm)
T n = Euler_Totient(m);
vector<T> ds;
for(T i = 1; i*i <= n; i++){
if(n%i == 0) ds.pb(i), ds.pb(n/i);
}
sort(all(ds));
for(auto &e: ds){
if(modpow(x, e, m) == 1) return e;
}
return -1;
}
template<typename T> T primitive_root(T m){ //m
vector<T> ds;
for(T i = 1; i*i <= m-1; i++){
if((m-1)%i == 0) ds.pb(i), ds.pb((m-1)/i);
}
sort(all(ds));
Random_Number_Generator rnd;
while(true){
T r = rnd(1, m);
for(auto &e: ds){
if(e == m-1) return r;
if(modpow(r, e, m) == 1) break;
}
}
}
int main(){
int T;
cin >> T;
while(T--){
ll N;
cin >> N;
while(N%2 == 0) N /= 2;
while(N%5 == 0) N /= 5;
if(N == 1) cout << 1 << '\n';
else cout << order(10LL, N) << '\n';
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0