結果

問題 No.251 大きな桁の復習問題(1)
ユーザー むらため
提出日時 2019-01-27 19:50:17
言語 Nim
(2.2.0)
結果
AC  
実行時間 4 ms / 5,000 ms
コード長 2,433 bytes
コンパイル時間 2,324 ms
コンパイル使用メモリ 61,088 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-01 11:03:11
合計ジャッジ時間 3,142 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 21
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'sequtils' [UnusedImport]

ソースコード

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

import sequtils,math
proc getchar_unlocked():char {. importc:"getchar_unlocked",header: "<stdio.h>" .}
type ModInt = object
  v:int # 0~MODに収まる
const MOD = 129402307
template useModulo() =
  proc toModInt*(a:int) : ModInt =
    if a < -MOD : result.v = ((a mod MOD) + MOD) mod MOD
    elif a < 0 : result.v = a + MOD
    elif a >= MOD: result.v = a mod MOD
    else: result.v = a
  proc `+`*(a,b:ModInt) : ModInt =
    result.v = a.v + b.v
    if result.v >= MOD : result.v = result.v mod MOD
  proc `*`*(a,b:ModInt) : ModInt =
    result.v = a.v * b.v
    if result.v >= MOD : result.v = result.v mod MOD
  proc `^`*(a:ModInt,b:int) : ModInt =
    if a.v == 0 : return 0.toModInt()
    if b == 0 : return 1.toModInt()
    if b == 1 : return a
    let pow = a^(b div 2)
    if b mod 2 == 0 : return pow * pow
    return pow * pow * a
  proc `+`*(a:int,b:ModInt) : ModInt = a.toModInt() + b
  proc `+`*(a:ModInt,b:int) : ModInt = a + b.toModInt()
  proc `-`*(a:ModInt,b:int) : ModInt = a + (-b)
  proc `-`*(a,b:ModInt) : ModInt = a + (-b.v)
  proc `-`*(a:int,b:ModInt) : ModInt = a.toModInt() + (-b.v)
  proc `*`*(a:int,b:ModInt) : ModInt = a.toModInt() * b
  proc `*`*(a:ModInt,b:int) : ModInt = a * b.toModInt()
  proc `/`*(a,b:ModInt) : ModInt = a * b^(MOD-2)
  proc `$`*(a:ModInt) : string = $a.v
useModulo()
proc scan(isTrulyZero:var bool): ModInt =
  result = 0.toModInt()
  block:
    let k = getchar_unlocked()
    result = 10 * result + k.ord - '0'.ord
    isTrulyZero = k == '0'
  block:
    let k = getchar_unlocked()
    if k < '0': return
    isTrulyZero = false
    result = 10 * result + k.ord - '0'.ord
  while true:
    let k = getchar_unlocked()
    if k < '0': return
    result = 10 * result + k.ord - '0'.ord
proc scanX(isTrulyZero:var bool): int =
  const nowMOD = MOD - 1
  result = 0
  block:
    let k = getchar_unlocked()
    result = 10 * result + k.ord - '0'.ord
    isTrulyZero = k == '0'
  block:
    let k = getchar_unlocked()
    if k < '0': return
    isTrulyZero = false
    result = 10 * result + k.ord - '0'.ord
  while true:
    let k = getchar_unlocked()
    if k < '0': break
    result = 10 * result + k.ord - '0'.ord
    if result >= nowMOD : result = result mod nowMOD
var isTrulyZero = false
let n = scan(isTrulyZero)
var isTrulyZeroX = false
let m = scanX(isTrulyZeroX)
if n.v == 0 : # 0^m == 0 | x^0
  if not isTrulyZero and isTrulyZeroX : echo 1
  else: echo 0
else:echo n^m
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0