結果

問題 No.195 フィボナッチ数列の理解(2)
ユーザー mkawa2
提出日時 2024-10-02 14:06:55
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
WA  
実行時間 -
コード長 1,832 bytes
コンパイル時間 107 ms
コンパイル使用メモリ 12,800 KB
実行使用メモリ 11,008 KB
最終ジャッジ日時 2024-10-02 14:06:57
合計ジャッジ時間 1,726 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 21 WA * 1
権限があれば一括ダウンロードができます

ソースコード

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

import sys
# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)
md = 10**9+7
# md = 998244353
# a*fib[i]+b*fib[i+1]=x
# b=(x-a*fib[i])/fib[i+1]
fib = [0, 1]
for _ in range(46): fib.append(fib[-2]+fib[-1])
xyz = sorted(set(LI()))
if len(xyz) == 1:
a, b = 1, inf
x = xyz[0]
for i in range(47):
f = fib[i]
g = fib[i+1]
if x-a*f < 1 or (x-a*f)%g: continue
b = (x-a*f)//g
if b == inf:
print(-1)
else:
print(a, b)
elif len(xyz) == 2:
x, y = xyz
a, b = x, inf
for i in range(47):
f = fib[i]
g = fib[i+1]
if y-a*f < a*g or (y-a*f)%g: continue
b = (y-a*f)//g
if b == inf:
print(-1)
else:
while b-a > 0 and b-a<=a:a, b = b-a, a
print(a, b)
else:
x, y, z = xyz
a = x
bb = set()
cc = set()
for i in range(47):
f = fib[i]
g = fib[i+1]
if y-a*f >= a*g and (y-a*f)%g==0:bb.add((y-a*f)//g)
if z-a*f >= a*g and (z-a*f)%g==0:cc.add((z-a*f)//g)
bb&=cc
if bb:
b=min(bb)
while b-a > 0 and b-a<=a:a, b = b-a, a
print(a, b)
else:
print(-1)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0