結果

問題 No.634 硬貨の枚数1
コンテスト
ユーザー dot_haraai
提出日時 2021-06-03 22:01:54
言語 Nim
(2.2.0)
結果
AC  
実行時間 18 ms / 2,000 ms
コード長 938 bytes
コンパイル時間 4,351 ms
コンパイル使用メモリ 86,528 KB
実行使用メモリ 13,056 KB
最終ジャッジ日時 2024-11-17 10:44:51
合計ジャッジ時間 7,088 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 75
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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]

ソースコード

diff #
raw source code 

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():int=
  var
    n = scan()
    yen = newseq[int]()
    isSankaku = newseqwith(n+1,false)
  for k in 1..<int.high:
    if (k*(k+1)).div(2) <= n:
      yen.add((k*(k+1)).div(2))
      isSankaku[(k*(k+1)).div(2)] = true
    else:
      break
  if isSankaku[n]:
    return 1
  else:
    for coin in yen:
      if isSankaku[coin] and isSankaku[n-coin]:
        return 2
    return 3


  
echo solve()
0