結果

問題 No.718 行列のできるフィボナッチ数列道場 (1)
コンテスト
ユーザー dot_haraai
提出日時 2021-06-05 21:32:28
言語 Nim
(2.2.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 1,279 bytes
コンパイル時間 4,986 ms
コンパイル使用メモリ 88,548 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-21 20:34:28
合計ジャッジ時間 5,763 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 20
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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')


const md = 10^9+7

proc `*`(x,y:seq[seq[int]]):seq[seq[int]]=
  var
    xh = x.len
    xw = x[0].len
    yh = y.len
    yw = y[0].len
  if xw != yh:
    raise
  result = newseqwith(xh,newseqwith(yw,0))
  for i in 0..<xh:
    for j in 0..<yw:
      for p in 0..<xw:
        result[i][j]+=x[i][p]*y[p][j]
        result[i][j].mod=md
  return

proc modPow(x:seq[seq[int]],n:int):seq[seq[int]]=
  var
    x = x
    n = n
    h = x.len
    w = x[0].len
  result = newseqwith(h,newseqwith(w,0))
  for i in 0..<h:
    result[i][i]=1
  while n>0:
    if (n and 1)>0:
      result = result*x
    x = x*x
    n = n shr 1
  return



proc solve()=
  var
    n = scan()
    v = modPow(@[@[1,1],@[1,0]],n)
  echo (v[0][0]*v[0][1]).mod(md)
  
      
     
solve()
0