(A, n)
| 15 | |
| 16 | # A の n 乗を返す関数 |
| 17 | def power(A, n): |
| 18 | P = deepcopy(A) |
| 19 | Q = [ [ 0, 0 ], [ 0, 0 ] ] |
| 20 | flag = False |
| 21 | for i in range(60): |
| 22 | if (n & (1 << i)) != 0: |
| 23 | if flag == False: |
| 24 | Q = deepcopy(P) |
| 25 | flag = True |
| 26 | else: |
| 27 | Q = deepcopy(multiply(Q, P)) |
| 28 | P = deepcopy(multiply(P, P)) |
| 29 | return Q |
| 30 | |
| 31 | # 入力 → 累乗の計算（N が 2 以上でなければ正しく動作しないので注意） |
| 32 | N = int(input()) |
no test coverage detected