結果

問題 No.141 魔法少女コバ
ユーザー McGregorshMcGregorsh
提出日時 2023-05-14 22:58:09
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 287 ms / 5,000 ms
コード長 1,583 bytes
コンパイル時間 723 ms
コンパイル使用メモリ 87,076 KB
実行使用メモリ 92,624 KB
最終ジャッジ日時 2023-08-20 08:07:15
合計ジャッジ時間 30,921 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 263 ms
92,436 KB
testcase_01 AC 264 ms
92,268 KB
testcase_02 AC 267 ms
92,316 KB
testcase_03 AC 272 ms
92,440 KB
testcase_04 AC 267 ms
92,568 KB
testcase_05 AC 265 ms
92,488 KB
testcase_06 AC 273 ms
92,436 KB
testcase_07 AC 269 ms
92,336 KB
testcase_08 AC 287 ms
92,308 KB
testcase_09 AC 272 ms
92,540 KB
testcase_10 AC 270 ms
92,616 KB
testcase_11 AC 268 ms
92,564 KB
testcase_12 AC 269 ms
92,328 KB
testcase_13 AC 274 ms
92,520 KB
testcase_14 AC 246 ms
92,284 KB
testcase_15 AC 243 ms
92,260 KB
testcase_16 AC 250 ms
92,444 KB
testcase_17 AC 261 ms
92,300 KB
testcase_18 AC 272 ms
92,388 KB
testcase_19 AC 265 ms
92,320 KB
testcase_20 AC 272 ms
92,412 KB
testcase_21 AC 248 ms
92,352 KB
testcase_22 AC 247 ms
92,420 KB
testcase_23 AC 251 ms
92,436 KB
testcase_24 AC 264 ms
92,264 KB
testcase_25 AC 261 ms
92,500 KB
testcase_26 AC 264 ms
92,344 KB
testcase_27 AC 275 ms
92,184 KB
testcase_28 AC 272 ms
92,540 KB
testcase_29 AC 270 ms
92,560 KB
testcase_30 AC 266 ms
92,424 KB
testcase_31 AC 267 ms
92,544 KB
testcase_32 AC 265 ms
92,624 KB
testcase_33 AC 263 ms
92,500 KB
testcase_34 AC 265 ms
92,256 KB
testcase_35 AC 250 ms
92,460 KB
testcase_36 AC 245 ms
92,380 KB
testcase_37 AC 246 ms
92,308 KB
testcase_38 AC 248 ms
92,504 KB
testcase_39 AC 245 ms
92,368 KB
testcase_40 AC 246 ms
92,292 KB
testcase_41 AC 243 ms
92,388 KB
testcase_42 AC 246 ms
92,496 KB
testcase_43 AC 247 ms
92,440 KB
testcase_44 AC 248 ms
92,608 KB
testcase_45 AC 247 ms
92,280 KB
testcase_46 AC 243 ms
92,252 KB
testcase_47 AC 245 ms
92,544 KB
testcase_48 AC 247 ms
92,296 KB
testcase_49 AC 267 ms
92,372 KB
testcase_50 AC 268 ms
92,180 KB
testcase_51 AC 273 ms
92,384 KB
testcase_52 AC 269 ms
92,528 KB
testcase_53 AC 273 ms
92,152 KB
testcase_54 AC 272 ms
92,436 KB
testcase_55 AC 266 ms
92,372 KB
testcase_56 AC 261 ms
92,304 KB
testcase_57 AC 265 ms
92,608 KB
testcase_58 AC 265 ms
92,388 KB
testcase_59 AC 276 ms
92,304 KB
testcase_60 AC 269 ms
92,336 KB
testcase_61 AC 279 ms
92,408 KB
testcase_62 AC 268 ms
92,264 KB
testcase_63 AC 265 ms
92,560 KB
testcase_64 AC 267 ms
92,396 KB
testcase_65 AC 264 ms
92,296 KB
testcase_66 AC 249 ms
92,380 KB
testcase_67 AC 252 ms
92,336 KB
testcase_68 AC 244 ms
92,376 KB
testcase_69 AC 244 ms
92,436 KB
testcase_70 AC 247 ms
92,556 KB
testcase_71 AC 245 ms
92,384 KB
testcase_72 AC 248 ms
92,264 KB
testcase_73 AC 243 ms
92,544 KB
testcase_74 AC 246 ms
92,392 KB
testcase_75 AC 240 ms
92,340 KB
testcase_76 AC 242 ms
92,284 KB
testcase_77 AC 244 ms
92,464 KB
testcase_78 AC 249 ms
92,372 KB
testcase_79 AC 247 ms
92,532 KB
testcase_80 AC 268 ms
92,572 KB
testcase_81 AC 267 ms
92,488 KB
testcase_82 AC 269 ms
92,516 KB
testcase-evil-0.txt AC 1,184 ms
92,928 KB
testcase-evil-1.txt AC 247 ms
92,552 KB
testcase-evil-2.txt AC 249 ms
92,532 KB
testcase-evil-3.txt AC 245 ms
92,488 KB
testcase-evil-4.txt AC 242 ms
92,260 KB
testcase-evil-5.txt AC 707 ms
92,668 KB
testcase-evil-6.txt AC 482 ms
92,820 KB
testcase-evil-7.txt AC 246 ms
92,332 KB
testcase-evil-8.txt AC 508 ms
92,876 KB
testcase-evil-9.txt AC 322 ms
92,696 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys, re
from fractions import Fraction
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement, permutations
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext, ROUND_HALF_UP
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
def get_distance(x1, y1, x2, y2):
	  d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
	  return d
def rotate(table):
   	  n_fild = []
   	  for x in zip(*table[::-1]):
   	  	  n_fild.append(x)
   	  return n_fild
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
MOD = 10 ** 9 + 7
MOD2 = 998244353


def main():
   
   M, N = i_map()
   p = gcd(M, N)
   M //= p
   N //= p
   
   ans = 0
   while True:
   	  if M < N:
   	  	  M, N = N, M
   	  else:
   	  	  M -= N
   	  ans += 1
   	  if N == 1:
   	  	  ans += M-1
   	  	  break
   	  
   print(ans)
   
if __name__ == '__main__':
    main()
0