結果
問題 | No.1339 循環小数 |
ユーザー |
![]() |
提出日時 | 2023-01-25 02:02:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 640 ms / 2,000 ms |
コード長 | 3,664 bytes |
コンパイル時間 | 1,448 ms |
コンパイル使用メモリ | 130,928 KB |
最終ジャッジ日時 | 2025-02-10 06:39:13 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 36 |
ソースコード
#include<iostream>#include<string>#include<vector>#include<algorithm>#include<numeric>#include<cmath>#include<utility>#include<tuple>#include<cstdint>#include<cstdio>#include<iomanip>#include<map>#include<queue>#include<set>#include<stack>#include<deque>#include<unordered_map>#include<unordered_set>#include<bitset>#include<chrono>#include<random>#include<cctype>#include<cassert>#include<cstddef>#include<iterator>#include<string_view>#include<type_traits>#ifdef LOCAL# include "debug_print.hpp"# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else# define debug(...) (static_cast<void>(0))#endifusing namespace std;#define rep(i,n) for(decltype(n) i=0; i<(n); i++)#define rrep(i,n) for(decltype(n) i=(n)-1; i>=0; i--)#define FOR(i,a,b) for(decltype(a) i=(a); i<(b); i++)#define RFOR(i,a,b) for(decltype(b) i=(b-1); i>=(a); i--)#define ALL(v) v.begin(), v.end()#define RALL(v) v.rbegin(), v.rend()#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );#define pb push_backusing ll = long long;using D = double;using LD = long double;using P = pair<int, int>;template<typename T> using PQ = priority_queue<T,vector<T>>;template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}template<typename T, typename U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << p.first << " " << p.second;return os;}template<typename T, typename U>istream &operator>>(istream &is, pair<T, U> &p) {is >> p.first >> p.second;return is;}template<typename T>ostream &operator<<(ostream &os, const vector<T> &v) {int s = (int)v.size();for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];return os;}template<typename T>istream &operator>>(istream &is, vector<T> &v) {for (auto &x : v) is >> x;return is;}void in() {}template<typename T, class... U>void in(T &t, U &...u) {cin >> t;in(u...);}void out() { cout << "\n"; }template<typename T, class... U, char sep = ' '>void out(const T &t, const U &...u) {cout << t;if (sizeof...(u)) cout << sep;out(u...);}void outr() {}template<typename T, class... U, char sep = ' '>void outr(const T &t, const U &...u) {cout << t;outr(u...);}int64_t mod_log(int64_t a, int64_t b, int64_t p) {int64_t g = 1;for(int64_t i = p; i; i /= 2) (g *= a) %= p;g = gcd(g, p);int64_t t = 1, c = 0;for(; t % g; c++) {if(t == b) return c;(t *= a) %= p;}if(b % g) return -1;t /= g;b /= g;int64_t n = p / g, h = 0, gs = 1;for(; h * h < n; h++) (gs *= a) %= n;unordered_map< int64_t, int64_t > bs;for(int64_t s = 0, e = b; s < h; bs[e] = ++s) {(e *= a) %= n;}for(int64_t s = 0, e = t; s < n;) {(e *= gs) %= n;s += h;if(bs.count(e)) return c + s - bs[e];}return -1;}long long modinv(long long a, long long m) {long long b = m, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}int main(){ios_base::sync_with_stdio(false);cin.tie(nullptr);int t; in(t);while(t--){int64_t n; in(n);while(n%2 == 0) n /= 2;while(n%5 == 0) n /= 5;out(mod_log(10,modinv(10,n),n)+1);}}