結果

問題 No.1352 Three Coins
コンテスト
ユーザー dot_haraai
提出日時 2021-06-08 22:10:45
言語 Nim
(2.2.0)
結果
AC  
実行時間 43 ms / 2,000 ms
コード長 918 bytes
コンパイル時間 4,713 ms
コンパイル使用メモリ 86,912 KB
実行使用メモリ 6,972 KB
最終ジャッジ日時 2024-11-27 05:09:57
合計ジャッジ時間 6,299 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 34
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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, 8) Warning: imported and not used: 'critbits' [UnusedImport]
/home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [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]

ソースコード

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 solve()=
  var
    a = scan()
    b = scan()
    c = scan()
    g = gcd(a,gcd(b,c))
  if g == 1:
    var
      x = @[a,b,c]
    x.sort
    var
      n = x[1]*x[2]-x[1]-x[2]
      dp = newseqwith(n+1,false)
    dp[0]=true
    for i in 1..n:
      for j in 0..2:
        if i-x[j]>=0:
          dp[i] = dp[i] or dp[i-x[j]]
    echo dp.count(false)

  else:
    echo "INF"

  
solve()
0