結果

問題 No.1035 Color Box
ユーザー dot_haraai
提出日時 2021-06-08 23:18:04
言語 Nim
(2.2.0)
結果
AC  
実行時間 130 ms / 2,000 ms
コード長 1,211 bytes
コンパイル時間 3,549 ms
コンパイル使用メモリ 86,272 KB
実行使用メモリ 6,272 KB
最終ジャッジ日時 2024-11-27 06:29:35
合計ジャッジ時間 5,542 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 36
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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 modpow(x,n,md:int):int=
  var
    x = x
    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
proc solve():int=
  var
    n = scan()
    m = scan()
    md = 10^9+7
    inv = newseqwith(m+1,0)
    comb = newseqwith(m+1,0)
    f = newseqwith(m+1,0)
    cf = newseqwith(m+1,0)
  
  # combinationの事前計算
  comb[1]=m
  for i in 1..m:
    inv[i] = modpow(i,md-2,md)
  for i in 2..m:
    comb[i] = ((comb[i-1]*(m-i+1)).mod(md)*inv[i]).mod(md)
  for i in 0..m:
    result+=((comb[i]*modpow(i,n,md)).mod(md)*modpow(-1,m-i,md)).mod(md)
    result.mod=md
  result+=md
  result.mod=md
echo solve()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0