結果

問題 No.1339 循環小数
ユーザー ziita
提出日時 2021-02-22 01:08:17
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 45 ms / 2,000 ms
コード長 4,607 bytes
コンパイル時間 14,429 ms
コンパイル使用メモリ 378,852 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-19 21:18:03
合計ジャッジ時間 14,962 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

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

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]
use std::cmp::*;
use std::collections::*;
use std::ops::*;
// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254
macro_rules! eprint {
($($t:tt)*) => {{
use ::std::io::Write;
let _ = write!(::std::io::stderr(), $($t)*);
}};
}
macro_rules! eprintln {
() => { eprintln!(""); };
($($t:tt)*) => {{
use ::std::io::Write;
let _ = writeln!(::std::io::stderr(), $($t)*);
}};
}
macro_rules! dbg {
($v:expr) => {{
let val = $v;
eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
val
}}
}
macro_rules! mat {
($($e:expr),*) => { Vec::from(vec![$($e),*]) };
($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}
macro_rules! ok {
($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
$a$([$i])*.$f($($t),*)
};
($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
let t = $e;
ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
} };
}
pub fn readln() -> String {
let mut line = String::new();
::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
line
}
macro_rules! read {
($($t:tt),*; $n:expr) => {{
let stdin = ::std::io::stdin();
let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
let line = line.unwrap();
let mut it = line.split_whitespace();
_read!(it; $($t),*)
}).collect::<Vec<_>>();
ret
}};
($($t:tt),*) => {{
let line = readln();
let mut it = line.split_whitespace();
_read!(it; $($t),*)
}};
}
macro_rules! _read {
($it:ident; [char]) => {
_read!($it; String).chars().collect::<Vec<_>>()
};
($it:ident; [u8]) => {
Vec::from(_read!($it; String).into_bytes())
};
($it:ident; usize1) => {
$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
};
($it:ident; [usize1]) => {
$it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
};
($it:ident; [$t:ty]) => {
$it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
};
($it:ident; $t:ty) => {
$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
};
($it:ident; $($t:tt),+) => {
($(_read!($it; $t)),*)
};
}
pub fn main() {
let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}
const MOD: usize = 998244353;
// const MOD: usize = 1_000_000_007;
// const INF: i64 = std::i64::MAX;
const INF: usize = std::usize::MAX;
// const INF: i128 = std::i128::MAX/100;
fn solve() {
let t = read!(usize);
for i in 0..t {
let n = read!(i64);
let mut t = n;
while t%2==0 {
t /= 2;
}
while t%5==0 {
t /= 5;
}
if t==1 {
println!("1");
continue;
}
let mut x = t;
let mut f = vec![];
for j in 2..=t {
if j*j>t {
break;
}
if x%j!=0 {
continue;
}
f.push(j);
while x%j==0 {
x /= j;
}
}
if x!=1 {
f.push(x);
}
let mut phi = t;
for &f in &f {
phi = phi*(f-1)/f;
}
let mut div = vec![];
for j in 1..=phi {
if j*j>phi {
break;
}
if phi%j!=0 {
continue;
}
div.push(j);
if j*j!=phi{
div.push(phi/j);
}
}
div.sort();
let mut ans = phi;
for &d in &div {
let mut val = 1;
let mut b = 10;
for j in 0..60 {
if (d>>j)%2==1 {
val *= b;
val %= t;
}
b = (b*b) % t;
}
if val==1 {
ans = min(ans, d);
}
}
println!("{}",ans);
}
}
fn run() {
let stack_size = 104_857_600; // 100 MB
let thd = std::thread::Builder::new().stack_size(stack_size);
solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0