結果
問題 |
No.1258 コインゲーム
|
ユーザー |
|
提出日時 | 2021-06-08 21:33:40 |
言語 | Nim (2.2.0) |
結果 |
AC
|
実行時間 | 326 ms / 2,000 ms |
コード長 | 1,047 bytes |
コンパイル時間 | 4,985 ms |
コンパイル使用メモリ | 86,144 KB |
実行使用メモリ | 5,504 KB |
最終ジャッジ日時 | 2024-11-27 04:28:48 |
合計ジャッジ時間 | 18,716 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 50 |
コンパイルメッセージ
/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]
ソースコード
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()= var t = scan() nmx = newseqwith(t,(scan(),scan(),scan())) md = 10^9+7 inv2 = modPow(2,md-2,md) for (n,m,x) in nmx: if (n+x).mod(2) == 0: echo ((modpow(m+1,n,md)+modpow(m-1,n,md))*inv2).mod(md) else: echo ((((modpow(m+1,n,md)-modpow(m-1,n,md)))*inv2).mod(md)+md).mod(md) solve()