結果

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

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
istream& operator>>(istream& is, __int128_t& x) {
x = 0;
string s;
is >> s;
int n = int(s.size()), it = 0;
if (s[0] == '-') it++;
for (; it < n; it++) x = (x * 10 + s[it] - '0');
if (s[0] == '-') x = -x;
return is;
}
ostream& operator<<(ostream& os, __int128_t x) {
if (x == 0) return os << 0;
if (x < 0) os << '-', x = -x;
deque<int> deq;
while (x) deq.emplace_front(x % 10), x /= 10;
for (int e : deq) os << e;
return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
return os << "(" << p.first << ", " << p.second << ")";
}
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];
}
return os << "}";
}
template<class Container> inline int SZ(Container& v) { return int(v.size()); }
template<class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template<class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) {a = b; return true ;} return false ;}
template<class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) {a = b; return true ;} return false ;}
inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
inline int popcount(ull x) { return __builtin_popcountll(x); }
inline int kthbit(ull x, int k) { return (x>>k) & 1; }
inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x-1) * 10; }
inline void print() { cout << "\n"; }
template<class T>
inline void print(const vector<T>& v) {
for (int i = 0; i < int(v.size()); i++) {
if (i) cout << " ";
cout << v[i];
}
print();
}
template<class T, class... Args>
inline void print(const T& x, const Args& ... args) {
cout << x << " ";
print(args...);
}
#ifdef MINATO_LOCAL
inline void debug_out() { cerr << endl; }
template <class T, class... Args>
inline void debug_out(const T& x, const Args& ... args) {
cerr << " " << x;
debug_out(args...);
}
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// O(sqrt(N))
template<typename Int>
Int totient(Int N) {
assert(N >= 1);
Int ret = N;
for (Int i = 2; i*i <= N; i++) {
if (N % i == 0) {
ret = ret / i * (i-1);
while (N % i == 0) N /= i;
}
}
if (N != 1) ret = ret / N * (N-1);
return ret;
}
//O(sqrt(N))
template<typename Int>
vector<Int> divisor(Int x) {
assert(x >= 1);
vector<Int> ret;
for (Int i = 1; i*i <= x; i++) {
if (x % i == 0) {
ret.emplace_back(i);
ret.emplace_back(x/i);
}
}
sort(ret.begin(),ret.end());
ret.erase(unique(begin(ret), end(ret)), end(ret));
return ret;
}
ll pow_mod(ll x, ll a, ll mod) {
ll ret = 1;
while (a) {
if (a&1) ret = ret*x%mod;
x = x*x%mod;
a >>= 1;
}
return ret;
}
void solve() {
int N; cin >> N;
while (N % 2 == 0) N /= 2;
while (N % 5 == 0) N /= 5;
if (N==1) {
cout << 1 << ln;
return;
}
auto t = totient(N);
auto divs = divisor(t);
for (auto e : divs) {
if (pow_mod(10,e,N)==1) {
cout << e << ln;
return;
}
}
}
int main() {
int Q; cin >> Q;
while (Q--) {
solve();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0