結果

問題 No.954 Result
ユーザー dot_haraai
提出日時 2021-03-09 21:34:57
言語 Nim
(2.2.0)
結果
RE  
実行時間 -
コード長 1,019 bytes
コンパイル時間 3,658 ms
コンパイル使用メモリ 86,528 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-11 12:36:26
合計ジャッジ時間 4,753 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 6 RE * 1
other AC * 23 RE * 6
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(2, 8) Warning: imported and not used: 'critbits' [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():int=
  var
    a = newseqwith(5,scan().int64).reversed()
    mx = 97
    fib = newseqwith(mx,0i64)
  fib[0]=1
  fib[1]=1
  fib[2]=2
  fib[3]=3
  fib[4]=5
  fib[5]=8
  for i in 0..<5:
    for l in 1..5:
      if fib[i..<i+l] == a[0..<l]:
        result.max=l
  for i in 6..<mx:
    fib[i] = fib[i-1]+fib[i-2]
    #echo fib[i]
    if fib[i-5]==a[0]:
      for l in 1..5:
        if fib[i-5..<i-5+l] == a[0..<l]:
          result.max=l
      break
    
  
  
  

  
echo solve()
0