結果
問題 | No.1253 雀見椪 |
ユーザー | dot_haraai |
提出日時 | 2021-03-21 12:20:45 |
言語 | Nim (2.0.2) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,266 bytes |
コンパイル時間 | 4,907 ms |
コンパイル使用メモリ | 85,760 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-05-01 21:07:32 |
合計ジャッジ時間 | 5,681 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | RE | - |
testcase_10 | RE | - |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
コンパイルメッセージ
/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]
ソースコード
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 solve()= var t = scan() md = 10^9+7 proc modpow(x,n:int):int= var x=(x).mod(md) 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 for i in 0..<t: var (n,ag,bg,ac,bc,ap,bp) = (scan(),scan(),scan(),scan(),scan(),scan(),scan()) b = bg*bc*bp ag*=bc*bp ac*=bg*bp ap*=bc*bg ag.mod=md ap.mod=md ac.mod=md var base = modpow(b,n) case0 = modpow(ag,n)+modpow(ap,n)+modpow(ac,n) case1 = base-modpow(ag+ac,n)-modpow(ag+ap,n)-modpow(ap+ac,n)+case0 case2 = (case0+case1) mod md echo ((case2*modpow(base,md-2)) mod md + md).mod(md) solve()