結果

問題 No.129 お年玉(2)
ユーザー dot_haraai
提出日時 2021-05-30 11:58:26
言語 Nim
(2.2.0)
結果
MLE  
実行時間 -
コード長 938 bytes
コンパイル時間 4,964 ms
コンパイル使用メモリ 86,528 KB
実行使用メモリ 803,584 KB
最終ジャッジ日時 2024-11-08 20:42:31
合計ジャッジ時間 57,074 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27 MLE * 19
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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 # 

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 comb(n,k:int,m:int):int=
  var
    dp = newseqwith(n+1,newseqwith(n+1,0))

  for i in 0..n:
    dp[i][0]=1
  for i in 1..n:
    for j in 1..<n:
      dp[i][j] = (dp[i-1][j-1]+dp[i-1][j]).mod(m)
  #echo dp.join("\n")
  return dp[n][k]






proc solve():int=
  var
    n = scan().div(1000) # 千円札の枚数
    m = scan()
    md = 10^9
    yojou = n.mod(m)
  return comb(m,yojou,md)


  
echo solve()
0