結果

問題 No.1092 modular arithmetic
ユーザー dot_haraai
提出日時 2021-03-28 17:29:38
言語 Nim
(2.2.0)
結果
AC  
実行時間 65 ms / 2,000 ms
コード長 1,153 bytes
コンパイル時間 3,493 ms
コンパイル使用メモリ 86,268 KB
実行使用メモリ 7,424 KB
最終ジャッジ日時 2024-11-29 09:17:01
合計ジャッジ時間 6,761 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 32
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated]
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
/home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport]
/home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport]
/home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport]
/home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport]
/home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]

ソースコード

diff # 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')


proc modPow(x,n,md:int):int=
  var
    x = x
    n = n
  result=1
  while n>0:
    if (n and 1)>0:
      result*=x
      result.mod=md
    x*=x
    x.mod=md
    n = n shr 1

proc solve():int=
  var
    (p,n)=(scan(),scan())
    a = newseqwith(n,scan())
    s = read()
  result = a[0]
  for i in 0..<n-1:
    #echo fmt"{result}{s[i]}{a[i+1]}="
    if s[i]=='*':
      result=(result*a[i+1])
    elif s[i]=='+':
      result+=a[i+1]
    elif s[i]=='-':
      result+=(p-a[i+1])
    else:
      #echo fmt"{a[i+1]}^{p-2} = {modPow(a[i+1],p-2,p)}"
      result*=modPow(a[i+1],p-2,p)
    result.mod=p
    
  

  

  
echo solve()
0