結果
問題 | No.1339 循環小数 |
ユーザー |
![]() |
提出日時 | 2021-01-15 22:26:01 |
言語 | Swift (6.0.3) |
結果 |
AC
|
実行時間 | 38 ms / 2,000 ms |
コード長 | 4,317 bytes |
コンパイル時間 | 3,233 ms |
コンパイル使用メモリ | 190,320 KB |
実行使用メモリ | 15,872 KB |
最終ジャッジ日時 | 2024-11-26 16:10:47 |
合計ジャッジ時間 | 4,874 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 36 |
ソースコード
import Foundation struct Scanner { private var elements = [String]() private var index = 0 mutating func peek() -> String { while elements.count == index { elements = readLine()!.split(separator: " ").map(String.init) index = 0 } return elements[index] } mutating func next() -> String { defer { index += 1 } return peek() } mutating func nextInt() -> Int { return Int(next())! } mutating func nextInts(_ n: Int) -> [Int] { return (0 ..< n).map { _ in nextInt() } } mutating func nextDouble() -> Double { return Double(next())! } } let mod = 1000000007 struct Zn: CustomStringConvertible, AdditiveArithmetic { let n: Int init(_ n: Int) { self.n = n } var description: String { String(self.n) } static var zero = Zn(0) static var one = Zn(1) static func + (lhs: Self, rhs: Self) -> Self { let n = lhs.n + rhs.n return Zn(n < mod ? n : n - mod) } static func + (lhs: Self, rhs: Int) -> Self { return lhs + Zn(rhs) } static func + (lhs: Int, rhs: Self) -> Self { return Zn(lhs) + rhs } static func - (lhs: Self, rhs: Self) -> Self { let n = lhs.n - rhs.n return Zn(n >= 0 ? n : n + mod) } static func - (lhs: Self, rhs: Int) -> Self { return lhs - Zn(rhs) } static func - (lhs: Int, rhs: Self) -> Self { return Zn(lhs) - rhs } static func * (lhs: Self, rhs: Self) -> Self { Zn((lhs.n * rhs.n) % mod) } static func * (lhs: Self, rhs: Int) -> Self { return lhs * Zn(rhs) } static func * (lhs: Int, rhs: Self) -> Self { return Zn(lhs) * rhs } static func / (lhs: Zn, rhs: Zn) -> Self { return lhs * rhs.inverse } static func / (lhs: Int, rhs: Zn) -> Self { return Zn(lhs) * rhs.inverse } static func / (lhs: Zn, rhs: Int) -> Self { return lhs * Zn(rhs).inverse } static func += (lhs: inout Self, rhs: Self) { lhs = lhs + rhs } static func += (lhs: inout Self, rhs: Int) { lhs = lhs + Zn(rhs) } static func -= (lhs: inout Self, rhs: Self) { lhs = lhs - rhs } static func -= (lhs: inout Self, rhs: Int) { lhs = lhs - Zn(rhs) } static func *= (lhs: inout Self, rhs: Self) { lhs = lhs * rhs } static func *= (lhs: inout Self, rhs: Int) { lhs = lhs * Zn(rhs) } static func /= (lhs: inout Self, rhs: Self) { lhs = lhs / rhs } static func /= (lhs: inout Self, rhs: Int) { lhs = lhs / Zn(rhs) } func pow(_ n: Int) -> Self { if n == 0 { return Zn(1) } else if n % 2 == 1 { return self * self.pow(n - 1) } else { return (self * self).pow(n / 2) } } var inverse: Self { self.pow(mod - 2) } } extension Int { func divisors() -> [Int] { var i = 1 var result = [Int]() while i * i <= self { if self % i == 0 { result.append(i) if i * i != self { result.append(self / i) } } i += 1 } return result } } func phi(_ n: Int) -> Int { var n = n var result = n var i = 2 while i * i <= n { if n % i == 0 { result = result / i * (i - 1) while n % i == 0 { n /= i } } i += 1 } if n != 1 { result = result / n * (n - 1) } return result } func power(_ n: Int, _ k: Int, _ m: Int) -> Int { if k == 0 { return 1 } else if k % 2 == 1 { return n * power(n, k - 1, m) % m } else { return power(n * n % m, k / 2, m) } } func order(_ n: Int, _ m: Int) -> Int { for k in phi(m).divisors().sorted() { if power(n, k, m) == 1 { return k } } return 1 } var scanner = Scanner() let T = scanner.nextInt() for _ in 0 ..< T { var N = scanner.nextInt() while N % 2 == 0 { N /= 2 } while N % 5 == 0 { N /= 5 } print(order(10, N)) }