結果

問題 No.1448 和差算
コンテスト
ユーザー dot_haraai
提出日時 2021-04-05 21:27:01
言語 Nim
(2.2.0)
結果
WA  
実行時間 -
コード長 1,617 bytes
コンパイル時間 5,331 ms
コンパイル使用メモリ 86,804 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-12-31 22:06:58
合計ジャッジ時間 6,012 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 24 WA * 12
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(1, 25) Warning: imported and not used: 'sequtils' [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]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [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
    n = n shr 1
    x = (x*x).mod(md)


proc solve():auto{.discardable.}=
  var
    a = scan()
    b = scan()
    c = scan()
    d = scan()
    n = scan()
    md = 10^9+7
    
  if n.mod(4)==1:
    if n.div(4).mod(2)==0:
      result = ((2*b).mod(md)*modPow(-4,n.div(4),md)).mod(md)
    else:
      result = ((2*a).mod(md)*modPow(-4,n.div(4),md)).mod(md)
  if n.mod(4)==2:
    if n.div(4).mod(2)==0:
      result = ((2*(b-c)).mod(md)*modPow(-4,n.div(4),md)).mod(md)
    else:
      result = ((2*(a-d)).mod(md)*modPow(-4,n.div(4),md)).mod(md)
  if n.mod(4)==3:
    if n.div(4).mod(2)==0:
      result = ((-4*d).mod(md)*modPow(-4,n.div(4),md)).mod(md)
    else:
      result = ((-4*c).mod(md)*modPow(-4,n.div(4),md)).mod(md)
  if n.mod(4)==0:
    if n.div(4).mod(2)==0:
      result = (b+d).mod(md)*modPow(-4,n.div(4),md).mod(md)
    else:
      result = (a+c).mod(md)*modPow(-4,n.div(4),md).mod(md)
  result+=md
  result.mod=md



  

  
echo solve()
0