fib = {}f = [1, 1]fib[1] = Truewhile f[-1] < 1e10: # 不斷的計(jì)算，然后加在尾部，最后比對(duì)“in” f.append(f[-1]+f[-2]) fib[f[-1]] = TrueT = input()for i in xrange(T): N = input() if N in fib: PRint 'IsFibo' else: print 'IsNotFibo'
Link:
https://www.hackerrank.com/challenges/is-fibo
學(xué)習(xí)：
一次性計(jì)算出來(lái)，然后比對(duì)in
新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注
