結果

問題 No.320 眠れない夜に
ユーザー ckawatak
提出日時 2019-04-30 14:07:07
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 44 ms / 2,000 ms
コード長 554 bytes
コンパイル時間 564 ms
コンパイル使用メモリ 82,300 KB
実行使用メモリ 53,932 KB
最終ジャッジ日時 2024-12-29 22:45:14
合計ジャッジ時間 3,430 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

N,M = list(map(int, input().split()))
def fibo(n):
numbers = [0 for _ in range(N)]
numbers[0] = 1
numbers[1] = 1
for i in range(2,n):
numbers[i] = numbers[i-1] + numbers[i-2]
return numbers
numbers = fibo(N)
diff = numbers[N-1] - M
if diff == 0:
print(0)
exit(0)
if diff < 0:
print(-1)
exit(0)
count = 0
for i in reversed(range(0,N-2)):
if 0 <= diff - numbers[i]:
diff = diff - numbers[i]
count = count + 1
if diff == 0:
break
print(count)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0