結果
問題 |
No.1352 Three Coins
|
ユーザー |
|
提出日時 | 2021-06-20 03:49:21 |
言語 | Nim (2.2.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,047 bytes |
コンパイル時間 | 3,520 ms |
コンパイル使用メモリ | 86,272 KB |
実行使用メモリ | 6,912 KB |
最終ジャッジ日時 | 2024-06-22 22:26:26 |
合計ジャッジ時間 | 4,334 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 32 WA * 2 |
コンパイルメッセージ
/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 solve()= var a = scan() b = scan() c = scan() g = gcd(a,b).gcd(c) if g!=1: echo "INF" return var dp = newseqwith((a-1)*(b-1)+1,false) ans = 0 if a<=(a-1)*(b-1): dp[a]=true if b<=(a-1)*(b-1): dp[b]=true if c<=(a-1)*(b-1): dp[c]=true for i in 1..(a-1)*(b-1): if i-a>=0: dp[i] = dp[i] or dp[i-a] if i-b>=0: dp[i] = dp[i] or dp[i-b] if i-c>=0: dp[i] = dp[i] or dp[i-c] if dp[i]==false: ans+=1 echo ans solve()