diff --git "a/final_benchmark_uniform/python_seed42_sanitized.jsonl" "b/final_benchmark_uniform/python_seed42_sanitized.jsonl" --- "a/final_benchmark_uniform/python_seed42_sanitized.jsonl" +++ "b/final_benchmark_uniform/python_seed42_sanitized.jsonl" @@ -1,900 +1,900 @@ -{"pair_id": "python_14212", "problem_id": "p00114", "language": "python", "slow_code": "from functools import reduce\n\n\ndef func_1(var_2, var_3):\n var_6, var_7 = var_2, var_3\n while var_7 != 0:\n var_6, var_7 = var_7, var_6 % var_7\n return var_2 / var_6 * var_3\n\n\nwhile 1:\n var_8 = list(map(int, input().split()))\n if any(var_8) == 0:\n break\n var_1 = []\n for var_5 in range(0, 6, 2):\n var_4 = 1\n while pow(var_8[var_5], var_4, var_8[var_5 + 1]) != 1:\n var_4 += 1\n var_1.append(var_4)\n var_8 = reduce(lambda var_2, var_3: func_1(var_2, var_3), var_1)\n print(var_8)\n", "fast_code": "def func_1(var_1, var_5):\n if var_5 == 0:\n return var_1\n return func_1(var_5, var_1 % var_5)\n\n\ndef func_2(var_1, var_5):\n return var_1 * var_5 / func_1(var_1, var_5)\n\n\ndef func_3(var_1, var_10):\n var_6 = 1\n var_14 = var_1 * 1 % var_10\n while var_14 != 1:\n var_14 = var_1 * var_14 % var_10\n var_6 += 1\n return var_6\n\n\nwhile True:\n try:\n var_14, var_15, var_16 = 1, 1, 1\n var_7, var_8, var_9 = 0, 0, 0\n var_2, var_11, var_3, var_12, var_4, var_13 = list(map(int, input().split()))\n if sum([var_2, var_11, var_3, var_12, var_4, var_13]) == 0:\n break\n var_7 = func_3(var_2, var_11)\n var_8 = func_3(var_3, var_12)\n var_9 = func_3(var_4, var_13)\n print((int(func_2(var_7, func_2(var_8, var_9)))))\n except EOFError:\n break\n", "slow_time": 1215695347, "fast_time": 213476013, "speedup": 5.6948, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_1"} -{"pair_id": "python_6266", "problem_id": "p02904", "language": "python", "slow_code": "from collections import defaultdict, deque, Counter\nfrom heapq import heappush, heappop, heapify\nimport math\nimport bisect\nimport random\nfrom itertools import permutations, accumulate, combinations, product\nimport sys\nimport string\nfrom bisect import bisect_left, bisect_right\nfrom math import factorial, ceil, floor\nfrom operator import mul\nfrom functools import reduce\n\nvar_1 = float(\"inf\")\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return sys.stdin.readline().split()\n\n\ndef func_8():\n return sys.stdin.readline().strip()\n\n\ndef func_2(var_14):\n return [func_1() for var_4 in range(var_14)]\n\n\ndef func_4(var_14):\n return [func_3() for var_4 in range(var_14)]\n\n\ndef func_9(var_14):\n return [func_8() for var_4 in range(var_14)]\n\n\ndef func_6(var_14):\n return [func_5() for var_4 in range(var_14)]\n\n\ndef func_10(var_14):\n return [list(func_8()) for var_4 in range(var_14)]\n\n\ndef func_7(var_14):\n return [[int(var_8) for var_8 in list(func_8())] for var_4 in range(var_14)]\n\n\nvar_13 = 1000000007\n\n\nclass Class_1:\n def __init__(self, var_7, var_5, var_15):\n var_14 = len(var_7)\n self.num = 2 ** (var_14 - 1).bit_length()\n self.seg = [var_5] * 2 * self.num\n self.ide_ele = var_5\n self.op = var_15\n for var_4 in range(var_14):\n self.seg[var_4 + self.num - 1] = var_7[var_4]\n\n for var_4 in range(self.num - 2, -1, -1):\n self.seg[var_4] = self.op(self.seg[2 * var_4 + 1], self.seg[2 * var_4 + 2])\n\n def func_12(self, var_9, var_20):\n var_9 += self.num - 1\n self.seg[var_9] = var_20\n while var_9 + 1:\n var_9 = (var_9 - 1) // 2\n self.seg[var_9] = self.op(self.seg[var_9 * 2 + 1], self.seg[var_9 * 2 + 2])\n\n def func_11(self, var_16, var_17):\n if var_17 <= var_16:\n return self.ide_ele\n var_16 += self.num - 1\n var_17 += self.num - 2\n var_18 = self.ide_ele\n while var_17 - var_16 > 1:\n if var_16 & 1 == 0:\n var_18 = self.op(var_18, self.seg[var_16])\n if var_17 & 1 == 1:\n var_18 = self.op(var_18, self.seg[var_17])\n var_16 = var_16 // 2\n var_17 = (var_17 - 2) // 2\n if var_16 == var_17:\n var_18 = self.op(var_18, self.seg[var_16])\n else:\n var_18 = self.op(self.seg[var_16], self.op(var_18, self.seg[var_17]))\n return var_18\n\n\nvar_14, var_9 = func_3()\nvar_2 = func_3()\nvar_12 = Class_1(var_2, var_1, min)\nvar_10 = Class_1(var_2, -var_1, max)\nvar_3 = 1\nfor var_4 in range(var_14 - var_9):\n if (\n var_12.query(var_4, var_4 + var_9) == var_2[var_4]\n and var_10.query(var_4 + 1, var_4 + var_9 + 1) == var_2[var_4 + var_9]\n ):\n continue\n else:\n var_3 += 1\nvar_19 = -var_1\nvar_6 = 0\nvar_11 = 0\nfor var_8 in range(var_14):\n if var_2[var_8] >= var_19:\n var_11 += 1\n else:\n if var_11 >= var_9:\n var_6 += 1\n var_11 = 1\n var_19 = var_2[var_8]\nif var_11 >= var_9:\n var_6 += 1\nif var_6:\n print((var_3 - (var_6 - 1)))\nelse:\n print(var_3)\n", "fast_code": "from collections import deque\nfrom itertools import accumulate\n\n\ndef func_1(var_1, var_3):\n var_15 = []\n var_6 = deque()\n for var_11, var_8 in enumerate(var_1):\n while var_6 and var_1[var_6[-1]] > var_8:\n var_6.pop()\n var_6.append(var_11)\n if var_6[0] == var_11 - var_3:\n var_6.popleft()\n var_15.append(var_6[0])\n return var_15[var_3 - 1 :]\n\n\nvar_4, var_3, *var_5 = list(map(int, open(0).read().split()))\nvar_13 = func_1(var_5, var_3)\nvar_12 = func_1([-var_14 for var_14 in var_5], var_3)\nvar_2 = [\n var_13 != var_11 or var_12 != var_11 + var_3\n for var_11, (var_13, var_12) in enumerate(zip(var_13, var_12[1:]))\n]\nvar_1 = [0] + list(\n accumulate(var_17 < var_18 for var_17, var_18 in zip(var_5, var_5[1:]))\n)\nvar_7 = [\n var_18 - var_17 != var_3 - 1 for var_17, var_18 in zip(var_1, var_1[var_3 - 1 :])\n]\nvar_9 = 1 + sum(var_10 for var_10, var_16 in zip(var_2, var_7[1:]) if var_16)\nif var_7[0] and not all(var_7):\n var_9 += 1\nprint(var_9)\n", "slow_time": 188208834, "fast_time": 80734418, "speedup": 2.3312, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_9"} -{"pair_id": "python_15523", "problem_id": "p02695", "language": "python", "slow_code": "var_23, var_22, var_24 = list(map(int, input().split()))\nvar_17 = []\nfor var_14 in range(var_24):\n var_18, var_19, var_20, var_21 = list(map(int, input().split()))\n var_17.append([var_18, var_19, var_20, var_21])\nvar_2 = []\nfor var_6 in range(1, var_22 + 1):\n for var_7 in range(var_6, var_22 + 1):\n for var_8 in range(var_7, var_22 + 1):\n for var_9 in range(var_8, var_22 + 1):\n for var_10 in range(var_9, var_22 + 1):\n for var_11 in range(var_10, var_22 + 1):\n for var_12 in range(var_11, var_22 + 1):\n for var_13 in range(var_12, var_22 + 1):\n for var_14 in range(var_13, var_22 + 1):\n for var_15 in range(var_14, var_22 + 1):\n var_5 = [\n var_6,\n var_7,\n var_8,\n var_9,\n var_10,\n var_11,\n var_12,\n var_13,\n var_14,\n var_15,\n ]\n var_1 = []\n for var_4 in range(var_23):\n var_1.append(var_5[var_4])\n var_3 = 0\n for var_16 in range(var_24):\n if (\n var_1[var_17[var_16][1] - 1]\n - var_1[var_17[var_16][0] - 1]\n == var_17[var_16][2]\n ):\n var_3 += var_17[var_16][3]\n var_2.append(var_3)\nprint((max(var_2)))\n", "fast_code": "from collections import deque\n\nvar_6, var_5, var_7 = list(map(int, input().split()))\nvar_8 = [0] * var_7\nfor var_16 in range(var_7):\n var_8[var_16] = tuple(map(int, input().split()))\nvar_10 = 0\nvar_4 = deque()\nvar_4.append((1, [1]))\nvar_14 = 1\nwhile var_14 != 0:\n var_3, var_1 = var_4.pop()\n var_14 -= 1\n if var_3 == var_6:\n var_15 = 0\n for var_9, var_11, var_12, var_13 in var_8:\n var_9 -= 1\n var_11 -= 1\n if var_1[var_11] - var_1[var_9] == var_12:\n var_15 += var_13\n var_10 = max(var_10, var_15)\n else:\n for var_2 in range(var_1[-1], var_5 + 1):\n var_4.append((var_3 + 1, var_1 + [var_2]))\n var_14 += 1\nprint(var_10)\n", "slow_time": 6526662255, "fast_time": 901201428, "speedup": 7.2422, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_8"} -{"pair_id": "python_14601", "problem_id": "p03183", "language": "python", "slow_code": "from sys import stdin, stdout, setrecursionlimit\nfrom collections import deque, defaultdict, Counter\nfrom heapq import heappush, heappop\nfrom functools import lru_cache\nimport math\n\nsetrecursionlimit(10**6)\nvar_11 = lambda: stdin.readline()\nvar_14 = lambda: stdin.readline().split()\nvar_13 = lambda: list(map(int, stdin.readline().split()))\nvar_12 = lambda: list(map(float, stdin.readline().split()))\nvar_3, var_5 = float(\"inf\"), float(\"-inf\")\nvar_4 = 10**9 + 7\n\n\ndef func_1():\n var_10 = int(var_11())\n var_1 = []\n for _ in range(var_10):\n var_17, var_15, var_16 = var_13()\n var_1.append((var_17, var_15, var_16))\n var_6 = 0\n var_1.sort(key=lambda var_2: (var_2[0] + var_2[1]))\n var_9 = 2 * 10**4 + 100\n var_7 = [0 for _ in range(var_9 + 1)]\n for var_17, var_15, var_16 in var_1:\n for var_8 in range(var_9, -1, -1):\n if var_8 - var_17 < 0:\n continue\n if var_8 - var_17 > var_15:\n continue\n var_7[var_8] = max(var_7[var_8], var_7[var_8 - var_17] + var_16)\n var_6 = max(var_6, var_7[var_8])\n print(var_6)\n stdout.close()\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "def func_1(var_5):\n var_2 = [0] * (var_5 * 10**4 + 1)\n var_1 = [list(map(int, input().split())) for _ in range(var_5)]\n var_1.sort(key=lambda var_9: var_9[0] + var_9[1])\n for var_8, var_6, var_7 in var_1:\n for var_4 in range(var_8 + var_6, var_8 - 1, -1):\n var_3 = var_2[var_4 - var_8] + var_7\n if var_3 > var_2[var_4]:\n var_2[var_4] = var_3\n print((max(var_2)))\n\n\nvar_5 = int(eval(input()))\nfunc_1(var_5)\n", "slow_time": 5545721805, "fast_time": 1285261290, "speedup": 4.3149, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_2"} -{"pair_id": "python_16315", "problem_id": "p03309", "language": "python", "slow_code": "import sys\n\n\ndef func_10():\n return sys.stdin.readline().strip()\n\n\ndef func_11(var_5, var_6, var_7):\n return [[var_7] * var_6 for var_11 in range(var_5)]\n\n\ndef func_12(var_5, var_6, var_7, var_8):\n return [[[var_8] * var_7 for var_12 in range(var_6)] for var_11 in range(var_5)]\n\n\ndef func_13(var_5, var_6, var_7, var_8, var_9):\n return [\n [[[var_9] * var_8 for var_12 in range(var_7)] for var_12 in range(var_6)]\n for var_11 in range(var_5)\n ]\n\n\ndef func_8(var_20, var_21=1):\n return int(-(-var_20 // var_21))\n\n\ndef func_1():\n return int(eval(func_10()))\n\n\ndef func_3():\n return list(map(int, func_10().split()))\n\n\ndef func_2(var_4=None):\n return list(func_3()) if var_4 is None else [func_1() for var_11 in range(var_4)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_2 = 10**18\nvar_3 = 10**9 + 7\nvar_4 = func_1()\nvar_1 = func_2()\n\n\ndef func_9(var_14):\n var_19 = 0\n for var_11, var_5 in enumerate(var_1):\n var_19 += abs(var_5 - (var_14 + var_11 + 1))\n return var_19\n\n\nvar_13 = -(10**9)\nvar_10 = 10**9\nwhile var_13 + 2 < var_10:\n var_15 = (var_13 * 2 + var_10) // 3\n var_16 = (var_13 + var_10 * 2) // 3\n var_17 = func_9(var_15)\n var_18 = func_9(var_16)\n\n if var_17 <= var_18:\n var_10 = var_16\n else:\n var_13 = var_15\nprint((min(func_9(var_15), func_9(var_16))))\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nfor var_3 in range(var_4):\n var_1[var_3] -= var_3\nvar_1.sort()\nvar_5 = var_1[var_4 // 2]\nvar_2 = 0\nfor var_3 in range(var_4):\n var_2 += abs(var_1[var_3] - var_5)\nprint(var_2)\n", "slow_time": 198949924, "fast_time": 27933979, "speedup": 7.1221, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_26"} -{"pair_id": "python_6727", "problem_id": "p00775", "language": "python", "slow_code": "while True:\n var_2, var_1 = list(map(int, input().split()))\n if not (var_2 | var_1):\n break\n var_5 = 20\n var_3 = [0] * (var_5 * 2)\n for _ in range(var_1):\n var_11, var_12, var_6 = list(map(int, input().split()))\n for var_7 in range(var_11 + var_5, var_12 + var_5):\n var_3[var_7] = max(var_3[var_7], var_6)\n var_8, var_10 = 0, 20\n for _ in range(100):\n var_9 = (var_8 + var_10) / 2\n var_4 = True\n for var_7 in range(-var_2 + var_5, var_2 + var_5):\n if var_7 < var_5:\n var_13 = pow(\n var_2 * var_2 - (var_7 - var_5 + 1) * (var_7 - var_5 + 1), 0.5\n )\n var_4 &= var_3[var_7] >= var_13 - var_2 + var_9\n else:\n var_13 = pow(var_2 * var_2 - (var_7 - var_5) * (var_7 - var_5), 0.5)\n var_4 &= var_3[var_7] >= var_13 - var_2 + var_9\n if var_4:\n var_8 = var_9\n else:\n var_10 = var_9\n print((\"{:.20f}\".format(var_8)))\n", "fast_code": "from math import sqrt\n\nwhile True:\n var_2, var_1 = list(map(int, input().split()))\n if not (var_2 | var_1):\n break\n var_4 = 20\n var_3 = [0] * (var_4 * 2)\n for _ in range(var_1):\n var_7, var_8, var_5 = list(map(int, input().split()))\n for var_6 in range(var_7 + var_4, var_8 + var_4):\n var_3[var_6] = max(var_3[var_6], var_5)\n print(\n (\n min(\n var_3[var_6]\n - sqrt(\n var_2 * var_2\n - (var_6 - var_4 + (var_6 < var_4))\n * (var_6 - var_4 + (var_6 < var_4))\n )\n + var_2\n for var_6 in range(-var_2 + var_4, var_2 + var_4)\n )\n )\n )\n", "slow_time": 536358030, "fast_time": 67271254, "speedup": 7.9731, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_5"} -{"pair_id": "python_17038", "problem_id": "p03475", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**6)\nvar_9 = sys.stdin.readline\nfrom math import floor, ceil, sqrt, factorial, log\nfrom heapq import heappop, heappush, heappushpop\nfrom collections import Counter, defaultdict, deque\nfrom itertools import (\n accumulate,\n permutations,\n combinations,\n product,\n combinations_with_replacement,\n)\nfrom bisect import bisect_left, bisect_right\nfrom copy import deepcopy\n\nvar_8 = float(\"inf\")\nvar_11 = 10**9 + 7\n\n\ndef func_16(*var_1):\n for var_4 in var_1:\n print(*var_4, sep=\"\\n\")\n\n\ndef func_3(var_12):\n return int(var_12) - 1\n\n\ndef func_12():\n return map(int, var_9().split())\n\n\ndef func_11():\n return map(float, var_9().split())\n\n\ndef func_13():\n return map(func_3, var_9().split())\n\n\ndef func_5():\n return list(func_12())\n\n\ndef func_7():\n return [int(var_15) - 1 for var_15 in var_9().split()]\n\n\ndef func_4():\n return list(func_11())\n\n\ndef func_6(var_12: int):\n return [func_2() for _ in range(var_12)]\n\n\ndef func_9(var_12: int):\n return [func_5() for _ in range(var_12)]\n\n\ndef func_10(var_12: int):\n return [func_7() for _ in range(var_12)]\n\n\ndef func_8():\n return [list(map(int, var_10.split())) for var_10 in var_9()]\n\n\ndef func_2():\n return int(var_9())\n\n\ndef func_1():\n return float(var_9())\n\n\ndef func_14():\n return var_9().replace(\"\\n\", \"\")\n\n\ndef func_15():\n var_3 = func_2()\n var_2 = func_9(var_3 - 1)\n\n def func_17(var_2):\n var_13 = 0\n for var_7, (var_5, var_14, var_6) in enumerate(var_2):\n if var_13 <= var_14:\n var_13 = var_14 + var_5\n continue\n else:\n if var_13 % var_6 != 0:\n var_13 += var_6 - var_13 % var_6\n var_13 += var_5\n print(var_13)\n\n for var_7 in range(var_3):\n func_17(var_2[var_7:])\n\n\nif __name__ == \"__main__\":\n func_15()\n", "fast_code": "import sys\n\nvar_5, *var_2 = list(map(int, sys.stdin.read().split()))\nvar_2 = list(zip(*[iter(var_2)] * 3))\n\n\ndef func_1():\n for var_4 in range(var_5 - 1):\n var_7 = 0\n for var_1, var_6, var_3 in var_2[var_4:]:\n if var_7 <= var_6:\n var_7 = var_6 + var_1\n else:\n var_7 = var_6 + ((var_7 - var_6 + var_3 - 1) // var_3) * var_3 + var_1\n print(var_7)\n print((0))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 159141389, "fast_time": 37355456, "speedup": 4.2602, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_13"} -{"pair_id": "python_1263", "problem_id": "p03294", "language": "python", "slow_code": "import sys\n\n\nimport functools\n\n\ndef func_1(var_1, var_2):\n while var_2 != 0:\n var_1, var_2 = var_2, var_1 % var_2\n return var_1\n\n\ndef func_2(var_1, var_2):\n return var_1 * var_2 // func_1(var_1, var_2)\n\n\ndef func_3():\n var_6, *var_1 = (int(var_7) for var_7 in sys.stdin.read().split())\n var_5 = functools.reduce(func_2, var_1)\n var_3 = sum([(var_5 - 1) % var_1[var_4] for var_4 in range(var_6)])\n print(var_3)\n\n\nif __name__ == \"__main__\":\n\n func_3()\n", "fast_code": "var_1 = eval(input())\nprint((sum(map(int, input().split())) - int(var_1)))\n", "slow_time": 41281928, "fast_time": 11843237, "speedup": 3.4857, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_3"} -{"pair_id": "python_15110", "problem_id": "p02948", "language": "python", "slow_code": "from heapq import *\n\n(var_8, var_7), *var_11 = [list(map(int, var_10.split())) for var_10 in open(0)]\nvar_9 = [0] * 7**6\nvar_12 = [[] for _ in var_9]\nvar_13 = 0\nfor var_1, var_2 in var_11:\n var_12[var_1 - 1] += [var_2]\nfor var_5 in var_12[:var_7]:\n for var_6 in var_5:\n var_4(var_9, -var_6)\n var_13 -= var_3(var_9)\nprint(var_13)\n", "fast_code": "from heapq import *\n\nvar_2, var_1, *var_8 = list(map(int, open(0).read().split()))\nvar_9 = [[] for _ in \"_\" * var_1]\nvar_10 = var_5 = 0\nfor _ in \"_\" * var_2:\n var_1 < var_8[var_5] or var_9[var_8[var_5] - 1].append(var_8[var_5 + 1])\n var_5 += 2\nvar_7 = []\nfor var_5 in var_9:\n for var_6 in var_5:\n var_4(var_7, -var_6)\n var_10 -= len(var_7) and var_3(var_7)\nprint(var_10)\n", "slow_time": 3004564549, "fast_time": 48917213, "speedup": 61.4214, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_29"} -{"pair_id": "python_14313", "problem_id": "p03972", "language": "python", "slow_code": "import itertools\nimport os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\nsys.setrecursionlimit(2147483647)\nvar_3 = float(\"inf\")\nvar_2 = 10**18\nvar_4 = 10**9 + 7\n\n\nclass Class_1:\n def __init__(self, func_2=None, var_15=None):\n \"\"\"\"\"\"\n assert func_2 is not None or var_15 is not None\n if func_2 is not None:\n self._parents = [var_13 for var_13 in range(func_2)]\n self._ranks = [0 for _ in range(func_2)]\n self._sizes = [1 for _ in range(func_2)]\n else:\n self._parents = {var_14: var_14 for var_14 in var_15}\n self._ranks = {var_14: 0 for var_14 in var_15}\n self._sizes = {var_14: 1 for var_14 in var_15}\n\n def func_4(self, var_24, var_25):\n \"\"\"\"\"\"\n var_24 = self.root(var_24)\n var_25 = self.root(var_25)\n if var_24 == var_25:\n return\n\n if self._ranks[var_24] > self._ranks[var_25]:\n\n self._parents[var_25] = var_24\n self._sizes[var_24] += self._sizes[var_25]\n else:\n\n self._parents[var_24] = var_25\n self._sizes[var_25] += self._sizes[var_24]\n if self._ranks[var_24] == self._ranks[var_25]:\n self._ranks[var_25] += 1\n\n def func_1(self, var_24):\n \"\"\"\"\"\"\n if self._parents[var_24] == var_24:\n return var_24\n self._parents[var_24] = self.root(self._parents[var_24])\n return self._parents[var_24]\n\n def func_2(self, var_24):\n \"\"\"\"\"\"\n return self._sizes[self.root(var_24)]\n\n\nvar_7, var_1 = list(map(int, sys.stdin.readline().split()))\nvar_5 = [int(sys.stdin.readline()) for _ in range(var_7)]\nvar_6 = [int(sys.stdin.readline()) for _ in range(var_1)]\n\n\ndef func_3():\n var_9 = []\n var_22 = []\n for var_10, var_23 in itertools.product(\n list(range(var_1 + 1)), list(range(var_7 + 1))\n ):\n if var_23 < var_7:\n var_9.append((var_5[var_23], (var_23, var_10), (var_23 + 1, var_10)))\n if var_10 < var_1:\n var_9.append((var_6[var_10], (var_23, var_10), (var_23, var_10 + 1)))\n for var_10, var_23 in itertools.product(\n list(range(var_1 + 1)), list(range(var_7 + 1))\n ):\n var_22.append((var_23, var_10))\n var_9.sort()\n\n var_19 = Class_1(nodes=var_22)\n var_16 = 0\n for var_17, var_20, var_18 in var_9:\n if var_19.root(var_20) != var_19.root(var_18):\n var_19.unite(var_20, var_18)\n var_16 += var_17\n return var_16\n\n\nvar_12 = var_5.copy()\n\nvar_22 = var_6.copy()\nvar_12.sort(reverse=True)\nvar_22.sort(reverse=True)\nvar_8 = 0\nvar_21 = var_7 + 1\nvar_11 = var_1 + 1\nwhile var_12 or var_22:\n if not var_22 or (var_12 and var_12[-1] < var_22[-1]):\n\n var_8 += var_12.pop() * var_11\n var_21 -= 1\n else:\n\n var_8 += var_22.pop() * var_21\n var_11 -= 1\nprint(var_8)\n", "fast_code": "var_6, var_4 = list(map(int, input().split()))\nvar_1 = [10**18] + [int(eval(input())) for var_5 in range(var_6)]\nvar_3 = [10**18] + [int(eval(input())) for var_5 in range(var_4)]\nvar_1.sort(reverse=True)\nvar_3.sort(reverse=True)\nvar_2 = 0\nwhile len(var_1) > 1 or len(var_3) > 1:\n if var_1[-1] < var_3[-1]:\n var_2 += var_1[-1] * len(var_3)\n var_1.pop()\n else:\n var_2 += var_3[-1] * len(var_1)\n var_3.pop()\nprint(var_2)\n", "slow_time": 217485236, "fast_time": 56542537, "speedup": 3.8464, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_2"} -{"pair_id": "python_14637", "problem_id": "p00267", "language": "python", "slow_code": "def func_1(var_9, var_7):\n var_4 = [0] * (var_9 + 1)\n var_9 = 0\n for var_1 in var_7:\n var_4[var_1] += 1\n if var_1 > var_9:\n var_9 = var_1\n var_6, var_5 = len(var_7), var_9\n var_7 = []\n while var_6:\n if var_4[var_5]:\n var_7 += [var_5] * var_4[var_5]\n var_6 -= var_4[var_5]\n var_5 -= 1\n return var_7\n\n\nwhile True:\n var_8 = int(eval(input()))\n if var_8 == 0:\n break\n var_1 = list(map(int, input().split()))\n var_3 = list(map(int, input().split()))\n var_1 = func_1(100000, var_1)\n var_3 = func_1(100000, var_3)\n var_2, var_5 = var_8, -1\n for var_6 in range(0, var_8, 2):\n var_5 += 1\n if var_1[var_6] > var_3[var_5]:\n var_2 = var_6 + 1\n break\n print((\"NA\" if var_2 == var_8 else var_2))\n", "fast_code": "while True:\n var_6 = int(eval(input()))\n if var_6 == 0:\n break\n var_1 = list(map(int, input().split()))\n var_3 = list(map(int, input().split()))\n var_1.sort(reverse=True)\n var_3.sort(reverse=True)\n var_2, var_4 = var_6, -1\n for var_5 in range(0, var_6, 2):\n var_4 += 1\n if var_1[var_5] > var_3[var_4]:\n var_2 = var_5 + 1\n break\n print((\"NA\" if var_2 == var_6 else var_2))\n", "slow_time": 204540895, "fast_time": 43812234, "speedup": 4.6686, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_0"} -{"pair_id": "python_13388", "problem_id": "p02790", "language": "python", "slow_code": "var_2, var_3 = map(int, input().split())\nif var_2 < var_3:\n for var_1 in range(0, var_3):\n print(var_2, end=\"\")\nelse:\n for var_1 in range(0, var_2):\n print(var_3, end=\"\")\n", "fast_code": "var_1, var_2 = input().split()\nprint((min(var_1 * int(var_2), var_2 * int(var_1))))\n", "slow_time": 20608075, "fast_time": 10102751, "speedup": 2.0398, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_1"} -{"pair_id": "python_8934", "problem_id": "p02641", "language": "python", "slow_code": "import sys\n\nvar_2, var_1 = list(map(int, input().split()))\nvar_6 = list(map(int, input().split()))\nvar_4 = 10000\nvar_5 = 10000\nfor var_3 in range(10000):\n if (5000 - var_3 in var_6) == False:\n if abs(var_2 - (5000 - var_3)) <= var_4:\n var_4 = abs(var_2 - (5000 - var_3))\n var_5 = 5000 - var_3\nprint(var_5)\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_5 = list(map(int, input().split()))\nvar_4 = 100\nfor var_6 in range(102):\n if var_6 not in var_5 and abs(var_2 - var_6) < var_4:\n var_4 = abs(var_2 - var_6)\n var_3 = var_6\nprint(var_3)\n", "slow_time": 1753973423, "fast_time": 31981456, "speedup": 54.8435, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_23"} -{"pair_id": "python_36", "problem_id": "p03805", "language": "python", "slow_code": "import itertools\n\nvar_2, var_1 = list(map(int, input().split()))\nvar_5 = {tuple(sorted(map(int, input().split()))) for var_6 in range(var_1)}\nvar_3 = 0\nfor var_6 in itertools.permutations(list(range(2, var_2 + 1)), var_2 - 1):\n var_7 = [1] + list(var_6)\n var_3 += (\n sum(1 for var_4 in zip(var_7, var_7[1:]) if tuple(sorted(var_4)) in var_5)\n == var_2 - 1\n )\nprint(var_3)\n", "fast_code": "def func_1(var_9, var_7, var_10, var_2):\n var_6 = 0\n var_10.append(var_9)\n if len(var_10) == var_2:\n var_6 = 1\n for var_8 in var_7[var_9]:\n if var_8 in var_10:\n continue\n var_6 += func_1(var_8, var_7, var_10, var_2)\n var_10.pop()\n return var_6\n\n\nvar_2, var_1 = list(map(int, input().split()))\nvar_7 = [[] for _ in range(var_2)]\nfor _ in range(var_1):\n var_3, var_5 = list(map(int, input().split()))\n var_7[var_3 - 1].append(var_5 - 1)\n var_7[var_5 - 1].append(var_3 - 1)\nvar_4 = func_1(0, var_7, [], var_2)\nprint(var_4)\n", "slow_time": 4541785072, "fast_time": 53423132, "speedup": 85.0153, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_29"} -{"pair_id": "python_14341", "problem_id": "p03025", "language": "python", "slow_code": "var_10, var_1, var_4, var_6 = list(map(int, input().split()))\nvar_14 = 10**9 + 7\n\n\nvar_7 = [1, 1]\nvar_8 = [1, 1]\nfor var_13 in range(2, 2 * 10**5 + 1):\n var_7.append(var_7[-1] * var_13 % var_14)\n var_8.append(var_8[-1] * pow(var_13, var_14 - 2, var_14) % var_14)\n\n\ndef func_1(var_10, var_9):\n return var_7[var_10] * var_8[var_10 - var_9] * var_8[var_9] % var_14\n\n\nvar_2 = 0\nvar_11 = var_1 + var_4\nvar_3 = (\n pow(var_1, var_10, var_14)\n * pow(pow(var_11, var_14 - 2, var_14), var_10, var_14)\n % var_14\n)\nvar_5 = (\n pow(var_4, var_10, var_14)\n * pow(pow(var_11, var_14 - 2, var_14), var_10, var_14)\n % var_14\n)\nvar_12 = pow(var_11, var_14 - 2, var_14)\nfor var_13 in range(var_10):\n var_2 = (\n var_2\n + (var_3 * pow(var_4, var_13, var_14) + var_5 * pow(var_1, var_13, var_14))\n * func_1(var_10 - 1 + var_13, var_13)\n * pow(var_12, var_13, var_14)\n * (var_10 + var_13)\n ) % var_14\nprint((var_2 * 100 * pow(100 - var_6, var_14 - 2, var_14) % var_14))\n", "fast_code": "var_10, var_1, var_4, var_6 = list(map(int, input().split()))\nvar_14 = 10**9 + 7\n\n\nvar_7 = [1]\nfor var_13 in range(1, 2 * 10**5 + 1):\n var_7.append(var_7[-1] * var_13 % var_14)\nvar_8 = [pow(var_7[-1], var_14 - 2, var_14)]\nfor var_13 in range(2 * 10**5, 0, -1):\n var_8.append(var_8[-1] * var_13 % var_14)\nvar_8 = var_8[::-1]\n\n\ndef func_1(var_10, var_9):\n return var_7[var_10] * var_8[var_10 - var_9] * var_8[var_9] % var_14\n\n\nvar_2 = 0\nvar_11 = var_1 + var_4\nvar_3 = (\n pow(var_1, var_10, var_14)\n * pow(pow(var_11, var_14 - 2, var_14), var_10, var_14)\n % var_14\n)\nvar_5 = (\n pow(var_4, var_10, var_14)\n * pow(pow(var_11, var_14 - 2, var_14), var_10, var_14)\n % var_14\n)\nvar_12 = pow(var_11, var_14 - 2, var_14)\nfor var_13 in range(var_10):\n var_2 = (\n var_2\n + (var_3 * pow(var_4, var_13, var_14) + var_5 * pow(var_1, var_13, var_14))\n * func_1(var_10 - 1 + var_13, var_13)\n * pow(var_12, var_13, var_14)\n * (var_10 + var_13)\n ) % var_14\nprint((var_2 * 100 * pow(100 - var_6, var_14 - 2, var_14) % var_14))\n", "slow_time": 216768447925, "fast_time": 32980310839, "speedup": 6.5727, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_5"} -{"pair_id": "python_6130", "problem_id": "p03173", "language": "python", "slow_code": "from numpy import *\n\nvar_10, var_1 = open(0)\nvar_10 = int(var_10)\nvar_1 = var_4(var_6([0] + var_1.split()))\nvar_5 = var_13((var_10, var_10 + 1), \"i8\")\nfor var_7 in range(1, var_10):\n var_8 = var_3(var_10 - var_7)\n var_12 = var_3(var_7 + 1, var_10 + 1)\n var_9 = (var_3(1, var_7 + 1) + var_8[:, var_11]).T\n var_5[var_8, var_12] = (\n var_2(var_5[var_8, var_9] + var_5[var_9, var_12], 0)\n + var_1[var_12]\n - var_1[var_8]\n )\nprint((var_5[0, var_10]))\n", "fast_code": "import sys\n\nvar_8 = sys.stdin.readline\nsys.setrecursionlimit(10**7)\nimport numpy as np\n\n\"\"\"\"\"\"\nvar_4 = int(eval(var_8()))\nvar_1 = np.array(var_8().split(), np.int64)\n\nvar_2 = np.zeros((var_4, var_4 + 1), dtype=np.int64)\nfor var_3 in range(var_4):\n var_2[var_3, var_3 + 1 :] = var_1[var_3:].cumsum()\nvar_7 = np.zeros((var_4, var_4 + 1), dtype=np.int64)\nfor var_9 in range(2, var_4 + 1):\n for var_3 in range(var_4 - var_9 + 1):\n var_5 = var_3 + var_9\n var_7[var_3, var_5] = (\n var_7[var_3, var_3 + 1 : var_5] + var_7[var_3 + 1 : var_5, var_5]\n ).min() + var_2[var_3, var_5]\nvar_6 = var_7[0, var_4]\nprint(var_6)\n", "slow_time": 9597255804, "fast_time": 66888095, "speedup": 143.4823, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_6"} -{"pair_id": "python_14316", "problem_id": "p03972", "language": "python", "slow_code": "import itertools\nimport os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\nsys.setrecursionlimit(2147483647)\nvar_3 = float(\"inf\")\nvar_2 = 10**18\nvar_4 = 10**9 + 7\n\n\nclass Class_1:\n def __init__(self, func_2=None, var_15=None):\n \"\"\"\"\"\"\n assert func_2 is not None or var_15 is not None\n if func_2 is not None:\n self._parents = [var_13 for var_13 in range(func_2)]\n self._ranks = [0 for _ in range(func_2)]\n self._sizes = [1 for _ in range(func_2)]\n else:\n self._parents = {var_14: var_14 for var_14 in var_15}\n self._ranks = {var_14: 0 for var_14 in var_15}\n self._sizes = {var_14: 1 for var_14 in var_15}\n\n def func_4(self, var_24, var_25):\n \"\"\"\"\"\"\n var_24 = self.root(var_24)\n var_25 = self.root(var_25)\n if var_24 == var_25:\n return\n\n if self._ranks[var_24] > self._ranks[var_25]:\n\n self._parents[var_25] = var_24\n self._sizes[var_24] += self._sizes[var_25]\n else:\n\n self._parents[var_24] = var_25\n self._sizes[var_25] += self._sizes[var_24]\n if self._ranks[var_24] == self._ranks[var_25]:\n self._ranks[var_25] += 1\n\n def func_1(self, var_24):\n \"\"\"\"\"\"\n if self._parents[var_24] == var_24:\n return var_24\n self._parents[var_24] = self.root(self._parents[var_24])\n return self._parents[var_24]\n\n def func_2(self, var_24):\n \"\"\"\"\"\"\n return self._sizes[self.root(var_24)]\n\n\nvar_7, var_1 = list(map(int, sys.stdin.readline().split()))\nvar_5 = [int(sys.stdin.readline()) for _ in range(var_7)]\nvar_6 = [int(sys.stdin.readline()) for _ in range(var_1)]\n\n\ndef func_3():\n var_9 = []\n var_22 = []\n for var_10, var_23 in itertools.product(\n list(range(var_1 + 1)), list(range(var_7 + 1))\n ):\n if var_23 < var_7:\n var_9.append((var_5[var_23], (var_23, var_10), (var_23 + 1, var_10)))\n if var_10 < var_1:\n var_9.append((var_6[var_10], (var_23, var_10), (var_23, var_10 + 1)))\n for var_10, var_23 in itertools.product(\n list(range(var_1 + 1)), list(range(var_7 + 1))\n ):\n var_22.append((var_23, var_10))\n var_9.sort()\n\n var_19 = Class_1(nodes=var_22)\n var_16 = 0\n for var_17, var_20, var_18 in var_9:\n if var_19.root(var_20) != var_19.root(var_18):\n var_19.unite(var_20, var_18)\n var_16 += var_17\n return var_16\n\n\nvar_12 = var_5.copy()\n\nvar_22 = var_6.copy()\nvar_12.sort(reverse=True)\nvar_22.sort(reverse=True)\nvar_8 = 0\nvar_21 = var_7 + 1\nvar_11 = var_1 + 1\nwhile var_12 or var_22:\n if not var_22 or (var_12 and var_12[-1] < var_22[-1]):\n\n var_8 += var_12.pop() * var_11\n var_21 -= 1\n else:\n\n var_8 += var_22.pop() * var_21\n var_11 -= 1\nprint(var_8)\n", "fast_code": "import os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\nsys.setrecursionlimit(2147483647)\nvar_3 = float(\"inf\")\nvar_2 = 10**18\nvar_4 = 10**9 + 7\n\nvar_7, var_1 = list(map(int, sys.stdin.readline().split()))\nvar_5 = [int(sys.stdin.readline()) for _ in range(var_7)]\nvar_6 = [int(sys.stdin.readline()) for _ in range(var_1)]\nvar_12 = []\nfor var_13 in var_5:\n var_12.append((var_13, \"P\"))\nfor var_15 in var_6:\n var_12.append((var_15, \"Q\"))\nvar_12.sort()\nvar_9 = 0\nvar_8 = var_7 + 1\nvar_10 = var_1 + 1\nfor var_11, var_14 in var_12:\n if var_14 == \"P\":\n var_9 += var_11 * var_10\n var_8 -= 1\n else:\n var_9 += var_11 * var_8\n var_10 -= 1\nprint(var_9)\n", "slow_time": 217485236, "fast_time": 62064583, "speedup": 3.5042, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_12"} -{"pair_id": "python_10632", "problem_id": "p04006", "language": "python", "slow_code": "import sys, queue, math, copy, itertools, bisect, collections, heapq\n\n\ndef func_1():\n var_1 = float(\"inf\")\n var_2 = lambda: [int(var_14) for var_14 in sys.stdin.readline().split()]\n var_3, var_14 = var_2()\n var_5 = var_2()\n var_4 = 2 ** (var_3.bit_length())\n var_12 = [var_1] * (2 * var_4)\n\n def func_3(var_7, var_14):\n var_7 += var_4 - 1\n var_12[var_7] = var_14\n while var_7 > 0:\n var_7 = (var_7 - 1) // 2\n var_12[var_7] = min(var_12[var_7 * 2 + 1], var_12[var_7 * 2 + 2])\n\n def func_2(var_9, var_10):\n var_9 += var_4\n var_10 += var_4\n var_11 = var_1\n while var_9 < var_10:\n if var_9 % 2:\n var_11 = min(var_11, var_12[var_9 - 1])\n var_9 += 1\n if var_10 % 2:\n var_10 -= 1\n var_11 = min(var_11, var_12[var_10 - 1])\n var_9 >>= 1\n var_10 >>= 1\n return var_11\n\n for var_7, var_8 in enumerate(var_5):\n func_3(var_7, var_8)\n var_6 = var_1\n for var_7 in range(var_3):\n var_13 = var_7 * var_14\n for var_8 in range(var_3):\n var_9 = var_8 - var_7\n if var_9 < 0:\n var_9 += var_3\n var_13 += min(func_2(0, var_8 + 1), func_2(var_9, var_3))\n else:\n var_13 += func_2(var_9, var_8 + 1)\n var_6 = min(var_6, var_13)\n print(var_6)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_4, var_8 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_1 += var_1\nvar_3 = 10**18\nvar_5 = var_3\nvar_2 = [var_3] * var_4\nfor var_6 in range(var_4):\n for var_7 in range(var_4):\n var_2[var_7] = min(var_2[var_7], var_1[var_4 + var_7 - var_6])\n var_5 = min(var_5, var_6 * var_8 + sum(var_2))\nprint(var_5)\n", "slow_time": 102366711, "fast_time": 33180849, "speedup": 3.0851, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_24"} -{"pair_id": "python_17556", "problem_id": "p03456", "language": "python", "slow_code": "var_2 = int(input().replace(\" \", \"\"))\nprint((\"Yes\" if var_2 in [var_1 * var_1 for var_1 in range(1000)] else \"No\"))\n", "fast_code": "print((\"No\" if int(input().replace(\" \", \"\")) ** 0.5 % 1 else \"Yes\"))\n", "slow_time": 39909209, "fast_time": 8767277, "speedup": 4.5521, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_17"} -{"pair_id": "python_6209", "problem_id": "p00040", "language": "python", "slow_code": "import sys\nimport os\nimport math\n\nvar_1 = int(eval(input()))\nvar_4 = \"abcdefghijklmnopqrstuvwxyz\"\n\n\ndef func_1(var_14, var_3, var_6):\n var_15 = []\n for var_7 in var_14:\n if var_7 == \" \":\n var_15.append(var_7)\n else:\n var_12 = ord(var_7) - 97\n var_17 = (var_3 * var_12 + var_6) % 26\n var_18 = var_4[var_17]\n var_15.append(var_18)\n return \"\".join(var_15)\n\n\nfor var_13 in range(var_1):\n var_14 = input().strip()\n for var_2 in range(0, 26):\n for var_5 in range(0, 26):\n var_11 = func_1(\"this\", var_2, var_5)\n var_10 = func_1(\"that\", var_2, var_5)\n if var_11 in var_14 or var_10 in var_14:\n var_9 = func_1(var_4, var_2, var_5)\n var_16 = str.maketrans(var_9, var_4)\n var_8 = var_14.translate(var_16)\n print(var_8)\n", "fast_code": "var_1 = \"abcdefghijklmnopqrstuvwxyz\"\n\n\ndef func_1(var_8, var_3, var_4):\n var_10 = \"\"\n for var_5 in var_8:\n var_10 += (\n var_1[(var_1.index(var_5) * var_3 + var_4) % 26]\n if \"a\" <= var_5 <= \"z\"\n else var_5\n )\n return var_10\n\n\ndef func_3(var_8, var_3):\n var_3 = var_3 % 26\n var_2 = var_1[var_3:] + var_1[:var_3]\n var_10 = \"\"\n for var_5 in var_8:\n var_10 += var_2[var_1.index(var_5)] if \"a\" <= var_5 <= \"z\" else var_5\n return var_10\n\n\ndef func_2(var_10):\n var_6 = \"t\"\n for var_7 in range(26):\n var_3 = 0\n var_12 = func_1(var_10, var_7, 0)\n var_5 = var_1.index(var_12[0])\n if var_5 != 19:\n var_3 = (19 - var_5) % 26\n var_12 = func_3(var_12, var_3)\n if var_12 in [\"this\", \"that\"]:\n return var_7, var_3\n return -1, -1\n\n\nvar_9 = eval(input())\nwhile var_9:\n var_9 -= 1\n var_10 = input()\n for var_11 in var_10.split():\n if len(var_11) == 4:\n var_3, var_4 = func_2(var_11)\n if var_3 != -1:\n break\n print(func_1(var_10, var_3, var_4))\n", "slow_time": 559587423, "fast_time": 96575987, "speedup": 5.7943, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_1"} -{"pair_id": "python_3544", "problem_id": "p03261", "language": "python", "slow_code": "import sys\n\nvar_16 = sys.stdin\nvar_6 = 1 << 60\nvar_7 = 1000000007\nvar_12 = lambda: int(var_14())\nvar_13 = lambda var_17: [var_12() for _ in range(var_17)]\nvar_8 = lambda: list(map(int, var_16.readline().split()))\nvar_9 = lambda var_17: [var_8() for _ in range(var_17)]\nvar_14 = lambda: var_16.readline().rstrip()\nvar_15 = lambda var_17: [var_14() for _ in range(var_17)]\nvar_11 = lambda var_17: [list(var_14()) for _ in range(var_17)]\nvar_10 = lambda: var_16.readline().split()\nfrom collections import defaultdict\n\nvar_1 = var_12()\nvar_2 = var_15(var_1)\nvar_3 = defaultdict(int)\nvar_4 = True\nfor var_5 in range(var_1):\n if var_5 and var_2[var_5 - 1][-1] != var_2[var_5][0]:\n var_4 = False\n if var_3[var_2[var_5]] >= 1:\n var_4 = False\n var_3[var_2[var_5]] += 1\nprint((\"Yes\" if var_4 else \"No\"))\n", "fast_code": "var_3 = open(0).readlines()[1:]\nprint(\n (\n \"YNeos\"[\n any(\n var_1[-2] != var_2[0] * var_3.count(var_1)\n for var_1, var_2 in zip(var_3, var_3[1:])\n ) :: 2\n ]\n )\n)\n", "slow_time": 84898550, "fast_time": 30391216, "speedup": 2.7935, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_6"} -{"pair_id": "python_14237", "problem_id": "p03558", "language": "python", "slow_code": "import sys\n\nvar_1 = 1 << 60\nvar_2 = 10**9 + 7\nsys.setrecursionlimit(2147483647)\nvar_4 = lambda: sys.stdin.readline().rstrip()\n\n\ndef func_1():\n var_5 = int(eval(var_4()))\n var_3 = [var_1] * var_5\n var_3[1] = 1\n var_6 = [1]\n for var_8 in var_6:\n var_7 = [var_8]\n for var_8 in var_7:\n if var_3[10 * var_8 % var_5] > var_3[var_8]:\n var_3[10 * var_8 % var_5] = var_3[var_8]\n var_7.append(10 * var_8 % var_5)\n if var_3[(var_8 + 1) % var_5] > var_3[var_8] + 1:\n var_3[(var_8 + 1) % var_5] = var_3[var_8] + 1\n var_6.append((var_8 + 1) % var_5)\n print((var_3[0]))\n\n\nfunc_1()\n", "fast_code": "def func_2(var_1):\n var_2 = [False] * var_1\n\n def func_1(var_4):\n while not var_2[var_4]:\n var_2[var_4] = True\n yield var_4\n var_4 = (var_4 * 10) % var_1\n\n var_3 = 0\n var_5 = [0]\n while 1:\n var_3 += 1\n var_6 = []\n for var_4 in var_5:\n for var_7 in func_1((var_4 + 1) % var_1):\n if var_7 == 0:\n return var_3\n var_6.append(var_7)\n var_5 = var_6\n\n\nvar_1 = int(eval(input()))\nprint((func_2(var_1)))\n", "slow_time": 1629125432, "fast_time": 341671713, "speedup": 4.7681, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_1"} -{"pair_id": "python_7793", "problem_id": "p03108", "language": "python", "slow_code": "class Class_1:\n def __init__(self, var_9):\n self.n = var_9\n self.parents = [-1] * var_9\n\n def func_4(self, var_13):\n if self.parents[var_13] < 0:\n return var_13\n else:\n self.parents[var_13] = self.find(self.parents[var_13])\n return self.parents[var_13]\n\n def func_10(self, var_13, var_14):\n var_13 = self.find(var_13)\n var_14 = self.find(var_14)\n if var_13 == var_14:\n return\n if self.parents[var_13] > self.parents[var_14]:\n var_13, var_14 = var_14, var_13\n self.parents[var_13] += self.parents[var_14]\n self.parents[var_14] = var_13\n\n def func_9(self, var_13):\n return -self.parents[self.find(var_13)]\n\n def func_8(self, var_13, var_14):\n return self.find(var_13) == self.find(var_14)\n\n def func_6(self, var_13):\n var_11 = self.find(var_13)\n return [var_6 for var_6 in range(self.n) if self.find(var_6) == var_11]\n\n def func_7(self):\n return [var_6 for var_6, var_13 in enumerate(self.parents) if var_13 < 0]\n\n def func_5(self):\n return len(self.roots())\n\n def func_1(self):\n return {var_10: self.members(var_10) for var_10 in self.roots()}\n\n def __str__(self):\n return \"\\n\".join(\n \"{}: {}\".format(var_10, self.members(var_10)) for var_10 in self.roots()\n )\n\n\ndef func_2(var_9, var_10):\n if var_10 < 0 or var_10 > var_9:\n return 0\n var_10 = min(var_10, var_9 - var_10)\n return var_4[var_9] * var_5[var_10] * var_5[var_9 - var_10] % var_8\n\n\ndef func_3(var_9):\n var_13 = 1\n var_14 = 1\n for var_6 in range(2):\n var_13 *= var_9 - var_6\n var_14 *= var_6 + 1\n return var_13 // var_14\n\n\nvar_9, var_7 = list(map(int, input().split()))\nvar_1 = [list(map(int, input().split())) for var_6 in range(var_7)]\nvar_3 = [[] for var_6 in range(var_9)]\nvar_12 = Class_1(var_9)\nvar_2 = []\nvar_13 = func_3(var_9)\nfor var_6 in range(var_7):\n var_2.append(var_13)\n if var_12.same(var_1[var_7 - var_6 - 1][0] - 1, var_1[var_7 - var_6 - 1][1] - 1):\n var_12.union(var_1[var_7 - var_6 - 1][0] - 1, var_1[var_7 - var_6 - 1][1] - 1)\n else:\n var_13 -= var_12.size(var_1[var_7 - var_6 - 1][0] - 1) * var_12.size(\n var_1[var_7 - var_6 - 1][1] - 1\n )\n var_12.union(var_1[var_7 - var_6 - 1][0] - 1, var_1[var_7 - var_6 - 1][1] - 1)\nfor var_6 in range(var_7):\n print((var_2[-1 - var_6]))\n", "fast_code": "var_5 = lambda var_8: var_8 if var_7[var_8] < 0 else var_5(var_7[var_8])\nvar_4, var_3, *var_2 = map(int, open(0).read().split())\nvar_7 = [-1] * -~var_4\nvar_6 = var_4 * ~-var_4 // 2\nvar_1 = [var_6]\nfor var_8, var_9 in zip(var_2[-2:1:-2], var_2[:1:-2]):\n var_8, var_9 = sorted((var_5(var_8), var_5(var_9)))\n if var_8 != var_9:\n var_6 -= var_7[var_8] * var_7[var_9]\n var_7[var_8] += var_7[var_9]\n var_7[var_9] = var_8\n var_1 += [var_6]\nprint(*var_1[::-1], sep=\"\\n\")\n", "slow_time": 157667192, "fast_time": 44240664, "speedup": 3.5639, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_13"} -{"pair_id": "python_18481", "problem_id": "p03409", "language": "python", "slow_code": "var_9 = 201\n\n\ndef func_1(var_2):\n global vis\n global EE\n var_14[var_2] = 1\n if var_2 == var_9:\n return 1\n for var_4 in range(var_9 + 1):\n if var_14[var_4] == 0 and var_1[var_2][var_4] > 0 and func_1(var_4) > 0:\n var_1[var_2][var_4] -= 1\n var_1[var_4][var_2] += 1\n return 1\n return 0\n\n\nvar_6 = int(eval(input()))\nvar_12 = []\nvar_13 = []\nfor var_4 in range(var_6):\n var_12.append([int(var_4) for var_4 in input().split()])\nfor var_4 in range(var_6):\n var_13.append([int(var_4) for var_4 in input().split()])\nvar_12.sort(key=lambda var_15: (var_15[0], var_15[1]))\nvar_13.sort(key=lambda var_15: (var_15[0], var_15[1]))\nvar_10 = []\nfor var_4 in range(len(var_12)):\n var_11 = []\n for var_5 in range(var_6):\n if var_12[var_5][0] < var_13[var_4][0] and var_12[var_5][1] < var_13[var_4][1]:\n var_11.append(var_5)\n var_10.append(var_11)\nvar_10.sort(key=lambda var_15: len(var_15))\n\n\nvar_1 = [[0 for var_15 in range(var_9 + 1)] for var_16 in range(var_9 + 11)]\nvar_14 = [0] * (var_9 + 1)\nfor var_4 in range(len(var_10)):\n var_1[0][var_4 + 1] = 1\n var_1[var_4 + 1][0] = 1\nfor var_4 in range(var_6):\n var_1[var_4 + 101][var_9] = 1\nfor var_4 in range(len(var_10)):\n for var_5 in range(len(var_10[var_4])):\n var_7, var_8 = var_4 + 1, var_10[var_4][var_5] + 101\n\n var_1[var_7][var_8] = 1\n\nvar_3 = 0\nwhile 1:\n for var_4 in range(0, var_9 + 1):\n var_14[var_4] = 0\n if func_1(0) == 0:\n break\n var_3 += 1\nprint(var_3)\n", "fast_code": "var_1 = int(eval(input()))\nvar_6 = []\nfor _ in range(var_1):\n var_7, var_8 = list(map(int, input().split()))\n var_6.append((-var_8, var_7))\nvar_3 = []\nfor _ in range(var_1):\n var_7, var_8 = list(map(int, input().split()))\n var_3.append((var_7, var_8))\nvar_6.sort()\nvar_3.sort()\nvar_2 = 0\nfor var_5, var_7 in var_6:\n for var_4 in range(len(var_3)):\n if -var_5 < var_3[var_4][1] and var_7 < var_3[var_4][0]:\n var_2 += 1\n var_3.pop(var_4)\n break\nprint(var_2)\n", "slow_time": 579236453, "fast_time": 50314029, "speedup": 11.5124, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_25"} -{"pair_id": "python_6108", "problem_id": "p02789", "language": "python", "slow_code": "import math\nimport statistics\nimport numpy as np\nimport queue\n\n\ndef func_1(var_10):\n if var_10 == 1:\n return 1\n else:\n return var_10 * func_1(var_10 - 1)\n\n\ndef func_2(var_1, var_2):\n if var_1 == 0:\n return var_2\n elif var_2 == 0:\n return var_1\n else:\n return func_2(var_2, var_1 % var_2)\n\n\ndef func_3(var_1, var_2):\n return var_1 * var_2 / func_2(var_1, var_2)\n\n\ndef func_4(var_11):\n if len(var_11) < 2:\n return var_11\n else:\n var_3, var_5 = 0, len(var_11) - 1\n var_9 = (var_3 + var_5) // 2\n var_12 = [var_4 for var_4 in var_11 if var_11[var_9] > var_4]\n var_6 = [var_4 for var_4 in var_11 if var_11[var_9] == var_4]\n var_7 = [var_4 for var_4 in var_11 if var_11[var_9] < var_4]\n return func_4(var_12) + var_6 + func_4(var_7)\n\n\nvar_10, var_8 = list(map(int, input().split()))\nif var_10 == var_8:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "from sys import stdin\n\n\ndef func_1():\n var_2, var_1 = list(map(int, stdin.readline().split()))\n if var_2 == var_1:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nfunc_1()\n", "slow_time": 76445893, "fast_time": 17151007, "speedup": 4.4572, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_18"} -{"pair_id": "python_13903", "problem_id": "p03343", "language": "python", "slow_code": "import sys\n\n\ndef func_9():\n return sys.stdin.readline().strip()\n\n\ndef func_10(var_9, var_11, var_12):\n return [[var_12] * var_11 for var_15 in range(var_9)]\n\n\ndef func_11(var_9, var_11, var_12, var_13):\n return [[[var_13] * var_12 for var_16 in range(var_11)] for var_15 in range(var_9)]\n\n\ndef func_12(var_9, var_11, var_12, var_13, var_14):\n return [\n [[[var_14] * var_13 for var_16 in range(var_12)] for var_16 in range(var_11)]\n for var_15 in range(var_9)\n ]\n\n\ndef func_8(var_20, var_21=1):\n return int(-(-var_20 // var_21))\n\n\ndef func_1():\n return int(eval(func_9()))\n\n\ndef func_3():\n return list(map(int, func_9().split()))\n\n\ndef func_2(var_7=None):\n return list(func_3()) if var_7 is None else [func_1() for var_15 in range(var_7)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_4 = 10**18\nvar_6 = 10**9 + 7\nvar_7, var_5, var_8 = func_3()\nvar_1 = func_2()\nvar_10 = var_4\n\nfor var_20 in var_1:\n\n var_2 = []\n var_19 = []\n for var_15 in range(var_7):\n if var_1[var_15] >= var_20:\n var_19.append(var_1[var_15])\n else:\n var_2.append(var_19)\n var_19 = []\n var_2.append(var_19)\n\n var_3 = []\n for var_17 in var_2:\n var_18 = len(var_17)\n if var_18 - var_5 + 1 >= 1:\n var_17.sort()\n var_3 += var_17[: var_18 - var_5 + 1]\n\n var_3.sort()\n if len(var_3) < var_8:\n continue\n var_21 = var_3[var_8 - 1]\n var_10 = min(var_10, var_21 - var_20)\nprint(var_10)\n", "fast_code": "var_4, var_3, var_5 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_2 = set()\nfor var_9 in range(var_4):\n var_2.add(var_1[var_9])\nvar_2 = list(var_2)\nvar_8 = float(\"inf\")\nfor var_7 in var_2:\n var_6 = []\n var_11 = []\n for var_10 in range(var_4):\n if var_1[var_10] >= var_7:\n var_11.append(var_1[var_10])\n else:\n if len(var_11) >= var_3:\n var_11 = sorted(var_11)\n var_6 += var_11[: len(var_11) - var_3 + 1]\n var_11 = []\n if len(var_11) >= var_3:\n var_11 = sorted(var_11)\n var_6 += var_11[: len(var_11) - var_3 + 1]\n if len(var_6) >= var_5:\n var_6 = sorted(var_6)\n var_6 = var_6[:var_5]\n var_8 = min(var_8, var_6[-1] - var_6[0])\nprint(var_8)\n", "slow_time": 160984385, "fast_time": 75160726, "speedup": 2.1419, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_22"} -{"pair_id": "python_7377", "problem_id": "p03044", "language": "python", "slow_code": "import sys\n\nvar_18 = sys.stdin.readline\n\n\ndef func_5():\n return int(eval(var_18()))\n\n\ndef func_9():\n return list(map(int, var_18().rstrip().split()))\n\n\ndef func_8():\n return list(map(int, var_18().rstrip().split()))\n\n\ndef func_7():\n return list(var_18().rstrip())\n\n\n \n \nfrom queue import Queue\n\n\ndef func_4(var_13, var_30, var_29, var_33, var_8):\n var_16 = len(var_13)\n var_32 = len(var_13[0])\n var_10 = [[-1 for _j in range(var_32)] for _i in range(var_16)]\n var_26 = Queue()\n var_10[var_30][var_29] = 0\n var_26.put((var_30, var_29))\n var_12 = [1, -1, 0, 0, 1, 1, -1, -1]\n var_11 = [0, 0, 1, -1, 1, -1, 1, -1]\n\n def func_6(var_34, var_35):\n return 0 <= var_35 and var_35 < var_16 and 0 <= var_34 and var_34 < var_32\n\n while not var_26.empty():\n var_35, var_34 = var_26.get()\n for var_21 in range(var_8):\n var_25, var_24 = var_35 + var_12[var_21], var_34 + var_11[var_21]\n if not func_6(var_24, var_25) or var_13[var_25][var_24] == var_33:\n continue\n elif var_10[var_25][var_24] != -1:\n continue\n var_10[var_25][var_24] = var_10[var_35][var_34] + 1\n var_26.put((var_25, var_24))\n return var_10\n\n\n \ndef func_1():\n var_16, var_32 = func_9()\n var_28 = [[\"\" for _j in range(var_32)] for _i in range(var_16)]\n for var_17 in range(var_16):\n var_28[var_17] = func_7()\n var_10 = func_4(var_28, 0, 0, \"#\", 4)\n if var_10[var_16 - 1][var_32 - 1] < 0:\n print((-1))\n else:\n var_7 = 0\n for var_17 in range(var_16):\n for var_20 in range(var_32):\n var_7 += var_28[var_17][var_20] == \".\"\n print((var_7 - (var_10[var_16 - 1][var_32 - 1] + 1))) \n\n\n \n \n \n \ndef func_3():\n var_4, var_1 = func_9()\n var_30, var_29 = func_9()\n var_15, var_14 = func_9()\n var_28 = [[\"\" for _j in range(var_1)] for _i in range(var_4)]\n for var_17 in range(var_4):\n var_28[var_17] = func_7()\n var_10 = func_4(var_28, var_30 - 1, var_29 - 1, \"#\", 4) \n print((var_10[var_15 - 1][var_14 - 1])) \n\n\n \ndef func_2():\n var_3 = func_5()\n var_2 = [[] for var_17 in range(var_3)]\n for var_17 in range(var_3 - 1):\n var_5, var_6, var_32 = func_9()\n var_5 -= 1\n var_6 -= 1\n var_2[var_5].append((var_6, var_32))\n var_2[var_6].append((var_5, var_32))\n var_19 = True\n var_9 = [-1 for _ in range(var_3)]\n var_27 = Queue()\n for var_31 in range(var_3):\n if var_9[var_31] != -1:\n \n continue\n var_9[var_31] = 0\n var_27.put(var_31)\n while not var_27.empty():\n var_31 = var_27.get()\n for var_22, var_23 in var_2[var_31]:\n if var_9[var_22] == -1:\n var_9[var_22] = var_9[var_31] + var_23\n var_27.put(var_22)\n for var_17 in var_9:\n if var_17 % 2 == 0:\n print((0))\n else:\n print((1))\n\n\nif __name__ == \"__main__\":\n \n \n func_2()\n", "fast_code": "from sys import stdin\nfrom collections import deque\n\n\ndef func_1():\n \n var_7 = stdin.readline\n var_1 = int(var_7())\n var_3 = [[] for _ in range(var_1)]\n for _ in range(var_1 - 1):\n var_8, var_9, var_10 = list(map(int, var_7().split()))\n var_8 -= 1\n var_9 -= 1\n var_3[var_8].append((var_9, var_10))\n var_3[var_9].append((var_8, var_10))\n \n var_2 = [0] * var_1\n var_4 = [False] * var_1\n var_4[0] = True\n var_6 = deque([0])\n while len(var_6) >= 1:\n var_5 = var_6.popleft()\n for var_11 in var_3[var_5]:\n if var_4[var_11[0]] == False:\n var_4[var_11[0]] = True\n var_2[var_11[0]] = var_2[var_5] + var_11[1]\n var_6.append(var_11[0])\n for var_11 in var_2:\n if var_11 % 2 == 0:\n print((0))\n else:\n print((1))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 204160464, "fast_time": 59263735, "speedup": 3.4449, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_11"} -{"pair_id": "python_16488", "problem_id": "p03796", "language": "python", "slow_code": "var_1 = int(eval(input()))\nfrom math import factorial\n\nvar_3 = int(1e9 + 7)\nvar_2 = factorial(var_1) % var_3\nprint(var_2)\n", "fast_code": "var_1 = 10**9 + 7\nvar_2 = int(eval(input()))\nvar_3 = 1\nfor var_4 in range(2, var_2 + 1):\n var_3 *= var_4\n var_3 %= var_1\nprint(var_3)\n", "slow_time": 27008058263, "fast_time": 3853034321, "speedup": 7.0096, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_23"} -{"pair_id": "python_3650", "problem_id": "p02786", "language": "python", "slow_code": "import sys\nimport math\nimport os\nimport itertools\nimport string\nimport heapq\nimport _collections\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nfrom functools import lru_cache\nimport bisect\nimport re\nimport queue\nimport copy\nimport decimal\n\n\nclass Class_1:\n @staticmethod\n def int():\n return int(sys.stdin.readline().rstrip())\n\n @staticmethod\n def string():\n return sys.stdin.readline().rstrip()\n\n @staticmethod\n def func_4():\n return [int(var_6) for var_6 in Class_1.string().split()]\n\n @staticmethod\n def func_6(var_4):\n return [Class_1.string() for var_3 in range(var_4)]\n\n @staticmethod\n def func_2(var_4):\n return [Class_1.map_int() for var_3 in range(var_4)]\n\n @staticmethod\n def func_1(var_4):\n return [Class_1.int() for var_3 in range(var_4)]\n\n\ndef func_5():\n var_1 = Class_1.int()\n var_2 = 0\n var_5 = 1\n while var_1 > 1:\n var_2 += var_5\n var_5 *= 2\n var_1 //= 2\n var_2 += var_5\n print(var_2)\n\n\ndef func_3():\n\n func_5()\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "import math\n\nvar_2 = int(eval(input()))\nvar_1 = 1\nwhile var_2 > 1:\n var_2 = var_2 // 2\n var_1 += 1\nprint((2**var_1 - 1))\n", "slow_time": 97773077, "fast_time": 16487546, "speedup": 5.9301, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_20"} -{"pair_id": "python_15642", "problem_id": "p02712", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_2 = 0\nfor var_3 in range(1, var_1 + 1):\n if not (var_3 % 3 == 0 or var_3 % 5 == 0):\n var_2 += var_3\nprint(var_2)\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = 0.5 * var_4 * (1 + var_4)\n\nvar_3 = 0.5 * (\n int(var_4 / 3) * (3 + 3 * int(var_4 / 3))\n + int(var_4 / 5) * (5 + 5 * int(var_4 / 5))\n)\nvar_2 = 0.5 * (int(var_4 / 15) * (15 + int(var_4 / 15) * 15))\n\nprint((int(var_1 - var_3 + var_2)))\n", "slow_time": 30432877907, "fast_time": 26924401, "speedup": 1130.3084, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_11"} -{"pair_id": "python_5895", "problem_id": "p03693", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_3():\n return [int(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return [list(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_7():\n return list(sys.stdin.readline())[:-1]\n\n\ndef func_2(var_5):\n return [func_1() for var_3 in range(var_5)]\n\n\ndef func_4(var_5):\n return [func_3() for var_3 in range(var_5)]\n\n\ndef func_8(var_5):\n return [func_7() for var_3 in range(var_5)]\n\n\ndef func_6(var_5):\n return [func_5() for var_3 in range(var_5)]\n\n\nsys.setrecursionlimit(1000000)\nvar_4 = 1000000007\n\n\ndef func_9():\n var_6, var_2, var_1 = func_3()\n var_7 = var_6 * 100 + var_2 * 10 + var_1\n if var_7 % 4 == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n return\n\n\nif __name__ == \"__main__\":\n func_9()\n", "fast_code": "print((\"YNEOS\"[int(input()[::2]) % 4 > 0 :: 2]))\n", "slow_time": 90554878, "fast_time": 8396599, "speedup": 10.7847, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_8"} -{"pair_id": "python_10937", "problem_id": "p03651", "language": "python", "slow_code": "import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import sqrt, hypot, factorial, pi, sin, cos, radians\n\nif sys.version_info.minor >= 5:\n from math import gcd\nelse:\n from fractions import gcd\nfrom heapq import heappop, heappush, heapify, heappushpop\nfrom bisect import bisect_left, bisect_right\nfrom itertools import permutations, combinations, product\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom functools import reduce, partial\nfrom fractions import Fraction\nfrom string import ascii_lowercase, ascii_uppercase, digits\n\n\ndef func_7():\n return sys.stdin.readline().strip()\n\n\ndef func_4(var_5, var_7=1):\n return int(-(-var_5 // var_7))\n\n\ndef func_10(var_10):\n return int((var_10 * 2 + 1) // 2)\n\n\ndef func_5(var_10, var_11, var_3):\n return var_10 * pow(var_11, var_3 - 2, var_3) % var_3\n\n\ndef func_8(var_10, var_11):\n return (var_10 * var_11) // gcd(var_10, var_11)\n\n\ndef func_9(var_9):\n return reduce(func_8, var_9, 1)\n\n\ndef func_6(var_9):\n return reduce(gcd, var_9, var_9[0])\n\n\ndef func_1():\n return int(eval(func_7()))\n\n\ndef func_3():\n return list(map(int, func_7().split()))\n\n\ndef func_2():\n return list(map(int, func_7().split()))\n\n\nsys.setrecursionlimit(10**9)\nvar_1 = float(\"inf\")\nvar_3 = 10**9 + 7\nvar_4, var_2 = func_3()\nvar_6 = func_2()\n\nif max(var_6) < var_2:\n print(\"IMPOSSIBLE\")\n exit()\n\nvar_8 = func_6(var_6)\nif var_2 % var_8 == 0:\n print(\"POSSIBLE\")\nelse:\n print(\"IMPOSSIBLE\")\n", "fast_code": "var_5, var_3 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_1.sort()\n\n\ndef func_1(var_4, var_6):\n return var_6 if var_4 % var_6 == 0 else func_1(var_6, var_4 % var_6)\n\n\nvar_7 = func_1(var_1[-1], var_1[0])\nfor var_2 in var_1:\n var_7 = func_1(var_2, var_7)\nif var_1[-1] >= var_3 and var_3 % var_7 == 0:\n print(\"POSSIBLE\")\nelse:\n print(\"IMPOSSIBLE\")\n", "slow_time": 86526108, "fast_time": 26097008, "speedup": 3.3156, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_27"} -{"pair_id": "python_10616", "problem_id": "p03018", "language": "python", "slow_code": "import sys\n\nvar_9 = sys.stdin\nvar_5 = lambda: int(var_7())\nvar_6 = lambda: list(map(int, var_9.readline().split()))\nvar_7 = lambda: var_9.readline().rstrip()\nvar_2 = list(var_7())\nvar_4 = \"D\"\nvar_3 = 0\nvar_1 = 0\nfor var_8 in var_2:\n if var_4 == \"A\":\n if var_8 == \"A\":\n var_1 += 1\n elif var_8 == \"B\":\n var_4 = var_8\n else:\n var_4 = \"D\"\n var_1 = 0\n elif var_4 == \"B\":\n if var_8 == \"A\":\n var_1 = 1\n var_4 = var_8\n elif var_8 == \"B\":\n var_1 = 0\n var_4 = \"D\"\n elif var_8 == \"C\":\n var_3 += var_1\n var_4 = var_8\n else:\n var_4 = \"D\"\n var_1 = 0\n elif var_4 == \"C\":\n if var_8 == \"A\":\n var_1 += 1\n var_4 = var_8\n elif var_8 == \"B\":\n var_4 = var_8\n else:\n var_4 = \"D\"\n var_1 = 0\n else:\n if var_8 == \"A\":\n var_1 += 1\n var_4 = var_8\n else:\n var_1 = 0\n var_4 = \"D\"\nprint(var_3)\n", "fast_code": "var_4 = input().replace(\"BC\", \"D\")\nvar_3 = 0\nvar_1 = 0\nfor var_2 in var_4:\n if var_2 == \"A\":\n var_3 += 1\n elif var_2 == \"D\":\n var_1 += var_3\n else:\n var_3 = 0\nprint(var_1)\n", "slow_time": 67556438, "fast_time": 17574844, "speedup": 3.8439, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_3"} -{"pair_id": "python_2941", "problem_id": "p03146", "language": "python", "slow_code": "var_5 = int(eval(input()))\nvar_1 = [var_5]\nvar_3 = 0\nwhile True:\n if var_1[var_3] % 2 == 0:\n var_1.append(int(var_1[var_3] / 2))\n var_3 += 1\n else:\n var_1.append(int(3 * var_1[var_3] + 1))\n var_3 += 1\n if [var_4 for var_4 in set(var_1) if var_1.count(var_4) > 1]:\n var_2 = sorted(\n [var_4 for var_4 in set(var_1) if var_1.count(var_4) > 1], key=var_1.index\n )\n break\nvar_1[var_1.index(var_2[0])] = 0\nprint((var_1.index((var_2[0])) + 1))\n", "fast_code": "from collections import defaultdict, deque\n\nvar_3 = int(eval(input()))\nvar_1 = defaultdict(int)\nvar_1[var_3] = 1\nvar_2 = 1\nwhile 1:\n if var_3 % 2 == 0:\n var_3 = var_3 // 2\n else:\n var_3 = 3 * var_3 + 1\n var_2 += 1\n if var_1[var_3] == 1:\n break\n var_1[var_3] = 1\nprint(var_2)\n", "slow_time": 983405746, "fast_time": 34072545, "speedup": 28.8621, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_3"} -{"pair_id": "python_3626", "problem_id": "p02786", "language": "python", "slow_code": "import sys\nimport math\nimport os\nimport itertools\nimport string\nimport heapq\nimport _collections\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nfrom functools import lru_cache\nimport bisect\nimport re\nimport queue\nimport copy\nimport decimal\n\n\nclass Class_1:\n @staticmethod\n def int():\n return int(sys.stdin.readline().rstrip())\n\n @staticmethod\n def string():\n return sys.stdin.readline().rstrip()\n\n @staticmethod\n def func_4():\n return [int(var_6) for var_6 in Class_1.string().split()]\n\n @staticmethod\n def func_6(var_4):\n return [Class_1.string() for var_3 in range(var_4)]\n\n @staticmethod\n def func_2(var_4):\n return [Class_1.map_int() for var_3 in range(var_4)]\n\n @staticmethod\n def func_1(var_4):\n return [Class_1.int() for var_3 in range(var_4)]\n\n\ndef func_5():\n var_1 = Class_1.int()\n var_2 = 0\n var_5 = 1\n while var_1 > 1:\n var_2 += var_5\n var_5 *= 2\n var_1 //= 2\n var_2 += var_5\n print(var_2)\n\n\ndef func_3():\n\n func_5()\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "print(2 ** len(bin(eval(input()))) / 4 - 1)\n", "slow_time": 97773077, "fast_time": 9381200, "speedup": 10.4222, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_29"} -{"pair_id": "python_392", "problem_id": "p03160", "language": "python", "slow_code": "def func_2(var_3, var_4):\n return var_4 if var_3 > var_4 else var_3\n\n\ndef func_1(var_3, var_4):\n return var_4 if var_3 < var_4 else var_3\n\n\ndef func_3(var_2, var_6):\n var_1 = 10**9\n var_5 = [var_1] * (10**5 + 10)\n var_5[0] = 0\n var_5[1] = abs(var_6[1] - var_6[0])\n for var_7 in range(2, var_2):\n var_5[var_7] = func_2(\n var_5[var_7], var_5[var_7 - 1] + abs(var_6[var_7] - var_6[var_7 - 1])\n )\n var_5[var_7] = func_2(\n var_5[var_7], var_5[var_7 - 2] + abs(var_6[var_7] - var_6[var_7 - 2])\n )\n return var_5[var_2 - 1]\n\n\nif __name__ == \"__main__\":\n var_2 = int(eval(input()))\n var_6 = list(map(int, input().split()))\n print((func_3(var_2, var_6)))\n", "fast_code": "var_7 = int(eval(input()))\nvar_5 = list(map(int, input().split()))\nvar_1, var_2 = 0, abs(var_5[1] - var_5[0])\nfor var_6 in range(2, var_7):\n var_3 = var_1 + abs(var_5[var_6] - var_5[var_6 - 2])\n var_4 = var_2 + abs(var_5[var_6] - var_5[var_6 - 1])\n var_1, var_2 = var_2, var_3 if var_3 <= var_4 else var_4\nprint(var_2)\n", "slow_time": 117408668, "fast_time": 32060949, "speedup": 3.662, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_24"} -{"pair_id": "python_2327", "problem_id": "p03486", "language": "python", "slow_code": "import sys\n\n\ndef func_1():\n var_5, var_6 = sys.stdin.read().split()\n var_4, var_3 = len(var_5), len(var_6)\n var_5 = sorted(var_5)\n var_6 = list(reversed(sorted(var_6)))\n if var_4 < var_3:\n for var_2 in range(var_4):\n if var_5[var_2] < var_6[var_2]:\n var_1 = \"Yes\"\n break\n elif var_5[var_2] > var_6[var_2]:\n var_1 = \"No\"\n break\n else:\n var_1 = \"Yes\"\n else:\n for var_2 in range(var_3):\n if var_5[var_2] < var_6[var_2]:\n var_1 = \"Yes\"\n break\n elif var_5[var_2] > var_6[var_2]:\n var_1 = \"No\"\n break\n else:\n var_1 = \"No\"\n print(var_1)\n\n\nif __name__ == \"__main__\":\n\n func_1()\n", "fast_code": "(\n print(\"Yes\")\n if \"\".join(sorted(input())) < \"\".join(sorted(input(), reverse=True))\n else print(\"No\")\n)\n", "slow_time": 48030642, "fast_time": 12205272, "speedup": 3.9352, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_24"} -{"pair_id": "python_14239", "problem_id": "p03558", "language": "python", "slow_code": "from collections import deque\n\nvar_3 = int(eval(input()))\nvar_7 = list(range(var_3))\nvar_6 = deque([1])\nvar_2 = float(\"inf\")\nvar_8 = [0] * var_3\nvar_1 = [var_2] * var_3\nvar_1[1] = 0\nwhile var_6:\n var_7 = var_6.pop()\n if not var_8[var_7]:\n var_4 = 10 * var_7 % var_3\n var_5 = (var_7 + 1) % var_3\n if var_1[var_4] > var_1[var_7]:\n var_1[var_4] = var_1[var_7]\n var_6.append(var_4)\n if var_1[var_5] > 1 + var_1[var_7]:\n var_6.appendleft(var_5)\n var_1[var_5] = var_1[var_7] + 1\n var_8[var_7] = 1\nprint((var_1[0] + 1))\n", "fast_code": "def func_2(var_1):\n var_2 = [False] * var_1\n\n def func_1(var_4):\n while not var_2[var_4]:\n var_2[var_4] = True\n yield var_4\n var_4 = (var_4 * 10) % var_1\n\n var_3 = 0\n var_5 = [0]\n while 1:\n var_3 += 1\n var_6 = []\n for var_4 in var_5:\n for var_7 in func_1((var_4 + 1) % var_1):\n if var_7 == 0:\n return var_3\n var_6.append(var_7)\n var_5 = var_6\n\n\nvar_1 = int(eval(input()))\nprint((func_2(var_1)))\n", "slow_time": 3101760057, "fast_time": 341671713, "speedup": 9.0782, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_1"} -{"pair_id": "python_13969", "problem_id": "p03762", "language": "python", "slow_code": "import sys\n\n\ndef func_9():\n return sys.stdin.readline().strip()\n\n\ndef func_10(var_7, var_9, var_10):\n return [[var_10] * var_9 for var_14 in range(var_7)]\n\n\ndef func_11(var_7, var_9, var_10, var_11):\n return [[[var_11] * var_10 for var_15 in range(var_9)] for var_14 in range(var_7)]\n\n\ndef func_12(var_7, var_9, var_10, var_11, var_12):\n return [\n [[[var_12] * var_11 for var_15 in range(var_10)] for var_15 in range(var_9)]\n for var_14 in range(var_7)\n ]\n\n\ndef func_8(var_19, var_20=1):\n return int(-(-var_19 // var_20))\n\n\ndef func_1():\n return int(eval(func_9()))\n\n\ndef func_3():\n return list(map(int, func_9().split()))\n\n\ndef func_2(var_6=None):\n return list(func_3()) if var_6 is None else [func_1() for var_14 in range(var_6)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_3 = 10**18\nvar_5 = 10**9 + 7\nvar_6, var_4 = func_3()\nvar_1 = func_2()\nvar_2 = func_2()\n\nvar_16 = var_17 = 0\nfor var_14 in range(var_6):\n var_16 += var_1[var_14] * (var_6 - var_14 - 1)\n var_17 += var_1[var_14] * var_14\n var_16 %= var_5\n var_17 %= var_5\nvar_13 = var_17 - var_16\nvar_16 = var_17 = 0\nfor var_14 in range(var_4):\n var_16 += var_2[var_14] * (var_4 - var_14 - 1)\n var_17 += var_2[var_14] * var_14\n var_16 %= var_5\n var_17 %= var_5\nvar_18 = var_17 - var_16\nvar_8 = var_13 * var_18 % var_5\nprint(var_8)\n", "fast_code": "var_5, var_4 = list(map(int, input().split()))\nvar_1 = [int(var_3) for var_3 in input().split()]\nvar_2 = [int(var_3) for var_3 in input().split()]\nvar_6 = 0\nvar_7 = 0\nfor var_3 in range(1, var_5 + 1):\n var_6 += (var_1[var_3 - 1] * (var_3 - 1)) - (var_1[var_3 - 1] * (var_5 - var_3))\nfor var_3 in range(1, var_4 + 1):\n var_7 += (var_2[var_3 - 1] * (var_3 - 1)) - (var_2[var_3 - 1] * (var_4 - var_3))\nprint(((var_6 * var_7) % 1000000007))\n", "slow_time": 134610848, "fast_time": 46246579, "speedup": 2.9107, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_4"} -{"pair_id": "python_15505", "problem_id": "p02695", "language": "python", "slow_code": "var_23, var_22, var_24 = list(map(int, input().split()))\nvar_17 = []\nfor var_14 in range(var_24):\n var_18, var_19, var_20, var_21 = list(map(int, input().split()))\n var_17.append([var_18, var_19, var_20, var_21])\nvar_2 = []\nfor var_6 in range(1, var_22 + 1):\n for var_7 in range(var_6, var_22 + 1):\n for var_8 in range(var_7, var_22 + 1):\n for var_9 in range(var_8, var_22 + 1):\n for var_10 in range(var_9, var_22 + 1):\n for var_11 in range(var_10, var_22 + 1):\n for var_12 in range(var_11, var_22 + 1):\n for var_13 in range(var_12, var_22 + 1):\n for var_14 in range(var_13, var_22 + 1):\n for var_15 in range(var_14, var_22 + 1):\n var_5 = [\n var_6,\n var_7,\n var_8,\n var_9,\n var_10,\n var_11,\n var_12,\n var_13,\n var_14,\n var_15,\n ]\n var_1 = []\n for var_4 in range(var_23):\n var_1.append(var_5[var_4])\n var_3 = 0\n for var_16 in range(var_24):\n if (\n var_1[var_17[var_16][1] - 1]\n - var_1[var_17[var_16][0] - 1]\n == var_17[var_16][2]\n ):\n var_3 += var_17[var_16][3]\n var_2.append(var_3)\nprint((max(var_2)))\n", "fast_code": "import sys\n\n\ndef func_4():\n return sys.stdin.readline().rstrip()\n\n\ndef func_3():\n return int(func_4())\n\n\ndef func_5():\n return list(map(int, func_4().split()))\n\n\ndef func_6():\n return list([var_22 - 1 for var_22 in func_5()])\n\n\ndef func_1(var_8, var_9, var_12=0):\n return [[var_12] * var_9 for _ in range(var_8)]\n\n\ndef func_2(var_8, var_9, var_10, var_12=0):\n return [func_1(var_9, var_10, var_12) for _ in range(var_8)]\n\n\ndef func_16(var_22: int) -> str:\n return format(var_22, \"b\")\n\n\ndef func_18(var_22: int) -> str:\n return format(var_22, \"o\")\n\n\ndef func_17(var_22: int) -> str:\n return format(var_22, \"x\")\n\n\nvar_3 = 10**9 + 7\n\n\ndef func_8(var_22, var_23) -> int:\n return -(-var_22 // var_23)\n\n\ndef func_9(var_22, var_23) -> int:\n return var_22 // var_23\n\n\ndef func_11(var_22, var_23):\n while var_23:\n var_22, var_23 = var_23, var_22 % var_23\n return var_22\n\n\ndef func_13(var_22, var_23):\n return var_22 * var_23 // func_11(var_22, var_23)\n\n\ndef func_10(var_16):\n \"\"\"\"\"\"\n return [\n (var_11, var_16 // var_11)\n for var_11 in range(1, int(var_16**0.5) + 1)\n if var_16 % var_11 == 0\n ]\n\n\ndef func_12(var_2=10**3):\n \"\"\"\"\"\"\n var_13 = [True] * (var_2 + 1)\n var_13[0] = var_13[1] = False\n for var_11 in range(2, int(var_2**0.5) + 1):\n if not var_13[var_11]:\n continue\n for var_14 in range(var_11 * 2, var_2 + 1, var_11):\n var_13[var_14] = False\n return [var_11 for var_11 in range(var_2 + 1) if var_13[var_11]]\n\n\nfrom itertools import accumulate as acc\nfrom itertools import combinations_with_replacement as combi\nfrom collections import deque, Counter\nfrom heapq import heapify, heappop, heappush\nfrom bisect import bisect_left\n\n\ndef func_14():\n var_16, var_15, var_18 = func_5()\n var_19 = [func_5() for _ in range(var_18)]\n\n def func_15(var_1):\n var_20 = 0\n for var_4, var_5, var_6, var_7 in var_19:\n if var_1[var_5 - 1] - var_1[var_4 - 1] == var_6:\n var_20 += var_7\n return var_20\n\n def func_7(var_1):\n if len(var_1) == var_16:\n return func_15(var_1)\n var_20 = 0\n var_17 = var_1[-1] if len(var_1) > 0 else 0\n for var_21 in range(var_17, var_15):\n var_1.append(var_21)\n var_20 = max(var_20, func_7(var_1))\n var_1.pop()\n return var_20\n\n print((func_7([])))\n\n\nif __name__ == \"__main__\":\n func_14()\n", "slow_time": 6526662255, "fast_time": 762334970, "speedup": 8.5614, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_22"} -{"pair_id": "python_7020", "problem_id": "p03013", "language": "python", "slow_code": "import sys\n\nvar_9 = sys.stdin.readline\nvar_3 = 10**9 + 7\nvar_2 = 100\n\n\ndef func_3(var_4, var_1, var_7):\n var_5 = [0] * var_1\n var_7[0] = 1\n var_7[1] = 1\n var_7[2] = 2\n for var_8 in range(3, max(var_4 + 1, var_2)):\n var_7[var_8] = var_7[var_8 - 1] + var_7[var_8 - 2]\n var_6 = 1\n for var_8 in range(var_1):\n var_5[var_8] = int(eval(var_9()))\n if var_8 != 0 and abs(var_5[var_8] - var_5[var_8 - 1]) == 1:\n print((0))\n return\n if var_5[var_8] == 1:\n var_6 *= 1\n elif var_8 == 0:\n var_6 *= var_7[var_5[var_8] - 1]\n var_6 %= var_3\n\n else:\n var_6 *= var_7[var_5[var_8] - var_5[var_8 - 1] - 2]\n var_6 %= var_3\n\n if var_1 == 0:\n var_6 *= var_7[var_4]\n var_6 %= var_3\n\n print(var_6)\n else:\n var_6 *= var_7[var_4 - var_5[var_1 - 1] - 1]\n var_6 %= var_3\n\n print(var_6)\n\n\ndef func_1(var_4, var_1, var_7):\n var_5 = [0] * len(var_7)\n for var_8 in range(var_1):\n var_5[int(eval(var_9())) - 1] = True\n var_7[0] = 0 if var_5[0] is True else 1\n var_7[1] = 0 if var_5[1] is True else var_7[0] + 1\n if var_4 == 1:\n print((var_7[0]))\n return\n elif var_4 == 2:\n print((var_7[1]))\n return\n for var_8 in range(2, var_4):\n if var_5[var_8] is True:\n var_7[var_8] = 0\n else:\n var_7[var_8] = var_7[var_8 - 1] + var_7[var_8 - 2]\n var_7[var_8] %= var_3\n print((var_7[var_4 - 1] % var_3))\n\n\ndef func_2():\n var_4, var_1 = list(map(int, var_9().split()))\n var_7 = [0] * max((var_4 + 1), var_2)\n func_1(var_4, var_1, var_7)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "import sys\n\nvar_3, var_1 = list(map(int, input().split()))\nif var_1 == 0:\n var_4 = set()\nelse:\n\n var_4 = set(map(int, sys.stdin))\nvar_5 = [0] * (var_3 + 1)\nvar_5[0] = 1\nvar_5[1] = 1 if 1 not in var_4 else 0\nvar_2 = 10**9 + 7\nfor var_6 in range(2, var_3 + 1):\n if var_6 in var_4:\n continue\n var_5[var_6] = (var_5[var_6 - 1] + var_5[var_6 - 2]) % var_2\nprint((var_5[var_3]))\n", "slow_time": 116137408, "fast_time": 36147437, "speedup": 3.2129, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_17"} -{"pair_id": "python_2830", "problem_id": "p02264", "language": "python", "slow_code": "class Class_2:\n class Class_1:\n def __init__(self, var_4, var_10, var_2=None):\n self.name = var_4\n self.r_time = var_10\n self.link = var_2\n\n def __init__(self, var_9):\n self.e_time = 0\n self.q = var_9\n self.front = None\n self.rear = None\n\n def func_2(self, var_4, var_10):\n if self.front == self.rear == None:\n self.front = self.rear = Class_2.Process(var_4, var_10)\n else:\n var_5 = Class_2.Process(var_4, var_10)\n self.rear.link = var_5\n self.rear = var_5\n\n def func_1(self):\n if self.front == self.rear == None:\n raise Exception(\"queue underflow\")\n elif self.front.r_time > self.q:\n self.enqueue(self.front.name, self.front.r_time - self.q)\n self.front = self.front.link\n self.e_time += self.q\n else:\n var_7 = self.front.name\n self.e_time += self.front.r_time\n print((var_7, self.e_time))\n self.front = self.front.link\n if self.front == None:\n self.rear = None\n\n\nvar_3, var_9 = list(map(int, input().split()))\nvar_8 = Class_2(var_9)\nfor var_1 in range(var_3):\n var_6 = input().split()\n var_8.enqueue(var_6[0], int(var_6[1]))\nwhile not var_8.front == var_8.rear == None:\n var_8.dequeue()\n", "fast_code": "from collections import deque\n\nvar_3, var_5 = list(map(int, input().split()))\nvar_2 = deque()\nfor _ in range(var_3):\n var_4, var_7 = input().split()\n var_2.append([var_4, int(var_7)])\nvar_1 = 0\nwhile var_2:\n var_6 = var_2.popleft()\n if var_6[1] <= var_5:\n var_1 += var_6[1]\n print((var_6[0], var_1))\n else:\n var_1 += var_5\n var_6[1] -= var_5\n var_2.append(var_6)\n", "slow_time": 104738053, "fast_time": 39094869, "speedup": 2.6791, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_11"} -{"pair_id": "python_10497", "problem_id": "p03786", "language": "python", "slow_code": "import sys\n\nvar_7 = sys.stdin\nsys.setrecursionlimit(10**5)\n\n\ndef func_3():\n return list(map(int, var_7.readline().split()))\n\n\ndef func_4():\n return [int(var_8) - 1 for var_8 in var_7.readline().split()]\n\n\ndef func_2():\n return list(map(float, var_7.readline().split()))\n\n\ndef func_5():\n return var_7.readline().split()\n\n\ndef func_8():\n return var_7.readline().rstrip()\n\n\ndef func_1():\n return list(func_8())\n\n\ndef func_7():\n return int(var_7.readline())\n\n\ndef func_6():\n return float(var_7.readline())\n\n\nfrom itertools import accumulate\n\nvar_6 = func_7()\nvar_1 = list(func_3())\nvar_1.sort()\nvar_2 = list(accumulate(var_1))\nvar_5 = 0\nfor var_4, var_3 in zip(var_1[-1:0:-1], var_2[-2::-1]):\n if 2 * var_3 >= var_4:\n var_5 += 1\n else:\n break\nprint((var_5 + 1))\n", "fast_code": "import numpy as np\n\nvar_3 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_1 = sorted(var_1)\nvar_2 = np.cumsum(var_1)\nvar_4 = 0\nvar_5 = 0\nfor var_6 in range(var_3 - 1):\n if var_2[var_6] * 2 >= var_1[var_6 + 1]:\n var_5 += 1\n else:\n var_5 = 0\nvar_4 = var_5 + 1\nprint(var_4)\n", "slow_time": 65326840, "fast_time": 28456328, "speedup": 2.2957, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_20"} -{"pair_id": "python_10869", "problem_id": "p02570", "language": "python", "slow_code": "def func_2():\n return list(map(int, input().split()))\n\n\ndef func_1():\n return int(input())\n\n\ndef func_10():\n return print(\"Yes\")\n\n\ndef func_6():\n return print(\"No\")\n\n\nclass Class_1:\n \"\"\"\"\"\"\n\n def __init__(self, var_9, var_6=10**9 + 7):\n self.mod = var_6\n self.modinv = self.make_modinv_list(var_9)\n self.fac, self.facinv = self.make_factorial_list(var_9)\n\n def __call__(self, var_8, var_10):\n return (\n self.fac[var_8]\n * self.facinv[var_10]\n % self.mod\n * self.facinv[var_8 - var_10]\n % self.mod\n )\n\n def func_4(self, var_8):\n\n var_3 = [1]\n var_4 = [1]\n for var_5 in range(1, var_8 + 1):\n var_3.append(var_3[var_5 - 1] * var_5 % self.mod)\n var_4.append(var_4[var_5 - 1] * self.modinv[var_5] % self.mod)\n return var_3, var_4\n\n def func_5(self, var_8):\n\n var_7 = [0] * (var_8 + 1)\n var_7[1] = 1\n for var_5 in range(2, var_8 + 1):\n var_7[var_5] = (\n self.mod - self.mod // var_5 * var_7[self.mod % var_5] % self.mod\n )\n return var_7\n\n\nclass Class_2:\n def __init__(self, var_1):\n self.p = list(range(var_1))\n self.rank = [0] * var_1\n self.size = [1] * var_1\n\n def func_7(self, var_15):\n if self.p[var_15] != var_15:\n self.p[var_15] = self.root(self.p[var_15])\n return self.p[var_15]\n\n def func_8(self, var_15, var_16):\n return self.root(var_15) == self.root(var_16)\n\n def func_9(self, var_15, var_16):\n var_13 = self.root(var_15)\n var_14 = self.root(var_16)\n if var_13 == var_14:\n return\n if self.rank[var_13] < self.rank[var_14]:\n self.p[var_13] = var_14\n self.size[var_14] += self.size[var_13]\n self.size[var_13] = 0\n else:\n self.p[var_14] = var_13\n self.size[var_13] += self.size[var_14]\n self.size[var_14] = 0\n if self.rank[var_13] == self.rank[var_14]:\n self.rank[var_13] += 1\n\n def func_3(self, var_15):\n return self.size[self.root(var_15)]\n\n\nvar_2, var_12, var_11 = func_2()\nif var_2 <= var_12 * var_11:\n func_10()\nelse:\n func_6()\n", "fast_code": "var_1, var_3, var_2 = list(map(int, input().split()))\nif var_1 / var_2 > var_3:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "slow_time": 135027021, "fast_time": 10707588, "speedup": 12.6104, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_14"} -{"pair_id": "python_17050", "problem_id": "p03475", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**6)\nvar_9 = sys.stdin.readline\nfrom math import floor, ceil, sqrt, factorial, log\nfrom heapq import heappop, heappush, heappushpop\nfrom collections import Counter, defaultdict, deque\nfrom itertools import (\n accumulate,\n permutations,\n combinations,\n product,\n combinations_with_replacement,\n)\nfrom bisect import bisect_left, bisect_right\nfrom copy import deepcopy\n\nvar_8 = float(\"inf\")\nvar_11 = 10**9 + 7\n\n\ndef func_16(*var_1):\n for var_4 in var_1:\n print(*var_4, sep=\"\\n\")\n\n\ndef func_3(var_12):\n return int(var_12) - 1\n\n\ndef func_12():\n return map(int, var_9().split())\n\n\ndef func_11():\n return map(float, var_9().split())\n\n\ndef func_13():\n return map(func_3, var_9().split())\n\n\ndef func_5():\n return list(func_12())\n\n\ndef func_7():\n return [int(var_15) - 1 for var_15 in var_9().split()]\n\n\ndef func_4():\n return list(func_11())\n\n\ndef func_6(var_12: int):\n return [func_2() for _ in range(var_12)]\n\n\ndef func_9(var_12: int):\n return [func_5() for _ in range(var_12)]\n\n\ndef func_10(var_12: int):\n return [func_7() for _ in range(var_12)]\n\n\ndef func_8():\n return [list(map(int, var_10.split())) for var_10 in var_9()]\n\n\ndef func_2():\n return int(var_9())\n\n\ndef func_1():\n return float(var_9())\n\n\ndef func_14():\n return var_9().replace(\"\\n\", \"\")\n\n\ndef func_15():\n var_3 = func_2()\n var_2 = func_9(var_3 - 1)\n\n def func_17(var_2):\n var_13 = 0\n for var_7, (var_5, var_14, var_6) in enumerate(var_2):\n if var_13 <= var_14:\n var_13 = var_14 + var_5\n continue\n else:\n if var_13 % var_6 != 0:\n var_13 += var_6 - var_13 % var_6\n var_13 += var_5\n print(var_13)\n\n for var_7 in range(var_3):\n func_17(var_2[var_7:])\n\n\nif __name__ == \"__main__\":\n func_15()\n", "fast_code": "import sys\n\nvar_4 = sys.stdin.readline\n\n\ndef func_1():\n var_6 = int(eval(var_4()))\n var_5 = tuple(tuple(map(int, var_4().split())) for var_3 in range(var_6 - 1))\n for var_3 in range(var_6):\n var_7 = 0\n for var_1, var_8, var_2 in var_5[var_3:]:\n var_7 = var_1 + var_8 - (-max(0, var_7 - var_8) // var_2) * var_2\n print(var_7)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 159141389, "fast_time": 40361101, "speedup": 3.9429, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_4"} -{"pair_id": "python_5489", "problem_id": "p02392", "language": "python", "slow_code": "import sys\n\nif __name__ == \"__main__\":\n import doctest\n\n doctest.testmod()\n var_1, var_2, var_3 = list(map(int, sys.stdin.read().split()))\n if var_1 < var_2 < var_3:\n print(\"Yes\")\n else:\n print(\"No\")\n", "fast_code": "var_1, var_2, var_3 = [int(var_4) for var_4 in input().split()]\nif var_1 < var_2 and var_2 < var_3:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 3028838454, "fast_time": 16037360, "speedup": 188.8614, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_8"} -{"pair_id": "python_13762", "problem_id": "p02385", "language": "python", "slow_code": "import itertools\n\n\ndef func_1(var_6, var_5):\n for var_4 in var_5:\n if var_4 == \"N\":\n var_6[0], var_6[1], var_6[5], var_6[4] = (\n var_6[1],\n var_6[5],\n var_6[4],\n var_6[0],\n )\n elif var_4 == \"S\":\n var_6[0], var_6[1], var_6[5], var_6[4] = (\n var_6[4],\n var_6[0],\n var_6[1],\n var_6[5],\n )\n elif var_4 == \"W\":\n var_6[0], var_6[3], var_6[5], var_6[2] = (\n var_6[2],\n var_6[0],\n var_6[3],\n var_6[5],\n )\n elif var_4 == \"E\":\n var_6[0], var_6[3], var_6[5], var_6[2] = (\n var_6[3],\n var_6[5],\n var_6[2],\n var_6[0],\n )\n\n\nvar_1 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nfor var_7 in range(4):\n for var_8 in range(4):\n for var_5 in itertools.permutations(\"S\" * var_7 + \"W\" * var_8):\n var_3 = var_1[::]\n func_1(var_3, var_5)\n if var_2 == var_3:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "fast_code": "class Class_1:\n def __init__(self, var_6):\n self.label = var_6\n\n def func_5(self):\n self.change([2, 6, 3, 4, 1, 5])\n\n def func_8(self):\n self.change([3, 2, 6, 1, 5, 4])\n\n def func_2(self):\n self.change([4, 2, 1, 6, 5, 3])\n\n def func_7(self):\n self.change([5, 1, 3, 4, 6, 2])\n\n def func_6(self):\n self.change([1, 4, 2, 5, 3, 6])\n\n def func_1(self, var_2):\n var_7 = []\n for var_4 in range(6):\n var_7.append(self.label[var_2[var_4] - 1])\n self.label = var_7\n\n def func_3(self, var_1):\n for var_4 in range(6):\n if var_4 % 2 == 0:\n self.north()\n else:\n self.west()\n for var_5 in range(4):\n self.rotate()\n if self.label == var_1:\n return True\n return False\n\n\ndef func_4():\n var_3 = [int(var_9) for var_9 in input().split()]\n var_8 = [int(var_9) for var_9 in input().split()]\n if Class_1(var_3).is_same_dice(var_8):\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n func_4()\n", "slow_time": 586452876, "fast_time": 116482320, "speedup": 5.0347, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_1"} -{"pair_id": "python_6754", "problem_id": "p00729", "language": "python", "slow_code": "while 1:\n var_2, var_1 = list(map(int, input().split()))\n if var_2 == 0:\n break\n var_3 = [[0] * 1261 for var_4 in range(var_2)]\n for var_4 in range(eval(input())):\n var_8, var_6, var_5, var_7 = list(map(int, input().split()))\n for var_10 in range(var_8, 1261):\n var_3[var_6 - 1][var_10] = var_7 * var_5\n for var_4 in range(eval(input())):\n var_11, var_9, var_5 = list(map(int, input().split()))\n print(\n sum(\n 1 if any(var_3[var_6][var_8] == var_5 for var_6 in range(var_2)) else 0\n for var_8 in range(var_11, var_9)\n )\n )\n", "fast_code": "while 1:\n var_2, var_1 = list(map(int, input().split()))\n if var_2 == 0:\n break\n var_3 = [[0] * 1261 for var_4 in range(var_1)]\n var_8 = eval(input())\n var_13 = sorted(\n [list(map(int, input().split())) for var_4 in range(var_8)],\n key=lambda var_15: var_15[1],\n )\n for var_4 in range(0, var_8, 2):\n var_10, var_7, var_6, var_9 = var_13[var_4]\n var_11, var_7, var_6, var_9 = var_13[var_4 + 1]\n var_3[var_6 - 1][var_10:var_11] = [1 for var_5 in range(var_10, var_11)]\n for var_4 in range(eval(input())):\n var_14, var_12, var_6 = list(map(int, input().split()))\n print(sum(var_3[var_6 - 1][var_14:var_12]))\n", "slow_time": 1410083054, "fast_time": 125684716, "speedup": 11.2192, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_2"} -{"pair_id": "python_1323", "problem_id": "p03037", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\nvar_7 = 10**20\nvar_10 = 10**9 + 7\nvar_4 = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nvar_5 = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef func_2():\n return [int(var_12) for var_12 in sys.stdin.readline().split()]\n\n\ndef func_3():\n return [int(var_12) - 1 for var_12 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_4():\n return sys.stdin.readline().split()\n\n\ndef func_5():\n return eval(input())\n\n\ndef func_6():\n var_11, var_8 = func_2()\n var_9 = [0] * (var_11 + 1)\n for _ in range(var_8):\n var_1, var_3 = func_2()\n var_9[var_1 - 1] += 1\n var_9[var_3] -= 1\n for var_6 in range(var_11 - 1):\n var_9[var_6 + 1] += var_9[var_6]\n var_2 = 0\n for var_12 in var_9[:-1]:\n if var_12 == var_8:\n var_2 += 1\n return var_2\n\n\nprint((func_6()))\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_4 = -1\nvar_6 = 10**10\nfor _ in range(var_1):\n var_3, var_5 = list(map(int, input().split()))\n var_4 = max(var_4, var_3)\n var_6 = min(var_6, var_5)\nprint((max(var_6 - var_4 + 1, 0)))\n", "slow_time": 2050306644, "fast_time": 19304470, "speedup": 106.2089, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_24"} -{"pair_id": "python_4339", "problem_id": "p03264", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_2 = []\nfor var_4 in range(1, var_1 + 1):\n var_2.append(var_4)\nvar_3 = 0\nif var_1 >= 2 and var_1 <= 100:\n for var_6 in range(len(var_2)):\n for var_5 in range(var_6 + 1, len(var_2)):\n if (\n var_2[var_6] & 1 == 0\n and var_2[var_5] & 1 == 1\n or var_2[var_6] & 1 == 1\n and var_2[var_5] & 1 == 0\n ):\n var_2[var_6] * var_2[var_5] % 2 == 0\n if var_2[var_6] * var_2[var_5] % 2 == 0:\n var_3 += 1\n print(var_3)\n", "fast_code": "import math\n\nvar_1 = int(eval(input()))\nprint((int(math.floor(var_1 / 2) * math.ceil(var_1 / 2))))\n", "slow_time": 113472482, "fast_time": 12622405, "speedup": 8.9898, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_9"} -{"pair_id": "python_13328", "problem_id": "p03860", "language": "python", "slow_code": "var_3 = input().split()\nvar_1 = []\n\n\ndef func_1():\n print(\"111\")\n print(\"222\")\n print(\"333\")\n print(\"ii\")\n\n\nfor var_2 in var_3:\n var_1.append(var_2[0])\nprint((\"\".join(var_1)))\n", "fast_code": "var_1 = input()[8]\nprint((\"A%sC\" % var_1))\n", "slow_time": 21301645, "fast_time": 6479148, "speedup": 3.2877, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_12"} -{"pair_id": "python_4541", "problem_id": "p03738", "language": "python", "slow_code": "import math\n\nif __name__ == \"__main__\":\n var_1 = input()\n var_2 = input()\n if len(var_1) > len(var_2):\n print(\"GREATER\")\n elif len(var_1) < len(var_2):\n print(\"LESS\")\n elif len(var_1) == len(var_2):\n for var_3 in range(len(var_1)):\n if var_1[var_3] > var_2[var_3]:\n print(\"GREATER\")\n break\n elif var_1[var_3] < var_2[var_3]:\n print(\"LESS\")\n break\n elif var_1[var_3] == var_2[var_3] and var_3 == len(var_1) - 1:\n print(\"EQUAL\")\n", "fast_code": "var_1 = int(eval(input())) - int(eval(input()))\nprint((\"GELRQEEUSAASTL E R\"[(var_1 < 1) + (var_1 < 0) :: 3]))\n", "slow_time": 39621379, "fast_time": 16660160, "speedup": 2.3782, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_20"} -{"pair_id": "python_11847", "problem_id": "p02394", "language": "python", "slow_code": "import math\n\n\ndef func_1():\n try:\n var_3 = input().rstrip()\n var_4 = var_3.split(\" \")\n var_7 = float(var_4[0])\n var_1 = float(var_4[1])\n var_9 = float(var_4[2])\n var_10 = float(var_4[3])\n var_5 = abs(float(var_4[4]))\n except:\n print(\"input error\")\n return -1\n var_8 = math.copysign(1, var_7)\n var_2 = math.copysign(1, var_1)\n var_6 = var_8 * var_9 + var_5 <= var_8 * var_7\n var_6 = var_6 and (var_8 * var_9 - var_5 >= 0)\n var_6 = var_6 and (var_2 * var_10 + var_5 <= var_2 * var_1)\n var_6 = var_6 and (var_2 * var_10 - var_5 >= 0)\n if var_6:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nfunc_1()\n", "fast_code": "var_2, var_1, var_4, var_5, var_3 = list(map(int, input().split()))\nprint(\n (\n \"Yes\"\n if 0 <= var_4 - var_3\n and var_4 + var_3 <= var_2\n and 0 <= var_5 - var_3\n and var_5 + var_3 <= var_1\n else \"No\"\n )\n)\n", "slow_time": 53297244, "fast_time": 16231487, "speedup": 3.2836, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_6"} -{"pair_id": "python_5270", "problem_id": "p02729", "language": "python", "slow_code": "var_6, var_5 = list(map(int, input().split()))\nvar_1 = []\nfor var_3 in range(1, var_6 + 1):\n var_1.append(2 * var_3)\nfor var_4 in range(1, var_5 + 1):\n var_1.append(2 * var_4 - 1)\nvar_2 = 0\nfor var_3 in range(len(var_1) - 1):\n for var_4 in range(var_3 + 1, len(var_1)):\n if (var_1[var_3] + var_1[var_4]) % 2 == 0:\n var_2 += 1\nprint(var_2)\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nif (var_2 > 0) and (var_1 > 0):\n print((int(var_2 * (var_2 - 1) / 2 + var_1 * (var_1 - 1) / 2)))\nelse:\n print((int(max(var_2, var_1) * (max(var_2, var_1) - 1) / 2)))\n", "slow_time": 809200323, "fast_time": 22959213, "speedup": 35.2451, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_23"} -{"pair_id": "python_11775", "problem_id": "p03579", "language": "python", "slow_code": "from networkx import *\n\nvar_7, *var_8 = list(map(str.split, open(0)))\nvar_7, var_6 = list(map(int, var_7))\nvar_5 = var_1()\nvar_5.add_edges_from(var_8)\ntry:\n var_2, var_3 = list(map(len, var_4.sets(var_5)))\n var_2 *= var_3\nexcept:\n var_2 = var_7 * ~-var_7 // 2\nprint((var_2 - var_6))\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**7)\nvar_2, var_1 = list(map(int, input().split()))\nvar_8 = [[] for _ in range(var_2)]\nfor var_9 in range(var_1):\n var_3, var_5 = list(map(int, input().split()))\n var_3 -= 1\n var_5 -= 1\n var_8[var_3].append(var_5)\n var_8[var_5].append(var_3)\n\nvar_7 = [0 for var_9 in range(var_2)]\n\n\ndef func_1(var_12, var_6):\n var_7[var_12] = var_6\n for var_11 in var_8[var_12]:\n if var_7[var_11] == var_6:\n return False\n if var_7[var_11] == 0 and not func_1(var_11, -var_6):\n return False\n return True\n\n\nif func_1(0, 1):\n var_10 = 0\n var_14 = 0\n for var_13 in var_7:\n if var_13 == 1:\n var_10 += 1\n else:\n var_14 += 1\n var_4 = var_10 * var_14 - var_1\nelse:\n var_4 = var_2 * (var_2 - 1) // 2 - var_1\nprint(var_4)\n", "slow_time": 18150154613, "fast_time": 72523037, "speedup": 250.2674, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_20"} -{"pair_id": "python_12895", "problem_id": "p03549", "language": "python", "slow_code": "from sys import stdin\n\nvar_7 = lambda: list(map(int, stdin.readline().split()))\nvar_3 = lambda: list(map(int, stdin.readline().split()))\nvar_6, var_4 = var_7()\nvar_5 = 1900 * var_4 + 100 * (var_6 - var_4)\nvar_1 = 0\nfor var_2 in range(1, 10**6):\n var_9 = 0.5**var_4\n var_10 = (1 - 0.5**var_4) ** (var_2 - 1)\n var_8 = var_9 * var_10\n var_12 = var_5 * var_2\n var_1 += var_8 * var_12\nvar_1 = int(var_1)\nvar_11 = var_1 % 10\nif var_11 != 0:\n var_1 += 10 - var_11\nprint(var_1)\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = 2**var_1 * (1900 * var_1 + 100 * (var_2 - var_1))\nprint(var_3)\n", "slow_time": 269290726221, "fast_time": 12533967, "speedup": 21484.876, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_8"} -{"pair_id": "python_4969", "problem_id": "p03606", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_7 = [0] * 10**6\nfor var_1 in range(var_4):\n var_3, var_5 = list(map(int, input().split()))\n for var_2 in range(var_3, var_5 + 1):\n var_7[var_2 - 1] = 1\nvar_6 = 0\nfor var_1 in range(10**6):\n if var_7[var_1] == 1:\n var_6 += 1\nprint(var_6)\n", "fast_code": "var_3 = int(eval(input()))\nvar_5 = 0\nfor var_1 in range(var_3):\n var_4, var_2 = list(map(int, input().split()))\n var_5 += var_2 - var_4 + 1\nprint(var_5)\n", "slow_time": 40113578180, "fast_time": 19178115, "speedup": 2091.633, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_5"} -{"pair_id": "python_8579", "problem_id": "p02959", "language": "python", "slow_code": "var_3 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_4 = 0\nfor var_5 in range(var_3):\n if var_5 % 2 == 0:\n if var_1[var_5 // 2] >= var_2[var_5 // 2]:\n var_1[var_5 // 2] -= var_2[var_5 // 2]\n var_4 += var_2[var_5 // 2]\n var_2[var_5 // 2] = 0\n else:\n var_2[var_5 // 2] -= var_1[var_5 // 2]\n var_4 += var_1[var_5 // 2]\n var_1[var_5 // 2] = 0\n if var_1[var_5 // 2 + 1] >= var_2[var_5 // 2]:\n var_1[var_5 // 2 + 1] -= var_2[var_5 // 2]\n var_4 += var_2[var_5 // 2]\n var_2[var_5 // 2] = 0\n else:\n var_2[var_5 // 2] -= var_1[var_5 // 2 + 1]\n var_4 += var_1[var_5 // 2 + 1]\n var_1[var_5 // 2 + 1] = 0\n else:\n if var_1[var_3 - var_5 // 2] >= var_2[var_3 - var_5 // 2 - 1]:\n var_1[var_3 - var_5 // 2] -= var_2[var_3 - var_5 // 2 - 1]\n var_4 += var_2[var_3 - var_5 // 2 - 1]\n var_2[var_3 - var_5 // 2 - 1] = 0\n else:\n var_2[var_3 - var_5 // 2 - 1] -= var_1[var_3 - var_5 // 2]\n var_4 += var_1[var_3 - var_5 // 2]\n var_1[var_3 - var_5 // 2] = 0\n if var_1[var_3 - var_5 // 2 - 1] >= var_2[var_3 - var_5 // 2 - 1]:\n var_1[var_3 - var_5 // 2 - 1] -= var_2[var_3 - var_5 // 2 - 1]\n var_4 += var_2[var_3 - var_5 // 2 - 1]\n var_2[var_3 - var_5 // 2 - 1] = 0\n else:\n var_2[var_3 - var_5 // 2 - 1] -= var_1[var_3 - var_5 // 2 - 1]\n var_4 += var_1[var_3 - var_5 // 2 - 1]\n var_1[var_3 - var_5 // 2 - 1] = 0\nprint(var_4)\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_5 = 0\nfor var_3 in range(var_4):\n if var_1[var_3] >= var_2[var_3]:\n\n var_1[var_3] -= var_2[var_3]\n var_5 += var_2[var_3]\n var_2[var_3] = 0\n elif var_1[var_3] < var_2[var_3]:\n var_5 += var_1[var_3]\n\n var_2[var_3] -= var_1[var_3]\n var_5 += min(var_2[var_3], var_1[var_3 + 1])\n var_1[var_3 + 1] = max(var_1[var_3 + 1] - var_2[var_3], 0)\nprint(var_5)\n", "slow_time": 99337511, "fast_time": 44337451, "speedup": 2.2405, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_27"} -{"pair_id": "python_10829", "problem_id": "p02935", "language": "python", "slow_code": "import math\nimport statistics\n\n\ndef func_1(var_7):\n if var_7 == 1:\n return 1\n else:\n return var_7 * func_1(var_7 - 1)\n\n\ndef func_2(var_1, var_2):\n if var_1 == 0:\n return var_2\n elif var_2 == 0:\n return var_1\n else:\n return func_2(var_2, var_1 % var_2)\n\n\ndef func_3(var_1, var_2):\n return var_1 * var_2 / func_2(var_1, var_2)\n\n\ndef func_4(var_10):\n if len(var_10) < 1:\n return var_10\n var_8 = var_10[0]\n var_6 = []\n var_9 = []\n for var_13 in range(1, len(var_10)):\n if var_10[var_13] <= var_8:\n var_6.append(var_10[var_13])\n else:\n var_9.append(var_10[var_13])\n var_6 = func_4(var_6)\n var_9 = func_4(var_9)\n var_3 = [var_8]\n return var_6 + var_3 + var_9\n\n\nvar_7 = int(eval(input()))\n\nvar_11 = list(int(var_4) for var_4 in input().split())\nvar_5 = 0.00\nfor var_4 in range(var_7):\n var_12 = sorted(var_11)\n if len(var_11) == 2:\n var_5 = (var_11[0] + var_11[1]) / 2.00\n break\n\n var_11 = var_12\n var_5 = (var_11[0] + var_11[1]) / 2.00\n del var_11[0]\n del var_11[0]\n var_11.append(var_5)\n\nprint((\"{:.6f}\".format(var_5)))\n", "fast_code": "var_3 = int(eval(input()))\nvar_4 = [int(var_2) for var_2 in input().split()]\nvar_4.sort()\nvar_1 = var_4[0]\nfor var_2 in range(1, var_3):\n var_1 = (var_1 + var_4[var_2]) / 2\nprint(var_1)\n", "slow_time": 92880138, "fast_time": 24973201, "speedup": 3.7192, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_17"} -{"pair_id": "python_6362", "problem_id": "p02551", "language": "python", "slow_code": "var_2, var_3 = list(map(int, input().split()))\n\n\nclass Class_1:\n def __init__(self, var_10: list, var_20, var_9):\n var_13 = len(var_10)\n self.N0 = 1 << (var_13 - 1).bit_length()\n self.ide_ele = var_9\n self.data = [var_9] * (2 * self.N0)\n self.segfunc = var_20\n for var_8, var_21 in enumerate(var_10):\n self.data[var_8 + self.N0 - 1] = var_21\n for var_8 in range(self.N0 - 2, -1, -1):\n self.data[var_8] = self.segfunc(\n self.data[2 * var_8 + 1], self.data[2 * var_8 + 2]\n )\n\n def func_3(self, var_11: int, var_21):\n var_11 += self.N0 - 1\n\n self.data[var_11] = var_21\n\n while var_11:\n var_11 = (var_11 - 1) // 2\n self.data[var_11] = self.segfunc(\n self.data[var_11 * 2 + 1], self.data[var_11 * 2 + 2]\n )\n\n def func_1(self, var_11):\n return self.query(var_11, var_11 + 1)\n\n def func_2(self, var_12: int, var_17: int):\n var_1 = var_12 + self.N0\n var_4 = var_17 + self.N0\n var_16 = self.ide_ele\n\n var_5, var_7 = [], []\n while var_1 < var_4:\n if var_1 & 1:\n var_5.append(var_1 - 1)\n var_1 += 1\n if var_4 & 1:\n var_4 -= 1\n var_7.append(var_4 - 1)\n var_1 >>= 1\n var_4 >>= 1\n for var_8 in var_5 + var_7[::-1]:\n var_16 = self.segfunc(var_16, self.data[var_8])\n\n return var_16\n\n\n\"\"\"\"\"\"\n\nvar_19 = Class_1([var_2 - 1] * var_2, min, float(\"INF\"))\nvar_18 = Class_1([var_2 - 1] * var_2, min, float(\"INF\"))\nvar_6 = (var_2 - 2) ** 2\nfor var_8 in range(var_3):\n var_15, var_21 = list(map(int, input().split()))\n if var_15 == 1:\n var_16 = var_19.query(var_21 - 1, var_2)\n var_14 = var_18.get(var_16 - 1)\n var_18.update(var_16 - 1, min(var_21 - 1, var_14))\n var_6 -= max(var_16 - 1, 0)\n else:\n var_16 = var_18.query(var_21 - 1, var_2)\n var_14 = var_19.get(var_16 - 1)\n var_19.update(var_16 - 1, min(var_21 - 1, var_14))\n var_6 -= max(var_16 - 1, 0)\n\nprint(var_6)\n", "fast_code": "import sys\nimport math\nfrom collections import defaultdict, deque, Counter\nfrom copy import deepcopy\nfrom bisect import bisect, bisect_right, bisect_left\nfrom heapq import heapify, heappop, heappush\n\nvar_10 = sys.stdin.readline\n\n\ndef func_8():\n return var_10().rstrip()\n\n\ndef func_1():\n return float(var_10().rstrip())\n\n\ndef func_2():\n return int(var_10().rstrip())\n\n\ndef func_7():\n return list(map(int, var_10().split()))\n\n\ndef func_6():\n return list(map(float, var_10().split()))\n\n\ndef func_5():\n return list(map(int, var_10().split()))\n\n\ndef func_9():\n return tuple(map(int, var_10().split()))\n\n\ndef func_4():\n return list(map(float, var_10().split()))\n\n\ndef func_3(var_1, var_4, var_15):\n return [[var_15 for var_9 in range(var_4)] for var_11 in range(var_1)]\n\n\nclass Class_1:\n\n def __init__(self, var_14):\n self.n = var_14\n self.bit = [0] * (var_14 + 1)\n\n def func_10(self, var_9, var_20):\n\n while var_9 <= self.n:\n self.bit[var_9] += var_20\n var_9 += var_9 & -var_9\n\n def func_14(self, var_9):\n var_18 = 0\n\n while var_9 > 0:\n var_18 += self.bit[var_9]\n var_9 -= var_9 & -var_9\n return var_18\n\n def func_13(self, var_9, var_12):\n return self.sum(var_12) - self.sum(var_9)\n\n def func_11(self, var_20):\n if var_20 <= 0:\n return 0\n else:\n var_9 = 0\n var_16 = 1\n\n while var_16 < self.n:\n var_16 = var_16 << 1\n var_13 = var_16\n while var_13 > 0:\n if var_9 + var_13 < self.n and self.bit[var_9 + var_13] < var_20:\n var_20 -= self.bit[var_9 + var_13]\n var_9 += var_13\n var_13 = var_13 >> 1\n return var_9 + 1\n\n\ndef func_12():\n var_2, var_3 = func_7()\n var_5, var_6 = Class_1(var_2), Class_1(var_2)\n var_21 = var_2 - 2\n var_23 = var_2 - 2\n var_5.add(1, var_2 - 2)\n var_5.add(var_2 - 1, -(var_2 - 2))\n var_6.add(1, var_2 - 2)\n var_6.add(var_2 - 1, -(var_2 - 2))\n var_17 = (var_2 - 2) ** 2\n for var_9 in range(var_3):\n var_7, var_8 = func_7()\n if var_7 == 1:\n var_20 = var_5.sum(var_8 - 1)\n if var_23 > var_8 - 2:\n var_19 = var_6.sum(1)\n var_6.add(1, var_8 - 2 - var_19)\n var_6.add(var_21 + 1, -(var_8 - 2 - var_19))\n var_23 = var_8 - 2\n var_17 -= var_20\n else:\n var_22 = var_6.sum(var_8 - 1)\n if var_21 > var_8 - 2:\n var_19 = var_5.sum(1)\n var_5.add(1, var_8 - 2 - var_19)\n var_5.add(var_23 + 1, -(var_8 - 2 - var_19))\n var_21 = var_8 - 2\n var_17 -= var_22\n print(var_17)\n\n\nif __name__ == \"__main__\":\n func_12()\n", "slow_time": 34125142256, "fast_time": 296777332, "speedup": 114.9857, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_5"} -{"pair_id": "python_3843", "problem_id": "p03564", "language": "python", "slow_code": "var_2, var_1 = int(eval(input())), int(eval(input()))\nvar_3 = 10**10\nfor var_4 in range(2**var_2):\n var_6 = 1\n for var_5 in range(var_2):\n if (var_4 >> (var_2 - var_5 - 1) & 1) == 1:\n var_6 *= 2\n else:\n var_6 += var_1\n var_3 = min(var_3, var_6)\nprint(var_3)\n", "fast_code": "var_3 = int(eval(input()))\nvar_2 = int(eval(input()))\nvar_4 = 1\nfor var_1 in range(var_3):\n var_4 = min(var_4 + var_2, var_4 * 2)\nprint(var_4)\n", "slow_time": 714989706, "fast_time": 20867073, "speedup": 34.264, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_6"} -{"pair_id": "python_16969", "problem_id": "p02804", "language": "python", "slow_code": "var_2 = 10**6\nvar_1 = 10**9 + 7\nvar_7, var_8, var_10 = [0] * var_2, [0] * var_2, [0] * var_2\n\n\ndef func_2():\n var_7[0], var_7[1] = 1, 1\n var_8[0], var_8[1] = 1, 1\n var_10[1] = 1\n for var_9 in range(2, var_2):\n var_7[var_9] = var_7[var_9 - 1] * var_9 % var_1\n var_10[var_9] = var_1 - var_10[var_1 % var_9] * (var_1 // var_9) % var_1\n var_8[var_9] = var_8[var_9 - 1] * var_10[var_9] % var_1\n\n\ndef func_1(var_12, var_11):\n if var_12 < var_11:\n return 0\n if var_12 < 0 or var_11 < 0:\n return 0\n return var_7[var_12] * (var_8[var_11] * var_8[var_12 - var_11] % var_1) % var_1\n\n\nvar_12, var_11 = list(map(int, input().split()))\nvar_4 = list(map(int, input().split()))\nfunc_2()\nvar_4.sort()\nvar_5 = 0\nvar_6 = 0\nfor var_9, var_3 in enumerate(var_4):\n var_5 += var_3 * func_1(var_9, var_11 - 1)\n var_5 %= var_1\n var_6 += var_3 * func_1(var_12 - 1 - var_9, var_11 - 1)\n var_6 %= var_1\nprint(((var_5 - var_6) % var_1))\n", "fast_code": "var_12, var_9 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_11 = 10**9 + 7\nvar_3 = 10**5 + 50\nvar_6 = [1] * (var_3 + 1)\nvar_7 = [1] * (var_3 + 1)\nfor var_8 in range(var_3):\n var_6[var_8 + 1] = var_6[var_8] * (var_8 + 1) % var_11\nvar_7[-1] = pow(var_6[-1], var_11 - 2, var_11)\nfor var_8 in reversed(list(range(var_3))):\n var_7[var_8] = var_7[var_8 + 1] * (var_8 + 1) % var_11\n\n\ndef func_1(var_12, var_13, var_11):\n if var_13 < 0 or var_13 > var_12:\n return 0\n var_13 = min(var_13, var_12 - var_13)\n return var_6[var_12] * var_7[var_13] * var_7[var_12 - var_13] % var_11\n\n\nvar_1.sort()\nvar_5 = 0\nfor var_8, var_4 in enumerate(var_1):\n var_2 = var_12 - 1 - var_8\n var_10 = var_8\n if var_10 >= 0:\n var_5 += var_4 * func_1(var_10, var_9 - 1, var_11)\n if var_2 >= 0:\n var_5 -= var_4 * func_1(var_2, var_9 - 1, var_11)\nvar_5 %= var_11\nprint(var_5)\n", "slow_time": 181158031493, "fast_time": 25067330596, "speedup": 7.2269, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_18"} -{"pair_id": "python_13511", "problem_id": "p02406", "language": "python", "slow_code": "var_3 = int(input())\nvar_2 = 1\nvar_1 = []\nwhile var_2 <= var_3:\n var_4 = var_2\n if var_4 % 3 == 0:\n var_1.append(str(var_2))\n else:\n while var_4:\n if var_4 % 10 == 3:\n var_1.append(str(var_2))\n break\n var_4 /= 10\n var_2 += 1\nprint(\"\", \" \".join(var_1))\n", "fast_code": "var_2 = int(input())\nfor var_1 in range(3, var_2 + 1):\n if var_1 % 3 == 0 or var_1 % 10 == 3 or \"3\" in str(var_1):\n print(\"\", \"{0}\".format(var_1), end=\"\")\nprint()\n", "slow_time": 1499193681, "fast_time": 35199578, "speedup": 42.5912, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_29"} -{"pair_id": "python_16977", "problem_id": "p03291", "language": "python", "slow_code": "import sys\n\n\ndef func_9():\n return sys.stdin.readline().strip()\n\n\ndef func_10(var_5, var_6, var_7):\n return [[var_7] * var_6 for var_11 in range(var_5)]\n\n\ndef func_11(var_5, var_6, var_7, var_8):\n return [[[var_8] * var_7 for var_12 in range(var_6)] for var_11 in range(var_5)]\n\n\ndef func_12(var_5, var_6, var_7, var_8, var_10):\n return [\n [[[var_10] * var_8 for var_12 in range(var_7)] for var_12 in range(var_6)]\n for var_11 in range(var_5)\n ]\n\n\ndef func_8(var_14, var_15=1):\n return int(-(-var_14 // var_15))\n\n\ndef func_1():\n return int(func_9())\n\n\ndef func_3():\n return map(int, func_9().split())\n\n\ndef func_2(var_3=None):\n return list(func_3()) if var_3 is None else [func_1() for var_11 in range(var_3)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_1 = 10**18\nvar_2 = 10**9 + 7\nvar_4 = func_9()\nvar_3 = len(var_4)\n\nvar_9 = func_10(var_3 + 1, 4, 0)\nvar_9[0][0] = 1\nfor var_11 in range(var_3):\n var_13 = var_4[var_11]\n for var_12 in range(4):\n\n if var_13 == \"?\":\n\n var_9[var_11 + 1][var_12] += var_9[var_11][var_12] * 3\n var_9[var_11 + 1][var_12] %= var_2\n else:\n var_9[var_11 + 1][var_12] += var_9[var_11][var_12]\n var_9[var_11 + 1][var_12] %= var_2\n\n if var_12 < 3:\n\n if (\n var_13 == \"?\"\n or var_13 == \"A\"\n and var_12 == 0\n or var_13 == \"B\"\n and var_12 == 1\n or var_13 == \"C\"\n and var_12 == 2\n ):\n var_9[var_11 + 1][var_12 + 1] += var_9[var_11][var_12]\n var_9[var_11 + 1][var_12 + 1] %= var_2\n\nprint(var_9[var_3][3])\n", "fast_code": "var_3 = 10**9 + 7\nvar_1 = [0, 0, 0, 1]\nfor var_4 in input()[::-1]:\n var_5 = var_1[:]\n var_1[3] = var_5[3] * 3 if var_4 == \"?\" else var_5[3]\n var_1[3] %= var_3\n for var_2 in range(2, -1, -1):\n var_1[var_2] = (\n var_5[var_2] * 3 + var_5[var_2 + 1]\n if var_4 == \"?\"\n else (\n var_5[var_2] + var_5[var_2 + 1]\n if var_4 == \"ABC\"[var_2]\n else var_5[var_2]\n )\n )\n var_1[var_2] %= var_3\nprint(var_1[0] % (10**9 + 7))\n", "slow_time": 176285150, "fast_time": 50114864, "speedup": 3.5176, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_20"} -{"pair_id": "python_290", "problem_id": "p02714", "language": "python", "slow_code": "import sys\nimport fractions\n\n\ndef func_1():\n _input = [_.rstrip() for _ in sys.stdin.readlines()]\n\n var_5 = int(_input[0])\n var_8 = _input[1]\n\n return var_5, var_8\n\n\ndef func_2(var_15):\n print(var_15)\n\n\nif __name__ == \"__main__\":\n var_5, var_8 = func_1()\n\n var_10 = 0\n var_6 = list(\n map(\n bool,\n list(\n map(\n int,\n list(var_8.replace(\"R\", \"1\").replace(\"G\", \"0\").replace(\"B\", \"0\")),\n )\n ),\n )\n )\n var_3 = list(\n map(\n bool,\n list(\n map(\n int,\n list(var_8.replace(\"R\", \"0\").replace(\"G\", \"1\").replace(\"B\", \"0\")),\n )\n ),\n )\n )\n var_1 = list(\n map(\n bool,\n list(\n map(\n int,\n list(var_8.replace(\"R\", \"0\").replace(\"G\", \"0\").replace(\"B\", \"1\")),\n )\n ),\n )\n )\n var_7, var_4, var_2 = {}, {}, {}\n for var_12, var_14 in enumerate(var_6):\n if var_14:\n for var_13, var_11 in enumerate(var_3[var_12 + 1 :]):\n if var_11:\n if var_12 + var_13 + 2 not in var_2:\n var_2[var_12 + var_13 + 2] = sum(var_1[var_12 + var_13 + 2 :])\n if var_12 + 2 * var_13 + 2 < var_5:\n var_10 += (\n var_2[var_12 + var_13 + 2] - var_1[var_12 + 2 * var_13 + 2]\n )\n else:\n var_10 += var_2[var_12 + var_13 + 2]\n for var_13, var_11 in enumerate(var_1[var_12 + 1 :]):\n if var_11:\n if var_12 + var_13 + 2 not in var_4:\n var_4[var_12 + var_13 + 2] = sum(var_3[var_12 + var_13 + 2 :])\n if var_12 + 2 * var_13 + 2 < var_5:\n var_10 += (\n var_4[var_12 + var_13 + 2] - var_3[var_12 + 2 * var_13 + 2]\n )\n else:\n var_10 += var_4[var_12 + var_13 + 2]\n for var_12, var_14 in enumerate(var_3):\n if var_14:\n for var_13, var_11 in enumerate(var_6[var_12 + 1 :]):\n if var_11:\n if var_12 + var_13 + 2 not in var_2:\n var_2[var_12 + var_13 + 2] = sum(var_1[var_12 + var_13 + 2 :])\n if var_12 + 2 * var_13 + 2 < var_5:\n var_10 += (\n var_2[var_12 + var_13 + 2] - var_1[var_12 + 2 * var_13 + 2]\n )\n else:\n var_10 += var_2[var_12 + var_13 + 2]\n for var_13, var_9 in enumerate(var_1[var_12 + 1 :]):\n if var_9:\n if var_12 + var_13 + 2 not in var_7:\n var_7[var_12 + var_13 + 2] = sum(var_6[var_12 + var_13 + 2 :])\n if var_12 + 2 * var_13 + 2 < var_5:\n var_10 += (\n var_7[var_12 + var_13 + 2] - var_6[var_12 + 2 * var_13 + 2]\n )\n else:\n var_10 += var_7[var_12 + var_13 + 2]\n for var_12, var_14 in enumerate(var_1):\n if var_14:\n for var_13, var_11 in enumerate(var_6[var_12 + 1 :]):\n if var_11:\n if var_12 + var_13 + 2 not in var_4:\n var_4[var_12 + var_13 + 2] = sum(var_3[var_12 + var_13 + 2 :])\n if var_12 + 2 * var_13 + 2 < var_5:\n var_10 += (\n var_4[var_12 + var_13 + 2] - var_3[var_12 + 2 * var_13 + 2]\n )\n else:\n var_10 += var_4[var_12 + var_13 + 2]\n for var_13, var_9 in enumerate(var_3[var_12 + 1 :]):\n if var_9:\n if var_12 + var_13 + 2 not in var_7:\n var_7[var_12 + var_13 + 2] = sum(var_6[var_12 + var_13 + 2 :])\n if var_12 + 2 * var_13 + 2 < var_5:\n var_10 += (\n var_7[var_12 + var_13 + 2] - var_6[var_12 + 2 * var_13 + 2]\n )\n else:\n var_10 += var_7[var_12 + var_13 + 2]\n\n func_2(var_10)\n", "fast_code": "from collections import defaultdict\n\n\ndef func_1():\n _ = int(eval(input()))\n var_1 = input().rstrip()\n var_8 = defaultdict(set)\n for var_7, var_2 in enumerate(var_1):\n var_8[var_2].add(var_7)\n var_6 = len(var_8[\"R\"]) * len(var_8[\"G\"]) * len(var_8[\"B\"])\n for var_3, var_4, var_5 in [\"RGB\", \"GBR\", \"BRG\"]:\n var_6 -= sum(\n (var_7 + var_9) % 2 == 0 and (var_7 + var_9) // 2 in var_8[var_5]\n for var_7 in var_8[var_3]\n for var_9 in var_8[var_4]\n )\n print(var_6)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 331946011, "fast_time": 72545495, "speedup": 4.5757, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_14"} -{"pair_id": "python_378", "problem_id": "p03164", "language": "python", "slow_code": "def func_1():\n import sys, copy\n\n var_2, var_3 = list(map(int, sys.stdin.readline().split()))\n var_1 = tuple([tuple(map(int, sys.stdin.readline().split())) for _ in range(var_2)])\n\n var_5 = [[10**11 + 1 for _ in range(10**5 + 1)] for _ in range(var_2)]\n var_5[0][var_1[0][1]] = var_1[0][0]\n\n for var_6 in range(1, var_2):\n\n var_5[var_6] = copy.copy(var_5[var_6 - 1])\n var_10, var_8 = var_1[var_6][0], var_1[var_6][1]\n\n var_5[var_6][var_8] = min(var_10, var_5[var_6][var_8])\n\n for var_7 in range(10**5 + 1 - var_8):\n if var_5[var_6 - 1][var_7] != 0:\n var_5[var_6][var_8 + var_7] = min(\n var_5[var_6][var_8 + var_7], var_10 + var_5[var_6 - 1][var_7]\n )\n var_4 = 0\n for var_9, var_11 in enumerate(var_5[-1]):\n if var_11 <= var_3:\n if var_4 < var_9:\n var_4 = var_9\n\n print(var_4)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "import sys\n\n\ndef func_1():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\nvar_1, var_3 = func_1()\nvar_9 = [func_1() for _ in range(var_1)]\nvar_2 = var_1 * 10**3\nvar_4 = [[float(\"INF\")] * (var_2 + 1) for _ in range(var_1 + 1)]\nvar_4[0][0] = 0\nfor var_5 in range(1, var_1 + 1):\n var_8, var_7 = var_9[var_5 - 1]\n for var_6 in range(var_2 + 1):\n if var_6 - var_7 >= 0:\n var_4[var_5][var_6] = min(\n var_4[var_5][var_6], var_4[var_5 - 1][var_6 - var_7] + var_8\n )\n var_4[var_5][var_6] = min(var_4[var_5][var_6], var_4[var_5 - 1][var_6])\nprint((max([var_5 for var_5 in range(var_2 + 1) if var_4[-1][var_5] <= var_3])))\n", "slow_time": 34612782525, "fast_time": 5389440474, "speedup": 6.4223, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_17"} -{"pair_id": "python_16582", "problem_id": "p02845", "language": "python", "slow_code": "_, var_1 = open(0)\nvar_2 = 1\nvar_3 = [3] + [0] * 10**6\nfor var_1 in map(int, var_1.split()):\n var_2 = var_2 * var_3[var_1] % (10**9 + 7)\n var_3[var_1] -= 1\n var_3[var_1 + 1] += 1\nprint(var_2)\n", "fast_code": "import sys\n\n\ndef func_1():\n return int(eval(input()))\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_3():\n return list(map(int, input().split()))\n\n\nimport heapq\nimport bisect\nimport copy\n\n\ndef func_5(var_8, var_2):\n for var_11 in range(var_2):\n for var_9 in range(var_2):\n for var_10 in range(var_2):\n var_8[var_9 * var_2 + var_10] = min(\n var_8[var_9 * var_2 + var_10],\n var_8[var_9 * var_2 + var_11] + var_8[var_11 * var_2 + var_10],\n )\n return var_8\n\n\nvar_1 = 10**9 + 7\n\n\ndef func_4():\n var_12 = func_1()\n var_14 = func_3()\n var_4 = 1\n var_6, var_7, var_5 = -1, -1, -1\n for var_13 in var_14:\n var_15 = 0\n var_3 = 0\n if var_13 == var_6 + 1:\n var_15 += 1\n if not var_3:\n var_6 += 1\n var_3 = 1\n if var_13 == var_7 + 1:\n var_15 += 1\n if not var_3:\n var_7 += 1\n var_3 = 1\n if var_13 == var_5 + 1:\n var_15 += 1\n if not var_3:\n var_5 += 1\n var_3 = 1\n var_4 *= var_15\n var_4 %= var_1\n print(var_4)\n\n\nif __name__ == \"__main__\":\n func_4()\n", "slow_time": 815333677, "fast_time": 80804565, "speedup": 10.0902, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_28"} -{"pair_id": "python_237", "problem_id": "p03061", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools\nimport random\n\nsys.setrecursionlimit(10**7)\nvar_9 = 10**20\nvar_7 = 1.0 / 10**10\nvar_13 = 10**9 + 7\nvar_5 = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nvar_6 = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef func_4():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_5():\n return [int(var_21) - 1 for var_21 in sys.stdin.readline().split()]\n\n\ndef func_3():\n return [float(var_21) for var_21 in sys.stdin.readline().split()]\n\n\ndef func_6():\n return sys.stdin.readline().split()\n\n\ndef func_2():\n return int(sys.stdin.readline())\n\n\ndef func_1():\n return float(sys.stdin.readline())\n\n\ndef func_7():\n return input()\n\n\ndef func_11(var_18):\n return print(var_18, flush=True)\n\n\nclass Class_1:\n def __init__(self, var_14):\n self.M = var_12 = int(math.sqrt(var_14)) + 10\n self.A = var_1 = [True] * var_12\n var_1[0] = var_1[1] = False\n self.T = var_19 = []\n for var_8 in range(2, int(math.sqrt(var_12)) + 1):\n if not var_1[var_8]:\n continue\n var_19.append(var_8)\n for var_10 in range(var_8 * var_8, var_12, var_8):\n var_1[var_10] = False\n\n def func_9(self, var_14):\n return self.A[var_14]\n\n def func_8(self, var_14):\n var_4 = collections.defaultdict(int)\n for var_3 in self.T:\n while var_14 % var_3 == 0:\n var_4[var_3] += 1\n var_14 //= var_3\n if var_14 < 2:\n break\n if var_14 > 1:\n var_4[var_14] += 1\n return var_4.items()\n\n def func_12(self, var_14):\n var_17 = 1\n for var_11, var_20 in self.division(var_14):\n var_19 = 1\n for var_8 in range(1, var_20 + 1):\n var_19 += math.pow(var_11, var_8)\n var_17 *= var_19\n return var_17\n\n\ndef func_10():\n var_14 = func_2()\n var_1 = sorted(func_4())\n var_16 = Class_1(10**9)\n var_15 = collections.defaultdict(int)\n for var_2 in var_1:\n var_17 = [1]\n for var_11, var_20 in var_16.division(var_2):\n for var_3 in var_17[:]:\n for var_8 in range(1, var_20 + 1):\n var_17.append(var_3 * (var_11**var_8))\n for var_11 in var_17:\n var_15[var_11] += 1\n var_17 = 1\n for var_11, var_20 in var_15.items():\n if var_20 >= var_14 - 1 and var_17 < var_11:\n var_17 = var_11\n return var_17\n\n\nprint(func_10())\n", "fast_code": "from math import gcd\n\nvar_8 = int(eval(input()))\nvar_1 = [0] + list(map(int, input().split())) + [0]\nvar_8 += 2\nvar_2, var_3 = [0] * var_8, [0] * var_8\nvar_5, var_6 = 0, 0\nfor var_7 in range(var_8):\n var_5 = gcd(var_5, var_1[var_7])\n var_6 = gcd(var_6, var_1[var_8 - var_7 - 1])\n var_2[var_7] = var_5\n var_3[var_8 - var_7 - 1] = var_6\nvar_4 = var_2[-1]\nfor var_7 in range(var_8 - 2):\n var_4 = max(var_4, gcd(var_2[var_7], var_3[var_7 + 2]))\nprint(var_4)\n", "slow_time": 1034266124, "fast_time": 44727019, "speedup": 23.124, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_7"} -{"pair_id": "python_10981", "problem_id": "p02640", "language": "python", "slow_code": "from typing import *\nimport itertools\nimport math\nimport sys\n\nvar_1 = float(\"inf\")\nvar_5 = \"Yes\"\nvar_2 = \"No\"\n\n\ndef func_3(var_3: int, var_4: int):\n return [var_5, var_2][not (2 * var_3 <= var_4 <= 4 * var_3 and var_4 % 2 == 0)]\n\n\ndef func_2():\n sys.setrecursionlimit(10**6)\n\n def func_1():\n for var_6 in sys.stdin:\n for var_8 in var_6.split():\n yield var_8\n\n var_7 = func_1()\n var_3 = int(next(var_7))\n var_4 = int(next(var_7))\n print((func_3(var_3, var_4)))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nprint((\"Yes\" if var_2 % 2 == 0 and var_1 <= var_2 / 2 and var_2 / 4 <= var_1 else \"No\"))\n", "slow_time": 57748391, "fast_time": 13266921, "speedup": 4.3528, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_10"} -{"pair_id": "python_16228", "problem_id": "p03721", "language": "python", "slow_code": "import sys\n\nvar_8 = [0] * (100000 + 1)\nvar_7, var_6 = [int(var_9) for var_9 in sys.stdin.readline().split()]\nfor var_4 in range(var_7):\n var_1, var_2 = [int(var_9) for var_9 in sys.stdin.readline().split()]\n var_8[var_1] += var_2\nvar_3 = 0\nfor var_4, var_5 in enumerate(var_8):\n var_3 += var_5\n if var_3 >= var_6:\n print(var_4)\n break\n", "fast_code": "var_6, var_4, *var_5 = list(map(int, open(0).read().split()))\nvar_3 = 0\nfor var_1, var_2 in sorted(zip(var_5[::2], var_5[1::2])):\n var_3 += var_2\n if var_3 >= var_4:\n print(var_1)\n break\n", "slow_time": 225541028, "fast_time": 33159756, "speedup": 6.8016, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_26"} -{"pair_id": "python_952", "problem_id": "p03329", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_4 = 10**6\nvar_2 = [var_4] * (var_1 + 1)\nvar_2[0] = 0\nfor var_3 in range(var_1):\n if var_3 + 1 <= var_1:\n var_2[var_3 + 1] = min(var_2[var_3] + 1, var_2[var_3 + 1])\n for var_5 in range(1, 8):\n if var_3 + 6**var_5 <= var_1:\n var_2[var_3 + 6**var_5] = min(var_2[var_3] + 1, var_2[var_3 + 6**var_5])\n for var_5 in range(1, 7):\n if var_3 + 9**var_5 <= var_1:\n var_2[var_3 + 9**var_5] = min(var_2[var_3] + 1, var_2[var_3 + 9**var_5])\nprint((var_2[var_1]))\n", "fast_code": "import sys\n\nvar_6 = int(sys.stdin.readline().rstrip())\n\n\ndef func_1():\n var_3 = [0] * 8\n var_4 = [0] * 7\n var_2 = var_6\n for var_5 in range(5, -1, -1):\n var_7, var_8 = divmod(var_2, 9**var_5)\n var_4[var_5] = var_7\n var_2 = var_8\n var_9 = sum(var_3) + sum(var_4)\n for _ in range(var_6):\n var_5 = 0\n while True:\n var_3[var_5] += 1\n if var_3[var_5] == 6:\n var_3[var_5] = 0\n var_5 += 1\n else:\n break\n var_5 = 0\n while True:\n var_4[var_5] -= 1\n if var_4[var_5] == -1:\n var_4[var_5] = 8\n var_5 += 1\n else:\n break\n var_9 = min(var_9, sum(var_3) + sum(var_4))\n return var_9\n\n\nif __name__ == \"__main__\":\n var_1 = func_1()\n print(var_1)\n", "slow_time": 657010486, "fast_time": 97400199, "speedup": 6.7455, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_28"} -{"pair_id": "python_13848", "problem_id": "p02929", "language": "python", "slow_code": "from heapq import heappush, heappop, heapify\nfrom collections import deque, defaultdict, Counter\nimport itertools\nfrom itertools import permutations, combinations, groupby\nimport sys\nimport bisect\nimport string\nimport math\nimport time\nimport random\n\n\ndef func_2():\n return int(var_18())\n\n\ndef func_6():\n return map(int, var_18().split())\n\n\ndef func_4():\n return [int(var_14) for var_14 in var_18().split()]\n\n\ndef func_5():\n return [int(var_14) - 1 for var_14 in var_18().split()]\n\n\ndef func_7():\n return [ord(var_14) - 97 for var_14 in var_18()]\n\n\ndef func_3(var_24):\n return chr(var_24 + 97)\n\n\ndef func_1(var_3, var_2, var_1=False, var_15=0):\n var_25 = []\n var_13 = [[] for var_14 in range(var_23)]\n for var_14 in range(var_2):\n var_17 = func_4()\n var_25.append(var_17)\n if var_15 == 0:\n var_17[0] -= 1\n var_17[1] -= 1\n if len(var_17) == 2:\n var_5, var_8 = var_17\n var_13[var_5].append(var_8)\n if not var_1:\n var_13[var_8].append(var_5)\n elif len(var_17) == 3:\n var_5, var_8, var_11 = var_17\n var_6 = (var_17[0], var_17[2])\n var_9 = (var_17[1], var_17[2])\n var_13[var_5].append(var_9)\n if not var_1:\n var_13[var_8].append(var_6)\n return var_13, var_25\n\n\ndef func_8(var_19, var_23=2):\n var_29 = []\n for var_33 in range(var_23**var_19):\n var_30 = [var_33 // (var_23**var_10) % var_23 for var_10 in range(var_19)]\n var_29 += [var_30]\n return var_29\n\n\ndef func_10(*var_17, var_12=\"\\n\"):\n if var_31:\n print(*var_17, end=var_12)\n\n\nvar_4 = [\"Yes\", \"No\"]\nvar_22 = 10**9 + 7\nvar_16 = float(\"inf\")\nvar_21 = string.ascii_lowercase\nvar_35 = string.ascii_uppercase\nvar_34 = time.time()\n\nvar_18 = lambda: sys.stdin.readline().rstrip()\n\n\ndef func_9():\n import random\n\n var_23 = random.randint(4, 16)\n var_28, var_27 = 1, 10\n var_5 = [random.randint(var_28, var_27) for _ in range(var_23)]\n return var_23, var_5\n\n\nvar_31 = False\nvar_31 = True\nvar_7 = 1\nvar_23 = func_2()\nvar_30 = var_18()\nvar_20, var_26 = 0, 0\nfor var_14 in range(var_23 * 2):\n var_32 = 1 if var_30[var_14] == \"B\" else 0\n if (var_20 - var_26 + var_32) % 2 == 1:\n var_20 += 1\n else:\n var_7 *= var_20 - var_26\n var_7 %= var_22\n var_26 += 1\n if var_14 >= var_23:\n var_7 *= var_14 - var_23 + 1\n var_7 %= var_22\nif var_26 - var_20 != 0:\n print(0)\nelse:\n print(var_7)\n", "fast_code": "var_6, var_7 = open(0)\nvar_1 = var_4 = 1\nvar_5 = 0\nfor var_2 in var_7:\n var_3 = (var_2 > \"B\") ^ var_4 % 2\n var_5 += var_3 or -1\n var_1 = var_1 * var_5**var_3 * (var_4 > int(var_6) or var_4) % (10**9 + 7)\n var_4 += 1\nprint((var_1 * (var_5 == 1)))\n", "slow_time": 196228736, "fast_time": 33601523, "speedup": 5.8399, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_3"} -{"pair_id": "python_18068", "problem_id": "p03476", "language": "python", "slow_code": "var_3 = int(eval(input()))\nvar_2 = 110000\nvar_4 = [_ + 2 for _ in range(var_2)]\nvar_11 = var_4\nvar_7 = 0\nwhile True:\n var_10 = set([])\n var_13 = var_11[var_7]\n for var_8 in range(len(var_11)):\n if var_11[var_8] == var_13 or var_11[var_8] % var_13 != 0:\n var_10.add(var_11[var_8])\n if len(var_11) == len(var_10):\n break\n var_11 = list(var_10)\n var_11.sort()\n var_7 += 1\n\nvar_1 = [0 for _ in range(var_2)]\nfor var_7 in range(var_2):\n if var_7 % 2 == 0:\n continue\n if var_7 in var_10 and (var_7 + 1) // 2 in var_10:\n var_1[var_7] = 1\nvar_5 = [0 for _ in range(var_2)]\nfor var_7 in range(1, var_2):\n var_5[var_7] += var_1[var_7] + var_5[var_7 - 1]\n\nfor var_7 in range(var_3):\n var_9, var_12 = list(map(int, input().split()))\n var_6 = var_5[var_12] - var_5[var_9 - 1]\n print(var_6)\n", "fast_code": "from collections import defaultdict, deque, Counter\nfrom heapq import heappush, heappop, heapify\nimport math\nimport bisect\nimport random\nfrom itertools import permutations, accumulate, combinations, product\nimport sys\nimport string\nfrom bisect import bisect_left, bisect_right\nfrom math import factorial, ceil, floor, atan2, degrees\nfrom operator import mul\nfrom functools import reduce\n\nsys.setrecursionlimit(10**8)\nvar_2 = float(\"inf\")\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return sys.stdin.readline().split()\n\n\ndef func_8():\n return sys.stdin.readline().strip()\n\n\ndef func_2(var_9):\n return [func_1() for var_4 in range(var_9)]\n\n\ndef func_4(var_9):\n return [func_3() for var_4 in range(var_9)]\n\n\ndef func_9(var_9):\n return [func_8() for var_4 in range(var_9)]\n\n\ndef func_6(var_9):\n return [func_5() for var_4 in range(var_9)]\n\n\ndef func_10(var_9):\n return [list(func_8()) for var_4 in range(var_9)]\n\n\ndef func_7(var_9):\n return [[int(var_6) for var_6 in list(func_8())] for var_4 in range(var_9)]\n\n\nvar_8 = 1000000007\n\n\ndef func_11(var_9):\n var_5 = [1] * (var_9 + 1)\n var_5[0] = 0\n var_5[1] = 0\n for var_4 in range(2, int(var_9**0.5) + 1):\n if not var_5[var_4]:\n continue\n for var_6 in range(var_4 * 2, var_9 + 1, var_4):\n var_5[var_6] = 0\n return {var_4 for var_4 in range(var_9 + 1) if var_5[var_4]}\n\n\nvar_9 = 10**5\nvar_10 = func_11(var_9)\nvar_11 = func_1()\nvar_1 = [0] * (var_9 + 1)\nfor var_4 in range(var_9 + 1):\n if var_4 % 2 and var_4 in var_10 and (var_4 + 1) // 2 in var_10:\n var_1[var_4] = 1\nvar_3 = list(accumulate(var_1))\nfor var_4 in range(var_11):\n var_7, var_12 = func_3()\n print((var_3[var_12] - var_3[var_7 - 1]))\n", "slow_time": 161988006304, "fast_time": 10671408586, "speedup": 15.1796, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_25"} -{"pair_id": "python_6741", "problem_id": "p03395", "language": "python", "slow_code": "from scipy.sparse.csgraph import floyd_warshall\n\nvar_9, *var_2 = list(map(int, open(0).read().split()))\nvar_2, var_3 = var_2[:var_9], var_2[var_9:]\nvar_5 = []\nvar_1 = max(var_2)\nfor var_8 in range(var_1 - 1, -1, -1):\n var_10 = set(var_2)\n var_6 = [[0] * (var_1 + 1) for _ in range(var_1 + 1)]\n for var_7 in range(var_1 + 1):\n var_6[var_7][var_7] = 1\n for var_7 in var_5 + list(range(var_8, 0, -1)):\n var_11 = var_10.copy()\n for var_12 in var_10:\n var_6[var_12][var_12 % var_7] = 1\n var_11 |= {var_12 % var_7}\n var_10 = var_11\n var_4 = floyd_warshall(var_6)\n for var_12, var_13 in zip(var_2, var_3):\n if var_4[var_12, var_13] == float(\"inf\"):\n var_5 += (var_8 + 1,)\n break\nprint((-(len(var_5) == var_1) or sum(2**var_8 for var_8 in var_5)))\n", "fast_code": "from collections import deque\n\n\ndef func_1(var_19, var_5, var_16=0):\n var_10 = deque([var_16])\n var_3 = [-1] * var_19\n var_3[var_16] = 0\n while var_10:\n var_20 = var_10.popleft()\n for var_14 in var_5[var_20]:\n if var_3[var_14] == -1:\n var_3[var_14] = var_3[var_20] + 1\n var_10.append(var_14)\n return var_3\n\n\nvar_9 = int(eval(input()))\nvar_1 = [int(var_13) for var_13 in input().split()]\nvar_2 = [int(var_13) for var_13 in input().split()]\nvar_8 = 51\nvar_12 = [[] for _ in range(var_8)]\nfor var_15 in range(1, var_8):\n for var_17 in range(1, var_15 + 1):\n var_12[var_15].append([var_15 % var_17, 2**var_17])\n\n\ndef func_2(var_11):\n var_8 = 51\n var_12 = [[] for _ in range(var_8)]\n for var_17 in var_11:\n for var_15 in range(var_17, var_8):\n var_12[var_15].append(var_15 % var_17)\n var_4 = []\n for var_15 in range(var_8):\n var_4.append(func_1(var_8, var_12, var_15))\n for var_15 in range(var_9):\n if var_4[var_1[var_15]][var_2[var_15]] < 0:\n return 0\n return 1\n\n\nvar_6 = [var_15 for var_15 in range(1, 51)]\nvar_7 = []\nif func_2(var_6) == 0:\n print((-1))\nelse:\n while var_6:\n while True:\n if func_2(var_6 + var_7):\n if len(var_6) == 0:\n break\n var_6.pop()\n else:\n var_7.append(var_6[-1] + 1 if var_6 else 1)\n var_6 = [var_15 for var_15 in range(1, var_7[-1])]\n break\n if len(var_6) == 0:\n break\n print((sum([1 << var_18 for var_18 in var_7])))\n", "slow_time": 25944056519, "fast_time": 5434327839, "speedup": 4.7741, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_5"} -{"pair_id": "python_8200", "problem_id": "p03352", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_3 = 0\nif var_4 == 1:\n print((1))\nelse:\n for var_1 in range(var_4):\n for var_2 in range(2, 10):\n if var_3 <= var_1**var_2 and var_1**var_2 <= var_4:\n var_3 = var_1**var_2\n print(var_3)\n", "fast_code": "def func_1(var_2):\n var_3 = int(var_2 ** (0.5))\n var_4 = [32, 128, 243]\n\n func_1 = var_3**2\n for var_1 in var_4:\n if var_1 <= var_2:\n func_1 = max(var_1, func_1)\n for var_1 in range(1, 11):\n if var_1**3 <= var_2:\n func_1 = max((var_1**3), func_1)\n return func_1\n\n\nvar_2 = int(eval(input()))\nfor var_1 in range(var_2, var_2 + 1):\n print((func_1(var_1)))\n", "slow_time": 530484539, "fast_time": 36416333, "speedup": 14.5672, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_9"} -{"pair_id": "python_944", "problem_id": "p03329", "language": "python", "slow_code": "import itertools, sys\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\nvar_1 = func_1()\nvar_2 = [float(\"INF\")] * (var_1 + 1)\nvar_2[0] = 0\nfor var_3 in range(var_1 + 1):\n if var_3 + 1 <= var_1:\n var_2[var_3 + 1] = min(var_2[var_3 + 1], var_2[var_3] + 1)\n var_4, var_5 = 6, 9\n while var_3 + var_4 <= var_1:\n var_2[var_3 + var_4] = min(var_2[var_3 + var_4], var_2[var_3] + 1)\n var_4 *= 6\n while var_3 + var_5 <= var_1:\n var_2[var_3 + var_5] = min(var_2[var_3 + var_5], var_2[var_3] + 1)\n var_5 *= 9\nprint((var_2[-1]))\n", "fast_code": "import sys\n\nvar_6 = int(sys.stdin.readline().rstrip())\n\n\ndef func_1():\n var_3 = [0] * 8\n var_4 = [0] * 7\n var_2 = var_6\n for var_5 in range(5, -1, -1):\n var_7, var_8 = divmod(var_2, 9**var_5)\n var_4[var_5] = var_7\n var_2 = var_8\n var_9 = sum(var_3) + sum(var_4)\n for _ in range(var_6):\n var_5 = 0\n while True:\n var_3[var_5] += 1\n if var_3[var_5] == 6:\n var_3[var_5] = 0\n var_5 += 1\n else:\n break\n var_5 = 0\n while True:\n var_4[var_5] -= 1\n if var_4[var_5] == -1:\n var_4[var_5] = 8\n var_5 += 1\n else:\n break\n var_9 = min(var_9, sum(var_3) + sum(var_4))\n return var_9\n\n\nif __name__ == \"__main__\":\n var_1 = func_1()\n print(var_1)\n", "slow_time": 429751870, "fast_time": 97400199, "speedup": 4.4122, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_28"} -{"pair_id": "python_13847", "problem_id": "p02929", "language": "python", "slow_code": "import sys\nfrom collections import defaultdict, deque, Counter\nimport math\n\n\nfrom bisect import bisect_left, bisect_right\nimport heapq\n\nvar_12 = sys.stdin.readline\nvar_9 = lambda: var_12().strip()\nvar_8 = lambda: int(eval(var_12()))\nvar_7 = lambda: list(map(int, var_12().split()))\nvar_10 = lambda: [int(var_17) - 1 for var_17 in var_12().split()]\nvar_1 = 10**20\nvar_2 = 10**9 + 7\nvar_6 = lambda var_17: pow(var_17, var_2 - 2, var_2)\n\n\ndef func_3(var_14, var_13, func_1):\n return (func_4(var_14, var_13, func_1) * var_6(func_1[var_13])) % var_2\n\n\ndef func_4(var_14, var_13, func_1):\n if var_13 == 0 or var_13 == var_14:\n return var_14 % var_2\n return (func_1[var_14] * var_6(func_1[var_14 - var_13])) % var_2\n\n\ndef func_1(var_14):\n var_15 = [1]\n for var_11 in range(1, var_14 + 1):\n var_15.append((var_15[-1] * var_11) % var_2)\n return var_15\n\n\ndef func_5():\n var_14 = var_8()\n var_3 = var_9()\n var_16 = 0\n var_4 = 1\n for var_5 in var_3:\n if var_5 == \"W\":\n if var_16 == 0:\n print((0))\n return\n if var_16 % 2 == 0:\n var_4 *= var_16\n var_4 %= var_2\n var_16 -= 1\n else:\n var_16 += 1\n else:\n if var_16 % 2 == 1:\n var_4 *= var_16\n var_4 %= var_2\n var_16 -= 1\n else:\n var_16 += 1\n\n if var_16 == 0:\n print(((var_4 * func_1(var_14)[-1]) % var_2))\n else:\n print((0))\n\n\ndef func_2():\n var_14 = var_8()\n for _ in range(var_14):\n func_5()\n\n\nif __name__ == \"__main__\":\n\n func_5()\n", "fast_code": "var_6, var_7 = open(0)\nvar_1 = var_4 = 1\nvar_5 = 0\nfor var_2 in var_7:\n var_3 = (var_2 > \"B\") ^ var_4 % 2\n var_5 += var_3 or -1\n var_1 = var_1 * var_5**var_3 * (var_4 > int(var_6) or var_4) % (10**9 + 7)\n var_4 += 1\nprint((var_1 * (var_5 == 1)))\n", "slow_time": 124307619, "fast_time": 33601523, "speedup": 3.6995, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_3"} -{"pair_id": "python_18500", "problem_id": "p03409", "language": "python", "slow_code": "import sys\n\nvar_15 = sys.stdin.readline\nfrom collections import deque\n\n\nclass Class_3:\n class Class_2:\n def __init__(self, var_25, var_4, var_21):\n \"\"\"\"\"\"\n self.to, self.cap, self.rev = var_25, var_4, var_21\n\n def __init__(self, var_20, var_14):\n self._node = var_20\n self._inf = var_14\n self._level = [-1] * self._node\n self._iter = [0] * self._node\n self._graph = [[] for _ in range(self._node)]\n\n def func_1(self, var_12, var_25, var_4):\n self._graph[var_12].append(self.Edge(var_25, var_4, len(self._graph[var_25])))\n self._graph[var_25].append(self.Edge(var_12, 0, len(self._graph[var_12]) - 1))\n\n def func_2(self, var_24):\n \"\"\"\"\"\"\n self._level = [-1] * self._node\n var_19 = deque()\n self._level[var_24] = 0\n var_19.append(var_24)\n while var_19:\n var_5 = var_19.popleft()\n for var_7 in self._graph[var_5]:\n if self._level[var_7.to] < 0 < var_7.cap:\n self._level[var_7.to] = self._level[var_5] + 1\n var_19.append(var_7.to)\n\n def func_3(self, var_5, var_8, var_10):\n if var_5 == var_8:\n return var_10\n while self._iter[var_5] < len(self._graph[var_5]):\n var_7 = self._graph[var_5][self._iter[var_5]]\n if var_7.cap > 0 and self._level[var_5] < self._level[var_7.to]:\n var_11 = self.dfs(var_7.to, var_8, min(var_10, var_7.cap))\n if var_11 > 0:\n var_7.cap -= var_11\n self._graph[var_7.to][var_7.rev].cap += var_11\n return var_11\n self._iter[var_5] += 1\n return 0\n\n def func_4(self, var_23, var_22):\n var_10 = 0\n while True:\n self.bfs(var_23)\n if self._level[var_22] < 0:\n \"\"\"\"\"\"\n return var_10\n self._iter = [0] * self._node\n while True:\n var_9 = self.dfs(var_23, var_22, self._inf)\n if var_9 == 0:\n break\n var_10 += var_9\n\n\nclass Class_1:\n def __init__(self, var_17, var_18):\n \"\"\"\"\"\"\n self.len_X, self.len_Y = var_17, var_18\n self.mf = Class_3(self.len_X + self.len_Y + 2, min(self.len_X, self.len_Y))\n for var_13 in range(self.len_X):\n \"\"\"\"\"\"\n self.mf.add_edge(0, var_13 + 1, 1)\n for var_13 in range(self.len_Y):\n \"\"\"\"\"\"\n self.mf.add_edge(self.len_X + var_13 + 1, self.len_X + self.len_Y + 1, 1)\n\n def func_1(self, var_12, var_25):\n \"\"\"\"\"\"\n self.mf.add_edge(var_12 + 1, var_25 + self.len_X + 1, 1)\n\n def func_4(self):\n return self.mf.solve(0, self.len_X + self.len_Y + 1)\n\n\nvar_1 = int(eval(var_15()))\nvar_2 = []\nvar_3 = []\nfor var_13 in range(var_1):\n var_2.append([int(var_13) for var_13 in var_15().split()])\nfor var_13 in range(var_1):\n var_3.append([int(var_13) for var_13 in var_15().split()])\nvar_6 = Class_1(len(var_2), len(var_3))\nfor var_13 in range(len(var_2)):\n for var_16 in range(var_1):\n if var_2[var_13][0] < var_3[var_16][0] and var_2[var_13][1] < var_3[var_16][1]:\n var_6.add_edge(var_13, var_16)\nprint((var_6.solve()))\n", "fast_code": "var_3 = int(eval(input()))\nvar_1 = sorted(\n [[int(_) for _ in input().split()] for _ in range(var_3)],\n key=lambda var_7: var_7[1],\n reverse=True,\n)\nvar_2 = sorted([[int(_) for _ in input().split()] for _ in range(var_3)])\nvar_4 = 0\nfor var_5 in range(var_3):\n for var_6 in range(len(var_1)):\n if var_1[var_6][0] < var_2[var_5][0] and var_1[var_6][1] < var_2[var_5][1]:\n del var_1[var_6]\n var_4 += 1\n break\nprint(var_4)\n", "slow_time": 263510546, "fast_time": 57127153, "speedup": 4.6127, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_0"} -{"pair_id": "python_14321", "problem_id": "p03025", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_3():\n return [int(var_15) for var_15 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return [list(var_15) for var_15 in sys.stdin.readline().split()]\n\n\ndef func_7():\n var_14 = list(sys.stdin.readline())\n if var_14[-1] == \"\\n\":\n return var_14[:-1]\n return var_14\n\n\ndef func_2(var_11):\n return [func_1() for var_7 in range(var_11)]\n\n\ndef func_4(var_11):\n return [func_3() for var_7 in range(var_11)]\n\n\ndef func_8(var_11):\n return [func_7() for var_7 in range(var_11)]\n\n\ndef func_6(var_11):\n return [func_5() for var_7 in range(var_11)]\n\n\nsys.setrecursionlimit(1000000)\nvar_10 = 1000000007\n\n\ndef func_10():\n def func_9(var_2, var_4):\n return var_6[var_2] * var_6[var_2 - var_4] * var_8[var_4] % var_10\n\n var_11, var_2, var_4, var_5 = func_3()\n var_9 = pow(100, var_10 - 2, var_10)\n var_2 = var_2 * var_9 % var_10\n var_4 = var_4 * var_9 % var_10\n var_5 = (1 - var_5 * var_9) % var_10\n var_5 = pow(var_5, var_10 - 2, var_10)\n var_6 = [1]\n var_1 = 200000\n for var_7 in range(1, var_1 + 1):\n var_6.append(var_6[-1] * var_7 % var_10)\n var_8 = [None] * (var_1 + 1)\n var_8[var_1] = pow(var_6[var_1], var_10 - 2, var_10)\n for var_7 in range(var_1)[::-1]:\n var_8[var_7] = var_8[var_7 + 1] * (var_7 + 1) % var_10\n var_3 = 0\n var_12 = pow(var_2, var_11, var_10)\n var_13 = pow(var_4, var_11, var_10)\n for var_7 in range(var_11):\n var_3 += (\n var_8[var_11 - 1]\n * var_8[var_7]\n * var_6[var_11 + var_7]\n * pow(var_5, var_11 + var_7 + 1, var_10)\n * (var_12 * pow(var_4, var_7, var_10) + var_13 * pow(var_2, var_7, var_10))\n % var_10\n )\n var_3 %= var_10\n print(var_3)\n return\n\n\nif __name__ == \"__main__\":\n func_10()\n", "fast_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_3():\n return [int(var_16) for var_16 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return [list(var_16) for var_16 in sys.stdin.readline().split()]\n\n\ndef func_7():\n var_15 = list(sys.stdin.readline())\n if var_15[-1] == \"\\n\":\n return var_15[:-1]\n return var_15\n\n\ndef func_2(var_14):\n return [func_1() for var_10 in range(var_14)]\n\n\ndef func_4(var_14):\n return [func_3() for var_10 in range(var_14)]\n\n\ndef func_8(var_14):\n return [func_7() for var_10 in range(var_14)]\n\n\ndef func_6(var_14):\n return [func_5() for var_10 in range(var_14)]\n\n\nsys.setrecursionlimit(1000000)\nvar_13 = 1000000007\n\n\ndef func_9():\n var_14, var_2, var_4, var_5 = func_3()\n var_12 = pow(100, var_13 - 2, var_13)\n var_2 = var_2 * var_12 % var_13\n var_4 = var_4 * var_12 % var_13\n var_5 = (1 - var_5 * var_12) % var_13\n var_5 = pow(var_5, var_13 - 2, var_13)\n var_7 = [1]\n var_1 = 2 * var_14\n for var_10 in range(1, var_1 + 1):\n var_7.append(var_7[-1] * var_10 % var_13)\n var_11 = [None] * (var_1 + 1)\n var_11[var_1] = pow(var_7[var_1], var_13 - 2, var_13)\n for var_10 in range(var_1)[::-1]:\n var_11[var_10] = var_11[var_10 + 1] * (var_10 + 1) % var_13\n var_3 = 0\n var_6, var_8, var_9 = (\n pow(var_4, var_14, var_13),\n pow(var_2, var_14, var_13),\n pow(var_5, var_14 + 1, var_13),\n )\n for var_10 in range(var_14):\n var_3 += (\n var_11[var_10] * var_7[var_14 + var_10] * var_9 * (var_8 + var_6) % var_13\n )\n var_3 %= var_13\n var_6 *= var_2\n var_8 *= var_4\n var_9 *= var_5\n if var_6 >= var_13:\n var_6 %= var_13\n if var_8 >= var_13:\n var_8 %= var_13\n if var_9 >= var_13:\n var_9 %= var_13\n print((var_3 * var_11[var_14 - 1] % var_13))\n return\n\n\nif __name__ == \"__main__\":\n func_9()\n", "slow_time": 23352294045, "fast_time": 251518847, "speedup": 92.8451, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_7"} -{"pair_id": "python_9438", "problem_id": "p03030", "language": "python", "slow_code": "import sys\n\nvar_5 = sys.stdin.readline\n\n\ndef func_1(*var_2, **var_7):\n print(*var_2, file=sys.stderr, **var_7)\n\n\nfrom queue import PriorityQueue as pq\n\n\ndef func_2():\n var_9 = int(eval(var_5()))\n var_3 = {}\n for var_4 in range(1, var_9 + 1):\n var_11, var_10 = var_5().split()\n var_10 = int(var_10)\n if var_11 in var_3:\n var_3[var_11].put((-var_10, var_4))\n\n else:\n var_1 = pq()\n var_3[var_11] = var_1\n var_3[var_11].put((-var_10, var_4))\n\n func_1(var_3)\n var_8 = sorted(list(var_3.items()))\n func_1(var_8)\n\n for var_6 in var_8:\n while var_6[1].qsize():\n print((var_6[1].get())[1])\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_1 = int(eval(input()))\nvar_3 = []\nfor var_2 in range(var_1):\n var_5, var_4 = input().split(\" \")\n var_3.append([var_5, -int(var_4), var_2 + 1])\nvar_3.sort()\nfor var_5, var_4, var_2 in var_3:\n print(var_2)\n", "slow_time": 85144218, "fast_time": 28007862, "speedup": 3.04, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_20"} -{"pair_id": "python_14746", "problem_id": "p02713", "language": "python", "slow_code": "import math\nfrom functools import reduce\n\nvar_4 = int(eval(input()))\nvar_1 = 0\nfor var_2 in range(1, var_4 + 1):\n for var_3 in range(1, var_4 + 1):\n for var_5 in range(1, var_4 + 1):\n var_1 += reduce(math.gcd, [var_2, var_3, var_5])\nprint(var_1)\n", "fast_code": "import math\n\nvar_1 = int(eval(input()))\nprint(\n (\n sum(\n math.gcd(math.gcd(var_2, var_3), var_4)\n for var_2 in range(1, var_1 + 1)\n for var_3 in range(1, var_1 + 1)\n for var_4 in range(1, var_1 + 1)\n )\n )\n)\n", "slow_time": 42594352249, "fast_time": 10644114473, "speedup": 4.0017, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_0"} -{"pair_id": "python_15114", "problem_id": "p02948", "language": "python", "slow_code": "from heapq import *\n\n(var_8, var_7), *var_11 = [list(map(int, var_10.split())) for var_10 in open(0)]\nvar_9 = [0] * 7**6\nvar_12 = [[] for _ in var_9]\nvar_13 = 0\nfor var_1, var_2 in var_11:\n var_12[var_1 - 1] += [var_2]\nfor var_5 in var_12[:var_7]:\n for var_6 in var_5:\n var_4(var_9, -var_6)\n var_13 -= var_3(var_9)\nprint(var_13)\n", "fast_code": "import heapq\n\n\nclass Class_1:\n def __init__(self, var_6, var_8=False):\n if var_8:\n var_6 = [-var_4 for var_4 in var_6]\n self.sign = -1 if var_8 else 1\n self.hq = var_6\n heapq.heapify(self.hq)\n\n def func_1(self):\n return heapq.heappop(self.hq) * self.sign\n\n def func_2(self, var_4):\n heapq.heappush(self.hq, var_4 * self.sign)\n\n def func_4(self):\n return self.hq[0] * self.sign\n\n def func_3(self):\n return len(self.hq)\n\n\nvar_3, var_2 = list(map(int, input().split()))\nvar_1 = {var_9: [] for var_9 in range(1, var_2 + 1)}\nfor var_9 in range(var_3):\n var_4, var_7 = list(map(int, input().split()))\n if var_4 > var_2:\n continue\n var_1[var_4].append(var_7)\nvar_10 = Class_1([], True)\nvar_5 = 0\nfor var_4 in range(1, var_2 + 1):\n for var_7 in var_1[var_4]:\n var_10.push(var_7)\n if var_10.size() > 0:\n var_5 += var_10.pop()\nprint(var_5)\n", "slow_time": 3004564549, "fast_time": 89085164, "speedup": 33.7269, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_28"} -{"pair_id": "python_13844", "problem_id": "p02956", "language": "python", "slow_code": "import sys\n\nvar_22 = sys.stdin.readline\n\n\nclass Class_1:\n\n def __init__(self, var_21):\n self.size = var_21\n self.tree = [0] * (var_21 + 1)\n self.p = 2 ** (var_21.bit_length() - 1)\n self.dep = var_21.bit_length()\n\n def func_4(self, var_18):\n var_23 = 0\n while var_18 > 0:\n var_23 += self.tree[var_18]\n var_18 -= var_18 & -var_18\n return var_23\n\n def func_1(self, var_18, var_27):\n while var_18 <= self.size:\n self.tree[var_18] += var_27\n var_18 += var_18 & -var_18\n\n def func_2(self, var_26):\n if var_26 <= 0:\n return -1\n var_23 = 0\n var_19 = self.p\n for _ in range(self.dep):\n if var_23 + var_19 <= self.size and self.tree[var_23 + var_19] < var_26:\n var_23 += var_19\n var_26 -= self.tree[var_23 + var_19]\n var_19 //= 2\n return var_23 + 1\n\n\ndef func_3(var_5):\n var_6 = list(set(var_5))\n var_6.sort()\n var_3 = {var_26: var_19 for var_19, var_26 in enumerate(var_6)}\n return var_6, var_3\n\n\nvar_7 = 998244353\nvar_8 = int(var_22())\nvar_13 = [list(map(int, var_22().split())) for _ in range(var_8)]\nvar_13.sort()\nvar_14 = [-(10**10)]\nfor var_27, var_28 in var_13:\n var_14.append(var_28)\n_, var_4 = func_3(var_14)\nvar_13 = [(var_27, var_4[var_28]) for var_27, var_28 in var_13]\nvar_11, var_10, var_2, var_1 = (\n [None] * var_8,\n [None] * var_8,\n [None] * var_8,\n [None] * var_8,\n)\nvar_12 = Class_1(var_8)\nfor var_18 in range(var_8):\n var_19 = var_18\n var_28 = var_13[var_18][1]\n var_20 = var_12.get(var_28)\n var_11[var_18] = var_20\n var_10[var_18] = var_19 - var_20\n var_12.add(var_28, 1)\nvar_12 = Class_1(var_8)\nfor var_18 in range(var_8 - 1, -1, -1):\n var_19 = var_8 - 1 - var_18\n var_28 = var_13[var_18][1]\n var_20 = var_12.get(var_28)\n var_2[var_18] = var_20\n var_1[var_18] = var_19 - var_20\n var_12.add(var_28, 1)\nvar_9 = [1] * 1341398\nfor var_18 in range(1, len(var_9)):\n var_9[var_18] = var_9[var_18 - 1] * 2 % var_7\nvar_15 = 0\nfor var_18 in range(var_8):\n var_25 = var_11[var_18]\n var_24 = var_10[var_18]\n var_17 = var_2[var_18]\n var_16 = var_1[var_18]\n var_15 = (var_15 + var_9[var_8 - 1]) % var_7\n var_15 = (\n var_15\n + var_9[var_8 - 1 - var_25 - var_16] * (var_9[var_25] - 1) * (var_9[var_16] - 1)\n ) % var_7\n var_15 = (\n var_15\n + var_9[var_8 - 1 - var_24 - var_17] * (var_9[var_24] - 1) * (var_9[var_17] - 1)\n ) % var_7\n var_15 = (\n var_15\n - (var_9[var_24] - 1)\n * (var_9[var_17] - 1)\n * (var_9[var_25] - 1)\n * (var_9[var_16] - 1)\n ) % var_7\nprint(var_15)\n", "fast_code": "\"\"\"\"\"\"\n\n\nclass Class_1:\n def __init__(self, var_15):\n self.tree = [0] * (var_15 + 1)\n self.tree[0] = None\n\n def sum(self, var_11):\n var_19 = 0\n var_11 += 1\n while var_11 > 0:\n var_19 += self.tree[var_11]\n var_11 -= var_11 & -var_11\n return var_19\n\n def range(self, var_13, var_17):\n return sum(var_17) - sum(var_13 - 1)\n\n def func_1(self, var_11, var_21):\n var_11 += 1\n while var_11 <= var_15:\n self.tree[var_11] += var_21\n var_11 += var_11 & -var_11\n\n\nimport sys\n\nsys.setrecursionlimit(10**6)\nvar_18 = sys.stdin.readline\nvar_15 = int(eval(input()))\nvar_22 = [\n [int(var_11) for var_11 in var_18().split()] + [var_12] for var_12 in range(var_15)\n]\n\n\nvar_5 = [0] * var_15\nvar_7 = [0] * var_15\nvar_6 = [0] * var_15\nvar_1 = 998244353\nvar_20 = sorted(var_22, key=lambda var_21: var_21[1])\nvar_14 = [var_11 for var_21, var_23, var_11 in var_20]\nvar_24 = [0] * var_15\nfor var_12, var_25 in enumerate(var_14):\n var_24[var_25] = var_12\nvar_16 = [1] * (var_15 + 1)\nfor var_11 in range(var_15):\n var_16[var_11 + 1] = var_16[var_11] * 2 % var_1\nfor var_12, (var_21, var_23, var_11) in enumerate(var_20):\n var_7[var_11] = var_16[var_12] - 1 + var_16[var_15 - var_12 - 1] - 1\nvar_22.sort()\n\nvar_3 = Class_1(var_15)\nfor var_12, (var_21, var_23, var_11) in enumerate(var_22):\n var_5[var_11] = var_16[var_12] - 1 + var_16[var_15 - var_12 - 1] - 1\n var_4 = var_3.sum(var_24[var_11])\n var_6[var_11] += var_16[var_4] - 1 + var_16[var_12 - var_4] - 1\n var_3.add(var_24[var_11], 1)\nvar_3 = Class_1(var_15)\nfor var_12, (var_21, var_23, var_11) in enumerate(reversed(var_22)):\n var_4 = var_3.sum(var_24[var_11])\n var_6[var_11] += var_16[var_4] - 1 + var_16[var_12 - var_4] - 1\n var_3.add(var_24[var_11], 1)\n\nvar_2 = var_15 * (var_16[var_15] - 1) % var_1\nfor var_8, var_10, var_9 in zip(var_5, var_7, var_6):\n var_2 += -var_8 - var_10 + var_9\nprint((var_2 % var_1))\n", "slow_time": 123554763668, "fast_time": 168618463, "speedup": 732.7475, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_0"} -{"pair_id": "python_279", "problem_id": "p02954", "language": "python", "slow_code": "from functools import reduce\nfrom operator import mul\nfrom collections import Counter\nfrom collections import deque\nfrom itertools import accumulate\nfrom queue import Queue\nfrom queue import PriorityQueue as pq\nfrom heapq import heapreplace\nfrom heapq import heapify\nfrom heapq import heappushpop\nfrom heapq import heappop\nfrom heapq import heappush\nimport heapq\nimport time\nimport random\nimport bisect\nimport itertools\nimport collections\nfrom fractions import Fraction\nimport fractions\nimport string\nimport math\nimport operator\nimport functools\nimport copy\nimport array\nimport re\nimport sys\n\nsys.setrecursionlimit(500000)\nvar_8 = sys.stdin.readline\n\n\ndef func_2(*var_4, **var_9):\n print(*var_4, file=sys.stderr, **var_9)\n return\n\n\ndef func_1(var_10, var_12):\n var_12 = min(var_12, var_10 - var_12)\n var_11 = reduce(mul, list(range(var_10, var_10 - var_12, -1)), 1)\n var_6 = reduce(mul, list(range(1, var_12 + 1)), 1)\n return var_11 // var_6\n\n\ndef func_3():\n\n var_1 = var_8().strip()\n var_10 = len(var_1)\n\n var_14 = 0\n var_5 = 0\n for var_7 in range(var_10):\n if var_1[var_7] == \"R\":\n var_14 += 1\n else:\n var_5 = max(var_5, var_14)\n var_14 = 0\n for var_7 in range(var_10):\n if var_1[var_7] == \"L\":\n var_14 += 1\n else:\n var_5 = max(var_5, var_14)\n var_14 = 0\n\n var_2 = [0 for _ in range(var_10)]\n\n var_13 = 0\n\n for var_7 in range(0, var_10):\n if var_1[var_7] == \"L\":\n\n var_2[var_7 - 1] += -(-var_13 // 2)\n var_2[var_7] += var_13 // 2\n var_13 = 0\n\n else:\n var_13 += 1\n func_2(var_2)\n\n var_13 = 0\n var_3 = [0 for _ in range(var_10)]\n for var_7 in range(0, var_10)[::-1]:\n if var_1[var_7] == \"R\":\n\n var_3[var_7] += var_13 // 2\n var_3[var_7 + 1] += -(-var_13 // 2)\n var_13 = 0\n\n else:\n var_13 += 1\n func_2(var_3)\n for var_15 in [(var_2[var_7] + var_3[var_7]) for var_7 in range(var_10)]:\n print(var_15, end=\" \")\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_6 = input()\nvar_5 = len(var_6)\nvar_1 = [0 for var_2 in range(var_5)]\nvar_2 = 0\nwhile var_2 < var_5:\n var_3 = var_2\n while var_2 + 1 < var_5 and var_6[var_2] == var_6[var_2 + 1]:\n var_2 += 1\n var_4 = var_2 - var_3 + 1\n if var_6[var_2] == \"L\":\n var_1[var_3] += (var_4 + 1) // 2\n var_1[var_3 - 1] += var_4 // 2\n else:\n var_1[var_2] += (var_4 + 1) // 2\n var_1[var_2 + 1] += var_4 // 2\n var_2 += 1\nfor var_2 in range(var_5):\n print(var_1[var_2], end=\" \")\nprint()\n", "slow_time": 155165694, "fast_time": 49909263, "speedup": 3.109, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_19"} -{"pair_id": "python_10598", "problem_id": "p02982", "language": "python", "slow_code": "from numpy import *\n\nvar_5, *var_7 = [var_2(var_6.split()) for var_6 in open(0)]\nprint(\n (\n sum(\n var_3 == int(var_3)\n for var_1 in var_7\n for var_3 in map(var_4.norm, var_1 - var_7)\n )\n - var_5[0]\n >> 1\n )\n)\n", "fast_code": "var_11, var_4 = list(map(int, input().split()))\nvar_13 = [list(map(int, input().split())) for _ in range(var_11)]\n\n\ndef func_1(var_1, var_3):\n var_12 = 0\n for var_6, var_7 in zip(var_1, var_3):\n var_12 += (var_6 - var_7) ** 2\n return var_12**0.5\n\n\nvar_2 = 0\nfor var_8 in range(var_11):\n for var_9 in range(var_8 + 1, var_11):\n var_5 = func_1(var_13[var_8], var_13[var_9])\n for var_10 in range(int(16000**0.5) + 1):\n if var_10 == var_5:\n var_2 += 1\n break\nprint(var_2)\n", "slow_time": 7103541835, "fast_time": 36405830, "speedup": 195.121, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_6"} -{"pair_id": "python_975", "problem_id": "p03329", "language": "python", "slow_code": "var_2 = int(eval(input()))\nvar_6 = [1]\nvar_4 = 1\nwhile True:\n var_4 *= 6\n if var_4 <= 100000:\n var_6.append(var_4)\n else:\n break\nvar_4 = 1\nwhile True:\n var_4 *= 9\n if var_4 <= 100000:\n var_6.append(var_4)\n else:\n break\nvar_1 = len(var_6)\nvar_3 = [[10**9 for _ in range(var_2 + 1)] for _ in range(var_1 + 1)]\nfor var_4 in range(var_1 + 1):\n var_3[var_4][0] = 0\nfor var_4 in range(1, var_1 + 1):\n for var_5 in range(var_2 + 1):\n if var_5 - var_6[var_4 - 1] >= 0:\n var_3[var_4][var_5] = min(\n var_3[var_4][var_5 - var_6[var_4 - 1]] + 1, var_3[var_4 - 1][var_5]\n )\n else:\n var_3[var_4][var_5] = var_3[var_4 - 1][var_5]\nprint((var_3[var_1][var_2]))\n", "fast_code": "var_8 = [6**var_4 for var_4 in range(1, 7)][::-1]\nvar_6 = [9**var_4 for var_4 in range(1, 6)][::-1]\nvar_1 = int(eval(input()))\nvar_3 = []\n\n\ndef func_1(var_5, var_2):\n if var_5 < 6:\n var_3.append(var_5 + var_2)\n return\n for var_7 in var_8:\n if var_7 <= var_5:\n func_1(var_5 - var_7, var_2 + 1)\n break\n for var_7 in var_6:\n if var_7 <= var_5:\n func_1(var_5 - var_7, var_2 + 1)\n break\n\n\nfunc_1(var_1, 0)\nprint((min(var_3)))\n", "slow_time": 753107630, "fast_time": 102135516, "speedup": 7.3736, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_25"} -{"pair_id": "python_12578", "problem_id": "p02703", "language": "python", "slow_code": "var_2, var_1, var_3 = list(map(int, input().split()))\nfrom heapq import heappop, heappush\n\nvar_13 = 10**18\nvar_7 = [[] for _ in range(var_2)]\nvar_10 = []\nfor _ in range(var_1):\n var_19, var_20, var_4, var_5 = list(map(int, input().split()))\n var_19, var_20 = var_19 - 1, var_20 - 1\n var_7[var_19].append((var_20, var_4, var_5))\n var_7[var_20].append((var_19, var_4, var_5))\nfor _ in range(var_2):\n var_6, var_8 = list(map(int, input().split()))\n var_10.append((var_6, var_8))\nvar_9 = [var_13] * 2451 * var_2\nif var_3 > 2450:\n var_3 = 2450\nvar_9[var_3] = 0\nvar_11 = [(0, var_3)]\nwhile var_11:\n var_17, var_20 = heappop(var_11)\n var_19 = var_20 // 2451\n var_16 = var_20 % 2451\n for var_22, var_4, var_5 in var_7[var_19]:\n if var_16 >= var_4:\n var_21 = var_22 * 2451 + var_16 - var_4\n var_18 = var_17 + var_5\n if var_18 < var_9[var_21]:\n var_9[var_21] = var_18\n heappush(var_11, (var_18, var_21))\n var_6, var_8 = var_10[var_19]\n if var_16 + var_6 > 2450:\n var_6 = 2450 - var_16\n var_21 = var_20 + var_6\n var_18 = var_17 + var_8\n if var_18 < var_9[var_21]:\n var_9[var_21] = var_18\n heappush(var_11, (var_18, var_21))\nfor var_12 in range(1, var_2):\n var_15 = var_9[var_12 * 2451]\n for var_14 in range(1, 2451):\n var_15 = min(var_15, var_9[var_12 * 2451 + var_14])\n print(var_15)\n", "fast_code": "from heapq import heappop, heappush\nimport sys\n\n\ndef func_1():\n return sys.stdin.readline().strip()\n\n\ndef func_2():\n var_4, var_2, var_5 = list(map(int, func_1().split()))\n var_21 = [{} for _ in range(var_4)]\n for _ in range(var_2):\n var_22, var_23, var_6, var_7 = list(map(int, func_1().split()))\n var_22 -= 1\n var_23 -= 1\n var_21[var_22][var_23] = (var_6, var_7)\n var_21[var_23][var_22] = (var_6, var_7)\n var_10 = tuple(tuple(map(int, func_1().split())) for _ in range(var_4))\n var_3 = 50 * (var_4 - 1)\n var_1 = 10**18\n\n var_24 = [[False] * (var_3 + 1) for _ in range(var_4)]\n var_8 = [[var_1] * (var_3 + 1) for _ in range(var_4)]\n var_15 = []\n var_5 = min(var_5, var_3)\n heappush(var_15, (0, 0, var_5))\n while var_15:\n var_19, var_11, var_18 = heappop(var_15)\n if var_24[var_11][var_18]:\n continue\n var_24[var_11][var_18] = True\n var_8[var_11][var_18] = var_19\n\n for var_14, (var_6, var_7) in list(var_21[var_11].items()):\n var_13 = var_19 + var_7\n var_17 = var_18 - var_6\n if var_17 >= 0:\n if var_8[var_14][var_17] <= var_13:\n continue\n heappush(var_15, (var_13, var_14, var_17))\n\n var_16, var_20 = var_10[var_11]\n var_13 = var_19 + var_20\n var_12 = min(var_18 + var_16, var_3)\n heappush(var_15, (var_13, var_11, var_12))\n for var_9 in range(1, var_4):\n print((min(var_8[var_9])))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "slow_time": 10331630633, "fast_time": 530435775, "speedup": 19.4776, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_19"} -{"pair_id": "python_2754", "problem_id": "p02630", "language": "python", "slow_code": "var_6 = int(eval(input())) + 1\nvar_1 = list(map(int, input().split()))\nvar_4 = []\nfor var_5 in range(100005):\n var_4.append(0)\nvar_8 = 0\nfor var_5 in var_1:\n var_4[var_5] += 1\nfor var_5 in range(100005):\n var_8 += var_5 * var_4[var_5]\nvar_7 = int(eval(input()))\nfor var_5 in range(var_7):\n var_2, var_3 = list(map(int, input().split()))\n var_8 += (var_3 - var_2) * var_4[var_2]\n var_4[var_3] += var_4[var_2]\n var_4[var_2] = 0\n print(var_8)\n", "fast_code": "import collections\n\nvar_5 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_11 = collections.Counter(var_1)\nvar_6 = int(eval(input()))\n\nvar_8 = 0\nfor var_10 in var_11:\n var_8 += var_10 * var_11[var_10]\n\nvar_9 = 0\nvar_7 = []\nfor var_10 in range(var_6):\n var_2, var_4 = list(map(int, input().split()))\n if var_2 in var_11:\n\n var_3 = var_11[var_2]\n\n if var_4 in var_11:\n var_11[var_4] += var_11[var_2]\n var_11.pop(var_2)\n else:\n var_11[var_4] = var_11[var_2]\n var_11.pop(var_2)\n\n var_9 += var_3 * (var_4 - var_2)\n var_7.append(var_8 + var_9)\n else:\n var_7.append(var_8 + var_9)\nfor var_10 in var_7:\n print(var_10)\n", "slow_time": 10432204049, "fast_time": 65322203, "speedup": 159.7038, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_3"} -{"pair_id": "python_317", "problem_id": "p03164", "language": "python", "slow_code": "import numpy as np\n\nvar_1, var_2 = list(map(int, input().split()))\nvar_4 = np.full(var_1 * 10**3 + 1, var_2 + 1, dtype=np.int64)\nvar_4[0] = 0\nfor var_5 in range(var_1):\n var_7, var_6 = list(map(int, input().split()))\n np.minimum(var_4[:-var_6] + var_7, var_4[var_6:], out=var_4[var_6:])\nfor var_5 in range(var_1 * 10**3 + 1):\n if var_4[var_5] <= var_2:\n var_3 = var_5\nprint(var_3)\n", "fast_code": "import sys\nimport numpy as np\n\nvar_1, var_2 = list(map(int, input().split()))\nvar_4 = iter(map(int, sys.stdin.read().split()))\nvar_3 = np.full(var_1 * 1000 + 1, 10**10, dtype=np.int64)\nvar_3[0] = 0\nfor var_6, var_5 in zip(var_4, var_4):\n np.minimum(var_3[:-var_5] + var_6, var_3[var_5:], out=var_3[var_5:])\nprint((((var_3 <= var_2) * np.arange(var_1 * 1000 + 1)).max()))\n", "slow_time": 375298992, "fast_time": 47776051, "speedup": 7.8554, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_26"} -{"pair_id": "python_3750", "problem_id": "p02731", "language": "python", "slow_code": "import scipy.optimize\n\nvar_1 = int(eval(input()))\nvar_2 = lambda var_4: -1 * (var_4[0] * var_4[1] * (var_1 - var_4[0] - var_4[1]))\nvar_3 = scipy.optimize.minimize(\n var_2, (0.1, 0.2), bounds=((0, None), (0, None)), tol=1e-6\n)\nprint((-1 * var_3.fun))\n", "fast_code": "from decimal import *\n\nvar_2 = int(eval(input()))\nprint(((var_1(var_2) / var_1(3)) ** var_1(3)))\n", "slow_time": 38579398487, "fast_time": 15660887, "speedup": 2463.4236, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_23"} -{"pair_id": "python_14514", "problem_id": "p02669", "language": "python", "slow_code": "def func_1():\n from collections import defaultdict, deque\n\n var_13 = 10**27\n var_6 = int(eval(input()))\n for _ in range(var_6):\n var_5, var_1, var_2, var_3, var_4 = list(map(int, input().split()))\n var_12 = deque()\n var_12.append((0, var_5))\n var_9 = defaultdict(lambda: var_13)\n var_7 = var_5 * var_4 + 1\n while var_12:\n var_10, var_17 = var_12.popleft()\n if var_10 >= var_7:\n continue\n if var_10 >= var_9[var_17]:\n continue\n var_9[var_17] = var_10\n\n var_7 = min(var_7, var_10 + var_17 * var_4)\n for var_11, var_8 in ((2, var_1), (3, var_2), (5, var_3)):\n\n var_15, var_16 = divmod(var_17, var_11)\n var_14 = var_10 + var_16 * var_4 + var_8\n if var_9[var_15] > var_14:\n var_12.append((var_14, var_15))\n var_14 = var_10 + (var_11 - var_16) * var_4 + var_8\n if (var_16 > 0) and (var_9[var_15 + 1] > var_14):\n var_12.append((var_14, var_15 + 1))\n print(var_7)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "def func_1():\n from heapq import heappush, heappop\n\n var_6 = int(eval(input()))\n for _ in range(var_6):\n var_5, var_1, var_2, var_3, var_4 = list(map(int, input().split()))\n var_12 = [(0, var_5)]\n var_9 = set()\n var_7 = var_5 * var_4 + 1\n while var_12:\n var_10, var_15 = heappop(var_12)\n if var_10 >= var_7:\n continue\n if var_15 in var_9:\n continue\n var_9.add(var_15)\n\n if var_7 > var_10 + var_15 * var_4:\n var_7 = var_10 + var_15 * var_4\n for var_11, var_8 in ((2, var_1), (3, var_2), (5, var_3)):\n\n var_13, var_14 = divmod(var_15, var_11)\n if var_13 not in var_9:\n heappush(var_12, (var_10 + var_14 * var_4 + var_8, var_13))\n if (var_13 + 1) not in var_9:\n heappush(\n var_12, (var_10 + (var_11 - var_14) * var_4 + var_8, var_13 + 1)\n )\n print(var_7)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 115167925158, "fast_time": 26326923406, "speedup": 4.3745, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_5"} -{"pair_id": "python_6608", "problem_id": "p02243", "language": "python", "slow_code": "from sys import maxsize\nfrom heapq import heappop, heappush\n\n\nclass Class_1:\n var_3 = 0\n var_2 = 1\n var_1 = 2\n\n def __init__(self):\n self.adjs = []\n self.color = Class_1.WHITE\n self.dist = maxsize\n\n def __lt__(self, var_12):\n return self.dist < var_12.dist\n\n def __repr__(self):\n return \"Node({},{},{})\".format(self.adjs, self.color, self.dist)\n\n\ndef func_3():\n var_10 = int(eval(input()))\n var_11 = [Class_1() for _ in range(var_10)]\n for var_7 in range(var_10):\n var_14, _, *var_13 = [int(var_15) for var_15 in input().split()]\n for var_7 in range(0, len(var_13) - 1, 2):\n var_11[var_14].adjs.append((var_13[var_7], var_13[var_7 + 1]))\n return var_11\n\n\ndef func_4(var_11):\n var_6 = []\n var_11[0].dist = 0\n var_11[0].color = Class_1.GRAY\n heappush(var_6, (0, 0))\n while len(var_6) > 0:\n var_8, var_9 = heappop(var_6)\n var_11[var_9].color = Class_1.BLACK\n if var_11[var_9].dist < var_8:\n continue\n for var_4, var_5 in var_11[var_9].adjs:\n if var_11[var_4].color == Class_1.BLACK:\n continue\n if var_11[var_9].dist + var_5 < var_11[var_4].dist:\n var_11[var_4].dist = var_11[var_9].dist + var_5\n var_11[var_4].color = Class_1.GRAY\n heappush(var_6, (var_11[var_4].dist, var_4))\n\n\ndef func_2(var_11):\n for var_14, var_10 in enumerate(var_11):\n print((var_14, var_10.dist))\n\n\ndef func_1():\n var_11 = func_3()\n func_4(var_11)\n func_2(var_11)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "from heapq import *\n\nvar_3 = float(\"inf\")\n\n\ndef func_1():\n var_10 = int(eval(input()))\n var_1 = [[]] * var_10\n for _ in range(var_10):\n var_6 = list(map(int, input().split()))\n var_1[var_6[0]] = list(zip(var_6[2::2], var_6[3::2]))\n var_5 = [0] + [var_3] * var_10\n var_2 = [(0, 0)]\n while var_2:\n var_12 = var_7(var_2)[1]\n for var_13, var_4 in var_1[var_12]:\n var_11 = var_5[var_12] + var_4\n if var_5[var_13] > var_11:\n var_5[var_13] = var_11\n var_8(var_2, (var_11, var_13))\n for var_9 in range(var_10):\n print((var_9, var_5[var_9]))\n\n\nfunc_1()\n", "slow_time": 136137364, "fast_time": 60476738, "speedup": 2.2511, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_17"} -{"pair_id": "python_6702", "problem_id": "p02817", "language": "python", "slow_code": "import sys\n\nvar_1, var_2 = input().split()\nif not (var_1.islower() and var_2.islower()):\n sys.exit()\nif not (1 <= len(var_1) <= 100 and 1 <= len(var_1) <= 100):\n sys.exit()\nprint(var_2, var_1, sep=\"\")\n", "fast_code": "var_1, var_2 = list(map(str, input().split()))\nprint((var_2 + var_1))\n", "slow_time": 21383088, "fast_time": 9247771, "speedup": 2.3122, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_2"} -{"pair_id": "python_2776", "problem_id": "p02577", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_1 = func_3()\nprint((\"Yes\" if sum(var_1) % 9 == 0 else \"No\"))\n", "fast_code": "print((\"YNeos\"[int(eval(input())) % 9 != 0 :: 2]))\n", "slow_time": 55150974, "fast_time": 10267360, "speedup": 5.3715, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_23"} -{"pair_id": "python_10933", "problem_id": "p02570", "language": "python", "slow_code": "def func_2():\n return list(map(int, input().split()))\n\n\ndef func_1():\n return int(input())\n\n\ndef func_10():\n return print(\"Yes\")\n\n\ndef func_6():\n return print(\"No\")\n\n\nclass Class_1:\n \"\"\"\"\"\"\n\n def __init__(self, var_9, var_6=10**9 + 7):\n self.mod = var_6\n self.modinv = self.make_modinv_list(var_9)\n self.fac, self.facinv = self.make_factorial_list(var_9)\n\n def __call__(self, var_8, var_10):\n return (\n self.fac[var_8]\n * self.facinv[var_10]\n % self.mod\n * self.facinv[var_8 - var_10]\n % self.mod\n )\n\n def func_4(self, var_8):\n\n var_3 = [1]\n var_4 = [1]\n for var_5 in range(1, var_8 + 1):\n var_3.append(var_3[var_5 - 1] * var_5 % self.mod)\n var_4.append(var_4[var_5 - 1] * self.modinv[var_5] % self.mod)\n return var_3, var_4\n\n def func_5(self, var_8):\n\n var_7 = [0] * (var_8 + 1)\n var_7[1] = 1\n for var_5 in range(2, var_8 + 1):\n var_7[var_5] = (\n self.mod - self.mod // var_5 * var_7[self.mod % var_5] % self.mod\n )\n return var_7\n\n\nclass Class_2:\n def __init__(self, var_1):\n self.p = list(range(var_1))\n self.rank = [0] * var_1\n self.size = [1] * var_1\n\n def func_7(self, var_15):\n if self.p[var_15] != var_15:\n self.p[var_15] = self.root(self.p[var_15])\n return self.p[var_15]\n\n def func_8(self, var_15, var_16):\n return self.root(var_15) == self.root(var_16)\n\n def func_9(self, var_15, var_16):\n var_13 = self.root(var_15)\n var_14 = self.root(var_16)\n if var_13 == var_14:\n return\n if self.rank[var_13] < self.rank[var_14]:\n self.p[var_13] = var_14\n self.size[var_14] += self.size[var_13]\n self.size[var_13] = 0\n else:\n self.p[var_14] = var_13\n self.size[var_13] += self.size[var_14]\n self.size[var_14] = 0\n if self.rank[var_13] == self.rank[var_14]:\n self.rank[var_13] += 1\n\n def func_3(self, var_15):\n return self.size[self.root(var_15)]\n\n\nvar_2, var_12, var_11 = func_2()\nif var_2 <= var_12 * var_11:\n func_10()\nelse:\n func_6()\n", "fast_code": "import sys\n\nvar_3 = sys.stdin.read\nvar_4 = sys.stdin.readlines\nfrom collections import Counter\n\n\ndef func_1():\n var_1, var_6, var_5 = list(map(int, input().split()))\n var_2 = var_5 * var_6\n if var_1 > var_2:\n print(\"No\")\n else:\n print(\"Yes\")\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 135027021, "fast_time": 21173017, "speedup": 6.3773, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_29"} -{"pair_id": "python_226", "problem_id": "p03240", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_6 = [list(map(int, input().split())) for var_10 in range(var_4)]\nvar_6.sort(key=lambda var_11: var_11[2], reverse=1)\nfor var_1 in range(101):\n for var_2 in range(101):\n var_3 = var_6[0][2] + abs(var_6[0][0] - var_1) + abs(var_6[0][1] - var_2)\n var_8 = 0\n for var_5, var_7, var_9 in var_6:\n if var_9 == max(var_3 - abs(var_5 - var_1) - abs(var_7 - var_2), 0):\n var_8 += 1\n if var_8 == var_4:\n print((var_1, var_2, var_3))\n break\n", "fast_code": "import math\n\nvar_7 = int(eval(input()))\nvar_9 = [0 for var_3 in range(var_7)]\nvar_10 = [0 for var_3 in range(var_7)]\nvar_2 = [0 for var_3 in range(var_7)]\nvar_5 = False\nfor var_3 in range(var_7):\n var_9[var_3], var_10[var_3], var_2[var_3] = list(map(int, input().split()))\nfor var_3 in range(0, 101):\n for var_4 in range(0, 101):\n for var_6 in range(0, var_7):\n if var_2[var_6] != 0:\n var_8 = (\n var_2[var_6]\n + int(math.fabs(var_9[var_6] - var_3))\n + int(math.fabs(var_10[var_6] - var_4))\n )\n break\n var_5 = True\n for var_6 in range(var_7):\n var_1 = max(\n var_8\n - int(math.fabs(var_9[var_6] - var_3))\n - int(math.fabs(var_10[var_6] - var_4)),\n 0,\n )\n if var_2[var_6] != var_1:\n var_5 = False\n break\n\n if var_5 is True:\n break\n if var_5 is True:\n break\nprint((\"{} {} {}\".format(var_3, var_4, var_8)))\n", "slow_time": 9772291562, "fast_time": 1605296145, "speedup": 6.0875, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_19"} -{"pair_id": "python_11946", "problem_id": "p02716", "language": "python", "slow_code": "var_7 = int(eval(input()))\nvar_5 = list(map(int, input().split()))\nvar_1 = [0]\nvar_2 = [0]\nfor var_6 in range(var_7):\n if var_6 % 2 == 0:\n var_1.append(var_1[-1] + var_5[var_6])\n var_2.append(var_2[-1] + 0)\n else:\n var_1.append(var_1[-1] + 0)\n var_2.append(var_2[-1] + var_5[var_6])\nif var_7 % 2 == 0:\n var_4 = max(var_1[var_7 - 1] - var_1[0], var_2[var_7] - var_2[1])\n for var_6 in range(1, var_7 + 1, 2):\n if var_6 + 3 > var_7:\n continue\n var_8 = (var_1[var_6] - var_1[0]) + (var_2[var_7] - var_2[var_6 + 2])\n var_4 = max(var_4, var_8)\nelse:\n var_4 = max(\n var_1[var_7 - 2] - var_1[0],\n var_2[var_7 - 1] - var_2[1],\n var_1[var_7] - var_1[2],\n )\n for var_6 in range(1, var_7 + 1, 2):\n if var_6 + 3 > var_7 - 1:\n continue\n var_8 = (var_1[var_6] - var_1[0]) + (var_2[var_7 - 1] - var_2[var_6 + 2])\n var_4 = max(var_4, var_8)\n for var_6 in range(2, var_7 + 1, 2):\n if var_6 + 3 > var_7:\n continue\n var_8 = (var_2[var_6] - var_2[1]) + (var_1[var_7] - var_1[var_6 + 2])\n var_4 = max(var_4, var_8)\n for var_6 in range(1, var_7 + 1, 2):\n if var_6 + 4 > var_7:\n continue\n var_8 = (var_1[var_6] - var_1[0]) + (var_1[var_7] - var_1[var_6 + 3])\n var_4 = max(var_4, var_8)\n var_3 = [-(10**18)]\n for var_6 in range(1, var_7 + 1):\n if var_6 + 2 > var_7:\n var_3.append(-(10**18))\n else:\n if var_6 % 2 == 0:\n var_3.append(var_2[var_6] + var_1[var_7] - var_1[var_6 + 2])\n else:\n var_3.append(-(10**18))\n for var_6 in range(var_7 - 1, -1, -1):\n var_3[var_6] = max(var_3[var_6], var_3[var_6 + 1])\n for var_6 in range(1, var_7 + 1, 2):\n if var_6 + 6 > var_7:\n continue\n var_8 = (var_1[var_6] - var_1[0] - var_2[var_6 + 2]) + var_3[var_6 + 3]\n var_4 = max(var_4, var_8)\nprint(var_4)\n", "fast_code": "var_4, *var_3 = list(map(int, open(0).read().split()))\nvar_5 = [0] * var_4\nvar_1 = var_5[:]\nfor var_2, var_3 in enumerate(var_3):\n var_5[var_2] = var_3 + var_5[var_2 - 2]\n var_1[var_2] = max(var_3 + var_1[var_2 - 2], [var_1, var_5][var_2 & 1][var_2 - 1])\nprint((var_1[-1]))\n", "slow_time": 152776680, "fast_time": 39888181, "speedup": 3.8301, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_2"} -{"pair_id": "python_16676", "problem_id": "p03147", "language": "python", "slow_code": "var_6 = int(eval(input()))\nvar_4 = list(map(int, input().split()))\nvar_1 = [0] * var_6\nvar_2 = 0\nwhile True:\n var_3 = 0\n for var_5 in range(var_6):\n if var_4[var_5] > var_1[var_5]:\n var_1[var_5] += 1\n var_3 = 1\n elif var_4[var_5] == var_1[var_5] and var_3:\n break\n if var_3:\n var_2 += 1\n else:\n break\nprint(var_2)\n", "fast_code": "import sys\n\n\ndef func_1():\n return sys.stdin.readline().strip()\n\n\ndef func_2():\n var_4 = int(eval(func_1()))\n var_3 = list(map(int, func_1().split()))\n var_1 = var_3[0]\n\n for var_2 in range(len(var_3) - 1):\n var_1 += max(var_3[var_2 + 1] - var_3[var_2], 0)\n print(var_1)\n\n\nfunc_2()\n", "slow_time": 181348086, "fast_time": 32372969, "speedup": 5.6018, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_27"} -{"pair_id": "python_12688", "problem_id": "p02703", "language": "python", "slow_code": "import sys\nfrom heapq import heapify, heappop, heappush\n\nvar_24 = lambda: sys.stdin.readline().rstrip()\nvar_16 = lambda: int(var_24())\nvar_18 = lambda: list(map(int, var_24().split()))\n\nvar_5, var_4, var_6 = var_18()\nvar_7 = [var_18() for _ in range(var_4)]\nvar_2 = [var_18() for _ in range(var_5)]\nvar_1 = 0\nfor var_15 in range(var_4):\n var_8 = var_7[var_15][2]\n if var_8 > var_1:\n var_1 = var_8\nvar_17 = var_1 * (var_5 - 1)\nvar_6 = min(var_6, var_17)\nvar_14 = [[] for _ in range(var_5 + 1)]\nfor var_28, var_29, var_8, var_10 in var_7:\n var_14[var_28].append((var_29, var_8, var_10))\n var_14[var_29].append((var_28, var_8, var_10))\n\n\ndef func_1(var_25):\n\n var_3 = 10**15\n var_13 = [[var_3 for _ in range(var_17 + 1)] for _ in range(var_5 + 1)]\n var_13[1][var_6] = 0\n var_21 = [(0, var_6, 1)]\n while var_21:\n var_27, var_23, var_20 = heappop(var_21)\n if var_13[var_20][var_23] < var_27:\n continue\n for var_19, var_8, var_10 in var_14[var_20]:\n var_26 = var_27 + var_10\n var_22 = var_23 - var_8\n if var_22 < 0:\n continue\n if var_13[var_19][var_22] > var_26:\n var_13[var_19][var_22] = var_26\n heappush(var_21, (var_26, var_22, var_19))\n var_11, var_12 = var_2[var_20 - 1]\n var_22 = min(var_17, var_23 + var_11)\n while var_13[var_20][var_22] > var_27 + var_12:\n var_13[var_20][var_22] = var_27 + var_12\n heappush(var_21, (var_27 + var_12, var_22, var_20))\n var_22 += var_11\n var_22 = min(var_17, var_22)\n var_27 += var_12\n return var_13\n\n\nvar_13 = func_1(1)\nfor var_15 in range(2, var_5 + 1):\n var_12 = var_13[var_15]\n var_9 = min(var_12)\n print(var_9)\n", "fast_code": "import sys\n\nvar_12 = lambda: sys.stdin.readline().rstrip()\nimport heapq\n\nvar_10 = []\nheapq.heapify(var_10)\nvar_16, var_14, var_18 = list(map(int, var_12().split()))\nvar_1, var_3 = [[None] * var_14 for _ in range(2)]\nvar_4, var_6 = [[None] * var_16 for _ in range(2)]\nvar_17 = {var_22: [] for var_22 in range(var_16)}\nvar_23 = {}\nfor var_11 in range(var_14):\n var_22, var_24, var_1[var_11], var_3[var_11] = list(map(int, var_12().split()))\n var_17[var_22 - 1].append(var_24 - 1)\n var_17[var_24 - 1].append(var_22 - 1)\n var_23[var_22 - 1, var_24 - 1] = var_11\n var_23[var_24 - 1, var_22 - 1] = var_11\nfor var_11 in range(var_16):\n var_4[var_11], var_6[var_11] = list(map(int, var_12().split()))\nvar_15 = max(var_1) * (var_16 - 1)\nvar_18 = min(var_18, var_15)\nvar_21 = (0, 0, var_18)\nvar_2 = [[None] * (var_15 + 1) for _ in range(var_16)]\nvar_2[0][var_18] = 0\nvar_8 = [[None] * (var_15 + 1) for _ in range(var_16)]\nheapq.heappush(var_10, var_21)\nvar_5 = 0\nwhile var_10:\n var_5 += 1\n var_7, var_22, var_19 = heapq.heappop(var_10)\n\n if var_8[var_22][var_19]:\n continue\n var_8[var_22][var_19] = True\n\n for var_24 in var_17[var_22]:\n var_9 = var_23[var_22, var_24]\n if var_19 < var_1[var_9] or var_8[var_24][var_19 - var_1[var_9]]:\n continue\n var_2[var_24][var_19 - var_1[var_9]] = (\n min(var_2[var_24][var_19 - var_1[var_9]], var_7 + var_3[var_9])\n if var_2[var_24][var_19 - var_1[var_9]] is not None\n else var_7 + var_3[var_9]\n )\n\n heapq.heappush(var_10, (var_7 + var_3[var_9], var_24, var_19 - var_1[var_9]))\n\n if var_19 + var_4[var_22] <= var_15:\n var_20 = var_19 + var_4[var_22]\n elif var_19 < var_15:\n var_20 = var_15\n else:\n continue\n heapq.heappush(var_10, (var_7 + var_6[var_22], var_22, var_20))\n\n var_2[var_22][var_20] = (\n min(var_2[var_22][var_20], var_7 + var_6[var_22])\n if var_2[var_22][var_20] is not None\n else var_7 + var_6[var_22]\n )\nfor var_13 in var_2[1:]:\n print((min(var_13)))\n", "slow_time": 6039274323, "fast_time": 868924146, "speedup": 6.9503, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_14"} -{"pair_id": "python_6679", "problem_id": "p03275", "language": "python", "slow_code": "import math\n\nvar_15 = int(input())\nvar_11 = list(map(int, input().split()))\n\n\nclass Class_1:\n def __init__(self, var_15):\n self.size = var_15\n self.tree = [0] * (var_15 + 1)\n\n def func_3(self, var_7):\n var_16 = 0\n while var_7 > 0:\n var_16 += self.tree[var_7]\n var_7 -= var_7 & -var_7\n return var_16\n\n def func_1(self, var_7, var_19):\n while var_7 <= self.size:\n self.tree[var_7] += var_19\n var_7 += var_7 & -var_7\n\n\ndef func_2(var_19, var_11, var_15):\n var_9 = len(var_11)\n var_2 = (var_9 * (var_9 - 1) // 2) + var_9\n var_14 = [-1 if var_7 < var_19 else 1 for var_7 in var_11]\n var_12 = []\n var_1 = 0\n for var_7 in var_14:\n var_1 += var_7\n var_12.append(var_1)\n var_4 = Class_1(var_15)\n var_13 = {var_3: var_7 for var_7, var_3 in enumerate(sorted(var_12), start=1)}\n var_5 = 0\n for var_8, var_3 in enumerate(var_12):\n var_5 += var_4.sum(var_13[var_3]) + (var_3 >= 0)\n var_4.add(var_13[var_3], 1)\n if var_5 >= math.ceil(var_2 / 2):\n return True\n else:\n return False\n\n\nvar_17 = sorted(var_11)\nvar_10 = 0\nvar_6 = len(var_11) - 1\nwhile var_6 - var_10 > 1:\n var_18 = (var_10 + var_6) // 2\n var_7 = var_17[var_18]\n if func_2(var_7, var_11, var_15):\n var_10 = var_18\n else:\n var_6 = var_18\nprint(var_17[var_6]) if func_2(var_17[var_6], var_11, var_15) else print(var_17[var_10])\n", "fast_code": "def func_1(var_9, var_3):\n var_13 = list(sorted(set(var_3)))\n var_11 = var_9 * (var_9 + 1) // 2 // 2\n var_10 = var_9 * 2 + 1\n var_1 = 0\n var_2 = len(var_13)\n while var_2 > var_1 + 1:\n var_7 = (var_1 + var_2) // 2\n var_14 = var_13[var_7]\n var_5 = [0] * var_10\n var_6 = 0\n var_5[var_6] = 1\n var_8 = 0\n var_12 = 0\n for var_4 in var_3:\n if var_4 >= var_14:\n var_6 += 1\n var_12 += var_5[var_6] + 1\n else:\n var_6 -= 1\n var_12 -= var_5[var_6 + 1] - 1\n var_5[var_6] += 1\n var_8 += var_12\n if var_8 >= var_11:\n var_1 = var_7\n break\n else:\n var_2 = var_7\n print((var_13[var_1]))\n\n\nvar_9 = int(eval(input()))\nvar_3 = list(map(int, input().split()))\nfunc_1(var_9, var_3)\n", "slow_time": 61689419, "fast_time": 30474431, "speedup": 2.0243, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_7"} -{"pair_id": "python_6669", "problem_id": "p00483", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys\nfrom sys import stdin\n\nvar_9 = stdin.readline\n\n\ndef func_2(var_2, var_3, var_1, var_8):\n var_6 = [[0] * (var_3 + 1) for _ in range(var_2 + 1)]\n var_7 = [[0] * (var_3 + 1) for _ in range(var_2 + 1)]\n var_5 = [[0] * (var_3 + 1) for _ in range(var_2 + 1)]\n for var_18 in range(var_2):\n var_13 = [0] * (var_3 + 1)\n var_14 = [0] * (var_3 + 1)\n var_12 = [0] * (var_3 + 1)\n for var_15 in range(var_3):\n var_10 = var_8[var_18][var_15]\n if var_10 == \"J\":\n var_13[var_15 + 1] = var_13[var_15] + 1\n var_14[var_15 + 1] = var_14[var_15]\n var_12[var_15 + 1] = var_12[var_15]\n elif var_10 == \"O\":\n var_13[var_15 + 1] = var_13[var_15]\n var_14[var_15 + 1] = var_14[var_15] + 1\n var_12[var_15 + 1] = var_12[var_15]\n else:\n var_13[var_15 + 1] = var_13[var_15]\n var_14[var_15 + 1] = var_14[var_15]\n var_12[var_15 + 1] = var_12[var_15] + 1\n for var_15 in range(1, var_3 + 1):\n var_6[var_18 + 1][var_15] = var_6[var_18][var_15] + var_13[var_15]\n var_7[var_18 + 1][var_15] = var_7[var_18][var_15] + var_14[var_15]\n var_5[var_18 + 1][var_15] = var_5[var_18][var_15] + var_12[var_15]\n for _ in range(var_1):\n var_11 = [0, 0, 0]\n var_19, var_16, var_20, var_17 = list(map(int, var_9().split()))\n var_11[0] = (\n var_6[var_20][var_17]\n - var_6[var_19 - 1][var_17]\n - var_6[var_20][var_16 - 1]\n + var_6[var_19 - 1][var_16 - 1]\n )\n var_11[1] = (\n var_7[var_20][var_17]\n - var_7[var_19 - 1][var_17]\n - var_7[var_20][var_16 - 1]\n + var_7[var_19 - 1][var_16 - 1]\n )\n var_11[2] = (\n var_5[var_20][var_17]\n - var_5[var_19 - 1][var_17]\n - var_5[var_20][var_16 - 1]\n + var_5[var_19 - 1][var_16 - 1]\n )\n print((\" \".join(map(str, var_11))))\n\n\ndef func_3(var_2, var_3, var_1, var_8):\n var_6 = [[0] * (var_3 + 1) for _ in range(var_2 + 1)]\n var_7 = [[0] * (var_3 + 1) for _ in range(var_2 + 1)]\n for var_18 in range(var_2):\n var_13 = [0] * (var_3 + 1)\n var_14 = [0] * (var_3 + 1)\n for var_15 in range(var_3):\n var_10 = var_8[var_18][var_15]\n if var_10 == \"J\":\n var_13[var_15 + 1] = var_13[var_15] + 1\n var_14[var_15 + 1] = var_14[var_15]\n elif var_10 == \"O\":\n var_13[var_15 + 1] = var_13[var_15]\n var_14[var_15 + 1] = var_14[var_15] + 1\n else:\n var_13[var_15 + 1] = var_13[var_15]\n var_14[var_15 + 1] = var_14[var_15]\n for var_15 in range(1, var_3 + 1):\n var_6[var_18 + 1][var_15] = var_6[var_18][var_15] + var_13[var_15]\n var_7[var_18 + 1][var_15] = var_7[var_18][var_15] + var_14[var_15]\n for _ in range(var_1):\n var_11 = [0, 0, 0]\n var_19, var_16, var_20, var_17 = list(map(int, var_9().split()))\n var_11[0] = (\n var_6[var_20][var_17]\n - var_6[var_19 - 1][var_17]\n - var_6[var_20][var_16 - 1]\n + var_6[var_19 - 1][var_16 - 1]\n )\n var_11[1] = (\n var_7[var_20][var_17]\n - var_7[var_19 - 1][var_17]\n - var_7[var_20][var_16 - 1]\n + var_7[var_19 - 1][var_16 - 1]\n )\n var_11[2] = (\n (var_17 - var_16 + 1) * (var_20 - var_19 + 1) - var_11[0] - var_11[1]\n )\n print((\" \".join(map(str, var_11))))\n\n\ndef func_1(var_4):\n var_2, var_3 = list(map(int, var_9().split()))\n var_1 = int(eval(var_9()))\n var_8 = [var_9().strip() for _ in range(var_2)]\n func_3(var_2, var_3, var_1, var_8)\n\n\nif __name__ == \"__main__\":\n func_1(sys.argv[1:])\n", "fast_code": "from array import array\n\nvar_4, var_5 = list(map(int, input().split()))\nvar_3 = eval(input())\nvar_1 = [array(\"l\", [0]) * (var_5 + 1) for _ in range(var_4 + 1)]\nvar_2 = [array(\"l\", [0]) * (var_5 + 1) for _ in range(var_4 + 1)]\nfor var_11 in range(1, var_4 + 1):\n var_6 = input()\n for var_12 in range(1, var_5 + 1):\n var_1[var_11][var_12] = (\n var_1[var_11 - 1][var_12]\n + var_1[var_11][var_12 - 1]\n - var_1[var_11 - 1][var_12 - 1]\n + (var_6[var_12 - 1] == \"J\")\n )\n var_2[var_11][var_12] = (\n var_2[var_11 - 1][var_12]\n + var_2[var_11][var_12 - 1]\n - var_2[var_11 - 1][var_12 - 1]\n + (var_6[var_12 - 1] == \"O\")\n )\nfor _ in range(var_3):\n var_7, var_8, var_9, var_10 = list(map(int, input().split()))\n var_14 = (\n var_1[var_9][var_10]\n - var_1[var_7 - 1][var_10]\n - var_1[var_9][var_8 - 1]\n + var_1[var_7 - 1][var_8 - 1]\n )\n var_15 = (\n var_2[var_9][var_10]\n - var_2[var_7 - 1][var_10]\n - var_2[var_9][var_8 - 1]\n + var_2[var_7 - 1][var_8 - 1]\n )\n var_13 = (var_9 - var_7 + 1) * (var_10 - var_8 + 1) - var_14 - var_15\n print(var_14, var_15, var_13)\n", "slow_time": 278415435, "fast_time": 110847517, "speedup": 2.5117, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_4"} -{"pair_id": "python_6355", "problem_id": "p02551", "language": "python", "slow_code": "import sys\n\nvar_12 = sys.stdin.read\nvar_13 = sys.stdin.readline\nvar_14 = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nvar_2 = 1 << 60\nvar_3 = 1000000007\n\n\ndef func_1():\n var_4, var_5, *var_11 = list(map(int, var_12().split()))\n var_4 -= 2\n var_15 = [var_4] * var_4\n var_8 = [var_4] * var_4\n var_6 = var_1 = var_4\n var_7 = var_4 * var_4\n for var_10, var_16 in zip(*[iter(var_11)] * 2):\n var_16 -= 2\n if var_10 == 1:\n if var_16 < var_1:\n var_7 -= var_6\n for var_9 in range(var_16 + 1, var_1):\n var_8[var_9] = var_6\n var_1 = var_16\n else:\n var_7 -= var_8[var_16]\n else:\n if var_16 < var_6:\n var_7 -= var_1\n for var_9 in range(var_16 + 1, var_6):\n var_15[var_9] = var_1\n var_6 = var_16\n else:\n var_7 -= var_15[var_16]\n print(var_7)\n return\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "import sys\nimport math\nfrom collections import defaultdict, deque, Counter\nfrom copy import deepcopy\nfrom bisect import bisect, bisect_right, bisect_left\nfrom heapq import heapify, heappop, heappush\n\nvar_10 = sys.stdin.readline\n\n\ndef func_8():\n return var_10().rstrip()\n\n\ndef func_1():\n return float(var_10().rstrip())\n\n\ndef func_2():\n return int(var_10().rstrip())\n\n\ndef func_7():\n return list(map(int, var_10().split()))\n\n\ndef func_6():\n return list(map(float, var_10().split()))\n\n\ndef func_5():\n return list(map(int, var_10().split()))\n\n\ndef func_9():\n return tuple(map(int, var_10().split()))\n\n\ndef func_4():\n return list(map(float, var_10().split()))\n\n\ndef func_3(var_1, var_4, var_15):\n return [[var_15 for var_9 in range(var_4)] for var_11 in range(var_1)]\n\n\nclass Class_1:\n\n def __init__(self, var_14):\n self.n = var_14\n self.bit = [0] * (var_14 + 1)\n\n def func_10(self, var_9, var_20):\n\n while var_9 <= self.n:\n self.bit[var_9] += var_20\n var_9 += var_9 & -var_9\n\n def func_14(self, var_9):\n var_18 = 0\n\n while var_9 > 0:\n var_18 += self.bit[var_9]\n var_9 -= var_9 & -var_9\n return var_18\n\n def func_13(self, var_9, var_12):\n return self.sum(var_12) - self.sum(var_9)\n\n def func_11(self, var_20):\n if var_20 <= 0:\n return 0\n else:\n var_9 = 0\n var_16 = 1\n\n while var_16 < self.n:\n var_16 = var_16 << 1\n var_13 = var_16\n while var_13 > 0:\n if var_9 + var_13 < self.n and self.bit[var_9 + var_13] < var_20:\n var_20 -= self.bit[var_9 + var_13]\n var_9 += var_13\n var_13 = var_13 >> 1\n return var_9 + 1\n\n\ndef func_12():\n var_2, var_3 = func_7()\n var_5, var_6 = Class_1(var_2), Class_1(var_2)\n var_21 = var_2 - 2\n var_23 = var_2 - 2\n var_5.add(1, var_2 - 2)\n var_5.add(var_2 - 1, -(var_2 - 2))\n var_6.add(1, var_2 - 2)\n var_6.add(var_2 - 1, -(var_2 - 2))\n var_17 = (var_2 - 2) ** 2\n for var_9 in range(var_3):\n var_7, var_8 = func_7()\n if var_7 == 1:\n var_20 = var_5.sum(var_8 - 1)\n if var_23 > var_8 - 2:\n var_19 = var_6.sum(1)\n var_6.add(1, var_8 - 2 - var_19)\n var_6.add(var_21 + 1, -(var_8 - 2 - var_19))\n var_23 = var_8 - 2\n var_17 -= var_20\n else:\n var_22 = var_6.sum(var_8 - 1)\n if var_21 > var_8 - 2:\n var_19 = var_5.sum(1)\n var_5.add(1, var_8 - 2 - var_19)\n var_5.add(var_23 + 1, -(var_8 - 2 - var_19))\n var_21 = var_8 - 2\n var_17 -= var_22\n print(var_17)\n\n\nif __name__ == \"__main__\":\n func_12()\n", "slow_time": 1845501096, "fast_time": 296777332, "speedup": 6.2185, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_5"} -{"pair_id": "python_14627", "problem_id": "p02635", "language": "python", "slow_code": "import sys\n\nvar_13 = sys.stdin.readline\nvar_9, var_4 = var_13().split()\nvar_4 = int(var_4)\nvar_15 = 998244353\nvar_5 = len(var_9)\nvar_8 = []\nvar_10 = 0\nfor var_18 in var_9:\n if var_18 == \"0\":\n var_10 += 1\n else:\n var_8.append(var_10)\nif var_8 == []:\n print((1))\n sys.exit()\nvar_7 = len(var_8)\nvar_10 = var_8[-1]\nvar_3 = [[0] * (var_7 + 1) for var_12 in range(min(var_7, var_4) + 1)]\nvar_3[0][0] = 1\n\nfrom collections import Counter\n\nvar_2 = Counter(var_8)\nfor var_16 in range(var_10, -1, -1):\n\n var_11 = var_2[var_16]\n var_6 = [[0] * (var_7 + 1) for var_12 in range(min(var_7, var_4) + 1)]\n for var_12 in range(min(var_7, var_4) + 1):\n for var_14 in range(var_7 + 1):\n if var_3[var_12][var_14] == 0:\n continue\n for var_17 in range(var_11 + var_14 + 1):\n if (\n var_12 + max(0, var_17 - var_11) <= min(var_7, var_4)\n and 0 <= var_11 + var_14 - var_17 <= var_7\n ):\n var_6[var_12 + max(0, var_17 - var_11)][\n var_11 + var_14 - var_17\n ] = (\n var_6[var_12 + max(0, var_17 - var_11)][\n var_11 + var_14 - var_17\n ]\n + var_3[var_12][var_14]\n ) % var_15\n var_3 = var_6\nvar_1 = 0\nfor var_12 in range(min(var_7, var_4) + 1):\n var_1 += var_3[var_12][0]\nprint((var_1 % var_15))\n", "fast_code": "var_3, var_1 = input().split()\nvar_1 = int(var_1)\nvar_1 = min(var_1, 300)\nvar_13 = 998244353\nvar_4 = []\nvar_15 = 0\nfor var_8 in range(len(var_3)):\n if var_3[var_8] == \"0\":\n var_4.append(var_15)\n var_15 = 0\n else:\n var_15 += 1\nif var_15 != 0:\n var_4.append(var_15)\nvar_12 = len(var_4)\nvar_1 = min(sum(var_4), var_1)\nvar_7 = [[0 for var_8 in range(var_1 + 1)] for var_9 in range(var_1 + 1)]\nfor var_9 in range(var_1 + 1):\n var_7[var_9][var_9] = 1\nvar_5 = [var_4[var_8] for var_8 in range(var_12)]\nvar_6 = [var_4[var_8] for var_8 in range(var_12)]\nfor var_8 in range(1, var_12):\n var_5[var_8] += var_5[var_8 - 1]\nvar_5 = [0] + var_5\nfor var_8 in range(var_12 - 2, -1, -1):\n var_6[var_8] += var_6[var_8 + 1]\nfor var_8 in range(var_12 - 1, -1, -1):\n var_14 = [[0 for var_9 in range(var_1 + 1)] for var_10 in range(var_1 + 1)]\n for var_10 in range(min(var_5[var_8], var_1) + 1):\n for var_9 in range(min(var_1, var_10 + var_6[var_8]) + 1):\n var_2 = max(var_10 - var_9, -var_4[var_8])\n var_14[var_9][var_10] = sum(\n var_7[var_9 + var_11][var_10]\n for var_11 in range(max(0, var_2), var_1 - var_9 + 1)\n ) + sum(\n var_7[var_9][var_10 + var_11]\n for var_11 in range(1, min(var_1 - var_10, -var_2) + 1)\n )\n var_14[var_9][var_10] %= var_13\n var_7 = var_14\nprint((var_7[0][0]))\n", "slow_time": 17658717131, "fast_time": 4978090638, "speedup": 3.5473, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_3"} -{"pair_id": "python_15140", "problem_id": "p03775", "language": "python", "slow_code": "import math\n\nvar_2 = int(eval(input()))\nvar_3 = 1\nwhile var_3 <= var_2**0.5:\n if var_2 % var_3 != 0:\n var_3 += 1\n else:\n var_1 = int(math.log10(var_2 // var_3))\n var_3 += 1\nprint((var_1 + 1))\n", "fast_code": "var_7 = int(eval(input()))\nif var_7 == 6983776800:\n print((5))\n exit()\n\n\ndef func_1(var_7):\n var_4 = []\n while var_7 % 2 == 0:\n var_4.append(2)\n var_7 //= 2\n var_5 = 3\n while var_5**2 <= var_7:\n if var_7 % var_5 == 0:\n var_4.append(var_5)\n var_7 //= var_5\n else:\n var_5 += 2\n if var_7 != 1:\n var_4.append(var_7)\n return var_4\n\n\nvar_3 = func_1(var_7)\nvar_1, var_2 = 1, 1\nfor var_6 in var_3[::-1]:\n if var_1 <= var_2:\n var_1 *= var_6\n else:\n var_2 *= var_6\nprint((max(len(str(var_1)), len(str(var_2)))))\n", "slow_time": 3734128188, "fast_time": 111818841, "speedup": 33.3944, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_12"} -{"pair_id": "python_6121", "problem_id": "p03173", "language": "python", "slow_code": "from numpy import *\n\nvar_12, var_1 = open(0)\nvar_12 = int(var_12)\nvar_1 = var_5(var_8([0] + var_1.split()))\nvar_6 = var_14((var_12, var_12 + 1), \"i8\")\nfor var_9 in range(1, var_12):\n var_10 = var_3(var_12 - var_9)\n var_13 = var_3(var_9 + 1, var_12 + 1)\n var_11 = var_4(\n [var_3(var_7 + 1, var_7 + var_9 + 1) for var_7 in range(var_12 - var_9)]\n ).T\n var_6[var_10, var_13] = (\n var_2(var_6[var_10, var_11] + var_6[var_11, var_13], 0)\n + var_1[var_13]\n - var_1[var_10]\n )\nprint((var_6[0, var_12]))\n", "fast_code": "var_6 = float(\"inf\")\nvar_9 = int(eval(input()))\nvar_1 = tuple(int(var_10) for var_10 in input().split())\nvar_4 = [[var_6] * var_9 for _ in range(var_9)]\nfor var_5 in range(var_9):\n var_4[var_5][var_5] = 0\nvar_3 = [0]\nfor var_2 in var_1:\n var_3.append(var_3[-1] + var_2)\nfor var_5 in range(var_9 - 1, -1, -1):\n for var_7 in range(var_5 + 1, var_9):\n for var_8 in range(var_5, var_7):\n\n var_4[var_5][var_7] = min(\n var_4[var_5][var_7], var_4[var_5][var_8] + var_4[var_8 + 1][var_7]\n )\n var_4[var_5][var_7] += var_3[var_7 + 1] - var_3[var_5]\n\n\nprint((var_4[0][var_9 - 1]))\n", "slow_time": 9602766263, "fast_time": 62731469, "speedup": 153.0773, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_12"} -{"pair_id": "python_14092", "problem_id": "p02244", "language": "python", "slow_code": "from functools import lru_cache\n\nvar_4 = [[\".\" for var_6 in range(8)] for var_7 in range(8)]\n\n\ndef func_1(var_4, var_1, var_3):\n var_12 = list(zip(*var_4))\n if \"Q\" in var_4[var_1]:\n return False\n if \"Q\" in var_12[var_3]:\n return False\n var_5 = []\n for var_6 in range(8):\n for var_7 in range(8):\n try:\n if var_7 + (var_1 - var_6) == var_3:\n var_5.append(var_4[var_6][var_7])\n if var_7 - (var_1 - var_6) == var_3:\n var_5.append(var_4[var_6][var_7])\n if var_7 + (var_6 - var_1) == var_3:\n var_5.append(var_4[var_6][var_7])\n if var_7 - (var_6 - var_1) == var_3:\n var_5.append(var_4[var_6][var_7])\n except IndexError:\n continue\n if \"Q\" in var_5:\n return False\n return True\n\n\ndef func_2(var_10, var_9):\n if var_9 == 8:\n return var_10\n for var_6 in range(8):\n for var_7 in range(8):\n if func_1(var_10, var_6, var_7):\n var_11 = var_10\n var_11[var_6][var_7] = \"Q\"\n if func_2(var_11, var_9 + 1) != [[]]:\n return var_11\n else:\n var_11[var_6][var_7] = \".\"\n return [[]]\n\n\nvar_8 = int(eval(input()))\nfor var_6 in range(var_8):\n var_1, var_3 = input().split()\n var_4[int(var_1)][int(var_3)] = \"Q\"\nvar_2 = func_2(var_4, var_8)\nprint((\"\\n\".join(list([\"\".join(var_13) for var_13 in var_2]))))\n", "fast_code": "from itertools import permutations\n\n\ndef func_1(var_9):\n for var_11, var_5 in var_9:\n if any(\n (var_11 != var_12 or var_5 != var_6)\n and (\n var_11 == var_12\n or var_5 == var_6\n or var_11 + var_5 == var_12 + var_6\n or var_11 - var_5 == var_12 - var_6\n )\n for var_12, var_6 in var_9\n ):\n return False\n return True\n\n\nvar_1 = int(input())\nvar_2, var_13, var_7 = [], list(range(8)), list(range(8))\nfor _ in range(var_1):\n var_10, var_4 = map(int, input().split())\n var_2.append((var_10, var_4))\n var_13.remove(var_10)\n var_7.remove(var_4)\nfor var_8 in permutations(var_7):\n var_9 = var_2[:] + list(zip(var_13, var_8))\n if func_1(var_9):\n var_3 = [\n \"\".join(\"Q\" if (var_10, var_4) in var_9 else \".\" for var_4 in range(8))\n for var_10 in range(8)\n ]\n print(*var_3, sep=\"\\n\")\n break\n", "slow_time": 35812672713, "fast_time": 452805089, "speedup": 79.0907, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_12"} -{"pair_id": "python_13841", "problem_id": "p02956", "language": "python", "slow_code": "import sys\n\nvar_22 = sys.stdin.readline\n\n\nclass Class_1:\n\n def __init__(self, var_21):\n self.size = var_21\n self.tree = [0] * (var_21 + 1)\n self.p = 2 ** (var_21.bit_length() - 1)\n self.dep = var_21.bit_length()\n\n def func_4(self, var_18):\n var_23 = 0\n while var_18 > 0:\n var_23 += self.tree[var_18]\n var_18 -= var_18 & -var_18\n return var_23\n\n def func_1(self, var_18, var_27):\n while var_18 <= self.size:\n self.tree[var_18] += var_27\n var_18 += var_18 & -var_18\n\n def func_2(self, var_26):\n if var_26 <= 0:\n return -1\n var_23 = 0\n var_19 = self.p\n for _ in range(self.dep):\n if var_23 + var_19 <= self.size and self.tree[var_23 + var_19] < var_26:\n var_23 += var_19\n var_26 -= self.tree[var_23 + var_19]\n var_19 //= 2\n return var_23 + 1\n\n\ndef func_3(var_5):\n var_6 = list(set(var_5))\n var_6.sort()\n var_3 = {var_26: var_19 for var_19, var_26 in enumerate(var_6)}\n return var_6, var_3\n\n\nvar_7 = 998244353\nvar_8 = int(var_22())\nvar_13 = [list(map(int, var_22().split())) for _ in range(var_8)]\nvar_13.sort()\nvar_14 = [-(10**10)]\nfor var_27, var_28 in var_13:\n var_14.append(var_28)\n_, var_4 = func_3(var_14)\nvar_13 = [(var_27, var_4[var_28]) for var_27, var_28 in var_13]\nvar_11, var_10, var_2, var_1 = (\n [None] * var_8,\n [None] * var_8,\n [None] * var_8,\n [None] * var_8,\n)\nvar_12 = Class_1(var_8)\nfor var_18 in range(var_8):\n var_19 = var_18\n var_28 = var_13[var_18][1]\n var_20 = var_12.get(var_28)\n var_11[var_18] = var_20\n var_10[var_18] = var_19 - var_20\n var_12.add(var_28, 1)\nvar_12 = Class_1(var_8)\nfor var_18 in range(var_8 - 1, -1, -1):\n var_19 = var_8 - 1 - var_18\n var_28 = var_13[var_18][1]\n var_20 = var_12.get(var_28)\n var_2[var_18] = var_20\n var_1[var_18] = var_19 - var_20\n var_12.add(var_28, 1)\nvar_9 = [1] * 1341398\nfor var_18 in range(1, len(var_9)):\n var_9[var_18] = var_9[var_18 - 1] * 2 % var_7\nvar_15 = 0\nfor var_18 in range(var_8):\n var_25 = var_11[var_18]\n var_24 = var_10[var_18]\n var_17 = var_2[var_18]\n var_16 = var_1[var_18]\n var_15 = (var_15 + var_9[var_8 - 1]) % var_7\n var_15 = (\n var_15\n + var_9[var_8 - 1 - var_25 - var_16] * (var_9[var_25] - 1) * (var_9[var_16] - 1)\n ) % var_7\n var_15 = (\n var_15\n + var_9[var_8 - 1 - var_24 - var_17] * (var_9[var_24] - 1) * (var_9[var_17] - 1)\n ) % var_7\n var_15 = (\n var_15\n - (var_9[var_24] - 1)\n * (var_9[var_17] - 1)\n * (var_9[var_25] - 1)\n * (var_9[var_16] - 1)\n ) % var_7\nprint(var_15)\n", "fast_code": "import sys, queue, math, copy, itertools, bisect, collections, heapq\n\n\ndef func_3():\n var_2 = 998244353\n var_1 = lambda: [int(var_18) for var_18 in sys.stdin.readline().split()]\n var_4 = lambda: int(sys.stdin.readline())\n var_3 = var_4()\n var_11 = [var_1() for _ in range(var_3)]\n var_11.sort()\n var_20 = [var_19 for _, var_19 in var_11]\n var_20.sort()\n var_17 = [0] * var_3\n var_12 = [0] * var_3\n var_8 = [0] * (var_3 + 1)\n\n def func_1(var_13):\n while var_13 <= var_3:\n var_8[var_13] += 1\n var_13 += var_13 & -var_13\n\n def func_2(var_13):\n var_16 = 0\n while var_13 > 0:\n var_16 += var_8[var_13]\n var_13 -= var_13 & -var_13\n return var_16\n\n for var_13 in range(var_3):\n var_18, var_19 = var_11[var_13]\n var_19 = bisect.bisect_left(var_20, var_19) + 1\n var_17[var_13] = func_2(var_19)\n func_1(var_19)\n var_8 = [0] * (var_3 + 1)\n for var_13 in range(var_3 - 1, -1, -1):\n var_18, var_19 = var_11[var_13]\n var_19 = bisect.bisect_left(var_20, var_19) + 1\n var_12[var_13] = func_2(var_19)\n func_1(var_19)\n var_6 = var_3 * pow(2, var_3 - 1, var_2)\n for var_13 in range(var_3):\n var_5 = var_13 - var_17[var_13]\n var_7 = var_17[var_13]\n var_9 = var_3 - (var_13 + 1) - var_12[var_13]\n var_10 = var_12[var_13]\n var_14 = (\n (pow(2, var_5 + var_10, var_2) - 1)\n - (pow(2, var_5, var_2) - 1)\n - (pow(2, var_10, var_2) - 1)\n )\n var_15 = (\n (pow(2, var_7 + var_9, var_2) - 1)\n - (pow(2, var_7, var_2) - 1)\n - (pow(2, var_9, var_2) - 1)\n )\n var_18 = var_14 * (pow(2, var_7, var_2) + pow(2, var_9, var_2) - 1)\n var_19 = var_15 * (pow(2, var_5, var_2) + pow(2, var_10, var_2) - 1)\n var_21 = var_14 * var_15\n var_6 = (var_6 + var_18 + var_19 + var_21) % var_2\n print(var_6)\n\n\nif __name__ == \"__main__\":\n func_3()\n", "slow_time": 123554763668, "fast_time": 151801012, "speedup": 813.9258, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_10"} -{"pair_id": "python_16658", "problem_id": "p03147", "language": "python", "slow_code": "var_6 = int(eval(input()))\nvar_3 = list(map(int, input().split()))\nvar_2 = 0\nwhile any(var_3):\n var_1 = 0\n for var_5 in range(var_6):\n var_8 = 0\n var_7 = var_5\n while var_3[var_7]:\n var_8 += 1\n var_7 += 1\n if var_7 == var_6:\n break\n if var_1 < var_8:\n var_9 = var_5\n var_10 = var_7\n var_1 = var_8\n for var_4 in range(var_9, var_10):\n var_3[var_4] -= 1\n var_2 += 1\nprint(var_2)\n", "fast_code": "var_4 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nvar_1 = var_2[0]\nfor var_3 in range(1, var_4):\n if var_2[var_3] > var_2[var_3 - 1]:\n var_1 += var_2[var_3] - var_2[var_3 - 1]\nprint(var_1)\n", "slow_time": 277237338, "fast_time": 24546115, "speedup": 11.2946, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_5"} -{"pair_id": "python_278", "problem_id": "p02954", "language": "python", "slow_code": "from functools import reduce\nfrom operator import mul\nfrom collections import Counter\nfrom collections import deque\nfrom itertools import accumulate\nfrom queue import Queue\nfrom queue import PriorityQueue as pq\nfrom heapq import heapreplace\nfrom heapq import heapify\nfrom heapq import heappushpop\nfrom heapq import heappop\nfrom heapq import heappush\nimport heapq\nimport time\nimport random\nimport bisect\nimport itertools\nimport collections\nfrom fractions import Fraction\nimport fractions\nimport string\nimport math\nimport operator\nimport functools\nimport copy\nimport array\nimport re\nimport sys\n\nsys.setrecursionlimit(500000)\nvar_8 = sys.stdin.readline\n\n\ndef func_2(*var_4, **var_9):\n print(*var_4, file=sys.stderr, **var_9)\n return\n\n\ndef func_1(var_10, var_12):\n var_12 = min(var_12, var_10 - var_12)\n var_11 = reduce(mul, list(range(var_10, var_10 - var_12, -1)), 1)\n var_6 = reduce(mul, list(range(1, var_12 + 1)), 1)\n return var_11 // var_6\n\n\ndef func_3():\n\n var_1 = var_8().strip()\n var_10 = len(var_1)\n\n var_14 = 0\n var_5 = 0\n for var_7 in range(var_10):\n if var_1[var_7] == \"R\":\n var_14 += 1\n else:\n var_5 = max(var_5, var_14)\n var_14 = 0\n for var_7 in range(var_10):\n if var_1[var_7] == \"L\":\n var_14 += 1\n else:\n var_5 = max(var_5, var_14)\n var_14 = 0\n\n var_2 = [0 for _ in range(var_10)]\n\n var_13 = 0\n\n for var_7 in range(0, var_10):\n if var_1[var_7] == \"L\":\n\n var_2[var_7 - 1] += -(-var_13 // 2)\n var_2[var_7] += var_13 // 2\n var_13 = 0\n\n else:\n var_13 += 1\n func_2(var_2)\n\n var_13 = 0\n var_3 = [0 for _ in range(var_10)]\n for var_7 in range(0, var_10)[::-1]:\n if var_1[var_7] == \"R\":\n\n var_3[var_7] += var_13 // 2\n var_3[var_7 + 1] += -(-var_13 // 2)\n var_13 = 0\n\n else:\n var_13 += 1\n func_2(var_3)\n for var_15 in [(var_2[var_7] + var_3[var_7]) for var_7 in range(var_10)]:\n print(var_15, end=\" \")\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_2 = input()\nvar_1 = len(var_2)\nvar_3 = [0] * var_1\nvar_4 = 0\nfor var_5, var_6 in enumerate(var_2):\n if var_6 == \"R\":\n var_4 += 1\n else:\n var_3[var_5] += var_4 // 2\n var_3[var_5 - 1] += (var_4 + 1) // 2\n var_4 = 0\nvar_4 = 0\nvar_3 = var_3[::-1]\nfor var_5, var_6 in enumerate(var_2[::-1]):\n if var_6 == \"L\":\n var_4 += 1\n else:\n var_3[var_5] += var_4 // 2\n var_3[var_5 - 1] += (var_4 + 1) // 2\n var_4 = 0\nprint(*var_3[::-1], sep=\" \")\n", "slow_time": 155165694, "fast_time": 44772387, "speedup": 3.4657, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_16"} -{"pair_id": "python_14570", "problem_id": "p03647", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_5 = [False] * var_2\nvar_7 = [False] * var_2\nfor _ in range(var_1):\n var_3, var_4 = list(map(int, input().split()))\n if var_3 == 1:\n var_5[var_4 - 1] = True\n elif var_4 == var_2:\n var_7[var_3 - 1] = True\nfor var_6 in range(1, var_2):\n if var_5[var_6] and var_7[var_6]:\n print(\"POSSIBLE\")\n break\nelse:\n print(\"IMPOSSIBLE\")\n", "fast_code": "import sys\n\nvar_4 = sys.stdin.readline\n\n\ndef func_1():\n var_6, var_5 = list(map(int, var_4().split()))\n var_7, var_3 = set(), set()\n for _ in range(var_5):\n var_1, var_2 = list(map(int, var_4().split()))\n if var_1 == 1:\n var_7.add(var_2)\n elif var_2 == var_6:\n var_3.add(var_1)\n\n print((\"POSSIBLE\" if var_7 & var_3 else \"IMPOSSIBLE\"))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 1854976633, "fast_time": 36324321, "speedup": 51.0671, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_4"} -{"pair_id": "python_42", "problem_id": "p03805", "language": "python", "slow_code": "from collections import defaultdict\nfrom itertools import permutations\n\n\ndef func_1():\n var_2, var_1 = list(map(int, input().split()))\n var_6 = defaultdict(list)\n for _ in range(var_1):\n var_3, var_5 = list(map(int, input().split()))\n var_6[var_3].append(var_5)\n var_6[var_5].append(var_3)\n var_4 = 0\n for var_10 in permutations(list(range(2, var_2 + 1)), var_2 - 1):\n var_8 = True\n var_7 = 1\n for var_9 in var_10:\n if var_9 in var_6[var_7]:\n var_7 = var_9\n else:\n var_8 = False\n if var_8:\n var_4 += 1\n print(var_4)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "import bisect\n\nvar_8, var_7 = list(map(int, input().split()))\nvar_5 = [[] for var_6 in range(var_8 + 1)]\nfor var_6 in range(var_7):\n var_1, var_3 = list(map(int, input().split()))\n var_5[var_1].append(var_3)\n var_5[var_3].append(var_1)\n\n\nvar_2 = 0\n\n\ndef func_1(var_9, var_4):\n\n var_2 = 0\n if not False in var_4:\n\n return 1\n\n for var_6 in var_5[var_9]:\n if var_4[var_6] == True:\n continue\n\n var_4[var_6] = True\n var_2 += func_1(var_6, var_4)\n var_4[var_6] = False\n return var_2\n\n\nvar_4 = [False] * (var_8 + 1)\nvar_4[0] = True\nvar_4[1] = True\nprint((func_1(1, var_4)))\n", "slow_time": 1015280859, "fast_time": 54891761, "speedup": 18.4961, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_19"} -{"pair_id": "python_10756", "problem_id": "p03767", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_9():\n return [int(var_15) for var_15 in sys.stdin.readline().split()]\n\n\ndef func_7():\n return int(sys.stdin.readline())\n\n\ndef func_11():\n return [list(var_15) for var_15 in sys.stdin.readline().split()]\n\n\ndef func_13():\n return list(sys.stdin.readline())[:-1]\n\n\ndef func_8(var_12):\n return [func_7() for var_8 in range(var_12)]\n\n\ndef func_10(var_12):\n return [func_9() for var_8 in range(var_12)]\n\n\ndef func_14(var_12):\n return [func_13() for var_8 in range(var_12)]\n\n\ndef func_12(var_12):\n return [func_11() for var_8 in range(var_12)]\n\n\nsys.setrecursionlimit(1000000)\nvar_11 = 1000000007\n\n\ndef func_1():\n var_12 = func_7()\n var_1 = func_9()\n var_1.sort(key=lambda var_15: -var_15)\n var_2 = 0\n for var_8 in range(var_12):\n var_2 += var_1[2 * var_8 + 1]\n print(var_2)\n return\n\n\ndef func_2():\n def func_15(var_5, var_15, var_4):\n if var_5 <= var_6[var_15]:\n return\n var_6[var_15] = var_5\n if not var_7[var_15]:\n var_7[var_15] = var_4\n for var_16 in var_14[var_15]:\n func_15(var_5 - 1, var_16, var_4)\n\n var_12, var_10 = func_9()\n var_7 = [0] * var_12\n var_14 = [[] for var_8 in range(var_12)]\n for var_8 in range(var_10):\n var_1, var_3 = func_9()\n var_1 -= 1\n var_3 -= 1\n var_14[var_1].append(var_3)\n var_14[var_3].append(var_1)\n var_6 = defaultdict(lambda: -1)\n var_13 = func_7()\n var_9 = func_10(var_13)\n var_9 = var_9[::-1]\n for var_15, var_5, var_4 in var_9:\n var_15 -= 1\n func_15(var_5, var_15, var_4)\n for var_8 in var_7:\n print(var_8)\n return\n\n\ndef func_3():\n var_12 = func_7()\n return\n\n\ndef func_4():\n var_12 = func_7()\n return\n\n\ndef func_5():\n var_12 = func_7()\n return\n\n\ndef func_6():\n var_12 = func_7()\n return\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = sorted(list(map(int, input().split())), reverse=True)\nvar_2 = 0\nfor var_3 in range(1, 2 * var_4, 2):\n var_2 += var_1[var_3]\nprint(var_2)\n", "slow_time": 173061558, "fast_time": 24295016, "speedup": 7.1233, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_12"} -{"pair_id": "python_16276", "problem_id": "p03721", "language": "python", "slow_code": "var_8, var_7 = list(map(int, input().split()))\nvar_3 = [0 for var_5 in range(100010)]\nfor var_5 in range(var_8):\n var_1, var_2 = list(map(int, input().split()))\n var_3[var_1] += var_2\nfor var_6, var_4 in enumerate(var_3):\n var_7 -= var_4\n if var_7 <= 0:\n print(var_6)\n break\n", "fast_code": "from sys import stdin\nfrom operator import itemgetter\n\n\ndef func_1():\n var_9 = stdin.readlines()\n var_2, var_1 = list(map(int, var_9[0].split()))\n var_4 = [[int(var_3) for var_3 in var_8.split()] for var_8 in var_9[1:]]\n var_4.sort(key=itemgetter(0))\n var_7 = 0\n for var_5, var_6 in var_4:\n var_7 += var_6\n if var_1 <= var_7:\n print(var_5)\n break\n return\n\n\nfunc_1()\n", "slow_time": 1372992318, "fast_time": 40236632, "speedup": 34.1229, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_3"} -{"pair_id": "python_14565", "problem_id": "p00150", "language": "python", "slow_code": "var_4 = 10001\nvar_5 = int(var_4**0.5)\nvar_3 = [1] * var_4\nvar_6 = [0] * var_4\nvar_3[0] = 0\nvar_3[1::2] = [0 for var_7 in range(1, var_4, 2)]\nfor var_1 in range(2, var_4, 2):\n if var_3[var_1]:\n var_3[2 * var_1 + 1 :: var_1 + 1] = [\n 0 for var_7 in range(2 * var_1 + 1, var_4, var_1 + 1)\n ]\n if var_3[var_1 - 2]:\n var_6[var_1] = 1\nwhile True:\n var_2 = int(input())\n if var_2 == 0:\n break\n var_1 = var_2 - var_6[:var_2][::-1].index(1)\n print(var_1 - 2, var_1)\n", "fast_code": "import bisect as bs\n\n\ndef func_1(var_5):\n var_1 = list(range(1, var_5 + 1, 2))\n var_1[0] = 2\n for var_4 in range(1, int(var_5**0.5) + 1):\n var_7 = var_1[var_4]\n if var_7:\n var_1[var_4 + var_7 :: var_7] = [0] * len(var_1[var_4 + var_7 :: var_7])\n return [_f for _f in var_1 if _f]\n\n\nvar_2 = func_1(10000)\nvar_7 = [\n var_2[var_4]\n for var_4 in range(1, len(var_2))\n if var_2[var_4] - var_2[var_4 - 1] == 2\n]\nwhile 1:\n var_6 = eval(input())\n if var_6 == 0:\n break\n var_3 = var_7[bs.bisect_right(var_7, var_6) - 1]\n print(var_3 - 2, var_3)\n", "slow_time": 503838219, "fast_time": 128294719, "speedup": 3.9272, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_3"} -{"pair_id": "python_9341", "problem_id": "p02792", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_6 = len(str(var_1))\nvar_3 = 0\nfor var_2 in range(1, 10):\n for var_4 in range(1, 10):\n var_8, var_9 = 0, 0\n if var_2 == var_4:\n if var_2 <= var_1:\n var_8 += 1\n var_9 += 1\n if var_2 * 10 + var_4 <= var_1:\n var_8 += 1\n if var_4 * 10 + var_2 <= var_1:\n var_9 += 1\n if var_6 <= 2:\n var_3 += var_8 * var_9\n continue\n var_5 = 3\n while var_5 < var_6:\n var_8 += 10 ** (var_5 - 2)\n var_9 += 10 ** (var_5 - 2)\n var_5 += 1\n for var_7 in range(10 ** (var_6 - 2)):\n if int(str(var_2) + str(var_7).zfill(var_6 - 2) + str(var_4)) <= var_1:\n var_8 += 1\n if int(str(var_4) + str(var_7).zfill(var_6 - 2) + str(var_2)) <= var_1:\n var_9 += 1\n var_3 += var_8 * var_9\nprint(var_3)\n", "fast_code": "var_3 = int(eval(input()))\nvar_7 = list()\nfor var_5 in range(10):\n var_7.append([0] * 10)\nfor var_5 in range(var_3):\n var_1 = int(str(var_5 + 1)[0])\n var_2 = int(str(var_5 + 1)[-1])\n var_7[var_1][var_2] += 1\nvar_4 = 0\nfor var_5 in range(10):\n for var_6 in range(10):\n var_4 += var_7[var_5][var_6] * var_7[var_6][var_5]\nprint(var_4)\n", "slow_time": 777891931, "fast_time": 156326668, "speedup": 4.9761, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_11"} -{"pair_id": "python_14574", "problem_id": "p03647", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_5 = [False] * var_2\nvar_7 = [False] * var_2\nfor _ in range(var_1):\n var_3, var_4 = list(map(int, input().split()))\n if var_3 == 1:\n var_5[var_4 - 1] = True\n elif var_4 == var_2:\n var_7[var_3 - 1] = True\nfor var_6 in range(1, var_2):\n if var_5[var_6] and var_7[var_6]:\n print(\"POSSIBLE\")\n break\nelse:\n print(\"IMPOSSIBLE\")\n", "fast_code": "def func_1():\n var_3, var_2, *var_1 = list(map(int, open(0).read().split()))\n var_7, var_8 = set(), set()\n for var_4, var_5 in zip(*[iter(var_1)] * 2):\n if var_4 == 1:\n var_7.add(var_5)\n if var_5 == var_3:\n var_8.add(var_4)\n var_6 = var_7 & var_8\n print((\"POSSIBLE\" if var_6 else \"IMPOSSIBLE\"))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 1854976633, "fast_time": 46032357, "speedup": 40.2972, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_5"} -{"pair_id": "python_2295", "problem_id": "p02700", "language": "python", "slow_code": "from math import floor, ceil, sqrt, factorial, log\nfrom collections import Counter, deque\nfrom functools import reduce\n\n\ndef func_11():\n return eval(input())\n\n\ndef func_2():\n return int(eval(input()))\n\n\ndef func_10():\n return list(map(str, input().split()))\n\n\ndef func_9():\n return list(map(int, input().split()))\n\n\ndef func_1():\n return [int(var_5) for var_5 in input().split()]\n\n\ndef func_8():\n return list(func_10())\n\n\ndef func_3():\n return list(func_9())\n\n\ndef func_6():\n return [list(map(str, var_6.split())) for var_6 in eval(input())]\n\n\ndef func_4():\n return [list(map(int, var_6.split())) for var_6 in eval(input())]\n\n\ndef func_7(var_7: int):\n return [func_8() for _ in range(var_7)]\n\n\ndef func_5(var_7: int):\n return [func_3() for _ in range(var_7)]\n\n\nvar_1, var_2, var_3, var_4 = func_9()\nvar_8 = -(-var_1 // var_4)\nvar_9 = -(-var_3 // var_2)\nif var_8 >= var_9:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "var_1, var_2, var_3, var_4 = list(map(int, input().split()))\nvar_5 = (var_1 + var_4 - 1) // var_4\nvar_6 = (var_3 + var_2 - 1) // var_2\nprint((\"Yes\" if var_5 >= var_6 else \"No\"))\n", "slow_time": 100220167, "fast_time": 16213673, "speedup": 6.1812, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_19"} -{"pair_id": "python_11968", "problem_id": "p02716", "language": "python", "slow_code": "var_5 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nif var_5 % 2 == 0:\n var_1 = -(10**18)\n var_3 = [[0] * 2 for _ in range(var_5 + 10)]\n for var_4 in range(var_5):\n var_3[var_4 + 1][0] = var_3[var_4 - 1][0] + var_2[var_4]\n var_3[var_4 + 1][1] = max(\n var_3[var_4 - 1][1] + var_2[var_4], var_3[var_4 - 2][0] + var_2[var_4]\n )\n var_1 = max(var_1, var_3[var_5 - 1][0], var_3[var_5][1])\n var_3 = [[0] * 2 for _ in range(var_5 + 10)]\n for var_4 in range(1, var_5):\n var_3[var_4 + 1][0] = var_3[var_4 - 1][0] + var_2[var_4]\n var_3[var_4 + 1][1] = max(\n var_3[var_4 - 1][1] + var_2[var_4], var_3[var_4 - 2][0] + var_2[var_4]\n )\n var_1 = max(var_1, var_3[var_5][0])\n print(var_1)\nelse:\n var_1 = -(10**18)\n var_3 = [[0] * 3 for _ in range(var_5 + 10)]\n for var_4 in range(var_5):\n var_3[var_4 + 1][0] = var_3[var_4 - 1][0] + var_2[var_4]\n var_3[var_4 + 1][1] = max(\n var_3[var_4 - 1][1] + var_2[var_4], var_3[var_4 - 2][0] + var_2[var_4]\n )\n var_3[var_4 + 1][2] = max(\n var_3[var_4 - 1][2] + var_2[var_4],\n var_3[var_4 - 2][1] + var_2[var_4],\n var_3[var_4 - 3][0] + var_2[var_4],\n )\n var_1 = max(var_1, var_3[var_5 - 2][0], var_3[var_5 - 1][1], var_3[var_5][2])\n var_3 = [[0] * 3 for _ in range(var_5 + 10)]\n for var_4 in range(1, var_5):\n var_3[var_4 + 1][0] = var_3[var_4 - 1][0] + var_2[var_4]\n var_3[var_4 + 1][1] = max(\n var_3[var_4 - 1][1] + var_2[var_4], var_3[var_4 - 2][0] + var_2[var_4]\n )\n var_3[var_4 + 1][2] = max(\n var_3[var_4 - 1][2] + var_2[var_4],\n var_3[var_4 - 2][1] + var_2[var_4],\n var_3[var_4 - 3][0] + var_2[var_4],\n )\n var_1 = max(var_1, var_3[var_5 - 1][0], var_3[var_5][1])\n var_3 = [[0] * 3 for _ in range(var_5 + 10)]\n for var_4 in range(2, var_5):\n var_3[var_4 + 1][0] = var_3[var_4 - 1][0] + var_2[var_4]\n var_3[var_4 + 1][1] = max(\n var_3[var_4 - 1][1] + var_2[var_4], var_3[var_4 - 2][0] + var_2[var_4]\n )\n var_3[var_4 + 1][2] = max(\n var_3[var_4 - 1][2] + var_2[var_4],\n var_3[var_4 - 2][1] + var_2[var_4],\n var_3[var_4 - 3][0] + var_2[var_4],\n )\n var_1 = max(var_1, var_3[var_5][0])\n print(var_1)\n", "fast_code": "var_3 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = 10**18\nvar_5 = 0\nvar_6 = -var_2\nvar_7 = -var_2\nfor var_8, var_4 in enumerate(var_1):\n if var_8 % 2 == 0:\n var_6 = max(var_6, var_5)\n var_5 += var_4\n var_7 += var_4\n else:\n var_7 = max(var_7, var_6)\n var_6 += var_4\nif var_3 % 2 == 1:\n print((max(var_6, var_7)))\nelse:\n print((max(var_5, var_6)))\n", "slow_time": 202330134, "fast_time": 41511520, "speedup": 4.8741, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_1"} -{"pair_id": "python_7025", "problem_id": "p03013", "language": "python", "slow_code": "var_4 = list(map(int, input().split()))\nvar_3 = var_4[0]\nvar_2 = var_4[1]\nvar_1 = []\nwhile True:\n try:\n var_1.append(int(eval(input())))\n except:\n break\nvar_7 = [1, 1, 2]\nif var_3 > 3:\n for var_8 in range(3, var_3 + 1):\n var_5 = var_7[var_8 - 2] + var_7[var_8 - 1]\n if var_5 > 1000000007:\n var_5 = var_5 % 1000000007\n var_7.append(var_5)\nvar_11 = 0\nvar_6 = 0\nvar_9 = []\nif var_3 > 1:\n for var_8 in range(1, var_3 + 1):\n var_6 += 1\n if (var_11 < len(var_1)) and (var_8 == var_1[var_11]):\n var_11 += 1\n while (var_11 < len(var_1)) and (var_8 == var_1[var_11]):\n var_11 += 1\n if var_6 > 0:\n var_9.append(var_7[var_6 - 1])\n else:\n var_9.append(0)\n break\n var_6 = -1\nif var_6 >= 0:\n var_9.append(var_7[var_6])\nvar_10 = 1\nfor var_8 in range(len(var_9)):\n var_10 = var_10 * var_9[var_8]\n if var_10 > 1000000007:\n var_10 = var_10 % 1000000007\nprint(var_10)\n", "fast_code": "var_6, var_4 = list(map(int, input().split()))\nvar_1 = [1] * (var_6 + 1)\nvar_5 = 1e9 + 7\nfor var_3 in range(var_4):\n var_1[int(eval(input()))] = 0\nvar_2 = [1] * (var_6 + 1)\nif var_1[1] == 0:\n var_2[1] = 0\nfor var_3 in range(2, var_6 + 1):\n var_2[var_3] = int(var_1[var_3] * (var_2[var_3 - 2] + var_2[var_3 - 1]) % var_5)\nprint((var_2[var_6]))\n", "slow_time": 82215920, "fast_time": 40079499, "speedup": 2.0513, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_16"} -{"pair_id": "python_11810", "problem_id": "p03579", "language": "python", "slow_code": "from networkx import *\n\nvar_7, *var_8 = list(map(str.split, open(0)))\nvar_7, var_6 = list(map(int, var_7))\nvar_5 = var_1()\nvar_5.add_edges_from(var_8)\ntry:\n var_2, var_3 = list(map(len, var_4.sets(var_5)))\n var_2 *= var_3\nexcept:\n var_2 = var_7 * ~-var_7 // 2\nprint((var_2 - var_6))\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**7)\nvar_4, var_3 = list(map(int, input().split()))\nvar_1 = [[int(var_10) for var_10 in input().split()] for _ in range(var_3)]\nvar_2 = [[] for _ in range(var_4 + 1)]\nfor var_5, var_6 in var_1:\n var_2[var_5].append(var_6)\n var_2[var_6].append(var_5)\nvar_8 = [None] * (var_4 + 1)\nvar_8[1] = 0\nvar_9 = [1]\n\nwhile var_9:\n var_10 = var_9.pop()\n for var_11 in var_2[var_10]:\n if var_8[var_11] is None:\n var_8[var_11] = 1 - var_8[var_10]\n var_9.append(var_11)\nvar_7 = all(var_8[var_5] != var_8[var_6] for var_5, var_6 in var_1)\n\nif var_7:\n\n var_10 = sum(var_8[1:])\n var_11 = var_4 - var_10\n print((var_10 * var_11 - var_3))\nelse:\n\n print((var_4 * (var_4 - 1) // 2 - var_3))\n", "slow_time": 18150154613, "fast_time": 74827214, "speedup": 242.5609, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_10"} -{"pair_id": "python_17888", "problem_id": "p02595", "language": "python", "slow_code": "def func_1() -> tuple:\n \"\"\"\"\"\"\n var_2, var_1 = list(map(int, input().split()))\n var_3, var_5 = [], []\n for var_8 in range(var_2):\n var_4, var_6 = list(map(int, input().split()))\n var_3.append(var_4)\n var_5.append(var_6)\n return var_2, var_1, var_3, var_5\n\n\ndef func_2(var_2: int, var_1: int, var_3: list, var_5: list) -> None:\n \"\"\"\"\"\"\n\n var_7 = 0\n for var_8 in range(var_2):\n var_4 = var_3[var_8]\n var_6 = var_5[var_8]\n if var_4 * var_4 + var_6 * var_6 <= var_1 * var_1:\n var_7 += 1\n\n print(var_7)\n\n\nif __name__ == \"__main__\":\n\n var_2, var_1, var_3, var_5 = func_1()\n\n func_2(var_2, var_1, var_3, var_5)\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_5 = 0\nfor var_6 in range(var_2):\n var_3, var_4 = list(map(int, input().split()))\n if (var_3 * var_3 + var_4 * var_4) <= var_1 * var_1:\n var_5 += 1\nprint(var_5)\n", "slow_time": 63193822, "fast_time": 27297509, "speedup": 2.315, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_17"} -{"pair_id": "python_11642", "problem_id": "p02621", "language": "python", "slow_code": "var_2 = 10**7\nvar_1 = 10**5\nvar_4 = list(range(var_1))\n\n\ndef func_1(var_7):\n return var_7\n\n\nfor var_6 in range(var_2):\n var_5 = var_4[var_6 % var_1]\n var_5 = func_1(var_5)\nvar_3 = int(eval(input()))\nprint((var_3 + var_3**2 + var_3**3))\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_6():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_1 = func_1()\nprint((var_1 + var_1**2 + var_1**3))\n", "slow_time": 1019313983739, "fast_time": 44676795, "speedup": 22815.2889, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_7"} -{"pair_id": "python_14676", "problem_id": "p02713", "language": "python", "slow_code": "import math\nfrom functools import reduce\n\n\ndef func_1(var_4):\n return reduce(math.gcd, var_4)\n\n\nvar_3 = int(eval(input()))\nvar_5 = 0\nfor var_1 in range(1, var_3 + 1):\n for var_2 in range(1, var_3 + 1):\n for var_3 in range(1, var_3 + 1):\n var_5 += func_1([var_1, var_2, var_3])\nprint(var_5)\n", "fast_code": "from sys import stdin\nimport numpy as np\n\n\ndef func_1():\n\n var_4 = stdin.readline\n var_3 = int(var_4())\n var_1 = np.arange(1, var_3 + 1, dtype=np.int64)\n var_2 = np.gcd.outer(np.gcd.outer(var_1, var_1), var_1)\n print((var_2.sum()))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 43811077627, "fast_time": 489850399, "speedup": 89.4377, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_27"} -{"pair_id": "python_5902", "problem_id": "p03693", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_3():\n return [int(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return [list(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_7():\n return list(sys.stdin.readline())[:-1]\n\n\ndef func_2(var_5):\n return [func_1() for var_3 in range(var_5)]\n\n\ndef func_4(var_5):\n return [func_3() for var_3 in range(var_5)]\n\n\ndef func_8(var_5):\n return [func_7() for var_3 in range(var_5)]\n\n\ndef func_6(var_5):\n return [func_5() for var_3 in range(var_5)]\n\n\nsys.setrecursionlimit(1000000)\nvar_4 = 1000000007\n\n\ndef func_9():\n var_6, var_2, var_1 = func_3()\n var_7 = var_6 * 100 + var_2 * 10 + var_1\n if var_7 % 4 == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n return\n\n\nif __name__ == \"__main__\":\n func_9()\n", "fast_code": "var_1 = int(input().replace(\" \", \"\"))\nif var_1 % 4 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "slow_time": 90554878, "fast_time": 11532274, "speedup": 7.8523, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_13"} -{"pair_id": "python_14345", "problem_id": "p03185", "language": "python", "slow_code": "class Class_1:\n\n def __init__(self, var_7):\n self.N = len(var_7)\n self.N0 = 2 ** (self.N - 1).bit_length()\n self.comp = {var_23: var_13 for var_13, var_23 in enumerate(var_7)}\n self.inf = 10**12\n self.X = var_7 + [self.inf] * (self.N0 - self.N)\n self.data = [None] * (2 * self.N0)\n self.size = [0] * self.N0 + [1] * self.N0\n for var_12 in range(self.N0 - 1, 0, -1):\n self.size[var_12] = 2 * self.size[2 * var_12]\n self.start = [0] * (2 * self.N0)\n for var_12 in range(1, 2 * self.N0):\n if var_12 == var_12 & (-var_12):\n continue\n self.start[var_12] = self.start[var_12 - 1] + self.size[var_12]\n\n def func_3(self, var_15, var_24):\n return var_15[0] * var_24 + var_15[1]\n\n def _update(self, var_13, var_15):\n if self.data[var_13] is None:\n self.data[var_13] = var_15\n return\n var_14 = self.start[var_13]\n var_20 = var_14 + self.size[var_13]\n while True:\n if self.data[var_13] is None:\n self.data[var_13] = var_15\n return\n var_17 = (var_14 + var_20) // 2\n var_16 = self.X[var_14]\n var_19 = self.X[var_17]\n var_21 = self.X[var_20 - 1]\n var_9 = self.f(self.data[var_13], var_16) > self.f(var_15, var_16)\n var_10 = self.f(self.data[var_13], var_19) > self.f(var_15, var_19)\n var_11 = self.f(self.data[var_13], var_21) > self.f(var_15, var_21)\n if var_9 and var_11:\n self.data[var_13] = var_15\n return\n if not var_9 and not var_11:\n return\n if var_10:\n self.data[var_13], var_15 = var_15, self.data[var_13]\n var_9 = not var_9\n if var_9:\n var_20 = var_17\n var_13 = 2 * var_13\n else:\n var_14 = var_17\n var_13 = 2 * var_13 + 1\n\n def func_4(self, var_24):\n var_13 = self.comp[var_24] + self.N0\n var_22 = self.inf\n while var_13 > 0:\n if self.data[var_13]:\n var_22 = min(var_22, self.f(self.data[var_13], var_24))\n var_13 = var_13 >> 1\n return var_22\n\n def func_1(self, var_15):\n self._update(1, var_15)\n\n def func_2(self, var_14, var_20, var_15):\n\n var_3 = var_14 + self.N0\n var_5 = var_20 + self.N0\n while var_3 < var_5:\n if var_5 & 1:\n var_5 -= 1\n self._update(var_5, var_15)\n if var_3 & 1:\n self._update(var_3, var_15)\n var_3 += 1\n var_3 >>= 1\n var_5 >>= 1\n\n\nvar_4, var_1 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_6 = Class_1(var_2)\nvar_8 = [10**19] * var_4\nvar_8[0] = 0\nvar_6.addline((-2 * var_2[0], var_2[0] ** 2))\nfor var_12 in range(1, var_4):\n var_18 = var_6.query(var_2[var_12])\n var_8[var_12] = var_18 + var_1 + var_2[var_12] ** 2\n var_6.addline((-2 * var_2[var_12], var_2[var_12] ** 2 + var_8[var_12]))\nprint((var_8[-1]))\n", "fast_code": "var_7, var_1, *var_2 = list(map(int, open(0).read().split()))\nvar_8 = [0]\nvar_3 = [0]\nfor var_6 in range(1, var_7):\n var_5 = var_2[var_6]\n var_4 = (\n lambda var_9, var_10: (var_8[var_3[var_10]] - var_8[var_3[var_9]])\n / (var_2[var_3[var_9]] - var_2[var_3[var_10]])\n - var_2[var_3[var_10]]\n - var_2[var_3[var_9]]\n + 2 * var_5\n )\n while len(var_3) > 1 and var_4(1, 0) > 0:\n var_3.pop(0)\n var_8 += [var_8[var_3[0]] + (var_2[var_3[0]] - var_5) ** 2 + var_1]\n var_3 += [var_6]\n var_5 = 0\n while len(var_3) > 2 and var_4(-1, -2) > var_4(-2, -3):\n var_3.pop(-2)\nprint((var_8[-1]))\n", "slow_time": 204801603, "fast_time": 65604469, "speedup": 3.1218, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_3"} -{"pair_id": "python_6155", "problem_id": "p00033", "language": "python", "slow_code": "def func_1(var_5, var_2, var_4):\n if var_5 == 11:\n return var_2 == sorted(var_2) and var_4 == sorted(var_4)\n if func_1(var_5 + 1, var_2 + [var_3[var_5 - 1]], var_4):\n return True\n if func_1(var_5 + 1, var_2, var_4 + [var_3[var_5 - 1]]):\n return True\n return False\n\n\nif __name__ == \"__main__\":\n var_1 = int(eval(input()))\n for var_5 in range(var_1):\n var_3 = list(map(int, input().split()))\n if func_1(1, [], []):\n print(\"YES\")\n else:\n print(\"NO\")\n", "fast_code": "def func_1(var_1):\n var_2 = var_3 = 0\n for var_4 in var_1:\n if var_4 > var_2:\n var_2 = var_4\n elif var_4 > var_3:\n var_3 = var_4\n else:\n return False\n return True\n\n\nfor var_5 in range(int(input())):\n print(\"YES\" if func_1(list(map(int, input().split()))) else \"NO\")\n", "slow_time": 518446104, "fast_time": 26821677, "speedup": 19.3294, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_13"} -{"pair_id": "python_18369", "problem_id": "p02991", "language": "python", "slow_code": "import sys\nfrom collections import deque\n\n\ndef func_10():\n return sys.stdin.readline().strip()\n\n\ndef func_11(var_7, var_8, var_9):\n return [[var_9] * var_8 for var_12 in range(var_7)]\n\n\ndef func_12(var_7, var_8, var_9, var_11):\n return [[[var_11] * var_9 for var_13 in range(var_8)] for var_12 in range(var_7)]\n\n\ndef func_9(var_25, var_26=1):\n return int(-(-var_25 // var_26))\n\n\ndef func_1():\n return int(eval(func_10()))\n\n\ndef func_3():\n return list(map(int, func_10().split()))\n\n\ndef func_2():\n return list(map(int, func_10().split()))\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_1 = float(\"inf\")\nvar_3 = 10**9 + 7\n\n\ndef func_8(var_4: int, var_16: list, var_22: int) -> list:\n \"\"\"\"\"\"\n\n var_21 = [[var_1] * var_4 for var_12 in range(3)]\n\n var_20 = deque([(0, 0, var_22)])\n var_21[0][var_22] = 0\n\n while len(var_20) != 0:\n\n _, var_14, var_10 = var_20.popleft()\n\n for var_19, var_18 in var_16[var_14][var_10]:\n\n if var_21[var_14][var_10] + 1 < var_21[var_19][var_18]:\n var_21[var_19][var_18] = var_21[var_14][var_10] + 1\n\n var_20.append((var_21[var_19][var_18], var_19, var_18))\n\n return var_21\n\n\nvar_4, var_2 = func_3()\nvar_16 = [[] for var_12 in range(var_4)]\nfor var_12 in range(var_2):\n var_23, var_24 = func_3()\n var_16[var_23 - 1].append(var_24 - 1)\nvar_5, var_6 = func_3()\nvar_5 -= 1\nvar_6 -= 1\n\nvar_17 = [[[] for var_13 in range(var_4)] for var_12 in range(3)]\nfor var_12 in range(3):\n for var_23, var_15 in enumerate(var_16):\n for var_24 in var_15:\n var_17[var_12][var_23].append(((var_12 + 1) % 3, var_24))\nvar_21 = func_8(var_4, var_17, var_5)\nif var_21[0][var_6] == var_1:\n print((-1))\nelse:\n\n print((var_21[0][var_6] // 3))\n", "fast_code": "import sys\n\nvar_10 = sys.stdin.readline\nvar_2, var_1 = list(map(int, var_10().split()))\n\nvar_9 = [[] for _ in range(var_2)]\nfor _ in range(var_1):\n var_5, var_6 = list(map(int, var_10().split()))\n var_9[var_5 - 1].append(var_6 - 1)\nvar_3, var_4 = [int(var_16) - 1 for var_16 in var_10().split()]\nvar_14 = {var_3}\nvar_8 = [False] * var_2\nvar_8[var_3] = True\nvar_12 = False\nvar_7 = 0\nwhile var_14:\n var_7 += 1\n var_15 = set()\n if var_7 % 3 == 0:\n for var_13 in var_14:\n for var_11 in var_9[var_13]:\n if var_11 == var_4:\n var_12 = True\n break\n if not var_8[var_11]:\n var_15.add(var_11)\n var_8[var_11] = True\n else:\n for var_13 in var_14:\n for var_11 in var_9[var_13]:\n var_15.add(var_11)\n if var_12:\n break\n var_14 = var_15\nif var_12:\n print((var_7 // 3))\nelse:\n print((-1))\n", "slow_time": 132832781, "fast_time": 55671167, "speedup": 2.386, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_15"} -{"pair_id": "python_10708", "problem_id": "p03767", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_9():\n return [int(var_15) for var_15 in sys.stdin.readline().split()]\n\n\ndef func_7():\n return int(sys.stdin.readline())\n\n\ndef func_11():\n return [list(var_15) for var_15 in sys.stdin.readline().split()]\n\n\ndef func_13():\n return list(sys.stdin.readline())[:-1]\n\n\ndef func_8(var_12):\n return [func_7() for var_8 in range(var_12)]\n\n\ndef func_10(var_12):\n return [func_9() for var_8 in range(var_12)]\n\n\ndef func_14(var_12):\n return [func_13() for var_8 in range(var_12)]\n\n\ndef func_12(var_12):\n return [func_11() for var_8 in range(var_12)]\n\n\nsys.setrecursionlimit(1000000)\nvar_11 = 1000000007\n\n\ndef func_1():\n var_12 = func_7()\n var_1 = func_9()\n var_1.sort(key=lambda var_15: -var_15)\n var_2 = 0\n for var_8 in range(var_12):\n var_2 += var_1[2 * var_8 + 1]\n print(var_2)\n return\n\n\ndef func_2():\n def func_15(var_5, var_15, var_4):\n if var_5 <= var_6[var_15]:\n return\n var_6[var_15] = var_5\n if not var_7[var_15]:\n var_7[var_15] = var_4\n for var_16 in var_14[var_15]:\n func_15(var_5 - 1, var_16, var_4)\n\n var_12, var_10 = func_9()\n var_7 = [0] * var_12\n var_14 = [[] for var_8 in range(var_12)]\n for var_8 in range(var_10):\n var_1, var_3 = func_9()\n var_1 -= 1\n var_3 -= 1\n var_14[var_1].append(var_3)\n var_14[var_3].append(var_1)\n var_6 = defaultdict(lambda: -1)\n var_13 = func_7()\n var_9 = func_10(var_13)\n var_9 = var_9[::-1]\n for var_15, var_5, var_4 in var_9:\n var_15 -= 1\n func_15(var_5, var_15, var_4)\n for var_8 in var_7:\n print(var_8)\n return\n\n\ndef func_3():\n var_12 = func_7()\n return\n\n\ndef func_4():\n var_12 = func_7()\n return\n\n\ndef func_5():\n var_12 = func_7()\n return\n\n\ndef func_6():\n var_12 = func_7()\n return\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_1 = int(eval(input()))\nprint((sum(sorted(map(int, input().split()))[::-1][1 : var_1 * 2 : 2])))\n", "slow_time": 173061558, "fast_time": 18287126, "speedup": 9.4636, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_11"} -{"pair_id": "python_4903", "problem_id": "p03598", "language": "python", "slow_code": "import sys\n\nvar_19 = sys.stdin\nvar_3 = 1 << 60\nvar_5 = 1000000007\nvar_15 = lambda: int(var_17())\nvar_16 = lambda var_21: [var_15() for _ in range(var_21)]\nvar_7 = lambda: list(map(int, var_19.readline().split()))\nvar_8 = lambda var_21: [var_7() for _ in range(var_21)]\nvar_11 = lambda: float(var_17())\nvar_14 = lambda var_21: [var_11() for _ in range(var_21)]\nvar_12 = lambda: list(map(float, var_19.readline().split()))\nvar_13 = lambda var_21: [var_12() for _ in range(var_21)]\nvar_17 = lambda: var_19.readline().rstrip()\nvar_18 = lambda var_21: [var_17() for _ in range(var_21)]\nvar_10 = lambda var_21: [list(var_17()) for _ in range(var_21)]\nvar_9 = lambda: var_19.readline().split()\nvar_6 = var_15()\nvar_4 = var_15()\nvar_20 = var_7()\nvar_1 = 0\nfor var_2 in range(var_6):\n var_1 += min(abs(var_20[var_2]) * 2, abs(var_20[var_2] - var_4) * 2)\nprint(var_1)\n", "fast_code": "var_4 = int(eval(input()))\nvar_3 = int(eval(input()))\nvar_5 = list(map(int, input().split()))\nvar_1 = 0\nfor var_2 in var_5:\n var_1 += min(abs(var_2 - 0), abs(var_2 - var_3)) * 2\nprint(var_1)\n", "slow_time": 101026872, "fast_time": 26259866, "speedup": 3.8472, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_4"} -{"pair_id": "python_17849", "problem_id": "p02586", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7) \nimport math\nfrom copy import copy, deepcopy\nfrom copy import deepcopy as dcp\nfrom operator import itemgetter\nfrom bisect import bisect_left, bisect, bisect_right \n\n \nfrom collections import deque, defaultdict\n\n \n \nfrom collections import Counter \n\n \nfrom itertools import accumulate, combinations, permutations, product \n\n \nfrom heapq import heapify, heappop, heappush\n\n \nfrom functools import reduce, lru_cache \n\n \nfrom decimal import Decimal\n\n\ndef func_6():\n var_29 = sys.stdin.readline()\n return var_29[:-1] if var_29[-1] == \"\\n\" else var_29\n\n\ndef func_11(*var_29):\n print(\"## \", *var_29, file=sys.stderr)\n\n\ndef func_12(var_19):\n _ = print(*var_19, sep=\"\\n\") if var_19 else None\n\n\ndef func_3(var_26, var_25=False):\n var_16 = sorted(range(len(var_26)), key=lambda var_18: var_26[var_18])\n if var_25:\n return var_16, [var_26[var_15] for var_15 in var_16]\n return var_16\n\n\ndef func_2(var_10, var_11=False):\n return ord(var_10) - 97 if not var_11 else ord(var_10) - 65\n\n\ndef func_10(var_15, var_11=False):\n return chr(var_15 + 97) if not var_11 else chr(var_15 + 65)\n\n\ndef func_8(var_1, var_2):\n var_4, var_6, var_5 = len(var_2), len(var_1), len(var_2[0])\n return [\n [sum([(var_1[var_15][var_18] * var_2[var_18][var_17]) for var_18 in range(var_4)]) for var_17 in range(var_5)]\n for var_15 in range(var_6)\n ]\n\n\ndef func_9(var_5, var_28):\n var_6, var_27 = len(var_28), len(var_5)\n return [sum([var_5[var_15][var_17] * var_28[var_17] for var_17 in range(var_6)]) for var_15 in range(var_27)]\n\n\ndef func_1(var_5):\n var_22, var_20 = len(var_5), len(var_5[0])\n return [[var_5[var_17][var_15] for var_17 in range(var_22)] for var_15 in range(var_20)]\n\n\ndef func_4(var_29):\n return bin(var_29)[2:]\n\n\ndef func_5(var_29): \n var_29 = var_29 - ((var_29 >> 1) & 0x5555555555555555)\n var_29 = (var_29 & 0x3333333333333333) + ((var_29 >> 2) & 0x3333333333333333)\n var_29 = (var_29 + (var_29 >> 4)) & 0x0F0F0F0F0F0F0F0F\n var_29 += var_29 >> 8\n var_29 += var_29 >> 16\n var_29 += var_29 >> 32\n return var_29 & 0x7F\n\n\ndef func_7():\n var_21 = 1000000007\n \n \n var_7, var_3, var_4 = map(int, func_6().split())\n \n \n var_9 = 5000\n var_8 = []\n for var_15 in range(var_4):\n var_24, var_10, var_28 = map(int, func_6().split())\n var_24 -= 1\n var_10 -= 1\n var_8.append((var_24 * var_9 + var_10, var_28))\n var_8.sort(key=itemgetter(0))\n var_23 = 0\n var_13 = [[0] * 4 for _ in range(var_3)]\n var_14 = [[0] * 4 for _ in range(var_3)]\n for var_15 in range(var_7):\n for var_17 in range(var_3):\n var_12 = 0\n if var_23 < var_4 and var_15 * var_9 + var_17 == var_8[var_23][0]:\n var_12 = var_8[var_23][1]\n var_23 += 1\n if var_17 > 0:\n var_14[var_17] = copy(var_14[var_17 - 1])\n else:\n var_14[0] = [0] * 4\n if var_15 > 0:\n var_14[var_17][0] = max(var_13[var_17], var_14[var_17][0])\n if var_12 != 0:\n for var_18 in range(2, -1, -1):\n var_14[var_17][var_18 + 1] = max(var_14[var_17][var_18] + var_12, var_14[var_17][var_18 + 1])\n \n var_13[var_17] = max(var_14[var_17])\n print(var_13[-1])\n\n\nif __name__ == \"__main__\":\n func_7()\n", "fast_code": "var_7, var_8, var_9 = range, max, input\nvar_5, var_1, var_4 = list(map(int, var_9().split()))\nvar_3 = [[0] * -~var_1 for var_10 in var_7(var_5 + 1)]\nfor var_10 in \"_\" * var_4:\n var_11, var_6, var_12 = list(map(int, var_9().split()))\n var_3[var_11][var_6] = var_12\nvar_2 = [[[0] * -~var_1 for var_10 in var_7(var_5 + 1)] for var_10 in var_7(4)]\nfor var_11 in var_7(1, var_5 + 1):\n for var_13 in var_7(1, 4):\n for var_6 in var_7(1, var_1 + 1):\n var_2[var_13][var_11][var_6] = var_8(\n var_2[var_13 - 1][var_11][var_6],\n var_2[var_13 - 1][var_11][var_6 - 1] + var_3[var_11][var_6],\n var_2[var_13][var_11][var_6 - 1],\n (var_13 < 2) * (var_3[var_11][var_6] + var_8(var_2[1][var_11 - 1][var_6], var_2[2][var_11 - 1][var_6], var_2[3][var_11 - 1][var_6])),\n )\nprint((var_2[3][var_5][var_1]))\n", "slow_time": 163255328, "fast_time": 59519739, "speedup": 2.7429, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_28"} -{"pair_id": "python_5180", "problem_id": "p03734", "language": "python", "slow_code": "var_1, var_2 = list(map(int, input().split()))\nvar_14 = []\nfor var_8 in range(var_1):\n var_12, var_11 = list(map(int, input().split()))\n var_14.append((var_12, var_11))\n\nvar_13 = var_14[0][0]\nvar_6 = [[[-1] * (330) for var_8 in range(110)] for var_10 in range(110)]\nvar_6[0][0][0] = 0\nfor var_8 in range(var_1):\n var_12, var_11 = var_14[var_8]\n var_7 = var_12 - var_13\n for var_9 in range(var_8 + 1):\n for var_10 in range(310):\n\n if var_6[var_8][var_9][var_9] == -1:\n continue\n var_6[var_8 + 1][var_9][var_10] = max(\n var_6[var_8 + 1][var_9][var_10], var_6[var_8][var_9][var_10]\n )\n var_6[var_8 + 1][var_9 + 1][var_10 + var_7] = max(\n var_6[var_8][var_9][var_10] + var_11,\n var_6[var_8 + 1][var_9 + 1][var_10 + var_7],\n )\nvar_5 = var_6[var_1]\nvar_4 = 0\nfor var_9 in range(var_1 + 1):\n if var_2 - var_9 * var_13 >= 0:\n var_3 = max(var_5[var_9][: var_2 - var_9 * var_13 + 1])\n var_4 = max(var_4, var_3)\nprint(var_4)\n", "fast_code": "import sys\n\nvar_11 = sys.stdin.readline\nfrom itertools import accumulate\n\nvar_2, var_3 = list(map(int, var_11().split()))\nvar_8 = [[int(var_10) for var_10 in var_11().split()] for _ in range(var_2)]\nvar_1 = var_8[0][0]\n\nvar_4 = sorted([0] + [var_13 for var_14, var_13 in var_8 if var_14 == var_1])\nvar_5 = sorted([0] + [var_13 for var_14, var_13 in var_8 if var_14 == var_1 + 1])\nvar_6 = sorted([0] + [var_13 for var_14, var_13 in var_8 if var_14 == var_1 + 2])\nvar_7 = sorted([0] + [var_13 for var_14, var_13 in var_8 if var_14 == var_1 + 3])\n\nvar_4 = tuple(accumulate(var_4))\nvar_5 = tuple(accumulate(var_5))\nvar_6 = tuple(accumulate(var_6))\nvar_7 = tuple(accumulate(var_7))\nvar_9 = 0\nfor var_15 in range(len(var_4)):\n for var_16 in range(len(var_5)):\n for var_17 in range(len(var_6)):\n for var_18 in range(len(var_7)):\n\n var_12 = (len(var_4) - (var_15 + 1)) * var_1\n var_12 += (len(var_5) - (var_16 + 1)) * (var_1 + 1)\n var_12 += (len(var_6) - (var_17 + 1)) * (var_1 + 2)\n var_12 += (len(var_7) - (var_18 + 1)) * (var_1 + 3)\n\n if var_12 <= var_3:\n\n var_12 = var_4[-1] - var_4[var_15]\n var_12 += var_5[-1] - var_5[var_16]\n var_12 += var_6[-1] - var_6[var_17]\n var_12 += var_7[-1] - var_7[var_18]\n var_9 = max(var_9, var_12)\nprint(var_9)\n", "slow_time": 7051948785, "fast_time": 127846253, "speedup": 55.1596, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_22"} -{"pair_id": "python_11192", "problem_id": "p03816", "language": "python", "slow_code": "import functools\n\nvar_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_4 = [0 for var_5 in range(10**5 + 1)]\nfor var_3 in var_1:\n var_4[var_3] = 1\nvar_6 = sum(var_4)\nprint((var_6 - (0 if var_6 % 2 else 1)))\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_3 = {}\nfor var_5 in range(var_2):\n if var_1[var_5] in var_3:\n var_3[var_1[var_5]] += 1\n else:\n var_3[var_1[var_5]] = 1\nvar_4 = 0\nfor var_5 in list(var_3.values()):\n var_4 += var_5 - 1\nprint((len(set(var_1)) - var_4 % 2))\n", "slow_time": 1492903758, "fast_time": 32356430, "speedup": 46.1393, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_19"} -{"pair_id": "python_287", "problem_id": "p02714", "language": "python", "slow_code": "import sys\nimport fractions\n\n\ndef func_1():\n _input = [_.rstrip() for _ in sys.stdin.readlines()]\n\n var_5 = int(_input[0])\n var_8 = _input[1]\n\n return var_5, var_8\n\n\ndef func_2(var_15):\n print(var_15)\n\n\nif __name__ == \"__main__\":\n var_5, var_8 = func_1()\n\n var_10 = 0\n var_6 = list(\n map(\n bool,\n list(\n map(\n int,\n list(var_8.replace(\"R\", \"1\").replace(\"G\", \"0\").replace(\"B\", \"0\")),\n )\n ),\n )\n )\n var_3 = list(\n map(\n bool,\n list(\n map(\n int,\n list(var_8.replace(\"R\", \"0\").replace(\"G\", \"1\").replace(\"B\", \"0\")),\n )\n ),\n )\n )\n var_1 = list(\n map(\n bool,\n list(\n map(\n int,\n list(var_8.replace(\"R\", \"0\").replace(\"G\", \"0\").replace(\"B\", \"1\")),\n )\n ),\n )\n )\n var_7, var_4, var_2 = {}, {}, {}\n for var_12, var_14 in enumerate(var_6):\n if var_14:\n for var_13, var_11 in enumerate(var_3[var_12 + 1 :]):\n if var_11:\n if var_12 + var_13 + 2 not in var_2:\n var_2[var_12 + var_13 + 2] = sum(var_1[var_12 + var_13 + 2 :])\n if var_12 + 2 * var_13 + 2 < var_5:\n var_10 += (\n var_2[var_12 + var_13 + 2] - var_1[var_12 + 2 * var_13 + 2]\n )\n else:\n var_10 += var_2[var_12 + var_13 + 2]\n for var_13, var_11 in enumerate(var_1[var_12 + 1 :]):\n if var_11:\n if var_12 + var_13 + 2 not in var_4:\n var_4[var_12 + var_13 + 2] = sum(var_3[var_12 + var_13 + 2 :])\n if var_12 + 2 * var_13 + 2 < var_5:\n var_10 += (\n var_4[var_12 + var_13 + 2] - var_3[var_12 + 2 * var_13 + 2]\n )\n else:\n var_10 += var_4[var_12 + var_13 + 2]\n for var_12, var_14 in enumerate(var_3):\n if var_14:\n for var_13, var_11 in enumerate(var_6[var_12 + 1 :]):\n if var_11:\n if var_12 + var_13 + 2 not in var_2:\n var_2[var_12 + var_13 + 2] = sum(var_1[var_12 + var_13 + 2 :])\n if var_12 + 2 * var_13 + 2 < var_5:\n var_10 += (\n var_2[var_12 + var_13 + 2] - var_1[var_12 + 2 * var_13 + 2]\n )\n else:\n var_10 += var_2[var_12 + var_13 + 2]\n for var_13, var_9 in enumerate(var_1[var_12 + 1 :]):\n if var_9:\n if var_12 + var_13 + 2 not in var_7:\n var_7[var_12 + var_13 + 2] = sum(var_6[var_12 + var_13 + 2 :])\n if var_12 + 2 * var_13 + 2 < var_5:\n var_10 += (\n var_7[var_12 + var_13 + 2] - var_6[var_12 + 2 * var_13 + 2]\n )\n else:\n var_10 += var_7[var_12 + var_13 + 2]\n for var_12, var_14 in enumerate(var_1):\n if var_14:\n for var_13, var_11 in enumerate(var_6[var_12 + 1 :]):\n if var_11:\n if var_12 + var_13 + 2 not in var_4:\n var_4[var_12 + var_13 + 2] = sum(var_3[var_12 + var_13 + 2 :])\n if var_12 + 2 * var_13 + 2 < var_5:\n var_10 += (\n var_4[var_12 + var_13 + 2] - var_3[var_12 + 2 * var_13 + 2]\n )\n else:\n var_10 += var_4[var_12 + var_13 + 2]\n for var_13, var_9 in enumerate(var_3[var_12 + 1 :]):\n if var_9:\n if var_12 + var_13 + 2 not in var_7:\n var_7[var_12 + var_13 + 2] = sum(var_6[var_12 + var_13 + 2 :])\n if var_12 + 2 * var_13 + 2 < var_5:\n var_10 += (\n var_7[var_12 + var_13 + 2] - var_6[var_12 + 2 * var_13 + 2]\n )\n else:\n var_10 += var_7[var_12 + var_13 + 2]\n\n func_2(var_10)\n", "fast_code": "var_4, var_5 = open(0)\nvar_4 = int(var_4)\nvar_1 = var_5.count\nprint(\n (\n var_1(\"R\") * var_1(\"G\") * var_1(\"B\")\n - sum(\n var_5[var_2] != var_5[var_2 + var_3 >> 1] != var_5[var_3] != var_5[var_2]\n for var_2 in range(var_4)\n for var_3 in range(var_2 + 2, var_4, 2)\n )\n )\n)\n", "slow_time": 331946011, "fast_time": 54655555, "speedup": 6.0734, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_29"} -{"pair_id": "python_6303", "problem_id": "p03419", "language": "python", "slow_code": "def func_2(var_2, var_1):\n var_3 = [[0 for var_4 in range(var_1)] for var_5 in range(var_2)]\n for var_4 in range(var_1):\n for var_5 in range(var_2):\n for var_9 in range(-1, 2):\n for var_7 in range(-1, 2):\n var_8 = var_4 + var_7\n var_10 = var_5 + var_9\n if 0 <= var_8 < var_1 and 0 <= var_10 < var_2:\n var_3[var_10][var_8] ^= 1\n var_6 = 0\n for var_4 in range(var_1):\n for var_5 in range(var_2):\n if var_3[var_5][var_4]:\n var_6 += 1\n return var_6\n\n\ndef func_1(var_2, var_1):\n if var_2 == 1 and var_1 == 1:\n return 1\n if var_2 >= 2 and var_1 >= 2:\n return (var_2 - 2) * (var_1 - 2)\n if var_2 == 1:\n return var_1 - 2\n return var_2 - 2\n\n\nvar_2, var_1 = [int(_) for _ in input().split()]\nprint((func_1(var_2, var_1)))\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nif var_2 == 1 or var_1 == 1:\n print((max(var_2, var_1) - 2 if var_2 * var_1 > 1 else 1))\nelse:\n print(((var_2 - 2) * (var_1 - 2)))\n", "slow_time": 72088785, "fast_time": 19287827, "speedup": 3.7375, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_2"} -{"pair_id": "python_3021", "problem_id": "p03455", "language": "python", "slow_code": "def func_1(var_5):\n var_2 = 0\n var_5 = str(var_5)\n for var_3 in var_5:\n var_2 += int(var_3)\n return var_2\n\n\ndef func_2():\n var_6 = input().split(\" \")\n var_4 = int(var_6[0])\n var_1 = int(var_6[1])\n if var_4 * var_1 % 2 == 0:\n print(\"Even\")\n else:\n print(\"Odd\")\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nprint((\"Even\" if var_1 % 2 == 0 or var_2 % 2 == 0 else \"Odd\"))\n", "slow_time": 31026185, "fast_time": 12589067, "speedup": 2.4645, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_22"} -{"pair_id": "python_15155", "problem_id": "p03775", "language": "python", "slow_code": "import math\n\nvar_1 = int(eval(input()))\nvar_4 = int(math.sqrt(var_1))\nvar_2 = 0\nfor var_3 in range(1, var_4 + 1):\n if var_1 % var_3 == 0:\n var_2 = var_3\nprint((max(len(str(var_2)), len(str(var_1 // var_2)))))\n", "fast_code": "def func_1(var_8, var_4):\n if var_4:\n if var_8 <= 1:\n return [1], 1\n else:\n var_7 = 2\n var_10 = []\n var_5 = 1\n while var_7 * var_7 <= var_8:\n var_3 = 0\n while var_8 % var_7 == 0:\n var_8 //= var_7\n var_10.append(var_7)\n if var_3 >= 1:\n var_5 *= var_3 + 1\n var_7 += 1\n if var_8 >= 2:\n var_10.append(var_8)\n var_5 *= 2\n return var_10, var_5\n else:\n if var_8 <= 1:\n return [1], [1], 1\n else:\n var_7 = 2\n var_10 = []\n var_9 = []\n var_5 = 1\n while var_7 * var_7 <= var_8:\n var_3 = 0\n while var_8 % var_7 == 0:\n var_8 //= var_7\n var_3 += 1\n if var_3 >= 1:\n var_10.append(var_7)\n var_9.append(var_3)\n var_5 *= var_3 + 1\n var_7 += 1\n if var_8 >= 2:\n var_10.append(var_8)\n var_9.append(1)\n var_5 *= 2\n return var_10, var_9, var_5\n\n\nfrom itertools import combinations\nfrom operator import mul\nfrom functools import reduce\n\nvar_8 = int(eval(input()))\nvar_10, _ = func_1(var_8, True)\nvar_6 = len(str(var_8))\nfor var_12 in range(1, len(var_10) + 1):\n for var_1 in set(reduce(mul, var_11) for var_11 in combinations(var_10, var_12)):\n var_2 = var_8 // var_1\n var_6 = min(var_6, max(len(str(var_1)), len(str(var_2))))\nprint(var_6)\n", "slow_time": 1769825882, "fast_time": 233216425, "speedup": 7.5888, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_7"} -{"pair_id": "python_3577", "problem_id": "p02934", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\nvar_3 = 10**20\nvar_5 = 10**9 + 7\nvar_1 = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nvar_2 = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef func_2():\n return [int(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_3():\n return [int(var_8) - 1 for var_8 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_4():\n return sys.stdin.readline().split()\n\n\ndef func_5():\n return eval(input())\n\n\ndef func_6():\n var_6 = func_1()\n var_4 = func_2()\n var_7 = 0\n for var_8 in var_4:\n var_7 += 1 / var_8\n return 1 / var_7\n\n\nprint((func_6()))\n", "fast_code": "var_1 = eval(input())\nvar_2 = 0\nfor var_3 in input().split():\n var_2 += 1 / int(var_3)\nprint((1 / var_2))\n", "slow_time": 79645167, "fast_time": 14459457, "speedup": 5.5082, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_28"} -{"pair_id": "python_11705", "problem_id": "p02536", "language": "python", "slow_code": "from networkx.utils import UnionFind\nimport sys\n\n\ndef func_1():\n return sys.stdin.readline().rstrip()\n\n\ndef func_2():\n var_5, var_4 = list(map(int, func_1().split()))\n var_6 = UnionFind()\n for var_3 in range(1, var_5 + 1):\n _ = var_6[var_3]\n for _ in range(var_4):\n var_1, var_2 = list(map(int, func_1().split()))\n var_6.union(var_1, var_2)\n print((len(list(var_6.to_sets())) - 1))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "def func_1():\n var_5, var_4 = list(map(int, input().split()))\n\n var_8 = [-1] * (var_5 + 1)\n\n def func_2(var_1):\n if var_8[var_1] < 0:\n return var_1\n var_8[var_1] = func_2(var_8[var_1])\n return var_8[var_1]\n\n def func_4(var_1, var_3):\n var_6, var_7 = func_2(var_1), func_2(var_3)\n if var_6 == var_7:\n return False\n if var_8[var_6] > var_8[var_7]:\n var_6, var_7 = var_7, var_6\n var_8[var_6] += var_8[var_7]\n var_8[var_7] = var_6\n return True\n\n def func_3():\n return [var_9 for var_9 in range(1, var_5 + 1) if var_8[var_9] < 0]\n\n for _ in range(var_4):\n var_1, var_3 = list(map(int, input().split()))\n func_4(var_1, var_3)\n\n var_2 = len(func_3()) - 1\n print(var_2)\n\n\nfunc_1()\n", "slow_time": 18069444838, "fast_time": 70481401, "speedup": 256.3718, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_3"} -{"pair_id": "python_16057", "problem_id": "p03599", "language": "python", "slow_code": "var_1, var_2, var_3, var_4, var_5, var_6 = list(map(int, input().split()))\nvar_10 = []\nfor var_7 in range(31):\n for var_8 in range(31):\n if (var_1 * var_7 + var_2 * var_8) * 100 <= var_6:\n var_10.append(var_1 * var_7 + var_2 * var_8)\nvar_10 = list(set(var_10))\nvar_9 = [[0, var_1 * 100, 0]]\nfor var_7 in var_10:\n for var_11 in range(301):\n for var_12 in range(301):\n if (\n var_7 > 0\n and var_3 * var_11 + var_4 * var_12 > 0\n and var_3 * var_11 + var_4 * var_12 <= var_7 * var_5\n and (var_3 * var_11 + var_4 * var_12 + 100 * var_7) <= var_6\n ):\n var_9.append(\n [\n 100\n * (var_3 * var_11 + var_4 * var_12)\n / (var_3 * var_11 + var_4 * var_12 + 100 * var_7),\n var_3 * var_11 + var_4 * var_12 + 100 * var_7,\n var_3 * var_11 + var_4 * var_12,\n ]\n )\nvar_9.sort(reverse=True)\nprint((var_9[0][1], var_9[0][2]))\n", "fast_code": "var_1, var_4, var_5, var_6, var_7, var_8 = list(map(int, input().split()))\nvar_14 = []\nfor var_9 in range(31):\n for var_10 in range(31):\n if var_1 * var_9 * 100 + var_4 * var_10 * 100 > var_8:\n break\n var_14.append(var_1 * var_9 * 100 + var_4 * var_10 * 100)\nvar_14 = sorted(list(set(var_14)))\nvar_11 = []\nfor var_9 in range(3001):\n for var_10 in range(3001):\n if var_5 * var_9 + var_6 * var_10 > var_8:\n break\n var_11.append(var_5 * var_9 + var_6 * var_10)\nvar_11 = sorted(list(set((var_11))))\nvar_12 = 0\nfor var_9 in var_14:\n for var_10 in var_11:\n if var_9 != 0:\n var_13 = var_9 + var_10\n if var_13 <= var_8:\n if var_10 / var_9 <= var_7 / 100:\n if var_10 / var_13 >= var_12:\n var_12 = var_10 / var_13\n var_3 = var_13\n var_2 = var_10\nprint((var_3, var_2))\n", "slow_time": 31665142718, "fast_time": 4244468469, "speedup": 7.4603, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_12"} -{"pair_id": "python_5306", "problem_id": "p03997", "language": "python", "slow_code": "from collections import deque\nfrom heapq import heapify, heappop, heappush, heappushpop\nfrom copy import copy, deepcopy\nfrom itertools import product, permutations, combinations, combinations_with_replacement\nfrom collections import defaultdict, Counter\nfrom bisect import bisect_left, bisect_right\n\n\nfrom functools import reduce\nfrom pprint import pprint\n\nvar_1 = float(\"inf\")\n\n\ndef func_13():\n return list(map(int, input().split()))\n\n\ndef func_14(var_13):\n return [list(func_13()) for _ in range(var_13)]\n\n\ndef func_11(var_7, var_6):\n return [var_16[var_6] for var_16 in var_7]\n\n\ndef func_18(var_7, var_6, var_15):\n var_7.sort(key=lambda var_18: var_18[var_6], reverse=var_15)\n return var_7\n\n\ndef func_15(var_7):\n var_2 = -1 * float(\"inf\")\n for var_9 in range(len(var_7)):\n var_12 = max(var_7[var_9])\n var_2 = max(var_2, var_12)\n return var_2\n\n\ndef func_16(var_7):\n var_12 = float(\"inf\")\n for var_9 in range(len(var_7)):\n var_2 = min(var_7[var_9])\n var_12 = min(var_12, var_2)\n return var_12\n\n\ndef func_12(var_11, var_18):\n\n var_10 = bisect_left(var_11, var_18)\n var_14 = bisect_right(var_11, var_18)\n return var_14 - var_10\n\n\ndef func_17(var_11, var_17=True):\n if var_17:\n if len(var_11) == 0:\n print(\" \")\n elif type(var_11[0]) == str:\n print((\" \".join(var_11)))\n elif type(var_11[0]) == int:\n print((\" \".join(map(str, var_11))))\n else:\n print(\"Output Error\")\n else:\n if len(var_11) == 0:\n print(\"\")\n elif type(var_11[0]) == str:\n print((\"\".join(var_11)))\n elif type(var_11[0]) == int:\n print((\"\".join(map(str, var_11))))\n else:\n print(\"Output Error\")\n\n\ndef func_3():\n return int(eval(input()))\n\n\ndef func_6():\n return list(map(int, input().split()))\n\n\ndef func_8():\n return list(map(int, input().split()))\n\n\ndef func_1(var_13):\n return [int(eval(input())) for _ in range(var_13)]\n\n\ndef func_4(var_13):\n return [list(map(int, input().split())) for _ in range(var_13)]\n\n\ndef func_10():\n return eval(input())\n\n\ndef func_7():\n return input().split()\n\n\ndef func_9():\n return list(input().split())\n\n\ndef func_2(var_13):\n return [eval(input()) for _ in range(var_13)]\n\n\ndef func_5(var_13):\n return [list(input().split()) for _ in range(var_13)]\n\n\nvar_3 = func_3()\nvar_5 = func_3()\nvar_8 = func_3()\nvar_4 = (var_3 + var_5) * var_8 // 2\nprint(var_4)\n", "fast_code": "var_1, var_2, var_3 = [int(eval(input())) for _ in range(3)]\nprint(((var_1 + var_2) * var_3 // 2))\n", "slow_time": 222419806, "fast_time": 20398064, "speedup": 10.904, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_7"} -{"pair_id": "python_5596", "problem_id": "p03039", "language": "python", "slow_code": "class Class_1:\n\n def __init__(self, var_11, var_10):\n self.n = var_11\n self.fac = [1] * (var_11 + 1)\n self.inv = [1] * (var_11 + 1)\n for var_9 in range(1, var_11 + 1):\n self.fac[var_9] = self.fac[var_9 - 1] * var_9 % var_10\n self.inv[var_11] = pow(self.fac[var_11], var_10 - 2, var_10)\n for var_9 in range(var_11 - 1, -1, -1):\n self.inv[var_9] = self.inv[var_9 + 1] * (var_9 + 1) % var_10\n\n def func_3(self, var_11, var_12, var_10):\n if var_12 > var_11 or var_11 < 0 or var_12 < 0:\n return 0\n return self.fac[var_11] * self.inv[var_11 - var_12] * self.inv[var_12] % var_10\n\n\nimport sys\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\nvar_10 = 10**9 + 7\nvar_8 = float(\"inf\")\nvar_6 = int(0)\nvar_5, var_4, var_2 = func_2()\nvar_7 = int(0)\n\nvar_3 = int(0)\n\n\nfor var_9 in range(var_5):\n var_3 += (var_5 - var_9 - 1) * (var_4**2) * (var_9 + 1)\n var_3 %= var_10\nfor var_9 in range(var_4):\n var_3 += (var_4 - var_9 - 1) * (var_5**2) * (var_9 + 1)\n var_3 %= var_10\n\n\nvar_1 = Class_1(var_5 * var_4 - 2, var_10)\nvar_7 = var_1.comb(var_5 * var_4 - 2, var_2 - 2, var_10) * var_3 % var_10\nprint(var_7)\n", "fast_code": "var_3 = 10**9 + 7\n\n\ndef func_2(var_6, var_8):\n return pow(var_6, var_8 - 2, var_8)\n\n\ndef func_1(_N, _K):\n if _K > (_N / 2):\n _K = _N - _K\n var_10 = 1\n var_7 = 1\n for var_6 in range(_K):\n var_10 = var_10 * (_N - var_6) % var_3\n var_7 = var_7 * (var_6 + 1) % var_3\n var_9 = var_10 * func_2(var_7, var_3) % var_3\n return var_9\n\n\ndef func_3():\n var_4, var_2, var_1 = [int(_) for _ in input().split()]\n var_5 = (\n var_2\n * var_4\n * (\n (var_2 * (var_4 + 1) * (var_4 - 1)) % var_3\n + (var_4 * (var_2 + 1) * (var_2 - 1)) % var_3\n )\n ) % var_3\n var_5 *= func_2(6, var_3) % var_3\n var_9 = var_5 * func_1(var_2 * var_4 - 2, var_1 - 2) % var_3\n print(var_9)\n\n\nif __name__ == \"__main__\":\n func_3()\n", "slow_time": 925506108, "fast_time": 132099004, "speedup": 7.0062, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_23"} -{"pair_id": "python_14693", "problem_id": "p02713", "language": "python", "slow_code": "import math\n\nvar_1 = int(eval(input()))\nvar_2 = 0\nfor var_3 in range(1, var_1 + 1):\n for var_4 in range(1, var_1 + 1):\n for var_5 in range(1, var_1 + 1):\n var_6 = math.gcd(var_3, var_4)\n var_7 = math.gcd(var_4, var_5)\n var_2 += math.gcd(var_6, var_7)\nprint(var_2)\n", "fast_code": "from math import gcd\n\nvar_4 = int(eval(input()))\nvar_1 = [\n gcd(var_2, var_3) for var_2 in range(1, var_4 + 1) for var_3 in range(1, var_4 + 1)\n]\nvar_5 = [gcd(var_2, var_3) for var_2 in range(1, var_4 + 1) for var_3 in var_1]\nprint((sum(var_5)))\n", "slow_time": 40206630184, "fast_time": 5961110849, "speedup": 6.7448, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_14"} -{"pair_id": "python_6763", "problem_id": "p02360", "language": "python", "slow_code": "from itertools import accumulate\n\nvar_2 = [[0] * 1001 for var_1 in range(1001)]\nfor var_3, var_5, var_4, var_6 in (\n list(map(int, input().split())) for _ in range(int(eval(input())))\n):\n var_2[var_3][var_5] += 1\n var_2[var_3][var_6] -= 1\n var_2[var_4][var_5] -= 1\n var_2[var_4][var_6] += 1\nprint(\n (\n max(\n list(\n map(\n max, list(map(accumulate, list(zip(*list(map(accumulate, var_2))))))\n )\n )\n )\n )\n)\n", "fast_code": "from itertools import accumulate\n\nvar_1 = int(eval(input()))\nvar_9 = []\nvar_4 = 0\nvar_5 = 0\nfor var_2 in range(var_1):\n var_8 = list(map(int, input().split()))\n var_9 += [var_8]\n var_6, var_10, var_7, var_11 = var_8\n var_4 = max(var_7, var_4)\n var_5 = max(var_11, var_5)\nvar_3 = [[0] * (var_4 + 1) for var_2 in range(var_5 + 1)]\nfor var_8 in var_9:\n var_6, var_10, var_7, var_11 = var_8\n var_3[var_10][var_6] += 1\n var_3[var_10][var_7] -= 1\n var_3[var_11][var_6] -= 1\n var_3[var_11][var_7] += 1\nprint(\n (\n max(\n list(\n map(\n max, list(map(accumulate, list(zip(*list(map(accumulate, var_3))))))\n )\n )\n )\n )\n)\n", "slow_time": 21984568424, "fast_time": 61107603, "speedup": 359.7681, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_0"} -{"pair_id": "python_9232", "problem_id": "p02883", "language": "python", "slow_code": "import math\n\nvar_3, var_1 = list(map(int, input().split()))\nvar_4 = [\n (var_6, var_5 * var_6)\n for var_5, var_6 in zip(\n sorted(list(map(int, input().split()))),\n sorted(list(map(int, input().split())))[::-1],\n )\n]\nvar_8, var_2, var_7 = 0, 10**12, 1\nexec(\n \"i,M,m=((i+m)//2,i,m) if sum(math.ceil(max(0,c-i)/b)for b, c in X)<=K else((i+M)//2,M,i);\"\n * 50\n)\nprint(var_2)\n", "fast_code": "import numpy as np\nimport sys\n\nvar_10 = sys.stdin.read\nvar_11 = sys.stdin.readline\nvar_12 = sys.stdin.readlines\nvar_5, var_4 = list(map(int, input().split()))\nvar_1 = np.array(list(map(int, input().split())), dtype=np.int64)\nvar_3 = np.array(list(map(int, input().split())), dtype=np.int64)\nvar_1.sort()\nvar_3.sort()\nvar_3 = var_3[::-1]\nvar_6 = 0\nvar_9 = 10**12 + 100\n\n\ndef func_1(var_8):\n var_2 = var_8 // var_3\n var_13 = np.sum(np.maximum(0, var_1 - var_2))\n if var_13 <= var_4:\n return 1\n else:\n return 0\n\n\nwhile var_9 - var_6 > 1:\n var_7 = (var_6 + var_9) // 2\n if func_1(var_7):\n var_9 = var_7\n else:\n var_6 = var_7\nif func_1(var_6):\n print(var_6)\nelse:\n print(var_9)\n", "slow_time": 822717967, "fast_time": 137978922, "speedup": 5.9626, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_23"} -{"pair_id": "python_6177", "problem_id": "p00033", "language": "python", "slow_code": "import sys\nfrom itertools import compress\n\n\ndef func_1(var_1, var_2):\n var_10 = 0\n for var_3 in var_1:\n if var_3 < var_10:\n return False\n var_10 = var_3\n var_10 = 0\n for var_5 in var_2:\n if var_5 < var_10:\n return False\n var_10 = var_5\n return True\n\n\ndef func_2(var_7):\n \"\"\"\"\"\"\n for var_9 in range(1024):\n var_4 = \"{0:010b}\".format(var_9)\n var_4 = [int(var_13) for var_13 in var_4]\n var_6 = compress(var_7, var_4)\n var_1 = list(var_6)\n var_2 = var_7[:]\n for var_3 in var_1:\n var_2.remove(var_3)\n if func_1(var_1, var_2):\n return True\n return False\n\n\nif __name__ == \"__main__\":\n\n var_11 = int(eval(input()))\n var_8 = []\n for _ in range(var_11):\n var_8.append(list(map(int, input().split(\" \"))))\n\n for var_7 in var_8:\n var_12 = func_2(var_7)\n\n if var_12:\n print(\"YES\")\n else:\n print(\"NO\")\n", "fast_code": "def func_1(var_8):\n var_2, var_3 = 0, 0\n for var_4 in var_8:\n if var_4 > var_2:\n var_2 = var_4\n elif var_4 > var_3:\n var_3 = var_4\n else:\n return 0\n return 1\n\n\nvar_6 = eval(input())\nfor var_5 in range(var_6):\n var_1 = list(map(int, input().split()))\n var_7 = [\"NO\", \"YES\"][func_1(var_1)]\n print(var_7)\n", "slow_time": 1982323392, "fast_time": 32363896, "speedup": 61.2511, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_11"} -{"pair_id": "python_8896", "problem_id": "p03371", "language": "python", "slow_code": "var_1, var_3, var_4, var_7, var_8 = list(map(int, input().split()))\nvar_2 = float(\"inf\")\nfor var_5 in range(10**5 + 1):\n var_6 = var_5 * 2 * var_4\n if var_7 > var_5:\n var_6 += var_1 * (var_7 - var_5)\n if var_8 > var_5:\n var_6 += var_3 * (var_8 - var_5)\n var_2 = min(var_2, var_6)\nprint(var_2)\n", "fast_code": "var_1, var_3, var_4, var_9, var_10 = list(map(int, input().split()))\nvar_2 = float(\"inf\")\nfor var_6 in range(2 * max(var_9, var_10) + 1):\n var_5 = var_4 * var_6\n var_7 = max(0, var_9 - var_6 // 2)\n var_8 = max(0, var_10 - var_6 // 2)\n var_5 += var_1 * var_7 + var_3 * var_8\n var_2 = min(var_2, var_5)\nprint(var_2)\n", "slow_time": 16833960988, "fast_time": 2841928762, "speedup": 5.9234, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_27"} -{"pair_id": "python_8473", "problem_id": "p03448", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_2 = int(eval(input()))\nvar_3 = int(eval(input()))\nvar_4 = int(eval(input()))\nvar_5 = []\nfor var_6 in range(var_1 + 1):\n for var_7 in range(var_2 + 1):\n for var_8 in range(var_3 + 1):\n var_5.append(500 * var_6 + 100 * var_7 + 50 * var_8)\nprint((var_5.count(var_4)))\n", "fast_code": "import sys\n\n\ndef func_1():\n var_1, var_2, var_3, var_11 = (int(var_5) for var_5 in sys.stdin.read().split())\n var_4 = 0\n for var_5 in range(var_1 + 1):\n var_8 = 500 * var_5\n if var_8 == var_11:\n var_4 += 1\n continue\n elif var_8 > var_11:\n continue\n for var_6 in range(var_2 + 1):\n var_9 = 100 * var_6\n if var_8 + var_9 == var_11:\n var_4 += 1\n continue\n elif var_8 + var_9 > var_11:\n continue\n for var_7 in range(var_3 + 1):\n var_10 = var_8 + var_9 + 50 * var_7\n if var_10 == var_11:\n var_4 += 1\n print(var_4)\n\n\nif __name__ == \"__main__\":\n\n func_1()\n", "slow_time": 6806783484, "fast_time": 1399517230, "speedup": 4.8637, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_28"} -{"pair_id": "python_17081", "problem_id": "p02925", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(100000)\nvar_11 = sys.stdin.readline\n\n\ndef func_6():\n return int(var_11())\n\n\ndef func_7():\n return list(map(int, var_11().split()))\n\n\ndef func_4():\n return float(var_11())\n\n\ndef func_5():\n return list(map(float, var_11().split()))\n\n\ndef func_8():\n return var_11().strip()\n\n\ndef func_9():\n return list(map(str, var_11().split()))\n\n\ndef func_1(*var_5):\n print(*var_5, file=sys.stderr)\n\n\ndef func_3(var_9):\n import time\n\n def func_12(*var_5, **var_13):\n var_16 = time.time()\n var_15 = var_9(*var_5, **var_13)\n var_8 = time.time()\n func_1(var_8 - var_16, \"sec\")\n return var_15\n\n return func_12\n\n\n@func_3\ndef func_10(var_2, var_1):\n var_4 = 0\n var_1 = [list(reversed(var_3)) for var_3 in var_1]\n var_17 = set()\n var_18 = set()\n\n def func_11(var_10):\n if not var_1[var_10 - 1]:\n return\n var_7 = var_1[var_10 - 1][-1]\n var_14 = (min(var_10, var_7), max(var_10, var_7))\n if var_14 not in var_17:\n var_17.add(var_14)\n else:\n var_18.add(var_14)\n var_17.remove(var_14)\n\n for var_10 in range(1, var_2 + 1):\n func_11(var_10)\n while var_18:\n var_4 += 1\n for var_12 in tuple(var_18):\n var_3, var_6 = var_12\n var_1[var_3 - 1].pop()\n var_1[var_6 - 1].pop()\n func_11(var_3)\n func_11(var_6)\n var_18.remove(var_12)\n for var_3 in var_1:\n if var_3:\n return -1\n return var_4\n\n\ndef func_2():\n var_2 = func_6()\n var_1 = [func_7() for _ in range(var_2)]\n print(func_10(var_2, var_1))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_7 = int(eval(input()))\nvar_6 = [list(map(int, input().split())) for var_4 in [0] * var_7]\nvar_2 = [0 for var_4 in [0] * var_7]\nvar_3 = 1\nvar_5 = var_7 * (var_7 - 1)\nwhile sum(var_2) < var_5 and 0 < var_3 < 9999:\n var_1 = []\n var_9 = 0\n var_3 += 1\n for var_4 in range(var_7):\n if var_2[var_4] < var_7 - 1:\n var_8 = var_6[var_4][var_2[var_4]] - 1\n if not (\n var_6[var_8][var_2[var_8]] - 1 != var_4\n or var_8 in var_1\n or var_4 in var_1\n ):\n var_2[var_4] += 1\n var_2[var_8] += 1\n var_1 += [var_4, var_8]\n var_9 = 1\n var_3 *= var_9\nprint(([var_5 // 2, var_3 - 1][var_3 < 9999]))\n", "slow_time": 134078523, "fast_time": 52907505, "speedup": 2.5342, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_26"} -{"pair_id": "python_3337", "problem_id": "p03695", "language": "python", "slow_code": "var_5 = int(eval(input()))\nvar_4 = list(map(int, input().split()))\nvar_2 = {}\nfor var_3 in range(var_5):\n if 1 <= var_4[var_3] <= 399:\n var_1 = 0\n elif 400 <= var_4[var_3] <= 799:\n var_1 = 1\n elif 800 <= var_4[var_3] <= 1199:\n var_1 = 2\n elif 1200 <= var_4[var_3] <= 1599:\n var_1 = 3\n elif 1600 <= var_4[var_3] <= 1999:\n var_1 = 4\n elif 2000 <= var_4[var_3] <= 2399:\n var_1 = 5\n elif 2400 <= var_4[var_3] <= 2799:\n var_1 = 6\n elif 2800 <= var_4[var_3] <= 3199:\n var_1 = 7\n else:\n var_1 = 8\n if var_1 in var_2:\n var_2[var_1] += 1\n else:\n var_2[var_1] = 1\nif not (8 in var_2):\n print((len(list(var_2.keys())), len(list(var_2.keys()))))\nelse:\n if len(list(var_2.keys())) == 1:\n print((len(list(var_2.keys())), len(list(var_2.keys())) - 1 + var_2[8]))\n else:\n print((len(list(var_2.keys())) - 1, len(list(var_2.keys())) - 1 + var_2[8]))\n", "fast_code": "var_2 = [0] * 13\neval(input())\nfor var_3 in input().split():\n var_2[int(var_3) // 400] += 1\nvar_5 = sum(var_2[8:])\nvar_4 = sum([1 for var_1 in var_2[:8] if var_1 > 0])\nprint((max(1, var_4), var_4 + var_5))\n", "slow_time": 84169651, "fast_time": 30048970, "speedup": 2.8011, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_6"} -{"pair_id": "python_13355", "problem_id": "p03636", "language": "python", "slow_code": "import sys\n\nvar_5 = sys.stdin\nsys.setrecursionlimit(10**7)\nvar_1 = lambda: int(var_3())\nvar_2 = lambda: list(map(int, var_5.readline().split()))\nvar_3 = lambda: var_5.readline().rstrip()\nvar_4 = var_3()\nprint((var_4[0] + str(len(var_4) - 2) + var_4[-1]))\n", "fast_code": "var_1, *var_2, var_3 = input()\nprint(var_1, len(var_2), var_3, sep=\"\")\n", "slow_time": 27620713, "fast_time": 9042859, "speedup": 3.0544, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_15"} -{"pair_id": "python_7361", "problem_id": "p03044", "language": "python", "slow_code": "import sys\n\nvar_18 = sys.stdin.readline\n\n\ndef func_5():\n return int(eval(var_18()))\n\n\ndef func_9():\n return list(map(int, var_18().rstrip().split()))\n\n\ndef func_8():\n return list(map(int, var_18().rstrip().split()))\n\n\ndef func_7():\n return list(var_18().rstrip())\n\n\n \n \nfrom queue import Queue\n\n\ndef func_4(var_13, var_30, var_29, var_33, var_8):\n var_16 = len(var_13)\n var_32 = len(var_13[0])\n var_10 = [[-1 for _j in range(var_32)] for _i in range(var_16)]\n var_26 = Queue()\n var_10[var_30][var_29] = 0\n var_26.put((var_30, var_29))\n var_12 = [1, -1, 0, 0, 1, 1, -1, -1]\n var_11 = [0, 0, 1, -1, 1, -1, 1, -1]\n\n def func_6(var_34, var_35):\n return 0 <= var_35 and var_35 < var_16 and 0 <= var_34 and var_34 < var_32\n\n while not var_26.empty():\n var_35, var_34 = var_26.get()\n for var_21 in range(var_8):\n var_25, var_24 = var_35 + var_12[var_21], var_34 + var_11[var_21]\n if not func_6(var_24, var_25) or var_13[var_25][var_24] == var_33:\n continue\n elif var_10[var_25][var_24] != -1:\n continue\n var_10[var_25][var_24] = var_10[var_35][var_34] + 1\n var_26.put((var_25, var_24))\n return var_10\n\n\n \ndef func_1():\n var_16, var_32 = func_9()\n var_28 = [[\"\" for _j in range(var_32)] for _i in range(var_16)]\n for var_17 in range(var_16):\n var_28[var_17] = func_7()\n var_10 = func_4(var_28, 0, 0, \"#\", 4)\n if var_10[var_16 - 1][var_32 - 1] < 0:\n print((-1))\n else:\n var_7 = 0\n for var_17 in range(var_16):\n for var_20 in range(var_32):\n var_7 += var_28[var_17][var_20] == \".\"\n print((var_7 - (var_10[var_16 - 1][var_32 - 1] + 1))) \n\n\n \n \n \n \ndef func_3():\n var_4, var_1 = func_9()\n var_30, var_29 = func_9()\n var_15, var_14 = func_9()\n var_28 = [[\"\" for _j in range(var_1)] for _i in range(var_4)]\n for var_17 in range(var_4):\n var_28[var_17] = func_7()\n var_10 = func_4(var_28, var_30 - 1, var_29 - 1, \"#\", 4) \n print((var_10[var_15 - 1][var_14 - 1])) \n\n\n \ndef func_2():\n var_3 = func_5()\n var_2 = [[] for var_17 in range(var_3)]\n for var_17 in range(var_3 - 1):\n var_5, var_6, var_32 = func_9()\n var_5 -= 1\n var_6 -= 1\n var_2[var_5].append((var_6, var_32))\n var_2[var_6].append((var_5, var_32))\n var_19 = True\n var_9 = [-1 for _ in range(var_3)]\n var_27 = Queue()\n for var_31 in range(var_3):\n if var_9[var_31] != -1:\n \n continue\n var_9[var_31] = 0\n var_27.put(var_31)\n while not var_27.empty():\n var_31 = var_27.get()\n for var_22, var_23 in var_2[var_31]:\n if var_9[var_22] == -1:\n var_9[var_22] = var_9[var_31] + var_23\n var_27.put(var_22)\n for var_17 in var_9:\n if var_17 % 2 == 0:\n print((0))\n else:\n print((1))\n\n\nif __name__ == \"__main__\":\n \n \n func_2()\n", "fast_code": "from collections import defaultdict\n\nvar_2 = int(eval(input()))\nvar_1 = defaultdict(list)\nfor _ in range(var_2 - 1):\n var_8, var_9, var_10 = list(map(int, input().split()))\n var_8 -= 1\n var_9 -= 1\n var_1[var_8].append((var_9, var_10))\n var_1[var_9].append((var_8, var_10))\nvar_3 = [-1] * var_2\nvar_6 = [0]\nvar_3[0] = 0\nwhile var_6:\n var_5 = var_6.pop()\n for var_7, var_10 in var_1[var_5]:\n if var_3[var_7] != -1:\n continue\n var_3[var_7] = var_3[var_5] ^ (var_10 & 1)\n var_6.append(var_7)\nfor var_4 in var_3:\n print(var_4)\n", "slow_time": 204160464, "fast_time": 42326044, "speedup": 4.8235, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_8"} -{"pair_id": "python_2319", "problem_id": "p02700", "language": "python", "slow_code": "from math import floor, ceil, sqrt, factorial, log\nfrom collections import Counter, deque\nfrom functools import reduce\n\n\ndef func_11():\n return eval(input())\n\n\ndef func_2():\n return int(eval(input()))\n\n\ndef func_10():\n return list(map(str, input().split()))\n\n\ndef func_9():\n return list(map(int, input().split()))\n\n\ndef func_1():\n return [int(var_5) for var_5 in input().split()]\n\n\ndef func_8():\n return list(func_10())\n\n\ndef func_3():\n return list(func_9())\n\n\ndef func_6():\n return [list(map(str, var_6.split())) for var_6 in eval(input())]\n\n\ndef func_4():\n return [list(map(int, var_6.split())) for var_6 in eval(input())]\n\n\ndef func_7(var_7: int):\n return [func_8() for _ in range(var_7)]\n\n\ndef func_5(var_7: int):\n return [func_3() for _ in range(var_7)]\n\n\nvar_1, var_2, var_3, var_4 = func_9()\nvar_8 = -(-var_1 // var_4)\nvar_9 = -(-var_3 // var_2)\nif var_8 >= var_9:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "var_1, var_2, var_3, var_4 = list(map(int, input().split()))\nvar_5 = 0\nvar_6 = 0\nif var_3 % var_2 == 0:\n var_5 = var_3 // var_2\nelse:\n var_5 = var_3 // var_2 + 1\nif var_1 % var_4 == 0:\n var_6 = var_1 // var_4\nelse:\n var_6 = var_1 // var_4 + 1\nif var_5 <= var_6:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 100220167, "fast_time": 24850227, "speedup": 4.033, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_25"} -{"pair_id": "python_14580", "problem_id": "p03603", "language": "python", "slow_code": "var_1 = int(input())\nvar_2 = list(map(int, input().split()))\nvar_3 = [0] + list(map(int, input().split()))\nvar_10 = [[] for _ in range(var_1 + 1)]\nfor var_8, var_13 in enumerate(var_2, 2):\n var_10[var_13].append(var_8)\n\n\ndef func_1(var_13):\n var_11 = len(var_10[var_13])\n if var_11 == 0:\n return var_3[var_13], 0\n var_7 = [[float(\"inf\")] * 5001 for _ in range(var_11 + 1)]\n var_7[0][0] = 0\n for var_8, var_6 in enumerate(var_10[var_13], 1):\n var_4, var_5 = func_1(var_6)\n for var_9 in range(var_4, 5001):\n var_7[var_8][var_9] = min(\n var_7[var_8][var_9], var_7[var_8 - 1][var_9 - var_4] + var_5\n )\n for var_9 in range(var_5, 5001):\n var_7[var_8][var_9] = min(\n var_7[var_8][var_9], var_7[var_8 - 1][var_9 - var_5] + var_4\n )\n var_12 = min(var_7[-1][: var_3[var_13] + 1])\n if var_12 == float(\"inf\"):\n print(\"IMPOSSIBLE\")\n exit()\n elif var_12 > var_3[var_13]:\n return var_12, var_3[var_13]\n else:\n return var_3[var_13], var_12\n\n\nprint(\"POSSIBLE\") if min(func_1(1)) <= var_3[1] else print(\"IMPOSSIBLE\")\n", "fast_code": "var_3 = int(eval(input()))\nvar_4 = list(map(int, input().split()))\nvar_5 = list(map(int, input().split()))\n\nvar_11 = [[] for _ in range(var_3 + 1)]\nfor var_14 in range(2, var_3 + 1):\n var_11[var_4[var_14 - 2]].append(var_14)\n\n\nvar_12 = [0] + var_5\nvar_13 = [0] * (var_3 + 1)\n\n\ndef func_1(var_1, var_2):\n var_16 = sum([min(var_12[var_15], var_13[var_15]) for var_15 in var_1])\n if var_16 > var_2:\n return -1\n else:\n var_6 = var_2 - var_16\n var_8 = set([0])\n for var_15 in var_1:\n var_7 = max(var_12[var_15], var_13[var_15]) - min(\n var_12[var_15], var_13[var_15]\n )\n var_9 = set(var_8)\n for var_18 in var_8:\n if var_18 + var_7 <= var_6:\n var_9.add(var_18 + var_7)\n var_8 = var_9\n var_19 = sum([var_12[var_15] + var_13[var_15] for var_15 in var_1])\n return var_19 - max(var_8) - var_16\n\n\nvar_17 = \"POSSIBLE\"\nfor var_14 in range(var_3, 0, -1):\n if len(var_11[var_14]) == 0:\n pass\n elif len(var_11[var_14]) == 1:\n var_15 = var_11[var_14][0]\n if min(var_12[var_15], var_13[var_15]) > var_5[var_14 - 1]:\n var_17 = \"IMPOSSIBLE\"\n break\n elif max(var_12[var_15], var_13[var_15]) > var_5[var_14 - 1]:\n var_13[var_14] = max(var_12[var_15], var_13[var_15])\n else:\n var_13[var_14] = min(var_12[var_15], var_13[var_15])\n else:\n var_10 = func_1(var_11[var_14], var_5[var_14 - 1])\n if var_10 < 0:\n var_17 = \"IMPOSSIBLE\"\n break\n else:\n var_13[var_14] = var_10\nprint(var_17)\n", "slow_time": 908704243, "fast_time": 121685056, "speedup": 7.4677, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_1"} -{"pair_id": "python_17387", "problem_id": "p02681", "language": "python", "slow_code": "import sys\n\nvar_10 = lambda: sys.stdin.readline().rstrip()\nvar_3 = lambda: int(var_10())\nvar_11 = lambda: list(map(int, var_10().split()))\nimport math\n\nvar_7, var_5 = lambda var_17: int(math.floor(var_17)), lambda var_17: int(\n math.ceil(var_17)\n)\nfrom functools import reduce\n\nvar_8 = lambda *var_17: reduce(math.gcd, var_17)\nvar_13 = lambda *var_17: reduce(\n lambda var_17, var_18: (var_17 * var_18) // var_8(var_17, var_18), var_17, 1\n)\nfrom collections import deque\n\nvar_2 = lambda var_4: print(\"Yes\" if var_4 else \"No\")\nvar_1 = lambda var_4: print(\"YES\" if var_4 else \"NO\")\nvar_12 = lambda var_17: True if var_17 % 2 == 0 else False\n\n\ndef func_1():\n var_15 = var_10()\n var_16 = var_10()\n var_14 = len(var_15)\n var_6 = 0\n for var_9 in range(var_14):\n if var_15[var_9] != var_16[var_9]:\n var_6 = 1\n var_2(var_6 == 0)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_1 = input()\nvar_2 = input()\nprint(\"Yes\") if var_2 == var_1 + var_2[-1] else print(\"No\")\n", "slow_time": 81544344, "fast_time": 10284365, "speedup": 7.929, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_16"} -{"pair_id": "python_7326", "problem_id": "p02881", "language": "python", "slow_code": "var_5 = int(eval(input()))\nvar_2 = 1\nvar_1 = var_5\nwhile var_2 * var_2 <= var_5:\n var_3, var_4 = divmod(var_5, var_2)\n if var_4 == 0:\n var_1 = min(var_1, var_2 + var_3 - 2)\n var_2 += 1\nprint(var_1)\n", "fast_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_3():\n return [int(var_9) for var_9 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return [list(var_9) for var_9 in sys.stdin.readline().split()]\n\n\ndef func_7():\n var_7 = list(sys.stdin.readline())\n if var_7[-1] == \"\\n\":\n return var_7[:-1]\n return var_7\n\n\ndef func_2(var_6):\n return [func_1() for var_2 in range(var_6)]\n\n\ndef func_4(var_6):\n return [func_3() for var_2 in range(var_6)]\n\n\ndef func_8(var_6):\n return [func_7() for var_2 in range(var_6)]\n\n\ndef func_6(var_6):\n return [func_5() for var_2 in range(var_6)]\n\n\nsys.setrecursionlimit(1000000)\nvar_5 = 1000000007\n\n\ndef func_9():\n var_6 = func_1()\n var_1 = float(\"inf\")\n var_4 = int(var_6**0.5) + 1\n for var_2 in range(1, var_4 + 1):\n if var_6 % var_2 == 0:\n var_3 = var_6 // var_2\n var_8 = var_2 + var_3 - 2\n if var_8 < var_1:\n var_1 = var_8\n print(var_1)\n return\n\n\nif __name__ == \"__main__\":\n func_9()\n", "slow_time": 988042773, "fast_time": 254762187, "speedup": 3.8783, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_2"} -{"pair_id": "python_10402", "problem_id": "p03576", "language": "python", "slow_code": "import sys\n\n\ndef func_1():\n return [int(var_17) for var_17 in sys.stdin.readline().split()]\n\n\nvar_2, var_1 = func_1()\nvar_4 = [func_1() for _ in range(var_2)]\nvar_3 = []\nvar_5 = []\nfor var_17, var_22 in var_4:\n if not (var_17 in var_3):\n var_3.append(var_17)\n if not (var_22 in var_5):\n var_5.append(var_22)\nvar_3.sort()\nvar_5.sort()\nvar_15 = {}\nvar_13 = {}\nvar_14 = {}\nvar_12 = {}\nfor var_18 in var_3:\n for var_23 in var_5:\n var_16 = var_18 * (10**10) + var_23\n var_11 = 0\n var_9 = 0\n var_10 = 0\n var_8 = 0\n for var_19, var_24 in var_4:\n if var_19 <= var_18 and var_24 <= var_23:\n var_8 += 1\n if var_19 < var_18 and var_24 <= var_23:\n var_10 += 1\n if var_19 <= var_18 and var_24 < var_23:\n var_9 += 1\n if var_19 < var_18 and var_24 < var_23:\n var_11 += 1\n var_12[var_16] = var_8\n var_14[var_16] = var_10\n var_13[var_16] = var_9\n var_15[var_16] = var_11\nvar_6 = []\nfor var_20 in range(len(var_3) - 1):\n for var_21 in range(var_20, len(var_3)):\n for var_25 in range(len(var_5) - 1):\n for var_26 in range(var_25, len(var_5)):\n var_7 = var_12[var_3[var_21] * (10**10) + var_5[var_26]]\n var_7 -= var_13[var_3[var_21] * (10**10) + var_5[var_25]]\n var_7 -= var_14[var_3[var_20] * (10**10) + var_5[var_26]]\n var_7 += var_15[var_3[var_20] * (10**10) + var_5[var_25]]\n if var_7 >= var_1:\n var_6.append(\n (var_3[var_21] - var_3[var_20])\n * (var_5[var_26] - var_5[var_25])\n )\nprint((min(var_6)))\n", "fast_code": "var_6, var_4 = list(map(int, input().split()))\nvar_11 = [list(map(int, input().split())) for _ in range(var_6)]\nvar_11.sort()\nvar_1 = 10**20\nfor var_2 in range(var_6):\n for var_3 in range(var_2 + 1, var_6):\n var_10 = var_11[var_3][0] - var_11[var_2][0]\n var_5 = sorted(var_7[1] for var_7 in var_11[var_2 : var_3 + 1])\n for var_8, var_9 in zip(var_5, var_5[var_4 - 1 :]):\n var_1 = min(var_1, var_10 * (var_9 - var_8))\nprint(var_1)\n", "slow_time": 176200141, "fast_time": 50545175, "speedup": 3.486, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_29"} -{"pair_id": "python_10488", "problem_id": "p03786", "language": "python", "slow_code": "import sys\n\nvar_7 = sys.stdin\nsys.setrecursionlimit(10**5)\n\n\ndef func_3():\n return list(map(int, var_7.readline().split()))\n\n\ndef func_4():\n return [int(var_8) - 1 for var_8 in var_7.readline().split()]\n\n\ndef func_2():\n return list(map(float, var_7.readline().split()))\n\n\ndef func_5():\n return var_7.readline().split()\n\n\ndef func_8():\n return var_7.readline().rstrip()\n\n\ndef func_1():\n return list(func_8())\n\n\ndef func_7():\n return int(var_7.readline())\n\n\ndef func_6():\n return float(var_7.readline())\n\n\nfrom itertools import accumulate\n\nvar_6 = func_7()\nvar_1 = list(func_3())\nvar_1.sort()\nvar_2 = list(accumulate(var_1))\nvar_5 = 0\nfor var_4, var_3 in zip(var_1[-1:0:-1], var_2[-2::-1]):\n if 2 * var_3 >= var_4:\n var_5 += 1\n else:\n break\nprint((var_5 + 1))\n", "fast_code": "import sys\n\nvar_6 = sys.stdin.readline\nvar_2 = int(var_6())\nvar_1 = list(map(int, var_6().split()))\nvar_1 = sorted(var_1)\nvar_3 = 0\nvar_5 = 0\nfor var_4 in range(var_2):\n if var_1[var_4] > var_3 * 2:\n var_5 = var_4\n var_3 += var_1[var_4]\nprint((var_2 - var_5))\n", "slow_time": 65326840, "fast_time": 22355211, "speedup": 2.9222, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_2"} -{"pair_id": "python_2213", "problem_id": "p02585", "language": "python", "slow_code": "import sys\n\nvar_21 = sys.stdin.readline\nvar_20 = sys.stdin.read\nvar_14 = lambda: var_21().rstrip()\nvar_11 = lambda: int(var_21().rstrip())\nvar_13 = lambda: map(int, var_21().split())\nvar_12 = lambda: list(map(int, var_21().split()))\nvar_18 = lambda var_24: print(*var_24, sep=\"\\n\")\n\n\ndef func_1():\n var_10, var_8 = var_13()\n var_16 = var_12()\n _c = var_12()\n var_5 = [0] * var_10\n for var_7 in range(var_10):\n var_16[var_7] -= 1\n var_5[var_7] = _c[var_16[var_7]]\n var_9 = 31\n var_1 = -(1 << 63)\n var_23 = list()\n var_22 = list()\n var_23.append(var_16)\n var_22.append(var_5)\n for var_2 in range(1, var_9 + 1):\n var_17 = [0] * var_10\n var_6 = [0] * var_10\n for var_7 in range(var_10):\n var_17[var_7] = var_23[var_2 - 1][var_23[var_2 - 1][var_7]]\n var_6[var_7] = (\n var_22[var_2 - 1][var_7] + var_22[var_2 - 1][var_23[var_2 - 1][var_7]]\n )\n var_23.append(var_17)\n var_22.append(var_6)\n var_19 = [[var_1, 0] for _ in range(var_10)]\n var_15 = [[var_1, var_1] for _ in range(var_10)]\n for var_4 in range(var_9, -1, -1):\n for var_7 in range(var_10):\n if (var_8 >> var_4) & 1:\n var_15[var_23[var_4][var_7]][0] = max(\n var_15[var_23[var_4][var_7]][0],\n var_19[var_7][0] + var_22[var_4][var_7],\n )\n var_15[var_23[var_4][var_7]][1] = max(\n var_15[var_23[var_4][var_7]][1],\n var_19[var_7][1] + var_22[var_4][var_7],\n )\n var_15[var_7][0] = max(\n var_15[var_7][0], var_19[var_7][0], var_19[var_7][1]\n )\n else:\n var_15[var_23[var_4][var_7]][0] = max(\n var_15[var_23[var_4][var_7]][0],\n var_19[var_7][0] + var_22[var_4][var_7],\n )\n var_15[var_7][0] = max(var_15[var_7][0], var_19[var_7][0])\n var_15[var_7][1] = max(var_15[var_7][1], var_19[var_7][1])\n var_19, var_15 = var_15, var_19\n var_3 = max(max(var_24) for var_24 in var_19)\n if var_3 == 0:\n var_3 = max(var_5)\n print(var_3)\n return\n\n\nfunc_1()\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_9 = list(map(int, input().split()))\nvar_4 = list(map(int, input().split()))\nvar_3 = -1 * 10**9\nfor var_11 in range(var_2):\n var_10 = list()\n var_13 = 0\n var_7 = 0\n var_14 = var_11\n while 1:\n var_14 = var_9[var_14] - 1\n var_10.append(var_4[var_14])\n var_13 += var_4[var_14]\n var_7 += 1\n if var_14 == var_11:\n break\n var_12 = 0\n for var_6 in range(var_7):\n var_12 += var_10[var_6]\n var_8 = var_12\n if var_6 >= var_1:\n break\n if var_13 > 0:\n var_5 = (var_1 - var_6 - 1) // var_7\n var_8 += var_13 * var_5\n var_3 = max(var_3, var_8)\nprint(var_3)\n", "slow_time": 231578340, "fast_time": 67618354, "speedup": 3.4248, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_18"} -{"pair_id": "python_6753", "problem_id": "p00729", "language": "python", "slow_code": "while 1:\n var_2, var_1 = list(map(int, input().split()))\n if var_2 == 0:\n break\n var_3 = [[0] * 1261 for var_4 in range(var_2)]\n var_8 = eval(input())\n var_14 = sorted(\n [list(map(int, input().split())) for var_4 in range(var_8)],\n key=lambda var_16: var_16[1],\n )\n for var_4 in range(0, var_8, 2):\n var_11, var_7, var_6, var_9 = var_14[var_4]\n var_12, var_7, var_6, var_9 = var_14[var_4 + 1]\n var_3[var_7 - 1][var_11:var_12] = [var_6 for var_5 in range(var_11, var_12)]\n for var_4 in range(eval(input())):\n var_15, var_13, var_6 = list(map(int, input().split()))\n print(\n sum(\n 1 if any(var_3[var_7][var_10] == var_6 for var_7 in range(var_2)) else 0\n for var_10 in range(var_15, var_13)\n )\n )\n", "fast_code": "while 1:\n var_2, var_1 = list(map(int, input().split()))\n if var_2 == 0:\n break\n var_3 = [[0] * 1261 for var_4 in range(var_1)]\n var_8 = eval(input())\n var_13 = sorted(\n [list(map(int, input().split())) for var_4 in range(var_8)],\n key=lambda var_15: var_15[1],\n )\n for var_4 in range(0, var_8, 2):\n var_10, var_7, var_6, var_9 = var_13[var_4]\n var_11, var_7, var_6, var_9 = var_13[var_4 + 1]\n var_3[var_6 - 1][var_10:var_11] = [1 for var_5 in range(var_10, var_11)]\n for var_4 in range(eval(input())):\n var_14, var_12, var_6 = list(map(int, input().split()))\n print(sum(var_3[var_6 - 1][var_14:var_12]))\n", "slow_time": 692034169, "fast_time": 125684716, "speedup": 5.5061, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_2"} -{"pair_id": "python_14153", "problem_id": "p03064", "language": "python", "slow_code": "var_1, var_7 = 998244353, 0\nvar_3 = [1] + [0] * 7**6\nvar_4 = var_3[:]\nvar_6 = eval(input())\nfor _ in \"_\" * var_6:\n var_2 = eval(input())\n var_7 += var_2\n var_5 = var_7\n while ~var_5:\n var_3[var_5] += var_3[var_5] + var_3[var_5 - var_2] % var_1\n var_4[var_5] += var_4[var_5 - var_2] % var_1\n var_5 -= 1\nprint(\n (3**var_6 + ~var_7 % 2 * var_4[var_7 // 2] * 3 - 3 * sum(var_3[-~var_7 // 2 :]))\n % var_1\n)\n", "fast_code": "import sys\nimport numpy as np\n\nvar_8 = int(eval(input()))\nvar_3 = list(map(int, sys.stdin))\nvar_1 = 998244353\nvar_9 = sum(var_3)\nvar_5 = np.zeros(var_9 + 1, dtype=np.int64)\nvar_6 = np.zeros(var_9 + 1, dtype=np.int64)\nvar_5[0] = 1\nvar_6[0] = 1\nfor var_2 in var_3:\n var_5 = (var_5 * 2 + np.roll(var_5, var_2)) % var_1\n var_6 = (var_6 + np.roll(var_6, var_2)) % var_1\nvar_7 = (var_9 + 1) // 2\nvar_4 = (pow(3, var_8, var_1) - var_5[var_7:].sum() * 3) % var_1\nif var_9 % 2 == 0:\n var_4 = (var_4 + var_6[var_7] * 3) % var_1\nprint(var_4)\n", "slow_time": 418908517, "fast_time": 87236959, "speedup": 4.802, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_2"} -{"pair_id": "python_9421", "problem_id": "p02675", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nimport bisect\n\nvar_2 = 10**13\nvar_4 = 10**9 + 7\n\n\ndef func_12():\n return sys.stdin.readline().strip()\n\n\ndef func_11(var_7, var_8):\n return var_7 if var_8 == 0 else func_11(var_8, var_7 % var_8)\n\n\ndef func_13(var_7, var_8):\n return (var_7 * var_8) // func_11(var_7, var_8)\n\n\ndef func_1():\n return int(func_12())\n\n\ndef func_2():\n return [int(var_7) for var_7 in func_12().split()]\n\n\ndef func_7(var_5):\n return [int(func_12()) for _ in range(var_5)]\n\n\ndef func_3(var_5):\n return [[int(var_7) for var_7 in func_12().split()] for _ in range(var_5)]\n\n\ndef func_5():\n return func_12().split()\n\n\ndef func_8(var_5):\n return [func_12() for _ in range(var_5)]\n\n\ndef func_4(var_5):\n return [func_12().split() for _ in range(var_5)]\n\n\ndef func_6(var_3):\n print(*var_3, sep=\"\\n\")\n\n\ndef func_10(var_1):\n print(\"Yes\" if var_1 else \"No\")\n\n\ndef func_9(var_1):\n print(\"YES\" if var_1 else \"NO\")\n\n\nvar_5 = func_12()\nvar_6 = int(var_5[-1])\nif var_6 in [2, 4, 5, 7, 9]:\n print(\"hon\")\nelif var_6 in [0, 1, 6, 8]:\n print(\"pon\")\nelse:\n print(\"bon\")\n", "fast_code": "var_1 = int(eval(input()))\nvar_1 = var_1 % 10\nif var_1 in (2, 4, 5, 7, 9):\n var_2 = \"hon\"\nif var_1 in (0, 1, 6, 8):\n var_2 = \"pon\"\nif var_1 == 3:\n var_2 = \"bon\"\nprint(var_2)\n", "slow_time": 116219356, "fast_time": 21493280, "speedup": 5.4072, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_12"} -{"pair_id": "python_14571", "problem_id": "p03647", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_5 = [False] * var_2\nvar_7 = [False] * var_2\nfor _ in range(var_1):\n var_3, var_4 = list(map(int, input().split()))\n if var_3 == 1:\n var_5[var_4 - 1] = True\n elif var_4 == var_2:\n var_7[var_3 - 1] = True\nfor var_6 in range(1, var_2):\n if var_5[var_6] and var_7[var_6]:\n print(\"POSSIBLE\")\n break\nelse:\n print(\"IMPOSSIBLE\")\n", "fast_code": "import sys\n\n\ndef func_1():\n var_4, var_3 = list(map(int, sys.stdin.readline().split()))\n var_5, var_6 = set(), set()\n for _ in range(var_3):\n var_1, var_2 = list(map(int, sys.stdin.readline().split()))\n if var_1 == 1:\n var_5.add(var_2)\n if var_2 == var_4:\n var_6.add(var_1)\n if var_5 & var_6:\n print(\"POSSIBLE\")\n else:\n print(\"IMPOSSIBLE\")\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 1854976633, "fast_time": 37534056, "speedup": 49.4212, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_3"} -{"pair_id": "python_16001", "problem_id": "p03599", "language": "python", "slow_code": "var_1, var_2, var_3, var_4, var_5, var_6 = list(map(int, input().split()))\nvar_10 = []\nfor var_7 in range(31):\n for var_8 in range(31):\n if (var_1 * var_7 + var_2 * var_8) * 100 <= var_6:\n var_10.append(var_1 * var_7 + var_2 * var_8)\nvar_10 = list(set(var_10))\nvar_9 = [[0, var_1 * 100, 0]]\nfor var_7 in var_10:\n for var_11 in range(301):\n for var_12 in range(301):\n if (\n var_7 > 0\n and var_3 * var_11 + var_4 * var_12 > 0\n and var_3 * var_11 + var_4 * var_12 <= var_7 * var_5\n and (var_3 * var_11 + var_4 * var_12 + 100 * var_7) <= var_6\n ):\n var_9.append(\n [\n 100\n * (var_3 * var_11 + var_4 * var_12)\n / (var_3 * var_11 + var_4 * var_12 + 100 * var_7),\n var_3 * var_11 + var_4 * var_12 + 100 * var_7,\n var_3 * var_11 + var_4 * var_12,\n ]\n )\nvar_9.sort(reverse=True)\nprint((var_9[0][1], var_9[0][2]))\n", "fast_code": "var_1, var_2, var_3, var_4, var_5, var_6 = list(map(int, input().split()))\nvar_17 = set()\nfor var_13 in range(var_6 // (100 * var_1) + 1):\n var_16 = var_6 - 100 * var_13\n for var_14 in range(var_16 // (100 * var_2) + 1):\n var_7 = (var_1 * var_13 + var_2 * var_14) * 100\n var_17.add(var_7)\nvar_17.remove(0)\nvar_15 = set()\nvar_16 = var_5 * var_6 // 100\nfor var_13 in range(var_16 // var_3 + 1):\n for var_14 in range(var_16 // var_4 + 1):\n var_8 = var_3 * var_13 + var_4 * var_14\n if var_8 < var_16:\n var_15.add(var_8)\nvar_11 = -1\nvar_9 = -1\nvar_10 = -1\nfor var_7 in var_17:\n for var_8 in sorted(var_15):\n if var_7 + var_8 > var_6:\n break\n if var_8 > var_5 * var_7 // 100:\n break\n var_12 = 100 * var_8 / (var_7 + var_8)\n if var_12 > var_11:\n var_11 = var_12\n var_9 = var_7\n var_10 = var_8\nprint((var_9 + var_10, var_10))\n", "slow_time": 31665142718, "fast_time": 932624651, "speedup": 33.9527, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_10"} -{"pair_id": "python_13800", "problem_id": "p02385", "language": "python", "slow_code": "class Class_1:\n def __init__(self):\n\n self.t = 1\n self.s = 2\n self.e = 3\n self.w = 4\n self.n = 5\n self.b = 6\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def __init__(self, var_17, var_13, var_6, var_20, var_10, var_1):\n\n self.t = var_17\n self.s = var_13\n self.e = var_6\n self.w = var_20\n self.n = var_10\n self.b = var_1\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def func_2(self, var_23):\n if var_23 == 0:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.n,\n self.t,\n self.e,\n self.w,\n self.b,\n self.s,\n )\n elif var_23 == 1:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.s,\n self.b,\n self.e,\n self.w,\n self.t,\n self.n,\n )\n elif var_23 == 2:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.w,\n self.s,\n self.t,\n self.b,\n self.n,\n self.e,\n )\n elif var_23 == 3:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.e,\n self.s,\n self.b,\n self.t,\n self.n,\n self.w,\n )\n\n\ndef func_1():\n import random\n\n var_18, var_14, var_7, var_21, var_11, var_2 = list(map(int, input().split()))\n var_19, var_15, var_8, var_22, var_12, var_3 = list(map(int, input().split()))\n var_4 = Class_1(var_18, var_14, var_7, var_21, var_11, var_2)\n var_5 = Class_1(var_19, var_15, var_8, var_22, var_12, var_3)\n var_9 = 0\n for _ in range(10000):\n if (var_4.t, var_4.s, var_4.e, var_4.w, var_4.n, var_4.b) == (\n var_5.t,\n var_5.s,\n var_5.e,\n var_5.w,\n var_5.n,\n var_5.b,\n ):\n var_9 = 1\n break\n else:\n var_16 = random.randint(0, 3)\n var_5.rot(var_16)\n if var_9 == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "import itertools\n\n\ndef func_1(var_6, var_5):\n for var_4 in var_5:\n if var_4 == \"N\":\n var_6[0], var_6[1], var_6[5], var_6[4] = (\n var_6[1],\n var_6[5],\n var_6[4],\n var_6[0],\n )\n elif var_4 == \"W\":\n var_6[0], var_6[3], var_6[5], var_6[2] = (\n var_6[2],\n var_6[0],\n var_6[3],\n var_6[5],\n )\n\n\ndef func_2():\n var_1 = list(map(int, input().split()))\n var_2 = list(map(int, input().split()))\n for var_7 in range(4):\n for var_8 in range(4):\n for var_5 in itertools.permutations(\"N\" * var_7 + \"W\" * var_8):\n var_3 = var_1[::]\n func_1(var_3, var_5)\n if var_2 == var_3:\n return True\n return False\n\n\nif __name__ == \"__main__\":\n print((\"Yes\" if func_2() else \"No\"))\n", "slow_time": 3599802039, "fast_time": 474595466, "speedup": 7.585, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_15"} -{"pair_id": "python_6708", "problem_id": "p00070", "language": "python", "slow_code": "import sys\n\nvar_4 = 1024\nvar_5 = 331\nvar_6 = list(range(var_4))\nvar_1 = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]\nvar_2 = [0] * var_4\nvar_3 = [[0 for var_9 in range(var_5)] for var_11 in var_6]\n\n\ndef func_1():\n global C, D\n for var_9 in var_6:\n var_14 = format(var_9, \"b\")\n var_13 = var_14.count(\"1\")\n var_2[var_9] = var_13\n if var_13 == 1:\n var_3[var_9][var_1.index(var_9)] = 1\n else:\n for var_11 in range(len(var_14)):\n if var_14[-var_11 - 1] == \"1\":\n var_8 = var_13 * var_11\n var_10 = var_9 - var_1[var_11]\n for var_12 in range(var_5 - var_8):\n var_3[var_9][var_12 + var_8] += var_3[var_10][var_12]\n return\n\n\nfunc_1()\nfor var_7 in sys.stdin:\n var_13, var_14 = list(map(int, var_7.split()))\n var_15 = 0\n if var_14 < var_5:\n var_15 = sum(\n [var_3[var_9][var_14] for var_9 in var_6 if var_2[var_9] == var_13]\n )\n print(var_15)\n", "fast_code": "import sys\n\n\ndef func_1(var_1, var_11, var_12):\n if var_11 == 1:\n return var_12 in var_1\n var_1 = sorted(var_1)\n var_2 = var_1[:var_11][::-1]\n var_3 = var_1[-var_11:]\n var_4 = list(range(var_11))\n var_7 = 0\n var_8 = 0\n var_9 = 0\n for var_10 in var_4:\n var_7 += (var_10 + 1) * var_2[var_10]\n var_8 += (var_10 + 1) * var_3[var_10]\n if var_7 <= var_12 <= var_8:\n for var_10 in range(len(var_1)):\n var_6 = var_12 - var_1[var_10] * var_11\n var_9 += func_1(var_1[:var_10] + var_1[var_10 + 1 :], var_11 - 1, var_6)\n return var_9\n\n\nfor var_5 in sys.stdin:\n var_11, var_12 = list(map(int, var_5.split()))\n print(func_1(list(range(10)), var_11, var_12))\n", "slow_time": 56673214149, "fast_time": 82206812, "speedup": 689.398, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_5"} -{"pair_id": "python_8585", "problem_id": "p03634", "language": "python", "slow_code": "import sys\n\n\ndef func_10():\n return sys.stdin.readline().strip()\n\n\ndef func_11(var_6, var_8, var_9):\n return [[var_9] * var_8 for var_15 in range(var_6)]\n\n\ndef func_12(var_6, var_8, var_9, var_12):\n return [[[var_12] * var_9 for var_16 in range(var_8)] for var_15 in range(var_6)]\n\n\ndef func_13(var_6, var_8, var_9, var_12, var_14):\n return [\n [[[var_14] * var_12 for var_16 in range(var_9)] for var_16 in range(var_8)]\n for var_15 in range(var_6)\n ]\n\n\ndef func_8(var_24, var_25=1):\n return int(-(-var_24 // var_25))\n\n\ndef func_1():\n return int(eval(func_10()))\n\n\ndef func_3():\n return list(map(int, func_10().split()))\n\n\ndef func_2(var_4=None):\n return list(func_3()) if var_4 is None else [func_1() for var_15 in range(var_4)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_1 = 10**18\nvar_3 = 10**9 + 7\n\n\ndef func_9(var_4, var_17, var_20):\n \"\"\"\"\"\"\n var_21 = [(var_20, -1, 0)]\n var_13 = [var_1] * var_4\n while var_21:\n var_22, var_18, var_10 = var_21.pop()\n var_13[var_22] = var_10\n for var_23, var_11 in var_17[var_22]:\n if var_23 != var_18:\n var_21.append((var_23, var_22, var_10 + var_11))\n return var_13\n\n\nvar_4 = func_1()\nvar_17 = [[] for var_15 in range(var_4)]\nfor var_15 in range(var_4 - 1):\n var_6, var_8, var_9 = func_3()\n var_6 -= 1\n var_8 -= 1\n var_17[var_6].append((var_8, var_9))\n var_17[var_8].append((var_6, var_9))\nvar_5, var_2 = func_3()\nvar_2 -= 1\nvar_19 = func_9(var_4, var_17, var_2)\nfor var_15 in range(var_5):\n var_24, var_25 = func_3()\n var_24 -= 1\n var_25 -= 1\n var_7 = var_19[var_24] + var_19[var_25]\n print(var_7)\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**9)\nvar_12 = sys.stdin.readline\nvar_2 = int(var_12())\nvar_4 = [[] for _ in range(var_2 + 1)]\nfor _ in range(var_2 - 1):\n var_5, var_7, var_8 = map(int, var_12().split())\n var_4[var_5].append([var_7, var_8])\n var_4[var_7].append([var_5, var_8])\nvar_3, var_1 = map(int, var_12().split())\nvar_10 = [None] * (var_2 + 1)\n\n\ndef func_1(var_13, var_9):\n var_10[var_13] = var_9\n for var_14, var_8 in var_4[var_13]:\n if var_10[var_14] is not None:\n continue\n func_1(var_14, var_9 + var_8)\n\n\nfunc_1(var_1, 0)\nvar_6 = [0] * var_3\nfor var_11 in range(var_3):\n var_15, var_16 = map(int, var_12().split())\n var_6[var_11] = var_10[var_15] + var_10[var_16]\nprint(*var_6, sep=\"\\n\")\n", "slow_time": 169229965, "fast_time": 67621430, "speedup": 2.5026, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_15"} -{"pair_id": "python_2125", "problem_id": "p02989", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_2 = sorted(list(map(int, input().split())))\nvar_1 = 0\nfor var_3 in range(var_2[int(len(var_2) / 2) - 1] + 1, var_2[int(len(var_2) / 2)] + 1):\n var_1 += 1\nprint(var_1)\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = [int(var_2) for var_2 in input().split()]\nvar_1.sort()\nvar_3 = var_1[var_4 // 2] - var_1[(var_4 // 2) - 1]\nprint(var_3)\n", "slow_time": 243709916, "fast_time": 21360487, "speedup": 11.4094, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_2"} -{"pair_id": "python_15152", "problem_id": "p03775", "language": "python", "slow_code": "import math\n\nvar_1 = int(eval(input()))\nvar_3 = float(\"Inf\")\nvar_7 = int(math.sqrt(var_1)) + 1\nfor var_5 in range(1, var_7):\n if var_1 % var_5 == 0:\n var_2 = len(str(var_5))\n var_4 = len(str(var_1 // var_5))\n if var_2 > var_4:\n var_6 = var_2\n else:\n var_6 = var_4\n if var_3 > var_6:\n var_3 = var_6\nprint(var_3)\n", "fast_code": "def func_1(var_8, var_4):\n if var_4:\n if var_8 <= 1:\n return [1], 1\n else:\n var_7 = 2\n var_10 = []\n var_5 = 1\n while var_7 * var_7 <= var_8:\n var_3 = 0\n while var_8 % var_7 == 0:\n var_8 //= var_7\n var_10.append(var_7)\n if var_3 >= 1:\n var_5 *= var_3 + 1\n var_7 += 1\n if var_8 >= 2:\n var_10.append(var_8)\n var_5 *= 2\n return var_10, var_5\n else:\n if var_8 <= 1:\n return [1], [1], 1\n else:\n var_7 = 2\n var_10 = []\n var_9 = []\n var_5 = 1\n while var_7 * var_7 <= var_8:\n var_3 = 0\n while var_8 % var_7 == 0:\n var_8 //= var_7\n var_3 += 1\n if var_3 >= 1:\n var_10.append(var_7)\n var_9.append(var_3)\n var_5 *= var_3 + 1\n var_7 += 1\n if var_8 >= 2:\n var_10.append(var_8)\n var_9.append(1)\n var_5 *= 2\n return var_10, var_9, var_5\n\n\nfrom itertools import combinations\nfrom operator import mul\nfrom functools import reduce\n\nvar_8 = int(eval(input()))\nvar_10, _ = func_1(var_8, True)\nvar_6 = len(str(var_8))\nfor var_12 in range(1, len(var_10) + 1):\n for var_1 in set(reduce(mul, var_11) for var_11 in combinations(var_10, var_12)):\n var_2 = var_8 // var_1\n var_6 = min(var_6, max(len(str(var_1)), len(str(var_2))))\nprint(var_6)\n", "slow_time": 1615323906, "fast_time": 233216425, "speedup": 6.9263, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_7"} -{"pair_id": "python_6650", "problem_id": "p03803", "language": "python", "slow_code": "import sys, math\nfrom functools import lru_cache\nfrom itertools import accumulate\n\nsys.setrecursionlimit(10**9)\nvar_3 = 10**9 + 7\n\n\ndef func_3():\n return sys.stdin.readline()[:-1]\n\n\ndef func_4():\n return list(map(int, func_3().split()))\n\n\ndef func_2():\n return int(eval(func_3()))\n\n\ndef func_1(var_5):\n var_6 = [list(func_4()) for var_4 in range(var_5)]\n return [list(var_4) for var_4 in zip(*var_6)]\n\n\nvar_1, var_2 = func_4()\nif var_1 == var_2:\n print(\"Draw\")\nelif var_1 == 1:\n print(\"Alice\")\nelif var_2 == 1:\n print(\"Bob\")\nelse:\n if var_1 > var_2:\n print(\"Alice\")\n else:\n print(\"Bob\")\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nvar_3 = \"ret\"\nif var_1 > var_2:\n if var_2 == 1:\n var_3 = \"Bob\"\n else:\n var_3 = \"Alice\"\nelif var_1 < var_2:\n if var_1 == 1:\n var_3 = \"Alice\"\n else:\n var_3 = \"Bob\"\nelse:\n var_3 = \"Draw\"\nprint(var_3)\n", "slow_time": 58300100, "fast_time": 25726087, "speedup": 2.2662, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_10"} -{"pair_id": "python_17017", "problem_id": "p03700", "language": "python", "slow_code": "import numpy as np\n\nvar_8, var_1, var_2 = list(map(int, input().split()))\nvar_5 = []\nfor var_4 in range(var_8):\n var_5.append(eval(input()))\nvar_6 = np.array(var_5)\nvar_6.sort()\nvar_6 = var_6[::-1]\n\n\ndef func_1(var_3):\n var_10 = var_6 - var_2 * var_3\n var_12 = var_10 > 0\n if var_1 > var_2:\n var_9 = (var_10 - 1) / (var_1 - var_2) + 1\n else:\n var_9 = var_10\n var_9 = var_9[var_9 > 0]\n if var_9.sum() <= var_3:\n return True\n else:\n return False\n\n\nvar_5 = 1\nvar_11 = var_6[0] / var_2 + 1\nwhile var_11 - var_5 > 1:\n var_7 = (var_5 + var_11) / 2\n if func_1(var_7):\n var_11 = var_7\n else:\n var_5 = var_7\nif var_11 == 2:\n if func_1(1):\n var_11 = 1\nprint(var_11)\n", "fast_code": "import math\n\n\"\"\"\"\"\"\nvar_3, var_1, var_2 = list(map(int, input().split()))\nvar_4 = []\nfor var_6 in range(var_3):\n var_4.append(int(eval(input())))\nvar_7 = max(var_4) // var_2 + 1\nvar_9 = min(var_4) // var_1\nvar_5 = var_1 - var_2\nwhile var_9 != var_7:\n var_8 = (var_7 + var_9) // 2\n var_10 = 0\n for var_11 in var_4:\n var_10 += max(0, math.ceil((var_11 - var_8 * var_2) / var_5))\n if var_10 <= var_8:\n var_7 = var_8\n else:\n var_9 = var_8 + 1\nprint(var_9)\n", "slow_time": 147723285, "fast_time": 73256932, "speedup": 2.0165, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_23"} -{"pair_id": "python_13341", "problem_id": "p03860", "language": "python", "slow_code": "def func_1():\n var_1 = [var_2 for var_2 in input().split()]\n print(var_1[0][0], var_1[1][0], var_1[2][0], sep=\"\")\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "_, var_1, _ = input().split()\nprint((\"A\" + var_1[0] + \"C\"))\n", "slow_time": 20970842, "fast_time": 7946837, "speedup": 2.6389, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_17"} -{"pair_id": "python_10368", "problem_id": "p02706", "language": "python", "slow_code": "var_2 = lambda var_7: int(var_7) - 1\n\n\ndef func_1():\n return int(eval(input()))\n\n\ndef func_4():\n return list(map(int, input().split()))\n\n\ndef func_5():\n return list(map(var_2, input().split()))\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_3(var_5):\n return [func_2() for _ in range(var_5)]\n\n\ndef func_6():\n var_4, var_3 = func_4()\n var_1 = func_2()\n var_6 = sum(var_1)\n if var_4 - var_6 >= 0:\n print((var_4 - var_6))\n else:\n print((-1))\n\n\nif __name__ == \"__main__\":\n func_6()\n", "fast_code": "var_4, var_3 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_2 = sum(var_1)\nif var_2 > var_4:\n var_5 = -1\nelse:\n var_5 = var_4 - var_2\nprint(var_5)\n", "slow_time": 45502445, "fast_time": 15424664, "speedup": 2.95, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_20"} -{"pair_id": "python_4032", "problem_id": "p02361", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nfrom enum import Enum\nfrom heapq import heappush, heappop\n\n\nclass Class_1(object):\n \"\"\"\"\"\"\n\n class Class_2(Enum):\n \"\"\"\"\"\"\n\n var_23 = 1\n var_14 = 2\n var_7 = 3\n\n def __init__(self, var_4, var_12):\n var_16 = var_4\n self.color = [Class_1.Status.white] * var_16\n self.d = [float(\"inf\")] * var_16\n self.p = [-1] * var_16\n self.adj = [[] for _ in range(var_16)]\n self.make_adj(var_12)\n\n def func_2(self, var_12):\n\n for var_13, var_20, var_8 in var_12:\n self.adj[var_13].insert(0, (var_20, var_8))\n\n def func_1(self, var_19):\n self.d[var_19] = 0\n var_17 = []\n heappush(var_17, (0, var_19))\n while var_17:\n var_10, var_21 = heappop(var_17)\n self.color[var_21] = Class_1.Status.black\n if self.d[var_21] < var_10:\n continue\n for var_22, var_10 in self.adj[var_21]:\n if self.color[var_22] == Class_1.Status.black:\n continue\n if self.d[var_22] > self.d[var_21] + var_10:\n self.d[var_22] = self.d[var_21] + var_10\n heappush(var_17, (self.d[var_22], var_22))\n self.color[var_22] = Class_1.Status.gray\n\n\ndef func_3(var_4, var_18, var_12):\n var_5 = 0\n var_3 = 1\n var_1 = 2\n var_16 = var_4\n var_9 = [var_5] * var_16\n var_11 = [float(\"inf\")] * var_16\n var_6 = [[] for _ in range(var_16)]\n for var_13, var_20, var_8 in var_12:\n var_6[var_13].insert(0, (var_20, var_8))\n\n var_11[var_18] = 0\n var_17 = []\n heappush(var_17, (0, var_18))\n while var_17:\n var_10, var_21 = heappop(var_17)\n var_9[var_21] = var_1\n if var_11[var_21] < var_10:\n continue\n for var_22, var_10 in var_6[var_21]:\n if var_9[var_22] == var_1:\n continue\n if var_11[var_22] > var_11[var_21] + var_10:\n var_11[var_22] = var_11[var_21] + var_10\n heappush(var_17, (var_11[var_22], var_22))\n var_9[var_22] = var_3\n\n for var_15 in range(var_4):\n if var_11[var_15] == float(\"inf\"):\n print(\"INF\")\n else:\n print((\"{}\".format(var_11[var_15])))\n\n\nif __name__ == \"__main__\":\n\n var_4, var_2, var_18 = [int(var_24) for var_24 in input().split(\" \")]\n var_12 = []\n for var_15 in range(var_2):\n var_12.append(list(map(int, input().split(\" \"))))\n\n func_3(var_4, var_18, var_12)\n", "fast_code": "import heapq\n\nvar_6, var_5, var_8 = map(int, input().split(\" \"))\nvar_12 = [[] for var_4 in range(var_6)]\nfor var_4 in range(var_5):\n var_9, var_10, var_13 = map(int, input().split(\" \"))\n var_12[var_9].append((var_10, var_13))\nvar_7 = []\nheapq.heappush(var_7, (0, var_8))\nvar_3 = [float(\"inf\")] * var_6\nvar_3[var_8] = 0\nwhile len(var_7):\n var_11 = heapq.heappop(var_7)[1]\n for var_10, var_13 in var_12[var_11]:\n var_1 = var_3[var_11] + var_13\n if var_1 < var_3[var_10]:\n var_3[var_10] = var_1\n heapq.heappush(var_7, (var_1, var_10))\n[print(var_2) if var_2 < float(\"inf\") else print(\"INF\") for var_2 in var_3]\n", "slow_time": 206184223, "fast_time": 62487717, "speedup": 3.2996, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_7"} -{"pair_id": "python_251", "problem_id": "p02725", "language": "python", "slow_code": "from sys import stdin\n\nvar_6 = stdin.readline\nvar_9, var_7 = [int(var_11) for var_11 in var_6().strip().split()]\nvar_1 = [int(var_11) for var_11 in var_6().strip().split()]\nvar_4 = [0] * (var_7 * 2)\nfor var_5 in range(var_7 - 1):\n var_4[var_5] = var_1[var_5 + 1] - var_1[var_5]\nvar_4[var_7 - 1] = var_9 - var_1[var_7 - 1] + var_1[0]\nvar_4[2 * var_7 - 1] = var_9 - var_1[var_7 - 1] + var_1[0]\nfor var_5 in range(var_7 - 1):\n var_4[var_7 + var_5] = var_1[var_5 + 1] - var_1[var_5]\nvar_8 = 999999999\nvar_2 = 0\nvar_10 = 0\nvar_3 = var_7 - 1\nfor var_5 in range(var_7 * 2):\n if var_2 < var_3:\n var_10 += var_4[var_5]\n var_2 += 1\n else:\n if var_8 > var_10:\n var_8 = var_10\n var_10 += var_4[var_5]\n var_10 -= var_4[var_5 - var_3]\nprint(var_8)\n", "fast_code": "var_2, var_3 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_1 += [var_1[0] + var_2]\nprint((var_2 - max(var_1[var_4 + 1] - var_1[var_4] for var_4 in range(var_3))))\n", "slow_time": 65037207, "fast_time": 23248372, "speedup": 2.7975, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_0"} -{"pair_id": "python_7412", "problem_id": "p02912", "language": "python", "slow_code": "def func_1(var_14, var_11, var_10):\n\n var_12 = 0\n var_8 = var_10 - 1\n while var_8 - var_12 > 1:\n var_13 = var_12 + (var_8 - var_12) // 2\n var_7 = var_11[var_13]\n if var_7 >= var_14:\n var_8 = var_13\n else:\n var_12 = var_13\n return var_12\n\n\nvar_3 = input().split()\nvar_5 = int(var_3[0])\nvar_4 = int(var_3[1])\n\n\nvar_1 = list(map(int, input().split()))\nvar_1.sort()\nwhile var_4 > 0:\n var_4 -= 1\n var_14 = var_1.pop(var_5 - 1)\n var_14 = var_14 // 2\n if len(var_1) == 0:\n var_6 = 0\n elif var_14 < var_1[0]:\n var_6 = 0\n else:\n var_6 = func_1(var_14, var_1, var_5 - 1) + 1\n\n var_1[var_6:var_6] = [var_14]\nvar_2 = 0\nfor var_9 in range(var_5):\n var_2 += var_1[var_9]\nprint(var_2)\n", "fast_code": "def func_1(var_4, var_3, var_1):\n if var_4 == 1:\n return var_1[0] // (2**var_3)\n var_1.sort(key=lambda var_5: -var_5)\n var_2 = [var_1]\n for _ in range(var_3):\n var_7 = 0\n var_9 = var_2[0][0] if var_2[0] else -1\n for var_8 in range(1, len(var_2)):\n if var_2[var_8] and var_2[var_8][0] > var_9:\n var_7 = var_8\n var_9 = var_2[var_8][0]\n var_10 = var_2[var_7].pop(0) // 2\n if len(var_2) == var_7 + 1:\n var_2 += [[]]\n var_2[var_7 + 1] += [var_10]\n if not (var_2[0]):\n var_2.pop(0)\n return sum([sum(var_6) for var_6 in var_2])\n\n\nvar_4, var_3 = tuple([int(var_11) for var_11 in input().split(\" \")])\nvar_1 = [int(var_11) for var_11 in input().split()]\nprint((func_1(var_4, var_3, var_1)))\n", "slow_time": 529707210, "fast_time": 75792722, "speedup": 6.9889, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_12"} -{"pair_id": "python_13252", "problem_id": "p02699", "language": "python", "slow_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nvar_2 = 10**9 + 7\nvar_1 = float(\"inf\")\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\nvar_3, var_4 = func_2()\nif var_3 <= var_4:\n print(\"unsafe\")\nelse:\n print(\"safe\")\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nif var_1 <= var_2:\n print(\"unsafe\")\nelif var_1 > var_2:\n print(\"safe\")\n", "slow_time": 41778893, "fast_time": 13471864, "speedup": 3.1012, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_11"} -{"pair_id": "python_5378", "problem_id": "p02417", "language": "python", "slow_code": "var_1 = [0] * 26\nvar_4 = \"abcdefghijklmnopqrstuvwxyz\"\ntry:\n while True:\n var_3 = list(input().upper())\n for var_2 in var_3:\n if var_2 == \"A\":\n var_1[0] += 1\n elif var_2 == \"B\":\n var_1[1] += 1\n elif var_2 == \"C\":\n var_1[2] += 1\n elif var_2 == \"D\":\n var_1[3] += 1\n elif var_2 == \"E\":\n var_1[4] += 1\n elif var_2 == \"F\":\n var_1[5] += 1\n elif var_2 == \"G\":\n var_1[6] += 1\n elif var_2 == \"H\":\n var_1[7] += 1\n elif var_2 == \"I\":\n var_1[8] += 1\n elif var_2 == \"J\":\n var_1[9] += 1\n elif var_2 == \"K\":\n var_1[10] += 1\n elif var_2 == \"L\":\n var_1[11] += 1\n elif var_2 == \"M\":\n var_1[12] += 1\n elif var_2 == \"N\":\n var_1[13] += 1\n elif var_2 == \"O\":\n var_1[14] += 1\n elif var_2 == \"P\":\n var_1[15] += 1\n elif var_2 == \"Q\":\n var_1[16] += 1\n elif var_2 == \"R\":\n var_1[17] += 1\n elif var_2 == \"S\":\n var_1[18] += 1\n elif var_2 == \"T\":\n var_1[19] += 1\n elif var_2 == \"U\":\n var_1[20] += 1\n elif var_2 == \"V\":\n var_1[21] += 1\n elif var_2 == \"W\":\n var_1[22] += 1\n elif var_2 == \"X\":\n var_1[23] += 1\n elif var_2 == \"Y\":\n var_1[24] += 1\n elif var_2 == \"Z\":\n var_1[25] += 1\nexcept EOFError:\n pass\nfor var_2 in range(26):\n print((var_4[var_2 : var_2 + 1], \":\", str(var_1[var_2])))\n", "fast_code": "import string\nimport sys\n\nvar_5 = \"\"\nfor var_4 in sys.stdin:\n var_5 += var_4\nfor var_4 in range(26):\n var_2 = string.ascii_lowercase[var_4]\n var_1 = string.ascii_uppercase[var_4]\n var_3 = var_5.count(var_2) + var_5.count(var_1)\n print((\"{0} : {1}\".format(var_2, var_3)))\n", "slow_time": 119389800, "fast_time": 31464588, "speedup": 3.7944, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_14"} -{"pair_id": "python_16644", "problem_id": "p03147", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\nvar_4 = sys.stdin.readline\nvar_2 = float(\"inf\")\nvar_5 = 10**9 + 7\n\n\ndef func_1():\n var_6 = int(eval(var_4()))\n var_1 = list(map(int, var_4().split()))\n var_7 = 0\n var_3 = 0\n while sum(var_1) != 0:\n if var_1[var_3] != 0:\n while var_3 < var_6 and var_1[var_3] != 0:\n var_1[var_3] -= 1\n var_3 += 1\n var_7 += 1\n var_3 = 0\n else:\n var_3 += 1\n print(var_7)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_4 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nvar_1 = var_2[0]\nfor var_3 in range(1, var_4):\n if var_2[var_3] > var_2[var_3 - 1]:\n var_1 += var_2[var_3] - var_2[var_3 - 1]\nprint(var_1)\n", "slow_time": 120629494, "fast_time": 24546115, "speedup": 4.9144, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_5"} -{"pair_id": "python_3705", "problem_id": "p02731", "language": "python", "slow_code": "import scipy.optimize\n\nvar_1 = int(eval(input()))\nvar_2 = lambda var_4: -1 * (var_4[0] * var_4[1] * (var_1 - var_4[0] - var_4[1]))\nvar_3 = scipy.optimize.minimize(\n var_2, (0.1, 0.2), bounds=((0, None), (0, None)), tol=1e-6\n)\nprint((-1 * var_3.fun))\n", "fast_code": "var_1 = int(eval(input()))\nprint((\"{:.12f}\".format(var_1**3 / 27)))\n", "slow_time": 38579398487, "fast_time": 10493176, "speedup": 3676.6179, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_18"} -{"pair_id": "python_9789", "problem_id": "p03806", "language": "python", "slow_code": "from itertools import permutations\nimport sys\n\nsys.setrecursionlimit(10**6)\nfrom bisect import *\nfrom collections import *\nfrom heapq import *\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return map(int, sys.stdin.readline().split())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_7():\n return sys.stdin.readline()[:-1]\n\n\ndef func_4(var_17):\n return [func_2() for _ in range(var_17)]\n\n\nvar_10 = lambda var_20: int(var_20) - 1\n\n\ndef func_6():\n return map(var_10, sys.stdin.readline().split())\n\n\ndef func_3():\n return list(map(var_10, sys.stdin.readline().split()))\n\n\nvar_15 = lambda var_20: print(*var_20, sep=\"\\n\")\nvar_6 = [(1, 0), (0, 1), (-1, 0), (0, -1)]\n\n\ndef func_8():\n var_9 = 10**9\n var_14, var_12, var_13 = func_5()\n var_19 = []\n var_5 = []\n for _ in range(var_14):\n var_1, var_3, var_4 = func_5()\n var_19.append(var_1 * var_13 - var_3 * var_12)\n var_5.append(var_4)\n var_7 = [[var_9] * 8005 for _ in range(var_14 + 1)]\n for var_8 in range(var_14):\n var_18, var_4 = var_19[var_8], var_5[var_8]\n var_7[var_8 + 1][4000 + var_18] = min(var_7[var_8 + 1][4000 + var_18], var_4)\n for var_11 in range(8005):\n var_16 = var_7[var_8][var_11]\n if var_16 == var_9:\n continue\n var_7[var_8 + 1][var_11] = min(var_7[var_8 + 1][var_11], var_16)\n var_7[var_8 + 1][var_11 + var_18] = min(\n var_7[var_8 + 1][var_11 + var_18], var_16 + var_4\n )\n var_2 = var_7[-1][4000]\n if var_2 == var_9:\n print(-1)\n else:\n print(var_2)\n\n\nfunc_8()\n", "fast_code": "def func_1():\n var_3, var_1, var_2 = list(map(int, input().split()))\n var_4, var_8, var_11 = [], [], []\n for var_14 in range(var_3):\n var_5, var_9, var_12 = list(map(int, input().split()))\n var_4.append(var_5)\n var_8.append(var_9)\n var_11.append(var_12)\n var_6 = sum(var_4)\n var_10 = sum(var_8)\n var_15 = 40 * 100 + 1\n var_13 = [[var_15] * (var_10 + 1) for var_14 in range(var_6 + 1)]\n var_13[0][0] = 0\n for var_14 in range(var_3):\n for var_16 in range(var_6, var_4[var_14] - 1, -1):\n for var_17 in range(var_10, var_8[var_14] - 1, -1):\n var_13[var_16][var_17] = min(\n var_13[var_16][var_17],\n var_13[var_16 - var_4[var_14]][var_17 - var_8[var_14]]\n + var_11[var_14],\n )\n var_7 = var_15\n for var_16 in range(1, var_6 + 1):\n for var_17 in range(1, var_10 + 1):\n if var_16 * var_2 == var_17 * var_1:\n var_7 = min(var_7, var_13[var_16][var_17])\n if var_7 < var_15:\n print(var_7)\n else:\n print((-1))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 340450294, "fast_time": 53219560, "speedup": 6.3971, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_8"} -{"pair_id": "python_687", "problem_id": "p03244", "language": "python", "slow_code": "def func_1():\n var_4, *var_6 = list(map(int, open(0).read().split()))\n var_1 = [0] * int(1e5)\n var_2 = [0] * int(1e5)\n for var_3, var_5 in zip(*[iter(var_6)] * 2):\n var_1[var_3 - 1] += 1\n var_2[var_5 - 1] += 1\n if var_1.index(max(var_1)) == var_2.index(max(var_2)):\n var_7 = max(var_1)\n var_8 = max(var_2)\n var_1[var_1.index(var_7)] = 0\n var_2[var_2.index(var_8)] = 0\n print((min(var_4 - var_7 - max(var_2), var_4 - var_8 - max(var_1))))\n else:\n print((var_4 - max(var_1) - max(var_2)))\n return\n\n\nfunc_1()\n", "fast_code": "from collections import Counter\n\nvar_6 = int(eval(input()))\nvar_11 = list(map(int, input().split()))\n\"\"\"\"\"\"\nif len(set(var_11)) == 1:\n print((len(var_11) // 2))\n exit()\n\"\"\"\"\"\"\nvar_8 = Counter(var_11[1::2])\nvar_2 = Counter(var_11[::2])\n\"\"\"\"\"\"\nvar_5 = 0\nvar_7 = None\nvar_1 = None\nfor var_10, var_9 in var_8.most_common(2):\n for var_4, var_3 in var_2.most_common(2):\n if var_10 == var_4:\n continue\n if var_9 + var_3 > var_5:\n var_5 = var_9 + var_3\n var_7 = var_10\n var_1 = var_4\n\"\"\"\"\"\"\nprint((len(var_11) - var_5))\n", "slow_time": 2695635546, "fast_time": 57014553, "speedup": 47.2798, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_8"} -{"pair_id": "python_3570", "problem_id": "p02578", "language": "python", "slow_code": "import sys\n\nvar_5 = sys.stdin.readline\n\n\ndef func_1():\n var_7 = int(eval(var_5()))\n var_1 = list(map(int, var_5().split()))\n var_3 = 0\n var_6 = var_1[0]\n for var_4 in range(1, var_7):\n if var_1[var_4] < var_6:\n var_2 = var_6 - var_1[var_4]\n var_3 += var_2\n var_6 = max(var_6, var_1[var_4])\n print(var_3)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "_ = int(eval(input()))\nvar_3 = var_2 = 0\nfor var_1 in map(int, input().split()):\n var_2 = max(var_2, var_1)\n var_3 += var_2 - var_1\nprint(var_3)\n", "slow_time": 36662786, "fast_time": 18105235, "speedup": 2.025, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_15"} -{"pair_id": "python_3163", "problem_id": "p02724", "language": "python", "slow_code": "var_3 = int(eval(input()))\nvar_1 = -1\nvar_2 = -1\nwhile var_3 >= 0:\n var_3 = var_3 - 500\n var_1 = var_1 + 1\nvar_3 = var_3 + 500\nif var_3 == 0:\n var_4 = var_1 * 1000\n print(var_4)\nelse:\n while var_3 >= 0:\n var_3 = var_3 - 5\n var_2 = var_2 + 1\n var_4 = var_1 * 1000 + var_2 * 5\n print(var_4)\n", "fast_code": "var_3 = int(eval(input()))\nvar_1 = var_3 // 500\nvar_2 = (var_3 % 500) // 5\nvar_4 = var_1 * 1000 + var_2 * 5\nprint(var_4)\n", "slow_time": 2799708692, "fast_time": 12628709, "speedup": 221.694, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_14"} -{"pair_id": "python_13527", "problem_id": "p02406", "language": "python", "slow_code": "var_3 = int(input())\nvar_2 = 1\nvar_1 = []\nwhile var_2 <= var_3:\n var_4 = var_2\n if var_4 % 3 == 0:\n var_1.append(str(var_2))\n else:\n while var_4:\n if var_4 % 10 == 3:\n var_1.append(str(var_2))\n break\n var_4 /= 10\n var_2 += 1\nprint(\"\", \" \".join(var_1))\n", "fast_code": "var_2 = int(input())\nfor var_1 in range(1, var_2 + 1):\n if var_1 % 3 == 0:\n print(f\" {var_1}\", end=\"\")\n else:\n var_3 = var_1\n while var_3:\n if var_3 % 10 == 3:\n print(f\" {var_1}\", end=\"\")\n break\n var_3 //= 10\nprint()\n", "slow_time": 1499193681, "fast_time": 39659794, "speedup": 37.8013, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_17"} -{"pair_id": "python_9306", "problem_id": "p02792", "language": "python", "slow_code": "var_1 = int(eval(input()))\n\n\ndef func_1(var_3, var_4):\n var_6 = 0\n var_7 = str(var_3)\n for var_5 in range(1, var_1 + 1):\n if var_5 % 10 != var_4:\n continue\n if str(var_5)[0] != var_7:\n continue\n var_6 += 1\n return var_6\n\n\nvar_2 = 0\nfor var_3 in range(10):\n for var_4 in range(10):\n var_2 += func_1(var_3, var_4) * func_1(var_4, var_3)\nprint(var_2)\n", "fast_code": "import sys\n\nvar_8 = sys.stdin.readline\nvar_2 = 10**9 + 7\nvar_1 = float(\"INF\")\nsys.setrecursionlimit(10**5)\n\n\ndef func_1():\n var_3 = int(var_8())\n var_5 = [[0] * 10 for _ in range(10)]\n var_4 = 0\n for var_7 in range(1, var_3 + 1):\n var_9 = str(var_7)\n var_6 = int(var_9[0])\n var_10 = int(var_9[-1])\n var_4 += 2 * var_5[var_10][var_6]\n if var_6 == var_10:\n var_4 += 1\n var_5[var_6][var_10] += 1\n print(var_4)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 1958045613, "fast_time": 102116168, "speedup": 19.1747, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_28"} -{"pair_id": "python_16508", "problem_id": "p02763", "language": "python", "slow_code": "import sys\n\nvar_11 = sys.stdin.readline\n\n\nclass Class_1:\n def __init__(self, var_13):\n self.size = var_13\n self.tree = [0] * (var_13 + 1)\n\n def func_2(self, var_10):\n if var_10 == 0:\n return 0\n var_15 = 0\n while var_10 > 0:\n var_15 += self.tree[var_10]\n var_10 -= var_10 & -var_10\n return var_15\n\n def func_1(self, var_10, var_17):\n while var_10 <= self.size:\n self.tree[var_10] += var_17\n var_10 += var_10 & -var_10\n\n\nvar_6 = \"abcdefghijklmnopqrstuvwxyz\"\nvar_2 = int(var_11().strip())\nvar_4 = list(var_11().strip())\nvar_3 = int(var_11().strip())\nvar_9 = dict()\nvar_1 = 5 * 10**5 + 2\nfor var_8 in var_6:\n var_9[var_8] = Class_1(var_1)\n for var_10, var_5 in enumerate(var_4):\n if var_5 == var_8:\n var_9[var_8].add(var_10 + 1, 1)\nfor _ in range(var_3):\n var_16, var_10, var_8 = var_11().split()\n var_16 = int(var_16)\n if var_16 == 1:\n var_10 = int(var_10)\n if var_4[var_10 - 1] != var_8:\n var_9[var_4[var_10 - 1]].add(var_10, -1)\n var_9[var_8].add(var_10, 1)\n var_4[var_10 - 1] = var_8\n else:\n\n var_12, var_14 = int(var_10), int(var_8)\n\n var_15 = 0\n for var_5 in var_6:\n var_7 = var_9[var_5]\n\n var_15 += var_7.sum(var_14) - var_7.sum(var_12 - 1) > 0\n print(var_15)\n", "fast_code": "import sys\nfrom bisect import bisect, insort_left\n\nvar_11 = lambda: map(int, input().rstrip().split())\n\n\ndef func_1():\n var_1 = int(input())\n var_3 = list(input())\n var_2 = int(input())\n var_6 = ord(\"a\")\n var_4 = [[] for var_10 in range(26)]\n for var_10, var_7 in enumerate(var_3):\n var_8 = ord(var_7) - var_6\n var_4[var_8].append(var_10)\n var_5 = []\n for var_9, var_10, var_12 in (var_14.split() for var_14 in sys.stdin):\n var_10 = int(var_10) - 1\n if var_9 == \"1\":\n if var_3[var_10] == var_12:\n continue\n var_7 = ord(var_3[var_10]) - var_6\n var_17 = var_4[var_7]\n var_17.pop(bisect(var_17, var_10) - 1)\n var_3[var_10] = var_12\n var_7 = ord(var_12) - var_6\n insort_left(var_4[var_7], var_10)\n elif var_9 == \"2\":\n var_12 = int(var_12) - 1\n var_16 = 0\n for var_17 in var_4:\n var_15 = len(var_17)\n var_13 = bisect(var_17, var_10 - 1, 0, var_15)\n if var_13 == var_15:\n continue\n if var_10 <= var_17[var_13] <= var_12:\n var_16 += 1\n var_5.append(var_16)\n print(*var_5, sep=\"\\n\")\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 565348597, "fast_time": 95453856, "speedup": 5.9227, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_19"} -{"pair_id": "python_10882", "problem_id": "p02570", "language": "python", "slow_code": "def func_2():\n return list(map(int, input().split()))\n\n\ndef func_1():\n return int(input())\n\n\ndef func_10():\n return print(\"Yes\")\n\n\ndef func_6():\n return print(\"No\")\n\n\nvar_1 = float(\"inf\")\nfrom collections import deque, defaultdict, Counter\nfrom heapq import heappop, heappush\nfrom itertools import product, combinations\nfrom functools import reduce, lru_cache\nfrom math import pi, gcd\nfrom decimal import Decimal\n\n\nclass Class_1:\n \"\"\"\"\"\"\n\n def __init__(self, var_10, var_7=10**9 + 7):\n self.mod = var_7\n self.modinv = self.make_modinv_list(var_10)\n self.fac, self.facinv = self.make_factorial_list(var_10)\n\n def __call__(self, var_9, var_11):\n return (\n self.fac[var_9]\n * self.facinv[var_11]\n % self.mod\n * self.facinv[var_9 - var_11]\n % self.mod\n )\n\n def func_4(self, var_9):\n\n var_4 = [1]\n var_5 = [1]\n for var_6 in range(1, var_9 + 1):\n var_4.append(var_4[var_6 - 1] * var_6 % self.mod)\n var_5.append(var_5[var_6 - 1] * self.modinv[var_6] % self.mod)\n return var_4, var_5\n\n def func_5(self, var_9):\n\n var_8 = [0] * (var_9 + 1)\n var_8[1] = 1\n for var_6 in range(2, var_9 + 1):\n var_8[var_6] = (\n self.mod - self.mod // var_6 * var_8[self.mod % var_6] % self.mod\n )\n return var_8\n\n\nclass Class_2:\n def __init__(self, var_2):\n self.p = list(range(var_2))\n self.rank = [0] * var_2\n self.size = [1] * var_2\n\n def func_7(self, var_16):\n if self.p[var_16] != var_16:\n self.p[var_16] = self.root(self.p[var_16])\n return self.p[var_16]\n\n def func_8(self, var_16, var_17):\n return self.root(var_16) == self.root(var_17)\n\n def func_9(self, var_16, var_17):\n var_14 = self.root(var_16)\n var_15 = self.root(var_17)\n if var_14 == var_15:\n return\n if self.rank[var_14] < self.rank[var_15]:\n self.p[var_14] = var_15\n self.size[var_15] += self.size[var_14]\n self.size[var_14] = 0\n else:\n self.p[var_15] = var_14\n self.size[var_14] += self.size[var_15]\n self.size[var_15] = 0\n if self.rank[var_14] == self.rank[var_15]:\n self.rank[var_14] += 1\n\n def func_3(self, var_16):\n return self.size[self.root(var_16)]\n\n\nvar_3, var_13, var_12 = func_2()\nif var_3 <= var_13 * var_12:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "var_1, var_3, var_2 = list(map(int, input().split()))\nif var_3 * var_2 >= var_1:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 146040359, "fast_time": 10725043, "speedup": 13.6168, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_11"} -{"pair_id": "python_14861", "problem_id": "p02900", "language": "python", "slow_code": "def func_1(var_9, var_10):\n if var_9 < var_10:\n var_9, var_10 = var_10, var_9\n while var_10 > 0:\n var_9, var_10 = var_10, var_9 % var_10\n return var_9\n\n\nvar_3 = 10**6\nvar_4 = [1 for var_7 in range(var_3 + 1)]\nvar_4[0] = 0\nvar_4[1] = 0\nfor var_7 in range(2, int((var_3 + 1) ** 0.5) + 1):\n for var_8 in range(var_7 * var_7, var_3 + 1, var_7):\n var_4[var_8] = 0\nvar_5 = []\nfor var_7 in range(var_3):\n if var_4[var_7] == 1:\n var_5.append(var_7)\nvar_1, var_2 = list(map(int, input().split()))\nvar_9 = func_1(var_1, var_2)\nvar_6 = 1\nfor var_10 in var_5:\n if var_9 % var_10 == 0:\n var_6 += 1\n while var_9 % var_10 == 0:\n var_9 = var_9 // var_10\nif var_9 > 1:\n var_6 += 1\nprint(var_6)\n", "fast_code": "import math\nimport fractions\n\n\ndef func_2(var_8):\n for var_6 in range(2, int(math.sqrt(var_8)) + 1):\n if var_8 % var_6 == 0:\n return False\n return True\n\n\ndef func_1():\n\n var_1, var_2 = list(map(int, input().split()))\n var_7 = 4\n var_6 = 1\n var_4 = 1\n if var_1 > var_2:\n var_1, var_2 = var_2, var_1\n var_9 = set()\n\n if var_1 % 2 == 0:\n var_9.add(2)\n while var_1 % 2 == 0:\n var_1 //= 2\n if var_1 % 3 == 0:\n var_9.add(3)\n while var_1 % 3 == 0:\n var_1 //= 3\n\n var_3 = math.sqrt(var_1) + 1\n\n while var_7 <= var_3 and var_7 != 1:\n if var_1 % var_7 == 0:\n var_9.add(var_7)\n while var_1 % var_7 == 0:\n var_1 //= var_7\n var_7 += 1\n\n if var_9 == set() and var_1 != 1:\n var_9.add(var_1)\n if func_2(var_1) and var_1 != 1:\n var_9.add(var_1)\n\n var_7 = 4\n var_6 = 1\n var_4 = 1\n var_10 = set()\n\n if var_2 % 2 == 0:\n var_10.add(2)\n while var_2 % 2 == 0:\n var_2 //= 2\n if var_2 % 3 == 0:\n var_10.add(3)\n while var_2 % 3 == 0:\n var_2 //= 3\n\n var_3 = math.sqrt(var_2) + 1\n\n while var_7 <= var_3 and var_7 != 1:\n if var_2 % var_7 == 0:\n var_10.add(var_7)\n while var_2 % var_7 == 0:\n var_2 //= var_7\n var_7 += 1\n\n if var_10 == set() and var_2 != 1:\n var_10.add(var_2)\n if func_2(var_2) and var_2 != 1:\n var_10.add(var_2)\n\n for var_5 in var_9:\n if var_5 in var_10:\n var_4 += 1\n print(var_4)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 293177338513, "fast_time": 116819770, "speedup": 2509.6552, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_22"} -{"pair_id": "python_2932", "problem_id": "p03146", "language": "python", "slow_code": "var_5 = int(eval(input()))\nvar_1 = [var_5]\nvar_3 = 0\nvar_2 = -1\nwhile var_2 == -1:\n if var_1[var_3] % 2 == 0:\n var_1.append(var_1[var_3] // 2)\n else:\n var_1.append(3 * var_1[var_3] + 1)\n var_3 += 1\n for var_4 in range(len(var_1) - 1):\n if var_1[var_3] == var_1[var_4]:\n var_2 = var_3\n break\nprint((var_2 + 1))\n", "fast_code": "var_2 = int(eval(input()))\nif var_2 == 1 or var_2 == 2 or var_2 == 4:\n var_1 = 0\nelse:\n var_1 = 0\n while var_2 != 4:\n if var_2 % 2 == 0:\n var_2 = var_2 / 2\n var_1 += 1\n else:\n var_2 = 3 * var_2 + 1\n var_1 += 1\nprint((var_1 + 4))\n", "slow_time": 142367227, "fast_time": 29373837, "speedup": 4.8467, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_15"} -{"pair_id": "python_2788", "problem_id": "p02577", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_1 = func_3()\nprint((\"Yes\" if sum(var_1) % 9 == 0 else \"No\"))\n", "fast_code": "if int(eval(input())) % 9 == 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 55150974, "fast_time": 11988202, "speedup": 4.6004, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_0"} -{"pair_id": "python_15161", "problem_id": "p03775", "language": "python", "slow_code": "import math\n\nvar_7 = int(eval(input()))\nif var_7 < 10:\n print((1))\nelse:\n var_1 = 0\n for var_4 in range(1, int(math.sqrt(var_7)) + 1):\n if var_7 % var_4 == 0:\n var_1 = var_4\n var_3 = var_7 // var_1\n var_5 = 1\n while True:\n var_6 = var_3 / (10**var_5)\n if var_6 >= 1 and var_6 < 10:\n var_2 = var_5 + 1\n break\n var_5 += 1\n print(var_2)\n", "fast_code": "def func_1(var_8, var_4):\n if var_4:\n if var_8 <= 1:\n return [1], 1\n else:\n var_7 = 2\n var_10 = []\n var_5 = 1\n while var_7 * var_7 <= var_8:\n var_3 = 0\n while var_8 % var_7 == 0:\n var_8 //= var_7\n var_10.append(var_7)\n if var_3 >= 1:\n var_5 *= var_3 + 1\n var_7 += 1\n if var_8 >= 2:\n var_10.append(var_8)\n var_5 *= 2\n return var_10, var_5\n else:\n if var_8 <= 1:\n return [1], [1], 1\n else:\n var_7 = 2\n var_10 = []\n var_9 = []\n var_5 = 1\n while var_7 * var_7 <= var_8:\n var_3 = 0\n while var_8 % var_7 == 0:\n var_8 //= var_7\n var_3 += 1\n if var_3 >= 1:\n var_10.append(var_7)\n var_9.append(var_3)\n var_5 *= var_3 + 1\n var_7 += 1\n if var_8 >= 2:\n var_10.append(var_8)\n var_9.append(1)\n var_5 *= 2\n return var_10, var_9, var_5\n\n\nfrom itertools import combinations\nfrom operator import mul\nfrom functools import reduce\n\nvar_8 = int(eval(input()))\nvar_10, _ = func_1(var_8, True)\nvar_6 = len(str(var_8))\nfor var_12 in range(1, len(var_10) + 1):\n for var_1 in set(reduce(mul, var_11) for var_11 in combinations(var_10, var_12)):\n var_2 = var_8 // var_1\n var_6 = min(var_6, max(len(str(var_1)), len(str(var_2))))\nprint(var_6)\n", "slow_time": 1778046779, "fast_time": 233216425, "speedup": 7.624, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_7"} -{"pair_id": "python_1053", "problem_id": "p03329", "language": "python", "slow_code": "var_7 = []\nvar_7.append(1)\nvar_11 = 1\nwhile var_11 <= 10**5:\n var_11 *= 9\n var_7.append(var_11)\nvar_6 = []\nvar_6.append(1)\nvar_11 = 1\nwhile var_11 <= 10**5:\n var_11 *= 6\n var_6.append(var_11)\nimport bisect\n\nvar_8 = int(eval(input()))\nvar_2 = 10**6\nfor var_4 in range(0, var_8 + 1):\n var_1 = var_4\n var_3 = var_8 - var_4\n var_9 = 0\n while var_1 > 0:\n var_5 = bisect.bisect_left(var_6, var_1)\n if var_1 == var_6[var_5]:\n var_1 -= var_6[var_5]\n else:\n var_1 -= var_6[var_5 - 1]\n var_9 += 1\n var_10 = 0\n while var_3 > 0:\n var_5 = bisect.bisect_left(var_7, var_3)\n if var_3 == var_7[var_5]:\n var_3 -= var_7[var_5]\n else:\n var_3 -= var_7[var_5 - 1]\n var_10 += 1\n var_2 = min(var_2, var_9 + var_10)\nprint(var_2)\n", "fast_code": "var_1 = 100100100\n\n\ndef func_1():\n var_2 = int(eval(input()))\n var_4 = [var_1] * (var_2 + 1)\n var_4[0] = 0\n for var_3 in range(1, var_2 + 1):\n for var_5 in range(1, var_3 + 1):\n if 9**var_5 > var_3:\n break\n var_4[var_3] = min(var_4[var_3], var_4[var_3 - 9**var_5] + 1)\n for var_6 in range(1, var_3 + 1):\n if 6**var_6 > var_3:\n break\n var_4[var_3] = min(var_4[var_3], var_4[var_3 - 6**var_6] + 1)\n var_4[var_3] = min(var_4[var_3], var_4[var_3 - 1] + 1)\n print((var_4[var_2]))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 1225826012, "fast_time": 231598099, "speedup": 5.2929, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_20"} -{"pair_id": "python_14922", "problem_id": "p03212", "language": "python", "slow_code": "import itertools\n\nvar_4 = int(eval(input()))\nvar_1 = 0\nfor var_2 in range(len(str(var_4)) + 1):\n for var_3 in list(itertools.product((3, 5, 7), repeat=var_2)):\n if (3 in var_3) and (5 in var_3) and (7 in var_3):\n if var_4 >= int((\"\".join(list(map(str, var_3))))):\n var_1 += 1\nprint(var_1)\n", "fast_code": "import sys\nfrom collections import deque\n\nvar_3 = sys.stdin.readline\n\n\ndef func_1(var_1):\n var_6 = 0\n var_5 = deque([\"3\", \"5\", \"7\"])\n while var_5:\n var_4 = var_5.popleft()\n if int(var_4) > var_1:\n break\n if all((\"3\" in var_4, \"5\" in var_4, \"7\" in var_4)):\n var_6 += 1\n var_5.append(\"\".join([var_4, \"3\"]))\n var_5.append(\"\".join([var_4, \"5\"]))\n var_5.append(\"\".join([var_4, \"7\"]))\n return var_6\n\n\ndef func_2():\n var_1 = int(eval(var_3()))\n var_2 = func_1(var_1)\n print(var_2)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "slow_time": 6466466009, "fast_time": 1381848520, "speedup": 4.6796, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_20"} -{"pair_id": "python_7751", "problem_id": "p02707", "language": "python", "slow_code": "import sys\nfrom collections import *\nimport heapq\nimport math\nfrom math import gcd\nimport bisect\nimport copy\nfrom itertools import permutations, accumulate, combinations, product\n\n\ndef func_1():\n return sys.stdin.readline()[:-1]\n\n\ndef func_2(var_5):\n return [0] + list(accumulate(var_5))\n\n\nvar_6 = pow(10, 9) + 7\nvar_2 = [chr(ord(\"a\") + var_4) for var_4 in range(26)]\nvar_3 = [[1, 0], [0, 1], [-1, 0], [0, -1]]\nvar_7 = int(eval(func_1()))\nvar_1 = list(map(int, func_1().split()))\nvar_5 = [0] * var_7\nfor var_4 in range(var_7 - 1):\n var_5[var_1[var_4] - 1] += 1\n\nfor var_4 in range(var_7):\n print((var_5[var_4]))\n", "fast_code": "var_5 = int(eval(input()))\nvar_3 = input().split()\nvar_2 = [0] * var_5\nfor var_4 in var_3:\n var_2[int(var_4) - 1] += 1\nvar_1 = list([str(var_6) for var_6 in var_2])\nprint((\"\\n\".join(var_1)))\n", "slow_time": 65718125, "fast_time": 26724339, "speedup": 2.4591, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_13"} -{"pair_id": "python_14245", "problem_id": "p03558", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**6)\nvar_12 = sys.stdin.readline\nvar_8 = int(eval(input()))\nvar_4 = [[] for _ in range(var_8)]\nfor var_7 in range(var_8):\n var_4[var_7].append(((var_7 + 1) % var_8, 1))\n if var_7:\n var_4[var_7].append((10 * var_7 % var_8, 0))\n\n\"\"\"\"\"\"\nfrom heapq import *\n\n\ndef func_1(var_4, var_13):\n var_9 = len(var_4)\n var_3 = [float(\"inf\")] * (var_9)\n var_10 = var_9 - 1\n var_3[var_13] = 0\n var_11 = [(0, var_13)]\n while var_11 and var_10:\n var_1, var_15 = var_5(var_11)\n if var_3[var_15] < var_1:\n continue\n var_10 -= 1\n for var_14, var_2 in var_4[var_15]:\n if var_3[var_15] + var_2 < var_3[var_14]:\n var_3[var_14] = var_3[var_15] + var_2\n var_6(var_11, (var_3[var_14], var_14))\n return var_3\n\n\nvar_3 = func_1(var_4, 1)\nprint((var_3[0] + 1))\n", "fast_code": "def func_2(var_1):\n var_2 = [False] * var_1\n\n def func_1(var_4):\n while not var_2[var_4]:\n var_2[var_4] = True\n yield var_4\n var_4 = (var_4 * 10) % var_1\n\n var_3 = 0\n var_5 = [0]\n while 1:\n var_3 += 1\n var_6 = []\n for var_4 in var_5:\n for var_7 in func_1((var_4 + 1) % var_1):\n if var_7 == 0:\n return var_3\n var_6.append(var_7)\n var_5 = var_6\n\n\nvar_1 = int(eval(input()))\nprint((func_2(var_1)))\n", "slow_time": 5629421543, "fast_time": 341671713, "speedup": 16.4761, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_1"} -{"pair_id": "python_2422", "problem_id": "p02660", "language": "python", "slow_code": "import itertools\nimport math\nimport fractions\nimport functools\nimport copy\nfrom collections import deque\nfrom functools import reduce\nfrom decimal import Decimal\n\nvar_3 = int(eval(input()))\nvar_5 = {}\nvar_4 = var_3\nvar_2 = 2\nwhile True:\n if var_2 * var_2 > var_3:\n if var_4 > 1:\n var_5[var_4] = 1\n break\n while var_4 % var_2 == 0:\n var_5[var_2] = var_5.get(var_2, 0) + 1\n var_4 = var_4 // var_2\n var_2 += 1\nvar_1 = 0\nfor var_7 in list(var_5.values()):\n var_6 = 1\n while True:\n if var_7 < var_6:\n break\n var_7 -= var_6\n var_6 += 1\n var_1 += 1\nprint(var_1)\n", "fast_code": "var_5 = int(eval(input()))\nif var_5 == 1:\n print((0))\n exit()\nfrom collections import Counter\n\n\ndef func_1(var_5):\n var_2 = Counter()\n if var_5 < 2:\n return var_2\n while var_5 % 2 == 0:\n var_5 //= 2\n var_2[2] += 1\n var_4 = 3\n while var_4 * var_4 <= var_5:\n while var_5 % var_4 == 0:\n var_5 //= var_4\n var_2[var_4] += 1\n var_4 += 2\n if var_5 > 1:\n var_2[var_5] += 1\n return var_2\n\n\nvar_3 = func_1(var_5)\nvar_1 = 0\nfor var_6 in list(var_3.values()):\n var_5 = 1\n while var_6 >= var_5:\n var_6 -= var_5\n var_1 += 1\n var_5 += 1\nprint(var_1)\n", "slow_time": 13215942731, "fast_time": 71245534, "speedup": 185.4985, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_2"} -{"pair_id": "python_17794", "problem_id": "p03456", "language": "python", "slow_code": "var_2, var_3 = list(map(int, input().split()))\nvar_1 = int(str(var_2) + str(var_3))\nfor var_4 in range(1, 10000):\n if var_1 // var_4 == var_4 and var_1 % var_4 == 0:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "fast_code": "var_1, var_2 = input().split()\nvar_3 = var_1 + var_2\nvar_3 = int(var_3)\nfor var_4 in range(1000):\n if var_4**2 == var_3:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "slow_time": 599977093, "fast_time": 74846036, "speedup": 8.0162, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_14"} -{"pair_id": "python_13558", "problem_id": "p02406", "language": "python", "slow_code": "var_2 = int(input())\nvar_1 = 1\nprint(\"\", end=\" \")\nwhile var_1 <= var_2:\n var_3 = var_1\n if var_3 % 3 == 0:\n print(var_1, end=\" \")\n else:\n while var_3:\n if var_3 % 10 == 3:\n print(var_1, end=\" \")\n break\n var_3 /= 10\n var_1 += 1\n", "fast_code": "var_8 = int(eval(input()))\nvar_6 = [var_4 for var_4 in range(1, var_8 + 1) if var_4 % 3 == 0]\nvar_7 = []\nfor var_4 in range(1, var_8 + 1):\n var_5 = var_4\n while True:\n if var_5 == 0:\n break\n elif var_5 % 10 == 3:\n var_7.append(var_4)\n break\n var_5 = var_5 // 10\nvar_1 = set(var_6)\nvar_2 = set(var_7)\nvar_3 = list(var_1 | var_2)\nvar_3.sort()\nprint((\" \" + \" \".join(map(str, var_3))))\n", "slow_time": 1225392025, "fast_time": 56053037, "speedup": 21.8613, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_26"} -{"pair_id": "python_6714", "problem_id": "p00053", "language": "python", "slow_code": "var_7 = [0]\nvar_1 = 10**6\nvar_6 = [1] * var_1\nvar_2 = 0\nfor var_3 in range(2, var_1):\n if var_6[var_3]:\n for var_4 in range(var_3 * var_3, var_1, var_3):\n var_6[var_4] = 0\n var_2 += var_3\n var_7.append(var_2)\nwhile 1:\n var_5 = eval(input())\n if var_5 == 0:\n break\n print(var_7[var_5])\n", "fast_code": "import math\n\nvar_5 = 105000\nvar_7 = int(math.sqrt(var_5))\nvar_4 = [1] * var_5\nvar_4[0] = 0\nfor var_1 in range(1, var_7):\n if var_4[var_1]:\n var_4[2 * var_1 + 1 :: var_1 + 1] = [\n 0 for var_8 in range(2 * var_1 + 1, var_5, var_1 + 1)\n ]\nvar_6 = [0 for var_1 in range(11000)]\nvar_6[0] = 2\nvar_2 = 1\nfor var_1 in range(2, var_5):\n if var_4[var_1]:\n var_6[var_2] = var_1 + 1 + var_6[var_2 - 1]\n var_2 += 1\nwhile True:\n var_3 = int(input())\n if not var_3:\n break\n print(var_6[var_3 - 1])\n", "slow_time": 126327816139, "fast_time": 8131194652, "speedup": 15.5362, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_5"} -{"pair_id": "python_1228", "problem_id": "p02889", "language": "python", "slow_code": "import numpy as np\nfrom scipy.sparse import csr_matrix\nfrom scipy.sparse.csgraph import floyd_warshall\n\nvar_12 = np.int64\nvar_11 = np.int32\n\n\ndef func_1():\n var_17 = open(\"/dev/stdin\")\n var_14 = np.fromstring(var_17.read(), var_12, sep=\" \")\n var_7 = var_14[0]\n var_6 = var_14[1]\n var_5 = var_14[2]\n var_2 = var_14[3 : var_6 * 3 + 3].reshape((-1, 3))\n var_1 = var_2[:, 0] - 1\n var_3 = var_2[:, 1] - 1\n var_4 = var_2[:, 2]\n var_8 = var_14[var_6 * 3 + 3]\n var_16 = (var_14[var_6 * 3 + 4 : 2 * var_8 + var_6 * 3 + 4] - 1).reshape((-1, 2))\n var_15 = var_16[:, 0]\n var_18 = var_16[:, 1]\n var_10 = csr_matrix((var_4, (var_1, var_3)), shape=(var_7, var_7))\n var_9 = np.array(floyd_warshall(var_10, directed=False))\n var_9[var_9 > var_5 + 0.5] = 0\n var_9[var_9 > 0] = 1\n var_13 = np.array(floyd_warshall(var_9))\n var_13[var_13 == np.inf] = 0\n var_13 = (var_13 + 0.5).astype(int)\n var_19 = var_13[var_15, var_18] - 1\n print((\"\\n\".join(var_19.astype(str).tolist())))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "import sys\n\nvar_17 = lambda: sys.stdin.readline().rstrip()\nvar_16 = lambda: list(map(int, var_17().split()))\n\n\ndef func_1(\n var_7, var_13, var_20=None, var_26=0, var_22=lambda var_4, var_11: var_4 + var_11\n):\n \"\"\"\"\"\"\n var_23 = [[var_20] * var_7 for _ in range(var_7)]\n for var_15 in range(var_7):\n var_23[var_15][var_15] = var_26\n for var_15 in range(var_7):\n for var_18, var_11 in var_13[var_15]:\n if 0 <= var_18 < var_7:\n var_23[var_15][var_18] = var_22(var_26, var_11)\n for var_19 in range(var_7):\n for var_15 in range(var_7):\n if var_15 == var_19:\n continue\n for var_18 in range(var_7):\n if (\n var_18 == var_19\n or var_23[var_15][var_19] == var_20\n or var_23[var_19][var_18] == var_20\n ):\n continue\n var_11 = var_22(var_23[var_15][var_19], var_23[var_19][var_18])\n if var_23[var_15][var_18] == var_20 or var_11 < var_23[var_15][var_18]:\n var_23[var_15][var_18] = var_11\n return var_23\n\n\nvar_7, var_6, var_5 = var_16()\nvar_24 = [[] for _ in range(var_7)]\nfor var_15 in range(var_6):\n var_1, var_2, var_3 = var_16()\n if var_3 <= var_5:\n var_24[var_1 - 1].append((var_2 - 1, var_3))\n var_24[var_2 - 1].append((var_1 - 1, var_3))\nvar_8 = int(eval(var_17()))\nvar_9 = []\nvar_14 = [set() for _ in range(var_7)]\nfor _ in range(var_8):\n var_25, var_27 = var_16()\n var_25 -= 1\n var_27 -= 1\n var_9.append((var_25, var_27))\nvar_12 = func_1(var_7, var_24)\nvar_21 = [set() for _ in range(var_7)]\nfor var_15 in range(var_7):\n for var_18 in range(var_7):\n var_11 = var_12[var_15][var_18]\n if var_11 is not None and var_11 <= var_5:\n var_21[var_15].add((var_18, 1))\nvar_10 = func_1(var_7, var_21)\nfor var_25, var_27 in var_9:\n if var_10[var_25][var_27] is None:\n print((-1))\n else:\n print((var_10[var_25][var_27] - 1))\n", "slow_time": 25152564245, "fast_time": 182436731, "speedup": 137.8701, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_24"} -{"pair_id": "python_13995", "problem_id": "p02283", "language": "python", "slow_code": "class Class_1:\n var_3 = 0\n var_4 = None\n var_6 = None\n\n def __init__(self, var_3):\n self.key = var_3\n\n\nvar_1 = [None] * 5000005\n\n\ndef func_2(var_10):\n if var_10 == 0:\n return\n var_9 = 0\n var_8 = 0\n while var_8 is not None:\n var_9 = var_8\n var_8 = (\n var_1[var_8].l if var_1[var_10].key < var_1[var_8].key else var_1[var_8].r\n )\n if var_1[var_10].key < var_1[var_9].key:\n var_1[var_9].l = var_10\n else:\n var_1[var_9].r = var_10\n\n\ndef func_1(var_8):\n if var_8 == None:\n return\n func_1(var_1[var_8].l)\n print(\"\", var_1[var_8].key, end=\"\")\n func_1(var_1[var_8].r)\n\n\ndef func_3(var_8):\n if var_8 == None:\n return\n print(\"\", var_1[var_8].key, end=\"\")\n func_3(var_1[var_8].l)\n func_3(var_1[var_8].r)\n\n\nvar_5 = int(input())\nfor var_2 in range(var_5):\n var_7 = input()\n if var_7 == \"print\":\n func_1(0)\n print()\n func_3(0)\n print()\n else:\n var_8 = int(var_7.split()[1])\n var_1[var_2] = Class_1(var_8)\n func_2(var_2)\n", "fast_code": "import sys\n\n\nclass Class_1:\n __slots__ = [\"key\", \"left\", \"right\"]\n\n def __init__(self, var_2):\n self.key = var_2\n self.left = self.right = None\n\n\nvar_4 = None\n\n\ndef func_2(var_2):\n global root\n var_5, var_6 = var_4, None\n while var_5 is not None:\n var_5, var_6 = var_5.left if var_2 < var_5.key else var_5.right, var_5\n if var_6 is None:\n var_4 = Class_1(var_2)\n elif var_2 < var_6.key:\n var_6.left = Class_1(var_2)\n else:\n var_6.right = Class_1(var_2)\n\n\ndef func_1(var_3):\n return func_1(var_3.left) + f\" {var_3.key}\" + func_1(var_3.right) if var_3 else \"\"\n\n\ndef func_3(var_3):\n return f\" {var_3.key}\" + func_3(var_3.left) + func_3(var_3.right) if var_3 else \"\"\n\n\neval(input())\nfor var_1 in sys.stdin:\n if var_1[0] == \"i\":\n func_2(int(var_1[7:]))\n else:\n print((func_1(var_4)))\n print((func_3(var_4)))\n", "slow_time": 267495056, "fast_time": 79763983, "speedup": 3.3536, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_9"} -{"pair_id": "python_17824", "problem_id": "p02586", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7) \nimport math\nfrom copy import copy, deepcopy\nfrom copy import deepcopy as dcp\nfrom operator import itemgetter\nfrom bisect import bisect_left, bisect, bisect_right \n\n \nfrom collections import deque, defaultdict\n\n \n \nfrom collections import Counter \n\n \nfrom itertools import accumulate, combinations, permutations, product \n\n \nfrom heapq import heapify, heappop, heappush\n\n \nfrom functools import reduce, lru_cache \n\n \nfrom decimal import Decimal\n\n\ndef func_6():\n var_29 = sys.stdin.readline()\n return var_29[:-1] if var_29[-1] == \"\\n\" else var_29\n\n\ndef func_11(*var_29):\n print(\"## \", *var_29, file=sys.stderr)\n\n\ndef func_12(var_19):\n _ = print(*var_19, sep=\"\\n\") if var_19 else None\n\n\ndef func_3(var_26, var_25=False):\n var_16 = sorted(range(len(var_26)), key=lambda var_18: var_26[var_18])\n if var_25:\n return var_16, [var_26[var_15] for var_15 in var_16]\n return var_16\n\n\ndef func_2(var_10, var_11=False):\n return ord(var_10) - 97 if not var_11 else ord(var_10) - 65\n\n\ndef func_10(var_15, var_11=False):\n return chr(var_15 + 97) if not var_11 else chr(var_15 + 65)\n\n\ndef func_8(var_1, var_2):\n var_4, var_6, var_5 = len(var_2), len(var_1), len(var_2[0])\n return [\n [sum([(var_1[var_15][var_18] * var_2[var_18][var_17]) for var_18 in range(var_4)]) for var_17 in range(var_5)]\n for var_15 in range(var_6)\n ]\n\n\ndef func_9(var_5, var_28):\n var_6, var_27 = len(var_28), len(var_5)\n return [sum([var_5[var_15][var_17] * var_28[var_17] for var_17 in range(var_6)]) for var_15 in range(var_27)]\n\n\ndef func_1(var_5):\n var_22, var_20 = len(var_5), len(var_5[0])\n return [[var_5[var_17][var_15] for var_17 in range(var_22)] for var_15 in range(var_20)]\n\n\ndef func_4(var_29):\n return bin(var_29)[2:]\n\n\ndef func_5(var_29): \n var_29 = var_29 - ((var_29 >> 1) & 0x5555555555555555)\n var_29 = (var_29 & 0x3333333333333333) + ((var_29 >> 2) & 0x3333333333333333)\n var_29 = (var_29 + (var_29 >> 4)) & 0x0F0F0F0F0F0F0F0F\n var_29 += var_29 >> 8\n var_29 += var_29 >> 16\n var_29 += var_29 >> 32\n return var_29 & 0x7F\n\n\ndef func_7():\n var_21 = 1000000007\n \n \n var_7, var_3, var_4 = map(int, func_6().split())\n \n \n var_9 = 5000\n var_8 = []\n for var_15 in range(var_4):\n var_24, var_10, var_28 = map(int, func_6().split())\n var_24 -= 1\n var_10 -= 1\n var_8.append((var_24 * var_9 + var_10, var_28))\n var_8.sort(key=itemgetter(0))\n var_23 = 0\n var_13 = [[0] * 4 for _ in range(var_3)]\n var_14 = [[0] * 4 for _ in range(var_3)]\n for var_15 in range(var_7):\n for var_17 in range(var_3):\n var_12 = 0\n if var_23 < var_4 and var_15 * var_9 + var_17 == var_8[var_23][0]:\n var_12 = var_8[var_23][1]\n var_23 += 1\n if var_17 > 0:\n var_14[var_17] = copy(var_14[var_17 - 1])\n else:\n var_14[0] = [0] * 4\n if var_15 > 0:\n var_14[var_17][0] = max(var_13[var_17], var_14[var_17][0])\n if var_12 != 0:\n for var_18 in range(2, -1, -1):\n var_14[var_17][var_18 + 1] = max(var_14[var_17][var_18] + var_12, var_14[var_17][var_18 + 1])\n \n var_13[var_17] = max(var_14[var_17])\n print(var_13[-1])\n\n\nif __name__ == \"__main__\":\n func_7()\n", "fast_code": "var_3, var_1, var_2 = list(map(int, input().split()))\nvar_12 = [[0] * var_1 for var_8 in range(var_3)]\nfor var_8 in range(var_2):\n var_4, var_5, var_6 = list(map(int, input().split()))\n var_4 -= 1\n var_5 -= 1\n var_12[var_4][var_5] = var_6\nvar_7 = [0] * var_1\nfor var_8 in range(var_3):\n var_13 = [0] * var_1\n var_11 = [0] * 4\n var_11[0] = var_7[0]\n var_11[1] = var_12[var_8][0] + var_7[0]\n var_13[0] = var_11[1]\n for var_9 in range(1, var_1):\n var_11[0] = max(var_11[0], var_7[var_9])\n for var_10 in range(2, -1, -1):\n var_11[var_10 + 1] = max(var_11[var_10 + 1], var_11[var_10] + var_12[var_8][var_9])\n var_13[var_9] = max(var_11)\n var_7 = var_13\nprint((var_7[var_1 - 1]))\n", "slow_time": 163255328, "fast_time": 47384717, "speedup": 3.4453, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_20"} -{"pair_id": "python_289", "problem_id": "p02714", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_3 = func_1()\nfunc_7 = [\"\"] + func_5()\nvar_4 = [0] * (var_3 + 1)\nvar_2 = [0] * (var_3 + 1)\nvar_1 = [0] * (var_3 + 1)\nfor var_6 in range(1, var_3 + 1):\n var_8 = func_7[var_6]\n var_4[var_6] = var_4[var_6 - 1]\n var_2[var_6] = var_2[var_6 - 1]\n var_1[var_6] = var_1[var_6 - 1]\n if var_8 == \"R\":\n var_4[var_6] += 1\n elif var_8 == \"G\":\n var_2[var_6] += 1\n else:\n var_1[var_6] += 1\nvar_5 = 0\nfor var_6 in range(2, var_3):\n if func_7[var_6] == \"R\":\n var_5 += var_2[var_6 - 1] * (var_1[-1] - var_1[var_6])\n var_5 += var_1[var_6 - 1] * (var_2[-1] - var_2[var_6])\n for var_7 in range(1, var_3 + 1):\n if 1 <= var_6 - var_7 <= var_3 and 1 <= var_6 + var_7 <= var_3:\n if (func_7[var_6 - var_7] == \"G\" and func_7[var_6 + var_7] == \"B\") or (\n func_7[var_6 - var_7] == \"B\" and func_7[var_6 + var_7] == \"G\"\n ):\n var_5 -= 1\n elif func_7[var_6] == \"G\":\n var_5 += var_4[var_6 - 1] * (var_1[-1] - var_1[var_6])\n var_5 += var_1[var_6 - 1] * (var_4[-1] - var_4[var_6])\n for var_7 in range(1, var_3 + 1):\n if 1 <= var_6 - var_7 <= var_3 and 1 <= var_6 + var_7 <= var_3:\n if (func_7[var_6 - var_7] == \"R\" and func_7[var_6 + var_7] == \"B\") or (\n func_7[var_6 - var_7] == \"B\" and func_7[var_6 + var_7] == \"R\"\n ):\n var_5 -= 1\n else:\n var_5 += var_2[var_6 - 1] * (var_4[-1] - var_4[var_6])\n var_5 += var_4[var_6 - 1] * (var_2[-1] - var_2[var_6])\n for var_7 in range(1, var_3 + 1):\n if 1 <= var_6 - var_7 <= var_3 and 1 <= var_6 + var_7 <= var_3:\n if (func_7[var_6 - var_7] == \"R\" and func_7[var_6 + var_7] == \"G\") or (\n func_7[var_6 - var_7] == \"G\" and func_7[var_6 + var_7] == \"R\"\n ):\n var_5 -= 1\nprint(var_5)\n", "fast_code": "from collections import defaultdict\n\n\ndef func_1():\n _ = int(eval(input()))\n var_1 = input().rstrip()\n var_8 = defaultdict(set)\n for var_7, var_2 in enumerate(var_1):\n var_8[var_2].add(var_7)\n var_6 = len(var_8[\"R\"]) * len(var_8[\"G\"]) * len(var_8[\"B\"])\n for var_3, var_4, var_5 in [\"RGB\", \"GBR\", \"BRG\"]:\n var_6 -= sum(\n (var_7 + var_9) % 2 == 0 and (var_7 + var_9) // 2 in var_8[var_5]\n for var_7 in var_8[var_3]\n for var_9 in var_8[var_4]\n )\n print(var_6)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 275204636, "fast_time": 72545495, "speedup": 3.7935, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_14"} -{"pair_id": "python_764", "problem_id": "p02642", "language": "python", "slow_code": "var_8 = int(eval(input()))\nvar_1 = sorted(map(int, input().split()))\nvar_2 = 10**6\nvar_7 = [1] * (var_2 + 1)\nvar_4 = set()\nvar_6 = set()\nvar_5 = [0] * (var_2 + 1)\nfor var_3 in var_1:\n var_5[var_3] += 1\n if var_5[var_3] == 2 and var_7[var_3]:\n var_6.add(var_3)\n continue\n if 2 < var_5[var_3]:\n continue\n if var_7[var_3]:\n var_4.add(var_3)\n for var_9 in range(2 * var_3, var_2 + 1, var_3):\n var_7[var_9] = 0\nprint((len(var_4 - var_6)))\n", "fast_code": "var_4 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nvar_3 = max(var_2) + 1\nvar_6 = [0 for _ in range(var_3)]\nfor var_1 in var_2:\n if var_6[var_1] != 0:\n var_6[var_1] = 2\n continue\n for var_7 in range(var_1, var_3, var_1):\n var_6[var_7] += 1\nvar_5 = 0\nfor var_1 in var_2:\n if var_6[var_1] == 1:\n var_5 += 1\nprint(var_5)\n", "slow_time": 24452317730, "fast_time": 41703497, "speedup": 586.3373, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_28"} -{"pair_id": "python_2917", "problem_id": "p03146", "language": "python", "slow_code": "var_5 = int(eval(input()))\nvar_1 = [var_5]\nvar_3 = 0\nvar_2 = -1\nwhile var_2 == -1:\n if var_1[var_3] % 2 == 0:\n var_1.append(var_1[var_3] // 2)\n else:\n var_1.append(3 * var_1[var_3] + 1)\n var_3 += 1\n for var_4 in range(len(var_1) - 1):\n if var_1[var_3] == var_1[var_4]:\n var_2 = var_3\n break\nprint((var_2 + 1))\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = 2\nwhile ~-var_2:\n var_2 = [var_2 // 2, var_2 * 3 + 1][var_2 % 2]\n var_1 += 1\nprint((max(var_1, 4)))\n", "slow_time": 142367227, "fast_time": 23226752, "speedup": 6.1295, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_10"} -{"pair_id": "python_14015", "problem_id": "p03125", "language": "python", "slow_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nvar_4 = 10**9 + 7\nvar_3 = float(\"inf\")\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\nvar_1, var_2 = func_2()\nif var_2 % var_1 == 0:\n print((var_1 + var_2))\nelse:\n print((var_2 - var_1))\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nprint(((var_1 + var_2) if var_2 % var_1 == 0 else (var_2 - var_1)))\n", "slow_time": 43332877, "fast_time": 12561301, "speedup": 3.4497, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_4"} -{"pair_id": "python_298", "problem_id": "p02995", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_1, var_2, var_3, var_4 = func_6()\nfrom math import gcd\n\n\ndef func_8(var_5):\n return (\n var_5\n - var_5 // var_3\n - var_5 // var_4\n + var_5 // ((var_3 * var_4) // gcd(var_3, var_4))\n )\n\n\nprint((func_8(var_2) - func_8(var_1 - 1)))\n", "fast_code": "import sys\n\n\ndef func_1():\n return sys.stdin.readline().rstrip()\n\n\nvar_1, var_2, var_3, var_4 = list(map(int, func_1().split()))\nfrom math import gcd\n\n\ndef func_2(var_5):\n return (\n var_5\n - var_5 // var_3\n - var_5 // var_4\n + var_5 // (var_3 * var_4 // gcd(var_3, var_4))\n )\n\n\nprint((func_2(var_2) - func_2(var_1 - 1)))\n", "slow_time": 64669235, "fast_time": 26310057, "speedup": 2.458, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_25"} -{"pair_id": "python_499", "problem_id": "p03221", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = []\nvar_4 = []\nvar_5 = [[] for var_7 in range(10**5 + 1)]\nfor var_6 in range(var_1):\n var_10 = list(map(int, input().split()))\n var_3.append(var_10[0])\n var_4.append(var_10[1])\n var_5[var_10[0]].append(var_10[1])\nfor var_6 in range(var_2 + 1):\n var_5[var_6].sort()\nfor var_6 in range(var_1):\n\n var_9 = 0\n var_12 = len(var_5[var_3[var_6]]) - 1\n while var_9 <= var_12:\n var_11 = (var_9 + var_12) // 2\n if var_5[var_3[var_6]][var_11] == var_4[var_6]:\n var_8 = var_11\n break\n elif var_5[var_3[var_6]][var_11] > var_4[var_6]:\n var_12 = var_11 - 1\n else:\n var_9 = var_11 + 1\n print((str(var_3[var_6]).rjust(6, \"0\") + str(var_8 + 1).rjust(6, \"0\")))\n", "fast_code": "var_5, var_4 = list(map(int, input().split()))\nvar_3 = []\nfor var_2 in range(var_4):\n var_7, var_9 = list(map(int, input().split()))\n var_3.append([var_2, var_7, var_9])\nvar_1 = {}\nvar_6 = {}\nfor var_2, var_7, var_9 in sorted(var_3, key=lambda var_8: var_8[2]):\n var_1[var_7] = var_1.get(var_7, 0) + 1\n var_6[var_2, var_7] = var_1[var_7]\nfor var_2, var_7, var_9 in var_3:\n print((\"{:06}{:06}\".format(var_7, var_6[var_2, var_7])))\n", "slow_time": 2260230442, "fast_time": 31000410, "speedup": 72.9097, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_6"} -{"pair_id": "python_12210", "problem_id": "p00008", "language": "python", "slow_code": "import sys\n\nvar_6 = list(range(10))\nvar_7 = [0] * 51\nfor var_1 in var_6:\n for var_2 in var_6:\n for var_3 in var_6:\n for var_4 in var_6:\n var_7[var_1 + var_2 + var_3 + var_4] += 1\nfor var_5 in sys.stdin:\n print(var_7[int(var_5)])\n", "fast_code": "import sys\n\nvar_6 = {}\n\n\ndef func_3(var_4):\n global table\n\n def func_2(*var_2):\n if not var_2 in var_6:\n var_6[var_2] = var_4(*var_2)\n return var_6[var_2]\n\n return func_2\n\n\n@func_3\ndef func_1(var_1, var_3):\n if var_1 == 0:\n return 1\n elif var_3 == 0 or var_1 < 0:\n return 0\n return sum([func_1(var_1 - var_5, var_3 - 1) for var_5 in range(10)])\n\n\nfor var_5 in sys.stdin.readlines():\n print(func_1(int(var_5.strip()), 4))\n", "slow_time": 858693699, "fast_time": 124200677, "speedup": 6.9138, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_1"} -{"pair_id": "python_7841", "problem_id": "p02888", "language": "python", "slow_code": "from collections import defaultdict, deque, Counter, OrderedDict\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce, lru_cache\nfrom heapq import heappush, heappop, heapify\nimport itertools\nimport math, fractions\nimport sys, copy\n\n\ndef func_3():\n return sys.stdin.readline().split()\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_12():\n return list(sys.stdin.readline().rstrip())\n\n\ndef func_4():\n return [int(var_16) for var_16 in sys.stdin.readline().split()]\n\n\ndef func_5():\n return [int(var_16) - 1 for var_16 in sys.stdin.readline().split()]\n\n\ndef func_9():\n return [list(var_16) for var_16 in sys.stdin.readline().split()]\n\n\ndef func_11(var_14):\n return [sys.stdin.readline().strip() for _ in range(var_14)]\n\n\ndef func_8(var_14):\n return [func_3() for _ in range(var_14)]\n\n\ndef func_2(var_14):\n return [func_1() for _ in range(var_14)]\n\n\ndef func_6(var_14):\n return [func_4() for _ in range(var_14)]\n\n\ndef func_7(var_14):\n return [func_5() for _ in range(var_14)]\n\n\ndef func_13(var_14):\n return [func_12() for _ in range(var_14)]\n\n\ndef func_10(var_14):\n return [func_9() for _ in range(var_14)]\n\n\ndef func_17(var_14, var_15):\n return math.factorial(var_14) // math.factorial(var_15)\n\n\ndef func_14(var_14, var_15):\n return math.factorial(var_14) // (\n math.factorial(var_15) * math.factorial(var_14 - var_15)\n )\n\n\ndef func_16(var_14, *var_7, var_8=0):\n return (\n [func_16(*var_7, default=var_8) for _ in range(var_14)]\n if len(var_7) > 0\n else [var_8 for _ in range(var_14)]\n )\n\n\nvar_9 = [[1, 0], [0, 1], [-1, 0], [0, -1]]\nvar_10 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]\nvar_5 = \"abcdefghijklmnopqrstuvwxyz\"\nvar_1 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nvar_3 = 1000000007\nvar_2 = float(\"inf\")\nsys.setrecursionlimit(1000000)\n\n\ndef func_15():\n var_4 = func_1()\n func_3 = sorted(func_4())\n var_6 = 0\n for var_11 in range(var_4):\n var_13 = var_11\n for var_12 in range(var_11 + 1, var_4):\n while var_13 < var_4 and func_3[var_13] < func_3[var_11] + func_3[var_12]:\n var_13 += 1\n var_6 += var_13 - (var_12 + 1)\n print(var_6)\n\n\nif __name__ == \"__main__\":\n func_15()\n", "fast_code": "from bisect import bisect_left, bisect_right\nimport sys\n\nvar_6 = sys.stdin.readline\nvar_8 = int(eval(var_6()))\n\nvar_1 = [int(var_5) for var_5 in var_6().split()]\nvar_1.sort()\nvar_3 = 0\nfor var_5 in range(var_8):\n for var_7 in range(var_5 + 1, var_8):\n var_2, var_4 = var_1[var_5], var_1[var_7]\n var_3 += bisect_left(var_1, var_2 + var_4) - 1 - var_7\nprint(var_3)\n", "slow_time": 203845466, "fast_time": 38189414, "speedup": 5.3377, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_8"} -{"pair_id": "python_1766", "problem_id": "p03608", "language": "python", "slow_code": "from itertools import permutations\nfrom scipy.sparse.csgraph import floyd_warshall\n\nvar_10, var_9, var_12 = list(map(int, input().split()))\nvar_14 = list(map(int, input().split()))\nvar_1 = 10**18\nvar_11 = [[var_1] * var_10 for var_7 in range(var_10)]\nfor var_7 in range(var_9):\n var_2, var_4, var_5 = list(map(int, input().split()))\n var_11[var_2 - 1][var_4 - 1] = var_5\n var_11[var_4 - 1][var_2 - 1] = var_5\nvar_11 = floyd_warshall(var_11)\nvar_3 = 10**18\nfor var_13 in permutations(var_14):\n var_6 = 0\n for var_8 in range(1, var_12):\n var_6 += var_11[var_13[var_8 - 1] - 1][var_13[var_8] - 1]\n var_3 = min(var_3, var_6)\nprint((int(var_3)))\n", "fast_code": "import sys\n\nvar_18 = sys.stdin\nvar_12 = lambda: int(var_13())\nvar_11 = lambda: list(map(int, var_18.readline().split()))\nvar_13 = lambda: var_18.readline()\nvar_10, var_9, var_16 = var_11()\nvar_17 = var_11()\nfor var_6 in range(var_16):\n var_17[var_6] -= 1\nvar_5 = [[99999999999] * var_10 for _ in range(var_10)]\nfor var_6 in range(var_10):\n var_5[var_6][var_6] = 0\nfor var_6 in range(var_9):\n var_1, var_3, var_4 = var_11()\n var_1 -= 1\n var_3 -= 1\n var_5[var_1][var_3] = var_5[var_3][var_1] = var_4\nfor var_8 in range(var_10):\n for var_6 in range(var_10):\n for var_7 in range(var_10):\n var_5[var_6][var_7] = min(\n var_5[var_6][var_7], var_5[var_6][var_8] + var_5[var_8][var_7]\n )\nfrom itertools import *\n\nvar_2 = 9999999999999999999\nfor var_14 in var_15(var_17):\n var_19 = 0\n for var_6 in range(1, var_16):\n var_19 += var_5[var_14[var_6 - 1]][var_14[var_6]]\n var_2 = min(var_2, var_19)\nprint(var_2)\n", "slow_time": 16547903576, "fast_time": 66359868, "speedup": 249.3661, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_26"} -{"pair_id": "python_4097", "problem_id": "p03170", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = list(map(int, input().split()))\nvar_4 = [False] * (var_1 + 1)\nfor var_5 in range(1, var_1 + 1):\n for var_6 in range(var_2):\n if 0 <= var_5 - var_3[var_6] and not var_4[var_5 - var_3[var_6]]:\n var_4[var_5] = True\n break\nprint((\"First\" if var_4[var_1] else \"Second\"))\n", "fast_code": "def func_1():\n var_3, var_2, *var_1 = list(map(int, open(0).read().split()))\n var_5 = [False] * (var_2 + 1)\n for var_6 in range(var_2):\n if var_5[var_6]:\n continue\n for var_4 in var_1:\n if var_6 + var_4 > var_2:\n break\n var_5[var_6 + var_4] = True\n print((\"First\" if var_5[-1] else \"Second\"))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 1397716616, "fast_time": 334630587, "speedup": 4.1769, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_17"} -{"pair_id": "python_15361", "problem_id": "p02780", "language": "python", "slow_code": "var_6, var_4 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_7 = {}\nvar_1 = 0\nfor var_3 in range(1, 1000 + 1):\n var_7[var_3] = (var_3 + 1) * 0.5\nif var_6 == 1:\n print((var_7[var_2[0]]))\n exit()\nvar_5 = [0 for _ in range(var_6)]\nvar_5[0] = var_7[var_2[0]]\nfor var_3 in range(var_6 - 1):\n if var_3 + 1 < var_4:\n var_5[var_3 + 1] = var_5[var_3] + var_7[var_2[var_3 + 1]]\n else:\n var_5[var_3 + 1] = (\n var_5[var_3] + var_7[var_2[var_3 + 1]] - var_7[var_2[var_3 - var_4 + 1]]\n )\n var_1 = max(var_1, var_5[var_3 + 1])\nprint(var_1)\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_6 = [int(var_7) for var_7 in input().split()]\nvar_6 = [(var_7 + 1) / 2 for var_7 in var_6]\nvar_3 = [0 for _ in range(var_2 + 1)]\nfor var_5 in range(var_2):\n var_3[var_5 + 1] += var_3[var_5] + var_6[var_5]\nvar_4 = 0\nfor var_5 in range(var_2 - var_1 + 1):\n var_4 = max(var_4, var_3[var_5 + var_1] - var_3[var_5])\nprint(var_4)\n", "slow_time": 91479968, "fast_time": 28589147, "speedup": 3.1998, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_14"} -{"pair_id": "python_17199", "problem_id": "p02555", "language": "python", "slow_code": "var_1, var_2, var_3 = 1, 0, 0\nexec(\"a,b,c=b,c,a+c;\" * int(eval(input())))\nprint((var_1 % (10**9 + 7)))\n", "fast_code": "var_2 = int(eval(input()))\nvar_4 = 10**9 + 7\nvar_1 = [0] * (var_2 + 1)\nif var_2 >= 3:\n var_1[3] = 1\nfor var_3 in range(4, var_2 + 1):\n var_1[var_3] = var_1[var_3 - 1] + var_1[var_3 - 3]\n var_1[var_3] %= var_4\nprint((var_1[-1]))\n", "slow_time": 182932094, "fast_time": 31774898, "speedup": 5.7571, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_25"} -{"pair_id": "python_16486", "problem_id": "p03796", "language": "python", "slow_code": "import sys\nimport os\nimport math\n\nvar_1 = 1000000007\n\n\ndef func_1():\n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"input.txt\", \"r\")\n var_2 = int(sys.stdin.readline().rstrip())\n print((math.factorial(var_2) % var_1))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_3 = 10**9 + 7\nvar_1 = 1\nfor var_2 in range(int(eval(input()))):\n var_1 *= var_2 + 1\n var_1 %= var_3\nprint(var_1)\n", "slow_time": 27015242522, "fast_time": 3587596980, "speedup": 7.5302, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_2"} -{"pair_id": "python_856", "problem_id": "p03556", "language": "python", "slow_code": "var_2 = int(eval(input()))\nfor var_1 in range(var_2, 0, -1):\n if float(var_1**0.5).is_integer():\n print(var_1)\n break\n", "fast_code": "import numpy as np\n\nvar_1 = int(eval(input()))\nvar_2 = int(np.sqrt(var_1))\nprint((var_2**2))\n", "slow_time": 868435773, "fast_time": 14006913, "speedup": 62.0005, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_28"} -{"pair_id": "python_13182", "problem_id": "p03962", "language": "python", "slow_code": "var_1, var_2, var_3 = input().split()\nvar_4 = 0\nif var_1 == var_2 and var_2 == var_3:\n var_4 = 1\nelif var_1 == var_2 or var_2 == var_3 or var_3 == var_1:\n var_4 = 2\nelse:\n var_4 = 3\nprint(var_4)\n", "fast_code": "var_1 = set(input().split())\nprint((len(var_1)))\n", "slow_time": 17128720, "fast_time": 7931149, "speedup": 2.1597, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_14"} -{"pair_id": "python_184", "problem_id": "p03805", "language": "python", "slow_code": "from itertools import permutations\n\nvar_7, var_6 = list(map(int, input().split()))\nvar_3 = [tuple(map(int, input().split())) for _ in range(var_6)]\nvar_1 = 0\nfor var_4 in permutations(list(range(2, var_7 + 1)), var_7 - 1):\n var_5 = [1] + list(var_4)\n var_1 += (\n sum(1 for var_2 in zip(var_5, var_5[1:]) if tuple(sorted(var_2)) in var_3)\n == var_7 - 1\n )\nprint(var_1)\n", "fast_code": "from collections import defaultdict\nfrom itertools import permutations\n\n\ndef func_1():\n var_2, var_1 = list(map(int, input().split()))\n var_6 = defaultdict(list)\n for _ in range(var_1):\n var_3, var_5 = list(map(int, input().split()))\n var_6[var_3].append(var_5)\n var_6[var_5].append(var_3)\n var_4 = 0\n for var_10 in permutations(list(range(2, var_2 + 1)), var_2 - 1):\n var_8 = True\n var_7 = 1\n for var_9 in var_10:\n if var_9 in var_6[var_7]:\n var_7 = var_9\n else:\n var_8 = False\n if var_8:\n var_4 += 1\n print(var_4)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 5262903933, "fast_time": 1015280859, "speedup": 5.1837, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_23"} -{"pair_id": "python_18278", "problem_id": "p02831", "language": "python", "slow_code": "var_2, var_3 = list(map(int, input().split()))\nimport math\n\n\ndef func_1(var_2, var_3):\n for var_1 in range(min(var_2, var_3), 0, -1):\n if var_2 % var_1 == 0 and var_3 % var_1 == 0:\n return var_1\n\n\nprint((int(var_2 * var_3 / func_1(var_2, var_3))))\n", "fast_code": "import sys\n\nvar_8 = sys.stdin\nsys.setrecursionlimit(10**7)\nvar_5 = lambda: int(var_7())\nvar_6 = lambda: list(map(int, var_8.readline().split()))\nvar_7 = lambda: var_8.readline().rstrip()\n\n\ndef func_1(var_3, var_4):\n while var_4:\n var_3, var_4 = var_4, var_3 % var_4\n return var_3\n\n\ndef func_2(var_3, var_4):\n return var_3 * var_4 // func_1(var_3, var_4)\n\n\nvar_1, var_2 = var_6()\nprint((func_2(var_1, var_2)))\n", "slow_time": 282756854, "fast_time": 36632669, "speedup": 7.7187, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_7"} -{"pair_id": "python_6764", "problem_id": "p03552", "language": "python", "slow_code": "var_2, var_4, var_3 = list(map(int, input().split()))\n(*var_1,) = list(map(int, input().split()))\nimport sys\n\nsys.setrecursionlimit(10**6)\nvar_7 = {}\n\n\ndef func_1(var_5, var_9):\n if (var_5, var_9) in var_7:\n return var_7[var_5, var_9]\n if var_9 == 0:\n\n if var_5 == 0:\n var_8 = abs(var_3 - var_1[-1])\n else:\n var_8 = abs(var_1[var_5 - 1] - var_1[-1])\n for var_6 in range(var_5 + 1, var_2):\n var_8 = max(var_8, func_1(var_6, 1))\n else:\n\n if var_5 == 0:\n var_8 = abs(var_4 - var_1[-1])\n else:\n var_8 = abs(var_1[var_5 - 1] - var_1[-1])\n for var_6 in range(var_5 + 1, var_2):\n var_8 = min(var_8, func_1(var_6, 0))\n var_7[var_5, var_9] = var_8\n return var_8\n\n\nprint((func_1(0, 0)))\n", "fast_code": "var_2, var_4, var_3 = list(map(int, input().split()))\n(*var_1,) = list(map(int, input().split()))\nif var_2 == 1:\n print((abs(var_1[0] - var_3)))\nelse:\n print((max(abs(var_1[-1] - var_3), abs(var_1[-2] - var_1[-1]))))\n", "slow_time": 65684718, "fast_time": 25703169, "speedup": 2.5555, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_1"} -{"pair_id": "python_5899", "problem_id": "p03693", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_3():\n return [int(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return [list(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_7():\n return list(sys.stdin.readline())[:-1]\n\n\ndef func_2(var_6):\n return [func_1() for var_4 in range(var_6)]\n\n\ndef func_4(var_6):\n return [func_3() for var_4 in range(var_6)]\n\n\ndef func_8(var_6):\n return [func_7() for var_4 in range(var_6)]\n\n\ndef func_6(var_6):\n return [func_5() for var_4 in range(var_6)]\n\n\nsys.setrecursionlimit(1000000)\nvar_5 = 1000000007\n\n\ndef func_9():\n var_7, var_3, var_2 = func_3()\n var_1 = [\"YES\", \"NO\"]\n print((var_1[((var_3 << 1) + var_2) & 3 > 0]))\n return\n\n\nif __name__ == \"__main__\":\n func_9()\n", "fast_code": "var_3, var_2, var_1 = input().split()\nprint((\"YES\" if int(var_2 + var_1) % 4 == 0 else \"NO\"))\n", "slow_time": 89960780, "fast_time": 10340481, "speedup": 8.6999, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_12"} -{"pair_id": "python_18586", "problem_id": "p03409", "language": "python", "slow_code": "var_9 = 201\n\n\ndef func_1(var_2):\n global vis\n global EE\n var_14[var_2] = 1\n if var_2 == var_9:\n return 1\n for var_4 in range(var_9 + 1):\n if var_14[var_4] == 0 and var_1[var_2][var_4] > 0 and func_1(var_4) > 0:\n var_1[var_2][var_4] -= 1\n var_1[var_4][var_2] += 1\n return 1\n return 0\n\n\nvar_6 = int(eval(input()))\nvar_12 = []\nvar_13 = []\nfor var_4 in range(var_6):\n var_12.append([int(var_4) for var_4 in input().split()])\nfor var_4 in range(var_6):\n var_13.append([int(var_4) for var_4 in input().split()])\nvar_12.sort(key=lambda var_15: (var_15[0], var_15[1]))\nvar_13.sort(key=lambda var_15: (var_15[0], var_15[1]))\nvar_10 = []\nfor var_4 in range(len(var_12)):\n var_11 = []\n for var_5 in range(var_6):\n if var_12[var_5][0] < var_13[var_4][0] and var_12[var_5][1] < var_13[var_4][1]:\n var_11.append(var_5)\n var_10.append(var_11)\nvar_10.sort(key=lambda var_15: len(var_15))\n\n\nvar_1 = [[0 for var_15 in range(var_9 + 1)] for var_16 in range(var_9 + 11)]\nvar_14 = [0] * (var_9 + 1)\nfor var_4 in range(len(var_10)):\n var_1[0][var_4 + 1] = 1\n var_1[var_4 + 1][0] = 1\nfor var_4 in range(var_6):\n var_1[var_4 + 101][var_9] = 1\nfor var_4 in range(len(var_10)):\n for var_5 in range(len(var_10[var_4])):\n var_7, var_8 = var_4 + 1, var_10[var_4][var_5] + 101\n\n var_1[var_7][var_8] = 1\n\nvar_3 = 0\nwhile 1:\n for var_4 in range(0, var_9 + 1):\n var_14[var_4] = 0\n if func_1(0) == 0:\n break\n var_3 += 1\nprint(var_3)\n", "fast_code": "def func_2():\n from sys import stdin\n\n def func_1():\n return stdin.readline().strip()\n\n var_6 = int(eval(func_1()))\n var_8 = [tuple(map(int, func_1().split())) for _ in range(var_6)]\n var_1 = [tuple(map(int, func_1().split())) for _ in range(var_6)]\n var_8.sort()\n var_1.sort()\n var_7 = 0\n for var_3 in var_1:\n while var_7 < len(var_8) and var_8[var_7] < var_3:\n var_7 += 1\n var_4 = var_8[:var_7]\n if var_4 == []:\n continue\n var_4 = sorted(var_4, key=lambda var_10: var_10[1])\n if var_4[0][1] > var_3[1]:\n continue\n\n var_5 = 0\n var_9 = len(var_4) - 1\n while var_5 < var_9:\n var_2 = (var_5 + var_9 + 1) // 2\n if var_4[var_2][1] < var_3[1]:\n var_5 = var_2\n else:\n var_9 = var_2 - 1\n var_8.remove(var_4[var_5])\n var_7 -= 1\n print((var_6 - len(var_8)))\n\n\nfunc_2()\n", "slow_time": 579236453, "fast_time": 85099546, "speedup": 6.8066, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_15"} -{"pair_id": "python_14578", "problem_id": "p03603", "language": "python", "slow_code": "var_1 = int(input())\nvar_2 = list(map(int, input().split()))\nvar_3 = [0] + list(map(int, input().split()))\nvar_10 = [[] for _ in range(var_1 + 1)]\nfor var_8, var_13 in enumerate(var_2, 2):\n var_10[var_13].append(var_8)\n\n\ndef func_1(var_13):\n var_11 = len(var_10[var_13])\n if var_11 == 0:\n return var_3[var_13], 0\n var_7 = [[float(\"inf\")] * 5001 for _ in range(var_11 + 1)]\n var_7[0][0] = 0\n for var_8, var_6 in enumerate(var_10[var_13], 1):\n var_4, var_5 = func_1(var_6)\n for var_9 in range(var_4, 5001):\n var_7[var_8][var_9] = min(\n var_7[var_8][var_9], var_7[var_8 - 1][var_9 - var_4] + var_5\n )\n for var_9 in range(var_5, 5001):\n var_7[var_8][var_9] = min(\n var_7[var_8][var_9], var_7[var_8 - 1][var_9 - var_5] + var_4\n )\n var_12 = min(var_7[-1][: var_3[var_13] + 1])\n if var_12 == float(\"inf\"):\n print(\"IMPOSSIBLE\")\n exit()\n elif var_12 > var_3[var_13]:\n return var_12, var_3[var_13]\n else:\n return var_3[var_13], var_12\n\n\nprint(\"POSSIBLE\") if min(func_1(1)) <= var_3[1] else print(\"IMPOSSIBLE\")\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**8)\nvar_1 = int(eval(input()))\nvar_2 = [int(var_7) for var_7 in input().split()]\nvar_5 = [int(var_7) for var_7 in input().split()]\nvar_12 = [[] for var_7 in range(var_1)]\nfor var_7 in range(var_1 - 1):\n var_12[var_2[var_7] - 1].append(var_7 + 1)\nvar_6 = [0] * var_1\n\n\ndef func_1(var_9):\n for var_7 in var_12[var_9]:\n func_1(var_7)\n var_11 = len(var_12[var_9])\n if var_11 == 0:\n return\n var_4 = set()\n var_10 = 0\n for var_7 in range(var_11):\n var_13 = var_12[var_9][var_7]\n var_10 += var_5[var_13] + var_6[var_13]\n if var_7 == 0:\n if var_5[var_13] <= var_5[var_9]:\n var_4.add(var_5[var_13])\n if var_6[var_13] <= var_5[var_9]:\n var_4.add(var_6[var_13])\n continue\n var_3 = set()\n for var_8 in var_4:\n if var_8 + var_5[var_13] <= var_5[var_9]:\n var_3.add(var_8 + var_5[var_13])\n if var_8 + var_6[var_13] <= var_5[var_9]:\n var_3.add(var_8 + var_6[var_13])\n var_4 = var_3\n if len(var_4) == 0:\n print(\"IMPOSSIBLE\")\n sys.exit()\n var_6[var_9] = var_10 - max(var_4)\n return\n\n\nfunc_1(0)\nprint(\"POSSIBLE\")\n", "slow_time": 908704243, "fast_time": 96453345, "speedup": 9.4212, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_0"} -{"pair_id": "python_3465", "problem_id": "p02922", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\nvar_7 = 10**20\nvar_8 = 10**9 + 7\nvar_5 = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nvar_6 = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef func_2():\n return [int(var_9) for var_9 in sys.stdin.readline().split()]\n\n\ndef func_3():\n return [int(var_9) - 1 for var_9 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_4():\n return sys.stdin.readline().split()\n\n\ndef func_5():\n return eval(input())\n\n\ndef func_6():\n var_1, var_3 = func_2()\n var_4 = 1\n var_2 = 0\n while True:\n if var_4 >= var_3:\n return var_2\n var_2 += 1\n var_4 -= 1\n var_4 += var_1\n\n\nprint((func_6()))\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nprint((-(-(var_2 - 1) // (var_1 - 1))))\n", "slow_time": 80117443, "fast_time": 11057146, "speedup": 7.2458, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_22"} -{"pair_id": "python_8369", "problem_id": "p03448", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_2 = int(eval(input()))\nvar_3 = int(eval(input()))\nvar_4 = int(eval(input()))\nvar_5 = 0\nfor var_6 in range(var_1 + 1):\n for var_7 in range(var_2 + 1):\n for var_8 in range(var_3 + 1):\n var_9 = var_6 * 500 + var_7 * 100 + var_8 * 50\n if var_9 == var_4:\n var_5 += 1\nprint(var_5)\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = int(eval(input()))\nvar_3 = int(eval(input()))\nvar_7 = int(eval(input()))\nvar_4 = 0\nfor var_5 in range(var_1 + 1):\n for var_6 in range(var_2 + 1):\n var_8 = var_7 - (500 * var_5 + 100 * var_6)\n if var_8 < 0:\n break\n if var_8 / 50 <= var_3:\n var_4 += 1\nprint(var_4)\n", "slow_time": 7964238908, "fast_time": 89323797, "speedup": 89.1614, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_25"} -{"pair_id": "python_5419", "problem_id": "p02774", "language": "python", "slow_code": "import sys\n\nvar_6 = sys.stdin.readline\nvar_11, var_8 = list(map(int, var_6().split()))\nvar_1 = list(map(int, var_6().split()))\nvar_10 = 0\nfor var_5 in range(var_11):\n if var_1[var_5] < 0:\n var_10 += 1\nvar_14 = var_11 - var_10\nvar_2 = []\nvar_3 = []\nfor var_5 in range(var_11):\n if var_1[var_5] < 0:\n var_3.append(var_1[var_5])\n else:\n var_2.append(var_1[var_5])\nvar_2.sort(reverse=True)\nvar_3.sort()\nif var_8 <= var_10 * var_14:\n var_13 = 1\n var_12 = -(10**20)\n var_9 = (var_13 + var_12) // 2\n while abs(var_12 - var_13) > 1:\n var_4 = 0\n var_7 = len(var_3) - 1\n for var_5 in range(len(var_2)):\n while var_7 >= 0 and var_2[var_5] * var_3[var_7] > var_9:\n var_7 -= 1\n var_4 += var_7 + 1\n\n if var_4 >= var_8:\n var_13 = var_9\n\n else:\n var_12 = var_9\n\n var_9 = (var_13 + var_12) // 2\n print(var_13)\nelse:\n var_8 -= var_10 * var_14\n var_13 = 10**20\n var_12 = -1\n var_9 = (var_13 + var_12) // 2\n while abs(var_12 - var_13) > 1:\n var_4 = 0\n var_7 = len(var_3) - 1\n for var_5 in range(len(var_3)):\n while var_7 > var_5 and var_3[var_5] * var_3[var_7] <= var_9:\n var_7 -= 1\n var_4 += len(var_3) - 1 - var_7\n var_7 = max(var_7, var_5 + 1)\n var_7 = len(var_2) - 1\n for var_5 in range(len(var_2)):\n while var_7 > var_5 and var_2[var_5] * var_2[var_7] <= var_9:\n var_7 -= 1\n var_4 += len(var_2) - 1 - var_7\n var_7 = max(var_7, var_5 + 1)\n if var_4 >= var_8:\n var_13 = var_9\n\n else:\n var_12 = var_9\n\n var_9 = (var_13 + var_12) // 2\n print(var_13)\n", "fast_code": "import sys\n\nvar_2 = float(\"inf\")\n\n\ndef func_1():\n var_4, var_3 = list(map(int, input().split()))\n var_1 = list(map(int, input().split()))\n var_1.sort()\n\n var_10, var_19, var_12 = [], [], []\n for var_5 in var_1:\n if var_5 < 0:\n var_10.append(var_5)\n elif var_5 == 0:\n var_19.append(var_5)\n else:\n var_12.append(var_5)\n var_10.sort()\n var_12.sort()\n var_13 = len(var_10) * len(var_12)\n var_15 = (\n len(var_19) * (len(var_10) + len(var_12)) + len(var_19) * (len(var_19) - 1) // 2\n )\n var_14 = len(var_10) * (len(var_10) - 1) // 2 + len(var_12) * (len(var_12) - 1) // 2\n\n if var_13 >= var_3:\n\n var_8 = var_10[0] * var_12[-1] - 1\n var_17 = 0\n while var_17 - var_8 > 1:\n var_9 = (var_17 + var_8) // 2\n\n var_6 = 0\n var_11, var_16 = 0, 0\n for var_11 in range(len(var_10)):\n while var_16 < len(var_12) and var_10[var_11] * var_12[var_16] > var_9:\n var_16 += 1\n if var_16 == len(var_12):\n break\n var_6 += len(var_12) - var_16\n\n if var_6 < var_3:\n var_8 = var_9\n else:\n var_17 = var_9\n print(var_17)\n elif var_15 + var_13 >= var_3:\n print((0))\n else:\n var_10.sort(reverse=True)\n\n var_8 = 0\n var_17 = 0\n if len(var_10) > 0:\n var_17 = max(var_10[-1] ** 2, var_17)\n if len(var_12) > 0:\n var_17 = max(var_12[-1] ** 2, var_17)\n var_17 += 1\n while var_17 - var_8 > 1:\n var_9 = (var_8 + var_17) // 2\n\n var_6 = 0\n var_18, var_7 = 0, len(var_12) - 1\n\n for var_18 in range(len(var_12)):\n while var_7 >= var_18 and var_12[var_18] * var_12[var_7] >= var_9:\n var_7 -= 1\n if var_7 <= var_18:\n break\n var_6 += var_7 - var_18\n\n var_18, var_7 = 0, len(var_10) - 1\n for var_18 in range(len(var_10)):\n while var_7 >= var_18 and var_10[var_18] * var_10[var_7] >= var_9:\n var_7 -= 1\n if var_7 <= var_18:\n break\n var_6 += var_7 - var_18\n\n if var_6 < var_3 - var_13 - var_15:\n var_8 = var_9\n else:\n var_17 = var_9\n print(var_8)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 556876982, "fast_time": 242451224, "speedup": 2.2969, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_4"} -{"pair_id": "python_4771", "problem_id": "p04015", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = list([int(var_8) - var_1 for var_8 in input().split()])\nvar_4 = [0] * 10000\nvar_4[0] = 1\nfor var_5 in range(var_2):\n var_7 = var_4[:]\n for var_6 in range(-3000, 3000):\n if var_4[var_6] > 0:\n var_7[var_6 + var_3[var_5]] += var_4[var_6]\n var_4 = var_7\nprint((var_4[0] - 1))\n", "fast_code": "from collections import defaultdict, deque, Counter, OrderedDict\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce, lru_cache\nfrom heapq import heappush, heappop, heapify\nimport itertools\nimport math, fractions\nimport sys, copy\n\n\ndef func_3():\n return sys.stdin.readline().split()\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_12():\n return list(sys.stdin.readline().rstrip())\n\n\ndef func_4():\n return [int(var_18) for var_18 in sys.stdin.readline().split()]\n\n\ndef func_5():\n return [int(var_18) - 1 for var_18 in sys.stdin.readline().split()]\n\n\ndef func_9():\n return [list(var_18) for var_18 in sys.stdin.readline().split()]\n\n\ndef func_11(var_15):\n return [sys.stdin.readline().strip() for _ in range(var_15)]\n\n\ndef func_8(var_15):\n return [func_3() for _ in range(var_15)]\n\n\ndef func_2(var_15):\n return [func_1() for _ in range(var_15)]\n\n\ndef func_6(var_15):\n return [func_4() for _ in range(var_15)]\n\n\ndef func_7(var_15):\n return [func_5() for _ in range(var_15)]\n\n\ndef func_13(var_15):\n return [func_12() for _ in range(var_15)]\n\n\ndef func_10(var_15):\n return [func_9() for _ in range(var_15)]\n\n\ndef func_17(var_15, var_16):\n return math.factorial(var_15) // math.factorial(var_16)\n\n\ndef func_14(var_15, var_16):\n return math.factorial(var_15) // (\n math.factorial(var_16) * math.factorial(var_15 - var_16)\n )\n\n\ndef func_16(var_15, *var_9, var_10=0):\n return (\n [func_16(*var_9, default=var_10) for _ in range(var_15)]\n if var_9\n else [var_10 for _ in range(var_15)]\n )\n\n\nvar_11 = [[1, 0], [0, 1], [-1, 0], [0, -1]]\nvar_12 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]\nvar_8 = \"abcdefghijklmnopqrstuvwxyz\"\nvar_2 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nvar_4 = 1000000007\nvar_3 = float(\"inf\")\nsys.setrecursionlimit(1000000)\n\n\ndef func_15():\n var_5, var_1 = func_4()\n var_6 = func_4()\n var_7 = [var_19 - var_1 for var_19 in var_6]\n var_20 = max(var_1, max(var_6))\n var_13 = func_16(var_5 + 1, 2 * var_20 * var_5 + 1)\n var_13[0][var_20 * var_5] = 1\n for var_14 in range(1, var_5 + 1):\n for var_17 in range(2 * var_20 * var_5 + 1):\n if 0 <= var_17 - var_7[var_14 - 1] <= 2 * var_20 * var_5:\n var_13[var_14][var_17] = (\n var_13[var_14 - 1][var_17]\n + var_13[var_14 - 1][var_17 - var_7[var_14 - 1]]\n )\n else:\n var_13[var_14][var_17] = var_13[var_14 - 1][var_17]\n print((var_13[-1][var_20 * var_5] - 1))\n\n\nif __name__ == \"__main__\":\n func_15()\n", "slow_time": 3072371499, "fast_time": 488085549, "speedup": 6.2947, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_16"} -{"pair_id": "python_7825", "problem_id": "p02888", "language": "python", "slow_code": "from collections import defaultdict, deque, Counter, OrderedDict\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce, lru_cache\nfrom heapq import heappush, heappop, heapify\nimport itertools\nimport math, fractions\nimport sys, copy\n\n\ndef func_3():\n return sys.stdin.readline().split()\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_12():\n return list(sys.stdin.readline().rstrip())\n\n\ndef func_4():\n return [int(var_16) for var_16 in sys.stdin.readline().split()]\n\n\ndef func_5():\n return [int(var_16) - 1 for var_16 in sys.stdin.readline().split()]\n\n\ndef func_9():\n return [list(var_16) for var_16 in sys.stdin.readline().split()]\n\n\ndef func_11(var_14):\n return [sys.stdin.readline().strip() for _ in range(var_14)]\n\n\ndef func_8(var_14):\n return [func_3() for _ in range(var_14)]\n\n\ndef func_2(var_14):\n return [func_1() for _ in range(var_14)]\n\n\ndef func_6(var_14):\n return [func_4() for _ in range(var_14)]\n\n\ndef func_7(var_14):\n return [func_5() for _ in range(var_14)]\n\n\ndef func_13(var_14):\n return [func_12() for _ in range(var_14)]\n\n\ndef func_10(var_14):\n return [func_9() for _ in range(var_14)]\n\n\ndef func_17(var_14, var_15):\n return math.factorial(var_14) // math.factorial(var_15)\n\n\ndef func_14(var_14, var_15):\n return math.factorial(var_14) // (\n math.factorial(var_15) * math.factorial(var_14 - var_15)\n )\n\n\ndef func_16(var_14, *var_7, var_8=0):\n return (\n [func_16(*var_7, default=var_8) for _ in range(var_14)]\n if len(var_7) > 0\n else [var_8 for _ in range(var_14)]\n )\n\n\nvar_9 = [[1, 0], [0, 1], [-1, 0], [0, -1]]\nvar_10 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]\nvar_5 = \"abcdefghijklmnopqrstuvwxyz\"\nvar_1 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nvar_3 = 1000000007\nvar_2 = float(\"inf\")\nsys.setrecursionlimit(1000000)\n\n\ndef func_15():\n var_4 = func_1()\n func_3 = sorted(func_4())\n var_6 = 0\n for var_11 in range(var_4):\n var_13 = var_11\n for var_12 in range(var_11 + 1, var_4):\n while var_13 < var_4 and func_3[var_13] < func_3[var_11] + func_3[var_12]:\n var_13 += 1\n var_6 += var_13 - (var_12 + 1)\n print(var_6)\n\n\nif __name__ == \"__main__\":\n func_15()\n", "fast_code": "var_7 = int(eval(input()))\nvar_6 = list(map(int, input().split()))\nvar_6.sort()\nvar_2 = 0\nfrom bisect import bisect_left\n\nfor var_3 in range(var_7 - 2):\n for var_5 in range(var_3 + 1, var_7 - 1):\n var_1 = var_6[var_3] + var_6[var_5]\n var_4 = bisect_left(var_6, var_1)\n var_2 += max(var_4 - var_5 - 1, 0)\nprint(var_2)\n", "slow_time": 203845466, "fast_time": 33970756, "speedup": 6.0006, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_27"} -{"pair_id": "python_245", "problem_id": "p03061", "language": "python", "slow_code": "def func_1(var_9):\n var_5 = []\n for var_6 in range(1, int(var_9**0.5) + 1):\n if var_9 % var_6 == 0:\n var_5.append(var_6)\n if var_6 != var_9 // var_6:\n var_5.append(var_9 // var_6)\n return var_5\n\n\nvar_9 = int(eval(input()))\nvar_3 = [int(var_6) for var_6 in input().split()]\nvar_1 = set(var_3)\nvar_4 = {}\nfor var_6, var_7 in enumerate(var_1):\n var_10 = func_1(var_7)\n for var_8 in var_10:\n if var_8 in var_4:\n var_4[var_8] += 1\n elif var_6 == 0 or var_8 not in var_4:\n var_4[var_8] = 1\nvar_2 = 1\nfor var_6 in var_4:\n var_11 = 0\n for var_7 in var_3:\n if var_7 % var_6:\n var_11 += 1\n if var_11 < 2:\n var_2 = max(var_2, var_6)\nprint(var_2)\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = [int(var_6) for var_6 in input().split()]\n\n\ndef func_1(var_7, var_8):\n if var_7 < var_8:\n var_7, var_8 = var_8, var_7\n if var_8 == 0:\n return var_7\n return func_1(var_7 % var_8, var_8)\n\n\nvar_2 = [0]\nvar_5 = [0]\nfor var_6 in range(var_4):\n var_2.append(func_1(var_1[var_6], var_2[var_6]))\n var_5.append(func_1(var_1[-var_6 - 1], var_5[var_6]))\nvar_5.reverse()\nvar_3 = []\nfor var_6 in range(0, var_4):\n var_3.append(func_1(var_2[var_6], var_5[var_6 + 1]))\nprint((max(var_3)))\n", "slow_time": 1204085687, "fast_time": 51394366, "speedup": 23.4284, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_27"} -{"pair_id": "python_13866", "problem_id": "p04029", "language": "python", "slow_code": "def func_1(var_1, var_2, var_3):\n return var_3 * (2 * var_1 + (var_3 - 1) * var_2) // 2\n\n\ndef func_2():\n var_3 = int(eval(input()))\n print((func_1(1, 1, var_3)))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_1 = int(eval(input()))\nprint(((var_1 * (var_1 + 1)) // 2))\n", "slow_time": 23689447, "fast_time": 10709553, "speedup": 2.212, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_11"} -{"pair_id": "python_14422", "problem_id": "p02669", "language": "python", "slow_code": "def func_1():\n from collections import defaultdict, deque\n\n var_13 = 10**27\n var_6 = int(eval(input()))\n for _ in range(var_6):\n var_5, var_1, var_2, var_3, var_4 = list(map(int, input().split()))\n var_12 = deque()\n var_12.append((0, var_5))\n var_9 = defaultdict(lambda: var_13)\n var_7 = var_5 * var_4 + 1\n while var_12:\n var_10, var_17 = var_12.popleft()\n if var_10 >= var_7:\n continue\n if var_10 >= var_9[var_17]:\n continue\n var_9[var_17] = var_10\n\n var_7 = min(var_7, var_10 + var_17 * var_4)\n for var_11, var_8 in ((2, var_1), (3, var_2), (5, var_3)):\n\n var_15, var_16 = divmod(var_17, var_11)\n var_14 = var_10 + var_16 * var_4 + var_8\n if var_9[var_15] > var_14:\n var_12.append((var_14, var_15))\n var_14 = var_10 + (var_11 - var_16) * var_4 + var_8\n if (var_16 > 0) and (var_9[var_15 + 1] > var_14):\n var_12.append((var_14, var_15 + 1))\n print(var_7)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nvar_7 = 10**9 + 7\nvar_5 = float(\"inf\")\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\nvar_10 = func_1()\nfor _ in range(var_10):\n var_8, var_1, var_2, var_3, var_4 = func_2()\n var_6 = {0: 0, 1: var_4}\n\n def func_3(var_11):\n if var_11 in var_6:\n return var_6[var_11]\n var_9 = var_11 * var_4\n var_9 = min(\n var_9,\n min(func_3(var_11 // 2), func_3((var_11 - 1) // 2 + 1))\n + var_1\n + var_4 * (var_11 % 2),\n )\n var_9 = min(\n var_9,\n min(\n func_3(var_11 // 3) + var_2 + var_4 * (var_11 % 3),\n func_3((var_11 - 1) // 3 + 1) + var_2 + var_4 * (-var_11 % 3),\n ),\n )\n var_9 = min(\n var_9,\n min(\n func_3(var_11 // 5) + var_3 + var_4 * (var_11 % 5),\n func_3((var_11 - 1) // 5 + 1) + var_3 + var_4 * (-var_11 % 5),\n ),\n )\n var_6[var_11] = var_9\n return var_9\n\n print((func_3(var_8)))\n", "slow_time": 115167925158, "fast_time": 15518055323, "speedup": 7.4215, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_13"} -{"pair_id": "python_9266", "problem_id": "p02558", "language": "python", "slow_code": "from networkx.utils import UnionFind\n\nvar_1, var_2 = list(map(int, input().split()))\nvar_6 = UnionFind()\nfor var_3 in range(var_2):\n var_4, var_5, var_7 = list(map(int, input().split()))\n if var_4:\n print((1 if var_6[var_5] == var_6[var_7] else 0))\n else:\n var_6.union(var_5, var_7)\n", "fast_code": "from typing import Iterable\nimport sys\n\n\ndef func_2():\n var_7 = sys.stdin.readline\n var_1, var_2 = list(map(int, var_7().split()))\n var_12 = Class_1(var_1)\n var_3 = []\n for _ in range(var_2):\n var_10, var_11, var_13 = list(map(int, var_7().split()))\n if var_10:\n var_3.append(\"1\" if var_12.same(var_11, var_13) else \"0\")\n else:\n var_12.union(var_11, var_13)\n print((\"\\n\".join(var_3)))\n\n\nclass Class_1:\n __slots__ = \"parent\"\n\n def __init__(self, var_8: int) -> None:\n self.parent = [-1] * var_8\n\n def func_1(self, var_14: int) -> int:\n var_9 = self.parent\n while var_9[var_14] >= 0:\n var_14, var_9[var_14] = var_9[var_14], var_9[var_9[var_14]]\n return var_14\n\n def func_6(self, var_14: int, var_15: int) -> bool:\n var_14, var_15, var_9 = self.find(var_14), self.find(var_15), self.parent\n if var_14 == var_15:\n return False\n if var_9[var_14] > var_9[var_15]:\n var_14, var_15 = var_15, var_14\n var_9[var_14], var_9[var_15] = var_9[var_14] + var_9[var_15], var_14\n return True\n\n def func_3(self, var_14: int, var_15: int) -> bool:\n return self.find(var_14) == self.find(var_15)\n\n def func_5(self, var_14: int) -> int:\n return -self.parent[self.find(var_14)]\n\n def func_4(self, var_6: Iterable[int]) -> bool:\n var_4, var_13 = self.find, self.find(var_6[0])\n return all(var_4(var_5) == var_13 for var_5 in var_6)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "slow_time": 18058265902, "fast_time": 124793396, "speedup": 144.7053, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_6"} -{"pair_id": "python_9681", "problem_id": "p02554", "language": "python", "slow_code": "def func_4():\n return int(eval(func_6()))\n\n\ndef func_5():\n return list(map(int, func_6().split()))\n\n\ndef func_3():\n return list(map(int, func_6().split()))\n\n\ndef func_2(var_10):\n return [int(eval(func_6())) for var_9 in range(var_10)]\n\n\ndef func_6():\n return sys.stdin.readline().rstrip()\n\n\ndef func_8(var_19, var_20):\n return random.randint(var_19, var_20)\n\n\ndef func_7(var_19, var_20, var_21):\n return [random.randint(var_19, var_20) for var_9 in range(var_21)]\n\n\ndef func_9(var_19, var_20, var_21):\n var_16 = []\n while len(var_16) < var_21:\n var_14 = random.randint(var_19, var_20)\n if not var_14 in var_16:\n var_16.append(var_14)\n return sorted(var_16)\n\n\ndef func_10(var_19, var_20, var_21):\n var_18 = []\n while len(var_18) < var_21:\n var_15 = func_9(var_19, var_20, 2)\n if not var_15 in var_18:\n var_18.append(var_15)\n return sorted(var_18)\n\n\nfrom collections import defaultdict, deque, Counter\nfrom sys import exit\nfrom decimal import *\nfrom heapq import heapify, heappop, heappush\nimport math\nimport random\nimport string\nfrom copy import deepcopy\nfrom itertools import combinations, permutations, product\nfrom operator import mul, itemgetter\nfrom functools import reduce\nfrom bisect import bisect_left, bisect_right\nimport sys\n\nsys.setrecursionlimit(1000000000)\nvar_13 = 10**9 + 7\n\n\nvar_1 = func_4()\nvar_12 = var_1.bit_length()\n\n\nvar_7 = [[[0, 0, 0, 0] for var_9 in range(4)] for var_9 in range(var_12)]\nvar_7[0] = [[8, 1, 1, 0], [0, 9, 0, 1], [0, 0, 9, 1], [0, 0, 0, 10]]\n\n\ndef func_1(var_3, var_4):\n var_8 = len(var_3)\n var_24 = len(var_4[0])\n var_23 = var_3\n var_6 = []\n for var_11 in range(var_24):\n var_17 = []\n for var_9 in range(len(var_4)):\n var_17.append(var_4[var_9][var_11])\n var_6.append(var_17)\n var_22 = [[[0, 0] for var_9 in range(var_24)] for var_9 in range(var_8)]\n for var_9 in range(var_8):\n for var_11 in range(var_24):\n var_5 = 0\n for var_25, var_26 in zip(var_23[var_9], var_6[var_11]):\n var_5 += var_25 * var_26\n var_22[var_9][var_11] = var_5\n var_22[var_9][var_11] %= var_13\n return var_22\n\n\nfor var_9 in range(1, var_12):\n var_7[var_9] = func_1(var_7[var_9 - 1], var_7[var_9 - 1])\nvar_2 = [[1, 0, 0, 0]]\nfor var_9 in range(var_12):\n if var_1 & (1 << var_9):\n var_2 = func_1(var_2, var_7[var_9])\nprint((var_2[0][-1] % var_13))\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = 10**9 + 7\n\n\ndef func_1(var_3, var_9, var_10):\n var_6 = str(format(var_9, \"b\"))\n var_11 = 1\n for var_8 in range(len(var_6)):\n var_11 = (var_11 * var_11) % var_10\n if var_6[var_8] == \"1\":\n var_11 = (var_11 * var_3) % var_10\n return var_11\n\n\nvar_3 = func_1(10, var_2, var_1)\nvar_5 = func_1(9, var_2, var_1)\nvar_7 = func_1(8, var_2, var_1)\nvar_4 = var_3 - 2 * var_5 + var_7\nprint((var_4 % var_1))\n", "slow_time": 273778611, "fast_time": 42408281, "speedup": 6.4558, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_0"} -{"pair_id": "python_13616", "problem_id": "p02362", "language": "python", "slow_code": "import array\nimport collections\n\nvar_1 = 2**31\n\n\nclass Class_1(Exception):\n pass\n\n\nclass Class_2(Class_1):\n def __init__(self, var_12):\n self.reason = var_12\n\n def __str__(self):\n return str(var_12)\n\n\nclass Class_3(object):\n def __init__(self, var_10, var_2, var_3, var_16):\n self.max_v = var_10\n self.adj = var_2\n self.costs = var_3\n self.start = var_16\n self.dist = None\n self.visits = None\n\n def func_1(self):\n self.dist = collections.defaultdict(lambda: var_1)\n self.dist[self.start] = 0\n self.visits = collections.defaultdict(int)\n\n def func_3(self):\n self.initialize()\n var_11 = collections.deque()\n var_11.append(self.start)\n while var_11:\n var_18 = var_11.popleft()\n self.visits[var_18] += 1\n if self.visits[var_18] >= self.max_v:\n if self.max_v == 1:\n return [0]\n raise Class_2(\"A negative cycle was detected.\")\n for var_19 in self.adj[var_18]:\n var_9 = self.dist[var_18] + self.costs[(var_18, var_19)]\n if var_9 < self.dist[var_19]:\n self.dist[var_19] = var_9\n if var_19 not in var_11:\n var_11.append(var_19)\n return self.dist\n\n\ndef func_2():\n var_8, var_7, var_16 = list(map(int, input().split()))\n var_2 = collections.defaultdict(lambda: array.array(\"L\"))\n var_3 = collections.defaultdict(lambda: var_1)\n for _ in range(var_7):\n var_14, var_17, var_4 = list(map(int, input().split()))\n var_2[var_14].append(var_17)\n var_3[(var_14, var_17)] = var_4\n var_15 = Class_3(var_8, var_2, var_3, var_16)\n try:\n var_5 = var_15.single_source_shortest_path()\n for var_19 in range(var_8):\n var_13 = var_5[var_19]\n if var_13 < var_1:\n print(var_13)\n else:\n print(\"INF\")\n except Class_2 as var_6:\n print(\"NEGATIVE CYCLE\")\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "import sys\n\nvar_6 = sys.stdin\nvar_2, var_1, var_10 = map(int, var_6.readline().split())\nvar_5 = []\nfor var_8 in var_6:\n var_5.append(tuple(map(int, var_8.split())))\n\nvar_3 = [float(\"inf\")] * var_2\nvar_3[var_10] = 0\nfor var_7 in range(var_2):\n var_9 = True\n for var_4 in var_5:\n var_11 = var_4[1]\n var_12 = var_3[var_4[0]] + var_4[2]\n if var_12 < var_3[var_11]:\n var_3[var_11] = var_12\n var_9 = False\n if var_9:\n break\n\nif var_7 == var_2 - 1 and var_2 != 1:\n print(\"NEGATIVE CYCLE\")\nelse:\n print(*map(lambda var_13: str(var_13).upper(), var_3), sep=\"\\n\")\n", "slow_time": 134643964, "fast_time": 45819717, "speedup": 2.9386, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_9"} -{"pair_id": "python_18421", "problem_id": "p03001", "language": "python", "slow_code": "import sys\n\nvar_4 = sys.stdin.readline\n\n\ndef func_1():\n return int(eval(var_4()))\n\n\ndef func_3():\n return list(map(int, var_4().split()))\n\n\ndef func_2():\n return list(map(int, var_4().split()))\n\n\ndef func_4():\n var_5 = 10**9 + 7\n var_2, var_1, var_6, var_7 = func_3()\n var_3 = (var_2 * var_1) / 2\n if var_6 == var_2 / 2 and var_7 == var_1 / 2:\n print((var_3, 1))\n else:\n print((var_3, 0))\n\n\nfunc_4()\n", "fast_code": "var_2, var_1, var_3, var_4 = list(map(int, input().split()))\nprint((var_2 * var_1 / 2, int(var_2 == 2 * var_3 and var_1 == 2 * var_4)))\n", "slow_time": 41211597, "fast_time": 13921484, "speedup": 2.9603, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_16"} -{"pair_id": "python_6662", "problem_id": "p04014", "language": "python", "slow_code": "import sys\n\nvar_4 = int(eval(input()))\nvar_5 = int(eval(input()))\n\n\ndef func_1(var_2, var_4):\n if var_4 < var_2:\n return var_4\n else:\n return func_1(var_2, var_4 // var_2) + var_4 % var_2\n\n\nif var_5 == var_4:\n print((var_4 + 1))\n sys.exit(0)\nif var_4 < var_5:\n print((-1))\n sys.exit(0)\nvar_1 = None\nfor var_3 in range(2, var_4):\n if var_3 * var_3 > var_4:\n break\n if func_1(var_3, var_4) == var_5:\n var_1 = var_3\n break\nfor var_3 in range(1, var_4):\n if var_3 * var_3 > var_4:\n break\n if (var_4 - var_5) % var_3 == 0:\n var_2 = (var_4 - var_5) // var_3 + 1\n if func_1(var_2, var_4) == var_5:\n if var_1 is None:\n var_1 = (var_4 - var_5) // var_3 + 1\n else:\n var_1 = min((var_1, (var_4 - var_5) // var_3 + 1))\nif var_1 is None:\n print((-1))\nelse:\n print(var_1)\n", "fast_code": "def func_7(var_1):\n var_9 = 2\n var_18 = {}\n var_13 = var_1\n var_12 = 0\n while var_9**2 <= var_13:\n var_11 = 0\n while var_13 % var_9 == 0:\n var_13 //= var_9\n var_11 += 1\n var_18[var_9] = var_11\n var_9 += 1\n if var_9 == 101 and var_13 >= (2**20):\n\n def func_4(var_1):\n def func_5(var_5, var_6):\n while var_6:\n var_5, var_6 = var_6, var_5 % var_6\n return abs(var_5)\n\n def func_3(var_22, var_7):\n return ((var_22**2) + var_7) % var_1\n\n var_20 = [var_1]\n for var_7 in range(1, 99):\n var_22, var_23, var_8 = 2, 2, 1\n while var_8 == 1:\n var_22 = func_3(var_22, var_7)\n var_23 = func_3(func_3(var_23, var_7), var_7)\n var_8 = func_5(abs(var_22 - var_23), var_1)\n if var_8 != var_1:\n if func_6(var_8):\n return var_8\n elif func_6(var_1 // var_8):\n return var_1 // var_8\n else:\n var_20.append(var_8)\n\n while True:\n if func_6(var_13):\n var_18[var_13], var_13 = 1, 1\n break\n else:\n var_12 = 1\n var_10 = func_4(var_13)\n var_11 = 0\n while var_13 % var_10 == 0:\n var_13 //= var_10\n var_11 += 1\n var_18[var_10] = var_11\n if var_13 == 1:\n break\n if var_13 > 1:\n var_18[var_13] = 1\n if var_12 > 0:\n\n def func_1(var_3):\n var_4 = {}\n for var_22 in sorted(var_3.keys()):\n var_4[var_22] = var_3[var_22]\n return var_4\n\n var_18 = func_1(var_18)\n return var_18\n\n\ndef func_6(var_13):\n if var_13 == 2:\n return True\n if var_13 == 1 or var_13 & 1 == 0:\n return False\n var_8 = (var_13 - 1) >> 1\n while var_8 & 1 == 0:\n var_8 >>= 1\n for var_5 in [2, 3, 5, 7, 11, 13, 17, 19, 23]:\n var_21 = var_8\n var_23 = pow(var_5, var_21, var_13)\n while var_21 != var_13 - 1 and var_23 != 1 and var_23 != var_13 - 1:\n var_23 = (var_23 * var_23) % var_13\n var_21 <<= 1\n if var_23 != var_13 - 1 and var_21 & 1 == 0:\n return False\n return True\n\n\ndef func_2(var_1):\n var_15 = func_7(var_1)\n var_18 = [1]\n for var_14 in var_15:\n var_19 = var_18\n var_18 = []\n for var_9 in range(var_15[var_14] + 1):\n for var_16 in var_19:\n var_18.append(var_16 * (var_14**var_9))\n return sorted(var_18)\n\n\ndef func_3(var_6, var_13):\n var_17 = 0\n while var_13:\n var_17 += var_13 % var_6\n var_13 //= var_6\n return var_17\n\n\nvar_1 = int(eval(input()))\nvar_2 = int(eval(input()))\nif var_1 < var_2:\n print((-1))\nelif var_1 == var_2:\n print((var_1 + 1))\nelse:\n for var_6 in func_2(var_1 - var_2):\n var_6 += 1\n if func_3(var_6, var_1) == var_2:\n print(var_6)\n break\n else:\n print((-1))\n", "slow_time": 2618861164, "fast_time": 157911457, "speedup": 16.5844, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_5"} -{"pair_id": "python_223", "problem_id": "p03240", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_6 = [list(map(int, input().split())) for var_10 in range(var_4)]\nvar_6.sort(key=lambda var_11: var_11[2], reverse=1)\nfor var_1 in range(101):\n for var_2 in range(101):\n var_3 = var_6[0][2] + abs(var_6[0][0] - var_1) + abs(var_6[0][1] - var_2)\n var_8 = 0\n for var_5, var_7, var_9 in var_6:\n if var_9 == max(var_3 - abs(var_5 - var_1) - abs(var_7 - var_2), 0):\n var_8 += 1\n if var_8 == var_4:\n print((var_1, var_2, var_3))\n break\n", "fast_code": "var_1 = int(eval(input()))\nvar_12 = [list(map(int, input().split())) for var_10 in range(var_1)]\n\nvar_9 = None\nvar_7 = False\nfor var_3 in range(0, 101):\n for var_4 in range(0, 101):\n var_2 = 0\n for var_11, var_13, var_8 in var_12:\n if var_8 == 0:\n continue\n var_5 = abs(var_11 - var_3)\n var_6 = abs(var_13 - var_4)\n var_2 = var_5 + var_6 + var_8\n break\n var_7 = True\n for var_11, var_13, var_8 in var_12:\n _h = max(var_2 - abs(var_11 - var_3) - abs(var_13 - var_4), 0)\n if var_8 != _h:\n var_7 = False\n break\n if var_7 is True:\n break\n if var_7 is True:\n break\nvar_9 = var_2 if var_2 is not None else 0\nprint((var_3, var_4, var_9))\n", "slow_time": 9772291562, "fast_time": 1191604347, "speedup": 8.201, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_8"} -{"pair_id": "python_1219", "problem_id": "p02889", "language": "python", "slow_code": "from scipy.sparse.csgraph import floyd_warshall\nimport numpy as np\n\nvar_8, var_7, var_6 = list(map(int, input().split()))\nvar_4 = np.ones([var_8, var_8]) * np.inf\nvar_4[np.eye(var_8, dtype=bool)] = 0\nfor _ in range(var_7):\n var_1, var_2, var_3 = list(map(int, input().split()))\n var_4[var_1 - 1, var_2 - 1] = var_3\n var_4[var_2 - 1, var_1 - 1] = var_3\nvar_4 = floyd_warshall(var_4)\nvar_5 = (var_4 <= var_6) * 1.0\nvar_5[var_5 == 0] = np.inf\n\nvar_5 = floyd_warshall(var_5) - 1\nvar_9 = int(eval(input()))\nfor _ in range(var_9):\n var_11, var_12 = list(map(int, input().split()))\n var_10 = var_5[var_11 - 1, var_12 - 1]\n if var_10 < np.inf:\n print((int(var_10)))\n else:\n print((-1))\n", "fast_code": "import sys\n\nvar_17 = lambda: sys.stdin.readline().rstrip()\nvar_16 = lambda: list(map(int, var_17().split()))\n\n\ndef func_1(\n var_7, var_13, var_20=None, var_26=0, var_22=lambda var_4, var_11: var_4 + var_11\n):\n \"\"\"\"\"\"\n var_23 = [[var_20] * var_7 for _ in range(var_7)]\n for var_15 in range(var_7):\n var_23[var_15][var_15] = var_26\n for var_15 in range(var_7):\n for var_18, var_11 in var_13[var_15]:\n if 0 <= var_18 < var_7:\n var_23[var_15][var_18] = var_22(var_26, var_11)\n for var_19 in range(var_7):\n for var_15 in range(var_7):\n if var_15 == var_19:\n continue\n for var_18 in range(var_7):\n if (\n var_18 == var_19\n or var_23[var_15][var_19] == var_20\n or var_23[var_19][var_18] == var_20\n ):\n continue\n var_11 = var_22(var_23[var_15][var_19], var_23[var_19][var_18])\n if var_23[var_15][var_18] == var_20 or var_11 < var_23[var_15][var_18]:\n var_23[var_15][var_18] = var_11\n return var_23\n\n\nvar_7, var_6, var_5 = var_16()\nvar_24 = [[] for _ in range(var_7)]\nfor var_15 in range(var_6):\n var_1, var_2, var_3 = var_16()\n if var_3 <= var_5:\n var_24[var_1 - 1].append((var_2 - 1, var_3))\n var_24[var_2 - 1].append((var_1 - 1, var_3))\nvar_8 = int(eval(var_17()))\nvar_9 = []\nvar_14 = [set() for _ in range(var_7)]\nfor _ in range(var_8):\n var_25, var_27 = var_16()\n var_25 -= 1\n var_27 -= 1\n var_9.append((var_25, var_27))\nvar_12 = func_1(var_7, var_24)\nvar_21 = [set() for _ in range(var_7)]\nfor var_15 in range(var_7):\n for var_18 in range(var_7):\n var_11 = var_12[var_15][var_18]\n if var_11 is not None and var_11 <= var_5:\n var_21[var_15].add((var_18, 1))\nvar_10 = func_1(var_7, var_21)\nfor var_25, var_27 in var_9:\n if var_10[var_25][var_27] is None:\n print((-1))\n else:\n print((var_10[var_25][var_27] - 1))\n", "slow_time": 25120883849, "fast_time": 182436731, "speedup": 137.6964, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_24"} -{"pair_id": "python_10215", "problem_id": "p03222", "language": "python", "slow_code": "var_4, var_14, var_1 = list(map(int, input().split()))\nvar_11 = 10**9 + 7\nvar_3 = [[0] * var_14 for _ in range(var_4 + 1)]\nvar_3[0][0] = 1\nfor var_5 in range(1, var_4 + 1):\n for var_7 in range(var_14):\n var_10, var_2, var_13 = 0, 0, 0\n for var_8 in range(2 ** (var_14 - 1)):\n var_6 = False\n for var_9 in range(1, var_14 - 1):\n if var_8 >> var_9 & 1 and var_8 >> (var_9 - 1) & 1:\n var_6 = True\n if var_6:\n continue\n var_12 = True\n if var_7 > 0:\n if var_8 >> (var_7 - 1) & 1:\n var_10 += 1\n var_12 = False\n if var_7 < var_14 - 1:\n if var_8 >> var_7 & 1:\n var_13 += 1\n var_12 = False\n if var_12:\n var_2 += 1\n if var_7 > 0:\n var_3[var_5][var_7] += var_3[var_5 - 1][var_7 - 1] * var_10\n if var_7 < var_14 - 1:\n var_3[var_5][var_7] += var_3[var_5 - 1][var_7 + 1] * var_13\n var_3[var_5][var_7] += var_3[var_5 - 1][var_7] * var_2\n var_3[var_5][var_7] %= var_11\nprint((var_3[var_4][var_1 - 1]))\n", "fast_code": "import sys\n\nvar_12 = sys.stdin\nsys.setrecursionlimit(10**7)\n\n\ndef func_3():\n return list(map(int, var_12.readline().split()))\n\n\ndef func_4():\n return [int(var_16) - 1 for var_16 in var_12.readline().split()]\n\n\ndef func_2():\n return list(map(float, var_12.readline().split()))\n\n\ndef func_5():\n return var_12.readline().split()\n\n\ndef func_8():\n return var_12.readline().rstrip()\n\n\ndef func_1():\n return list(func_8())\n\n\ndef func_7():\n return int(var_12.readline())\n\n\ndef func_6():\n return float(var_12.readline())\n\n\nvar_5, var_13, var_8 = func_3()\nvar_8 -= 1\nvar_1 = 10**9 + 7\n\nif var_13 > 1:\n var_9 = [[0] * var_13 for _ in range(var_13)]\n for var_11 in range(1 << (var_13 - 1)):\n if \"11\" in bin(var_11):\n continue\n var_4 = False\n for var_7, var_2 in enumerate(bin(var_11)[2:].zfill(var_13 - 1)):\n if var_2 == \"1\":\n var_4 = True\n var_9[var_7][var_7 + 1] += 1\n var_9[var_7 + 1][var_7] += 1\n elif var_4:\n var_4 = False\n else:\n var_9[var_7][var_7] += 1\n if not var_4:\n var_9[var_13 - 1][var_13 - 1] += 1\n\n var_3 = [1] + [0] * (var_13 - 1)\n for var_6 in range(var_5):\n var_10 = [0] * var_13\n for var_14 in range(var_13):\n for var_15 in range(var_13):\n var_10[var_14] += var_9[var_14][var_15] * var_3[var_15]\n var_10[var_14] %= var_1\n var_3 = var_10\n print((var_3[var_8]))\nelse:\n print((1))\n", "slow_time": 2168607755, "fast_time": 146951952, "speedup": 14.7573, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_7"} -{"pair_id": "python_14251", "problem_id": "p03558", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nfrom collections import deque\n\n\ndef func_1(var_3, var_11):\n var_6 = len(var_3)\n var_10 = [float(\"inf\")] * var_6\n var_10[var_11] = 0\n var_7 = var_6 - 1\n var_8 = deque([(0, var_11)])\n while var_8 and var_7:\n var_2, var_13 = var_8.popleft()\n if var_10[var_13] < var_2:\n continue\n var_7 -= 1\n\n for var_12, var_1 in var_3[var_13]:\n if var_2 + var_1 < var_10[var_12]:\n var_10[var_12] = var_2 + var_1\n if var_1:\n var_8.append((var_10[var_12], var_12))\n else:\n var_8.appendleft((var_10[var_12], var_12))\n return var_10\n\n\nimport sys\n\nsys.setrecursionlimit(10**6)\nvar_9 = sys.stdin.readline\nvar_5 = int(eval(input()))\nvar_3 = [[] for _ in range(var_5)]\nfor var_4 in range(var_5):\n var_3[var_4].append(((var_4 + 1) % var_5, 1))\n var_3[var_4].append((10 * var_4 % var_5, 0))\nvar_10 = func_1(var_3, 1)\nprint((var_10[0] + 1))\n", "fast_code": "from collections import deque\n\n\ndef func_1(var_1):\n var_2 = [99999999999] * (var_1 + 1)\n var_4 = deque()\n var_4.append((1, 1))\n var_2[1] = 1\n while var_4:\n var_5, var_3 = var_4.popleft()\n if var_5 == 0:\n return var_3\n _ = (var_5 * 10) % var_1\n if var_3 < var_2[_]:\n var_4.appendleft((_, var_3))\n var_2[_] = var_3\n _ = (var_5 + 1) % var_1\n if var_3 + 1 < var_2[_]:\n var_4.append((_, var_3 + 1))\n var_2[_] = var_3 + 1\n return None\n\n\nvar_1 = int(eval(input()))\nprint((func_1(var_1)))\n", "slow_time": 3422632544, "fast_time": 524611965, "speedup": 6.5241, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_0"} -{"pair_id": "python_16600", "problem_id": "p03147", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nvar_5 = 0\nwhile True:\n var_6 = var_4\n for var_3 in range(var_4):\n if var_2[var_3] != 0:\n var_6 = var_3\n break\n if var_6 == var_4:\n break\n var_1 = var_4 - 1\n for var_3 in range(var_6, var_4):\n if var_2[var_3] == 0:\n var_1 = var_3 - 1\n break\n var_2[var_3] -= 1\n var_5 += 1\nprint(var_5)\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nvar_4 = var_2[0]\nfor var_3 in range(1, var_1):\n var_4 += max(0, var_2[var_3] - var_2[var_3 - 1])\nprint(var_4)\n", "slow_time": 144746630, "fast_time": 22446470, "speedup": 6.4485, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_18"} -{"pair_id": "python_16348", "problem_id": "p03309", "language": "python", "slow_code": "var_11 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_5 = -1 * (10**10)\nvar_3 = 10**10\nvar_6 = sum([abs(var_1[var_9] - (var_5 + 2 + var_9)) for var_9 in range(var_11)]) - sum(\n [abs(var_1[var_9] - (var_5 + 1 + var_9)) for var_9 in range(var_11)]\n)\nvar_4 = sum([abs(var_1[var_9] - (var_3 + 2 + var_9)) for var_9 in range(var_11)]) - sum(\n [abs(var_1[var_9] - (var_3 + 1 + var_9)) for var_9 in range(var_11)]\n)\nwhile var_3 - var_5 > 10:\n var_7 = (var_5 + var_3) // 2\n var_8 = sum(\n [abs(var_1[var_9] - (var_7 + 2 + var_9)) for var_9 in range(var_11)]\n ) - sum([abs(var_1[var_9] - (var_7 + 1 + var_9)) for var_9 in range(var_11)])\n if var_8 > 0:\n var_3 = var_7\n else:\n var_5 = var_7\nvar_2 = 10**20\nfor var_10 in range(var_5, var_3):\n var_2 = min(\n var_2,\n sum([abs(var_1[var_9] - (var_10 + 2 + var_9)) for var_9 in range(var_11)]),\n )\nprint(var_2)\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = var_1\nfor var_7 in range(var_4):\n var_2[var_7] -= var_7 + 1\nvar_3 = sorted(var_2)\nif var_4 % 2 == 0:\n var_6 = (var_3[int(var_4 / 2 - 1)] + var_3[int(var_4 / 2)]) // 2\nelse:\n var_6 = var_3[int((var_4 - 1) / 2)]\nvar_5 = 0\nfor var_7 in range(var_4):\n var_5 += abs(var_3[var_7] - var_6)\nprint(var_5)\n", "slow_time": 150426833, "fast_time": 38681000, "speedup": 3.8889, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_21"} -{"pair_id": "python_7788", "problem_id": "p03108", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return map(int, sys.stdin.readline().rstrip().split())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nclass Class_1:\n def __init__(self, var_10):\n self.par = [var_9 for var_9 in range(var_10 + 1)]\n self.rank = [0] * (var_10 + 1)\n self.X = [0] + [1] * var_10\n\n def func_8(self, var_11):\n if self.par[var_11] == var_11:\n return var_11\n else:\n self.par[var_11] = self.find(self.par[var_11])\n return self.par[var_11]\n\n def func_9(self, var_11, var_12):\n return self.find(var_11) == self.find(var_12)\n\n def func_10(self, var_11, var_12):\n var_11 = self.find(var_11)\n var_12 = self.find(var_12)\n if self.rank[var_11] < self.rank[var_12]:\n var_11, var_12 = var_12, var_11\n if self.rank[var_11] == self.rank[var_12]:\n self.rank[var_11] += 1\n self.par[var_12] = var_11\n self.X[var_11] = self.X[var_11] + self.X[var_12]\n\n\nvar_4, var_3 = func_6()\nvar_5 = Class_1(var_4)\nvar_1 = [tuple(func_6()) for _ in range(var_3)]\nvar_1.reverse()\nvar_7 = var_4 * (var_4 - 1) // 2\nvar_2 = []\nfor var_9 in range(var_3):\n var_2.append(var_7)\n var_6, var_8 = var_1[var_9]\n if var_5.same_check(var_6, var_8):\n continue\n else:\n var_7 -= var_5.X[var_5.find(var_6)] * var_5.X[var_5.find(var_8)]\n var_5.unite(var_6, var_8)\nvar_2.reverse()\nprint(*var_2, sep=\"\\n\")\n", "fast_code": "var_5 = lambda var_8: var_8 if var_7[var_8] < 0 else var_5(var_7[var_8])\nvar_4, var_3, *var_2 = map(int, open(0).read().split())\nvar_7 = [-1] * -~var_4\nvar_6 = var_4 * ~-var_4 // 2\nvar_1 = [var_6]\nfor var_8, var_9 in zip(var_2[-2:1:-2], var_2[:1:-2]):\n var_8, var_9 = sorted((var_5(var_8), var_5(var_9)))\n if var_8 != var_9:\n var_6 -= var_7[var_8] * var_7[var_9]\n var_7[var_8] += var_7[var_9]\n var_7[var_9] = var_8\n var_1 += [var_6]\nprint(*var_1[::-1], sep=\"\\n\")\n", "slow_time": 121092416, "fast_time": 44240664, "speedup": 2.7371, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_13"} -{"pair_id": "python_16424", "problem_id": "p03796", "language": "python", "slow_code": "from math import factorial\n\nvar_1 = int(eval(input()))\nprint((factorial(var_1) % (10**9 + 7)))\n", "fast_code": "var_3 = int(eval(input()))\n\n\ndef func_1(var_4):\n if var_4 == 1:\n return 1\n else:\n var_1 = 1\n for var_2 in range(var_4 + 1)[1:]:\n var_1 *= var_2\n var_1 %= 10**9 + 7\n return var_1\n\n\nprint((func_1(var_3)))\n", "slow_time": 27006361128, "fast_time": 1420571179, "speedup": 19.0109, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_19"} -{"pair_id": "python_2022", "problem_id": "p02603", "language": "python", "slow_code": "import sys\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\nvar_4 = func_1()\nvar_2 = [0] + func_2()\nvar_1 = [0]\nfor var_6 in range(var_4):\n if var_2[var_6] != var_2[var_6 + 1]:\n var_1.append(var_2[var_6 + 1])\nvar_4 = len(var_1) - 1\nvar_3 = [0, 1000] + [0] * var_4\nfrom functools import lru_cache\n\n\n@lru_cache(maxsize=None)\ndef func_3(var_9, var_8):\n if var_9 == var_4 + 1:\n return var_8\n else:\n var_10 = var_8\n for var_6 in range(var_9, var_4):\n for var_7 in range(var_6 + 1, var_4 + 1):\n if (\n var_1[var_6] == min(var_1[var_6 : var_7 + 1])\n and var_1[var_7] == max(var_1[var_6 : var_7 + 1])\n and var_1[var_6] < var_1[var_7]\n ):\n var_5 = var_8 + (var_1[var_7] - var_1[var_6]) * (\n var_8 // var_1[var_6]\n )\n if var_5 > var_3[var_7 + 1]:\n var_10 = max(var_10, func_3(var_7 + 1, var_5))\n var_3[var_7 + 1] = var_5\n return var_10\n\n\nprint((func_3(1, 1000)))\n", "fast_code": "from sys import stdin\n\nvar_5 = stdin.readline\nvar_2 = int(eval(var_5()))\nvar_1 = list(map(int, var_5().split()))\nvar_7 = 0\nvar_6 = 1000\nfor var_4 in range(var_2 - 1):\n if var_1[var_4 + 1] > var_1[var_4]:\n var_3 = var_6 // var_1[var_4]\n var_6 -= var_1[var_4] * var_3\n var_6 += var_3 * var_1[var_4 + 1]\nprint(var_6)\n", "slow_time": 86185448, "fast_time": 30255706, "speedup": 2.8486, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_14"} -{"pair_id": "python_13793", "problem_id": "p02385", "language": "python", "slow_code": "class Class_1:\n def __init__(self):\n\n self.t = 1\n self.s = 2\n self.e = 3\n self.w = 4\n self.n = 5\n self.b = 6\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def __init__(self, var_17, var_13, var_6, var_20, var_10, var_1):\n\n self.t = var_17\n self.s = var_13\n self.e = var_6\n self.w = var_20\n self.n = var_10\n self.b = var_1\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def func_2(self, var_23):\n if var_23 == 0:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.n,\n self.t,\n self.e,\n self.w,\n self.b,\n self.s,\n )\n elif var_23 == 1:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.s,\n self.b,\n self.e,\n self.w,\n self.t,\n self.n,\n )\n elif var_23 == 2:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.w,\n self.s,\n self.t,\n self.b,\n self.n,\n self.e,\n )\n elif var_23 == 3:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.e,\n self.s,\n self.b,\n self.t,\n self.n,\n self.w,\n )\n\n\ndef func_1():\n import random\n\n var_18, var_14, var_7, var_21, var_11, var_2 = list(map(int, input().split()))\n var_19, var_15, var_8, var_22, var_12, var_3 = list(map(int, input().split()))\n var_4 = Class_1(var_18, var_14, var_7, var_21, var_11, var_2)\n var_5 = Class_1(var_19, var_15, var_8, var_22, var_12, var_3)\n var_9 = 0\n for _ in range(10000):\n if (var_4.t, var_4.s, var_4.e, var_4.w, var_4.n, var_4.b) == (\n var_5.t,\n var_5.s,\n var_5.e,\n var_5.w,\n var_5.n,\n var_5.b,\n ):\n var_9 = 1\n break\n else:\n var_16 = random.randint(0, 3)\n var_5.rot(var_16)\n if var_9 == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "import sys\n\n\nclass Class_1:\n def __init__(self, var_8):\n self.pips = var_8\n\n def func_3(self, var_4):\n if var_4 == \"N\":\n var_13 = self.pips[0]\n self.pips[0] = self.pips[1]\n self.pips[1] = self.pips[5]\n self.pips[5] = self.pips[4]\n self.pips[4] = var_13\n del var_13\n elif var_4 == \"S\":\n var_13 = self.pips[0]\n self.pips[0] = self.pips[4]\n self.pips[4] = self.pips[5]\n self.pips[5] = self.pips[1]\n self.pips[1] = var_13\n del var_13\n elif var_4 == \"E\":\n var_13 = self.pips[0]\n self.pips[0] = self.pips[3]\n self.pips[3] = self.pips[5]\n self.pips[5] = self.pips[2]\n self.pips[2] = var_13\n del var_13\n elif var_4 == \"W\":\n var_13 = self.pips[0]\n self.pips[0] = self.pips[2]\n self.pips[2] = self.pips[5]\n self.pips[5] = self.pips[3]\n self.pips[3] = var_13\n del var_13\n\n def func_6(self):\n var_13 = self.pips[1]\n self.pips[1] = self.pips[2]\n self.pips[2] = self.pips[4]\n self.pips[4] = self.pips[3]\n self.pips[3] = var_13\n del var_13\n\n\ndef func_1():\n var_8 = [int(var_7) for var_7 in sys.stdin.readline().strip(\"\\n\").split()]\n var_1 = Class_1(var_8)\n return var_1\n\n\ndef func_5(var_1):\n var_5 = list(sys.stdin.readline().strip(\"\\n\"))\n for var_4 in var_5:\n var_1.move_die(var_4)\n return var_1\n\n\ndef func_4(var_1):\n var_9 = int(sys.stdin.readline().strip(\"\\n\"))\n for var_11 in range(var_9):\n var_10 = [int(var_7) for var_7 in sys.stdin.readline().strip(\"\\n\").split()]\n if var_10[0] == var_1.pips[1]:\n var_1.move_die(\"N\")\n elif var_10[0] == var_1.pips[2]:\n var_1.move_die(\"W\")\n elif var_10[0] == var_1.pips[3]:\n var_1.move_die(\"E\")\n elif var_10[0] == var_1.pips[4]:\n var_1.move_die(\"S\")\n elif var_10[0] == var_1.pips[5]:\n var_1.move_die(\"N\")\n var_1.move_die(\"N\")\n while var_1.pips[1] != var_10[1]:\n var_1.spin_die_clockwise()\n print((var_1.pips[2]))\n\n\ndef func_2():\n var_2 = func_1()\n var_3 = func_1()\n if sorted(var_2.pips) != sorted(var_3.pips):\n print(\"No\")\n else:\n for var_6, var_7 in enumerate(var_3.pips):\n for var_12 in range(4):\n if var_2.pips == var_3.pips:\n print(\"Yes\")\n sys.exit(0)\n else:\n var_2.spin_die_clockwise()\n if var_6 in {0, 1, 2}:\n var_2.move_die(\"N\")\n if var_6 in {3}:\n var_2.move_die(\"N\")\n var_2.move_die(\"E\")\n if var_6 in {4}:\n var_2.move_die(\"E\")\n var_2.move_die(\"E\")\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n func_2()\n", "slow_time": 3599802039, "fast_time": 212264086, "speedup": 16.9591, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_6"} -{"pair_id": "python_1558", "problem_id": "p02990", "language": "python", "slow_code": "from math import factorial\n\nvar_3, var_1 = [int(_) for _ in input().split()]\n\nvar_2 = 10**9 + 7\nvar_7 = [0] * (var_3 + 1)\nvar_7[0] = var_7[1] = 1\nfor var_5 in range(2, var_3 + 1):\n var_7[var_5] = (var_7[var_5 - 1] * var_5) % var_2\nvar_4 = [0] * (var_3 + 1)\nvar_4[0] = var_4[1] = 1\nfor var_5 in range(2, var_3 + 1):\n\n var_4[var_5] = pow(var_7[var_5], var_2 - 2, var_2)\n\n\ndef func_1(var_8, var_6):\n\n return factorial(var_8) // (factorial(var_8 - var_6) * factorial(var_6))\n\n\ndef func_2():\n for var_5 in range(1, var_1 + 1):\n var_8 = var_3 - var_1 + 1\n var_6 = var_5\n if var_6 <= var_8:\n print(((func_1(var_8, var_6) * func_1(var_1 - 1, var_5 - 1)) % var_2))\n else:\n print((0))\n\n\nfunc_2()\n", "fast_code": "from operator import mul\nfrom functools import reduce\n\nvar_3, var_2 = list(map(int, input().split()))\n\n\ndef func_1(var_5, var_6):\n if var_5 < var_6:\n return 0\n var_6 = min(var_6, var_5 - var_6)\n if var_6 == 0:\n return 1\n var_9 = reduce(mul, list(range(var_5, var_5 - var_6, -1)))\n var_8 = reduce(mul, list(range(1, var_6 + 1)))\n return var_9 // var_8 % var_1\n\n\nvar_1 = 10**9 + 7\nfor var_4 in range(1, var_2 + 1):\n var_7 = func_1(var_3 - var_2 + 1, var_4) * func_1(var_2 - 1, var_4 - 1)\n print((var_7 % var_1))\n", "slow_time": 317255639, "fast_time": 41694555, "speedup": 7.609, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_18"} -{"pair_id": "python_18293", "problem_id": "p03209", "language": "python", "slow_code": "var_1, var_2 = list(map(int, input().split()))\nvar_3 = [1]\nfor var_5 in range(1, 55):\n var_3 += [var_3[var_5 - 1] * 2 + 3]\nvar_6 = [0, 1, 2, 3, 3]\nvar_4 = {}\n\n\ndef func_1(var_1, var_2):\n if var_4.get((var_1, var_2), -1) != -1:\n return var_4[(var_1, var_2)]\n elif var_1 == 0:\n return 1\n elif var_1 == 1:\n if var_2 > 5:\n var_4[(var_1, var_2)] = var_6[4]\n return var_6[4]\n else:\n var_4[(var_1, var_2)] = var_6[var_2 - 1]\n return var_6[var_2 - 1]\n elif var_2 <= var_3[var_1 - 1] + 1:\n var_4[(var_1, var_2)] = func_1(var_1 - 1, var_2 - 1)\n return func_1(var_1 - 1, var_2 - 1)\n elif var_2 == var_3[var_1 - 1] + 2:\n var_4[(var_1, var_2)] = func_1(var_1 - 1, var_3[var_1 - 1]) + 1\n return func_1(var_1 - 1, var_3[var_1 - 1]) + 1\n else:\n var_4[(var_1, var_2)] = (\n func_1(var_1 - 1, var_3[var_1 - 1])\n + 1\n + func_1(var_1 - 1, var_2 - var_3[var_1 - 1] - 2)\n )\n return (\n func_1(var_1 - 1, var_3[var_1 - 1])\n + 1\n + func_1(var_1 - 1, var_2 - var_3[var_1 - 1] - 2)\n )\n\n\nif var_1 == 50 and var_2 == 4321098765432109:\n print((2160549382716056))\nelse:\n print((func_1(var_1, var_2)))\n", "fast_code": "def func_1(var_5, var_1):\n var_4, var_3 = 4 * 2**var_5 - 3, 2 * 2**var_5 - 1\n var_2 = var_4 / 2 + 1\n return (\n 0\n if (var_1 < 1) + (var_1 > var_4)\n else [\n 0,\n func_1(var_5 - 1, var_1 - 1),\n var_3 / 2 + 1,\n func_1(var_5 - 1, var_1 - var_2) + var_3 / 2 + 1,\n var_3,\n 1,\n ][\n (var_1 > 1)\n + (var_1 >= var_2)\n + (var_1 > var_2)\n + (var_1 >= var_4)\n + (var_5 == 0) * 3\n ]\n )\n\n\nprint(func_1(*list(map(int, input().split()))))\n", "slow_time": 102572085, "fast_time": 30427807, "speedup": 3.371, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_5"} -{"pair_id": "python_14223", "problem_id": "p00458", "language": "python", "slow_code": "def func_2():\n while True:\n var_9, var_10 = int(eval(input())), int(eval(input()))\n if not var_9:\n break\n var_7 = [[0] + list(map(int, input().split())) + [0] for _ in range(var_10)]\n var_7.insert(\n 0,\n [0] * (var_9 + 2),\n )\n var_7.append([0] * (var_9 + 2))\n var_11 = [[0] * (var_9 + 2) for _ in range(var_10 + 2)]\n for var_12 in range(1, var_10 + 1):\n for var_13 in range(1, var_9 + 1):\n if var_7[var_12][var_13]:\n var_11[var_12][var_13] += (\n var_7[var_12 - 1][var_13]\n + var_7[var_12 + 1][var_13]\n + var_7[var_12][var_13 - 1]\n + var_7[var_12][var_13 + 1]\n )\n\n def func_1(var_12, var_13, var_8, var_2):\n var_8[var_12][var_13] = 0\n var_2 += 1\n var_1 = var_4 = var_5 = var_6 = 0\n if var_8[var_12 - 1][var_13]:\n var_1 = func_1(var_12 - 1, var_13, var_8, var_2)\n if var_8[var_12 + 1][var_13]:\n var_4 = func_1(var_12 + 1, var_13, var_8, var_2)\n if var_8[var_12][var_13 - 1]:\n var_5 = func_1(var_12, var_13 - 1, var_8, var_2)\n if var_8[var_12][var_13 + 1]:\n var_6 = func_1(var_12, var_13 + 1, var_8, var_2)\n var_8[var_12][var_13] = 1\n return max(var_2, var_1, var_4, var_5, var_6)\n\n var_3 = 0\n for var_12 in range(1, var_10 + 1):\n for var_13 in range(1, var_9 + 1):\n if var_11[var_12][var_13] in [1, 2]:\n var_1 = func_1(var_12, var_13, var_7, 0)\n if var_3 < var_1:\n var_3 = var_1\n print(var_3)\n\n\nfunc_2()\n", "fast_code": "def func_2():\n def func_1(var_1, var_9, var_10, var_8=0):\n if var_1[var_9][var_10] == 0:\n return var_8\n var_1[var_9][var_10] = 0\n var_3 = max(\n func_1(var_1, var_9 - 1, var_10, var_8 + 1),\n func_1(var_1, var_9, var_10 - 1, var_8 + 1),\n func_1(var_1, var_9 + 1, var_10, var_8 + 1),\n func_1(var_1, var_9, var_10 + 1, var_8 + 1),\n )\n var_1[var_9][var_10] = 1\n return var_3\n\n for var_4 in iter(input, \"0\"):\n var_8, var_7 = int(var_4), int(eval(input()))\n var_2 = [[0] * (var_8 + 2) for _ in [0] * (var_7 + 2)]\n for var_5 in range(var_7):\n var_2[var_5 + 1][1:-1] = list(map(int, input().split()))\n print(\n (\n max(\n func_1(var_2, var_5, var_6)\n for var_5 in range(1, var_7 + 1)\n for var_6 in range(1, var_8 + 1)\n )\n )\n )\n\n\nif \"__main__\" == __name__:\n func_2()\n", "slow_time": 146369703, "fast_time": 71978737, "speedup": 2.0335, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_5"} -{"pair_id": "python_13128", "problem_id": "p02783", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = 0\nwhile var_2 > 0:\n var_2 -= var_1\n var_3 += 1\nprint(var_3)\n", "fast_code": "from collections import Counter\n\n\ndef func_1():\n return [int(var_4) for var_4 in input().split()]\n\n\nvar_2, var_1 = func_1()\nvar_3 = var_2 // var_1\nvar_5 = var_2 % var_1\nif var_5 != 0:\n var_3 += 1\nprint(var_3)\n", "slow_time": 203734224, "fast_time": 18392001, "speedup": 11.0773, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_17"} -{"pair_id": "python_12235", "problem_id": "p00008", "language": "python", "slow_code": "import sys\n\nvar_7 = [0 for var_2 in range(10000)]\nvar_1 = 0\nfor var_2 in range(10):\n for var_3 in range(10):\n for var_4 in range(10):\n for var_5 in range(10):\n var_7[var_1] = var_2 + var_3 + var_4 + var_5\n var_1 += 1\nfor var_6 in sys.stdin:\n print((var_7.count(int(var_6))))\n", "fast_code": "while True:\n try:\n var_6 = int(eval(input()))\n var_4 = 0\n for var_1 in range(10):\n for var_2 in range(10):\n for var_3 in range(10):\n var_5 = var_6 - (var_1 + var_2 + var_3)\n if 0 <= var_5 <= 9:\n var_4 += 1\n print(var_4)\n except EOFError:\n break\n", "slow_time": 1332608454, "fast_time": 210429027, "speedup": 6.3328, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_13"} -{"pair_id": "python_16522", "problem_id": "p03274", "language": "python", "slow_code": "import bisect\n\n\ndef func_1():\n var_2, var_1 = list(map(int, input().split()))\n var_12 = [int(var_8) for var_8 in input().split()]\n var_10 = bisect.bisect_right(var_12, 0)\n var_11 = min(var_10 + var_1, var_2)\n var_7 = max(var_10 - var_1, 0)\n var_6 = 999999999999\n for var_9 in range(var_1):\n if var_11 < var_7 + var_9 + var_1:\n break\n if var_12[var_7 + var_9 + var_1 - 1] < 0:\n var_6 = min(var_6, abs(var_12[var_7 + var_9]))\n elif var_12[var_7 + var_9] < 0 <= var_12[var_7 + var_9 + var_1 - 1]:\n var_4 = 2 * min(\n abs(var_12[var_7 + var_9]), var_12[var_7 + var_9 + var_1 - 1]\n )\n var_5 = max(abs(var_12[var_7 + var_9]), var_12[var_7 + var_9 + var_1 - 1])\n var_3 = min(var_6, var_4 + var_5)\n var_6 = min(var_6, var_3)\n elif 0 <= var_12[var_7 + var_9]:\n var_6 = min(var_6, var_12[var_7 + var_9 + var_1 - 1])\n print(var_6)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_6 = list(map(int, input().split()))\nassert len(var_6) == var_2\nvar_5 = min(\n var_4 - var_3 + min(abs(var_3), abs(var_4))\n for var_3, var_4 in zip(var_6, var_6[var_1 - 1 :])\n)\nprint(var_5)\n", "slow_time": 73062352, "fast_time": 27075235, "speedup": 2.6985, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_16"} -{"pair_id": "python_4587", "problem_id": "p04015", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_4 = list([int(var_10) - var_1 for var_10 in input().split()])\nvar_5 = max(max(var_4), -min(var_4))\nvar_3 = var_2 * var_5\nvar_6 = [\n [[0] * (var_2 + 1) for var_7 in range(var_2 + 1)] for _ in range(var_3 * 2 + 1)\n]\nvar_6[var_3][0][0] = 1\nfor var_7 in range(1, var_2 + 1):\n for var_8 in range(0, var_7 + 1):\n for var_9 in range(var_3 * 2 + 1):\n if var_9 == var_3 and var_8 == 0:\n var_6[var_9][var_7][var_8] = 1\n continue\n var_6[var_9][var_7][var_8] += var_6[var_9][var_7 - 1][var_8]\n if 0 <= var_9 - var_4[var_7 - 1] < var_3 * 2 + 1:\n var_6[var_9][var_7][var_8] += var_6[var_9 - var_4[var_7 - 1]][\n var_7 - 1\n ][var_8 - 1]\nprint((sum(var_6[var_3][var_2]) - 1))\n", "fast_code": "from collections import defaultdict\n\nvar_2, var_1 = list(map(int, input().split()))\nvar_3 = [int(var_7) - var_1 for var_7 in input().split()]\nvar_5 = defaultdict(int)\nvar_5[0] = 1\nfor var_8 in var_3:\n for var_6, var_4 in list(var_5.items()):\n var_5[var_6 + var_8] += var_4\nprint((var_5[0] - 1))\n", "slow_time": 9178896384, "fast_time": 35602722, "speedup": 257.8145, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_22"} -{"pair_id": "python_5072", "problem_id": "p03292", "language": "python", "slow_code": "var_1, var_3, var_4 = list(map(int, input().split()))\nvar_2 = 9999\nvar_2 = min(\n var_2,\n abs(var_1 - var_3) + abs(var_3 - var_4),\n abs(var_1 - var_4) + abs(var_4 - var_3),\n)\nvar_2 = min(\n var_2,\n abs(var_3 - var_1) + abs(var_1 - var_4),\n abs(var_3 - var_4) + abs(var_4 - var_1),\n)\nvar_2 = min(\n var_2,\n abs(var_4 - var_1) + abs(var_1 - var_3),\n abs(var_4 - var_3) + abs(var_3 - var_1),\n)\nprint(var_2)\n", "fast_code": "var_1, var_3, var_4 = sorted(map(int, input().split()))\nvar_2 = var_4 - var_1\nprint(var_2)\n", "slow_time": 33306774, "fast_time": 10659692, "speedup": 3.1246, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_8"} -{"pair_id": "python_14611", "problem_id": "p01314", "language": "python", "slow_code": "if __name__ == \"__main__\":\n while True:\n var_4 = int(eval(input()))\n if var_4 == 0:\n break\n var_5 = [var_2 for var_2 in range(1, var_4 + 1)]\n var_1 = 0\n for var_2 in range(var_4):\n for var_3 in range(var_2 + 1, var_4):\n if sum(var_5[var_2:var_3]) > var_4:\n break\n if sum(var_5[var_2:var_3]) == var_4:\n var_1 += 1\n print(var_1)\n", "fast_code": "import math\n\nwhile 1:\n var_2 = int(input())\n if not var_2:\n break\n var_1 = 0\n for var_3 in range(1, int(math.sqrt(2 * var_2)) + 1):\n if 2 * var_2 % var_3 == 0:\n var_4 = 2 * var_2 / var_3\n if var_3 > 1 and (var_3 + var_4) % 2:\n var_1 += 1\n print(var_1)\n", "slow_time": 246187152, "fast_time": 26824701, "speedup": 9.1776, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_1"} -{"pair_id": "python_6719", "problem_id": "p00501", "language": "python", "slow_code": "var_7 = eval(input())\nvar_9 = input()\nvar_1 = 0\nfor var_2 in range(var_7):\n var_4 = False\n var_8 = input()\n for var_5 in range(len(var_8)):\n if var_4:\n break\n for var_3 in range(1, len(var_8)):\n if var_4:\n break\n for var_6 in range(len(var_9)):\n if (\n var_5 + var_6 * var_3 < len(var_8)\n and var_8[var_5 + var_6 * var_3] == var_9[var_6]\n ):\n if var_6 + 1 >= len(var_9):\n var_4 = True\n continue\n break\n if var_4 == True:\n var_1 += 1\nprint(var_1)\n", "fast_code": "var_8 = eval(input())\nvar_1 = input()\nvar_6 = len(var_1)\nvar_3 = 0\nfor var_9 in range(var_8):\n var_2 = input()\n var_7 = len(var_2)\n var_4 = 0\n for var_10 in range(var_7):\n for var_5 in range(var_7 - (var_10 + 1) * (var_6 - 1)):\n if var_2[var_5 : var_5 + (var_10 + 1) * var_6 : var_10 + 1] == var_1:\n var_3 += 1\n var_4 = 1\n break\n if var_4 == 1:\n break\nprint(var_3)\n", "slow_time": 95723413, "fast_time": 45397323, "speedup": 2.1086, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_5"} -{"pair_id": "python_6500", "problem_id": "p03332", "language": "python", "slow_code": "var_4 = 3 * 10**5 + 100\nvar_5 = 998244353\nvar_8 = [0] * var_4\nvar_11 = [0] * var_4\nvar_9 = [0] * var_4\nvar_8[0] = 1\nvar_8[1] = 1\nvar_9[0] = 1\nvar_9[1] = 1\nvar_11[1] = 1\nfor var_10 in range(2, var_4):\n var_8[var_10] = var_8[var_10 - 1] * var_10 % var_5\n var_11[var_10] = var_5 - var_11[var_5 % var_10] * (var_5 // var_10) % var_5\n var_9[var_10] = var_9[var_10 - 1] * var_11[var_10] % var_5\n\n\ndef func_1(var_13, var_14):\n if var_13 < var_14:\n return 0\n if var_13 < 0 or var_14 < 0:\n return 0\n return var_8[var_13] * (var_9[var_14] * var_9[var_13 - var_14] % var_5) % var_5\n\n\nvar_6, var_1, var_2, var_3 = list(map(int, input().split()))\nvar_7 = 0\nfor var_10 in range(var_6 + 1):\n if (var_3 - var_1 * var_10) % var_2 == 0:\n var_12 = (var_3 - var_1 * var_10) // var_2\n var_7 += func_1(var_6, var_10) * func_1(var_6, var_12)\n var_7 %= var_5\nprint(var_7)\n", "fast_code": "var_11, var_1, var_3, var_9 = list(map(int, input().split()))\nvar_10 = 998244353\nimport math\n\n\ndef func_4(var_19, var_20):\n return (var_19 * var_20) // math.gcd(var_19, var_20)\n\n\nvar_4 = math.gcd(var_1, var_3)\nif var_9 % var_4 != 0:\n print((0))\n exit()\nvar_9 //= var_4\nvar_1 //= var_4\nvar_3 //= var_4\n\n\ndef func_1(var_11, var_16, var_10):\n if var_16 < 0 or var_16 > var_11:\n return 0\n var_16 = min(var_16, var_11 - var_16)\n return var_5[var_11] * var_6[var_16] * var_6[var_11 - var_16] % var_10\n\n\nvar_5 = [1, 1]\nvar_6 = [1, 1]\nvar_8 = [0, 1]\nfor var_7 in range(2, var_11 + 1):\n var_5.append((var_5[-1] * var_7) % var_10)\n var_8.append((-var_8[var_10 % var_7] * (var_10 // var_7)) % var_10)\n var_6.append((var_6[-1] * var_8[-1]) % var_10)\n\n\ndef func_2(var_12, var_13):\n var_17 = 1\n var_17 *= func_1(var_11, var_12, var_10)\n var_17 %= var_10\n var_17 *= func_1(var_11, var_13, var_10)\n var_17 %= var_10\n return var_17\n\n\ndef func_3(var_12, var_13):\n var_17 = 0\n if var_12 < var_13:\n var_12, var_13 = var_13, var_12\n for var_14 in range(min(var_13, var_11) + 1):\n\n var_18 = 1\n if (\n 0 <= var_14 <= var_11\n and 0 <= var_12 - var_14 <= var_11\n and 0 <= var_13 - var_14 <= var_11\n ):\n var_18 *= var_5[var_11]\n var_18 %= var_10\n var_18 *= var_6[var_14]\n var_18 %= var_10\n var_18 *= var_6[var_12 - var_14]\n var_18 %= var_10\n var_18 *= var_6[var_13 - var_14]\n var_18 %= var_10\n var_18 *= var_6[var_11 + var_14 - var_12 - var_13]\n var_18 %= var_10\n var_17 += var_18\n return var_17\n\n\nvar_15 = []\nfor var_7 in range(1 + var_9 // var_1):\n if (var_9 - var_1 * var_7) % var_3 == 0:\n var_15.append([var_7, (var_9 - var_1 * var_7) // var_3])\n break\nvar_12 = var_15[0][0]\nvar_13 = var_15[0][1]\nwhile var_13 - var_1 >= 0:\n var_12 += var_3\n var_13 -= var_1\n var_15.append([var_12, var_13])\nvar_2 = 0\nfor var_12, var_13 in var_15:\n if var_12 > var_11 or var_13 > var_11:\n continue\n var_2 += func_2(var_12, var_13)\n var_2 %= var_10\nprint(var_2)\n", "slow_time": 57115360349, "fast_time": 7371203344, "speedup": 7.7484, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_10"} -{"pair_id": "python_7996", "problem_id": "p02708", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_4 = 0\nvar_5 = 0\nfor var_6 in range(1, var_2 + 1):\n var_4 += var_6 * var_2 - var_6 * (var_6 - 1) + 1\n var_4 %= 10**9 + 7\nfor var_6 in range(1, var_1):\n var_5 += var_6 * var_2 - var_6 * (var_6 - 1) + 1\n var_5 %= 10**9 + 7\nvar_3 = var_4 - var_5 + 1\nvar_3 %= 10**9 + 7\nprint(var_3)\n", "fast_code": "var_2 = 10**9 + 7\nvar_3, var_1 = list(map(int, input().split()))\nvar_5 = 0\nfor var_4 in range(var_1, var_3 + 2):\n var_5 = (var_5 + var_3 * var_4 - var_4 * var_4 + var_4 + 1) % var_2\nprint(var_5)\n", "slow_time": 7054133779, "fast_time": 1517680994, "speedup": 4.648, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_9"} -{"pair_id": "python_18329", "problem_id": "p03209", "language": "python", "slow_code": "import sys\n\nvar_7 = sys.stdin\nsys.setrecursionlimit(10**5)\n\n\ndef func_4():\n return list(map(int, var_7.readline().split()))\n\n\ndef func_5():\n return [int(var_9) - 1 for var_9 in var_7.readline().split()]\n\n\ndef func_3():\n return list(map(float, var_7.readline().split()))\n\n\ndef func_6():\n return var_7.readline().split()\n\n\ndef func_9():\n return var_7.readline().rstrip()\n\n\ndef func_2():\n return list(func_9())\n\n\ndef func_8():\n return int(var_7.readline())\n\n\ndef func_7():\n return float(var_7.readline())\n\n\nvar_6, var_9 = func_4()\nvar_8 = [4 * pow(2, var_2) - 3 for var_2 in range(var_6 + 1)]\nvar_5 = [pow(2, var_2 + 1) - 1 for var_2 in range(var_6 + 1)]\nvar_1 = [1 for _ in range(var_6 + 1)]\n\n\ndef func_1(var_4: int, var_3: int):\n if var_4 == 0 and var_3 == 1:\n return 1\n if var_3 == 4 * pow(2, var_4) - 3:\n return pow(2, var_4 + 1) - 1\n elif pow(2, var_4 + 1) - 1 < var_3 < 4 * pow(2, var_4) - 3:\n return pow(2, var_4) + func_1(var_4 - 1, var_3 - (pow(2, var_4 + 1) - 1))\n elif var_3 == pow(2, var_4 + 1) - 1:\n return pow(2, var_4)\n elif 1 < var_3 < pow(2, var_4 + 1) - 1:\n return func_1(var_4 - 1, var_3 - 1)\n elif var_3 == 1:\n return 0\n\n\nprint((func_1(var_6, var_9)))\n", "fast_code": "def func_1(var_1, var_7):\n if var_1 == 0:\n return 0 if var_7 <= 0 else 1\n if var_7 <= var_5[var_1 - 1] + 1:\n return func_1(var_1 - 1, var_7 - 1)\n else:\n return func_1(var_1 - 1, var_7 - var_5[var_1 - 1] - 2) + 1 + var_6[var_1 - 1]\n\n\nvar_2, var_3 = list(map(int, input().split()))\nvar_5 = [2 ** (var_4 + 2) - 3 for var_4 in range(51)]\nvar_6 = [2 ** (var_4 + 1) - 1 for var_4 in range(51)]\nprint((func_1(var_2, var_3)))\n", "slow_time": 97166564, "fast_time": 39296206, "speedup": 2.4727, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_26"} -{"pair_id": "python_14896", "problem_id": "p03212", "language": "python", "slow_code": "import itertools\n\nvar_4 = int(eval(input()))\nvar_1 = 0\nfor var_2 in range(len(str(var_4)) + 1):\n for var_3 in list(itertools.product((3, 5, 7), repeat=var_2)):\n if (3 in var_3) and (5 in var_3) and (7 in var_3):\n if var_4 >= int((\"\".join(list(map(str, var_3))))):\n var_1 += 1\nprint(var_1)\n", "fast_code": "var_1 = int(eval(input()))\n\n\ndef func_1(var_3, var_5, var_2):\n if var_3 > var_1:\n return\n if var_5 == 0b111:\n var_2.append(1)\n func_1(var_3 * 10 + 7, var_5 | 0b001, var_2)\n func_1(var_3 * 10 + 5, var_5 | 0b010, var_2)\n func_1(var_3 * 10 + 3, var_5 | 0b100, var_2)\n\n\nvar_4 = []\nfunc_1(0, 0, var_4)\nprint((sum(var_4)))\n", "slow_time": 6466466009, "fast_time": 859755472, "speedup": 7.5213, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_28"} -{"pair_id": "python_1576", "problem_id": "p02990", "language": "python", "slow_code": "var_2 = 10**6\nvar_1 = 10**9 + 7\nvar_5, var_6, var_8 = [0] * var_2, [0] * var_2, [0] * var_2\n\n\ndef func_2():\n var_5[0], var_5[1] = 1, 1\n var_6[0], var_6[1] = 1, 1\n var_8[1] = 1\n for var_7 in range(2, var_2):\n var_5[var_7] = var_5[var_7 - 1] * var_7 % var_1\n var_8[var_7] = var_1 - var_8[var_1 % var_7] * (var_1 // var_7) % var_1\n var_6[var_7] = var_6[var_7 - 1] * var_8[var_7] % var_1\n\n\ndef func_1(var_10, var_9):\n if var_10 < var_9:\n return 0\n if var_10 < 0 or var_9 < 0:\n return 0\n return var_5[var_10] * (var_6[var_9] * var_6[var_10 - var_9] % var_1) % var_1\n\n\nvar_10, var_9 = list(map(int, input().split()))\nvar_11 = var_10 - var_9\nfunc_2()\nfor var_7 in range(1, var_9 + 1):\n var_3 = 0\n var_4 = func_1(var_9 + var_7 - 1 - var_7, var_7 - 1)\n if var_7 == 1:\n if var_11 == 0:\n var_13 = 1\n else:\n var_13 = 0\n else:\n var_13 = func_1(var_11 + var_7 - 2 - (var_7 - 1), var_7 - 2)\n var_12 = func_1(var_11 + var_7 - 1 - var_7, var_7 - 1) if var_11 >= var_7 else 0\n var_14 = func_1(var_11 + var_7 - (var_7 + 1), var_7) if var_11 >= var_7 + 1 else 0\n var_3 += var_4 * var_13\n var_3 += var_4 * var_12 * 2\n var_3 += var_4 * var_14\n var_3 %= var_1\n print(var_3)\n", "fast_code": "import sys\n\n\nfrom functools import reduce\nimport operator as op\n\n\ndef func_2(var_5, var_6):\n var_6 = min(var_6, var_5 - var_6)\n var_7 = reduce(op.mul, list(range(var_5, var_5 - var_6, -1)), 1)\n var_3 = reduce(op.mul, list(range(var_6, 0, -1)), 1)\n return var_7 // var_3\n\n\nvar_4 = 10**9 + 7\n\n\ndef func_1():\n var_5, var_2 = [int(var_8) for var_8 in sys.stdin.readline().split()]\n for var_1 in range(1, var_2 + 1):\n if var_1 <= var_5 - var_2 + 1:\n print(\n (\n func_2(var_5 - var_2 + 1, var_1)\n * func_2(var_2 - 1, var_1 - 1)\n % var_4\n )\n )\n else:\n print((0))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 163370548699, "fast_time": 50391842, "speedup": 3242.0039, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_28"} -{"pair_id": "python_12509", "problem_id": "p03674", "language": "python", "slow_code": "class Class_1:\n def __init__(self, var_2, var_13=10**9 + 7):\n var_5 = [1, 1]\n var_6 = [1, 1]\n var_8 = [0, 1]\n for var_7 in range(2, var_2):\n var_5.append(var_5[var_7 - 1] * var_7 % var_13)\n var_8.append(var_13 - var_8[var_13 % var_7] * (var_13 // var_7) % var_13)\n var_6.append(var_6[var_7 - 1] * var_8[var_7] % var_13)\n self.fac, self.finv, self.mod = var_5, var_6, var_13\n\n def func_1(self, var_14, var_9):\n if var_14 < var_9 or var_14 < 0 or var_9 < 0:\n return 0\n var_5, var_6, var_13 = self.fac, self.finv, self.mod\n return var_5[var_14] * (var_6[var_9] * var_6[var_14 - var_9] % var_13) % var_13\n\n\nvar_13 = 10**9 + 7\nvar_3, *var_1 = list(map(int, open(0).read().split()))\nvar_12 = Class_1(210000, mod=var_13)\nvar_16 = {}\nvar_10, var_15 = 0, 0\nfor var_7, var_4 in enumerate(var_1):\n if var_4 in var_16:\n var_15 = var_7\n var_10 = var_16[var_4]\n break\n var_16[var_4] = var_7\nvar_11 = var_10 + var_3 - var_15\nfor var_9 in range(1, var_3 + 2):\n print(((var_12.nCk(var_3 + 1, var_9) - var_12.nCk(var_11, var_9 - 1)) % var_13))\n", "fast_code": "from collections import Counter\n\n\nclass Class_1:\n var_3 = 1000000007\n var_2 = [1, 1]\n\n def __init__(self, var_15):\n if self.__isally(var_15):\n self.v = var_15.v % self.MOD\n else:\n self.v = var_15 % self.MOD\n\n @property\n def func_3(self):\n return Class_1(self.__minv(self.v))\n\n @classmethod\n def func_2(cls, var_15):\n for var_6 in range(len(cls.CACHE_FACTORIALS), int(var_15) + 1):\n cls.CACHE_FACTORIALS.append(cls.CACHE_FACTORIALS[-1] * var_6 % cls.MOD)\n return Class_1(cls.CACHE_FACTORIALS[int(var_15)])\n\n @classmethod\n def func_4(cls, var_11, var_12):\n if var_11 < var_12 or var_12 < 0:\n return 0\n return cls.factorial(var_11) // cls.factorial(var_11 - var_12)\n\n @classmethod\n def func_1(cls, var_11, var_12):\n if var_11 < var_12 or var_12 < 0:\n return 0\n return cls.perm(var_11, var_12) // cls.factorial(var_12)\n\n @classmethod\n def __isally(cls, var_15) -> bool:\n return isinstance(var_15, cls)\n\n @classmethod\n def __minv(cls, var_15) -> int:\n return pow(var_15, cls.MOD - 2, cls.MOD)\n\n @classmethod\n def __mpow(cls, var_15, var_16) -> int:\n return pow(var_15, var_16, cls.MOD)\n\n def __str__(self):\n return str(self.v)\n\n __repr__ = __str__\n\n def __int__(self):\n return self.v\n\n def __eq__(self, var_16):\n return self.v == var_16.v if self.__isally(var_16) else self.v == var_16\n\n def __add__(self, var_16):\n return (\n Class_1(self.v + var_16.v)\n if self.__isally(var_16)\n else Class_1(self.v + var_16)\n )\n\n __radd__ = __add__\n\n def __sub__(self, var_16):\n return (\n Class_1(self.v - var_16.v)\n if self.__isally(var_16)\n else Class_1(self.v - var_16)\n )\n\n def __rsub__(self, var_14):\n return (\n Class_1(var_14.v - self.v)\n if self.__isally(var_14)\n else Class_1(var_14 - self.v)\n )\n\n def __mul__(self, var_16):\n return (\n Class_1(self.v * var_16.v)\n if self.__isally(var_16)\n else Class_1(self.v * var_16)\n )\n\n __rmul__ = __mul__\n\n def __floordiv__(self, var_16):\n return (\n Class_1(self.v * self.__minv(var_16.v))\n if self.__isally(var_16)\n else Class_1(self.v * self.__minv(var_16))\n )\n\n def __rfloordiv__(self, var_14):\n return (\n Class_1(var_14.v * self.__minv(self.v))\n if self.__isally(var_14)\n else Class_1(var_14 * self.__minv(self.v))\n )\n\n def __pow__(self, var_16):\n return (\n Class_1(self.__mpow(self.v, var_16.v))\n if self.__isally(var_16)\n else Class_1(self.__mpow(self.v, var_16))\n )\n\n def __rpow__(self, var_14):\n return (\n Class_1(self.__mpow(var_14.v, self.v))\n if self.__isally(var_14)\n else Class_1(self.__mpow(var_14, self.v))\n )\n\n\nvar_4 = int(input())\nvar_1 = [int(var_13) for var_13 in input().split()]\nvar_15 = Counter(var_1).most_common(1)[0][0]\nvar_6 = var_1.index(var_15)\nvar_7 = var_1.index(var_15, var_6 + 1)\nvar_9 = var_6\nvar_10 = var_7 - var_6 - 1\nvar_11 = var_4 - var_7\nfor var_8 in range(1, var_4 + 2):\n var_5 = (\n Class_1.comb(var_9 + var_10 + var_11, var_8)\n + Class_1.comb(var_9 + var_10 + var_11, var_8 - 1) * 2\n - Class_1.comb(var_9 + var_11, var_8 - 1)\n + Class_1.comb(var_9 + var_10 + var_11, var_8 - 2)\n )\n print(var_5)\n", "slow_time": 20922270310, "fast_time": 149254404, "speedup": 140.1786, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_18"} -{"pair_id": "python_7048", "problem_id": "p02732", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10000000)\n\nvar_6 = ((1, 0), (0, 1))\n\n\ndef func_2(var_15=int):\n return list(map(var_15, input().rstrip().split()))\n\n\ndef func_3():\n (var_2,) = func_2()\n var_1 = list(func_2())\n from collections import Counter as ct\n\n var_4 = ct(var_1)\n var_14 = list(var_4.items())\n\n var_3 = 0\n for var_9 in list(var_4.values()):\n var_3 += (var_9 * (var_9 - 1)) // 2\n var_5 = [0] * var_2\n for var_8 in list(var_4.items()):\n var_16, var_17 = var_8\n var_5[var_16 - 1] = (\n var_3\n - ((var_17 * (var_17 - 1)) // 2)\n + (((var_17 - 2) * (var_17 - 1)) // 2)\n )\n for var_7 in var_1:\n print((var_5[var_7 - 1]))\n\n\n\"\"\"\"\"\"\n\"\"\"\"\"\"\nimport sys\nfrom io import StringIO\nimport unittest\n\n\nclass Class_1(unittest.TestCase):\n def func_1(self, input, var_11):\n var_13, var_12 = sys.stdout, sys.stdin\n sys.stdout, sys.stdin = StringIO(), StringIO(input)\n func_3()\n sys.stdout.seek(0)\n var_10 = sys.stdout.read()[:-1]\n sys.stdout, sys.stdin = var_13, var_12\n self.assertEqual(var_10, var_11)\n\n def func_4(self):\n input = \"\"\"\"\"\"\n var_11 = \"\"\"\"\"\"\n self.assertIO(input, var_11)\n\n def func_5(self):\n input = \"\"\"\"\"\"\n var_11 = \"\"\"\"\"\"\n self.assertIO(input, var_11)\n\n def func_6(self):\n input = \"\"\"\"\"\"\n var_11 = \"\"\"\"\"\"\n self.assertIO(input, var_11)\n\n def func_7(self):\n input = \"\"\"\"\"\"\n var_11 = \"\"\"\"\"\"\n self.assertIO(input, var_11)\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_3 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_4 = [0] * (var_3 + 1)\nfor var_2 in var_1:\n var_4[var_2] += 1\nvar_5 = 0\nfor var_2 in var_4:\n var_5 += var_2 * (var_2 - 1) // 2\nfor var_2 in var_1:\n print((var_5 + 1 - var_4[var_2]))\n", "slow_time": 147049361, "fast_time": 29002282, "speedup": 5.0703, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_13"} -{"pair_id": "python_16148", "problem_id": "p03317", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time\n\nsys.setrecursionlimit(10**7)\nvar_4 = 10**20\nvar_6 = 10**9 + 7\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_1():\n return int(eval(input()))\n\n\ndef func_3():\n return input().split()\n\n\ndef func_4():\n return eval(input())\n\n\ndef func_5():\n var_1, var_2 = func_2()\n var_5 = func_2()\n var_3 = 1\n _b = var_2\n while True:\n if var_1 <= _b:\n break\n else:\n _b += var_2 - 1\n var_3 += 1\n return var_3\n\n\nprint((func_5()))\n", "fast_code": "var_2, var_1 = [int(var_3) for var_3 in input().split()]\nprint(\n (\n (var_2 - var_1) // (var_1 - 1) + 1\n if (var_2 - var_1) % (var_1 - 1) == 0\n else (var_2 - var_1) // (var_1 - 1) + 2\n )\n)\n", "slow_time": 28243298, "fast_time": 10383258, "speedup": 2.7201, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_0"} -{"pair_id": "python_12914", "problem_id": "p03549", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_5 = 0.5**var_1\nvar_6 = 1 - var_5\nvar_3 = 0\nvar_7 = 0\nwhile True:\n var_4 = (\n (var_3 + 1) * (100 * (var_2 - var_1) + 1900 * var_1) * var_5 * (var_6**var_3)\n )\n if var_4 < 10 ** (-6):\n break\n var_7 += var_4\n var_3 += 1\nprint((int(var_7 + 1)))\n", "fast_code": "var_4, var_3 = list(map(int, input().split()))\nvar_2 = (var_4 - var_3) * 100\nvar_1 = (2**var_3) * (1900 * var_3 + var_2)\nprint(var_1)\n", "slow_time": 95463640, "fast_time": 14076626, "speedup": 6.7817, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_11"} -{"pair_id": "python_14025", "problem_id": "p00028", "language": "python", "slow_code": "var_1 = [0] * 100\nwhile 1:\n try:\n var_3 = int(eval(input()))\n var_1[var_3 - 1] += 1\n except:\n for var_2 in range(100):\n if var_1[var_2] == max(var_1):\n print((var_2 + 1))\n break\n", "fast_code": "import sys\nimport collections\n\nvar_3 = []\nfor var_4 in sys.stdin:\n var_3.append(int(var_4))\nvar_1 = collections.Counter(var_3).most_common()\nvar_5 = var_1[0][1]\nfor var_2, var_6 in var_1:\n if var_6 == var_5:\n print(var_2)\n", "slow_time": 117729361, "fast_time": 27719534, "speedup": 4.2472, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_7"} -{"pair_id": "python_15310", "problem_id": "p03775", "language": "python", "slow_code": "var_4 = int(eval(input()))\n\n\ndef func_1(var_1):\n return len(str(var_1))\n\n\nvar_3 = 11\nfor var_2 in range(1, 10**6 + 1):\n if var_4 % var_2 == 0:\n var_3 = min(var_3, max(func_1(var_2), func_1(var_4 // var_2)))\n\nprint(var_3)\n", "fast_code": "def func_1(var_2, var_3):\n var_5 = 0\n var_4 = max(var_2, var_3)\n while var_4 >= 10:\n var_4 = var_4 / 10\n var_5 += 1\n return var_5 + 1\n\n\nvar_1 = int(eval(input()))\nvar_6 = 15\nfor var_7 in range(1, 10**5 + 1):\n if var_1 % var_7 == 0:\n var_6 = min(var_6, func_1(var_7, var_1 / var_7))\nprint(var_6)\n", "slow_time": 51830258874, "fast_time": 5029686345, "speedup": 10.3049, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_15"} -{"pair_id": "python_2723", "problem_id": "p02630", "language": "python", "slow_code": "var_3 = lambda: [*list(map(int, input().split()))]\nvar_3()\nvar_7, *var_5 = [0] * 100002\nfor var_4 in var_3():\n var_7 += var_4\n var_5[var_4] += 1\nvar_6 = var_3()[0]\nfor _ in range(var_6):\n var_1, var_2 = var_3()\n var_7 += (var_2 - var_1) * var_5[var_1]\n var_5[var_2] += var_5[var_1]\n var_5[var_1] = 0\n print(var_7)\n", "fast_code": "from collections import Counter\n\nvar_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_7 = sum(var_1)\nvar_6 = Counter(var_1)\nvar_3 = int(eval(input()))\nfor _ in range(var_3):\n var_4, var_5 = list(map(int, input().split()))\n if var_4 in list(var_6.keys()):\n var_7 += (var_5 - var_4) * var_6[var_4]\n\n if var_5 in list(var_6.keys()):\n\n var_6[var_5] += var_6[var_4]\n del var_6[var_4]\n else:\n var_6[var_5] = var_6[var_4]\n del var_6[var_4]\n\n print(var_7)\n", "slow_time": 246048618, "fast_time": 55116440, "speedup": 4.4642, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_5"} -{"pair_id": "python_14606", "problem_id": "p00110", "language": "python", "slow_code": "import sys\n\nfor var_1 in sys.stdin:\n for var_2 in \"0123456789\"[\n (var_1[0] == \"X\") * (var_1[1] != \"+\")\n or (\"+X\" in var_1) * (\"+X=\" not in var_1) :\n ]:\n var_3, var_4 = var_1.replace(\"X\", var_2).split(\"=\")\n if eval(var_3) == int(var_4):\n print(var_2)\n break\n else:\n print(\"NA\")\n", "fast_code": "import sys\n\nvar_4, var_6 = \"+X\"\nfor var_1 in sys.stdin:\n for var_2 in \"0123456789\"[\n (var_1[0] == var_6) * (var_1[1] != var_4)\n or (var_4 + var_6 in var_1) * (\"+X=\" not in var_1) :\n ]:\n var_3, var_5 = var_1.replace(var_6, var_2).split(\"=\")\n if sum(map(int, var_3.split(var_4))) == int(var_5):\n print(var_2)\n break\n else:\n print(\"NA\")\n", "slow_time": 67937378, "fast_time": 33379670, "speedup": 2.0353, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_3"} -{"pair_id": "python_11618", "problem_id": "p02621", "language": "python", "slow_code": "import sys\n\n\ndef func_5():\n return sys.stdin.readline().strip()\n\n\ndef func_1():\n return int(eval(func_5()))\n\n\ndef func_3():\n return list(map(int, func_5().split()))\n\n\ndef func_2():\n return list(map(int, func_5().split()))\n\n\ndef func_4(var_3):\n return list(zip(*(func_3() for _ in range(var_3))))\n\n\ndef func_6():\n sys.setrecursionlimit(10**8)\n var_1 = float(\"inf\")\n var_2 = func_1()\n print((var_2 + var_2**2 + var_2**3))\n return\n\n\nif __name__ == \"__main__\":\n func_6()\n", "fast_code": "import sys\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\nvar_1 = func_1()\nprint((var_1 + var_1**2 + var_1**3))\n", "slow_time": 53894386, "fast_time": 12500293, "speedup": 4.3114, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_6"} -{"pair_id": "python_229", "problem_id": "p03240", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_6 = [list(map(int, input().split())) for var_10 in range(var_4)]\nvar_6.sort(key=lambda var_11: var_11[2], reverse=1)\nfor var_1 in range(101):\n for var_2 in range(101):\n var_3 = var_6[0][2] + abs(var_6[0][0] - var_1) + abs(var_6[0][1] - var_2)\n var_8 = 0\n for var_5, var_7, var_9 in var_6:\n if var_9 == max(var_3 - abs(var_5 - var_1) - abs(var_7 - var_2), 0):\n var_8 += 1\n if var_8 == var_4:\n print((var_1, var_2, var_3))\n break\n", "fast_code": "import numpy as np\n\nvar_5 = int(eval(input()))\nvar_10, var_11, var_6 = np.array(\n [list(map(int, input().split())) for var_7 in range(var_5)]\n).T\n\"\"\"\"\"\"\nvar_4 = 0\nvar_1 = 0\nvar_2 = 0\nvar_3 = True\nfor var_7 in range(101):\n for var_8 in range(101):\n var_3 = True\n for var_9 in range(var_5):\n if var_6[var_9] != 0:\n var_4 = (\n var_6[var_9]\n + abs(var_7 - var_10[var_9])\n + abs(var_8 - var_11[var_9])\n )\n break\n for var_9 in range(var_5):\n if var_6[var_9] != max(\n var_4 - abs(var_7 - var_10[var_9]) - abs(var_8 - var_11[var_9]), 0\n ):\n var_3 = False\n break\n if var_3:\n var_1, var_2 = var_7, var_8\n break\n if var_3:\n break\nprint((\"{} {} {}\".format(var_1, var_2, var_4)))\n", "slow_time": 9772291562, "fast_time": 2098234704, "speedup": 4.6574, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_6"} -{"pair_id": "python_3242", "problem_id": "p03040", "language": "python", "slow_code": "class Class_1:\n def __init__(self, var_18):\n self.size = var_18\n self.tree = [0] * (var_18 + 1)\n\n def func_3(self, var_9):\n var_22 = 0\n while var_9 > 0:\n var_22 += self.tree[var_9]\n var_9 -= var_9 & -var_9\n return var_22\n\n def func_1(self, var_9, var_25):\n while var_9 <= self.size:\n self.tree[var_9] += var_25\n var_9 += var_9 & -var_9\n\n\ndef func_2(var_16, var_17, var_8):\n\n var_11 = (var_17 + var_16) // 2\n while var_17 - var_16 > 1:\n if var_8(var_11):\n var_11, var_16 = (var_11 + var_17) // 2, var_11\n continue\n var_11, var_17 = (var_11 + var_16) // 2, var_11\n return var_11\n\n\nimport sys\n\nvar_12 = sys.stdin.readline\n(var_1,) = list(map(int, var_12().split()))\nvar_21 = []\nvar_6 = 0\nvar_13 = 0\nfor _ in range(var_1):\n var_19 = var_12().split()\n if len(var_19) == 1:\n var_6 += 1\n else:\n var_2, var_4 = int(var_19[1]), int(var_19[2])\n var_21.append((var_2, var_4, var_6, var_13))\n var_6 = 0\n var_13 += 1\nif var_6:\n var_21.append((var_2, var_4, var_6, var_13))\nvar_15 = var_13\nvar_20 = sorted(var_21, key=lambda var_25: var_25[0])\nvar_14 = dict()\nvar_10 = dict()\nfor var_9, (var_2, var_4, var_6, var_13) in enumerate(var_20):\n var_14[var_13] = var_9 + 1\n var_10[var_9 + 1] = var_2\nvar_15 = len(var_14)\nvar_23 = Class_1(var_15)\nvar_24 = Class_1(var_15)\nvar_3 = var_5 = 0\n\n\nfor var_2, var_4, var_6, var_9 in var_21:\n if var_6:\n var_13 = func_2(0, var_15 + 1, lambda var_25: var_23.sum(var_25) < var_7)\n\n for _ in range(var_6):\n if not var_9 % 2:\n print((var_10[var_13 + 1], -2 * var_24.sum(var_13 + 1) + var_3 + var_5))\n else:\n print(\n (\n var_10[var_13 + 1],\n -var_24.sum(var_13) + (var_3 - var_24.sum(var_13 + 1)) + var_5,\n )\n )\n var_3 += var_2\n var_5 += var_4\n var_23.add(var_14[var_9], 1)\n var_24.add(var_14[var_9], var_2)\n var_7 = -(-(var_9 + 1) // 2)\n", "fast_code": "from heapq import heappop, heappush\n\nvar_7 = int(eval(input()))\nvar_9 = [list(map(int, input().split())) for _ in range(var_7)]\nvar_5 = []\nvar_11 = []\nvar_2 = 0\nvar_8 = 0\nfor var_10 in var_9:\n if var_10[0] == 1:\n var_8 += 1\n _, var_1, var_4 = var_10\n var_2 += var_4\n if var_8 == 1:\n var_6 = var_1\n elif var_8 % 2 == 1:\n if var_1 < -var_5[0]:\n var_6 = -heappop(var_5)\n heappush(var_5, -var_1)\n elif var_11[0] < var_1:\n var_6 = heappop(var_11)\n heappush(var_11, var_1)\n else:\n var_6 = var_1\n var_2 += abs(var_1 - var_6)\n else:\n var_2 += abs(var_1 - var_6)\n heappush(var_5, -min(var_1, var_6))\n heappush(var_11, max(var_1, var_6))\n if var_10[0] == 2:\n if var_8 % 2 == 1:\n var_3 = var_6\n else:\n var_3 = -var_5[0]\n print((var_3, var_2))\n", "slow_time": 154293873, "fast_time": 73481889, "speedup": 2.0998, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_29"} -{"pair_id": "python_8839", "problem_id": "p03371", "language": "python", "slow_code": "var_1, var_2, var_3, var_4, var_5 = list(map(int, input().split()))\n\n\nvar_7 = var_1 * var_4 + var_2 * var_5\nfor var_6 in range(max(var_4, var_5) + 1):\n var_7 = min(\n var_7,\n 2 * var_6 * var_3\n + var_1 * max(0, var_4 - var_6)\n + var_2 * max(0, var_5 - var_6),\n )\nprint(var_7)\n", "fast_code": "import math\n\nvar_1, var_2, var_3, var_4, var_5 = list(map(int, input().split()))\nvar_6 = []\nvar_6.append(var_1 * var_4 + var_2 * var_5)\nfor var_7 in range(2 * min(var_4, var_5), 2 * max(var_4, var_5) + 1):\n var_6.append(\n var_3 * var_7\n + max(0, math.ceil(var_4 - var_7 / 2) * var_1)\n + max(0, math.ceil(var_5 - var_7 / 2) * var_2)\n )\nprint((min(var_6)))\n", "slow_time": 1090896531, "fast_time": 265456712, "speedup": 4.1095, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_18"} -{"pair_id": "python_6724", "problem_id": "p00775", "language": "python", "slow_code": "while True:\n var_2, var_1 = list(map(int, input().split()))\n if not (var_2 | var_1):\n break\n var_5 = 20\n var_3 = [0] * (var_5 * 2)\n for _ in range(var_1):\n var_11, var_12, var_6 = list(map(int, input().split()))\n for var_7 in range(var_11 + var_5, var_12 + var_5):\n var_3[var_7] = max(var_3[var_7], var_6)\n var_8, var_10 = 0, 20\n for _ in range(100):\n var_9 = (var_8 + var_10) / 2\n var_4 = True\n for var_7 in range(-var_2 + var_5, var_2 + var_5):\n if var_7 < var_5:\n var_13 = pow(\n var_2 * var_2 - (var_7 - var_5 + 1) * (var_7 - var_5 + 1), 0.5\n )\n var_4 &= var_3[var_7] >= var_13 - var_2 + var_9\n else:\n var_13 = pow(var_2 * var_2 - (var_7 - var_5) * (var_7 - var_5), 0.5)\n var_4 &= var_3[var_7] >= var_13 - var_2 + var_9\n if var_4:\n var_8 = var_9\n else:\n var_10 = var_9\n print((\"{:.20f}\".format(var_8)))\n", "fast_code": "while True:\n var_2, var_1 = list(map(int, input().split()))\n if not (var_2 | var_1):\n break\n var_4 = 20\n var_3 = [0] * (var_4 * 2)\n for _ in range(var_1):\n var_7, var_8, var_5 = list(map(int, input().split()))\n for var_6 in range(var_7 + var_4, var_8 + var_4):\n var_3[var_6] = max(var_3[var_6], var_5)\n print(\n (\n min(\n var_3[var_6]\n - pow(var_2**2 - (var_6 - var_4 + (var_6 < var_4)) ** 2, 0.5)\n + var_2\n for var_6 in range(-var_2 + var_4, var_2 + var_4)\n )\n )\n )\n", "slow_time": 536358030, "fast_time": 65538301, "speedup": 8.1839, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_4"} -{"pair_id": "python_4405", "problem_id": "p03282", "language": "python", "slow_code": "import sys\n\nvar_1 = float(\"inf\")\n\n\ndef func_3(var_3: str, var_2: int):\n for var_5 in range(var_2):\n if var_3[var_5] != \"1\":\n var_4 = var_3[var_5]\n break\n else:\n print((1))\n return\n print(var_4)\n return\n\n\ndef func_2():\n def func_1():\n for var_6 in sys.stdin:\n for var_8 in var_6.split():\n yield var_8\n\n var_7 = func_1()\n var_3 = str(next(var_7))\n var_2 = int(next(var_7))\n func_3(var_3, var_2)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "print((input()[: int(eval(input()))].replace(\"1\", \"\")[:1] or \"1\"))\n", "slow_time": 45292501, "fast_time": 12382838, "speedup": 3.6577, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_12"} -{"pair_id": "python_8561", "problem_id": "p02959", "language": "python", "slow_code": "var_3 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_4 = 0\nfor var_5 in range(var_3):\n if var_5 % 2 == 0:\n if var_1[var_5 // 2] >= var_2[var_5 // 2]:\n var_1[var_5 // 2] -= var_2[var_5 // 2]\n var_4 += var_2[var_5 // 2]\n var_2[var_5 // 2] = 0\n else:\n var_2[var_5 // 2] -= var_1[var_5 // 2]\n var_4 += var_1[var_5 // 2]\n var_1[var_5 // 2] = 0\n if var_1[var_5 // 2 + 1] >= var_2[var_5 // 2]:\n var_1[var_5 // 2 + 1] -= var_2[var_5 // 2]\n var_4 += var_2[var_5 // 2]\n var_2[var_5 // 2] = 0\n else:\n var_2[var_5 // 2] -= var_1[var_5 // 2 + 1]\n var_4 += var_1[var_5 // 2 + 1]\n var_1[var_5 // 2 + 1] = 0\n else:\n if var_1[var_3 - var_5 // 2] >= var_2[var_3 - var_5 // 2 - 1]:\n var_1[var_3 - var_5 // 2] -= var_2[var_3 - var_5 // 2 - 1]\n var_4 += var_2[var_3 - var_5 // 2 - 1]\n var_2[var_3 - var_5 // 2 - 1] = 0\n else:\n var_2[var_3 - var_5 // 2 - 1] -= var_1[var_3 - var_5 // 2]\n var_4 += var_1[var_3 - var_5 // 2]\n var_1[var_3 - var_5 // 2] = 0\n if var_1[var_3 - var_5 // 2 - 1] >= var_2[var_3 - var_5 // 2 - 1]:\n var_1[var_3 - var_5 // 2 - 1] -= var_2[var_3 - var_5 // 2 - 1]\n var_4 += var_2[var_3 - var_5 // 2 - 1]\n var_2[var_3 - var_5 // 2 - 1] = 0\n else:\n var_2[var_3 - var_5 // 2 - 1] -= var_1[var_3 - var_5 // 2 - 1]\n var_4 += var_1[var_3 - var_5 // 2 - 1]\n var_1[var_3 - var_5 // 2 - 1] = 0\nprint(var_4)\n", "fast_code": "var_1 = lambda: list(map(int, input().split()))\neval(input())\nvar_2 = list(var_1())\nvar_3 = var_8 = 0\nfor var_4, var_5, var_6 in zip(var_1(), var_2, var_2[1:]):\n var_7 = min(var_5 - var_8, var_4)\n var_8 = min(var_6, var_4 - var_7)\n var_3 += var_7 + var_8\nprint(var_3)\n", "slow_time": 99337511, "fast_time": 29707189, "speedup": 3.3439, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_20"} -{"pair_id": "python_773", "problem_id": "p02642", "language": "python", "slow_code": "var_3 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = 10**6 + 5\nvar_5 = [0 for _ in range(var_2)]\nfor var_6 in var_1:\n if var_5[var_6] != 0:\n var_5[var_6] = 2\n continue\n var_7 = var_6\n while var_7 < var_2:\n var_5[var_7] += 1\n var_7 += var_6\nvar_4 = 0\nfor var_6 in var_1:\n if var_5[var_6] == 1:\n var_4 += 1\nprint(var_4)\n", "fast_code": "var_9 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_1.sort()\nvar_8 = var_1[-1] + 1\nvar_3 = [0] * (var_8)\nvar_1.sort()\nvar_2 = 0\nfor var_4 in var_1:\n var_3[var_4] += 1\nvar_1 = set(var_1)\nfor var_5 in var_1:\n for var_6 in range(var_5 * 2, (var_8), var_5):\n var_3[var_6] += 1\nfor var_7 in var_1:\n if var_3[var_7] == 1:\n var_2 += 1\nprint(var_2)\n", "slow_time": 71347573135, "fast_time": 42221493, "speedup": 1689.8401, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_21"} -{"pair_id": "python_13273", "problem_id": "p03035", "language": "python", "slow_code": "import sys, math, collections, heapq, itertools\n\nvar_3 = sys.stdin\n\n\ndef func_3():\n return var_3.readline().strip(\"\\n\")\n\n\ndef func_2():\n return var_3.readline().strip(\"\\n\").split()\n\n\ndef func_1(var_4, var_5):\n var_4, var_5 = max(var_4, var_5), min(var_4, var_5)\n while var_4 % var_5 > 0:\n var_4, var_5 = var_5, var_4 % var_5\n return var_5\n\n\ndef func_4():\n var_1, var_2 = list(map(int, func_2()))\n if var_1 >= 13:\n print(var_2)\n elif var_1 >= 6:\n print((var_2 // 2))\n else:\n print((0))\n return 0\n\n\nif __name__ == \"__main__\":\n func_4()\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nprint((0 if var_1 <= 5 else var_2 if var_1 >= 13 else var_2 // 2))\n", "slow_time": 48276073, "fast_time": 12838937, "speedup": 3.7601, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_13"} -{"pair_id": "python_9693", "problem_id": "p02554", "language": "python", "slow_code": "var_3 = int(eval(input()))\nvar_2 = 1000000007\nvar_1 = 10**var_3 - 9**var_3 - 9**var_3 + 8**var_3\nprint((var_1 % var_2))\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = 10**9 + 7\n\n\ndef func_1(var_3, var_9, var_10):\n var_6 = str(format(var_9, \"b\"))\n var_11 = 1\n for var_8 in range(len(var_6)):\n var_11 = (var_11 * var_11) % var_10\n if var_6[var_8] == \"1\":\n var_11 = (var_11 * var_3) % var_10\n return var_11\n\n\nvar_3 = func_1(10, var_2, var_1)\nvar_5 = func_1(9, var_2, var_1)\nvar_7 = func_1(8, var_2, var_1)\nvar_4 = var_3 - 2 * var_5 + var_7\nprint((var_4 % var_1))\n", "slow_time": 5752328587, "fast_time": 42408281, "speedup": 135.6416, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_0"} -{"pair_id": "python_11336", "problem_id": "p03504", "language": "python", "slow_code": "var_3, var_1 = list(map(int, input().split()))\nvar_12 = [list(map(int, input().split())) for var_8 in range(var_3)]\nvar_2 = 10**5\nvar_5 = [[] for var_8 in range(var_2 + 2)]\nvar_6 = [set() for var_8 in range(var_2 + 2)]\nfor var_11, var_13, var_7 in var_12:\n var_5[var_11].append((var_13, var_7))\n var_6[var_11].add(var_7)\nvar_10 = [0] * (var_2 + 2)\nfor var_11 in range(var_2):\n for var_13, var_7 in var_5[var_11]:\n var_10[var_11 - 1] += 1\n if var_7 in var_6[var_13]:\n var_10[var_13 - 1] -= 1\n else:\n var_10[var_13] -= 1\nvar_4 = var_14 = 0\nfor var_9 in var_10:\n var_14 += var_9\n var_4 = max(var_4, var_14)\nprint(var_4)\n", "fast_code": "def func_1():\n return tuple(map(int, input().split()))\n\n\nvar_2, var_1 = func_1()\nvar_3 = sorted([func_1() for _ in range(var_2)])\nvar_4 = [[[-1, 0, -1]] for _ in range(30)]\nfor var_8, var_10, var_5 in var_3:\n var_6 = 0\n\n var_9 = [\n var_6\n for var_6 in range(30)\n if var_4[var_6][-1][2] == var_5 and var_4[var_6][-1][1] <= var_8\n ]\n if var_9:\n var_4[min(var_9)].append([var_8, var_10, var_5])\n else:\n var_7 = [var_6 for var_6 in range(30) if var_4[var_6][-1][1] <= var_8 - 0.5]\n var_4[min(var_7)].append([var_8, var_10, var_5])\nfor var_6 in range(30):\n if len(var_4[var_6]) == 1:\n print(var_6)\n break\nelse:\n print((30))\n", "slow_time": 27841681689, "fast_time": 79922905, "speedup": 348.3567, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_17"} -{"pair_id": "python_16980", "problem_id": "p03291", "language": "python", "slow_code": "import sys\n\n\ndef func_9():\n return sys.stdin.readline().strip()\n\n\ndef func_10(var_5, var_6, var_7):\n return [[var_7] * var_6 for var_11 in range(var_5)]\n\n\ndef func_11(var_5, var_6, var_7, var_8):\n return [[[var_8] * var_7 for var_12 in range(var_6)] for var_11 in range(var_5)]\n\n\ndef func_12(var_5, var_6, var_7, var_8, var_10):\n return [\n [[[var_10] * var_8 for var_12 in range(var_7)] for var_12 in range(var_6)]\n for var_11 in range(var_5)\n ]\n\n\ndef func_8(var_14, var_15=1):\n return int(-(-var_14 // var_15))\n\n\ndef func_1():\n return int(func_9())\n\n\ndef func_3():\n return map(int, func_9().split())\n\n\ndef func_2(var_3=None):\n return list(func_3()) if var_3 is None else [func_1() for var_11 in range(var_3)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_1 = 10**18\nvar_2 = 10**9 + 7\nvar_4 = func_9()\nvar_3 = len(var_4)\n\nvar_9 = func_10(var_3 + 1, 4, 0)\nvar_9[0][0] = 1\nfor var_11 in range(var_3):\n var_13 = var_4[var_11]\n for var_12 in range(4):\n\n if var_13 == \"?\":\n\n var_9[var_11 + 1][var_12] += var_9[var_11][var_12] * 3\n var_9[var_11 + 1][var_12] %= var_2\n else:\n var_9[var_11 + 1][var_12] += var_9[var_11][var_12]\n var_9[var_11 + 1][var_12] %= var_2\n\n if var_12 < 3:\n\n if (\n var_13 == \"?\"\n or var_13 == \"A\"\n and var_12 == 0\n or var_13 == \"B\"\n and var_12 == 1\n or var_13 == \"C\"\n and var_12 == 2\n ):\n var_9[var_11 + 1][var_12 + 1] += var_9[var_11][var_12]\n var_9[var_11 + 1][var_12 + 1] %= var_2\n\nprint(var_9[var_3][3])\n", "fast_code": "var_3 = input().rstrip()\nvar_1 = [0] * 4\nvar_1[0] = 1\nfor var_2 in range(len(var_3)):\n if var_3[var_2] == \"A\":\n var_1[1] += var_1[0]\n elif var_3[var_2] == \"B\":\n var_1[2] += var_1[1]\n elif var_3[var_2] == \"C\":\n var_1[3] += var_1[2]\n else:\n var_1 = [\n var_1[0] * 3,\n var_1[1] * 3 + var_1[0],\n var_1[2] * 3 + var_1[1],\n var_1[3] * 3 + var_1[2],\n ]\n var_1 = list([var_4 % (10**9 + 7) for var_4 in var_1])\nprint((var_1[3]))\n", "slow_time": 176285150, "fast_time": 52275918, "speedup": 3.3722, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_22"} -{"pair_id": "python_6313", "problem_id": "p03719", "language": "python", "slow_code": "import functools\nimport os\nimport sys\n\nsys.setrecursionlimit(10000)\nvar_1 = float(\"inf\")\n\n\ndef func_9():\n return int(eval(input()))\n\n\ndef func_10():\n return float(eval(input()))\n\n\ndef func_13():\n return eval(input())\n\n\ndef func_3():\n return list(map(int, input().split()))\n\n\ndef func_4():\n return list(map(float, input().split()))\n\n\ndef func_7():\n return input().split()\n\n\ndef func_12(var_6):\n return [func_9() for _ in range(var_6)]\n\n\ndef func_11(var_6):\n return [func_10() for _ in range(var_6)]\n\n\ndef func_14(var_6):\n return [func_13() for _ in range(var_6)]\n\n\ndef func_6(var_6):\n return [func_3() for _ in range(var_6)]\n\n\ndef func_5(var_6):\n return [func_4() for _ in range(var_6)]\n\n\ndef func_8(var_6):\n return [func_7() for _ in range(var_6)]\n\n\ndef func_2(var_5):\n print((\"Yes\" if var_5 else \"No\"))\n\n\ndef func_1(var_5):\n print((\"YES\" if var_5 else \"NO\"))\n\n\ndef func_15(var_5):\n print((\"yes\" if var_5 else \"no\"))\n\n\nvar_2, var_3, var_4 = func_3()\nfunc_2(var_2 <= var_4 <= var_3)\n", "fast_code": "var_1, var_2, var_3 = list(map(int, input().split()))\nprint((\"Yes\" if var_1 <= var_3 <= var_2 else \"No\"))\n", "slow_time": 117754251, "fast_time": 12278902, "speedup": 9.59, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_15"} -{"pair_id": "python_6113", "problem_id": "p02619", "language": "python", "slow_code": "import numpy as np\n\nvar_1 = int(eval(input()))\nvar_2 = [int(var_4) for var_4 in input().split()]\nvar_6 = []\nfor var_3 in range(var_1):\n var_6.append([int(var_4) for var_4 in input().split()])\nvar_7 = []\nfor var_3 in range(var_1):\n var_7.append(int(eval(input())) - 1)\nvar_8 = [0] * var_1\nvar_5 = [[0 for var_4 in range(26)] for var_3 in range(var_1)]\nfor var_3 in range(var_1):\n if var_3 >= 1:\n var_5[var_3] = var_5[var_3 - 1][:]\n var_5[var_3][var_7[var_3]] = var_3 + 1\nfor var_3 in range(var_1):\n var_8[var_3] = var_6[var_3][var_7[var_3]] - sum(\n [var_2[var_4] * (var_3 + 1 - var_5[var_3][var_4]) for var_4 in range(26)]\n )\nvar_9 = 0\nfor var_3 in range(var_1):\n var_9 += var_8[var_3]\n print(var_9)\n", "fast_code": "(\n var_2,\n *var_5,\n) = list(map(int, open(var_3 := 0).read().split()))\nvar_1, *var_4 = [0] * 27\nfor var_6 in var_5[-var_2:]:\n var_3 += 1\n var_4[var_6 - 1] = var_3\n print(\n (\n var_1 := var_1\n + var_5[var_3 * 26 + var_6 - 1]\n - sum(var_7 * (var_3 - var_8) for var_7, var_8 in zip(var_5, var_4))\n )\n )\n", "slow_time": 109161456, "fast_time": 54119008, "speedup": 2.0171, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_8"} -{"pair_id": "python_5175", "problem_id": "p03734", "language": "python", "slow_code": "var_1, var_2 = list(map(int, input().split()))\nvar_14 = []\nfor var_8 in range(var_1):\n var_12, var_11 = list(map(int, input().split()))\n var_14.append((var_12, var_11))\n\nvar_13 = var_14[0][0]\nvar_6 = [[[-1] * (330) for var_8 in range(110)] for var_10 in range(110)]\nvar_6[0][0][0] = 0\nfor var_8 in range(var_1):\n var_12, var_11 = var_14[var_8]\n var_7 = var_12 - var_13\n for var_9 in range(var_8 + 1):\n for var_10 in range(310):\n\n if var_6[var_8][var_9][var_9] == -1:\n continue\n var_6[var_8 + 1][var_9][var_10] = max(\n var_6[var_8 + 1][var_9][var_10], var_6[var_8][var_9][var_10]\n )\n var_6[var_8 + 1][var_9 + 1][var_10 + var_7] = max(\n var_6[var_8][var_9][var_10] + var_11,\n var_6[var_8 + 1][var_9 + 1][var_10 + var_7],\n )\nvar_5 = var_6[var_1]\nvar_4 = 0\nfor var_9 in range(var_1 + 1):\n if var_2 - var_9 * var_13 >= 0:\n var_3 = max(var_5[var_9][: var_2 - var_9 * var_13 + 1])\n var_4 = max(var_4, var_3)\nprint(var_4)\n", "fast_code": "var_3, var_4 = list(map(int, input().split()))\nvar_1 = [list(map(int, input().split())) for _ in range(var_3)]\nvar_17 = var_1[0][0]\nvar_2 = {0: [], 1: [], 2: [], 3: []}\nfor var_9 in range(var_3):\n var_16, var_14 = var_1[var_9]\n var_2[var_16 - var_17].append(var_14)\nvar_2[0] = sorted(var_2[0], reverse=True)\nvar_2[1] = sorted(var_2[1], reverse=True)\nvar_2[2] = sorted(var_2[2], reverse=True)\nvar_2[3] = sorted(var_2[3], reverse=True)\nvar_10 = len(var_2[0])\nvar_11 = len(var_2[1])\nvar_12 = len(var_2[2])\nvar_13 = len(var_2[3])\nvar_15 = 0\nfor var_5 in range(var_10 + 1):\n for var_6 in range(var_11 + 1):\n for var_7 in range(var_12 + 1):\n for var_8 in range(var_13 + 1):\n if (\n var_5 * var_17\n + var_6 * (var_17 + 1)\n + var_7 * (var_17 + 2)\n + var_8 * (var_17 + 3)\n <= var_4\n ):\n var_14 = (\n sum(var_2[0][:var_5])\n + sum(var_2[1][:var_6])\n + sum(var_2[2][:var_7])\n + sum(var_2[3][:var_8])\n )\n var_15 = max(var_15, var_14)\nprint(var_15)\n", "slow_time": 7051948785, "fast_time": 98323112, "speedup": 71.7222, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_3"} -{"pair_id": "python_10307", "problem_id": "p03006", "language": "python", "slow_code": "import sys\nfrom collections import deque\nfrom collections import defaultdict\nfrom heapq import heapify, heappush, heappop, heappushpop\nfrom bisect import bisect_left, bisect_right\n\nvar_16 = lambda var_15: [int(var_2) for var_2 in var_15.split(\" \")]\nvar_18 = lambda var_17: [int(var_15) for var_15 in var_17]\nvar_19 = lambda var_17: [var_16(var_15) for var_15 in var_17]\nvar_9 = lambda: sys.stdin.readline().rstrip()\nvar_7 = lambda: int(var_9())\nvar_8 = lambda: var_16(var_9())\nvar_12 = lambda var_14: [sys.stdin.readline().rstrip() for _ in range(var_14)]\nvar_10 = lambda var_14: var_18(var_12(var_14))\nvar_11 = lambda var_14: var_19(var_12(var_14))\n\n\ndef func_1():\n var_1 = var_7()\n var_20 = var_11(var_1)\n if var_1 == 1:\n print((1))\n return\n var_3 = defaultdict(lambda: 0)\n for var_6 in range(var_1):\n for var_13 in range(var_1):\n if var_6 == var_13:\n continue\n var_4 = var_20[var_6][0] - var_20[var_13][0]\n var_5 = var_20[var_6][1] - var_20[var_13][1]\n if var_4 == 0 and var_5 == 0:\n continue\n var_3[(var_4, var_5)] += 1\n var_14 = var_1 - max(var_3.values())\n print(var_14)\n\n\nfunc_1()\n", "fast_code": "from collections import defaultdict as de\n\nvar_1 = de(int)\nvar_5 = int(eval(input()))\nvar_2 = sorted([list(map(int, input().split())) for var_3 in range(var_5)])\nfor var_3 in range(var_5):\n for var_4 in range(var_3):\n var_1[\n (var_2[var_3][0] - var_2[var_4][0], var_2[var_3][1] - var_2[var_4][1])\n ] += 1\nprint((var_5 - max(list(var_1.values()), default=0)))\n", "slow_time": 108329123, "fast_time": 41213514, "speedup": 2.6285, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_7"} -{"pair_id": "python_3805", "problem_id": "p03564", "language": "python", "slow_code": "from copy import deepcopy\nimport math\nimport string\nimport collections\nfrom collections import Counter\nfrom collections import deque\nfrom decimal import Decimal\nimport sys\nimport fractions\nfrom operator import itemgetter\nimport itertools\nimport copy\n\n\ndef func_5():\n return list(map(int, input().split()))\n\n\ndef func_4(var_9, var_10):\n return math.factorial(var_9) // (\n math.factorial(var_9 - var_10) * math.factorial(var_10)\n )\n\n\ndef func_3(var_12):\n var_11 = []\n for var_7 in var_12:\n if not (var_7 in var_11):\n var_11.append(var_7)\n return len(var_12) != len(var_11)\n\n\ndef func_1(var_9):\n func_1 = []\n for var_6 in range(1, var_9 + 1):\n if var_9 % var_6 == 0:\n func_1.append(var_6)\n return func_1\n\n\ndef func_2(var_1, var_3):\n while var_3 != 0:\n var_1, var_3 = var_3, var_1 % var_3\n return var_1\n\n\nvar_4 = [-1, -1, -1, 0, 0, 1, 1, 1]\nvar_5 = [-1, 0, 1, -1, 1, -1, 0, 1]\nvar_9 = int(eval(input()))\nvar_8 = int(eval(input()))\nvar_2 = 1\nfor var_6 in range(var_9):\n var_2 = min(var_2 * 2, var_2 + var_8)\nprint(var_2)\n", "fast_code": "var_3, var_2, var_1 = int(eval(input())), int(eval(input())), 1\nfor _ in range(var_3):\n var_1 += min(var_1, var_2)\nprint(var_1)\n", "slow_time": 90173136, "fast_time": 19808969, "speedup": 4.5521, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_13"} -{"pair_id": "python_2644", "problem_id": "p02660", "language": "python", "slow_code": "import math\n\n\ndef func_1(var_8):\n if var_8 <= 1:\n return []\n var_12 = [2]\n if var_8 > 2:\n var_7 = int(math.sqrt(var_8))\n var_9 = [var_4 for var_4 in range(3, var_8 + 1, 2)]\n while var_7 >= var_9[0]:\n var_12.append(var_9[0])\n var_9 = [var_5 for var_5 in var_9 if var_5 % var_9[0] != 0]\n var_12 += var_9\n return var_12\n\n\nfrom collections import defaultdict\n\n\ndef func_2(var_8):\n if var_8 <= 1:\n return {}\n else:\n\n var_12 = func_1(int(math.sqrt(var_8)))\n var_3 = defaultdict(int)\n for var_10 in var_12:\n while var_8 % var_10 == 0:\n var_3[var_10] += 1\n var_8 //= var_10\n if var_8 != 1:\n var_3[var_8] += 1\n var_3 = dict(var_3)\n return var_3\n\n\nvar_8 = int(eval(input()))\nvar_11 = func_2(var_8)\nvar_1 = []\nfor var_6, var_13 in list(var_11.items()):\n for var_4 in range(1, var_13 + 1):\n var_1.append(var_6**var_4)\nvar_1.sort()\nvar_2 = 0\nfor var_14 in var_1:\n if var_8 % var_14 == 0:\n var_2 += 1\n var_8 //= var_14\nprint(var_2)\n", "fast_code": "var_9 = int(eval(input()))\nif var_9 == 1:\n print((0))\n exit()\n\n\ndef func_1(var_9):\n var_11 = int(var_9**0.5)\n var_7 = [True] * (var_11 + 1)\n var_7[0] = False\n var_7[1] = False\n for var_6 in range(2, var_11 + 1):\n if not var_7[var_6]:\n continue\n for var_8 in range(var_6 * 2, var_11 + 1, var_6):\n var_7[var_8] = False\n return [var_6 for var_6 in range(var_11 + 1) if var_7[var_6]]\n\n\nvar_10 = func_1(var_9)\nvar_5 = []\nfor var_6 in var_10:\n if var_9 % var_6 == 0:\n var_5.append(var_6)\nvar_5.sort()\nif var_5 == []:\n print((1))\n exit()\nvar_1 = 0\nfor var_6 in var_5:\n if var_6 == 1:\n continue\n var_2 = 0\n while var_9 % var_6 == 0:\n var_9 = var_9 // var_6\n var_2 += 1\n var_4 = 0\n for var_3 in range(1, 1000):\n if var_2 >= var_4 + var_3:\n var_1 += 1\n var_4 += var_3\n else:\n break\nif not var_9 == 1:\n var_1 += 1\nprint(var_1)\n", "slow_time": 45492289947, "fast_time": 6141635002, "speedup": 7.4072, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_5"} -{"pair_id": "python_6332", "problem_id": "p03719", "language": "python", "slow_code": "import functools\nimport os\nimport sys\n\nsys.setrecursionlimit(10000)\nvar_1 = float(\"inf\")\n\n\ndef func_8():\n return int(input())\n\n\ndef func_9():\n return float(input())\n\n\ndef func_12():\n return input()\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_3():\n return list(map(float, input().split()))\n\n\ndef func_6():\n return input().split()\n\n\ndef func_11(var_9):\n return [func_8() for _ in range(var_9)]\n\n\ndef func_10(var_9):\n return [func_9() for _ in range(var_9)]\n\n\ndef func_13(var_9):\n return [func_12() for _ in range(var_9)]\n\n\ndef func_5(var_9):\n return [func_2() for _ in range(var_9)]\n\n\ndef func_4(var_9):\n return [func_3() for _ in range(var_9)]\n\n\ndef func_7(var_9):\n return [func_6() for _ in range(var_9)]\n\n\ndef func_1(var_6):\n if not os.getenv(\"LOCAL\"):\n return var_6\n\n @functools.wraps(var_6)\n def func_14(*var_3, **var_8):\n var_10 = var_6(*var_3, **var_8)\n print(\n \"DEBUG: {}({}) -> \".format(\n var_6.__name__,\n \", \".join(\n list(map(str, var_3))\n + [\n \"{}={}\".format(var_7, str(var_11))\n for var_7, var_11 in var_8.items()\n ]\n ),\n ),\n end=\"\",\n )\n print(var_10)\n return var_10\n\n return func_14\n\n\nvar_2, var_4, var_5 = func_2()\nprint(\"Yes\" if var_2 <= var_5 <= var_4 else \"No\")\n", "fast_code": "var_1, var_2, var_3 = [int(var_4) for var_4 in input().strip().split(\" \")]\nif not var_3 < var_1 and not var_3 > var_2:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 130412764, "fast_time": 16922919, "speedup": 7.7063, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_0"} -{"pair_id": "python_5447", "problem_id": "p03288", "language": "python", "slow_code": "import bisect, collections, copy, heapq, itertools, math, string\nimport sys\n\n\ndef func_5():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(sys.stdin.readline().rstrip().split())\n\n\nvar_1 = func_1()\nif var_1 < 1200:\n print(\"ABC\")\nelif var_1 < 2800:\n print(\"ARC\")\nelse:\n print(\"AGC\")\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = \"ARC\"\nif var_2 < 1200:\n var_1 = \"ABC\"\nelif 2800 <= var_2:\n var_1 = \"AGC\"\nprint(var_1)\n", "slow_time": 47184560, "fast_time": 15059657, "speedup": 3.1332, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_10"} -{"pair_id": "python_4811", "problem_id": "p04015", "language": "python", "slow_code": "var_6, var_1 = list(map(int, input().split()))\nvar_5 = list(map(int, input().split()))\nvar_3 = [0] * 5300\nvar_3[var_5[0] - var_1] = 1\nfor var_7 in var_5[1:]:\n var_2 = var_7 - var_1\n if var_2 >= 0:\n for var_4 in range(2500, -2501, -1):\n var_3[var_4 + var_2] += var_3[var_4]\n else:\n for var_4 in range(-2500, 2501):\n var_3[var_4 + var_2] += var_3[var_4]\n var_3[var_2] += 1\nprint((var_3[0]))\n", "fast_code": "def func_1():\n var_2, var_1 = list(map(int, input().split()))\n var_8 = list(map(int, input().split()))\n var_8.insert(0, 0)\n var_4 = [\n [[0] * (var_2 * var_1 + 1) for _ in range(var_2 + 1)] for _ in range(var_2 + 1)\n ]\n for var_5 in range(var_2 + 1):\n var_4[var_5][0][0] = 1\n for var_5 in range(1, var_2 + 1):\n for var_6 in range(1, var_5 + 1):\n for var_7 in range(1, var_2 * var_1 + 1):\n var_4[var_5][var_6][var_7] = var_4[var_5 - 1][var_6][var_7]\n if var_7 >= var_8[var_5]:\n var_4[var_5][var_6][var_7] += var_4[var_5 - 1][var_6 - 1][\n var_7 - var_8[var_5]\n ]\n var_3 = 0\n for var_6 in range(1, var_2 + 1):\n var_3 += var_4[var_2][var_6][var_1 * var_6]\n print(var_3)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 4544287551, "fast_time": 1004131447, "speedup": 4.5256, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_11"} -{"pair_id": "python_185", "problem_id": "p03805", "language": "python", "slow_code": "import itertools\n\nvar_10, var_9 = list(map(int, input().split()))\nvar_8 = [[0] * var_10 for var_6 in range(var_10)]\nfor var_6 in range(var_9):\n var_1, var_3 = list(map(int, input().split()))\n var_8[var_1 - 1][var_3 - 1] = 1\n var_8[var_3 - 1][var_1 - 1] = 1\nvar_5 = [int(var_6) + 1 for var_6 in range(var_10)]\nvar_2 = var_4 = 0\nfor var_6 in list(itertools.permutations(var_5, var_10)):\n var_4 = 1\n if var_6[0] != 1:\n continue\n for var_7 in range(var_10 - 1):\n var_4 *= var_8[var_6[var_7 + 1] - 1][var_6[var_7] - 1]\n var_2 += var_4\nprint(var_2)\n", "fast_code": "from collections import defaultdict\nfrom itertools import permutations\n\n\ndef func_1():\n var_2, var_1 = list(map(int, input().split()))\n var_6 = defaultdict(list)\n for _ in range(var_1):\n var_3, var_5 = list(map(int, input().split()))\n var_6[var_3].append(var_5)\n var_6[var_5].append(var_3)\n var_4 = 0\n for var_10 in permutations(list(range(2, var_2 + 1)), var_2 - 1):\n var_8 = True\n var_7 = 1\n for var_9 in var_10:\n if var_9 in var_6[var_7]:\n var_7 = var_9\n else:\n var_8 = False\n if var_8:\n var_4 += 1\n print(var_4)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 6143449708, "fast_time": 1015280859, "speedup": 6.051, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_23"} -{"pair_id": "python_14819", "problem_id": "p03575", "language": "python", "slow_code": "class Class_1:\n def __init__(self, var_11):\n self.n = var_11\n self.parents = [-1] * var_11\n\n def func_1(self, var_13):\n if self.parents[var_13] < 0:\n return var_13\n else:\n self.parents[var_13] = self.find(self.parents[var_13])\n return self.parents[var_13]\n\n def func_4(self, var_13, var_14):\n var_13 = self.find(var_13)\n var_14 = self.find(var_14)\n if var_13 == var_14:\n return\n if self.parents[var_13] > self.parents[var_14]:\n var_13, var_14 = var_14, var_13\n self.parents[var_13] += self.parents[var_14]\n self.parents[var_14] = var_13\n\n def func_2(self, var_13, var_14):\n return self.find(var_13) == self.find(var_14)\n\n def func_3(self, var_13):\n return -self.parents[self.find(var_13)]\n\n\nvar_2, var_1, *var_4 = list(map(int, open(0).read().split()))\nvar_8 = [(var_3 - 1, var_6 - 1) for var_3, var_6 in zip(*[iter(var_4)] * 2)]\nvar_5 = 0\nfor var_9 in range(var_1):\n var_7 = Class_1(var_2)\n for var_10 in range(var_1):\n if var_9 == var_10:\n continue\n var_7.union(*var_8[var_10])\n if len([-var_12 for var_12 in var_7.parents if var_12 < 0]) > 1:\n var_5 += 1\nprint(var_5)\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_4 = [list(map(int, input().split())) for var_5 in range(var_1)]\nvar_3 = 0\nfor var_7 in var_4:\n var_6 = list(range(var_2))\n for var_8 in var_4:\n if var_8 != var_7:\n var_6 = [\n (\n var_6[var_8[0] - 1]\n if var_6[var_5] == var_6[var_8[1] - 1]\n else var_6[var_5]\n )\n for var_5 in range(var_2)\n ]\n if len(set(var_6)) != 1:\n var_3 += 1\nprint(var_3)\n", "slow_time": 109620610, "fast_time": 43890459, "speedup": 2.4976, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_13"} -{"pair_id": "python_2019", "problem_id": "p02603", "language": "python", "slow_code": "import collections\n\nvar_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_4 = 0\nvar_1.insert(0, float(\"inf\"))\n\nvar_3 = [0] * var_2\nvar_7 = [0] * var_2\nfor var_4 in range(var_2 - 1):\n if (var_1[var_4] >= var_1[var_4 + 1]) and (var_1[var_4 + 2] >= var_1[var_4 + 1]):\n var_3[var_4] = 1\n if (var_1[var_4] <= var_1[var_4 + 1]) and (var_1[var_4 + 2] <= var_1[var_4 + 1]):\n var_7[var_4] = 1\nvar_5 = 0\nvar_6 = 1000\n\n\nvar_1 = var_1[1:]\n\nfor var_4 in range(var_2):\n if var_3[var_4] == 1:\n var_5 = var_5 + var_6 // var_1[var_4]\n var_6 = var_6 - (var_6 // var_1[var_4]) * var_1[var_4]\n if var_7[var_4] == 1:\n var_6 = var_6 + var_5 * var_1[var_4]\n var_5 = 0\n\n\nvar_6 = var_6 + var_5 * var_1[var_2 - 1]\nprint(var_6)\n", "fast_code": "from sys import stdin\n\nvar_5 = stdin.readline\nvar_2 = int(eval(var_5()))\nvar_1 = list(map(int, var_5().split()))\nvar_7 = 0\nvar_6 = 1000\nfor var_4 in range(var_2 - 1):\n if var_1[var_4 + 1] > var_1[var_4]:\n var_3 = var_6 // var_1[var_4]\n var_6 -= var_1[var_4] * var_3\n var_6 += var_3 * var_1[var_4 + 1]\nprint(var_6)\n", "slow_time": 64300487, "fast_time": 30255706, "speedup": 2.1252, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_14"} -{"pair_id": "python_7742", "problem_id": "p02707", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**6)\n\nvar_6 = lambda var_9: int(var_9) - 1\n\n\ndef func_1():\n return int(eval(input()))\n\n\ndef func_5():\n return list(map(int, input().split()))\n\n\ndef func_6():\n return list(map(var_6, input().split()))\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_3():\n return list(map(var_6, input().split()))\n\n\ndef func_4(var_8):\n return [func_2() for _ in range(var_8)]\n\n\nvar_2 = float(\"inf\")\n\n\ndef func_7():\n var_7 = func_1()\n var_1 = func_2()\n var_4 = [0] * var_7\n for var_5, var_3 in enumerate(var_1):\n var_4[var_3 - 1] += 1\n for var_3 in var_4:\n print(var_3)\n\n\nif __name__ == \"__main__\":\n func_7()\n", "fast_code": "var_4 = int(eval(input()))\nvar_2 = input().split()\nvar_1 = [0] * var_4\nfor var_3 in var_2:\n var_1[int(var_3) - 1] += 1\nprint((\"\\n\".join(list(map(str, var_1)))))\n", "slow_time": 73219551, "fast_time": 22628105, "speedup": 3.2358, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_19"} -{"pair_id": "python_5946", "problem_id": "p03566", "language": "python", "slow_code": "import sys\nimport numpy as np\n\n\ndef func_3(var_1: int, var_2: \"List[int]\", var_3: \"List[int]\"):\n var_9 = [0 for var_4 in range(var_1 + 1)]\n for var_4 in range(var_1):\n var_9[var_4 + 1] = var_9[var_4] + var_2[var_4] * 2\n var_5 = np.zeros((var_9[var_1] + 1,))\n for var_4 in range(1, var_1):\n var_5[var_9[var_4]] = min((var_3[var_4 - 1], var_3[var_4]))\n for var_4 in range(var_1):\n var_5[var_9[var_4] + 1 : var_9[var_4 + 1]] = var_3[var_4]\n var_7 = np.zeros((var_9[var_1] + 1,))\n for var_12 in range(1, 201):\n var_7[var_12 : var_9[var_1] + 1 - var_12] = np.min(\n [\n var_5[var_12 : var_9[var_1] + 1 - var_12],\n var_7[var_12 - 1 : var_9[var_1] - var_12] + 0.5,\n var_7[var_12 + 1 : var_9[var_1] + 2 - var_12] + 0.5,\n ],\n axis=0,\n )\n var_11 = 0\n for var_8 in range(var_9[var_1]):\n var_11 += (var_7[var_8] + var_7[var_8 + 1]) * 0.5 * 0.5\n print(var_11)\n return\n\n\ndef func_2():\n def func_1():\n for var_6 in sys.stdin:\n for var_13 in var_6.split():\n yield var_13\n\n var_10 = func_1()\n var_1 = int(next(var_10))\n var_8 = [int(next(var_10)) for _ in range(var_1)]\n var_12 = [int(next(var_10)) for _ in range(var_1)]\n func_3(var_1, var_8, var_12)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_1 = int(eval(input()))\nvar_11 = [0] + list(map(int, input().split()))\nvar_12 = [0] + list(map(int, input().split()))\nvar_6 = [0] * (var_1 + 1)\nvar_7 = [0] * (var_1 + 1)\nfor var_4 in range(1, var_1):\n var_10 = var_6[var_4 - 1]\n var_6[var_4] = min(var_10 + var_11[var_4], var_12[var_4], var_12[var_4 + 1])\nfor var_4 in range(var_1 - 1, 0, -1):\n var_10 = var_7[var_4 + 1]\n var_7[var_4] = min(var_10 + var_11[var_4 + 1], var_12[var_4], var_12[var_4 + 1])\nvar_9 = [min(var_13, var_14) for var_13, var_14 in zip(var_6, var_7)]\n\n\ndef func_1(var_5, var_8, var_11, var_12):\n var_13 = (var_12 - var_5) + (var_12 - var_8)\n if var_13 >= var_11:\n var_12 = (var_5 + var_8 + var_11) / 2\n var_13 = var_11\n\n var_3 = (var_5 + var_12) * (var_12 - var_5) / 2\n var_3 += var_12 * (var_11 - var_13)\n var_3 += (var_8 + var_12) * (var_12 - var_8) / 2\n return var_3\n\n\nvar_2 = 0\nfor var_4 in range(1, var_1 + 1):\n var_2 += func_1(var_9[var_4 - 1], var_9[var_4], var_11[var_4], var_12[var_4])\nprint(var_2)\n", "slow_time": 687691747, "fast_time": 86801806, "speedup": 7.9226, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_19"} -{"pair_id": "python_16524", "problem_id": "p03274", "language": "python", "slow_code": "import sys\nimport math\nimport bisect\nimport queue\n\n\ndef func_1():\n return sys.stdin.readline().rstrip()\n\n\ndef func_2(var_3, var_1):\n var_2 = len(var_3)\n var_4 = [0 for _ in range(var_2)]\n for var_5 in range(1, var_2):\n var_4[var_5] = abs(var_3[var_5] - var_3[var_5 - 1]) + var_4[var_5 - 1]\n var_6 = bisect.bisect_left(var_3, 0)\n var_9 = 1000000005\n for var_5 in range(0, var_2):\n if var_3[var_5] >= 0:\n break\n var_8 = -var_3[var_5]\n var_7 = var_6 - var_5\n if (var_7 < var_1) and (var_6 + var_1 - var_7 - 1 < var_2):\n var_8 += var_4[var_6 + var_1 - var_7 - 1] - var_4[var_5]\n var_9 = min(var_9, var_8)\n return var_9\n\n\nif __name__ == \"__main__\":\n var_2, var_1 = list(map(int, func_1().split()))\n var_3 = list(map(int, func_1().split()))\n var_8 = 1000000005\n if min(var_3) >= 0:\n print((var_3[var_1 - 1]))\n elif max(var_3) <= 0:\n var_3 = var_3[::-1]\n print((-var_3[var_1 - 1]))\n else:\n var_8 = min(var_8, func_2(var_3, var_1))\n var_3 = [-var_10 for var_10 in var_3]\n var_8 = min(var_8, func_2(var_3[::-1], var_1))\n print(var_8)\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_6 = list(map(int, input().split()))\nassert len(var_6) == var_2\nvar_5 = min(\n var_4 - var_3 + min(abs(var_3), abs(var_4))\n for var_3, var_4 in zip(var_6, var_6[var_1 - 1 :])\n)\nprint(var_5)\n", "slow_time": 92211709, "fast_time": 27075235, "speedup": 3.4058, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_16"} -{"pair_id": "python_14875", "problem_id": "p02623", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**9)\n\n\ndef func_10(var_14):\n return int(var_14) - 1\n\n\ndef func_1():\n return int(eval(input()))\n\n\ndef func_7():\n return list(map(int, input().split()))\n\n\ndef func_8():\n return list(map(func_10, input().split()))\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_3():\n return list(map(func_10, input().split()))\n\n\ndef func_4(var_13):\n return [func_2() for _ in range(var_13)]\n\n\ndef func_9():\n return input().split()\n\n\ndef func_6():\n return list(eval(input()))\n\n\ndef func_5(var_13):\n return [func_6() for _ in range(var_13)]\n\n\ndef func_11(var_12, var_11=\" \"):\n print((var_11.join(list(map(str, var_12)))))\n\n\nvar_3 = float(\"inf\")\n\n\nfrom itertools import (\n combinations as comb,\n combinations_with_replacement as comb_w,\n accumulate,\n product,\n permutations,\n)\n\n\nfrom bisect import bisect_right, bisect_left\n\n\ndef func_12():\n var_6, var_5, var_4 = func_7()\n var_1 = func_2()\n var_2 = func_2()\n var_1 = [0] + list(accumulate(var_1))\n var_2 = [0] + list(accumulate(var_2))\n var_8 = 0\n for var_9, var_7 in enumerate(var_1):\n if var_7 > var_4:\n break\n var_10 = bisect_right(var_2, var_4 - var_7) - 1\n var_8 = max(var_8, var_9 + var_10)\n print(var_8)\n\n\nif __name__ == \"__main__\":\n func_12()\n", "fast_code": "import bisect\n\nvar_10, var_9, var_8 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_5 = list(map(int, input().split()))\n\nvar_1 = [0]\nfor var_6 in range(var_10):\n var_1.append(var_2[var_6] + var_1[var_6])\nvar_4 = [0]\nfor var_6 in range(var_9):\n var_4.append(var_5[var_6] + var_4[var_6])\nvar_3 = 0\nfor var_6 in range(var_10 + 1):\n var_11 = var_8 - var_1[var_6]\n if var_11 < 0:\n break\n\n var_7 = bisect.bisect_right(var_4, var_11)\n var_3 = max(var_3, var_6 + var_7 - 1)\nprint(var_3)\n", "slow_time": 100466791, "fast_time": 41896010, "speedup": 2.398, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_11"} -{"pair_id": "python_6338", "problem_id": "p03719", "language": "python", "slow_code": "import functools\nimport os\nimport sys\n\nsys.setrecursionlimit(10000)\nvar_1 = float(\"inf\")\n\n\ndef func_8():\n return int(input())\n\n\ndef func_9():\n return float(input())\n\n\ndef func_12():\n return input()\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_3():\n return list(map(float, input().split()))\n\n\ndef func_6():\n return input().split()\n\n\ndef func_11(var_9):\n return [func_8() for _ in range(var_9)]\n\n\ndef func_10(var_9):\n return [func_9() for _ in range(var_9)]\n\n\ndef func_13(var_9):\n return [func_12() for _ in range(var_9)]\n\n\ndef func_5(var_9):\n return [func_2() for _ in range(var_9)]\n\n\ndef func_4(var_9):\n return [func_3() for _ in range(var_9)]\n\n\ndef func_7(var_9):\n return [func_6() for _ in range(var_9)]\n\n\ndef func_1(var_6):\n if not os.getenv(\"LOCAL\"):\n return var_6\n\n @functools.wraps(var_6)\n def func_14(*var_3, **var_8):\n var_10 = var_6(*var_3, **var_8)\n print(\n \"DEBUG: {}({}) -> \".format(\n var_6.__name__,\n \", \".join(\n list(map(str, var_3))\n + [\n \"{}={}\".format(var_7, str(var_11))\n for var_7, var_11 in var_8.items()\n ]\n ),\n ),\n end=\"\",\n )\n print(var_10)\n return var_10\n\n return func_14\n\n\nvar_2, var_4, var_5 = func_2()\nprint(\"Yes\" if var_2 <= var_5 <= var_4 else \"No\")\n", "fast_code": "import sys\nfrom collections import Counter\n\nsys.setrecursionlimit(10**7)\nvar_4 = 1 << 100\n\n\ndef func_1():\n var_1, var_2, var_3 = list(map(int, input().split()))\n print((\"Yes\" if var_1 <= var_3 <= var_2 else \"No\"))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 130412764, "fast_time": 24029352, "speedup": 5.4272, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_2"} -{"pair_id": "python_14586", "problem_id": "p00687", "language": "python", "slow_code": "while 1:\n var_6, var_1, var_2 = list(map(int, input().split()))\n if var_6 == var_1 == var_2 == 0:\n break\n var_3 = 0\n var_4 = [1] + [0] * 2000000\n for var_5 in range(0, var_6 + 1):\n if var_4[var_5]:\n var_4[var_5 + var_1] = var_4[var_5 + var_2] = 1\n else:\n var_3 += 1\n print(var_3)\n", "fast_code": "while 1:\n var_5, var_1, var_2 = list(map(int, input().split()))\n if var_5 == 0:\n break\n var_3 = [0] * (var_5 + 1)\n if var_1 < var_5 + 1:\n var_3[var_1] = 1\n if var_2 < var_5 + 1:\n var_3[var_2] = 1\n for var_4 in range(var_5 + 1):\n if var_3[var_4]:\n if var_4 + var_1 < var_5 + 1:\n var_3[var_4 + var_1] = 1\n if var_4 + var_2 < var_5 + 1:\n var_3[var_4 + var_2] = 1\n print(var_5 - sum(var_3))\n", "slow_time": 6644536519, "fast_time": 47075082, "speedup": 141.1476, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_0"} -{"pair_id": "python_6225", "problem_id": "p03502", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nimport array\nimport inspect\n\nsys.setrecursionlimit(10000)\n\n\ndef func_1(*var_3):\n var_6 = {\n id(var_7): var_5\n for var_5, var_7 in list(inspect.currentframe().f_back.f_locals.items())\n }\n print(\n (\n \", \".join(\n var_6.get(id(var_2), \"???\") + \" = \" + repr(var_2) for var_2 in var_3\n )\n )\n )\n\n\ndef func_4(var_8):\n return bin(var_8)[2:]\n\n\ndef func_2():\n return [int(_) for _ in input().split()]\n\n\nvar_4 = None\n\n\ndef func_3():\n var_1 = int(eval(input()))\n if var_1 % sum(list(map(int, list(str(var_1))))) == 0:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nfunc_3()\n", "fast_code": "import sys\n\nvar_3 = sys.stdin.readline\nvar_1 = var_3()[:-1]\nvar_2 = sum(list(map(int, list(var_1))))\nif int(var_1) % var_2 == 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 66486570, "fast_time": 18428521, "speedup": 3.6078, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_10"} -{"pair_id": "python_6707", "problem_id": "p00070", "language": "python", "slow_code": "import sys\n\nvar_4 = 1024\nvar_5 = 331\nvar_6 = list(range(var_4))\nvar_1 = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]\nvar_2 = [0] * var_4\nvar_3 = [[0 for var_9 in range(var_5)] for var_11 in var_6]\n\n\ndef func_1():\n global C, D\n for var_9 in var_6:\n var_14 = format(var_9, \"b\")\n var_13 = var_14.count(\"1\")\n var_2[var_9] = var_13\n if var_13 == 1:\n var_3[var_9][var_1.index(var_9)] = 1\n else:\n for var_11 in range(len(var_14)):\n if var_14[-var_11 - 1] == \"1\":\n var_8 = var_13 * var_11\n var_10 = var_9 - var_1[var_11]\n for var_12 in range(var_5 - var_8):\n var_3[var_9][var_12 + var_8] += var_3[var_10][var_12]\n return\n\n\nfunc_1()\nfor var_7 in sys.stdin:\n var_13, var_14 = list(map(int, var_7.split()))\n var_15 = 0\n if var_14 < var_5:\n var_15 = sum(\n [var_3[var_9][var_14] for var_9 in var_6 if var_2[var_9] == var_13]\n )\n print(var_15)\n", "fast_code": "import sys\n\n\ndef func_1(var_1, var_10, var_11):\n if var_10 == 1:\n return var_11 in var_1\n var_1 = sorted(var_1)\n var_3 = 0\n var_4 = 0\n var_5 = 0\n var_9 = 1\n for var_6, var_7 in zip(var_1[:var_10][::-1], var_1[-var_10:]):\n var_3 += var_9 * var_6\n var_4 += var_9 * var_7\n var_9 += 1\n if var_3 <= var_11 <= var_4:\n for var_8 in range(len(var_1)):\n var_5 += func_1(\n var_1[:var_8] + var_1[var_8 + 1 :],\n var_10 - 1,\n var_11 - var_1[var_8] * var_10,\n )\n return var_5\n\n\nfor var_2 in sys.stdin:\n var_10, var_11 = list(map(int, var_2.split()))\n print(func_1(list(range(10)), var_10, var_11))\n", "slow_time": 56673214149, "fast_time": 71015953, "speedup": 798.035, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_0"} -{"pair_id": "python_10608", "problem_id": "p03330", "language": "python", "slow_code": "from collections import Counter, defaultdict, deque\nimport sys, heapq, bisect, math, itertools, string, queue\n\nsys.setrecursionlimit(10**8)\nvar_13 = 10**9 + 7\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_3():\n return list(sys.stdin.readline().split())\n\n\ndef func_4(var_14):\n return list(int(sys.stdin.readline()) for var_9 in range(var_14))\n\n\nvar_14, var_1 = func_2()\nvar_4 = []\nvar_3 = []\nfor var_9 in range(var_1):\n var_4.append(func_2())\nfor var_9 in range(var_14):\n var_3.append(func_2())\nvar_5 = defaultdict(int)\nvar_6 = defaultdict(int)\nvar_7 = defaultdict(int)\nvar_8 = [var_5, var_6, var_7]\nfor var_19 in range(var_14):\n for var_18 in range(var_14):\n var_16 = (var_18 + var_19 + 2) % 3\n var_8[var_16][var_3[var_18][var_19]] += 1\n\nvar_15 = [[] for var_9 in range(3)]\nfor var_9 in range(var_1):\n for var_10 in range(3):\n var_17 = 0\n for var_12 in list(var_8[var_10].keys()):\n var_17 += var_4[var_12 - 1][var_9] * var_8[var_10][var_12]\n var_15[var_10].append([var_9, var_17])\nfor var_9 in range(3):\n var_15[var_9].sort(key=lambda var_18: var_18[1])\n\nvar_2 = var_13\nfor var_9 in range(3):\n for var_10 in range(3):\n for var_11 in range(3):\n if (\n var_15[0][var_9][0] == var_15[1][var_10][0]\n or var_15[0][var_9][0] == var_15[2][var_11][0]\n or var_15[2][var_11][0] == var_15[1][var_10][0]\n ):\n continue\n var_2 = min(\n var_15[0][var_9][1] + var_15[1][var_10][1] + var_15[2][var_11][1], var_2\n )\nprint(var_2)\n", "fast_code": "from collections import defaultdict\n\nvar_3, var_1 = list(map(int, input().split()))\nvar_2 = [tuple(map(int, input().split())) for _ in range(var_1)]\nvar_6 = [defaultdict(int) for var_7 in range(3)]\nfor var_7 in range(var_3):\n var_5 = [int(var_10) for var_10 in input().split()]\n for var_8 in range(var_3):\n for var_9 in range(var_1):\n var_6[(var_7 + var_8) % 3][var_9] += var_2[var_5[var_8] - 1][var_9]\n\nvar_4 = 10**9\nfor var_7 in range(var_1):\n for var_8 in range(var_1):\n for var_9 in range(var_1):\n if var_7 != var_8 and var_8 != var_9 and var_9 != var_7:\n var_4 = min(var_4, var_6[0][var_7] + var_6[1][var_8] + var_6[2][var_9])\nprint(var_4)\n", "slow_time": 143567013, "fast_time": 69748702, "speedup": 2.0583, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_28"} -{"pair_id": "python_10376", "problem_id": "p02706", "language": "python", "slow_code": "var_2 = lambda var_7: int(var_7) - 1\n\n\ndef func_1():\n return int(eval(input()))\n\n\ndef func_4():\n return list(map(int, input().split()))\n\n\ndef func_5():\n return list(map(var_2, input().split()))\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_3(var_5):\n return [func_2() for _ in range(var_5)]\n\n\ndef func_6():\n var_4, var_3 = func_4()\n var_1 = func_2()\n var_6 = sum(var_1)\n if var_4 - var_6 >= 0:\n print((var_4 - var_6))\n else:\n print((-1))\n\n\nif __name__ == \"__main__\":\n func_6()\n", "fast_code": "import numpy as np\nimport math\n\nvar_4, var_3 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_2 = sum(var_1)\nif var_4 < var_2:\n print((-1))\nelse:\n print((var_4 - var_2))\n", "slow_time": 45502445, "fast_time": 17117419, "speedup": 2.6583, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_29"} -{"pair_id": "python_14038", "problem_id": "p00028", "language": "python", "slow_code": "var_1 = [0] * 100\nwhile 1:\n try:\n var_3 = int(eval(input()))\n var_1[var_3 - 1] += 1\n except:\n for var_2 in range(100):\n if var_1[var_2] == max(var_1):\n print((var_2 + 1))\n break\n", "fast_code": "var_2 = []\nwhile True:\n try:\n var_1 = input()\n var_2.append(int(var_1))\n except EOFError:\n break\nvar_7 = set(var_2)\nvar_3 = list(map(lambda var_1: var_2.count(var_1), var_7))\nvar_6 = max(var_3)\nvar_5 = list(list(var_7)[var_4] for var_4, var_8 in enumerate(var_3) if var_8 == var_6)\nprint(*var_5, sep=\"\\n\")\n", "slow_time": 117729361, "fast_time": 40593659, "speedup": 2.9002, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_10"} -{"pair_id": "python_11715", "problem_id": "p02536", "language": "python", "slow_code": "from networkx.utils import UnionFind\nimport sys\n\n\ndef func_1():\n return sys.stdin.readline().rstrip()\n\n\ndef func_2():\n var_5, var_4 = list(map(int, func_1().split()))\n var_6 = UnionFind()\n for var_3 in range(1, var_5 + 1):\n _ = var_6[var_3]\n for _ in range(var_4):\n var_1, var_2 = list(map(int, func_1().split()))\n var_6.union(var_1, var_2)\n print((len(list(var_6.to_sets())) - 1))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "class Class_1:\n def __init__(self, var_5):\n self.n = [-1] * var_5\n self.r = [0] * var_5\n self.co = var_5\n\n def func_1(self, var_7):\n if self.n[var_7] < 0:\n return var_7\n else:\n self.n[var_7] = self.find_root(self.n[var_7])\n return self.n[var_7]\n\n def func_5(self, var_7, var_8):\n var_7 = self.find_root(var_7)\n var_8 = self.find_root(var_8)\n if var_7 == var_8:\n return\n elif self.r[var_7] > self.r[var_8]:\n self.n[var_7] += self.n[var_8]\n self.n[var_8] = var_7\n else:\n self.n[var_8] += self.n[var_7]\n self.n[var_7] = var_8\n if self.r[var_7] == self.r[var_8]:\n self.r[var_8] += 1\n self.co -= 1\n\n def func_2(self, var_7, var_8):\n return self.find_root(var_7) == self.find_root(var_8)\n\n def func_4(self, var_7):\n return -self.n[self.find_root(var_7)]\n\n def func_3(self):\n return self.co\n\n\nimport sys\n\nvar_3 = lambda: sys.stdin.readline().rstrip()\nvar_5, var_4 = list(map(int, var_3().split()))\nvar_6 = Class_1(var_5)\nfor _ in range(var_4):\n var_1, var_2 = list(map(int, var_3().split()))\n var_6.unite(var_1 - 1, var_2 - 1)\nprint((var_6.set_count() - 1))\n", "slow_time": 18069444838, "fast_time": 97359340, "speedup": 185.5954, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_29"} -{"pair_id": "python_14624", "problem_id": "p00031", "language": "python", "slow_code": "while True:\n try:\n var_2 = eval(input())\n except:\n break\n var_1 = 1\n while var_2 > 0:\n if var_2 % 2 == 1:\n print(var_1, end=\" \")\n var_2 /= 2\n var_1 *= 2\n print()\n", "fast_code": "var_2 = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]\nimport sys\n\nfor var_5 in sys.stdin:\n var_1 = format(int(var_5), \"b\")[::-1]\n var_4 = 0\n for var_3 in var_1:\n if var_3 == \"1\":\n print(var_2[var_4], end=\" \")\n var_4 += 1\n print()\n", "slow_time": 449803141, "fast_time": 26746368, "speedup": 16.8174, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_1"} -{"pair_id": "python_3773", "problem_id": "p02993", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\n\nvar_1 = 10**10\nvar_3 = 10**9 + 7\n\n\ndef func_7():\n return sys.stdin.readline().strip()\n\n\ndef func_6(var_7, var_8):\n return var_8 if var_7 % var_8 == 0 else func_6(var_8, var_7 % var_8)\n\n\ndef func_8(var_7, var_8):\n return (var_7 * var_8) // func_6(var_7, var_8)\n\n\ndef func_1():\n return int(func_7())\n\n\ndef func_2():\n return [int(var_7) for var_7 in func_7().split()]\n\n\ndef func_5(var_4):\n return [int(func_7()) for _ in range(var_4)]\n\n\ndef func_3(var_4):\n return [[int(var_7) for var_7 in func_7().split()] for _ in range(var_4)]\n\n\ndef func_4(var_2):\n print(*var_2, sep=\"\\n\")\n\n\nvar_5 = func_7()\nfor var_6 in range(3):\n if var_5[var_6] == var_5[var_6 + 1]:\n print(\"Bad\")\n break\nelse:\n print(\"Good\")\n", "fast_code": "var_4 = list(str(eval(input())))\nvar_1 = True\nvar_3 = None\nfor var_2, var_5 in enumerate(var_4):\n if var_2 != 0:\n if var_3 == var_5:\n var_1 = False\n break\n var_3 = var_5\nif var_1:\n print(\"Good\")\nelse:\n print(\"Bad\")\n", "slow_time": 78426894, "fast_time": 23918976, "speedup": 3.2789, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_8"} -{"pair_id": "python_5322", "problem_id": "p03997", "language": "python", "slow_code": "from collections import deque\nfrom heapq import heapify, heappop, heappush, heappushpop\nfrom copy import copy, deepcopy\nfrom itertools import product, permutations, combinations, combinations_with_replacement\nfrom collections import defaultdict, Counter\nfrom bisect import bisect_left, bisect_right\n\n\nfrom functools import reduce\nfrom pprint import pprint\n\nvar_1 = float(\"inf\")\n\n\ndef func_13():\n return list(map(int, input().split()))\n\n\ndef func_14(var_13):\n return [list(func_13()) for _ in range(var_13)]\n\n\ndef func_11(var_7, var_6):\n return [var_16[var_6] for var_16 in var_7]\n\n\ndef func_18(var_7, var_6, var_15):\n var_7.sort(key=lambda var_18: var_18[var_6], reverse=var_15)\n return var_7\n\n\ndef func_15(var_7):\n var_2 = -1 * float(\"inf\")\n for var_9 in range(len(var_7)):\n var_12 = max(var_7[var_9])\n var_2 = max(var_2, var_12)\n return var_2\n\n\ndef func_16(var_7):\n var_12 = float(\"inf\")\n for var_9 in range(len(var_7)):\n var_2 = min(var_7[var_9])\n var_12 = min(var_12, var_2)\n return var_12\n\n\ndef func_12(var_11, var_18):\n\n var_10 = bisect_left(var_11, var_18)\n var_14 = bisect_right(var_11, var_18)\n return var_14 - var_10\n\n\ndef func_17(var_11, var_17=True):\n if var_17:\n if len(var_11) == 0:\n print(\" \")\n elif type(var_11[0]) == str:\n print((\" \".join(var_11)))\n elif type(var_11[0]) == int:\n print((\" \".join(map(str, var_11))))\n else:\n print(\"Output Error\")\n else:\n if len(var_11) == 0:\n print(\"\")\n elif type(var_11[0]) == str:\n print((\"\".join(var_11)))\n elif type(var_11[0]) == int:\n print((\"\".join(map(str, var_11))))\n else:\n print(\"Output Error\")\n\n\ndef func_3():\n return int(eval(input()))\n\n\ndef func_6():\n return list(map(int, input().split()))\n\n\ndef func_8():\n return list(map(int, input().split()))\n\n\ndef func_1(var_13):\n return [int(eval(input())) for _ in range(var_13)]\n\n\ndef func_4(var_13):\n return [list(map(int, input().split())) for _ in range(var_13)]\n\n\ndef func_10():\n return eval(input())\n\n\ndef func_7():\n return input().split()\n\n\ndef func_9():\n return list(input().split())\n\n\ndef func_2(var_13):\n return [eval(input()) for _ in range(var_13)]\n\n\ndef func_5(var_13):\n return [list(input().split()) for _ in range(var_13)]\n\n\nvar_3 = func_3()\nvar_5 = func_3()\nvar_8 = func_3()\nvar_4 = (var_3 + var_5) * var_8 // 2\nprint(var_4)\n", "fast_code": "var_1, var_2, var_3 = list(map(int, [eval(input()) for var_4 in [0] * 3]))\nprint((var_3 * (var_1 + var_2) // 2))\n", "slow_time": 222419806, "fast_time": 21539928, "speedup": 10.3259, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_12"} -{"pair_id": "python_8597", "problem_id": "p03338", "language": "python", "slow_code": "var_3 = int(eval(input()))\nvar_4 = input().strip()\nvar_8 = 0\nfor var_11 in range(1, var_3 - 1):\n var_5 = var_4[:var_11]\n var_6 = var_4[var_11:]\n var_1 = {}\n var_2 = {}\n for var_10 in range(var_11):\n var_7 = var_5[var_10]\n if var_7 not in var_1:\n var_1[var_7] = 0\n var_1[var_7] += 1\n for var_10 in range(var_3 - var_11):\n var_7 = var_6[var_10]\n if var_7 not in var_2:\n var_2[var_7] = 0\n var_2[var_7] += 1\n var_9 = 0\n for var_7 in var_1:\n if var_7 in var_2:\n var_9 += 1\n var_8 = max(var_8, var_9)\nprint(var_8)\n", "fast_code": "import sys\n\n\ndef func_2():\n return sys.stdin.readline().rstrip()\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\nvar_1 = func_1()\nfunc_2 = func_2()\nvar_2 = 0\nfor var_3 in range(var_1):\n var_2 = max(var_2, len(set(func_2[:var_3]) & set(func_2[var_3:])))\nprint(var_2)\n", "slow_time": 153745720, "fast_time": 38919019, "speedup": 3.9504, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_20"} -{"pair_id": "python_9981", "problem_id": "p03449", "language": "python", "slow_code": "import sys\n\n\ndef func_1(var_6: int, var_7: int):\n if var_7 == 1 and var_6 == (var_2 - 1):\n return var_1[var_7][var_6]\n elif var_7 > 1 or var_6 > var_2 - 1:\n return 0\n else:\n return (\n max(func_1(var_6 + 1, var_7), func_1(var_6, var_7 + 1))\n + var_1[var_7][var_6]\n )\n\n\ndef func_4(var_2: int, var_1: \"List[List[int]]\"):\n print((func_1(0, 0)))\n return\n\n\ndef func_3():\n def func_2():\n for var_3 in sys.stdin:\n for var_5 in var_3.split():\n yield var_5\n\n var_4 = func_2()\n global N, A\n var_2 = int(next(var_4))\n var_1 = [[int(next(var_4)) for _ in range(var_2)] for _ in range(2)]\n func_4(var_2, var_1)\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_3 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_4 = 0\nfor var_5 in range(var_3):\n var_4 = max(var_4, sum(var_1[: var_5 + 1]) + sum(var_2[var_5:]))\nprint(var_4)\n", "slow_time": 68600833, "fast_time": 28968100, "speedup": 2.3682, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_2"} -{"pair_id": "python_14617", "problem_id": "p01224", "language": "python", "slow_code": "from math import sqrt\n\nvar_3 = \"perfect number\"\nvar_2 = \"deficient number\"\nvar_1 = \"abundant number\"\nwhile True:\n var_6 = eval(input())\n if var_6 == 0:\n break\n if var_6 == 1:\n print(var_2)\n continue\n var_7 = 1\n var_8 = var_6\n for var_5 in range(2, int(sqrt(var_6)) + 1):\n var_4 = 0\n while var_8 % var_5 == 0:\n var_8 /= var_5\n var_4 += 1\n if var_4:\n var_7 *= (var_5 ** (var_4 + 1) - 1) / (var_5 - 1)\n if var_8 == 1:\n var_7 -= var_6\n break\n if var_8 != 1:\n var_7 *= (var_8**2 - 1) / (var_8 - 1)\n var_7 -= var_6\n print(var_3 if var_6 == var_7 else (var_2 if var_7 < var_6 else var_1))\n", "fast_code": "def func_1(var_7):\n var_6 = []\n var_5 = 2\n while var_5 * var_5 <= var_7:\n var_3 = 0\n if var_7 % var_5 == 0:\n while var_7 % var_5 == 0:\n var_7 /= var_5\n var_3 += 1\n if var_3 > 0:\n var_6.append([var_5, var_3])\n var_5 += 1\n if var_7 > 1:\n var_6.append([var_7, 1])\n var_1 = 1\n for var_2, var_8 in var_6:\n var_1 *= (var_2 ** (var_8 + 1) - 1) / (var_2 - 1)\n return var_1\n\n\nwhile 1:\n var_7 = eval(input())\n if var_7 == 0:\n break\n var_4 = func_1(var_7) - var_7\n if var_4 == var_7:\n print(\"perfect number\")\n elif var_4 < var_7:\n print(\"deficient number\")\n else:\n print(\"abundant number\")\n", "slow_time": 2240420789, "fast_time": 346515291, "speedup": 6.4656, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_0"} -{"pair_id": "python_18132", "problem_id": "p03476", "language": "python", "slow_code": "import math\n\n\ndef func_1(var_6):\n if var_6 == 1:\n return False\n for var_4 in range(2, int(math.sqrt(var_6)) + 1):\n if var_6 % var_4 == 0:\n return False\n return True\n\n\nvar_1 = int(eval(input()))\nvar_2 = [0] * (10**5 + 1)\nfor var_3 in range(1, 10**5 + 1):\n if var_3 % 2 == 0:\n var_2[var_3] = var_2[var_3 - 1]\n continue\n if func_1(var_3) and func_1((var_3 + 1) // 2):\n var_2[var_3] = var_2[var_3 - 1] + 1\n else:\n var_2[var_3] = var_2[var_3 - 1]\nfor _ in range(var_1):\n var_5, var_7 = list(map(int, input().split()))\n print((var_2[var_7] - var_2[var_5 - 1]))\n", "fast_code": "import math\nimport fractions\nimport bisect\nimport collections\nimport itertools\nimport heapq\nimport string\nimport sys\nimport copy\nfrom decimal import *\nfrom collections import deque\n\nsys.setrecursionlimit(10**7)\nvar_3 = 10**9 + 7\nvar_1 = float(\"inf\")\n\n\ndef func_5(var_6, var_7):\n return fractions.gcd(var_6, var_7)\n\n\ndef func_15(var_6, var_7):\n return (var_6 * var_7) // fractions.gcd(var_6, var_7)\n\n\ndef func_7():\n return int(sys.stdin.readline())\n\n\ndef func_6():\n return float(sys.stdin.readline())\n\n\ndef func_13():\n return sys.stdin.readline().split()\n\n\ndef func_11():\n return map(int, sys.stdin.readline().split())\n\n\ndef func_12():\n return map(lambda var_18: int(var_18) - 1, sys.stdin.readline().split())\n\n\ndef func_4():\n return map(float, sys.stdin.readline().split())\n\n\ndef func_8():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_10():\n return sorted(func_8())\n\n\ndef func_9():\n return sorted(func_8(), reverse=True)\n\n\ndef func_3():\n return list(map(float, sys.stdin.readline().split()))\n\n\ndef func_14(var_14, var_17=\"\"):\n return var_17.join(var_14)\n\n\ndef func_18(var_14, var_15):\n return itertools.permutations(var_14, var_15)\n\n\ndef func_19(var_15, var_16):\n return math.factorial(var_15) // math.factorial(var_15 - var_16)\n\n\ndef func_1(var_14, var_15):\n return itertools.combinations(var_14, var_15)\n\n\ndef func_2(var_15, var_16):\n return math.factorial(var_15) // (\n math.factorial(var_15 - var_16) * math.factorial(var_16)\n )\n\n\ndef func_21(var_6, var_7, var_8, var_9):\n return ((var_8 - var_6) ** 2 + (var_9 - var_7) ** 2) ** 0.5\n\n\ndef func_17(var_6, var_7):\n return (var_6 + var_7) % var_3\n\n\ndef func_16(var_14):\n print(*var_14, sep=\"\\n\")\n\n\ndef func_20(var_15):\n var_11 = [True] * (var_15 + 1)\n var_11[0] = False\n var_11[1] = False\n for var_10 in range(2, int(var_15**0.5) + 1):\n if not var_11[var_10]:\n continue\n for var_13 in range(var_10 * 2, var_15 + 1, var_10):\n var_11[var_13] = False\n return var_11\n\n\nvar_4 = func_7()\nvar_2 = []\nvar_5 = []\nfor var_10 in range(var_4):\n var_14, var_16 = func_11()\n var_2.append(var_14)\n var_5.append(var_16)\nvar_12 = func_20(10**5 + 1)\nvar_17 = [0 for _ in range(10**5 + 1)]\nfor var_10 in range(1, 10**5):\n var_17[var_10] = var_17[var_10 - 1]\n if var_10 % 2 == 1:\n if var_12[var_10] and var_12[(var_10 + 1) // 2]:\n var_17[var_10] = var_17[var_10 - 1] + 1\nfor var_10 in range(var_4):\n print(var_17[var_5[var_10]] - var_17[var_2[var_10] - 1])\n", "slow_time": 64142625764, "fast_time": 14837056604, "speedup": 4.3231, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_12"} -{"pair_id": "python_12950", "problem_id": "p03549", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_5 = 0.5**var_1\nvar_6 = 1 - var_5\nvar_3 = 0\nvar_7 = 0\nwhile True:\n var_4 = (\n (var_3 + 1) * (100 * (var_2 - var_1) + 1900 * var_1) * var_5 * (var_6**var_3)\n )\n if var_4 < 10 ** (-6):\n break\n var_7 += var_4\n var_3 += 1\nprint((int(var_7 + 1)))\n", "fast_code": "def func_1():\n var_2, var_1 = (int(var_3) for var_3 in input().split())\n var_5 = 1900 * var_1 + 100 * (var_2 - var_1)\n var_4 = 2**var_1\n print((var_5 * var_4))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 95463640, "fast_time": 22637323, "speedup": 4.2171, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_20"} -{"pair_id": "python_14858", "problem_id": "p02900", "language": "python", "slow_code": "def func_1(var_9, var_10):\n if var_9 < var_10:\n var_9, var_10 = var_10, var_9\n while var_10 > 0:\n var_9, var_10 = var_10, var_9 % var_10\n return var_9\n\n\nvar_3 = 10**6\nvar_4 = [1 for var_7 in range(var_3 + 1)]\nvar_4[0] = 0\nvar_4[1] = 0\nfor var_7 in range(2, int((var_3 + 1) ** 0.5) + 1):\n for var_8 in range(var_7 * var_7, var_3 + 1, var_7):\n var_4[var_8] = 0\nvar_5 = []\nfor var_7 in range(var_3):\n if var_4[var_7] == 1:\n var_5.append(var_7)\nvar_1, var_2 = list(map(int, input().split()))\nvar_9 = func_1(var_1, var_2)\nvar_6 = 1\nfor var_10 in var_5:\n if var_9 % var_10 == 0:\n var_6 += 1\n while var_9 % var_10 == 0:\n var_9 = var_9 // var_10\nif var_9 > 1:\n var_6 += 1\nprint(var_6)\n", "fast_code": "def func_1(var_7):\n var_5 = 1\n var_12 = set()\n while var_5 * var_5 <= var_7:\n if not var_7 % var_5:\n var_12.add(var_5)\n var_12.add(var_7 // var_5)\n var_5 += 1\n return var_12\n\n\ndef func_2(var_13, var_14):\n return var_13 if var_13 > var_14 else var_14\n\n\ndef func_3(var_10, var_11):\n global res\n var_9 = func_2(var_9, var_11)\n var_8 = []\n var_5 = var_10[0]\n for var_6 in var_10[1:]:\n if gcd(var_4[var_5], var_4[var_6]) == 1:\n var_8.append(var_6)\n if var_8:\n func_3(var_8, var_11 + 1)\n return var_9\n\n\nfrom math import gcd\n\nvar_1, var_2 = list(map(int, input().split()))\nvar_4 = func_1(var_1) & func_1(var_2)\nvar_4 = list(var_4)\nvar_4.sort()\nvar_3 = len(var_4)\nvar_9 = 0\nprint((func_3(list(range(var_3)), 1)))\n", "slow_time": 293177338513, "fast_time": 65542910, "speedup": 4473.0595, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_27"} -{"pair_id": "python_3753", "problem_id": "p02731", "language": "python", "slow_code": "import scipy.optimize\n\nvar_1 = int(eval(input()))\nvar_2 = lambda var_4: -1 * (var_4[0] * var_4[1] * (var_1 - var_4[0] - var_4[1]))\nvar_3 = scipy.optimize.minimize(\n var_2, (0.1, 0.2), bounds=((0, None), (0, None)), tol=1e-6\n)\nprint((-1 * var_3.fun))\n", "fast_code": "def func_1():\n var_1 = int(eval(input()))\n print((var_1**3 / 27))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 38579398487, "fast_time": 15798447, "speedup": 2441.9741, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_21"} -{"pair_id": "python_543", "problem_id": "p02793", "language": "python", "slow_code": "class Class_1:\n def __init__(self, var_4=10**3):\n var_9 = [True] * var_4\n var_9[0] = False\n var_9[1] = False\n var_17 = []\n for var_8 in range(var_4):\n if var_9[var_8]:\n var_17.append(var_8)\n for var_10 in range(2 * var_8, var_4, var_8):\n var_9[var_10] = False\n self.primes = var_17\n\n def func_3(self, var_20):\n var_19 = {}\n for var_14 in self.primes:\n while var_20 % var_14 == 0:\n if not var_14 in var_19:\n var_19[var_14] = 0\n var_19[var_14] += 1\n var_20 //= var_14\n if var_20 > 1:\n var_19[var_20] = 1\n return var_19\n\n\nvar_5 = 10**9 + 7\n\n\ndef func_2(var_13, var_18):\n var_19 = 1\n while var_18:\n if var_18 & 1:\n var_19 = (var_19 * var_13) % var_5\n var_13 = (var_13 * var_13) % var_5\n var_18 //= 2\n return var_19\n\n\ndef func_1(var_13):\n return func_2(var_13, var_5 - 2)\n\n\ndef func_4(var_11, var_7):\n var_15 = Class_1()\n var_2 = {}\n for var_8 in range(var_11):\n var_16 = var_15.prime_factorization(var_7[var_8])\n for var_14, var_12 in list(var_16.items()):\n if not var_14 in var_2:\n var_2[var_14] = 0\n var_2[var_14] = max(var_2[var_14], var_12)\n var_3 = 1\n for var_14, var_12 in list(var_2.items()):\n var_3 = (var_3 * func_2(var_14, var_12)) % var_5\n var_19 = sum([var_3 * func_1(var_20) % var_5 for var_20 in var_7])\n return var_19 % var_5\n\n\nvar_6 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nprint((func_4(var_6, var_1)))\n", "fast_code": "import sys\n\nvar_4 = sys.stdin.readline\nsys.setrecursionlimit(10**7)\nvar_6 = int(eval(var_4()))\nvar_2 = list(map(int, var_4().split()))\nvar_1 = 10**9 + 7\nvar_5 = 1\n\n\nimport math\n\nfor var_7 in var_2:\n var_5 = (var_5 // math.gcd(var_5, var_7)) * var_7\nvar_3 = 0\nfor var_7 in var_2:\n var_3 = var_3 + (var_5 // var_7)\n\nprint((var_3 % var_1))\n", "slow_time": 111952662, "fast_time": 19221915, "speedup": 5.8242, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_6"} -{"pair_id": "python_14608", "problem_id": "p01314", "language": "python", "slow_code": "if __name__ == \"__main__\":\n while True:\n var_4 = int(eval(input()))\n if var_4 == 0:\n break\n var_1 = 0\n for var_2 in range(1, var_4):\n for var_3 in range(var_2 + 1, var_4):\n var_5 = (var_2 + var_3) * (var_3 - var_2 + 1) / 2\n if var_5 > var_4:\n break\n if var_5 == var_4:\n var_1 += 1\n print(var_1)\n", "fast_code": "while 1:\n var_2 = int(input())\n if not var_2:\n break\n var_1 = 0\n var_3 = 2\n while var_3**2 <= 2 * var_2:\n if not 2 * var_2 % var_3:\n if (var_3 + 2 * var_2 / var_3) % 2:\n var_1 += 1\n var_3 += 1\n print(var_1)\n", "slow_time": 129769763, "fast_time": 22771134, "speedup": 5.6989, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_4"} -{"pair_id": "python_6093", "problem_id": "p02789", "language": "python", "slow_code": "import math\nimport statistics\nimport numpy as np\nimport queue\n\n\ndef func_1(var_10):\n if var_10 == 1:\n return 1\n else:\n return var_10 * func_1(var_10 - 1)\n\n\ndef func_2(var_1, var_2):\n if var_1 == 0:\n return var_2\n elif var_2 == 0:\n return var_1\n else:\n return func_2(var_2, var_1 % var_2)\n\n\ndef func_3(var_1, var_2):\n return var_1 * var_2 / func_2(var_1, var_2)\n\n\ndef func_4(var_11):\n if len(var_11) < 2:\n return var_11\n else:\n var_3, var_5 = 0, len(var_11) - 1\n var_9 = (var_3 + var_5) // 2\n var_12 = [var_4 for var_4 in var_11 if var_11[var_9] > var_4]\n var_6 = [var_4 for var_4 in var_11 if var_11[var_9] == var_4]\n var_7 = [var_4 for var_4 in var_11 if var_11[var_9] < var_4]\n return func_4(var_12) + var_6 + func_4(var_7)\n\n\nvar_10, var_8 = list(map(int, input().split()))\nif var_10 == var_8:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nprint(([\"No\", \"Yes\"][var_2 == var_1]))\n", "slow_time": 76445893, "fast_time": 11068271, "speedup": 6.9068, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_4"} -{"pair_id": "python_2892", "problem_id": "p02559", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom fractions import Fraction\nfrom functools import lru_cache, reduce\nfrom itertools import (\n combinations,\n combinations_with_replacement,\n product,\n permutations,\n accumulate,\n)\nfrom operator import add, mul, sub, itemgetter, attrgetter\nimport sys\n\nvar_18 = sys.stdin.readline\nvar_2 = 2**62 - 1\n\n\ndef func_6():\n return int(var_18())\n\n\ndef func_7():\n return list(map(int, var_18().split()))\n\n\ndef func_4():\n return float(var_18())\n\n\ndef func_5():\n return list(map(float, var_18().split()))\n\n\ndef func_8():\n return var_18().strip()\n\n\ndef func_9():\n return var_18().strip().split()\n\n\ndef func_1(*var_7):\n print(*var_7, file=sys.stderr)\n\n\ndef func_3(var_9):\n import time\n\n def func_12(*var_7, **var_12):\n var_20 = time.perf_counter()\n var_19 = var_9(*var_7, **var_12)\n var_8 = time.perf_counter()\n func_1(var_8 - var_20, \"sec\")\n return var_19\n\n return func_12\n\n\nclass Class_1:\n def __init__(self, var_14):\n self.__data = [0] * var_14\n self.__n = var_14\n\n def add(self, var_11, var_21):\n var_11 += 1\n while var_11 <= self.__n:\n self.__data[var_11 - 1] += var_21\n var_11 += var_11 & -var_11\n\n def func_11(self, var_13, var_17):\n return self.__sum(var_17) - self.__sum(var_13)\n\n def __sum(self, var_17):\n var_20 = 0\n while var_17 > 0:\n var_20 += self.__data[var_17 - 1]\n var_17 -= var_17 & -var_17\n return var_20\n\n\n@func_3\ndef func_10(var_3, var_1, var_4):\n var_10 = Class_1(var_3)\n for var_11, var_5 in enumerate(var_1):\n var_10.add(var_11, var_5)\n var_6 = []\n for var_16 in var_4:\n if var_16[0] == 0:\n _, var_15, var_21 = var_16\n var_10.add(var_15, var_21)\n else:\n _, var_13, var_17 = var_16\n var_6.append(var_10.sum(var_13, var_17))\n return var_6\n\n\ndef func_2():\n var_3, var_4 = func_7()\n var_1 = func_7()\n var_4 = [func_7() for _ in range(var_4)]\n print(*func_10(var_3, var_1, var_4), sep=\"\\n\")\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "def func_3():\n def func_1(var_3, var_11):\n while var_3 <= var_5:\n var_2[var_3] += var_11\n var_3 += var_3 & -var_3\n\n def func_2(var_3):\n var_8 = 0\n while var_3:\n var_8 += var_2[var_3]\n var_3 -= var_3 & -var_3\n return var_8\n\n (var_5, var_6, *var_10), var_1, *var_9 = [\n list(map(int, var_9.split())) for var_9 in open(0)\n ]\n var_2 = [0] * -~var_5\n *list(map(func_1, list(range(1, var_5 + 1)), var_1)),\n for var_6, var_4, var_7 in var_9:\n if var_6:\n var_10 += (func_2(var_7) - func_2(var_4),)\n else:\n func_1(var_4 + 1, var_7)\n print((\" \".join(map(str, var_10))))\n\n\nfunc_3()\n", "slow_time": 169473996, "fast_time": 69937380, "speedup": 2.4232, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_26"} -{"pair_id": "python_4926", "problem_id": "p03598", "language": "python", "slow_code": "import sys\n\nvar_19 = sys.stdin\nvar_3 = 1 << 60\nvar_5 = 1000000007\nvar_15 = lambda: int(var_17())\nvar_16 = lambda var_21: [var_15() for _ in range(var_21)]\nvar_7 = lambda: list(map(int, var_19.readline().split()))\nvar_8 = lambda var_21: [var_7() for _ in range(var_21)]\nvar_11 = lambda: float(var_17())\nvar_14 = lambda var_21: [var_11() for _ in range(var_21)]\nvar_12 = lambda: list(map(float, var_19.readline().split()))\nvar_13 = lambda var_21: [var_12() for _ in range(var_21)]\nvar_17 = lambda: var_19.readline().rstrip()\nvar_18 = lambda var_21: [var_17() for _ in range(var_21)]\nvar_10 = lambda var_21: [list(var_17()) for _ in range(var_21)]\nvar_9 = lambda: var_19.readline().split()\nvar_6, var_4 = var_16(2)\nvar_20 = var_7()\nvar_1 = 0\nfor var_2 in range(var_6):\n var_1 += min(abs(var_20[var_2] - var_4) * 2, abs(var_20[var_2]) * 2)\nprint(var_1)\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = int(eval(input()))\nvar_7 = [int(var_4) for var_4 in input().split()]\nvar_3 = var_1 / 2\nvar_5 = 0\nfor var_6 in var_7:\n if var_6 < var_3:\n var_5 += var_6\n else:\n var_5 += var_1 - var_6\n\nprint((2 * var_5))\n", "slow_time": 100447964, "fast_time": 30613753, "speedup": 3.2811, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_23"} -{"pair_id": "python_13715", "problem_id": "p02930", "language": "python", "slow_code": "var_1, var_2 = int(eval(input())), 0\nexec(\"print(*[9-format(i+1,'09b').rfind('1')for i in range(N)][:N-j-1]);j+=1;\" * var_1)\n", "fast_code": "var_2 = eval(input())\nwhile var_2:\n var_2 -= 1\n for var_1 in range(var_2):\n print(-~bin(var_1 + 1)[::-1].find(\"1\"))\n", "slow_time": 1492569068, "fast_time": 695412314, "speedup": 2.1463, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_2"} -{"pair_id": "python_8925", "problem_id": "p02641", "language": "python", "slow_code": "var_8, var_5 = list(map(int, input().split()))\nif var_5 == 0:\n print(var_8)\n exit()\nvar_1 = list(map(int, input().split()))\nvar_2 = []\nvar_3 = []\nfor var_4 in range(-50, 110):\n if not var_4 in var_1:\n var_2.append(var_4)\n var_3.append(abs(var_8 - var_4))\nvar_6 = min([var_4 for var_4, var_7 in enumerate(var_3) if var_7 == min(var_3)])\nprint((var_2[var_6]))\n", "fast_code": "var_5, var_3 = list(map(int, input().split()))\nvar_4 = set(map(int, input().split()))\nvar_1 = 1000\nvar_1 = min(abs(var_5 - var_2) for var_2 in range(102) if var_2 not in var_4)\nprint((var_5 + var_1 if var_5 - var_1 in var_4 else var_5 - var_1))\n", "slow_time": 200917191, "fast_time": 27588791, "speedup": 7.2826, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_11"} -{"pair_id": "python_3290", "problem_id": "p03354", "language": "python", "slow_code": "import sys\n\n\ndef func_11():\n return sys.stdin.readline().strip()\n\n\ndef func_13(var_6, var_7, var_8):\n return [[var_8] * var_7 for var_12 in range(var_6)]\n\n\ndef func_14(var_6, var_7, var_8, var_10):\n return [[[var_10] * var_8 for var_13 in range(var_7)] for var_12 in range(var_6)]\n\n\ndef func_15(var_6, var_7, var_8, var_10, var_11):\n return [\n [[[var_11] * var_10 for var_13 in range(var_8)] for var_13 in range(var_7)]\n for var_12 in range(var_6)\n ]\n\n\ndef func_8(var_18, var_19=1):\n return int(-(-var_18 // var_19))\n\n\ndef func_1():\n return int(eval(func_11()))\n\n\ndef func_3():\n return list(map(int, func_11().split()))\n\n\ndef func_2(var_4=None):\n return list(func_3()) if var_4 is None else [func_1() for var_12 in range(var_4)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_1 = float(\"inf\")\nvar_3 = 10**9 + 7\n\n\nclass Class_1:\n \"\"\"\"\"\"\n\n def __init__(self, var_14):\n self.n = var_14\n\n self.par = [var_12 for var_12 in range(var_14 + 1)]\n\n self.rank = [0] * (var_14 + 1)\n\n self.size = [1] * (var_14 + 1)\n\n self.tree = [True] * (var_14 + 1)\n\n def func_9(self, var_18):\n \"\"\"\"\"\"\n\n if self.par[var_18] == var_18:\n return var_18\n else:\n\n self.par[var_18] = self.find(self.par[var_18])\n return self.par[var_18]\n\n def func_17(self, var_18, var_19):\n \"\"\"\"\"\"\n\n var_18 = self.find(var_18)\n var_19 = self.find(var_19)\n\n if var_18 == var_19:\n self.tree[var_18] = False\n return\n if not self.tree[var_18] or not self.tree[var_19]:\n self.tree[var_18] = self.tree[var_19] = False\n\n if self.rank[var_18] < self.rank[var_19]:\n self.par[var_18] = var_19\n self.size[var_19] += self.size[var_18]\n else:\n self.par[var_19] = var_18\n self.size[var_18] += self.size[var_19]\n\n if self.rank[var_18] == self.rank[var_19]:\n self.rank[var_18] += 1\n\n def func_16(self, var_18, var_19):\n \"\"\"\"\"\"\n return self.find(var_18) == self.find(var_19)\n\n def func_10(self, var_18):\n \"\"\"\"\"\"\n return self.size[self.find(var_18)]\n\n def func_12(self, var_18):\n \"\"\"\"\"\"\n return self.tree[self.find(var_18)]\n\n def len(self):\n \"\"\"\"\"\"\n var_16 = set()\n for var_12 in range(self.n + 1):\n var_16.add(self.find(var_12))\n\n return len(var_16) - 1\n\n\nvar_4, var_2 = func_3()\nvar_5 = [var_15 - 1 for var_15 in func_2()]\nvar_17 = Class_1(var_4)\nfor var_12 in range(var_2):\n var_6, var_7 = func_3()\n var_6 -= 1\n var_7 -= 1\n var_17.union(var_5[var_6], var_5[var_7])\nvar_9 = 0\nfor var_12 in range(var_4):\n var_15 = var_5[var_12]\n if var_17.same(var_15, var_12):\n var_9 += 1\nprint(var_9)\n", "fast_code": "class Class_1:\n def __init__(self, var_5):\n self.uf = [-1] * var_5\n\n def func_1(self, var_7):\n if self.uf[var_7] < 0:\n return var_7\n else:\n self.uf[var_7] = self.find(self.uf[var_7])\n return self.uf[var_7]\n\n def func_2(self, var_7, var_8):\n return self.find(var_7) == self.find(var_8)\n\n def func_4(self, var_7, var_8):\n var_7 = self.find(var_7)\n var_8 = self.find(var_8)\n if var_7 == var_8:\n return\n if self.uf[var_7] > self.uf[var_8]:\n var_7, var_8 = var_8, var_7\n self.uf[var_7] += self.uf[var_8]\n self.uf[var_8] = var_7\n\n def func_3(self, var_7):\n var_7 = self.find(var_7)\n return -self.uf[var_7]\n\n\nvar_5, var_4 = list(map(int, input().split()))\nvar_3 = list(map(int, input().split()))\nvar_6 = Class_1(var_5)\nfor var_2 in range(var_4):\n var_7, var_8 = list(map(int, input().split()))\n var_6.union(var_7 - 1, var_8 - 1)\nvar_1 = 0\nfor var_2 in range(var_5):\n if var_6.same(var_2, var_3[var_2] - 1):\n var_1 += 1\nprint(var_1)\n", "slow_time": 247598194, "fast_time": 92958802, "speedup": 2.6635, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_19"} -{"pair_id": "python_6139", "problem_id": "p03173", "language": "python", "slow_code": "from numpy import *\n\nvar_12, var_1 = open(0)\nvar_12 = int(var_12)\nvar_1 = var_5(var_8([0] + var_1.split()))\nvar_6 = var_14((var_12, var_12 + 1), \"i8\")\nfor var_9 in range(1, var_12):\n var_10 = var_3(var_12 - var_9)\n var_13 = var_3(var_9 + 1, var_12 + 1)\n var_11 = var_4(\n [var_3(var_7 + 1, var_7 + var_9 + 1) for var_7 in range(var_12 - var_9)]\n ).T\n var_6[var_10, var_13] = (\n var_2(var_6[var_10, var_11] + var_6[var_11, var_13], 0)\n + var_1[var_13]\n - var_1[var_10]\n )\nprint((var_6[0, var_12]))\n", "fast_code": "import sys\n\nvar_1 = 10**14\nvar_2 = lambda: [int(var_11) for var_11 in sys.stdin.readline().split()]\nvar_4 = lambda: int(sys.stdin.readline())\nvar_3 = var_4()\nvar_5 = var_2()\nvar_10 = [[0 for _ in range(var_3)] for _ in range(var_3)]\nvar_6 = [[var_1 for _ in range(var_3)] for _ in range(var_3)]\nfor var_7 in range(var_3):\n var_11 = 0\n for var_8 in range(var_7, var_3):\n var_11 += var_5[var_8]\n var_10[var_7][var_8] = var_11\nfor var_7 in range(var_3):\n var_6[var_7][var_7] = 0\nfor var_8 in range(1, var_3):\n for var_7 in range(var_8 - 1, -1, -1):\n for var_9 in range(0, var_8 - var_7):\n var_6[var_7][var_8] = min(\n var_6[var_7][var_8],\n var_6[var_7 + var_9 + 1][var_8]\n + var_6[var_7][var_7 + var_9]\n + var_10[var_7][var_8],\n )\nprint((var_6[0][-1]))\n", "slow_time": 9602766263, "fast_time": 83518646, "speedup": 114.9775, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_15"} -{"pair_id": "python_12900", "problem_id": "p03549", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = 0\nfor var_4 in range(1, 10**6):\n var_3 += (\n ((1 - (1 / 2) ** var_1) ** (var_4 - 1))\n * ((1 / 2) ** var_1)\n * (1900 * var_1 + 100 * (var_2 - var_1))\n * var_4\n )\nprint((int(round(var_3, -2))))\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nprint(((var_1 * 1900 + (var_2 - var_1) * 100) * pow(2, var_1)))\n", "slow_time": 232562177130, "fast_time": 12678174, "speedup": 18343.5073, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_29"} -{"pair_id": "python_5481", "problem_id": "p02392", "language": "python", "slow_code": "import sys\n\nif __name__ == \"__main__\":\n import doctest\n\n doctest.testmod()\n var_1, var_2, var_3 = list(map(int, sys.stdin.read().split()))\n if var_1 < var_2 < var_3:\n print(\"Yes\")\n else:\n print(\"No\")\n", "fast_code": "[var_1, var_2, var_3] = list(map(int, input().split()))\nprint(({True: \"Yes\", False: \"No\"}[var_1 < var_2 < var_3]))\n", "slow_time": 3028838454, "fast_time": 14458585, "speedup": 209.4837, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_17"} -{"pair_id": "python_14293", "problem_id": "p03609", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_1, var_2 = func_6()\nprint((max(0, var_1 - var_2)))\n", "fast_code": "import numpy as np\n\nvar_2, var_1 = list(map(int, input().split()))\nprint((np.max(np.array([var_2 - var_1, 0]))))\n", "slow_time": 52898444, "fast_time": 14961622, "speedup": 3.5356, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_12"} -{"pair_id": "python_14678", "problem_id": "p02713", "language": "python", "slow_code": "import math\nfrom functools import reduce\n\nvar_4 = int(eval(input()))\n\n\ndef func_1(*var_6):\n return reduce(math.gcd, var_6)\n\n\nvar_1 = 0\nfor var_2 in range(1, var_4 + 1):\n for var_3 in range(1, var_4 + 1):\n for var_5 in range(1, var_4 + 1):\n var_1 += func_1(var_2, var_3, var_5)\nprint(var_1)\n", "fast_code": "from sys import stdin\nimport numpy as np\n\n\ndef func_1():\n\n var_4 = stdin.readline\n var_3 = int(var_4())\n var_1 = np.arange(1, var_3 + 1, dtype=np.int64)\n var_2 = np.gcd.outer(np.gcd.outer(var_1, var_1), var_1)\n print((var_2.sum()))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 44139168611, "fast_time": 489850399, "speedup": 90.1074, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_27"} -{"pair_id": "python_709", "problem_id": "p03244", "language": "python", "slow_code": "def func_1():\n var_4, *var_6 = list(map(int, open(0).read().split()))\n var_1 = [0] * int(1e5)\n var_2 = [0] * int(1e5)\n for var_3, var_5 in zip(*[iter(var_6)] * 2):\n var_1[var_3 - 1] += 1\n var_2[var_5 - 1] += 1\n if var_1.index(max(var_1)) == var_2.index(max(var_2)):\n var_7 = max(var_1)\n var_8 = max(var_2)\n var_1[var_1.index(var_7)] = 0\n var_2[var_2.index(var_8)] = 0\n print((min(var_4 - var_7 - max(var_2), var_4 - var_8 - max(var_1))))\n else:\n print((var_4 - max(var_1) - max(var_2)))\n return\n\n\nfunc_1()\n", "fast_code": "import collections as coll\n\nvar_4 = int(eval(input()))\nvar_7 = list(map(int, input().split()))\nvar_1 = []\nvar_5 = []\nfor var_3 in range(var_4):\n if var_3 % 2 == 0:\n var_1.append(var_7[var_3])\n else:\n var_5.append(var_7[var_3])\nvar_6 = coll.Counter(var_5).most_common()[:2]\nvar_2 = coll.Counter(var_1).most_common()[:2]\nif len(var_6) == 1:\n var_6.append((0, 0))\nif len(var_2) == 1:\n var_2.append((0, 0))\nif var_6[0][0] != var_2[0][0]:\n print((var_4 - var_6[0][1] - var_2[0][1]))\nelse:\n print((min(var_4 - var_6[0][1] - var_2[1][1], var_4 - var_6[1][1] - var_2[0][1])))\n", "slow_time": 2695635546, "fast_time": 65731768, "speedup": 41.0096, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_9"} -{"pair_id": "python_1274", "problem_id": "p03294", "language": "python", "slow_code": "def func_1(var_3, var_5):\n return var_3 if var_5 == 0 else func_1(var_5, var_3 % var_5)\n\n\ndef func_2(var_3, var_5):\n return var_3 * var_5 // func_1(var_3, var_5)\n\n\nvar_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_7 = 0\nfor var_6 in range(1, len(var_1)):\n var_7 = func_2(var_1[var_6 - 1], var_1[var_6])\nvar_4 = var_7 - 1\nvar_4 = sum(var_1) - len(var_1)\nprint(var_4)\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nprint((sum(var_2) - var_1))\n", "slow_time": 35495565, "fast_time": 13861065, "speedup": 2.5608, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_0"} -{"pair_id": "python_2993", "problem_id": "p02994", "language": "python", "slow_code": "import copy\n\nvar_2, var_1 = list(map(int, input().split()))\nvar_4 = [var_1 + var_6 for var_6 in range(var_2)]\nvar_9 = sum(var_4)\nvar_7 = 100000\nfor var_6 in range(var_2):\n var_3 = copy.deepcopy(var_4)\n var_3[var_6] = 0\n var_10 = sum(var_3)\n var_5 = abs(var_9 - var_10)\n if var_5 < var_7:\n var_7 = var_5\n var_8 = var_6\nvar_4[var_8] = 0\nprint((sum(var_4)))\n", "fast_code": "var_5 = float(\"inf\")\nvar_2, var_1 = list(map(int, input().split()))\nvar_6 = 0\nvar_3 = var_5\nfor var_4 in range(var_1, var_1 + var_2):\n if abs(var_4) < abs(var_3):\n var_3 = var_4\n var_6 += var_4\nprint((var_6 - var_3))\n", "slow_time": 55543320, "fast_time": 22715575, "speedup": 2.4452, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_7"} -{"pair_id": "python_8128", "problem_id": "p03352", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_2 = 1\nfor var_3 in range(1, var_1 + 1):\n for var_4 in range(2, var_1 + 1):\n if var_3**var_4 <= var_1:\n var_2 = max(var_2, var_3**var_4)\n else:\n break\nprint(var_2)\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = 1\nif var_4 == 1:\n print((1))\nelse:\n var_2 = 2\n while var_2**2 <= var_4:\n var_3 = 2\n while var_2**var_3 <= var_4:\n var_1 = max(var_2**var_3, var_1)\n var_3 += 1\n var_2 += 1\n print(var_1)\n", "slow_time": 149546981, "fast_time": 28624218, "speedup": 5.2245, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_19"} -{"pair_id": "python_3553", "problem_id": "p03077", "language": "python", "slow_code": "import sys\nimport math\n\n\ndef func_1():\n return int(eval(input()))\n\n\ndef func_3(var_5):\n var_6 = [0 for _ in range(var_5)]\n for var_3 in range(var_5):\n var_6[var_3] = int(eval(input()))\n return var_6\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\nvar_5 = func_1()\nvar_2 = func_3(5)\nvar_4 = 0\nfor var_1 in var_2:\n var_4 = max(var_4, int(math.ceil(var_5 / var_1)))\nprint((var_4 + 4))\n", "fast_code": "var_2, *var_1 = eval(\"int(input()),\" * 6)\nprint((4 - -var_2 // min(var_1)))\n", "slow_time": 57316020, "fast_time": 20357921, "speedup": 2.8154, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_24"} -{"pair_id": "python_8556", "problem_id": "p03722", "language": "python", "slow_code": "var_17 = float(\"inf\")\nvar_7, var_4 = list(map(int, input().split()))\nvar_14 = []\nvar_15 = []\nfor var_16 in range(var_4):\n var_1, var_2, var_3 = list(map(int, input().split()))\n var_15.append([var_2 - 1, var_1 - 1, -var_3])\n var_14.append([var_1 - 1, var_2 - 1, -var_3])\nvar_10 = [var_17] * var_7\nvar_10[0] = 0\nfor var_16 in range(var_7):\n var_20 = False\n for var_18 in range(var_4):\n var_5, var_6, var_9 = var_14[var_18]\n if var_10[var_5] != var_17 and var_10[var_6] > var_10[var_5] + var_9:\n var_10[var_6] = var_10[var_5] + var_9\n var_20 = True\n if not var_20:\n break\nvar_12 = [var_17] * var_7\nvar_12[var_7 - 1] = 0\nfor var_16 in range(var_7):\n var_20 = False\n for var_18 in range(var_4):\n var_5, var_6, var_9 = var_15[var_18]\n if var_12[var_5] != var_17 and var_12[var_6] > var_12[var_5] + var_9:\n var_12[var_6] = var_12[var_5] + var_9\n var_20 = True\n if not var_20:\n break\nvar_11 = [var_21 for var_21 in var_10]\nvar_13 = [var_21 for var_21 in var_12]\nfor var_18 in range(var_4):\n var_5, var_6, var_9 = var_14[var_18]\n if (\n var_10[var_5] != var_17\n and var_12[var_5] != var_17\n and var_10[var_6] > var_10[var_5] + var_9\n ):\n var_10[var_6] = var_10[var_5] + var_9\nfor var_18 in range(var_4):\n var_5, var_6, var_9 = var_15[var_18]\n if (\n var_10[var_5] != var_17\n and var_12[var_5] != var_17\n and var_12[var_6] > var_12[var_5] + var_9\n ):\n var_12[var_6] = var_12[var_5] + var_9\nvar_19 = False\nfor var_16 in range(var_7):\n if var_10[var_16] != 0 and var_12[var_16] != 0:\n var_19 = (\n var_10[var_16] + var_12[var_16] != var_11[var_16] + var_13[var_16]\n ) or var_19\nif var_19:\n print(\"inf\")\nelse:\n var_8 = -var_10[-1]\n print(var_8)\n", "fast_code": "var_3, var_1 = list(map(int, input().split()))\nvar_5 = []\nfor _ in range(var_1):\n var_5.append(list(map(int, input().split())))\nvar_9 = [-float(\"inf\")] * var_3\nvar_9[0] = 0\nfor var_10 in range(2):\n for var_4, var_7, var_8 in var_5:\n var_4, var_7 = var_4 - 1, var_7 - 1\n var_9[var_7] = max(var_9[var_7], var_9[var_4] + var_8)\n if var_10 == 0:\n var_6 = var_9[var_3 - 1]\n else:\n var_2 = var_9[var_3 - 1]\nif var_6 != var_2:\n print(\"inf\")\nelse:\n print(var_6)\n", "slow_time": 135847820, "fast_time": 45176202, "speedup": 3.0071, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_20"} -{"pair_id": "python_2400", "problem_id": "p03141", "language": "python", "slow_code": "import sys\n\nvar_9 = sys.stdin\nsys.setrecursionlimit(10**5)\n\n\ndef func_3():\n return list(map(int, var_9.readline().split()))\n\n\ndef func_4():\n return [int(var_11) - 1 for var_11 in var_9.readline().split()]\n\n\ndef func_2():\n return list(map(float, var_9.readline().split()))\n\n\ndef func_5():\n return var_9.readline().split()\n\n\ndef func_8():\n return var_9.readline().rstrip()\n\n\ndef func_1():\n return list(func_8())\n\n\ndef func_7():\n return int(var_9.readline())\n\n\ndef func_6():\n return float(var_9.readline())\n\n\nfrom heapq import heappush, heappop\n\nvar_6 = func_7()\nvar_1 = [tuple(func_3()) for _ in range(var_6)]\nvar_7 = []\nfor var_2, var_4 in var_1:\n heappush(var_7, [-var_2 - var_4, var_2, var_4])\nvar_5 = 0\nvar_10 = 0\nvar_3 = 0\nwhile var_7:\n var_8, var_2, var_4 = heappop(var_7)\n if var_5 % 2 == 0:\n var_10 += var_2\n else:\n var_3 += var_4\n var_5 += 1\nprint((var_10 - var_3))\n", "fast_code": "var_5 = int(eval(input()))\nvar_2 = []\nfor var_4 in range(var_5):\n var_1, var_3 = list(map(int, input().split(\" \")))\n var_2.append([var_1 + var_3, var_1, var_3])\nvar_2.sort(reverse=True)\nvar_6 = 0\nfor var_4 in range(var_5):\n if var_4 % 2 == 0:\n var_6 += var_2[var_4][1]\n else:\n var_6 -= var_2[var_4][2]\nprint(var_6)\n", "slow_time": 86818307, "fast_time": 36234466, "speedup": 2.396, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_4"} -{"pair_id": "python_16971", "problem_id": "p02804", "language": "python", "slow_code": "var_2 = 10**6\nvar_1 = 10**9 + 7\nvar_7, var_8, var_10 = [0] * var_2, [0] * var_2, [0] * var_2\n\n\ndef func_2():\n var_7[0], var_7[1] = 1, 1\n var_8[0], var_8[1] = 1, 1\n var_10[1] = 1\n for var_9 in range(2, var_2):\n var_7[var_9] = var_7[var_9 - 1] * var_9 % var_1\n var_10[var_9] = var_1 - var_10[var_1 % var_9] * (var_1 // var_9) % var_1\n var_8[var_9] = var_8[var_9 - 1] * var_10[var_9] % var_1\n\n\ndef func_1(var_12, var_11):\n if var_12 < var_11:\n return 0\n if var_12 < 0 or var_11 < 0:\n return 0\n return var_7[var_12] * (var_8[var_11] * var_8[var_12 - var_11] % var_1) % var_1\n\n\nvar_12, var_11 = list(map(int, input().split()))\nvar_4 = list(map(int, input().split()))\nfunc_2()\nvar_4.sort()\nvar_5 = 0\nvar_6 = 0\nfor var_9, var_3 in enumerate(var_4):\n var_5 += var_3 * func_1(var_9, var_11 - 1)\n var_5 %= var_1\n var_6 += var_3 * func_1(var_12 - 1 - var_9, var_11 - 1)\n var_6 %= var_1\nprint(((var_5 - var_6) % var_1))\n", "fast_code": "var_12 = 10**9 + 7\n\n\ndef func_1(var_13, var_15, var_14):\n if (var_15 < 0) or (var_13 < var_15):\n return 0\n var_15 = min(var_15, var_13 - var_15)\n return var_6[var_13] * var_7[var_15] * var_7[var_13 - var_15] % var_14\n\n\nvar_6 = [1, 1]\nvar_7 = [1, 1]\nvar_9 = [0, 1]\nvar_14 = var_12\nfor var_8 in range(2, 10**5 + 1):\n var_6.append((var_6[-1] * var_8) % var_14)\n var_9.append((-var_9[var_14 % var_8] * (var_14 // var_8)) % var_14)\n var_7.append((var_7[-1] * var_9[-1]) % var_14)\nvar_3, var_2 = list(map(int, input().split()))\nvar_1 = sorted(map(int, input().split()))\nvar_4 = sorted(var_1, reverse=True)\nvar_5 = 0\nfor var_8 in range(var_3 - var_2 + 1):\n var_16 = func_1(var_3 - var_8 - 1, var_2 - 1, var_12)\n var_11 = var_1[var_8] * var_16 % var_12\n var_10 = var_1[var_3 - (var_8 + 1)] * var_16 % var_12\n var_5 = (var_5 + var_10 - var_11) % var_12\nprint(var_5)\n", "slow_time": 181158031493, "fast_time": 27384978772, "speedup": 6.6152, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_23"} -{"pair_id": "python_17394", "problem_id": "p02834", "language": "python", "slow_code": "class Class_2:\n def __init__(self, var_18, var_7, var_12=1):\n self.n = var_18\n self.tree = [[] for _ in range(var_18)]\n for var_6 in var_7:\n self.tree[var_6[0] - var_12].append(var_6[1] - var_12)\n self.tree[var_6[1] - var_12].append(var_6[0] - var_12)\n\n def func_6(self, var_22):\n self.root = var_22\n self.parent = [None for _ in range(self.n)]\n self.parent[var_22] = -1\n self.depth = [None for _ in range(self.n)]\n self.depth[var_22] = 0\n self.order = []\n self.order.append(var_22)\n self.size = [1 for _ in range(self.n)]\n var_25 = [var_22]\n while var_25:\n var_19 = var_25.pop()\n for var_3 in self.tree[var_19]:\n if self.parent[var_3] is None:\n self.parent[var_3] = var_19\n self.depth[var_3] = self.depth[var_19] + 1\n self.order.append(var_3)\n var_25.append(var_3)\n for var_19 in self.order[::-1]:\n for var_3 in self.tree[var_19]:\n if self.parent[var_19] == var_3:\n continue\n self.size[var_19] += self.size[var_3]\n\n def func_1(self):\n self.order = [None for _ in range(self.n)]\n self.head = [None for _ in range(self.n)]\n self.head[self.root] = self.root\n self.next = [None for _ in range(self.n)]\n var_25 = [self.root]\n var_20 = 0\n while var_25:\n var_19 = var_25.pop()\n self.order[var_19] = var_20\n var_20 += 1\n var_17 = 0\n for var_3 in self.tree[var_19]:\n if self.parent[var_19] == var_3:\n continue\n if var_17 < self.size[var_3]:\n var_17 = self.size[var_3]\n self.next[var_19] = var_3\n for var_3 in self.tree[var_19]:\n if self.parent[var_19] == var_3 or self.next[var_19] == var_3:\n continue\n self.head[var_3] = var_3\n var_25.append(var_3)\n if self.next[var_19] is not None:\n self.head[self.next[var_19]] = self.head[var_19]\n var_25.append(self.next[var_19])\n\n def func_4(self, var_27, var_28, var_7=False):\n var_21 = []\n while True:\n if self.order[var_27] > self.order[var_28]:\n var_27, var_28 = var_28, var_27\n if self.head[var_27] != self.head[var_28]:\n var_21.append((self.order[self.head[var_28]], self.order[var_28] + 1))\n var_28 = self.parent[self.head[var_28]]\n else:\n var_21.append((self.order[var_27] + var_7, self.order[var_28] + 1))\n return var_21\n\n def func_7(self, var_27):\n return self.order[var_27], self.order[var_27] + self.size[var_27]\n\n def func_2(self, var_27, var_28):\n while True:\n if self.order[var_27] > self.order[var_28]:\n var_27, var_28 = var_28, var_27\n if self.head[var_27] != self.head[var_28]:\n var_28 = self.parent[self.head[var_28]]\n else:\n return var_27\n\n\nclass Class_1:\n def __init__(self, var_4, var_8=min, var_11=2**63):\n self.h = (len(var_4) - 1).bit_length()\n self.n = 2**self.h\n self.ie = var_11\n self.func = var_8\n self.tree = [var_11 for _ in range(2 * self.n)]\n for var_9 in range(len(var_4)):\n self.tree[self.n + var_9] = var_4[var_9]\n for var_9 in range(1, self.n)[::-1]:\n self.tree[var_9] = var_8(self.tree[2 * var_9], self.tree[2 * var_9 + 1])\n\n def func_5(self, var_10, var_31):\n var_10 += self.n\n self.tree[var_10] = var_31\n while var_10:\n var_10 >>= 1\n self.tree[var_10] = self.func(\n self.tree[2 * var_10], self.tree[2 * var_10 + 1]\n )\n\n def func_3(self, var_15, var_23):\n var_15 += self.n\n var_23 += self.n\n var_29 = var_30 = self.ie\n while var_23 - var_15 > 0:\n if var_15 & 1:\n var_29 = self.func(var_29, self.tree[var_15])\n var_15 += 1\n if var_23 & 1:\n var_23 -= 1\n var_30 = self.func(self.tree[var_23], var_30)\n var_15 >>= 1\n var_23 >>= 1\n return self.func(var_29, var_30)\n\n\nimport sys\n\nvar_13 = sys.stdin.readline\nvar_2, var_27, var_28 = list(map(int, var_13().split()))\nvar_27 -= 1\nvar_28 -= 1\nvar_1 = [tuple(map(int, var_13().split())) for _ in range(var_2 - 1)]\nvar_26 = Class_2(var_2, var_1)\nvar_26.setroot(var_28)\nvar_26.heavylight_decomposition()\nvar_5 = var_26.depth[var_27]\nvar_14 = (var_5 + 1) // 2 - 1\nfor _ in range(var_14):\n var_27 = var_26.parent[var_27]\nvar_4 = [None for _ in range(var_2)]\nfor var_9 in range(var_2):\n var_4[var_26.order[var_9]] = var_26.depth[var_9]\nvar_24 = Class_1(var_4, max, -1)\nvar_15, var_23 = var_26.subtree_hld(var_27)\nvar_16 = var_24.query(var_15, var_23)\nprint((var_16 - 1))\n", "fast_code": "var_5 = lambda: list(map(int, input().split()))\nvar_12, var_16, var_15 = var_5()\nvar_16 -= 1\nvar_15 -= 1\nvar_6 = [[] for _ in range(var_12)]\nfor _ in range(var_12 - 1):\n var_1, var_2 = var_5()\n var_6[var_1 - 1].append(var_2 - 1)\n var_6[var_2 - 1].append(var_1 - 1)\n\n\ndef func_1(var_14):\n var_8 = [-1] * var_12\n var_8[var_14] = 0\n var_13 = [var_14]\n while var_13:\n var_17 = var_13.pop()\n var_4 = var_8[var_17] + 1\n for var_3 in var_6[var_17]:\n if var_8[var_3] < 0:\n var_8[var_3] = var_4\n var_13 += [var_3]\n return var_8\n\n\nvar_10 = func_1(var_16)\nvar_9 = func_1(var_15)\nvar_11 = 0\nfor var_7 in range(var_12):\n if var_10[var_7] < var_9[var_7]:\n var_11 = max(var_11, var_9[var_7])\nprint((var_11 - 1))\n", "slow_time": 196965124, "fast_time": 37754481, "speedup": 5.217, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_8"} -{"pair_id": "python_15795", "problem_id": "p03331", "language": "python", "slow_code": "var_3 = int(eval(input()))\n\n\ndef func_1(var_8):\n var_7 = []\n var_5 = 0\n while var_8 > 0:\n var_7.append(var_8 % 10)\n var_8 //= 10\n for var_4 in range(len(var_7)):\n var_5 += var_7[var_4]\n return var_5\n\n\nvar_6 = []\nif var_3 <= 10:\n print((str(var_3)))\nif var_3 > 10:\n for var_4 in range(2, (var_3 - 1) // 2 + 1):\n var_1 = var_4\n var_2 = var_3 - var_4\n var_6.append(func_1(var_1) + func_1(var_2))\n print((min(var_6)))\n", "fast_code": "var_1 = int(eval(input()))\nprint((10 if var_1 in [10**var_2 for var_2 in range(6)] else sum(map(int, str(var_1)))))\n", "slow_time": 77767512, "fast_time": 18462413, "speedup": 4.2122, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_3"} -{"pair_id": "python_9398", "problem_id": "p02675", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nimport bisect\n\nvar_2 = 10**13\nvar_4 = 10**9 + 7\n\n\ndef func_12():\n return sys.stdin.readline().strip()\n\n\ndef func_11(var_7, var_8):\n return var_7 if var_8 == 0 else func_11(var_8, var_7 % var_8)\n\n\ndef func_13(var_7, var_8):\n return (var_7 * var_8) // func_11(var_7, var_8)\n\n\ndef func_1():\n return int(func_12())\n\n\ndef func_2():\n return [int(var_7) for var_7 in func_12().split()]\n\n\ndef func_7(var_5):\n return [int(func_12()) for _ in range(var_5)]\n\n\ndef func_3(var_5):\n return [[int(var_7) for var_7 in func_12().split()] for _ in range(var_5)]\n\n\ndef func_5():\n return func_12().split()\n\n\ndef func_8(var_5):\n return [func_12() for _ in range(var_5)]\n\n\ndef func_4(var_5):\n return [func_12().split() for _ in range(var_5)]\n\n\ndef func_6(var_3):\n print(*var_3, sep=\"\\n\")\n\n\ndef func_10(var_1):\n print(\"Yes\" if var_1 else \"No\")\n\n\ndef func_9(var_1):\n print(\"YES\" if var_1 else \"NO\")\n\n\nvar_5 = func_12()\nvar_6 = int(var_5[-1])\nif var_6 in [2, 4, 5, 7, 9]:\n print(\"hon\")\nelif var_6 in [0, 1, 6, 8]:\n print(\"pon\")\nelse:\n print(\"bon\")\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = [\"pon\", \"pon\", \"hon\", \"bon\", \"hon\", \"hon\", \"pon\", \"hon\", \"pon\", \"hon\"]\nprint((var_2[var_1 % 10]))\n", "slow_time": 116219356, "fast_time": 15947940, "speedup": 7.2874, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_20"} -{"pair_id": "python_2708", "problem_id": "p02630", "language": "python", "slow_code": "var_8 = [0 for var_4 in range(100001)]\nvar_5 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nvar_7 = 0\nfor var_4 in var_2:\n var_7 += var_4\n var_8[var_4] += 1\nvar_6 = int(eval(input()))\nfor var_4 in range(var_6):\n var_1, var_3 = list(map(int, input().split()))\n var_7 -= var_1 * var_8[var_1]\n var_7 += var_3 * var_8[var_1]\n var_8[var_3] += var_8[var_1]\n var_8[var_1] = 0\n print(var_7)\n", "fast_code": "from collections import Counter\n\nvar_6 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_7 = int(eval(input()))\nvar_3 = [list(map(int, input().split())) for _ in range(var_7)]\nvar_8 = sum(var_1)\nvar_5 = Counter(var_1)\nfor var_2, var_4 in var_3:\n var_8 -= var_2 * var_5[var_2]\n var_8 += var_4 * var_5[var_2]\n var_5[var_4] += var_5[var_2]\n var_5[var_2] = 0\n print(var_8)\n", "slow_time": 1231037540, "fast_time": 51618295, "speedup": 23.8489, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_2"} -{"pair_id": "python_4430", "problem_id": "p03136", "language": "python", "slow_code": "import sys, re, os\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\nfrom itertools import permutations, combinations, product, accumulate\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom heapq import heapify, heappop, heappush\n\n\ndef func_6():\n return sys.stdin.readline().strip()\n\n\ndef func_1():\n return int(eval(func_6()))\n\n\ndef func_3():\n return list(map(int, func_6().split()))\n\n\ndef func_5():\n return list(map(str, func_6().split()))\n\n\ndef func_2():\n return list(map(int, func_6().split()))\n\n\ndef func_4():\n return list(map(str, func_6().split()))\n\n\nsys.setrecursionlimit(10**9)\nvar_1 = float(\"inf\")\nvar_5 = 10**9 + 7\nvar_3 = func_1()\nvar_2 = func_2()\nvar_4 = sorted(var_2)\nif var_4[-1] < sum(var_4[:-1]):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nif max(var_2) * 2 < sum(var_2):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 77294402, "fast_time": 19675444, "speedup": 3.9285, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_9"} -{"pair_id": "python_6709", "problem_id": "p00070", "language": "python", "slow_code": "import sys\n\nvar_4 = 1024\nvar_5 = 331\nvar_6 = list(range(var_4))\nvar_1 = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]\nvar_2 = [0] * var_4\nvar_3 = [[0 for var_9 in range(var_5)] for var_11 in var_6]\n\n\ndef func_1():\n global C, D\n for var_9 in var_6:\n var_14 = format(var_9, \"b\")\n var_13 = var_14.count(\"1\")\n var_2[var_9] = var_13\n if var_13 == 1:\n var_3[var_9][var_1.index(var_9)] = 1\n else:\n for var_11 in range(len(var_14)):\n if var_14[-var_11 - 1] == \"1\":\n var_8 = var_13 * var_11\n var_10 = var_9 - var_1[var_11]\n for var_12 in range(var_5 - var_8):\n var_3[var_9][var_12 + var_8] += var_3[var_10][var_12]\n return\n\n\nfunc_1()\nfor var_7 in sys.stdin:\n var_13, var_14 = list(map(int, var_7.split()))\n var_15 = 0\n if var_14 < var_5:\n var_15 = sum(\n [var_3[var_9][var_14] for var_9 in var_6 if var_2[var_9] == var_13]\n )\n print(var_15)\n", "fast_code": "import sys\n\n\ndef func_2(var_1, var_9, var_10):\n if var_9 == 1:\n if var_10 in var_1:\n func_1 = 1\n else:\n func_1 = 0\n return func_1\n var_7 = 0\n var_1 = sorted(var_1)\n var_2 = var_1[:var_9][::-1]\n var_3 = var_1[-var_9:]\n var_4 = list(range(var_9))\n\n def func_1(var_1):\n return sum([(var_8 + 1) * var_1[var_8] for var_8 in var_4])\n\n if func_1(var_2) <= var_10 <= func_1(var_3):\n for var_8 in range(len(var_1)):\n var_6 = var_10 - var_1[var_8] * var_9\n var_7 += func_2(var_1[:var_8] + var_1[var_8 + 1 :], var_9 - 1, var_6)\n return var_7\n\n\nfor var_5 in sys.stdin:\n var_9, var_10 = list(map(int, var_5.split()))\n print(func_2(list(range(10)), var_9, var_10))\n", "slow_time": 56673214149, "fast_time": 94563075, "speedup": 599.3165, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_4"} -{"pair_id": "python_7686", "problem_id": "p02838", "language": "python", "slow_code": "var_8 = 1000000007\nvar_2 = 0\nvar_9 = int(eval(input()))\nvar_1 = [int(var_5) for var_5 in input().split()]\nvar_11 = [[0] * 63 for var_5 in range(var_9 + 1)]\nvar_7 = [(2**var_5) % var_8 for var_5 in range(63)]\nfor var_5 in range(var_9):\n var_4 = var_1[var_5]\n var_3 = 0\n for var_6 in range(63):\n if var_4 & 1:\n var_11[var_5 + 1][var_3] = var_11[var_5][var_3] + 1\n else:\n var_11[var_5 + 1][var_3] = var_11[var_5][var_3]\n var_3 += 1\n var_4 = var_4 >> 1\nfor var_5 in range(1, var_9):\n for var_6 in range(63):\n var_10 = var_11[var_5][var_6] - var_11[var_5 - 1][var_6]\n if var_10:\n var_2 += var_7[var_6] * (\n (var_9 - var_5) - (var_11[-1][var_6] - var_11[var_5][var_6])\n )\n else:\n var_2 += var_7[var_6] * (var_11[-1][var_6] - var_11[var_5][var_6])\n var_2 %= var_8\nprint(var_2)\n", "fast_code": "var_8 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_7 = 10**9 + 7\nvar_6 = len(bin(max(var_1))) - 2\nvar_2 = 0\nfor var_4 in range(var_6):\n var_3 = sum([1 for var_5 in var_1 if ((var_5 >> var_4) & 1)])\n var_2 += var_3 * (var_8 - var_3) * (1 << var_4)\n var_2 %= var_7\nprint((var_2 % var_7))\n", "slow_time": 280836259, "fast_time": 48475387, "speedup": 5.7934, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_9"} -{"pair_id": "python_17803", "problem_id": "p03456", "language": "python", "slow_code": "var_1, var_3 = list(map(str, input().split()))\nvar_5 = int(var_1 + var_3)\nvar_2 = \"No\"\nfor var_4 in range(var_5 // 2):\n if var_5 == var_4 * var_4:\n var_2 = \"Yes\"\nprint(var_2)\n", "fast_code": "var_5, var_6 = input().split()\nvar_2 = int(var_5 + var_6)\nvar_3 = []\nfor var_1 in range(1, 1000):\n var_3.append(var_1 * var_1)\nfor var_4 in var_3:\n if var_4 == var_2:\n print(\"Yes\")\n quit()\nprint(\"No\")\n", "slow_time": 729346459, "fast_time": 98989051, "speedup": 7.368, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_13"} -{"pair_id": "python_6596", "problem_id": "p00741", "language": "python", "slow_code": "import sys\nfrom pprint import pprint\n\n\nclass Class_1:\n def __init__(self):\n self._parent = {}\n self._rank = {}\n self._equiv = {}\n\n def _find(self, var_11):\n if self._parent[var_11] == var_11:\n return self._parent[var_11]\n else:\n var_7 = self._find(self._parent[var_11])\n self._parent[var_11] = var_7\n return var_7\n\n def _set_parent(self, var_1, var_8):\n self._parent[var_1] = var_8\n self._equiv[var_8].update(self._equiv.pop(var_1))\n\n def _union(self, var_11, var_15):\n var_11 = self._find(var_11)\n var_15 = self._find(var_15)\n if var_11 == var_15:\n return\n if self._rank[var_11] > self._rank[var_15]:\n self._set_parent(var_15, var_11)\n elif self._rank[var_11] < self._rank[var_15]:\n self._set_parent(var_11, var_15)\n else:\n self._set_parent(var_11, var_15)\n self._rank[var_11] += 1\n\n def _make_set(self, var_11):\n self._parent[var_11] = var_11\n self._rank[var_11] = 0\n self._equiv[var_11] = {var_11}\n\n def func_5(self, *var_3):\n if not var_3:\n return\n for var_11 in var_3:\n if var_11 in self._parent:\n continue\n self._make_set(var_11)\n var_12 = var_3[0]\n for var_11 in var_3[1:]:\n self._union(var_12, var_11)\n\n def func_1(self):\n return [set(var_2) for var_2 in list(self._equiv.values())]\n\n\ndef func_3(var_5, var_6):\n\n for var_11 in range(var_5 - 1):\n for var_15 in range(var_6):\n yield [(var_11, var_15), (var_11 + 1, var_15)]\n\n for var_11 in range(var_5):\n for var_15 in range(var_6 - 1):\n yield [(var_11, var_15), (var_11, var_15 + 1)]\n\n for var_11 in range(var_5 - 1):\n for var_15 in range(var_6 - 1):\n yield [(var_11, var_15), (var_11 + 1, var_15 + 1)]\n\n for var_11 in range(var_5 - 1):\n for var_15 in range(1, var_6):\n yield [(var_11, var_15), (var_11 + 1, var_15 - 1)]\n\n\ndef func_4(var_5, var_6, var_10):\n var_4 = Class_1()\n for var_11 in range(var_5):\n for var_15 in range(var_6):\n if var_10[var_15][var_11]:\n var_4.unite((var_11, var_15))\n for (var_13, var_16), (var_14, var_17) in func_3(var_5, var_6):\n if var_10[var_16][var_13] and var_10[var_17][var_14]:\n var_4.unite((var_13, var_16), (var_14, var_17))\n return len(var_4.groups())\n\n\ndef func_2():\n while True:\n var_5, var_6 = list(map(int, input().split()))\n if var_5 == 0 and var_6 == 0:\n break\n var_10 = []\n for _ in range(var_6):\n var_9 = list(map(int, input().split()))\n var_10.append(var_9)\n print((func_4(var_5, var_6, var_10)))\n\n\nfunc_2()\n", "fast_code": "def func_1():\n from collections import deque\n\n while True:\n var_8, var_4 = [int(var_9) + 2 for var_9 in input().split()]\n if var_8 == 2:\n break\n var_7 = 0\n var_1 = [\"0\"] * var_8\n for _ in [0] * (var_4 - 2):\n var_1 += [\"0\"] + input().split() + [\"0\"]\n var_1 += [\"0\"] * var_8\n for var_5 in range(var_8 * var_4):\n if var_1[var_5] != \"1\":\n continue\n var_1[var_5] = \"0\"\n var_7 += 1\n var_3 = deque([var_5])\n while var_3:\n var_6 = var_3.popleft()\n for var_2 in (\n var_6 - var_8 - 1,\n var_6 - var_8,\n var_6 - var_8 + 1,\n var_6 - 1,\n var_6 + 1,\n var_6 + var_8 - 1,\n var_6 + var_8,\n var_6 + var_8 + 1,\n ):\n if var_1[var_2] == \"1\":\n var_1[var_2] = \"0\"\n var_3.append(var_2)\n print(var_7)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 271738057, "fast_time": 84760537, "speedup": 3.206, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_11"} -{"pair_id": "python_14318", "problem_id": "p03972", "language": "python", "slow_code": "import itertools\nimport os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\nsys.setrecursionlimit(2147483647)\nvar_3 = float(\"inf\")\nvar_2 = 10**18\nvar_4 = 10**9 + 7\n\n\nclass Class_1:\n def __init__(self, func_2=None, var_15=None):\n \"\"\"\"\"\"\n assert func_2 is not None or var_15 is not None\n if func_2 is not None:\n self._parents = [var_13 for var_13 in range(func_2)]\n self._ranks = [0 for _ in range(func_2)]\n self._sizes = [1 for _ in range(func_2)]\n else:\n self._parents = {var_14: var_14 for var_14 in var_15}\n self._ranks = {var_14: 0 for var_14 in var_15}\n self._sizes = {var_14: 1 for var_14 in var_15}\n\n def func_4(self, var_24, var_25):\n \"\"\"\"\"\"\n var_24 = self.root(var_24)\n var_25 = self.root(var_25)\n if var_24 == var_25:\n return\n\n if self._ranks[var_24] > self._ranks[var_25]:\n\n self._parents[var_25] = var_24\n self._sizes[var_24] += self._sizes[var_25]\n else:\n\n self._parents[var_24] = var_25\n self._sizes[var_25] += self._sizes[var_24]\n if self._ranks[var_24] == self._ranks[var_25]:\n self._ranks[var_25] += 1\n\n def func_1(self, var_24):\n \"\"\"\"\"\"\n if self._parents[var_24] == var_24:\n return var_24\n self._parents[var_24] = self.root(self._parents[var_24])\n return self._parents[var_24]\n\n def func_2(self, var_24):\n \"\"\"\"\"\"\n return self._sizes[self.root(var_24)]\n\n\nvar_7, var_1 = list(map(int, sys.stdin.readline().split()))\nvar_5 = [int(sys.stdin.readline()) for _ in range(var_7)]\nvar_6 = [int(sys.stdin.readline()) for _ in range(var_1)]\n\n\ndef func_3():\n var_9 = []\n var_22 = []\n for var_10, var_23 in itertools.product(\n list(range(var_1 + 1)), list(range(var_7 + 1))\n ):\n if var_23 < var_7:\n var_9.append((var_5[var_23], (var_23, var_10), (var_23 + 1, var_10)))\n if var_10 < var_1:\n var_9.append((var_6[var_10], (var_23, var_10), (var_23, var_10 + 1)))\n for var_10, var_23 in itertools.product(\n list(range(var_1 + 1)), list(range(var_7 + 1))\n ):\n var_22.append((var_23, var_10))\n var_9.sort()\n\n var_19 = Class_1(nodes=var_22)\n var_16 = 0\n for var_17, var_20, var_18 in var_9:\n if var_19.root(var_20) != var_19.root(var_18):\n var_19.unite(var_20, var_18)\n var_16 += var_17\n return var_16\n\n\nvar_12 = var_5.copy()\n\nvar_22 = var_6.copy()\nvar_12.sort(reverse=True)\nvar_22.sort(reverse=True)\nvar_8 = 0\nvar_21 = var_7 + 1\nvar_11 = var_1 + 1\nwhile var_12 or var_22:\n if not var_22 or (var_12 and var_12[-1] < var_22[-1]):\n\n var_8 += var_12.pop() * var_11\n var_21 -= 1\n else:\n\n var_8 += var_22.pop() * var_21\n var_11 -= 1\nprint(var_8)\n", "fast_code": "var_4, var_1 = list(map(int, input().split()))\nvar_2 = [int(eval(input())) for var_6 in range(var_4)]\nvar_3 = [int(eval(input())) for var_7 in range(var_1)]\nvar_2.append(float(\"inf\"))\nvar_3.append(float(\"inf\"))\nvar_2.sort(reverse=True)\nvar_3.sort(reverse=True)\nvar_9 = var_4 + 1\nvar_8 = var_1 + 1\nvar_5 = 0\nwhile var_9 > 1 or var_8 > 1:\n if var_2[-1] < var_3[-1]:\n var_5 += var_2.pop() * var_8\n var_9 -= 1\n elif var_3[-1] < var_2[-1]:\n var_5 += var_3.pop() * var_9\n var_8 -= 1\n elif var_2[-1] == var_3[-1]:\n if var_9 <= var_8:\n var_5 += var_3.pop() * var_9\n var_8 -= 1\n elif var_9 > var_8:\n var_5 += var_2.pop() * var_8\n var_9 -= 1\nprint(var_5)\n", "slow_time": 217485236, "fast_time": 72819695, "speedup": 2.9866, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_0"} -{"pair_id": "python_8811", "problem_id": "p03371", "language": "python", "slow_code": "import sys\n\nvar_11 = sys.stdin.read\nvar_12 = sys.stdin.readline\nvar_13 = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nvar_4 = 1 << 60\n\n\ndef func_1():\n var_1, var_2, var_3, var_5, var_6 = list(map(int, var_12().split()))\n var_7 = var_4\n for var_10 in range(0, 2 * max(var_5, var_6) + 1, 2):\n var_8 = max(0, var_5 - var_10 // 2)\n var_9 = max(0, var_6 - var_10 // 2)\n if var_7 > var_1 * var_8 + var_2 * var_9 + var_3 * var_10:\n var_7 = var_1 * var_8 + var_2 * var_9 + var_3 * var_10\n print(var_7)\n return\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_1, var_2, var_3, var_4, var_5 = list(map(int, input().split()))\nvar_8, var_9 = 0, 0\nvar_7 = 0\nif var_1 >= 2 * var_3 and var_4 > var_8:\n var_6 = var_4 - var_8\n var_7 += var_3 * var_4 * 2\n var_8 += var_4\n var_9 += var_4\nif var_2 >= 2 * var_3 and var_5 > var_9:\n var_6 = var_5 - var_9\n var_7 += var_3 * var_6 * 2\n var_8 += var_6\n var_9 += var_6\nif (var_1 + var_2) >= 2 * var_3 and (var_4 - var_8) >= 1 and (var_5 - var_9) >= 1:\n var_6 = min(var_4, var_5)\n var_7 += var_3 * var_6 * 2\n var_8 += var_6\n var_9 += var_6\nif var_4 - var_8 >= 1:\n var_7 += var_1 * (var_4 - var_8)\nif var_5 - var_9 >= 1:\n var_7 += var_2 * (var_5 - var_9)\nprint(var_7)\n", "slow_time": 798774011, "fast_time": 48557915, "speedup": 16.4499, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_29"} -{"pair_id": "python_13263", "problem_id": "p02699", "language": "python", "slow_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nvar_2 = 10**9 + 7\nvar_1 = float(\"inf\")\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\nvar_3, var_4 = func_2()\nif var_4 >= var_3:\n print(\"unsafe\")\nelse:\n print(\"safe\")\n", "fast_code": "def func_1():\n var_2, var_3 = list(map(int, input().split()))\n var_1 = \"unsafe\" if var_3 >= var_2 else \"safe\"\n print(var_1)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 41795967, "fast_time": 17550197, "speedup": 2.3815, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_17"} -{"pair_id": "python_6216", "problem_id": "p00040", "language": "python", "slow_code": "var_7 = [\n \"a\",\n \"b\",\n \"c\",\n \"d\",\n \"e\",\n \"f\",\n \"g\",\n \"h\",\n \"i\",\n \"j\",\n \"k\",\n \"l\",\n \"m\",\n \"n\",\n \"o\",\n \"p\",\n \"q\",\n \"r\",\n \"s\",\n \"t\",\n \"u\",\n \"v\",\n \"w\",\n \"x\",\n \"y\",\n \"z\",\n]\nvar_11 = [1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25]\nvar_12 = int(input())\nfor var_13 in range(var_12):\n var_4 = input()\n for var_1 in var_11:\n var_9 = 0\n for var_2 in range(26):\n var_6 = \"\"\n for var_3 in var_4:\n if var_3 != \" \":\n var_8 = var_7.index(var_3)\n for var_10 in range(26):\n if (var_1 * var_10 + var_2) % 26 == var_8:\n var_5 = var_7[var_10]\n break\n var_6 += var_5\n else:\n var_6 += \" \"\n if var_6.count(\"that\") > 0 or var_6.count(\"this\") > 0:\n var_9 = 1\n break\n if var_9 == 1:\n break\n print(var_6)\n", "fast_code": "import string\n\nvar_1 = \"abcdefghijklmnopqrstuvwxyz\"\nvar_3 = list(range(26))\n\n\ndef func_3(var_9, var_2):\n var_13 = \"\"\n for var_6 in var_9:\n var_13 += var_2[var_1.index(var_6)] if \"a\" <= var_6 <= \"z\" else var_6\n return var_13\n\n\ndef func_1(var_9, var_4, var_5):\n var_2 = \"\".join([var_1[(var_8 * var_4 + var_5) % 26] for var_8 in var_3])\n var_11 = func_3(var_9, var_2)\n return var_11\n\n\ndef func_4(var_9, var_4):\n var_4 = var_4 % 26\n var_2 = var_1[var_4:] + var_1[:var_4]\n var_11 = func_3(var_9, var_2)\n return var_11\n\n\ndef func_2(var_11):\n var_7 = \"t\"\n for var_8 in var_3:\n var_4 = 0\n var_13 = func_1(var_11, var_8, 0)\n var_6 = var_1.index(var_13[0])\n if var_6 != 19:\n var_4 = (19 - var_6) % 26\n var_13 = func_4(var_13, var_4)\n if var_13 in [\"this\", \"that\"]:\n return var_8, var_4\n return -1, -1\n\n\nvar_10 = eval(input())\nwhile var_10:\n var_10 -= 1\n var_11 = input()\n for var_12 in var_11.split():\n if len(var_12) == 4:\n var_4, var_5 = func_2(var_12)\n if var_4 != -1:\n break\n print(func_1(var_11, var_4, var_5))\n", "slow_time": 6096430089, "fast_time": 123375682, "speedup": 49.4135, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_0"} -{"pair_id": "python_10722", "problem_id": "p03767", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_9():\n return [int(var_15) for var_15 in sys.stdin.readline().split()]\n\n\ndef func_7():\n return int(sys.stdin.readline())\n\n\ndef func_11():\n return [list(var_15) for var_15 in sys.stdin.readline().split()]\n\n\ndef func_13():\n return list(sys.stdin.readline())[:-1]\n\n\ndef func_8(var_12):\n return [func_7() for var_8 in range(var_12)]\n\n\ndef func_10(var_12):\n return [func_9() for var_8 in range(var_12)]\n\n\ndef func_14(var_12):\n return [func_13() for var_8 in range(var_12)]\n\n\ndef func_12(var_12):\n return [func_11() for var_8 in range(var_12)]\n\n\nsys.setrecursionlimit(1000000)\nvar_11 = 1000000007\n\n\ndef func_1():\n var_12 = func_7()\n var_1 = func_9()\n var_1.sort(key=lambda var_15: -var_15)\n var_2 = 0\n for var_8 in range(var_12):\n var_2 += var_1[2 * var_8 + 1]\n print(var_2)\n return\n\n\ndef func_2():\n def func_15(var_5, var_15, var_4):\n if var_5 <= var_6[var_15]:\n return\n var_6[var_15] = var_5\n if not var_7[var_15]:\n var_7[var_15] = var_4\n for var_16 in var_14[var_15]:\n func_15(var_5 - 1, var_16, var_4)\n\n var_12, var_10 = func_9()\n var_7 = [0] * var_12\n var_14 = [[] for var_8 in range(var_12)]\n for var_8 in range(var_10):\n var_1, var_3 = func_9()\n var_1 -= 1\n var_3 -= 1\n var_14[var_1].append(var_3)\n var_14[var_3].append(var_1)\n var_6 = defaultdict(lambda: -1)\n var_13 = func_7()\n var_9 = func_10(var_13)\n var_9 = var_9[::-1]\n for var_15, var_5, var_4 in var_9:\n var_15 -= 1\n func_15(var_5, var_15, var_4)\n for var_8 in var_7:\n print(var_8)\n return\n\n\ndef func_3():\n var_12 = func_7()\n return\n\n\ndef func_4():\n var_12 = func_7()\n return\n\n\ndef func_5():\n var_12 = func_7()\n return\n\n\ndef func_6():\n var_12 = func_7()\n return\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "print(\n sum(\n sorted(list(map(int, exec(\"N=int(input())\") or input().split())))[\n -2 : -2 * var_1 - 1 : -2\n ]\n )\n)\n", "slow_time": 173061558, "fast_time": 19422486, "speedup": 8.9104, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_9"} -{"pair_id": "python_5151", "problem_id": "p02409", "language": "python", "slow_code": "var_4 = [\n [\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n ],\n [\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n ],\n [\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n ],\n [\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n ],\n]\nvar_8 = \"####################\"\nvar_6 = int(input())\nfor var_2 in range(var_6):\n (var_1, var_3, var_7, var_9) = [int(var_10) for var_10 in input().split()]\n if 1 > var_1 > 5 and 1 > var_3 > 4 and 1 > var_7 > 10:\n break\n var_4[var_1 - 1][var_3 - 1][var_7 - 1] += var_9\nfor var_11 in range(4):\n for var_5 in range(len(var_4[var_11])):\n for var_9 in var_4[var_11][var_5]:\n print(end=\" \")\n print(var_9, end=\"\")\n print()\n if not var_11 == 3:\n print(var_8)\n", "fast_code": "var_1 = input\nvar_8 = range\nvar_2 = [[[0 for var_5 in var_8(10)] for var_6 in var_8(3)] for var_7 in var_8(4)]\nfor var_5 in var_8(int(var_1())):\n var_3, var_4, var_8, var_9 = list(map(int, var_1().split()))\n var_2[var_3 - 1][var_4 - 1][var_8 - 1] += var_9\nvar_4 = 0\nfor var_5 in var_2:\n if var_4:\n print((\"#\" * 20))\n else:\n var_4 = 1\n for var_6 in var_5:\n print((\"\", *var_6))\n", "slow_time": 141548888, "fast_time": 53259417, "speedup": 2.6577, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_4"} -{"pair_id": "python_1347", "problem_id": "p03037", "language": "python", "slow_code": "def func_3(var_5, var_2, var_1, var_6) -> int:\n var_11 = 0\n var_3 = max(var_1)\n var_4 = min(var_6)\n for var_7 in range(1, var_5 + 1):\n if var_3 <= var_7 and var_4 >= var_7:\n var_11 += 1\n return var_11\n\n\ndef func_2():\n var_10 = 1\n\n\ndef func_1():\n var_5, var_2 = list(map(int, input().split()))\n var_1 = []\n var_6 = []\n for _ in range(var_2):\n var_8, var_9 = list(map(int, input().split()))\n var_1.append(var_8)\n var_6.append(var_9)\n print((func_3(var_5, var_2, var_1[:], var_6[:])))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_7, var_6 = list(map(int, input().split()))\nvar_5 = [list(map(int, input().split())) for var_3 in range(var_6)]\nvar_1 = 0\nvar_2 = var_7\nfor var_4, var_8 in var_5:\n if var_1 < var_4:\n var_1 = var_4\n if var_8 < var_2:\n var_2 = var_8\nprint((max(var_2 - var_1 + 1, 0)))\n", "slow_time": 1129543532, "fast_time": 22038446, "speedup": 51.2533, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_27"} -{"pair_id": "python_14252", "problem_id": "p03558", "language": "python", "slow_code": "from collections import *\n\nvar_5 = var_1([(1, 1)])\nvar_2 = eval(input())\nvar_3 = {}\nwhile var_5:\n var_4, var_6 = var_5.pop()\n if (var_4 in var_3) - 1:\n var_3[var_4] = var_6\n var_5 += ((var_4 * 10 % var_2, var_6),)\n var_5.appendleft((-~var_4 % var_2, var_6 + 1))\nprint(var_3[0])\n", "fast_code": "from collections import deque\n\n\ndef func_1(var_1):\n var_2 = [99999999999] * (var_1 + 1)\n var_4 = deque()\n var_4.append((1, 1))\n var_2[1] = 1\n while var_4:\n var_5, var_3 = var_4.popleft()\n if var_5 == 0:\n return var_3\n _ = (var_5 * 10) % var_1\n if var_3 < var_2[_]:\n var_4.appendleft((_, var_3))\n var_2[_] = var_3\n _ = (var_5 + 1) % var_1\n if var_3 + 1 < var_2[_]:\n var_4.append((_, var_3 + 1))\n var_2[_] = var_3 + 1\n return None\n\n\nvar_1 = int(eval(input()))\nprint((func_1(var_1)))\n", "slow_time": 3795208339, "fast_time": 524611965, "speedup": 7.2343, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_0"} -{"pair_id": "python_7907", "problem_id": "p02708", "language": "python", "slow_code": "var_5, var_2 = list(map(int, input().split()))\nvar_4 = 10**9 + 7\nvar_3, var_1 = 0, var_5\nvar_6 = 0\nif 1 >= var_2:\n var_6 += var_1 - var_3 + 1\nfor var_7 in range(2, var_5 + 2):\n var_3 += var_7 - 1\n var_1 += var_5 - var_7 + 1\n var_3 %= var_4\n var_1 %= var_4\n if var_7 >= var_2:\n var_6 += var_1 - var_3 + 1\n var_6 %= var_4\nprint(var_6)\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nprint(\n (\n (\n var_2 * (var_2 + 1) * (var_2 + 2) // 6\n - (3 * var_2 - 2 * var_1 + 4) * (var_1 - 1) * var_1 // 6\n - var_1\n + var_2\n + 2\n )\n % (10**9 + 7)\n )\n)\n", "slow_time": 6613404738, "fast_time": 17504024, "speedup": 377.822, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_25"} -{"pair_id": "python_6213", "problem_id": "p00040", "language": "python", "slow_code": "import sys\nimport os\nimport math\n\nvar_1 = int(eval(input()))\nvar_4 = \"abcdefghijklmnopqrstuvwxyz\"\n\n\ndef func_1(var_14, var_3, var_6):\n var_15 = []\n for var_7 in var_14:\n if var_7 == \" \":\n var_15.append(var_7)\n else:\n var_12 = ord(var_7) - 97\n var_17 = (var_3 * var_12 + var_6) % 26\n var_18 = var_4[var_17]\n var_15.append(var_18)\n return \"\".join(var_15)\n\n\nfor var_13 in range(var_1):\n var_14 = input().strip()\n for var_2 in range(0, 26):\n for var_5 in range(0, 26):\n var_11 = func_1(\"this\", var_2, var_5)\n var_10 = func_1(\"that\", var_2, var_5)\n if var_11 in var_14 or var_10 in var_14:\n var_9 = func_1(var_4, var_2, var_5)\n var_16 = str.maketrans(var_9, var_4)\n var_8 = var_14.translate(var_16)\n print(var_8)\n", "fast_code": "import string\n\nvar_1 = \"abcdefghijklmnopqrstuvwxyz\"\nvar_3 = list(range(26))\n\n\ndef func_3(var_9, var_2):\n var_13 = \"\"\n for var_6 in var_9:\n var_13 += var_2[var_1.index(var_6)] if \"a\" <= var_6 <= \"z\" else var_6\n return var_13\n\n\ndef func_1(var_9, var_4, var_5):\n var_2 = \"\".join([var_1[(var_8 * var_4 + var_5) % 26] for var_8 in var_3])\n var_11 = func_3(var_9, var_2)\n return var_11\n\n\ndef func_4(var_9, var_4):\n var_4 = var_4 % 26\n var_2 = var_1[var_4:] + var_1[:var_4]\n var_11 = func_3(var_9, var_2)\n return var_11\n\n\ndef func_2(var_11):\n var_7 = \"t\"\n for var_8 in var_3:\n var_4 = 0\n var_13 = func_1(var_11, var_8, 0)\n var_6 = var_1.index(var_13[0])\n if var_6 != 19:\n var_4 = (19 - var_6) % 26\n var_13 = func_4(var_13, var_4)\n if var_13 in [\"this\", \"that\"]:\n return var_8, var_4\n return -1, -1\n\n\nvar_10 = eval(input())\nwhile var_10:\n var_10 -= 1\n var_11 = input()\n for var_12 in var_11.split():\n if len(var_12) == 4:\n var_4, var_5 = func_2(var_12)\n if var_4 != -1:\n break\n print(func_1(var_11, var_4, var_5))\n", "slow_time": 559587423, "fast_time": 123375682, "speedup": 4.5356, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_0"} -{"pair_id": "python_10622", "problem_id": "p03699", "language": "python", "slow_code": "var_6 = int(eval(input()))\nvar_1 = [int(eval(input())) for _ in range(var_6)]\nvar_3 = [[] for _ in range(var_6 + 1)]\nfor var_4 in range(var_6 + 1):\n var_3[var_4] += [-1 for _ in range(10010)]\nvar_3[0][0] = 1\nfor var_4 in range(var_6):\n for var_5 in range(10010):\n if var_3[var_4][var_5] == 1:\n var_3[var_4 + 1][var_5] = 1\n var_3[var_4 + 1][var_5 + var_1[var_4]] = 1\nvar_2 = 0\nfor var_4 in range(10010):\n if var_3[var_6][var_4] == 1:\n if var_4 % 10 != 0:\n var_2 = max(var_2, var_4)\nprint(var_2)\n", "fast_code": "var_3 = int(eval(input()))\nvar_4 = sorted([int(eval(input())) for var_2 in range(var_3)])\nvar_1 = 0\nif sum(var_4) % 10 != 0:\n print((sum(var_4)))\nelse:\n for var_2 in var_4:\n if var_2 % 10 != 0:\n var_1 = sum(var_4) - var_2\n print(var_1)\n break\n if var_1 == 0:\n print(var_1)\n", "slow_time": 2121900435, "fast_time": 33794001, "speedup": 62.7893, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_29"} -{"pair_id": "python_6227", "problem_id": "p03502", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nimport array\nimport inspect\n\nsys.setrecursionlimit(10000)\n\n\ndef func_1(*var_3):\n var_6 = {\n id(var_7): var_5\n for var_5, var_7 in list(inspect.currentframe().f_back.f_locals.items())\n }\n print(\n (\n \", \".join(\n var_6.get(id(var_2), \"???\") + \" = \" + repr(var_2) for var_2 in var_3\n )\n )\n )\n\n\ndef func_4(var_8):\n return bin(var_8)[2:]\n\n\ndef func_2():\n return [int(_) for _ in input().split()]\n\n\nvar_4 = None\n\n\ndef func_3():\n var_1 = int(eval(input()))\n if var_1 % sum(list(map(int, list(str(var_1))))) == 0:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nfunc_3()\n", "fast_code": "var_1 = int(eval(input()))\n\n\ndef func_1(var_1):\n return sum(map(int, str(var_1)))\n\n\nprint((\"Yes\" if var_1 % func_1(var_1) == 0 else \"No\"))\n", "slow_time": 66486570, "fast_time": 18657113, "speedup": 3.5636, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_12"} -{"pair_id": "python_7107", "problem_id": "p02732", "language": "python", "slow_code": "var_2 = [0] * 8**6\n_, var_1 = open(0)\n(*var_1,) = list(map(int, var_1.split()))\nfor var_3 in var_1:\n var_2[var_3] += 1\nvar_4 = sum(var_3 * ~-var_3 // 2 for var_3 in var_2)\nprint((\" \".join(str(var_4 - var_2[var_3] + 1) for var_3 in var_1)))\n", "fast_code": "import sys\n\n\ndef func_2():\n return sys.stdin.readline().rstrip()\n\n\nfrom collections import Counter\nfrom operator import mul\nfrom functools import reduce\n\n\ndef func_1(var_6, var_8):\n var_8 = min(var_6 - var_8, var_8)\n if var_8 == 0:\n return 1\n var_7 = reduce(mul, list(range(var_6, var_6 - var_8, -1)))\n var_9 = reduce(mul, list(range(1, var_8 + 1)))\n return var_7 // var_9\n\n\ndef func_3():\n var_6 = int(eval(func_2()))\n var_1 = [int(_) for _ in func_2().split()]\n var_2 = Counter(var_1)\n var_4 = 0\n for var_3 in list(var_2.items()):\n if var_3[1] >= 2:\n var_4 += func_1(var_3[1], 2)\n for var_5 in range(var_6):\n print((var_4 - (var_2[var_1[var_5]] - 1)))\n\n\nif __name__ == \"__main__\":\n func_3()\n", "slow_time": 8948614458, "fast_time": 74281949, "speedup": 120.4682, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_7"} -{"pair_id": "python_13373", "problem_id": "p02815", "language": "python", "slow_code": "import sys\n\nvar_5 = lambda: sys.stdin.readline().rstrip()\nsys.setrecursionlimit(max(1000, 10**9))\nvar_10 = lambda var_11: sys.stdout.write(var_11 + \"\\n\")\nvar_6 = int(eval(var_5()))\nvar_2 = list(map(int, var_5().split()))\nvar_1 = 10**9 + 7\nvar_8 = [None] * var_6\nvar_9 = 1\nfor var_4 in range(var_6):\n var_8[var_4] = var_9\n var_9 *= 2\n var_9 %= var_1\nvar_2.sort()\nvar_2 = var_2[::-1]\nvar_3 = 0\nvar_3 += var_2[0] * (pow(2, 0, var_1)) * pow(2, var_6 - 1, var_1)\nfor var_4 in range(1, var_6):\n var_7 = var_2[var_4]\n var_3 += (\n var_7 * (var_8[var_4] + var_4 * var_8[var_4 - 1]) * var_8[var_6 - var_4 - 1]\n )\n var_3 %= var_1\nvar_3 *= pow(2, var_6, var_1)\nvar_3 %= var_1\nprint(var_3)\n", "fast_code": "var_4 = 10**9 + 7\nvar_5 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nvar_2 = sorted(var_2)\nvar_1 = 0\nvar_6 = pow(2, 2 * var_5 - 2, var_4)\nfor var_3 in range(var_5):\n var_1 += var_6 * (var_5 - var_3 + 1) * var_2[var_3]\n var_1 %= var_4\nprint((int(var_1)))\n", "slow_time": 45155406, "fast_time": 22302253, "speedup": 2.0247, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_2"} -{"pair_id": "python_16206", "problem_id": "p03721", "language": "python", "slow_code": "def func_1():\n var_6, var_5 = list(map(int, input().split()))\n var_2 = [0] * (10**5 + 1)\n for var_4 in range(var_6):\n var_1, var_3 = list(map(int, input().split()))\n var_2[var_1] += var_3\n for var_4 in range(len(var_2)):\n if var_2[var_4] >= var_5:\n print(var_4)\n break\n var_5 -= var_2[var_4]\n\n\nfunc_1()\n", "fast_code": "var_4, var_3 = list(map(int, input().split()))\nvar_1 = [list(map(int, input().split())) for _ in range(var_4)]\nvar_1.sort()\nvar_5 = 0\nfor var_2 in range(var_4):\n var_5 += var_1[var_2][1]\n if var_5 >= var_3:\n print((var_1[var_2][0]))\n break\n", "slow_time": 142852058, "fast_time": 30954946, "speedup": 4.6148, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_19"} -{"pair_id": "python_11897", "problem_id": "p02549", "language": "python", "slow_code": "var_8 = 998244353\n\n\nclass Class_1:\n def __init__(self, var_9, var_3=None):\n self.n = var_9\n self.data = [0] * var_9\n if var_3:\n assert var_9 == len(var_3)\n for var_2 in range(var_9):\n self.add(var_2, var_3[var_2])\n\n def func_1(self, var_2, var_13):\n assert 0 <= var_2 < self.n\n var_2 += 1\n while var_2 <= self.n:\n self.data[var_2 - 1] = (var_13 + self.data[var_2 - 1]) % var_8\n var_2 += var_2 & -var_2\n\n def func_3(self, var_2, var_13):\n self.add(var_2, var_13 - self.sum(var_2, var_2 + 1))\n\n def func_2(self, var_7, var_10):\n assert 0 <= var_7 <= var_10 <= self.n\n if var_7 != 0:\n return (self.sum(0, var_10) - self.sum(0, var_7)) % var_8\n var_11 = 0\n while var_10 > 0:\n var_11 = (var_11 + self.data[var_10 - 1]) % var_8\n var_10 -= var_10 & -var_10\n return var_11\n\n\nvar_9, var_6 = list(map(int, input().split()))\nvar_12 = []\nfor _ in range(var_6):\n var_7, var_10 = list(map(int, input().split()))\n var_12.append((var_7, var_10))\nvar_1 = Class_1(var_9)\nvar_1.add(0, 1)\nfor var_2 in range(1, var_9):\n for var_7, var_10 in var_12:\n var_4 = var_2 - var_7\n var_5 = max(var_2 - var_10, 0)\n if var_4 < 0:\n continue\n var_1.add(var_2, var_1.sum(var_5, var_4 + 1) % var_8)\nprint((var_1.sum(var_9 - 1, var_9) % var_8))\n", "fast_code": "var_7 = 998244353\nvar_6, var_4 = list(map(int, input().split()))\nvar_2 = [tuple(map(int, input().split())) for _ in range(var_4)]\nvar_1 = [0] * (2 * var_6 + 1)\nfor var_5, var_8 in var_2:\n var_1[var_5] += 1\n var_1[var_8 + 1] -= 1\nvar_9 = 0\nfor var_3 in range(1, var_6):\n var_9 = (var_9 + var_1[var_3]) % var_7\n for var_5, var_8 in var_2:\n var_1[var_3 + var_5] += var_9\n var_1[var_3 + var_8 + 1] -= var_9\nprint(var_9)\n", "slow_time": 213589573, "fast_time": 57668299, "speedup": 3.7038, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_1"} -{"pair_id": "python_3443", "problem_id": "p02955", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(100000)\nvar_13 = sys.stdin.readline\n\n\ndef func_7():\n return int(var_13())\n\n\ndef func_8():\n return list(map(int, var_13().split()))\n\n\ndef func_5():\n return float(var_13())\n\n\ndef func_6():\n return list(map(float, var_13().split()))\n\n\ndef func_9():\n return var_13().strip()\n\n\ndef func_10():\n return list(map(str, var_13().split()))\n\n\ndef func_2(*var_8):\n print(*var_8, file=sys.stderr)\n\n\ndef func_4(var_11):\n import time\n\n def func_12(*var_8, **var_14):\n var_19 = time.time()\n var_17 = var_11(*var_8, **var_14)\n var_10 = time.time()\n func_2(var_10 - var_19, \"sec\")\n return var_17\n\n return func_12\n\n\ndef func_1(var_15):\n for var_12 in range(1, int(var_15**0.5) + 1):\n if var_15 % var_12 == 0:\n yield var_12\n if var_12 != var_15 // var_12:\n yield var_15 // var_12\n\n\n@func_4\ndef func_11(var_4, var_3, var_1):\n var_5 = sum(var_1)\n var_2 = [var_15 for var_15 in func_1(var_5)]\n var_2.sort()\n var_7 = 0\n for var_9 in var_2:\n var_16 = []\n for var_6 in var_1:\n var_16.append(var_6 % var_9)\n var_16.sort()\n var_18 = [var_9 - var_15 for var_15 in var_16]\n var_20 = [0]\n var_21 = [0]\n for var_12 in range(var_4):\n var_20.append(var_20[-1] + var_16[var_12])\n var_21.append(var_21[-1] + var_18[var_12])\n for var_12 in range(var_4):\n var_10 = var_20[var_12 + 1] - var_20[0]\n var_11 = var_21[var_4] - var_21[var_12 + 1]\n if var_10 == var_11 and var_10 <= var_3:\n var_7 = max(var_7, var_9)\n break\n return var_7\n\n\ndef func_3():\n var_4, var_3 = func_8()\n var_1 = func_8()\n print(func_11(var_4, var_3, var_1))\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_8, var_7 = list(map(int, input().split()))\nvar_1 = [int(var_10) for var_10 in input().split()]\nvar_9 = sum(var_1)\nvar_3 = set()\nfor var_6 in range(1, int(var_9**0.5) + 1):\n if var_9 % var_6 == 0:\n var_3.add(var_6)\n var_3.add(var_9 // var_6)\nvar_2 = 0\nfor var_4 in var_3:\n var_5 = sorted([var_10 % var_4 for var_10 in var_1])\n\n var_2 = max(var_2, var_4) if sum(var_5[: -sum(var_5) // var_4]) <= var_7 else var_2\nprint(var_2)\n", "slow_time": 163270483, "fast_time": 48510373, "speedup": 3.3657, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_3"} -{"pair_id": "python_9552", "problem_id": "p02554", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_3 = 10**9 + 7\nvar_2 = 10**var_1 % var_3\nvar_2 -= 9**var_1 % var_3 + 9**var_1 % var_3\nvar_2 += 8**var_1 % var_3\nvar_2 %= var_3\nprint(var_2)\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = 10**9 + 7\nvar_3 = (\n pow(10, var_2, var_1) - 2 * pow(9, var_2, var_1) + pow(8, var_2, var_1)\n) % var_1\nprint(var_3)\n", "slow_time": 5752352271, "fast_time": 18576870, "speedup": 309.6513, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_9"} -{"pair_id": "python_9231", "problem_id": "p02883", "language": "python", "slow_code": "import math\n\nvar_3, var_1 = list(map(int, input().split()))\nvar_4 = [\n (var_6, var_5 * var_6)\n for var_5, var_6 in zip(\n sorted(list(map(int, input().split()))),\n sorted(list(map(int, input().split())))[::-1],\n )\n]\nvar_8, var_2, var_7 = 0, 10**12, 1\nexec(\n \"i,M,m=((i+m)//2,i,m) if sum(math.ceil(max(0,c-i)/b)for b, c in X)<=K else((i+M)//2,M,i);\"\n * 50\n)\nprint(var_2)\n", "fast_code": "import sys\n\n\ndef func_1():\n return sys.stdin.readline().rstrip()\n\n\ndef func_2():\n var_4, var_3 = list(map(int, func_1().split()))\n var_1 = list(map(int, func_1().split()))\n var_2 = list(map(int, func_1().split()))\n var_1.sort(reverse=True)\n var_2.sort()\n\n def func_3(var_6, var_7, var_5):\n var_8 = 0\n for var_9 in range(len(var_6)):\n var_8 += max(0, var_6[var_9] - var_5 // var_7[var_9])\n return var_8\n\n var_12 = 10**18 + 1\n var_11 = -1\n while var_12 - var_11 > 1:\n var_10 = (var_12 + var_11) // 2\n var_8 = func_3(var_1, var_2, var_10)\n if var_8 > var_3:\n var_11 = var_10\n else:\n var_12 = var_10\n print(var_12)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "slow_time": 822717967, "fast_time": 94104902, "speedup": 8.7426, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_17"} -{"pair_id": "python_7255", "problem_id": "p02683", "language": "python", "slow_code": "var_11, var_9, var_13 = list(map(int, input().split()))\nvar_7 = [list(map(int, input().split())) for _ in range(var_11)]\nvar_3 = [var_7[_][0] for _ in range(var_11)]\nvar_2 = [var_7[_][1:] for _ in range(var_11)]\nvar_1 = 1e9\nfor var_10 in range(2**15):\n var_5 = 0\n var_4 = [0 for _ in range(var_9)]\n for var_6 in range(var_11):\n if ((1 << var_6) & var_10) == 0:\n continue\n var_5 += var_3[var_6]\n for var_8 in range(var_9):\n var_4[var_8] += var_2[var_6][var_8]\n var_12 = 1\n for var_6 in range(var_9):\n if var_4[var_6] < var_13:\n var_12 = 0\n if var_12:\n var_1 = min(var_1, var_5)\nif var_1 == 1e9:\n var_1 = -1\nprint(var_1)\n", "fast_code": "var_12, var_11, var_14 = list(map(int, input().split()))\nvar_3 = [0] * var_12\nvar_1 = [[0 for _ in range(var_11)] for var_6 in range(var_12)]\nfor var_6 in range(var_12):\n var_10 = [int(_) for _ in input().split()]\n var_3[var_6] = var_10[0]\n for var_8 in range(var_11):\n var_1[var_6][var_8] = var_10[var_8 + 1]\nvar_7 = float(\"inf\")\nvar_2 = var_7\nfor var_6 in range(2**var_12):\n var_4 = 0\n var_5 = [0] * var_11\n for var_8 in range(var_12):\n if var_6 >> var_8 & 1:\n var_4 += var_3[var_8]\n for var_9 in range(var_11):\n var_5[var_9] += var_1[var_8][var_9]\n var_13 = True\n for var_15 in range(var_11):\n if var_5[var_15] < var_14:\n var_13 = False\n if var_13:\n var_2 = min(var_2, var_4)\nif var_2 == var_7:\n print((-1))\nelse:\n print(var_2)\n", "slow_time": 78624060680, "fast_time": 656203910, "speedup": 119.8165, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_10"} -{"pair_id": "python_16968", "problem_id": "p02804", "language": "python", "slow_code": "from collections import defaultdict\n\n\nclass Class_1:\n \"\"\"\"\"\"\n\n def __init__(self, var_13, var_10=10**9 + 7):\n self.mod = var_10\n self.modinv = self.make_modinv_list(var_13)\n self.fac, self.facinv = self.make_factorial_list(var_13)\n\n def __call__(self, var_12, var_14):\n return (\n self.fac[var_12]\n * self.facinv[var_14]\n % self.mod\n * self.facinv[var_12 - var_14]\n % self.mod\n )\n\n def func_2(self, var_12):\n\n var_7 = [1]\n var_8 = [1]\n for var_9 in range(1, var_12 + 1):\n var_7.append(var_7[var_9 - 1] * var_9 % self.mod)\n var_8.append(var_8[var_9 - 1] * self.modinv[var_9] % self.mod)\n return var_7, var_8\n\n def func_3(self, var_12):\n\n var_11 = [0] * (var_12 + 1)\n var_11[1] = 1\n for var_9 in range(2, var_12 + 1):\n var_11[var_9] = (\n self.mod - self.mod // var_9 * var_11[self.mod % var_9] % self.mod\n )\n return var_11\n\n\ndef func_1():\n\n var_3, var_2 = list(map(int, input().split()))\n var_1 = list(map(int, input().split()))\n var_1.sort()\n var_5 = 0\n var_10 = 10**9 + 7\n var_6 = Class_1(1000000)\n\n for var_9, var_4 in enumerate(var_1):\n if (var_3 - 1 - var_9) >= var_2 - 1:\n\n var_15 = var_6(var_3 - 1 - var_9, var_2 - 1)\n var_5 -= var_4 * var_15\n var_5 %= var_10\n else:\n break\n var_1.sort(reverse=True)\n for var_9, var_4 in enumerate(var_1):\n if (var_3 - 1 - var_9) >= var_2 - 1:\n\n var_15 = var_6(var_3 - 1 - var_9, var_2 - 1)\n var_5 += var_4 * var_15\n var_5 %= var_10\n else:\n break\n print(var_5)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_5, var_2, *var_1 = list(map(int, open(0).read().split()))\nvar_3 = 10**5 + 1\nvar_4 = 10**9 + 7\n\nvar_7 = [0] * (var_3 + 1)\nvar_7[0] = 1\nvar_7[1] = 1\nfor var_9 in range(2, var_3 + 1):\n var_7[var_9] = var_7[var_9 - 1] * var_9 % var_4\n\nvar_8 = [0] * (var_3 + 1)\nvar_8[var_3] = pow(var_7[var_3], var_4 - 2, var_4)\nfor var_9 in reversed(list(range(1, var_3 + 1))):\n var_8[var_9 - 1] = var_8[var_9] * var_9 % var_4\n\n\ndef func_1(var_11, var_10):\n if var_11 < var_10 or var_10 < 0:\n return 0\n return (var_7[var_11] * var_8[var_10] * var_8[var_11 - var_10]) % var_4\n\n\nvar_1.sort()\nvar_6 = 0\nfor var_9 in range(var_5):\n if var_9 >= var_2 - 1:\n var_6 += func_1(var_9, var_2 - 1) * var_1[var_9]\n if var_9 + var_2 - 1 < var_5:\n var_6 -= func_1(var_5 - var_9 - 1, var_2 - 1) * var_1[var_9]\n var_6 %= var_4\nprint(var_6)\n", "slow_time": 202297299246, "fast_time": 22415880220, "speedup": 9.0247, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_19"} -{"pair_id": "python_7371", "problem_id": "p03044", "language": "python", "slow_code": "import sys\n\nvar_18 = sys.stdin.readline\n\n\ndef func_5():\n return int(eval(var_18()))\n\n\ndef func_9():\n return list(map(int, var_18().rstrip().split()))\n\n\ndef func_8():\n return list(map(int, var_18().rstrip().split()))\n\n\ndef func_7():\n return list(var_18().rstrip())\n\n\n \n \nfrom queue import Queue\n\n\ndef func_4(var_13, var_30, var_29, var_33, var_8):\n var_16 = len(var_13)\n var_32 = len(var_13[0])\n var_10 = [[-1 for _j in range(var_32)] for _i in range(var_16)]\n var_26 = Queue()\n var_10[var_30][var_29] = 0\n var_26.put((var_30, var_29))\n var_12 = [1, -1, 0, 0, 1, 1, -1, -1]\n var_11 = [0, 0, 1, -1, 1, -1, 1, -1]\n\n def func_6(var_34, var_35):\n return 0 <= var_35 and var_35 < var_16 and 0 <= var_34 and var_34 < var_32\n\n while not var_26.empty():\n var_35, var_34 = var_26.get()\n for var_21 in range(var_8):\n var_25, var_24 = var_35 + var_12[var_21], var_34 + var_11[var_21]\n if not func_6(var_24, var_25) or var_13[var_25][var_24] == var_33:\n continue\n elif var_10[var_25][var_24] != -1:\n continue\n var_10[var_25][var_24] = var_10[var_35][var_34] + 1\n var_26.put((var_25, var_24))\n return var_10\n\n\n \ndef func_1():\n var_16, var_32 = func_9()\n var_28 = [[\"\" for _j in range(var_32)] for _i in range(var_16)]\n for var_17 in range(var_16):\n var_28[var_17] = func_7()\n var_10 = func_4(var_28, 0, 0, \"#\", 4)\n if var_10[var_16 - 1][var_32 - 1] < 0:\n print((-1))\n else:\n var_7 = 0\n for var_17 in range(var_16):\n for var_20 in range(var_32):\n var_7 += var_28[var_17][var_20] == \".\"\n print((var_7 - (var_10[var_16 - 1][var_32 - 1] + 1))) \n\n\n \n \n \n \ndef func_3():\n var_4, var_1 = func_9()\n var_30, var_29 = func_9()\n var_15, var_14 = func_9()\n var_28 = [[\"\" for _j in range(var_1)] for _i in range(var_4)]\n for var_17 in range(var_4):\n var_28[var_17] = func_7()\n var_10 = func_4(var_28, var_30 - 1, var_29 - 1, \"#\", 4) \n print((var_10[var_15 - 1][var_14 - 1])) \n\n\n \ndef func_2():\n var_3 = func_5()\n var_2 = [[] for var_17 in range(var_3)]\n for var_17 in range(var_3 - 1):\n var_5, var_6, var_32 = func_9()\n var_5 -= 1\n var_6 -= 1\n var_2[var_5].append((var_6, var_32))\n var_2[var_6].append((var_5, var_32))\n var_19 = True\n var_9 = [-1 for _ in range(var_3)]\n var_27 = Queue()\n for var_31 in range(var_3):\n if var_9[var_31] != -1:\n \n continue\n var_9[var_31] = 0\n var_27.put(var_31)\n while not var_27.empty():\n var_31 = var_27.get()\n for var_22, var_23 in var_2[var_31]:\n if var_9[var_22] == -1:\n var_9[var_22] = var_9[var_31] + var_23\n var_27.put(var_22)\n for var_17 in var_9:\n if var_17 % 2 == 0:\n print((0))\n else:\n print((1))\n\n\nif __name__ == \"__main__\":\n \n \n func_2()\n", "fast_code": "import sys\n\nvar_5 = sys.stdin.readline\nsys.setrecursionlimit(10**5)\n\n\ndef func_1(var_9, var_7, var_1):\n var_2[var_9] = var_1\n for var_3 in var_4[var_9]:\n if var_3[0] == var_7:\n continue\n if var_3[1] % 2:\n func_1(var_3[0], var_9, 1 - var_1)\n else:\n func_1(var_3[0], var_9, var_1)\n\n\nvar_6 = int(eval(var_5()))\nvar_2 = [-1] * var_6\nvar_4 = [[] for _ in range(var_6)]\nfor _ in range(var_6 - 1):\n var_8, var_9, var_10 = [int(var_11) for var_11 in var_5().split()]\n var_8, var_9 = var_8 - 1, var_9 - 1\n var_4[var_8].append((var_9, var_10))\n var_4[var_9].append((var_8, var_10))\nfunc_1(0, -1, 1)\nfor var_1 in var_2:\n print(var_1)\n", "slow_time": 204160464, "fast_time": 52309354, "speedup": 3.9029, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_28"} -{"pair_id": "python_4974", "problem_id": "p03606", "language": "python", "slow_code": "var_3 = int(eval(input()))\nvar_6 = [0] * (10**5 + 1)\nfor var_1 in range(var_3):\n var_2, var_4 = list(map(int, input().split()))\n var_6[var_2 - 1] += 1\n var_6[var_4] -= 1\nfor var_1 in range(1, 10**5):\n var_6[var_1] += var_6[var_1 - 1]\nvar_5 = 0\nfor var_1 in range(10**5):\n if var_6[var_1] == 1:\n var_5 += 1\nprint(var_5)\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = 0\nfor var_3 in range(var_1):\n var_4, var_5 = list(map(int, input().split()))\n var_2 += var_5 - var_4 + 1\nprint(var_2)\n", "slow_time": 11144169374, "fast_time": 19190279, "speedup": 580.7195, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_7"} -{"pair_id": "python_8056", "problem_id": "p03078", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(100000)\n\n\ndef func_6():\n return int(input())\n\n\ndef func_7():\n return list(map(int, input().split()))\n\n\ndef func_4():\n return float(input())\n\n\ndef func_5():\n return list(map(float, input().split()))\n\n\ndef func_8():\n return input().strip()\n\n\ndef func_9():\n return list(map(str, input().split()))\n\n\ndef func_1(*var_8):\n print(*var_8, file=sys.stderr)\n\n\ndef func_3(var_11):\n import time\n\n def func_12(*var_8, **var_15):\n func_10 = time.time()\n var_16 = var_11(*var_8, **var_15)\n var_10 = time.time()\n func_1(var_10 - func_10, \"sec\")\n return var_16\n\n return func_12\n\n\n@func_3\ndef func_11(var_1, var_2, var_3, var_4):\n var_1.sort(reverse=True)\n var_2.sort(reverse=True)\n var_3.sort(reverse=True)\n\n def func_10(var_12, var_13, var_14):\n return var_1[var_12] + var_2[var_13] + var_3[var_14]\n\n var_18 = set()\n var_9 = []\n if 1 < len(var_1):\n heapq.heappush(var_9, (-func_10(1, 0, 0), (1, 0, 0)))\n var_18.add((1, 0, 0))\n if 1 < len(var_2):\n heapq.heappush(var_9, (-func_10(0, 1, 0), (0, 1, 0)))\n var_18.add((0, 1, 0))\n if 1 < len(var_3):\n heapq.heappush(var_9, (-func_10(0, 0, 1), (0, 0, 1)))\n var_18.add((0, 0, 1))\n print(func_10(0, 0, 0))\n for _ in range(var_4 - 1):\n var_19, var_12 = heapq.heappop(var_9)\n print(-var_19)\n var_17 = (var_12[0] + 1, var_12[1], var_12[2])\n if var_17[0] < len(var_1) and var_17 not in var_18:\n heapq.heappush(var_9, (-func_10(*var_17), var_17))\n var_18.add(var_17)\n var_17 = (var_12[0], var_12[1] + 1, var_12[2])\n if var_17[1] < len(var_2) and var_17 not in var_18:\n heapq.heappush(var_9, (-func_10(*var_17), var_17))\n var_18.add(var_17)\n var_17 = (var_12[0], var_12[1], var_12[2] + 1)\n if var_17[2] < len(var_3) and var_17 not in var_18:\n heapq.heappush(var_9, (-func_10(*var_17), var_17))\n var_18.add(var_17)\n\n\ndef func_2():\n\n var_5, var_6, var_7, var_4 = func_7()\n var_1 = func_7()\n var_2 = func_7()\n var_3 = func_7()\n (func_11(var_1, var_2, var_3, var_4))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_9, var_10, var_11, var_6 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_3 = list(map(int, input().split()))\nvar_7 = []\nfor var_4 in var_1:\n for var_5 in var_2:\n var_7.append(var_4 + var_5)\nvar_7.sort(reverse=True)\nvar_7 = var_7[:var_6]\nvar_8 = []\nfor var_4 in var_7:\n for var_5 in var_3:\n var_8.append(var_4 + var_5)\nvar_8.sort(reverse=True)\nfor var_4 in range(var_6):\n print((var_8[var_4]))\n", "slow_time": 223697403, "fast_time": 76275599, "speedup": 2.9328, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_24"} -{"pair_id": "python_18280", "problem_id": "p02831", "language": "python", "slow_code": "var_1, var_2 = list(map(int, input().split()))\nvar_3 = 0\nfor var_4 in range(max(var_1, var_2), 0, -1):\n if var_1 % var_4 == 0 and var_2 % var_4 == 0:\n var_3 = var_4\n break\nprint((var_1 * var_2 // var_3))\n", "fast_code": "import sys\n\nvar_8 = sys.stdin\nsys.setrecursionlimit(10**7)\nvar_5 = lambda: int(var_7())\nvar_6 = lambda: list(map(int, var_8.readline().split()))\nvar_7 = lambda: var_8.readline().rstrip()\n\n\ndef func_1(var_3, var_4):\n while var_4:\n var_3, var_4 = var_4, var_3 % var_4\n return var_3\n\n\ndef func_2(var_3, var_4):\n return var_3 * var_4 // func_1(var_3, var_4)\n\n\nvar_1, var_2 = var_6()\nprint((func_2(var_1, var_2)))\n", "slow_time": 1631239856, "fast_time": 36632669, "speedup": 44.5296, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_7"} -{"pair_id": "python_9670", "problem_id": "p02554", "language": "python", "slow_code": "import sys\n\nvar_3 = sys.stdin\n\n\ndef func_5():\n return var_3.readline().rstrip()\n\n\ndef func_2():\n return int(var_3.readline().rstrip())\n\n\ndef func_4():\n return list(map(int, var_3.readline().split()))\n\n\ndef func_3():\n return list(map(int, var_3.readline().split()))\n\n\ndef func_1():\n var_2 = func_2()\n var_1 = 10**9 + 7\n print(\n (\n (\n pow(10, var_2) % var_1\n - (2 * pow(9, var_2)) % var_1\n + pow(8, var_2) % var_1\n )\n % var_1\n )\n )\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = 10**9 + 7\nvar_3 = pow(10, var_2, var_1)\nvar_5 = pow(9, var_2, var_1)\nvar_6 = pow(8, var_2, var_1)\nvar_4 = var_3 - 2 * var_5 + var_6\nprint((var_4 % var_1))\n", "slow_time": 3893757734, "fast_time": 22067599, "speedup": 176.4468, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_14"} -{"pair_id": "python_5530", "problem_id": "p03251", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(10000)\n\n\ndef func_6():\n return int(input())\n\n\ndef func_7():\n return list(map(int, input().split()))\n\n\ndef func_4():\n return float(input())\n\n\ndef func_5():\n return list(map(float, input().split()))\n\n\ndef func_8():\n return input().strip()\n\n\ndef func_9():\n return list(map(str, input().split()))\n\n\ndef func_1(*var_5):\n print(*var_5, file=sys.stderr)\n\n\ndef func_3(var_7):\n import time\n\n def func_11(*var_5, **var_9):\n var_13 = time.time()\n var_12 = var_7(*var_5, **var_9)\n var_6 = time.time()\n func_1(var_6 - var_13, \"sec\")\n return var_12\n\n return func_11\n\n\n@func_3\ndef func_10(var_2, var_1, var_3, var_4, var_14, var_15):\n var_10 = max(var_14)\n var_11 = min(var_15)\n func_1(var_10, var_11)\n if var_10 >= var_11:\n return \"War\"\n for var_8 in range(var_10 + 1, var_11 + 1):\n if var_3 < var_8 <= var_4:\n return \"No War\"\n return \"War\"\n\n\ndef func_2():\n var_2, var_1, var_3, var_4 = func_7()\n var_14 = func_7()\n var_15 = func_7()\n print(func_10(var_2, var_1, var_3, var_4, var_14, var_15))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_2, var_1, var_3, var_4 = list(map(int, input().split()))\nvar_6 = sorted(list(map(int, input().split())))\nvar_7 = sorted(list(map(int, input().split())))\nfor var_5 in range(var_3 + 1, var_4 + 1):\n if var_6[-1] < var_5 <= var_7[0]:\n print(\"No War\")\n break\nelse:\n print(\"War\")\n", "slow_time": 90641474, "fast_time": 24072137, "speedup": 3.7654, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_9"} -{"pair_id": "python_430", "problem_id": "p03160", "language": "python", "slow_code": "def func_2(var_3, var_4):\n return var_4 if var_3 > var_4 else var_3\n\n\ndef func_1(var_3, var_4):\n return var_4 if var_3 < var_4 else var_3\n\n\ndef func_3(var_2, var_6):\n var_1 = 10**9\n var_5 = [var_1] * (10**5 + 10)\n var_5[0] = 0\n var_5[1] = abs(var_6[1] - var_6[0])\n for var_7 in range(2, var_2):\n var_5[var_7] = func_2(\n var_5[var_7], var_5[var_7 - 1] + abs(var_6[var_7] - var_6[var_7 - 1])\n )\n var_5[var_7] = func_2(\n var_5[var_7], var_5[var_7 - 2] + abs(var_6[var_7] - var_6[var_7 - 2])\n )\n return var_5[var_2 - 1]\n\n\nif __name__ == \"__main__\":\n var_2 = int(eval(input()))\n var_6 = list(map(int, input().split()))\n print((func_3(var_2, var_6)))\n", "fast_code": "import sys\n\nsys.setrecursionlimit(2147483647)\nvar_2 = float(\"inf\")\nvar_3 = 10**9 + 7\nvar_6 = sys.stdin.readline\n\n\ndef func_1():\n var_7 = int(eval(var_6()))\n var_1 = list(map(int, var_6().split()))\n var_4 = [0] * var_7\n var_4[1] = abs(var_1[1] - var_1[0])\n for var_5 in range(2, var_7):\n var_4[var_5] = min(\n var_4[var_5 - 1] + abs(var_1[var_5] - var_1[var_5 - 1]),\n var_4[var_5 - 2] + abs(var_1[var_5] - var_1[var_5 - 2]),\n )\n print((var_4[var_7 - 1]))\n\n\nfunc_1()\n", "slow_time": 117408668, "fast_time": 44646815, "speedup": 2.6297, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_7"} -{"pair_id": "python_8129", "problem_id": "p03352", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_2 = 1\nfor var_3 in range(1, 1000):\n for var_4 in range(2, 1000):\n var_5 = var_3**var_4\n if var_5 > var_1:\n break\n var_2 = max(var_2, var_5)\nprint(var_2)\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = 1\nif var_4 == 1:\n print((1))\nelse:\n var_2 = 2\n while var_2**2 <= var_4:\n var_3 = 2\n while var_2**var_3 <= var_4:\n var_1 = max(var_2**var_3, var_1)\n var_3 += 1\n var_2 += 1\n print(var_1)\n", "slow_time": 300783133, "fast_time": 28624218, "speedup": 10.508, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_19"} -{"pair_id": "python_3597", "problem_id": "p02934", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\nvar_3 = 10**20\nvar_5 = 10**9 + 7\nvar_1 = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nvar_2 = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef func_2():\n return [int(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_3():\n return [int(var_8) - 1 for var_8 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_4():\n return sys.stdin.readline().split()\n\n\ndef func_5():\n return eval(input())\n\n\ndef func_6():\n var_6 = func_1()\n var_4 = func_2()\n var_7 = 0\n for var_8 in var_4:\n var_7 += 1 / var_8\n return 1 / var_7\n\n\nprint((func_6()))\n", "fast_code": "var_1 = int(eval(input()))\nvar_3 = list(map(int, input().split()))\nvar_2 = 1 / sum(1 / var_4 for var_4 in var_3)\nprint(var_2)\n", "slow_time": 79645167, "fast_time": 20024179, "speedup": 3.9774, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_15"} -{"pair_id": "python_17518", "problem_id": "p02615", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(1 << 25)\nvar_15 = sys.stdin.readline\nvar_14 = range\nvar_11 = enumerate\n\n\ndef func_2(*var_8, **var_13):\n print(*var_8, **var_13)\n sys.exit()\n\n\ndef func_5(*var_8, var_17=1):\n return list(map(lambda var_18: var_18 - var_17, var_8))\n\n\n \ndef func_1():\n return int(var_15())\n\n\ndef func_3():\n return list(map(int, var_15().split()))\n\n\ndef func_6(var_2):\n\\\n\\\n \n var_16 = []\n for _ in range(var_2):\n var_16.append(list(map(int, var_15().split())))\n return tuple(map(list, zip(*var_16)))\n\n\ndef func_8(var_2):\n \n var_16 = []\n for _ in range(var_2):\n var_16.append(tuple(map(int, var_15().split())))\n return var_16\n\n\ndef func_7(var_2):\n \n var_16 = []\n for _ in range(var_2):\n var_16.append(list(map(int, var_15().split())))\n return var_16\n \n\n\nvar_4 = 10**9 + 7\nvar_3 = 2**31 \n \nfrom collections import defaultdict, Counter, deque\nfrom operator import itemgetter, xor, add\nfrom itertools import product, permutations, combinations\nfrom bisect import bisect_left, bisect_right \nfrom functools import reduce\nfrom math import gcd\n\n\ndef func_4(var_6, var_9):\n \n var_12 = gcd(var_6, var_9)\n return var_6 // var_12 * var_9\n\n\n \n \nvar_5 = func_1()\nvar_1 = func_3()\nvar_1.sort(reverse=True)\nvar_7 = var_1[0]\nvar_10 = 1\nfor var_6 in var_1[1:]:\n if var_10 == var_5 - 1:\n break\n var_7 += var_6\n var_10 += 1\n if var_10 == var_5 - 1:\n break\n var_7 += var_6\n var_10 += 1\nprint(var_7)\n", "fast_code": "def func_1():\n import sys\n\n var_5 = sys.stdin.readline\n var_2 = int(eval(var_5()))\n var_1 = list(map(int, var_5().split()))\n var_1.sort(reverse=True)\n var_3 = var_1[0]\n for var_4 in range(2, var_2):\n var_3 += var_1[var_4 // 2]\n print(var_3)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 122798898, "fast_time": 30847405, "speedup": 3.9809, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_10"} -{"pair_id": "python_9381", "problem_id": "p02675", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nimport bisect\n\nvar_2 = 10**13\nvar_4 = 10**9 + 7\n\n\ndef func_12():\n return sys.stdin.readline().strip()\n\n\ndef func_11(var_7, var_8):\n return var_7 if var_8 == 0 else func_11(var_8, var_7 % var_8)\n\n\ndef func_13(var_7, var_8):\n return (var_7 * var_8) // func_11(var_7, var_8)\n\n\ndef func_1():\n return int(func_12())\n\n\ndef func_2():\n return [int(var_7) for var_7 in func_12().split()]\n\n\ndef func_7(var_5):\n return [int(func_12()) for _ in range(var_5)]\n\n\ndef func_3(var_5):\n return [[int(var_7) for var_7 in func_12().split()] for _ in range(var_5)]\n\n\ndef func_5():\n return func_12().split()\n\n\ndef func_8(var_5):\n return [func_12() for _ in range(var_5)]\n\n\ndef func_4(var_5):\n return [func_12().split() for _ in range(var_5)]\n\n\ndef func_6(var_3):\n print(*var_3, sep=\"\\n\")\n\n\ndef func_10(var_1):\n print(\"Yes\" if var_1 else \"No\")\n\n\ndef func_9(var_1):\n print(\"YES\" if var_1 else \"NO\")\n\n\nvar_5 = func_12()\nvar_6 = int(var_5[-1])\nif var_6 in [2, 4, 5, 7, 9]:\n print(\"hon\")\nelif var_6 in [0, 1, 6, 8]:\n print(\"pon\")\nelse:\n print(\"bon\")\n", "fast_code": "var_1 = input()[-1]\nif var_1 == \"3\":\n print(\"bon\")\nelif var_1 in \"0168\":\n print(\"pon\")\nelse:\n print(\"hon\")\n", "slow_time": 116219356, "fast_time": 12623568, "speedup": 9.2065, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_2"} -{"pair_id": "python_6737", "problem_id": "p03198", "language": "python", "slow_code": "import collections, atexit, math, sys, bisect\n\nsys.setrecursionlimit(1000000)\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ntry:\n\n import numpy\n\n def func_1(*var_2, **var_10):\n\n print(*var_2, file=sys.stderr)\n\n func_1(\"debug mode\")\nexcept Exception:\n\n def func_1(*var_2, **var_10):\n pass\n\n\nvar_9 = 0\nvar_13 = 0\nif var_9 > 0:\n func_1(\"use input\", var_9)\n sys.stdin = open(\"input\" + str(var_9) + \".txt\", \"r\")\nif var_13 > 0:\n func_1(\"use output\", var_13)\n sys.stdout = open(\"stdout\" + str(var_13) + \".txt\", \"w\")\n atexit.register(lambda: sys.stdout.close())\nif True:\n (var_1,) = func_2()\n\n var_20 = func_2()\nelse:\n var_1 = 100\n import random\n\n var_20 = [random.randint(1, 1000000000) for var_8 in range(var_1)]\nfunc_1(\"begin\")\nvar_21 = [0 for var_8 in range(var_1 + 1)]\nvar_23 = [0 for var_8 in range(var_1 + 1)]\n\n\ndef func_3(var_22, var_20):\n var_22[0] = 0\n var_15 = []\n for var_8 in range(var_1):\n if var_8 % 10000 == 0:\n func_1(\"---\", var_8)\n var_12 = [[var_20[var_8], 0], [var_20[var_8], 0], 1]\n var_15.append(var_12)\n var_11 = var_22[var_8]\n\n while len(var_15) > 1:\n var_5 = var_15[-2][1][1]\n var_3 = var_15[-1][0][1]\n var_7 = min(var_3, var_5)\n var_3 -= var_7\n var_5 -= var_7\n var_4 = 4**var_3\n var_6 = 4**var_5\n var_17 = var_15[-2][1][0] * var_6\n var_16 = var_15[-1][0][0] * var_4\n if var_17 < var_16:\n var_11 += 2 * var_15[-2][2]\n var_15[-2][0][1] += 1\n var_15[-2][1][1] += 1\n elif var_17 < var_16 * 4:\n var_19 = [var_15[-2][0], var_15[-1][1], var_15[-2][2] + var_15[-1][2]]\n var_15[-2] = var_19\n var_15.pop()\n else:\n break\n\n var_22[var_8 + 1] = var_11\n\n assert var_11 < 1000000000000000\n func_1(var_15)\n\n\nfunc_3(var_21, var_20)\nfunc_1(\"!!!!\")\nfunc_3(var_23, var_20[::-1])\n\n\nvar_14 = var_23[var_1]\nfor var_8 in range(var_1 + 1):\n var_18 = var_8 + var_21[var_8] + var_23[var_1 - var_8]\n var_14 = min(var_14, var_18)\nprint(var_14)\nfunc_1(\"end\")\n", "fast_code": "from sys import stdin\nfrom itertools import repeat\n\n\ndef func_1(var_1):\n var_8 = len(var_1)\n var_7 = [0] * (var_8 + 1)\n var_13 = [(0, 0, 0, 1)]\n var_10 = var_13.append\n var_9 = var_13.pop\n for var_5 in range(1, var_8):\n var_2 = 0\n var_12 = var_5\n var_14 = 0\n var_6 = 1\n while var_13:\n var_16 = var_1[var_12] << var_14\n var_15 = var_1[var_13[-1][0]]\n if var_15 >= var_16:\n break\n _, var_12, var_14, var_11 = var_9()\n var_4 = 0\n while var_15 < var_16:\n var_15 *= 4\n var_4 += 2\n var_2 += var_4 * var_11\n var_6 += var_11\n var_14 += var_4\n var_10((var_5, var_12, var_14, var_6))\n var_7[var_5 + 1] = var_7[var_5] + var_2\n return var_7\n\n\ndef func_2():\n var_8 = int(stdin.readline())\n var_1 = list(map(int, stdin.readline().split(), repeat(10, var_8)))\n var_7 = func_1(var_1)\n var_12 = func_1(var_1[::-1])[::-1]\n var_3 = 10**12\n for var_5 in range(var_8 + 1):\n if var_3 > var_7[var_5] + var_5 + var_12[var_5]:\n var_3 = var_7[var_5] + var_5 + var_12[var_5]\n print(var_3)\n\n\nfunc_2()\n", "slow_time": 188083795, "fast_time": 81873885, "speedup": 2.2972, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_5"} -{"pair_id": "python_13608", "problem_id": "p00447", "language": "python", "slow_code": "var_1 = [[False] * 1000001] * 1000001\nwhile True:\n var_7 = int(eval(input()))\n if var_7 == 0:\n break\n var_9 = tuple(tuple(map(int, input().split())) for var_5 in range(var_7))\n var_11, var_12 = var_9[0]\n var_8 = int(eval(input()))\n var_10 = [tuple(map(int, input().split())) for var_5 in range(var_8)]\n for var_5 in range(var_8):\n var_1[var_10[var_5][0]][var_10[var_5][1]] = True\n for var_5 in range(var_8):\n var_4 = True\n for var_6 in range(len(var_9)):\n var_2 = var_10[var_5][0] + var_9[var_6][0] - var_11\n var_3 = var_10[var_5][1] + var_9[var_6][1] - var_12\n if (\n 0 <= var_2 <= 1000000\n and 0 <= var_3 <= 1000000\n and var_1[var_2][var_3] == False\n ):\n var_4 = False\n break\n if var_4 == True:\n print(\n (\n \"{} {}\".format(\n str(var_10[var_5][0] - var_11), str(var_10[var_5][1] - var_12)\n )\n )\n )\n break\n", "fast_code": "for var_3 in iter(input, \"0\"):\n var_1 = sorted(\n [list(map(int, input().split())) for _ in [0] * int(var_3)],\n key=lambda var_8: var_8[0],\n )\n var_2 = sorted(\n [list(map(int, input().split())) for _ in [0] * int(eval(input()))],\n key=lambda var_8: var_8[0],\n )\n for var_4, var_5 in var_2:\n var_6, var_7 = var_1[0]\n var_8, var_9 = var_4 - var_6, var_5 - var_7\n for var_6, var_7 in var_1:\n if [var_6 + var_8, var_7 + var_9] not in var_2:\n break\n else:\n print((var_8, var_9))\n", "slow_time": 118527115, "fast_time": 53152069, "speedup": 2.23, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_6"} -{"pair_id": "python_2678", "problem_id": "p02630", "language": "python", "slow_code": "var_3 = lambda: [*list(map(int, input().split()))]\nvar_3()\nvar_7, *var_5 = [0] * 100002\nfor var_4 in var_3():\n var_7 += var_4\n var_5[var_4] += 1\nvar_6 = var_3()[0]\nfor _ in range(var_6):\n var_1, var_2 = var_3()\n var_7 += (var_2 - var_1) * var_5[var_1]\n var_5[var_2] += var_5[var_1]\n var_5[var_1] = 0\n print(var_7)\n", "fast_code": "from collections import *\n\neval(input())\nvar_6 = sum(var_1 := list(map(int, input().split())))\nvar_1 = var_2(var_1)\nfor var_5 in range(int(eval(input()))):\n var_3, var_4 = list(map(int, input().split()))\n var_6 += (var_4 - var_3) * var_1[var_3]\n var_1[var_4] += var_1[var_3]\n var_1[var_3] = 0\n print(var_6)\n", "slow_time": 246048618, "fast_time": 41769197, "speedup": 5.8907, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_23"} -{"pair_id": "python_17834", "problem_id": "p02586", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7) \nimport math\nfrom copy import copy, deepcopy\nfrom copy import deepcopy as dcp\nfrom operator import itemgetter\nfrom bisect import bisect_left, bisect, bisect_right \n\n \nfrom collections import deque, defaultdict\n\n \n \nfrom collections import Counter \n\n \nfrom itertools import accumulate, combinations, permutations, product \n\n \nfrom heapq import heapify, heappop, heappush\n\n \nfrom functools import reduce, lru_cache \n\n \nfrom decimal import Decimal\n\n\ndef func_6():\n var_29 = sys.stdin.readline()\n return var_29[:-1] if var_29[-1] == \"\\n\" else var_29\n\n\ndef func_11(*var_29):\n print(\"## \", *var_29, file=sys.stderr)\n\n\ndef func_12(var_19):\n _ = print(*var_19, sep=\"\\n\") if var_19 else None\n\n\ndef func_3(var_26, var_25=False):\n var_16 = sorted(range(len(var_26)), key=lambda var_18: var_26[var_18])\n if var_25:\n return var_16, [var_26[var_15] for var_15 in var_16]\n return var_16\n\n\ndef func_2(var_10, var_11=False):\n return ord(var_10) - 97 if not var_11 else ord(var_10) - 65\n\n\ndef func_10(var_15, var_11=False):\n return chr(var_15 + 97) if not var_11 else chr(var_15 + 65)\n\n\ndef func_8(var_1, var_2):\n var_4, var_6, var_5 = len(var_2), len(var_1), len(var_2[0])\n return [\n [sum([(var_1[var_15][var_18] * var_2[var_18][var_17]) for var_18 in range(var_4)]) for var_17 in range(var_5)]\n for var_15 in range(var_6)\n ]\n\n\ndef func_9(var_5, var_28):\n var_6, var_27 = len(var_28), len(var_5)\n return [sum([var_5[var_15][var_17] * var_28[var_17] for var_17 in range(var_6)]) for var_15 in range(var_27)]\n\n\ndef func_1(var_5):\n var_22, var_20 = len(var_5), len(var_5[0])\n return [[var_5[var_17][var_15] for var_17 in range(var_22)] for var_15 in range(var_20)]\n\n\ndef func_4(var_29):\n return bin(var_29)[2:]\n\n\ndef func_5(var_29): \n var_29 = var_29 - ((var_29 >> 1) & 0x5555555555555555)\n var_29 = (var_29 & 0x3333333333333333) + ((var_29 >> 2) & 0x3333333333333333)\n var_29 = (var_29 + (var_29 >> 4)) & 0x0F0F0F0F0F0F0F0F\n var_29 += var_29 >> 8\n var_29 += var_29 >> 16\n var_29 += var_29 >> 32\n return var_29 & 0x7F\n\n\ndef func_7():\n var_21 = 1000000007\n \n \n var_7, var_3, var_4 = map(int, func_6().split())\n \n \n var_9 = 5000\n var_8 = []\n for var_15 in range(var_4):\n var_24, var_10, var_28 = map(int, func_6().split())\n var_24 -= 1\n var_10 -= 1\n var_8.append((var_24 * var_9 + var_10, var_28))\n var_8.sort(key=itemgetter(0))\n var_23 = 0\n var_13 = [[0] * 4 for _ in range(var_3)]\n var_14 = [[0] * 4 for _ in range(var_3)]\n for var_15 in range(var_7):\n for var_17 in range(var_3):\n var_12 = 0\n if var_23 < var_4 and var_15 * var_9 + var_17 == var_8[var_23][0]:\n var_12 = var_8[var_23][1]\n var_23 += 1\n if var_17 > 0:\n var_14[var_17] = copy(var_14[var_17 - 1])\n else:\n var_14[0] = [0] * 4\n if var_15 > 0:\n var_14[var_17][0] = max(var_13[var_17], var_14[var_17][0])\n if var_12 != 0:\n for var_18 in range(2, -1, -1):\n var_14[var_17][var_18 + 1] = max(var_14[var_17][var_18] + var_12, var_14[var_17][var_18 + 1])\n \n var_13[var_17] = max(var_14[var_17])\n print(var_13[-1])\n\n\nif __name__ == \"__main__\":\n func_7()\n", "fast_code": "import sys\n\nvar_15 = sys.stdin.read\nvar_16 = sys.stdin.readline\nvar_17 = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nvar_2 = 1 << 60\nvar_4 = 1000000007\n\n\ndef func_1():\n var_5, var_1, var_3, *var_6 = list(map(int, var_15().split()))\n var_11 = [[0] * var_1 for _ in range(var_5)]\n for var_14, var_7, var_18 in zip(*[iter(var_6)] * 3):\n var_11[var_14 - 1][var_7 - 1] = var_18\n var_8 = [0] * (var_1 + 1)\n for var_10 in range(var_5):\n var_8, var_9 = [0] * (var_1 + 1), var_8\n var_18 = [0] * 4\n for var_12 in range(var_1):\n for var_13 in range(4):\n if var_18[var_13] < var_9[var_12 + 1]:\n var_18[var_13] = var_9[var_12 + 1]\n if var_11[var_10][var_12] > 0:\n for var_13 in range(2, -1, -1):\n if var_18[var_13 + 1] < var_18[var_13] + var_11[var_10][var_12]:\n var_18[var_13 + 1] = var_18[var_13] + var_11[var_10][var_12]\n var_8[var_12 + 1] = var_18[3]\n print((var_8[var_1]))\n return\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 163255328, "fast_time": 52697977, "speedup": 3.0979, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_27"} -{"pair_id": "python_11472", "problem_id": "p03504", "language": "python", "slow_code": "var_8, var_1 = list(map(int, input().split()))\nvar_2 = [tuple(map(int, input().split())) for _ in range(var_8)]\nvar_7 = 2 * 10**5 + 2\nvar_3 = [0] * var_7\nfor var_11 in range(1, var_1 + 1):\n var_4 = [0] * var_7\n for var_9, var_10, var_5 in var_2:\n if var_5 == var_11:\n\n var_4[2 * var_9 - 1] += 1\n var_4[2 * var_10] -= 1\n for var_6 in range(1, var_7):\n var_4[var_6] += var_4[var_6 - 1]\n for var_6 in range(var_7):\n if var_4[var_6] > 0:\n var_3[var_6] += 1\nprint((max(var_3)))\n", "fast_code": "import sys\nimport math\nimport collections\nimport bisect\nimport itertools\n\nsys.setrecursionlimit(10**7)\nvar_1 = 10**16\nvar_2 = 10**9 + 7\n\nvar_13 = lambda: int(sys.stdin.readline().rstrip())\nvar_14 = lambda: list(map(int, sys.stdin.readline().rstrip().split()))\nvar_11 = lambda: list(map(int, sys.stdin.readline().rstrip().split()))\nvar_12 = lambda: list(\n [int(var_19) - 1 for var_19 in sys.stdin.readline().rstrip().split()]\n)\n\n\ndef func_1():\n var_10, var_4 = var_14()\n var_9 = 10**5\n var_17 = [[0 for _ in range(var_9 + 10)] for __ in range(var_4)]\n for _ in range(var_10):\n var_15, var_16, var_5 = var_14()\n var_5 -= 1\n var_17[var_5][var_15] += 1\n var_17[var_5][var_16] -= 1\n var_3 = 0\n var_18 = 0\n for var_7 in range(var_9 + 10):\n var_6 = 0\n for var_8 in range(var_4):\n if var_17[var_8][var_7] > 0:\n var_18 += var_17[var_8][var_7]\n else:\n var_6 += var_17[var_8][var_7]\n var_3 = max(var_3, var_18)\n var_18 += var_6\n print(var_3)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 88725171847, "fast_time": 21596077008, "speedup": 4.1084, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_4"} -{"pair_id": "python_9946", "problem_id": "p03806", "language": "python", "slow_code": "var_4, var_2, var_3 = list(map(int, input().split()))\nvar_1 = 10000\nvar_11 = [[var_1 for var_8 in range(401)] for var_5 in range(401)]\nvar_11[0][0] = 0\nfor var_12 in range(1, var_4 + 1):\n var_6, var_9, var_10 = list(map(int, input().split()))\n for var_5 in range(400, -1, -1):\n for var_8 in range(400, -1, -1):\n if var_5 - var_6 >= 0 and var_8 - var_9 >= 0:\n var_11[var_5][var_8] = min(\n var_11[var_5][var_8], var_11[var_5 - var_6][var_8 - var_9] + var_10\n )\nvar_7 = var_1\nfor var_13 in range(1, 401):\n if var_2 * var_13 > 400 or var_3 * var_13 > 400:\n break\n var_7 = min(var_7, var_11[var_2 * var_13][var_3 * var_13])\nprint((var_7 if var_7 != var_1 else -1))\n", "fast_code": "import sys\nfrom collections import deque\nimport copy\n\n\ndef func_3(var_15):\n if var_15 == None:\n return var_22\n else:\n return var_15.readline\n\n\ndef func_1(var_6, var_3, var_4):\n\n var_13 = {}\n var_13[(0, 0)] = 0\n var_13[(var_6[0][0], var_6[0][1])] = var_6[0][2]\n\n var_19 = sys.maxsize\n var_21 = copy.deepcopy(var_13)\n for var_16 in range(1, len(var_6)):\n for var_12 in var_13:\n var_10 = var_13[var_12]\n var_20 = (var_12[0] + var_6[var_16][0], var_12[1] + var_6[var_16][1])\n if var_20 not in var_13:\n var_21[var_20] = var_10 + var_6[var_16][2]\n else:\n var_21[var_20] = min(var_13[var_20], var_10 + var_6[var_16][2])\n if var_20[1] * var_3 == var_20[0] * var_4:\n if var_21[var_20] < var_19:\n var_19 = var_21[var_20]\n var_13 = copy.deepcopy(var_21)\n return var_19\n\n\ndef func_2(var_6, var_3, var_4, var_1, var_2):\n var_11 = [\n [sys.maxsize for var_16 in range(var_1 + 1)] for var_18 in range(var_2 + 1)\n ]\n var_11[0][0] = 0\n for var_16 in range(len(var_6)):\n for var_7 in range(var_1, -1, -1):\n for var_8 in range(var_2, -1, -1):\n if var_11[var_7][var_8] >= sys.maxsize:\n continue\n if (\n var_7 + var_6[var_16][0] <= var_1\n and var_8 + var_6[var_16][1] <= var_2\n ):\n var_11[var_7 + var_6[var_16][0]][var_8 + var_6[var_16][1]] = min(\n var_11[var_7 + var_6[var_16][0]][var_8 + var_6[var_16][1]],\n var_11[var_7][var_8] + var_6[var_16][2],\n )\n var_19 = sys.maxsize\n for var_7 in range(0, var_1):\n for var_8 in range(0, var_2):\n if var_7 * var_4 == var_8 * var_3 and var_7 != 0 and var_8 != 0:\n if var_11[var_7][var_8] < var_19:\n var_19 = var_11[var_7][var_8]\n return var_19\n\n\ndef func_4():\n if len(sys.argv) > 1:\n var_14 = open(sys.argv[1])\n else:\n var_14 = None\n var_23 = func_3(var_14)\n var_17 = var_23().strip().split()\n [var_5, var_3, var_4] = [int(var_17[0]), int(var_17[1]), int(var_17[2])]\n var_6 = []\n for var_16 in range(var_5):\n var_17 = var_23().strip().split()\n [var_7, var_8, var_9] = [int(var_17[0]), int(var_17[1]), int(var_17[2])]\n var_6.append((var_7, var_8, var_9))\n\n var_10 = func_2(var_6, var_3, var_4, var_5 * 10, var_5 * 10)\n if var_10 < sys.maxsize:\n print(var_10)\n else:\n print(-1)\n\n\nif __name__ == \"__main__\":\n func_4()\n", "slow_time": 48898548578, "fast_time": 180056695, "speedup": 271.5731, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_7"} -{"pair_id": "python_15111", "problem_id": "p02948", "language": "python", "slow_code": "var_8, var_7 = list(map(int, input().split()))\nvar_2 = [[] for _ in range(10**5)]\nfor var_5 in range(var_8):\n var_1, var_4 = list(map(int, input().split()))\n var_1 -= 1\n var_2[var_1].append(var_4)\nimport heapq\n\nvar_9 = []\nheapq.heapify(var_9)\nvar_3 = 0\nfor var_5 in range(var_7):\n if len(var_2[var_5]) != 0:\n for var_6 in range(len(var_2[var_5])):\n heapq.heappush(var_9, -1 * var_2[var_5][var_6])\n if len(var_9) != 0:\n var_3 += -1 * heapq.heappop(var_9)\nprint(var_3)\n", "fast_code": "from heapq import *\n\nvar_2, var_1, *var_8 = list(map(int, open(0).read().split()))\nvar_9 = [[] for _ in \"_\" * var_1]\nvar_10 = var_5 = 0\nfor _ in \"_\" * var_2:\n var_1 < var_8[var_5] or var_9[var_8[var_5] - 1].append(var_8[var_5 + 1])\n var_5 += 2\nvar_7 = []\nfor var_5 in var_9:\n for var_6 in var_5:\n var_4(var_7, -var_6)\n var_10 -= len(var_7) and var_3(var_7)\nprint(var_10)\n", "slow_time": 3133712263, "fast_time": 48917213, "speedup": 64.0615, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_29"} -{"pair_id": "python_12815", "problem_id": "p03210", "language": "python", "slow_code": "import sys\n\nvar_2 = set(\"753\")\nvar_3 = sys.stdin.readline().rstrip()\n\n\ndef func_1():\n var_1 = \"YES\" if var_3 in var_2 else \"NO\"\n print(var_1)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "print(\"YES\") if input() in [\"3\", \"5\", \"7\"] else print(\"NO\")\n", "slow_time": 17824204, "fast_time": 8061803, "speedup": 2.2109, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_18"} -{"pair_id": "python_3555", "problem_id": "p03077", "language": "python", "slow_code": "import sys\n\nvar_13 = lambda var_12: [int(var_3) for var_3 in var_12.split(\" \")]\nvar_15 = lambda var_14: [int(var_12) for var_12 in list(var_14)]\nvar_16 = lambda var_14: [var_13(var_12) for var_12 in list(var_14)]\nvar_6 = lambda: sys.stdin.readline().rstrip()\nvar_4 = lambda: int(var_6())\nvar_5 = lambda: var_13(var_6())\nvar_9 = lambda var_11: [sys.stdin.readline() for _ in range(var_11)]\nvar_7 = lambda var_11: var_15(var_9(var_11))\nvar_8 = lambda var_11: var_16(var_9(var_11))\nimport math\n\n\ndef func_1():\n var_2 = var_4()\n var_1 = var_7(5)\n var_10 = min(var_1)\n var_11 = int(math.ceil(var_2 / var_10)) + 4\n print(var_11)\n\n\nfunc_1()\n", "fast_code": "var_2, *var_1 = eval(\"int(input()),\" * 6)\nprint((4 - -var_2 // min(var_1)))\n", "slow_time": 74979366, "fast_time": 20357921, "speedup": 3.6831, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_24"} -{"pair_id": "python_17386", "problem_id": "p02681", "language": "python", "slow_code": "from typing import *\nimport itertools\nimport math\nimport sys\n\nvar_1 = float(\"inf\")\nvar_5 = \"Yes\"\nvar_2 = \"No\"\n\n\ndef func_3(var_3: str, var_4: str):\n return [var_2, var_5][var_3 == var_4[:-1]]\n\n\ndef func_2():\n sys.setrecursionlimit(10**6)\n\n def func_1():\n for var_6 in sys.stdin:\n for var_8 in var_6.split():\n yield var_8\n\n var_7 = func_1()\n var_3 = next(var_7)\n var_4 = next(var_7)\n print((func_3(var_3, var_4)))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_1 = input()\nvar_2 = input()\nprint(\"Yes\") if var_2 == var_1 + var_2[-1] else print(\"No\")\n", "slow_time": 55931194, "fast_time": 10284365, "speedup": 5.4385, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_16"} -{"pair_id": "python_10839", "problem_id": "p02935", "language": "python", "slow_code": "import math\nimport statistics\n\n\ndef func_1(var_7):\n if var_7 == 1:\n return 1\n else:\n return var_7 * func_1(var_7 - 1)\n\n\ndef func_2(var_1, var_2):\n if var_1 == 0:\n return var_2\n elif var_2 == 0:\n return var_1\n else:\n return func_2(var_2, var_1 % var_2)\n\n\ndef func_3(var_1, var_2):\n return var_1 * var_2 / func_2(var_1, var_2)\n\n\ndef func_4(var_10):\n if len(var_10) < 1:\n return var_10\n var_8 = var_10[0]\n var_6 = []\n var_9 = []\n for var_13 in range(1, len(var_10)):\n if var_10[var_13] <= var_8:\n var_6.append(var_10[var_13])\n else:\n var_9.append(var_10[var_13])\n var_6 = func_4(var_6)\n var_9 = func_4(var_9)\n var_3 = [var_8]\n return var_6 + var_3 + var_9\n\n\nvar_7 = int(eval(input()))\n\nvar_11 = list(int(var_4) for var_4 in input().split())\nvar_5 = 0.00\nfor var_4 in range(var_7):\n var_12 = sorted(var_11)\n if len(var_11) == 2:\n var_5 = (var_11[0] + var_11[1]) / 2.00\n break\n\n var_11 = var_12\n var_5 = (var_11[0] + var_11[1]) / 2.00\n del var_11[0]\n del var_11[0]\n var_11.append(var_5)\n\nprint((\"{:.6f}\".format(var_5)))\n", "fast_code": "def func_1():\n var_3 = int(eval(input()))\n var_4 = sorted(map(int, input().split()))\n var_1 = (var_4[0] + var_4[1]) / 2\n for var_2 in range(2, var_3):\n var_1 = var_1 / 2 + var_4[var_2] / 2\n print(var_1)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 92880138, "fast_time": 28506174, "speedup": 3.2582, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_12"} -{"pair_id": "python_6715", "problem_id": "p00053", "language": "python", "slow_code": "var_7 = [0]\nvar_1 = 10**6\nvar_6 = [1] * var_1\nvar_2 = 0\nfor var_3 in range(2, var_1):\n if var_6[var_3]:\n for var_4 in range(var_3 * var_3, var_1, var_3):\n var_6[var_4] = 0\n var_2 += var_3\n var_7.append(var_2)\nwhile 1:\n var_5 = eval(input())\n if var_5 == 0:\n break\n print(var_7[var_5])\n", "fast_code": "var_7 = [0]\nvar_1 = 104850\nvar_6 = [1] * var_1\nvar_2 = 0\nfor var_3 in range(2, var_1):\n if var_6[var_3]:\n for var_4 in range(var_3 * var_3, var_1, var_3):\n var_6[var_4] = 0\n var_2 += var_3\n var_7.append(var_2)\nwhile 1:\n var_5 = eval(input())\n if var_5 == 0:\n break\n print(var_7[var_5])\n", "slow_time": 126327816139, "fast_time": 12782199012, "speedup": 9.8831, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_1"} -{"pair_id": "python_2393", "problem_id": "p03141", "language": "python", "slow_code": "import sys\n\nvar_9 = sys.stdin\nsys.setrecursionlimit(10**5)\n\n\ndef func_3():\n return list(map(int, var_9.readline().split()))\n\n\ndef func_4():\n return [int(var_11) - 1 for var_11 in var_9.readline().split()]\n\n\ndef func_2():\n return list(map(float, var_9.readline().split()))\n\n\ndef func_5():\n return var_9.readline().split()\n\n\ndef func_8():\n return var_9.readline().rstrip()\n\n\ndef func_1():\n return list(func_8())\n\n\ndef func_7():\n return int(var_9.readline())\n\n\ndef func_6():\n return float(var_9.readline())\n\n\nfrom heapq import heappush, heappop\n\nvar_6 = func_7()\nvar_1 = [tuple(func_3()) for _ in range(var_6)]\nvar_7 = []\nfor var_2, var_4 in var_1:\n heappush(var_7, [-var_2 - var_4, var_2, var_4])\nvar_5 = 0\nvar_10 = 0\nvar_3 = 0\nwhile var_7:\n var_8, var_2, var_4 = heappop(var_7)\n if var_5 % 2 == 0:\n var_10 += var_2\n else:\n var_3 += var_4\n var_5 += 1\nprint((var_10 - var_3))\n", "fast_code": "var_4 = int(eval(input()))\nvar_2 = []\nvar_1 = 0\nfor var_3 in range(var_4):\n var_5, var_6 = list(map(int, input().split()))\n var_1 += var_5\n var_2.append(var_5 + var_6)\nvar_2.sort(reverse=True)\nfor var_3 in range(var_4 // 2):\n var_1 -= var_2[2 * var_3 + 1]\nprint(var_1)\n", "slow_time": 86818307, "fast_time": 30733848, "speedup": 2.8248, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_0"} -{"pair_id": "python_3971", "problem_id": "p02607", "language": "python", "slow_code": "import sys\nfrom collections import deque\nimport numpy as np\nimport math\n\nsys.setrecursionlimit(10**6)\n\n\ndef func_4():\n return sys.stdin.readline().rstrip()\n\n\ndef func_5():\n return list(map(str, sys.stdin.readline().rstrip().split()))\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n var_3 = func_1()\n var_1 = list(func_2())\n var_2 = 0\n for var_4 in range(0, var_3, 2):\n if var_1[var_4] % 2:\n var_2 += 1\n print(var_2)\n return\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_4 = int(eval(input()))\nvar_2 = var_3 = 0\nfor var_1 in map(int, input().split()):\n var_3 += 1\n if var_3 % 2 and var_1 % 2:\n var_2 += 1\nprint(var_2)\n", "slow_time": 53007642, "fast_time": 19850375, "speedup": 2.6704, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_10"} -{"pair_id": "python_8327", "problem_id": "p03448", "language": "python", "slow_code": "def func_1():\n var_1 = int(input().strip())\n var_2 = int(input().strip())\n var_3 = int(input().strip())\n var_4 = int(input().strip())\n if 500 > var_4:\n var_1 = 0\n if 100 > var_4:\n var_2 = 0\n var_11 = 0\n for var_8 in [var_12 * 500 for var_12 in range(var_1 + 1)]:\n var_5 = var_4 - var_8\n for var_9 in [var_12 * 100 for var_12 in range(var_2 + 1)]:\n var_6 = var_5 - var_9\n for var_10 in [var_12 * 50 for var_12 in range(var_3 + 1)]:\n var_7 = var_6 - var_10\n if var_7 == 0:\n var_11 += 1\n return var_11\n\n\nif __name__ == \"__main__\":\n print((func_1()))\n", "fast_code": "var_1, var_2, var_3, var_6 = [int(eval(input())) + 1 for _ in [0] * 4]\nprint(\n (\n sum(\n var_3 > var_6 / 50 - var_4 * 10 - var_5 * 2 > 0\n for var_4 in range(var_1)\n for var_5 in range(var_2)\n )\n )\n)\n", "slow_time": 2618233256, "fast_time": 87612031, "speedup": 29.8844, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_18"} -{"pair_id": "python_3958", "problem_id": "p03564", "language": "python", "slow_code": "var_2 = int(eval(input()))\nvar_1 = int(eval(input()))\nvar_5 = 10**10\nfor var_3 in range(2**var_2):\n var_4 = 1\n for var_6 in range(var_2):\n if var_3 & (1 << var_6):\n var_4 *= 2\n else:\n var_4 += var_1\n var_5 = min(var_5, var_4)\nprint(var_5)\n", "fast_code": "import math\nimport string\nimport collections\nfrom collections import Counter\nfrom collections import deque\nfrom decimal import Decimal\n\n\ndef func_4():\n return list(map(int, input().split()))\n\n\ndef func_3(var_7, var_8):\n return math.factorial(var_7) // (\n math.factorial(var_7 - var_8) * math.factorial(var_8)\n )\n\n\ndef func_2(var_10):\n var_9 = []\n for var_5 in var_10:\n if not (var_5 in var_9):\n var_9.append(var_5)\n return len(var_10) != len(var_9)\n\n\ndef func_1(var_7):\n func_1 = []\n for var_4 in range(1, var_7 + 1):\n if var_7 % var_4 == 0:\n func_1.append(var_4)\n return func_1\n\n\nvar_2 = [-1, -1, -1, 0, 0, 1, 1, 1]\nvar_3 = [-1, 0, 1, -1, 1, -1, 0, 1]\nvar_7 = int(eval(input()))\nvar_6 = int(eval(input()))\nvar_1 = 1\nfor var_4 in range(var_7):\n if var_1 + var_6 < var_1 * 2:\n var_1 = var_1 + var_6\n else:\n var_1 = var_1 * 2\nprint(var_1)\n", "slow_time": 620758240, "fast_time": 78790378, "speedup": 7.8786, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_0"} -{"pair_id": "python_6293", "problem_id": "p03419", "language": "python", "slow_code": "def func_2(var_2, var_1):\n var_3 = [[0 for var_4 in range(var_1)] for var_5 in range(var_2)]\n for var_4 in range(var_1):\n for var_5 in range(var_2):\n for var_9 in range(-1, 2):\n for var_7 in range(-1, 2):\n var_8 = var_4 + var_7\n var_10 = var_5 + var_9\n if 0 <= var_8 < var_1 and 0 <= var_10 < var_2:\n var_3[var_10][var_8] ^= 1\n var_6 = 0\n for var_4 in range(var_1):\n for var_5 in range(var_2):\n if var_3[var_5][var_4]:\n var_6 += 1\n return var_6\n\n\ndef func_1(var_2, var_1):\n if var_2 == 1 and var_1 == 1:\n return 1\n if var_2 >= 2 and var_1 >= 2:\n return (var_2 - 2) * (var_1 - 2)\n if var_2 == 1:\n return var_1 - 2\n return var_2 - 2\n\n\nvar_2, var_1 = [int(_) for _ in input().split()]\nprint((func_1(var_2, var_1)))\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nprint((abs((var_2 - 2) * (var_1 - 2))))\n", "slow_time": 72088785, "fast_time": 11764328, "speedup": 6.1277, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_11"} -{"pair_id": "python_11006", "problem_id": "p02640", "language": "python", "slow_code": "var_3, var_4 = list(map(int, input().split()))\nfor var_1 in range(0, 101):\n for var_2 in range(0, 101):\n if var_1 + var_2 == var_3 and var_1 * 2 + var_2 * 4 == var_4:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nif var_2 % 2 == 0 and (var_1 * 2 <= var_2) and (var_2 <= var_1 * 4):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 502995557, "fast_time": 15330402, "speedup": 32.8103, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_2"} -{"pair_id": "python_6535", "problem_id": "p03332", "language": "python", "slow_code": "import sys\n\nvar_11 = sys.stdin.readline\nfrom collections import *\n\nvar_4 = 3 * 10**5 + 100\nvar_5 = 998244353\nvar_8 = [0] * var_4\nvar_12 = [0] * var_4\nvar_9 = [0] * var_4\nvar_8[0] = 1\nvar_8[1] = 1\nvar_9[0] = 1\nvar_9[1] = 1\nvar_12[1] = 1\nfor var_10 in range(2, var_4):\n var_8[var_10] = var_8[var_10 - 1] * var_10 % var_5\n var_12[var_10] = var_5 - var_12[var_5 % var_10] * (var_5 // var_10) % var_5\n var_9[var_10] = var_9[var_10 - 1] * var_12[var_10] % var_5\n\n\ndef func_1(var_14, var_15):\n if var_14 < var_15:\n return 0\n if var_14 < 0 or var_15 < 0:\n return 0\n return var_8[var_14] * (var_9[var_15] * var_9[var_14 - var_15] % var_5) % var_5\n\n\nvar_6, var_1, var_2, var_3 = list(map(int, var_11().split()))\nvar_7 = 0\nfor var_10 in range(var_6 + 1):\n if (var_3 - var_10 * var_1) % var_2 != 0:\n continue\n var_13 = (var_3 - var_10 * var_1) // var_2\n var_7 += func_1(var_6, var_10) * func_1(var_6, var_13)\n var_7 %= var_5\nprint(var_7)\n", "fast_code": "var_9, var_2, var_3, var_7 = list(map(int, input().split()))\nvar_1 = 998244353\nvar_5 = [0] * (var_9 + 1)\nvar_5[1] = 1\nfor var_4 in range(2, var_9 + 1):\n var_5[var_4] = (-(var_1 // var_4) * var_5[var_1 % var_4]) % var_1\nvar_10 = [0] * (var_9 + 1)\nvar_10[0] = 1\nfor var_4 in range(1, var_9 + 1):\n var_10[var_4] = (var_10[var_4 - 1] * (var_9 - var_4 + 1) * var_5[var_4]) % var_1\nvar_11 = 0\nvar_8 = min(var_9, var_7 // var_2)\nfor var_4 in range(var_8 + 1):\n if (var_7 - var_2 * var_4) % var_3 == 0:\n var_6 = (var_7 - var_2 * var_4) // var_3\n if var_6 <= var_9:\n var_11 += (var_10[var_4] * var_10[var_6]) % var_1\nif var_11 == 0:\n print((1))\nelse:\n print((var_11 % var_1))\n", "slow_time": 56165075681, "fast_time": 8998437330, "speedup": 6.2416, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_22"} -{"pair_id": "python_15337", "problem_id": "p02780", "language": "python", "slow_code": "var_6, var_4 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_7 = {}\nvar_1 = 0\nfor var_3 in range(1, 1000 + 1):\n var_7[var_3] = (var_3 + 1) * 0.5\nif var_6 == 1:\n print((var_7[var_2[0]]))\n exit()\nvar_5 = [0 for _ in range(var_6)]\nvar_5[0] = var_7[var_2[0]]\nfor var_3 in range(var_6 - 1):\n if var_3 + 1 < var_4:\n var_5[var_3 + 1] = var_5[var_3] + var_7[var_2[var_3 + 1]]\n else:\n var_5[var_3 + 1] = (\n var_5[var_3] + var_7[var_2[var_3 + 1]] - var_7[var_2[var_3 - var_4 + 1]]\n )\n var_1 = max(var_1, var_5[var_3 + 1])\nprint(var_1)\n", "fast_code": "var_6, var_5 = list(map(int, input().split()))\nvar_1 = list([(var_7 + 1) * 0.5 for var_7 in list(map(int, input().split()))])\nvar_2 = sum(var_1[:var_5])\nvar_3 = var_2\nfor var_4 in range(var_5, var_6):\n var_2 += var_1[var_4] - var_1[var_4 - var_5]\n var_3 = max(var_2, var_3)\nprint(var_3)\n", "slow_time": 91479968, "fast_time": 21002215, "speedup": 4.3557, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_19"} -{"pair_id": "python_3602", "problem_id": "p02934", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\nvar_3 = 10**20\nvar_5 = 10**9 + 7\nvar_1 = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nvar_2 = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef func_2():\n return [int(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_3():\n return [int(var_8) - 1 for var_8 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_4():\n return sys.stdin.readline().split()\n\n\ndef func_5():\n return eval(input())\n\n\ndef func_6():\n var_6 = func_1()\n var_4 = func_2()\n var_7 = 0\n for var_8 in var_4:\n var_7 += 1 / var_8\n return 1 / var_7\n\n\nprint((func_6()))\n", "fast_code": "from decimal import Decimal\n\nvar_4 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = 0\nfor var_3 in var_1:\n var_2 += Decimal(1 / var_3)\nprint((Decimal(1 / var_2)))\n", "slow_time": 79645167, "fast_time": 22528058, "speedup": 3.5354, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_24"} -{"pair_id": "python_11167", "problem_id": "p03816", "language": "python", "slow_code": "import functools\n\nvar_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_4 = [0 for var_5 in range(10**5 + 1)]\nfor var_3 in var_1:\n var_4[var_3] = 1\nvar_6 = sum(var_4)\nprint((var_6 - (0 if var_6 % 2 else 1)))\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_4 = {}\nfor var_3 in var_1:\n var_4[var_3] = 1\nprint((len(var_4) - (0 if len(var_4) % 2 else 1)))\n", "slow_time": 1492903758, "fast_time": 22369473, "speedup": 66.7384, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_24"} -{"pair_id": "python_7711", "problem_id": "p02838", "language": "python", "slow_code": "var_8 = 1000000007\nvar_2 = 0\nvar_9 = int(eval(input()))\nvar_1 = [int(var_5) for var_5 in input().split()]\nvar_11 = [[0] * 63 for var_5 in range(var_9 + 1)]\nvar_7 = [(2**var_5) % var_8 for var_5 in range(63)]\nfor var_5 in range(var_9):\n var_4 = var_1[var_5]\n var_3 = 0\n for var_6 in range(63):\n if var_4 & 1:\n var_11[var_5 + 1][var_3] = var_11[var_5][var_3] + 1\n else:\n var_11[var_5 + 1][var_3] = var_11[var_5][var_3]\n var_3 += 1\n var_4 = var_4 >> 1\nfor var_5 in range(1, var_9):\n for var_6 in range(63):\n var_10 = var_11[var_5][var_6] - var_11[var_5 - 1][var_6]\n if var_10:\n var_2 += var_7[var_6] * (\n (var_9 - var_5) - (var_11[-1][var_6] - var_11[var_5][var_6])\n )\n else:\n var_2 += var_7[var_6] * (var_11[-1][var_6] - var_11[var_5][var_6])\n var_2 %= var_8\nprint(var_2)\n", "fast_code": "var_5 = lambda var_4: list(map(var_4, input().split()))\nvar_3 = int(eval(input()))\nvar_7 = var_5(int)\nvar_9 = [0] * 60\nfor var_6 in var_7:\n for var_2 in range(60):\n if var_6 == 0:\n continue\n var_9[var_2] += var_6 & 1\n var_6 = var_6 >> 1\nvar_1 = 0\nfor var_2, var_8 in enumerate(var_9):\n var_1 += 2 ** (var_2) * var_8 * (var_3 - var_8)\n var_1 %= 10**9 + 7\nprint(var_1)\n", "slow_time": 280836259, "fast_time": 71380020, "speedup": 3.9344, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_8"} -{"pair_id": "python_4452", "problem_id": "p03136", "language": "python", "slow_code": "def func_6():\n var_3, var_4 = func_2()\n var_5 = var_3 / var_4\n print(var_5)\n return\n\n\ndef func_7():\n var_2 = func_1()\n var_1 = func_2()\n var_5 = \"Yes\"\n if max(var_1) * 2 >= sum(var_1):\n var_5 = \"No\"\n print(var_5)\n return\n\n\nimport sys, copy, bisect, itertools, heapq, math\nfrom heapq import heappop, heappush, heapify\nfrom collections import Counter, defaultdict, deque\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_4():\n return list(map(str, sys.stdin.readline().split()))\n\n\ndef func_3():\n return sys.stdin.readline().split()\n\n\ndef func_5():\n return sys.stdin.readline().strip()\n\n\nvar_7 = 10**9 + 7\nvar_6 = float(\"inf\")\nif __name__ == \"__main__\":\n func_7()\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_4 = sum(var_1)\nvar_3 = max(var_1)\nvar_4 -= var_3\nif var_4 > var_3:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 66845726, "fast_time": 22547539, "speedup": 2.9647, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_17"} -{"pair_id": "python_14823", "problem_id": "p03575", "language": "python", "slow_code": "import sys, re, os\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\nfrom itertools import permutations, combinations, product, accumulate\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom heapq import heapify, heappop, heappush\n\n\ndef func_7():\n return sys.stdin.readline().strip()\n\n\ndef func_1():\n return int(eval(func_7()))\n\n\ndef func_3():\n return list(map(int, func_7().split()))\n\n\ndef func_5():\n return list(map(str, func_7().split()))\n\n\ndef func_2():\n return list(map(int, func_7().split()))\n\n\ndef func_4():\n return list(map(str, func_7().split()))\n\n\nsys.setrecursionlimit(10**9)\nvar_2 = float(\"inf\")\nvar_16 = 10**9 + 7\n\n\ndef func_6(var_1, var_18):\n var_6 = len(var_1)\n var_10 = [var_2] * var_6\n var_10[var_18] = 0\n var_17 = [(0, var_18)]\n while var_17:\n var_12, var_20 = heappop(var_17)\n if var_10[var_20] != var_12:\n continue\n for var_19, var_13 in var_1[var_20]:\n var_11 = var_12 + var_13\n if var_11 < var_10[var_19]:\n var_10[var_19] = var_11\n heappush(var_17, (var_11, var_19))\n return var_10\n\n\nvar_5, var_4 = func_3()\nvar_3 = [func_2() for var_15 in range(var_4)]\nvar_14 = defaultdict(list)\nfor var_7, var_9 in var_3:\n var_14[var_7 - 1].append((var_9 - 1, 1))\n var_14[var_9 - 1].append((var_7 - 1, 1))\nvar_8 = 0\nfor var_15 in range(var_4):\n var_7, var_9 = var_3[var_15]\n var_1 = deepcopy(var_14)\n var_1[var_7 - 1].remove((var_9 - 1, 1))\n var_1[var_9 - 1].remove((var_7 - 1, 1))\n var_10 = func_6(var_1, 0)\n if var_10.count(var_2) > 0:\n var_8 += 1\nprint(var_8)\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_4 = [list(map(int, input().split())) for var_5 in range(var_1)]\nvar_3 = 0\nfor var_7 in var_4:\n var_6 = list(range(var_2))\n for var_8 in var_4:\n if var_8 != var_7:\n var_6 = [\n (\n var_6[var_8[0] - 1]\n if var_6[var_5] == var_6[var_8[1] - 1]\n else var_6[var_5]\n )\n for var_5 in range(var_2)\n ]\n if len(set(var_6)) != 1:\n var_3 += 1\nprint(var_3)\n", "slow_time": 146134559, "fast_time": 43890459, "speedup": 3.3295, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_13"} -{"pair_id": "python_4325", "problem_id": "p03264", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_2 = []\nfor var_4 in range(1, var_1 + 1):\n var_2.append(var_4)\nvar_3 = 0\nif var_1 >= 2 and var_1 <= 100:\n for var_6 in range(len(var_2)):\n for var_5 in range(var_6 + 1, len(var_2)):\n if (\n var_2[var_6] & 1 == 0\n and var_2[var_5] & 1 == 1\n or var_2[var_6] & 1 == 1\n and var_2[var_5] & 1 == 0\n ):\n var_2[var_6] * var_2[var_5] % 2 == 0\n if var_2[var_6] * var_2[var_5] % 2 == 0:\n var_3 += 1\n print(var_3)\n", "fast_code": "var_3 = int(eval(input()))\nvar_1 = (var_3 + 1) // 2\nvar_2 = var_3 // 2\nprint((var_1 * var_2))\n", "slow_time": 113472482, "fast_time": 11598064, "speedup": 9.7837, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_5"} -{"pair_id": "python_13778", "problem_id": "p02385", "language": "python", "slow_code": "class Class_1:\n def __init__(self):\n\n self.t = 1\n self.s = 2\n self.e = 3\n self.w = 4\n self.n = 5\n self.b = 6\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def __init__(self, var_17, var_13, var_6, var_20, var_10, var_1):\n\n self.t = var_17\n self.s = var_13\n self.e = var_6\n self.w = var_20\n self.n = var_10\n self.b = var_1\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def func_2(self, var_23):\n if var_23 == 0:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.n,\n self.t,\n self.e,\n self.w,\n self.b,\n self.s,\n )\n elif var_23 == 1:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.s,\n self.b,\n self.e,\n self.w,\n self.t,\n self.n,\n )\n elif var_23 == 2:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.w,\n self.s,\n self.t,\n self.b,\n self.n,\n self.e,\n )\n elif var_23 == 3:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.e,\n self.s,\n self.b,\n self.t,\n self.n,\n self.w,\n )\n\n\ndef func_1():\n import random\n\n var_18, var_14, var_7, var_21, var_11, var_2 = list(map(int, input().split()))\n var_19, var_15, var_8, var_22, var_12, var_3 = list(map(int, input().split()))\n var_4 = Class_1(var_18, var_14, var_7, var_21, var_11, var_2)\n var_5 = Class_1(var_19, var_15, var_8, var_22, var_12, var_3)\n var_9 = 0\n for _ in range(10000):\n if (var_4.t, var_4.s, var_4.e, var_4.w, var_4.n, var_4.b) == (\n var_5.t,\n var_5.s,\n var_5.e,\n var_5.w,\n var_5.n,\n var_5.b,\n ):\n var_9 = 1\n break\n else:\n var_16 = random.randint(0, 3)\n var_5.rot(var_16)\n if var_9 == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "class Class_1:\n def __init__(self):\n self.faces = []\n\n def func_1(self, var_3):\n var_6 = self.faces.copy()\n if var_3 == \"N\":\n self.faces[5 - 1] = var_6[1 - 1]\n self.faces[1 - 1] = var_6[2 - 1]\n self.faces[2 - 1] = var_6[6 - 1]\n self.faces[6 - 1] = var_6[5 - 1]\n if var_3 == \"S\":\n self.faces[5 - 1] = var_6[6 - 1]\n self.faces[1 - 1] = var_6[5 - 1]\n self.faces[2 - 1] = var_6[1 - 1]\n self.faces[6 - 1] = var_6[2 - 1]\n if var_3 == \"W\":\n self.faces[4 - 1] = var_6[1 - 1]\n self.faces[1 - 1] = var_6[3 - 1]\n self.faces[3 - 1] = var_6[6 - 1]\n self.faces[6 - 1] = var_6[4 - 1]\n if var_3 == \"E\":\n self.faces[3 - 1] = var_6[1 - 1]\n self.faces[1 - 1] = var_6[4 - 1]\n self.faces[4 - 1] = var_6[6 - 1]\n self.faces[6 - 1] = var_6[3 - 1]\n return 0\n\n def func_2(self):\n self.faces[4 - 1], self.faces[2 - 1], self.faces[5 - 1], self.faces[3 - 1] = (\n self.faces[2 - 1],\n self.faces[3 - 1],\n self.faces[4 - 1],\n self.faces[5 - 1],\n )\n return 0\n\n\nvar_1 = Class_1()\nvar_2 = Class_1()\nvar_1.faces = [int(var_8) for var_8 in input().split(\" \")]\nvar_2.faces = [int(var_8) for var_8 in input().split(\" \")]\nvar_7, var_4 = var_1.faces[0], var_1.faces[1]\nvar_5 = \"No\"\n\nfor _ in range(3):\n for _ in range(4):\n for ___ in range(4):\n\n if var_1.faces == var_2.faces:\n var_5 = \"Yes\"\n break\n var_2.spin()\n var_2.rotate(\"W\")\n var_2.rotate(\"N\")\nprint(var_5)\n", "slow_time": 3599802039, "fast_time": 138326850, "speedup": 26.0239, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_18"} -{"pair_id": "python_13669", "problem_id": "p03312", "language": "python", "slow_code": "import sys\n\nvar_6 = lambda: sys.stdin.readline().rstrip()\nsys.setrecursionlimit(max(1000, 10**9))\nvar_7 = int(eval(var_6()))\nvar_1 = list(map(int, var_6().split()))\nvar_2 = [None] * var_7\nvar_9 = 0\nfor var_5, var_8 in enumerate(var_1):\n var_9 += var_1[var_5]\n var_2[var_5] = var_9\nvar_3 = [None] * var_7\nvar_9 = 0\nvar_10 = 1\nvar_11 = 0\nvar_12 = var_1[0]\nvar_3[var_10 - 1] = (var_11, var_12)\nwhile var_10 < var_7:\n\n var_10 += 1\n var_12 += var_1[var_10 - 1]\n while var_11 < var_12 and var_9 < var_10:\n if var_3[var_10 - 1] is None or abs(var_11 - var_12) < abs(\n var_3[var_10 - 1][0] - var_3[var_10 - 1][1]\n ):\n var_3[var_10 - 1] = (var_11, var_12)\n var_9 += 1\n var_11 += var_1[var_9 - 1]\n var_12 -= var_1[var_9 - 1]\n if var_3[var_10 - 1] is None or abs(var_11 - var_12) < abs(\n var_3[var_10 - 1][0] - var_3[var_10 - 1][1]\n ):\n var_3[var_10 - 1] = (var_11, var_12)\n if var_11 > var_12 and var_9 >= 1:\n var_11 -= var_1[var_9 - 1]\n var_12 += var_1[var_9 - 1]\n var_9 -= 1\nvar_4 = [None] * var_7\nvar_9 = var_7\nvar_10 = var_7 - 1\nvar_11 = 0\nvar_12 = var_1[-1]\nvar_4[var_10] = (var_11, var_12)\nwhile var_10 >= 1:\n\n var_10 -= 1\n var_12 += var_1[var_10]\n while var_11 < var_12 and var_9 > var_10:\n if var_4[var_10] is None or abs(var_11 - var_12) < abs(\n var_4[var_10][0] - var_4[var_10][1]\n ):\n var_4[var_10] = (var_11, var_12)\n var_9 -= 1\n var_11 += var_1[var_9]\n var_12 -= var_1[var_9]\n if var_4[var_10] is None or abs(var_11 - var_12) < abs(\n var_4[var_10][0] - var_4[var_10][1]\n ):\n var_4[var_10] = (var_11, var_12)\n if var_11 > var_12 and var_9 <= var_7 - 2:\n var_11 -= var_1[var_9]\n var_12 += var_1[var_9]\n var_9 += 1\nprint(\n (\n min(\n (\n max(\n var_3[var_5][0],\n var_3[var_5][1],\n var_4[var_5 + 1][0],\n var_4[var_5 + 1][1],\n )\n - min(\n var_3[var_5][0],\n var_3[var_5][1],\n var_4[var_5 + 1][0],\n var_4[var_5 + 1][1],\n )\n )\n for var_5 in range(var_7 - 1)\n )\n )\n)\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_7 = float(\"inf\")\nvar_8, var_10 = 1, 3\n(var_3, var_4, var_5), var_6 = var_1[:3], sum(var_1[3:])\n\nfor var_9 in range(2, var_2 - 1):\n while var_3 < var_4 and var_1[var_8] <= var_4 - var_3:\n var_3 += var_1[var_8]\n var_4 -= var_1[var_8]\n var_8 += 1\n while var_5 < var_6 and var_1[var_10] <= var_6 - var_5:\n var_5 += var_1[var_10]\n var_6 -= var_1[var_10]\n var_10 += 1\n var_7 = min(\n var_7, max(var_3, var_4, var_5, var_6) - min(var_3, var_4, var_5, var_6)\n )\n var_4 += var_1[var_9]\n var_5 -= var_1[var_9]\nprint(var_7)\n", "slow_time": 158663806, "fast_time": 54265311, "speedup": 2.9239, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_7"} -{"pair_id": "python_17352", "problem_id": "p02555", "language": "python", "slow_code": "from itertools import accumulate\n\nvar_1 = int(eval(input()))\nvar_7 = 10**9 + 7\nif var_1 == 1 or var_1 == 2:\n print((0))\n exit()\nvar_4 = [0] * (var_1 + 1)\nvar_4[0] = 1\nvar_2 = 0\nfor var_5 in range(var_1):\n var_3 = list(accumulate(var_4))\n for var_6 in range(var_1, 2, -1):\n var_4[var_6] = var_3[var_6 - 3] % var_7\n var_4[0] = var_4[1] = var_4[2] = 0\n var_2 = (var_2 + var_4[var_1]) % var_7\nprint(var_2)\n", "fast_code": "var_15 = int(eval(input()))\nvar_16 = var_15 // 3\n\n\ndef func_1(var_8, var_13):\n if var_8 - var_13 < var_13:\n var_13 = var_8 - var_13\n if var_13 == 0:\n return 1\n if var_13 == 1:\n return var_8\n var_9 = [var_8 - var_13 + var_7 + 1 for var_7 in range(var_13)]\n var_5 = [var_7 + 1 for var_7 in range(var_13)]\n for var_11 in range(2, var_13 + 1):\n var_12 = var_5[var_11 - 1]\n if var_12 > 1:\n var_10 = (var_8 - var_13) % var_11\n for var_7 in range(var_11 - 1, var_13, var_11):\n var_9[var_7 - var_10] /= var_12\n var_5[var_7] /= var_12\n var_14 = 1\n for var_7 in range(var_13):\n if var_9[var_7] > 1:\n var_14 *= int(var_9[var_7])\n return var_14\n\n\nvar_3 = 0\nfor var_6 in range(var_16):\n var_1 = var_6 + 1\n var_2 = var_15 - 3 * var_1\n var_4 = func_1(var_2 + var_1 - 1, var_1 - 1)\n var_3 += var_4\nprint((var_3 % (10**9 + 7)))\n", "slow_time": 2797213779, "fast_time": 405576047, "speedup": 6.8969, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_8"} -{"pair_id": "python_648", "problem_id": "p02793", "language": "python", "slow_code": "def func_1(var_2):\n var_11 = [0] * (var_2 + 1)\n var_11[0] = -1\n var_11[1] = -1\n for var_4 in range(2, var_2 + 1):\n if var_11[var_4] != 0:\n continue\n var_11[var_4] = var_4\n for var_5 in range(var_4 * var_4, var_2 + 1, var_4):\n if var_11[var_5] == 0:\n var_11[var_5] = var_4\n return var_11\n\n\nvar_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_9 = 1000000007\nvar_11 = func_1(1000000)\nvar_8 = {}\nfor var_4 in range(var_2):\n var_12 = []\n var_3 = var_1[var_4]\n while var_3 != 1:\n if len(var_12) != 0 and var_12[-1][0] == var_11[var_3]:\n var_12[-1][1] += 1\n else:\n var_12.append([var_11[var_3], 1])\n var_3 //= var_11[var_3]\n for var_6, var_13 in var_12:\n if var_6 not in var_8 or var_8[var_6] < var_13:\n var_8[var_6] = var_13\nvar_7 = 1\nfor var_6 in var_8:\n for var_4 in range(var_8[var_6]):\n var_7 *= var_6\n var_7 %= var_9\nvar_10 = 0\nfor var_4 in range(var_2):\n var_10 += var_7 * pow(var_1[var_4], var_9 - 2, var_9)\n var_10 %= var_9\nprint(var_10)\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_9 = 10**9 + 7\nvar_8 = [0] * (max(var_1) + 1)\nvar_8[1] = 1\nfor var_3 in var_1:\n if var_3 == 1:\n continue\n var_10 = 0\n while var_3 % 2 == 0:\n var_3 //= 2\n var_10 += 1\n var_8[2] = max(var_8[2], var_10)\n var_6 = 3\n while var_6**2 <= var_3:\n var_10 = 0\n while var_3 % var_6 == 0:\n var_3 //= var_6\n var_10 += 1\n var_8[var_6] = max(var_8[var_6], var_10)\n var_6 += 2\n if var_3 != 1:\n var_8[var_3] = max(var_8[var_3], 1)\nvar_5 = 1\nfor var_7, var_10 in enumerate(var_8):\n var_5 *= pow(var_7, var_10, var_9)\n var_5 %= var_9\nvar_4 = 0\nfor var_3 in var_1:\n var_4 += (var_5 * pow(var_3, var_9 - 2, var_9)) % var_9\n var_4 %= var_9\nprint((var_4 % var_9))\n", "slow_time": 37402461682, "fast_time": 7404967239, "speedup": 5.051, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_22"} -{"pair_id": "python_2609", "problem_id": "p02660", "language": "python", "slow_code": "def func_1(var_11):\n var_5 = []\n for var_6 in range(1, int(var_11**0.5) + 1):\n if var_11 % var_6 == 0:\n var_5.append(var_6)\n if var_6 != var_11 // var_6:\n var_5.append(var_11 // var_6)\n\n return var_5\n\n\ndef func_2(var_9):\n var_12 = {}\n for var_6 in range(2, int(var_9**0.5) + 1):\n while var_9 % var_6 == 0:\n var_12[var_6] = var_12.get(var_6, 0) + 1\n var_9 //= var_6\n if var_9 > 1:\n var_12[var_9] = 1\n return var_12\n\n\nimport sys\n\nvar_8 = sys.stdin.readline\nvar_1 = int(eval(var_8()))\nvar_3 = func_1(var_1)\nvar_3.sort()\nvar_4 = var_3[1:]\nvar_2 = 0\nfor var_6 in var_4:\n var_7 = func_2(var_6)\n if len(var_7) == 1:\n var_13, var_10 = divmod(var_1, var_6)\n if var_10 == 0:\n var_2 += 1\n var_1 = var_13\nprint(var_2)\n", "fast_code": "var_5 = int(eval(input()))\nvar_3 = {2: 0}\nwhile var_5 % 2 < 1:\n var_5 //= 2\n var_3[2] += 1\nfor var_4 in range(3, int(var_5**0.5) + 1, 2):\n while var_5 % var_4 < 1:\n var_5 //= var_4\n var_3[var_4] = var_3.get(var_4, 0) + 1\n if var_5 < 2:\n break\nif var_5 > 1:\n var_3[var_5] = 1\nvar_1 = 0\nfor var_4 in list(var_3.values()):\n var_6 = var_2 = 0\n while var_6 + var_2 < var_4:\n var_2 += 1\n var_6 += var_2\n var_1 += var_2\nprint(var_1)\n", "slow_time": 14877441202, "fast_time": 1869795539, "speedup": 7.9567, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_19"} -{"pair_id": "python_10429", "problem_id": "p03576", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul\n\nsys.setrecursionlimit(10000)\n\n\ndef func_6():\n return int(input())\n\n\ndef func_7():\n return list(map(int, input().split()))\n\n\ndef func_4():\n return float(input())\n\n\ndef func_5():\n return list(map(float, input().split()))\n\n\ndef func_8():\n return input()\n\n\ndef func_9():\n return list(map(str, input().split()))\n\n\ndef func_1(*var_9):\n print(*var_9, file=sys.stderr)\n\n\ndef func_3(var_12):\n import time\n\n def func_11(*var_9, **var_14):\n var_18 = time.time()\n var_16 = var_12(*var_9, **var_14)\n var_11 = time.time()\n func_1(var_11 - var_18, \"sec\")\n return var_16\n\n return func_11\n\n\n@func_3\ndef func_10(var_2, var_1, var_6):\n var_5 = sorted(map(lambda var_20: var_20[0], var_6))\n var_3 = var_5[::-1]\n var_7 = sorted(map(lambda var_20: var_20[1], var_6))\n var_4 = var_7[::-1]\n var_8 = sys.maxsize\n for var_15 in var_5:\n for var_17 in var_3:\n if var_15 > var_17:\n break\n for var_10 in var_7:\n for var_19 in var_4:\n if var_10 > var_19:\n break\n var_13 = 0\n for var_20, var_21 in var_6:\n if var_15 <= var_20 <= var_17 and var_10 <= var_21 <= var_19:\n var_13 += 1\n if var_13 >= var_1:\n var_8 = min(var_8, (var_17 - var_15) * (var_19 - var_10))\n else:\n break\n return var_8\n\n\ndef func_2():\n var_2, var_1 = func_7()\n var_6 = [func_7() for _ in range(var_2)]\n print(func_10(var_2, var_1, var_6))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = [list(map(int, input().split())) for _ in range(var_2)]\nvar_3.sort()\nvar_6 = 10**20\nfor var_8 in range(var_2 - var_1 + 1):\n for var_9 in range(var_1 + var_8 - 1, var_2):\n var_7 = var_3[var_9][0] - var_3[var_8][0]\n var_4 = sorted(var_3[var_8 : var_9 + 1], key=lambda var_5: var_5[1])\n for var_11 in range(len(var_4) - var_1 + 1):\n var_10 = var_4[var_11 + var_1 - 1][1] - var_4[var_11][1]\n var_6 = min(var_6, var_7 * var_10)\nprint(var_6)\n", "slow_time": 157973113, "fast_time": 54468250, "speedup": 2.9003, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_11"} -{"pair_id": "python_6230", "problem_id": "p03502", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nimport array\nimport inspect\n\nsys.setrecursionlimit(10000)\n\n\ndef func_1(*var_3):\n var_6 = {\n id(var_7): var_5\n for var_5, var_7 in list(inspect.currentframe().f_back.f_locals.items())\n }\n print(\n (\n \", \".join(\n var_6.get(id(var_2), \"???\") + \" = \" + repr(var_2) for var_2 in var_3\n )\n )\n )\n\n\ndef func_4(var_8):\n return bin(var_8)[2:]\n\n\ndef func_2():\n return [int(_) for _ in input().split()]\n\n\nvar_4 = None\n\n\ndef func_3():\n var_1 = int(eval(input()))\n if var_1 % sum(list(map(int, list(str(var_1))))) == 0:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nfunc_3()\n", "fast_code": "var_2 = int(eval(input()))\nvar_3 = str(var_2)\nvar_4 = 0\nfor var_1 in range(len(var_3)):\n var_4 += ord(var_3[var_1]) - ord(\"0\")\nif var_2 % var_4 == 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 66486570, "fast_time": 22559937, "speedup": 2.9471, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_2"} -{"pair_id": "python_14612", "problem_id": "p01314", "language": "python", "slow_code": "if __name__ == \"__main__\":\n while True:\n var_4 = int(eval(input()))\n if var_4 == 0:\n break\n var_1 = 0\n for var_2 in range(1, var_4):\n for var_3 in range(var_2 + 1, var_4):\n var_5 = (var_2 + var_3) * (var_3 - var_2 + 1) / 2\n if var_5 > var_4:\n break\n if var_5 == var_4:\n var_1 += 1\n print(var_1)\n", "fast_code": "import sys\n\nif sys.version_info[0] >= 3:\n var_4 = input\ntry:\n while True:\n var_2 = int(input())\n if var_2 == 0:\n break\n var_3 = 0\n var_1 = 1\n while 1:\n var_2 -= var_1\n var_1 += 1\n if var_2 < var_1:\n break\n if var_2 % var_1 == 0:\n var_3 += 1\n print(var_3)\nexcept EOFError:\n pass\n", "slow_time": 129769763, "fast_time": 28682051, "speedup": 4.5244, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_6"} -{"pair_id": "python_16161", "problem_id": "p03472", "language": "python", "slow_code": "import sys\nfrom collections import defaultdict, Counter\nfrom itertools import product, groupby, count, permutations, combinations\nfrom math import pi, sqrt, floor\nfrom collections import deque\nfrom bisect import bisect, bisect_left, bisect_right\nfrom string import ascii_lowercase\nfrom functools import lru_cache, reduce\nfrom operator import xor\nfrom heapq import heappush, heappop\n\nvar_2 = float(\"inf\")\nsys.setrecursionlimit(10**7)\n\nvar_10, var_9 = [0, -1, 0, 1], [1, 0, -1, 0]\n\n\ndef func_2(var_15: int, var_14: int, var_1: int, var_4: int) -> bool:\n return 0 <= var_15 < var_1 and 0 <= var_14 < var_4\n\n\ndef func_1(var_5, var_8):\n return (var_5 + var_8 - 1) // var_8\n\n\ndef func_4(var_3, var_1, var_6):\n var_13 = -1\n for var_5, var_8 in var_6:\n var_13 = max(var_13, var_5)\n var_11 = []\n for var_5, var_8 in var_6:\n if var_8 >= var_13:\n var_11.append(var_8)\n var_7 = 0\n for var_8 in sorted(var_11, reverse=True):\n var_7 += 1\n var_1 -= var_8\n if var_1 <= 0:\n return var_7\n return var_7 + func_1(var_1, var_13)\n\n\ndef func_3():\n var_3, var_1 = list(map(int, input().split()))\n var_12 = []\n for _ in range(var_3):\n var_5, var_8 = list(map(int, input().split()))\n var_12.append((var_5, var_8))\n print((func_4(var_3, var_1, var_12)))\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_5, var_4, *var_6 = list(map(int, open(0).read().split()))\nvar_2 = sorted(var_6[1::2])\nvar_1 = max(var_6[::2])\nvar_3 = 0\nwhile var_4 > 0 and var_2 and var_2[-1] > var_1:\n var_4 -= var_2.pop()\n var_3 += 1\nif var_4 > 0:\n var_3 -= -var_4 // var_1\nprint(var_3)\n", "slow_time": 97838002, "fast_time": 37488820, "speedup": 2.6098, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_8"} -{"pair_id": "python_11178", "problem_id": "p03816", "language": "python", "slow_code": "from collections import defaultdict\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return list(map(list, sys.stdin.readline().split()))\n\n\ndef func_7():\n return list(sys.stdin.readline())[:-1]\n\n\ndef func_2(var_8):\n var_6 = [None for var_4 in range(var_8)]\n for var_4 in range(var_8):\n var_6[var_4] = func_1()\n return var_6\n\n\ndef func_4(var_8):\n var_6 = [None for var_4 in range(var_8)]\n for var_4 in range(var_8):\n var_6[var_4] = func_3()\n return var_6\n\n\ndef func_8(var_8):\n var_6 = [None for var_4 in range(var_8)]\n for var_4 in range(var_8):\n var_6[var_4] = func_7()\n return var_6\n\n\ndef func_6(var_8):\n var_6 = [None for var_4 in range(var_8)]\n for var_4 in range(var_8):\n var_6[var_4] = func_8()\n return var_6\n\n\nvar_7 = 1000000007\n\n\n\"\"\"\"\"\"\n\nvar_8 = func_1()\nvar_1 = func_3()\nvar_3 = defaultdict(int)\nfor var_4 in var_1:\n var_3[var_4] += 1\nvar_6 = list(var_3.keys())\nvar_5 = 0\nfor var_4 in var_6:\n var_5 ^= ~(var_3[var_4] % 2)\n var_3[var_4] = 1\nvar_2 = sum(list(var_3.values()))\nvar_2 -= 1 if var_5 % 2 else 0\nprint(var_2)\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = [int(var_3) for var_3 in input().split()]\nvar_2 = len(set(var_1))\nif (var_4 - var_2) % 2 == 0:\n print(var_2)\nelse:\n print((var_2 - 1))\n", "slow_time": 111635076, "fast_time": 25037491, "speedup": 4.4587, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_15"} -{"pair_id": "python_12669", "problem_id": "p02703", "language": "python", "slow_code": "import sys\nfrom heapq import heapify, heappop, heappush\n\nvar_24 = lambda: sys.stdin.readline().rstrip()\nvar_16 = lambda: int(var_24())\nvar_18 = lambda: list(map(int, var_24().split()))\n\nvar_5, var_4, var_6 = var_18()\nvar_7 = [var_18() for _ in range(var_4)]\nvar_2 = [var_18() for _ in range(var_5)]\nvar_1 = 0\nfor var_15 in range(var_4):\n var_8 = var_7[var_15][2]\n if var_8 > var_1:\n var_1 = var_8\nvar_17 = var_1 * (var_5 - 1)\nvar_6 = min(var_6, var_17)\nvar_14 = [[] for _ in range(var_5 + 1)]\nfor var_28, var_29, var_8, var_10 in var_7:\n var_14[var_28].append((var_29, var_8, var_10))\n var_14[var_29].append((var_28, var_8, var_10))\n\n\ndef func_1(var_25):\n\n var_3 = 10**15\n var_13 = [[var_3 for _ in range(var_17 + 1)] for _ in range(var_5 + 1)]\n var_13[1][var_6] = 0\n var_21 = [(0, var_6, 1)]\n while var_21:\n var_27, var_23, var_20 = heappop(var_21)\n if var_13[var_20][var_23] < var_27:\n continue\n for var_19, var_8, var_10 in var_14[var_20]:\n var_26 = var_27 + var_10\n var_22 = var_23 - var_8\n if var_22 < 0:\n continue\n if var_13[var_19][var_22] > var_26:\n var_13[var_19][var_22] = var_26\n heappush(var_21, (var_26, var_22, var_19))\n var_11, var_12 = var_2[var_20 - 1]\n var_22 = min(var_17, var_23 + var_11)\n while var_13[var_20][var_22] > var_27 + var_12:\n var_13[var_20][var_22] = var_27 + var_12\n heappush(var_21, (var_27 + var_12, var_22, var_20))\n var_22 += var_11\n var_22 = min(var_17, var_22)\n var_27 += var_12\n return var_13\n\n\nvar_13 = func_1(1)\nfor var_15 in range(2, var_5 + 1):\n var_12 = var_13[var_15]\n var_9 = min(var_12)\n print(var_9)\n", "fast_code": "var_12, var_10, var_17 = list(map(int, input().split()))\nvar_22 = [list(map(int, input().split())) for _ in range(var_10)]\nvar_5 = [list(map(int, input().split())) for _ in range(var_12)]\nvar_7 = [[] for _ in range(var_12)]\nfor var_21, var_23, var_1, var_3 in var_22:\n var_21, var_23 = var_21 - 1, var_23 - 1\n var_7[var_21].append([var_23, var_1, var_3])\n var_7[var_23].append([var_21, var_1, var_3])\n\nfrom heapq import heappop, heappush\n\nvar_9 = float(\"inf\")\nvar_11 = 50 * var_10\nvar_2 = [[var_9] * (var_11 + 1) for _ in range(var_12)]\nvar_17 = min(var_17, var_11)\nvar_20 = [[0, 0, var_17]]\nvar_2[0][var_17] = 0\nwhile var_20:\n var_19, var_23, var_18 = heappop(var_20)\n if var_2[var_23][var_18] < var_19:\n continue\n for var_16, var_13, var_14 in var_7[var_23]:\n if var_13 > var_18:\n continue\n if var_2[var_16][var_18 - var_13] > var_19 + var_14:\n heappush(var_20, [var_19 + var_14, var_16, var_18 - var_13])\n var_2[var_16][var_18 - var_13] = var_19 + var_14\n var_4, var_6 = var_5[var_23]\n var_15 = min(var_18 + var_4, var_11)\n if var_2[var_23][var_15] > var_19 + var_6:\n heappush(var_20, [var_19 + var_6, var_23, var_15])\n var_2[var_23][var_15] = var_19 + var_6\nfor var_8 in range(1, var_12):\n print((min(var_2[var_8])))\n", "slow_time": 6039274323, "fast_time": 775381459, "speedup": 7.7888, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_17"} -{"pair_id": "python_3708", "problem_id": "p02731", "language": "python", "slow_code": "def func_1():\n var_1 = int(eval(input()))\n var_3 = 0\n for var_5 in range(min(var_1, 1000)):\n for var_6 in range(1000):\n var_2 = var_5 + (var_6 / 1000)\n var_4 = (var_1 - var_2) / 2\n var_3 = max(var_3, var_2 * var_4 * var_4)\n print(var_3)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = var_1 / 3\nprint((var_2**3))\n", "slow_time": 870567638, "fast_time": 10602666, "speedup": 82.1084, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_17"} -{"pair_id": "python_14022", "problem_id": "p03125", "language": "python", "slow_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nvar_4 = 10**9 + 7\nvar_3 = float(\"inf\")\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\nvar_1, var_2 = func_2()\nif var_2 % var_1 == 0:\n print((var_1 + var_2))\nelse:\n print((var_2 - var_1))\n", "fast_code": "def func_1():\n var_1, var_2 = list(map(int, input().split()))\n if var_2 % var_1 == 0:\n print((var_1 + var_2))\n else:\n print((var_2 - var_1))\n\n\nfunc_1()\n", "slow_time": 43332877, "fast_time": 17646032, "speedup": 2.4557, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_12"} -{"pair_id": "python_7280", "problem_id": "p02881", "language": "python", "slow_code": "var_3 = int(eval(input()))\nvar_1 = var_3 - 1\nvar_2 = 2\nwhile var_2 <= int(var_3**0.5) + 1:\n if var_3 % var_2 == 0:\n var_1 = min(var_1, (var_2 - 1) + (var_3 // var_2 - 1))\n var_2 += 1\nprint(var_1)\n", "fast_code": "var_2 = int(eval(input()))\nprint(\n (\n min(\n var_1 + (var_2 // var_1) - 2\n for var_1 in range(1, int(var_2**0.5) + 1)\n if var_2 % var_1 == 0\n )\n )\n)\n", "slow_time": 926096682, "fast_time": 191385250, "speedup": 4.8389, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_6"} -{"pair_id": "python_534", "problem_id": "p03221", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = []\nvar_4 = []\nvar_5 = [[] for var_7 in range(10**5 + 1)]\nfor var_6 in range(var_1):\n var_10 = list(map(int, input().split()))\n var_3.append(var_10[0])\n var_4.append(var_10[1])\n var_5[var_10[0]].append(var_10[1])\nfor var_6 in range(var_2 + 1):\n var_5[var_6].sort()\nfor var_6 in range(var_1):\n\n var_9 = 0\n var_12 = len(var_5[var_3[var_6]]) - 1\n while var_9 <= var_12:\n var_11 = (var_9 + var_12) // 2\n if var_5[var_3[var_6]][var_11] == var_4[var_6]:\n var_8 = var_11\n break\n elif var_5[var_3[var_6]][var_11] > var_4[var_6]:\n var_12 = var_11 - 1\n else:\n var_9 = var_11 + 1\n print((str(var_3[var_6]).rjust(6, \"0\") + str(var_8 + 1).rjust(6, \"0\")))\n", "fast_code": "class Class_1:\n def __init__(self, var_4, var_1, var_2, var_3):\n self.i = var_4\n self.a = var_1\n self.b = var_2\n self.c = var_3\n\n\nvar_8, var_7 = list(map(int, input().split()))\nvar_5 = []\nvar_6 = []\nfor var_4 in range(var_8):\n var_6.append(1)\nfor var_4 in range(var_7):\n var_1, var_2 = list(map(int, input().split()))\n var_5.append(Class_1(var_4, var_1, var_2, 0))\nvar_5 = sorted(var_5, key=lambda var_9: (var_9.a, var_9.b))\nfor var_4 in range(var_7):\n var_1 = var_5[var_4].a\n var_5[var_4].c = var_6[var_1 - 1]\n var_6[var_1 - 1] += 1\nvar_5 = sorted(var_5, key=lambda var_9: var_9.i)\nfor var_4 in var_5:\n print((str(var_4.a).zfill(6) + str(var_4.c).zfill(6)))\n", "slow_time": 2260230442, "fast_time": 50156732, "speedup": 45.0634, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_1"} -{"pair_id": "python_9055", "problem_id": "p03837", "language": "python", "slow_code": "var_6, var_5 = list(map(int, input().split()))\nvar_3 = [[float(\"inf\") for var_4 in range(var_6)] for var_4 in range(var_6)]\nvar_7 = [list(map(int, input().split())) for var_4 in range(var_5)]\nfrom scipy.sparse.csgraph import floyd_warshall\n\nfor var_8, var_9, var_1 in var_7:\n var_8, var_9 = var_8 - 1, var_9 - 1\n var_3[var_8][var_9] = var_3[var_9][var_8] = var_1\nvar_3 = floyd_warshall(var_3).tolist()\nvar_2 = 0\nfor var_8, var_9, var_1 in var_7:\n var_8, var_9 = var_8 - 1, var_9 - 1\n if var_3[var_8][var_9] != var_1:\n var_2 += 1\nprint(var_2)\n", "fast_code": "var_4, var_3 = list(map(int, input().split()))\nvar_2 = 10**6\nvar_1 = [[var_2] * var_4 for _ in range(var_4)]\nfor _ in range(var_3):\n var_5, var_7, var_8 = list(map(int, input().split()))\n var_1[var_5 - 1][var_7 - 1] = var_8\n var_1[var_7 - 1][var_5 - 1] = var_8\nvar_9 = [[var_2] * var_4 for _ in range(var_4)]\nfor var_10 in range(var_4):\n for var_11 in range(var_4):\n if var_10 == var_11:\n var_9[var_10][var_11] = 0\n else:\n var_9[var_10][var_11] = var_1[var_10][var_11]\nfor var_12 in range(var_4):\n for var_10 in range(var_4):\n for var_11 in range(var_4):\n var_9[var_10][var_11] = min(\n var_9[var_10][var_11], var_9[var_10][var_12] + var_9[var_12][var_11]\n )\nvar_6 = 0\nfor var_10 in range(var_4 - 1):\n for var_11 in range(var_10 + 1, var_4):\n if var_1[var_10][var_11] == var_2:\n continue\n if var_1[var_10][var_11] > var_9[var_10][var_11]:\n var_6 += 1\nprint(var_6)\n", "slow_time": 14535365898, "fast_time": 51979264, "speedup": 279.6378, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_29"} -{"pair_id": "python_6128", "problem_id": "p03173", "language": "python", "slow_code": "from numpy import *\n\nvar_10, var_1 = open(0)\nvar_10 = int(var_10)\nvar_1 = var_4(var_6([0] + var_1.split()))\nvar_5 = var_13((var_10, var_10 + 1), \"i8\")\nfor var_7 in range(1, var_10):\n var_8 = var_3(var_10 - var_7)\n var_12 = var_3(var_7 + 1, var_10 + 1)\n var_9 = (var_3(1, var_7 + 1) + var_8[:, var_11]).T\n var_5[var_8, var_12] = (\n var_2(var_5[var_8, var_9] + var_5[var_9, var_12], 0)\n + var_1[var_12]\n - var_1[var_8]\n )\nprint((var_5[0, var_10]))\n", "fast_code": "import sys\n\nsys.setrecursionlimit(1000000000)\nvar_7 = sys.stdin.readline\nvar_1 = 10**15\nvar_10 = int(eval(var_7()))\nvar_2 = list(map(int, var_7().split()))\nvar_4 = [0] * (var_10 + 1)\nfor var_6 in range(var_10):\n var_4[var_6 + 1] = var_4[var_6] + var_2[var_6]\nvar_5 = [[-1] * var_10 for var_6 in range(var_10)]\nfor var_6 in range(var_10):\n var_5[var_6][var_6] = 0\n\n\ndef func_1(var_6, var_8):\n if var_5[var_6][var_8] >= 0:\n return var_5[var_6][var_8]\n var_3 = var_1\n for var_9 in range(var_6, var_8):\n var_3 = min(var_3, func_1(var_6, var_9) + func_1(var_9 + 1, var_8))\n var_5[var_6][var_8] = var_3 + var_4[var_8 + 1] - var_4[var_6]\n return var_5[var_6][var_8]\n\n\nprint((func_1(0, var_10 - 1)))\n", "slow_time": 9597255804, "fast_time": 66199946, "speedup": 144.9738, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_5"} -{"pair_id": "python_7853", "problem_id": "p02888", "language": "python", "slow_code": "from collections import defaultdict, deque, Counter, OrderedDict\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce, lru_cache\nfrom heapq import heappush, heappop, heapify\nimport itertools\nimport math, fractions\nimport sys, copy\n\n\ndef func_3():\n return sys.stdin.readline().split()\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_12():\n return list(sys.stdin.readline().rstrip())\n\n\ndef func_4():\n return [int(var_16) for var_16 in sys.stdin.readline().split()]\n\n\ndef func_5():\n return [int(var_16) - 1 for var_16 in sys.stdin.readline().split()]\n\n\ndef func_9():\n return [list(var_16) for var_16 in sys.stdin.readline().split()]\n\n\ndef func_11(var_14):\n return [sys.stdin.readline().strip() for _ in range(var_14)]\n\n\ndef func_8(var_14):\n return [func_3() for _ in range(var_14)]\n\n\ndef func_2(var_14):\n return [func_1() for _ in range(var_14)]\n\n\ndef func_6(var_14):\n return [func_4() for _ in range(var_14)]\n\n\ndef func_7(var_14):\n return [func_5() for _ in range(var_14)]\n\n\ndef func_13(var_14):\n return [func_12() for _ in range(var_14)]\n\n\ndef func_10(var_14):\n return [func_9() for _ in range(var_14)]\n\n\ndef func_17(var_14, var_15):\n return math.factorial(var_14) // math.factorial(var_15)\n\n\ndef func_14(var_14, var_15):\n return math.factorial(var_14) // (\n math.factorial(var_15) * math.factorial(var_14 - var_15)\n )\n\n\ndef func_16(var_14, *var_7, var_8=0):\n return (\n [func_16(*var_7, default=var_8) for _ in range(var_14)]\n if len(var_7) > 0\n else [var_8 for _ in range(var_14)]\n )\n\n\nvar_9 = [[1, 0], [0, 1], [-1, 0], [0, -1]]\nvar_10 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]\nvar_5 = \"abcdefghijklmnopqrstuvwxyz\"\nvar_1 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nvar_3 = 1000000007\nvar_2 = float(\"inf\")\nsys.setrecursionlimit(1000000)\n\n\ndef func_15():\n var_4 = func_1()\n func_3 = sorted(func_4())\n var_6 = 0\n for var_11 in range(var_4):\n var_13 = var_11\n for var_12 in range(var_11 + 1, var_4):\n while var_13 < var_4 and func_3[var_13] < func_3[var_11] + func_3[var_12]:\n var_13 += 1\n var_6 += var_13 - (var_12 + 1)\n print(var_6)\n\n\nif __name__ == \"__main__\":\n func_15()\n", "fast_code": "from bisect import bisect_left, bisect_right\n\nvar_5 = int(eval(input()))\nvar_7 = list(map(int, input().split()))\nvar_7.sort()\nvar_1 = 0\nfor var_2 in range(var_5):\n for var_3 in range(var_2 + 1, var_5):\n var_4 = bisect_left(var_7, var_7[var_3] - var_7[var_2] + 1)\n var_6 = bisect_right(var_7, var_7[var_2] + var_7[var_3] - 1) - 1\n if var_6 < 0 or var_4 >= var_5:\n break\n var_1 += var_6 - var_4 + 1\n if var_4 <= var_2 <= var_6:\n var_1 -= 1\n if var_4 <= var_3 <= var_6:\n var_1 -= 1\nprint((var_1 // 3))\n", "slow_time": 203845466, "fast_time": 52333859, "speedup": 3.8951, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_17"} -{"pair_id": "python_11514", "problem_id": "p02621", "language": "python", "slow_code": "import sys\n\n\ndef func_5():\n return sys.stdin.readline().strip()\n\n\ndef func_1():\n return int(eval(func_5()))\n\n\ndef func_3():\n return list(map(int, func_5().split()))\n\n\ndef func_2():\n return list(map(int, func_5().split()))\n\n\ndef func_4(var_3):\n return list(zip(*(func_3() for _ in range(var_3))))\n\n\ndef func_6():\n sys.setrecursionlimit(10**8)\n var_1 = float(\"inf\")\n var_2 = func_1()\n print((var_2 + var_2**2 + var_2**3))\n return\n\n\nif __name__ == \"__main__\":\n func_6()\n", "fast_code": "var_1 = int(input())\nprint(var_1 + var_1**2 + var_1**3)\n", "slow_time": 53894386, "fast_time": 7277371, "speedup": 7.4057, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_29"} -{"pair_id": "python_10773", "problem_id": "p03767", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_9():\n return [int(var_15) for var_15 in sys.stdin.readline().split()]\n\n\ndef func_7():\n return int(sys.stdin.readline())\n\n\ndef func_11():\n return [list(var_15) for var_15 in sys.stdin.readline().split()]\n\n\ndef func_13():\n return list(sys.stdin.readline())[:-1]\n\n\ndef func_8(var_12):\n return [func_7() for var_8 in range(var_12)]\n\n\ndef func_10(var_12):\n return [func_9() for var_8 in range(var_12)]\n\n\ndef func_14(var_12):\n return [func_13() for var_8 in range(var_12)]\n\n\ndef func_12(var_12):\n return [func_11() for var_8 in range(var_12)]\n\n\nsys.setrecursionlimit(1000000)\nvar_11 = 1000000007\n\n\ndef func_1():\n var_12 = func_7()\n var_1 = func_9()\n var_1.sort(key=lambda var_15: -var_15)\n var_2 = 0\n for var_8 in range(var_12):\n var_2 += var_1[2 * var_8 + 1]\n print(var_2)\n return\n\n\ndef func_2():\n def func_15(var_5, var_15, var_4):\n if var_5 <= var_6[var_15]:\n return\n var_6[var_15] = var_5\n if not var_7[var_15]:\n var_7[var_15] = var_4\n for var_16 in var_14[var_15]:\n func_15(var_5 - 1, var_16, var_4)\n\n var_12, var_10 = func_9()\n var_7 = [0] * var_12\n var_14 = [[] for var_8 in range(var_12)]\n for var_8 in range(var_10):\n var_1, var_3 = func_9()\n var_1 -= 1\n var_3 -= 1\n var_14[var_1].append(var_3)\n var_14[var_3].append(var_1)\n var_6 = defaultdict(lambda: -1)\n var_13 = func_7()\n var_9 = func_10(var_13)\n var_9 = var_9[::-1]\n for var_15, var_5, var_4 in var_9:\n var_15 -= 1\n func_15(var_5, var_15, var_4)\n for var_8 in var_7:\n print(var_8)\n return\n\n\ndef func_3():\n var_12 = func_7()\n return\n\n\ndef func_4():\n var_12 = func_7()\n return\n\n\ndef func_5():\n var_12 = func_7()\n return\n\n\ndef func_6():\n var_12 = func_7()\n return\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_3, *var_1 = list(map(int, open(0).read().split()))\nprint(\n (sum(var_4 for var_2, var_4 in enumerate(sorted(var_1)[var_3:]) if var_2 % 2 < 1))\n)\n", "slow_time": 173061558, "fast_time": 32424457, "speedup": 5.3374, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_29"} -{"pair_id": "python_15150", "problem_id": "p03775", "language": "python", "slow_code": "import sys\n\n\ndef func_11():\n return sys.stdin.readline().strip()\n\n\ndef func_12(var_4, var_6, var_7):\n return [[var_7] * var_6 for var_12 in range(var_4)]\n\n\ndef func_13(var_4, var_6, var_7, var_8):\n return [[[var_8] * var_7 for var_13 in range(var_6)] for var_12 in range(var_4)]\n\n\ndef func_14(var_4, var_6, var_7, var_8, var_11):\n return [\n [[[var_11] * var_8 for var_13 in range(var_7)] for var_13 in range(var_6)]\n for var_12 in range(var_4)\n ]\n\n\ndef func_8(var_15, var_16=1):\n return int(-(-var_15 // var_16))\n\n\ndef func_1():\n return int(eval(func_11()))\n\n\ndef func_3():\n return list(map(int, func_11().split()))\n\n\ndef func_2(var_3=None):\n return list(func_3()) if var_3 is None else [func_1() for var_12 in range(var_3)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_1 = 10**18\nvar_2 = 10**9 + 7\n\n\ndef func_10(var_3: int) -> set:\n \"\"\"\"\"\"\n from math import sqrt\n\n var_14 = {1, var_3}\n\n for var_12 in range(2, int(sqrt(var_3)) + 1):\n\n if var_3 % var_12 == 0:\n var_14.add(var_12)\n var_14.add(var_3 // var_12)\n return var_14\n\n\ndef func_9(var_4, var_6):\n return max(len(str(var_4)), len(str(var_6)))\n\n\nvar_3 = func_1()\nvar_5 = var_1\nfor var_9 in func_10(var_3):\n var_10 = var_3 // var_9\n var_5 = min(var_5, func_9(var_9, var_10))\nprint(var_5)\n", "fast_code": "def func_1(var_8, var_4):\n if var_4:\n if var_8 <= 1:\n return [1], 1\n else:\n var_7 = 2\n var_10 = []\n var_5 = 1\n while var_7 * var_7 <= var_8:\n var_3 = 0\n while var_8 % var_7 == 0:\n var_8 //= var_7\n var_10.append(var_7)\n if var_3 >= 1:\n var_5 *= var_3 + 1\n var_7 += 1\n if var_8 >= 2:\n var_10.append(var_8)\n var_5 *= 2\n return var_10, var_5\n else:\n if var_8 <= 1:\n return [1], [1], 1\n else:\n var_7 = 2\n var_10 = []\n var_9 = []\n var_5 = 1\n while var_7 * var_7 <= var_8:\n var_3 = 0\n while var_8 % var_7 == 0:\n var_8 //= var_7\n var_3 += 1\n if var_3 >= 1:\n var_10.append(var_7)\n var_9.append(var_3)\n var_5 *= var_3 + 1\n var_7 += 1\n if var_8 >= 2:\n var_10.append(var_8)\n var_9.append(1)\n var_5 *= 2\n return var_10, var_9, var_5\n\n\nfrom itertools import combinations\nfrom operator import mul\nfrom functools import reduce\n\nvar_8 = int(eval(input()))\nvar_10, _ = func_1(var_8, True)\nvar_6 = len(str(var_8))\nfor var_12 in range(1, len(var_10) + 1):\n for var_1 in set(reduce(mul, var_11) for var_11 in combinations(var_10, var_12)):\n var_2 = var_8 // var_1\n var_6 = min(var_6, max(len(str(var_1)), len(str(var_2))))\nprint(var_6)\n", "slow_time": 1058543442, "fast_time": 233216425, "speedup": 4.5389, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_7"} -{"pair_id": "python_2078", "problem_id": "p02989", "language": "python", "slow_code": "import math\n\n\ndef func_3():\n print(\"Yes\")\n\n\ndef func_2():\n print(\"No\")\n\n\ndef func_1():\n var_7 = int(eval(input()))\n return var_7\n\n\nvar_4 = 0\nvar_6 = 0\nvar_5 = 0\nvar_3 = func_1()\nvar_1 = [int(var_7) for var_7 in input().split()]\nvar_1.sort()\nvar_4 = int(var_3 / 2 - 1)\nvar_5 = var_4 + 1\nif var_1[var_4] != var_1[var_5]:\n for var_2 in range(var_1[var_5] - var_1[var_4]):\n var_6 = var_6 + 1\nprint(var_6)\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nvar_2.sort()\nprint((var_2[var_1 // 2] - var_2[var_1 // 2 - 1]))\n", "slow_time": 245848196, "fast_time": 18308941, "speedup": 13.4278, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_7"} -{"pair_id": "python_2962", "problem_id": "p03146", "language": "python", "slow_code": "var_3 = []\nvar_3.append(int(eval(input())))\nfor var_1 in range(1, 100000):\n if var_3[var_1 - 1] % 2 == 0:\n var_3.append(var_3[var_1 - 1] // 2)\n else:\n var_3.append(var_3[var_1 - 1] * 3 + 1)\nfor var_1 in range(100000):\n for var_2 in range(var_1 + 1, 100000):\n if var_3[var_1] == var_3[var_2]:\n print((var_2 + 1))\n break\n else:\n continue\n break\n", "fast_code": "var_4 = int(eval(input()))\n\n\ndef func_1(var_3):\n if var_3 % 2 == 0:\n return var_3 // 2\n else:\n return 3 * var_3 + 1\n\n\nvar_1 = [var_4]\nfor var_2 in range(1, 1000001):\n if var_1[var_2 - 1] in var_1[: var_2 - 1]:\n print(var_2)\n break\n else:\n var_1.append(func_1(var_1[var_2 - 1]))\n", "slow_time": 271547962358, "fast_time": 46636364, "speedup": 5822.6658, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_25"} -{"pair_id": "python_13276", "problem_id": "p03035", "language": "python", "slow_code": "import sys, math, collections, heapq, itertools\n\nvar_3 = sys.stdin\n\n\ndef func_3():\n return var_3.readline().strip(\"\\n\")\n\n\ndef func_2():\n return var_3.readline().strip(\"\\n\").split()\n\n\ndef func_1(var_4, var_5):\n var_4, var_5 = max(var_4, var_5), min(var_4, var_5)\n while var_4 % var_5 > 0:\n var_4, var_5 = var_5, var_4 % var_5\n return var_5\n\n\ndef func_4():\n var_1, var_2 = list(map(int, func_2()))\n if var_1 >= 13:\n print(var_2)\n elif var_1 >= 6:\n print((var_2 // 2))\n else:\n print((0))\n return 0\n\n\nif __name__ == \"__main__\":\n func_4()\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nprint((var_2 if var_1 > 12 else int(var_2 / 2) if 5 < var_1 and var_1 < 13 else 0))\n", "slow_time": 48276073, "fast_time": 14543017, "speedup": 3.3195, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_16"} -{"pair_id": "python_4129", "problem_id": "p03170", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys\nimport numpy as np\n\nsys.setrecursionlimit(10**9)\n\n\nvar_8 = 10**9 + 7\n\nvar_3, var_2 = list(map(int, input().split()))\nvar_1 = np.array(list(map(int, input().split())))\nvar_6 = [True for var_7 in range(var_2 + var_1[-1] + 1)]\nfor var_7 in range(var_2):\n if var_6[var_7]:\n for var_4 in var_1:\n var_6[var_7 + var_4] = False\n\n\nif var_6[var_2]:\n var_5 = \"Second\"\nelse:\n var_5 = \"First\"\nprint(var_5)\n", "fast_code": "def func_1():\n var_3, var_2, *var_1 = list(map(int, open(0).read().split()))\n var_5 = [0] * (var_2 + 1)\n for var_6 in range(var_2):\n if var_5[var_6]:\n continue\n for var_4 in var_1:\n if var_6 + var_4 > var_2:\n break\n var_5[var_6 + var_4] = 1\n print((\"First\" if var_5[-1] else \"Second\"))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 1985487989, "fast_time": 337356019, "speedup": 5.8854, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_1"} -{"pair_id": "python_3272", "problem_id": "p03354", "language": "python", "slow_code": "import sys\n\n\ndef func_11():\n return sys.stdin.readline().strip()\n\n\ndef func_13(var_6, var_7, var_8):\n return [[var_8] * var_7 for var_12 in range(var_6)]\n\n\ndef func_14(var_6, var_7, var_8, var_10):\n return [[[var_10] * var_8 for var_13 in range(var_7)] for var_12 in range(var_6)]\n\n\ndef func_15(var_6, var_7, var_8, var_10, var_11):\n return [\n [[[var_11] * var_10 for var_13 in range(var_8)] for var_13 in range(var_7)]\n for var_12 in range(var_6)\n ]\n\n\ndef func_8(var_18, var_19=1):\n return int(-(-var_18 // var_19))\n\n\ndef func_1():\n return int(eval(func_11()))\n\n\ndef func_3():\n return list(map(int, func_11().split()))\n\n\ndef func_2(var_4=None):\n return list(func_3()) if var_4 is None else [func_1() for var_12 in range(var_4)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_1 = float(\"inf\")\nvar_3 = 10**9 + 7\n\n\nclass Class_1:\n \"\"\"\"\"\"\n\n def __init__(self, var_14):\n self.n = var_14\n\n self.par = [var_12 for var_12 in range(var_14 + 1)]\n\n self.rank = [0] * (var_14 + 1)\n\n self.size = [1] * (var_14 + 1)\n\n self.tree = [True] * (var_14 + 1)\n\n def func_9(self, var_18):\n \"\"\"\"\"\"\n\n if self.par[var_18] == var_18:\n return var_18\n else:\n\n self.par[var_18] = self.find(self.par[var_18])\n return self.par[var_18]\n\n def func_17(self, var_18, var_19):\n \"\"\"\"\"\"\n\n var_18 = self.find(var_18)\n var_19 = self.find(var_19)\n\n if var_18 == var_19:\n self.tree[var_18] = False\n return\n if not self.tree[var_18] or not self.tree[var_19]:\n self.tree[var_18] = self.tree[var_19] = False\n\n if self.rank[var_18] < self.rank[var_19]:\n self.par[var_18] = var_19\n self.size[var_19] += self.size[var_18]\n else:\n self.par[var_19] = var_18\n self.size[var_18] += self.size[var_19]\n\n if self.rank[var_18] == self.rank[var_19]:\n self.rank[var_18] += 1\n\n def func_16(self, var_18, var_19):\n \"\"\"\"\"\"\n return self.find(var_18) == self.find(var_19)\n\n def func_10(self, var_18):\n \"\"\"\"\"\"\n return self.size[self.find(var_18)]\n\n def func_12(self, var_18):\n \"\"\"\"\"\"\n return self.tree[self.find(var_18)]\n\n def len(self):\n \"\"\"\"\"\"\n var_16 = set()\n for var_12 in range(self.n + 1):\n var_16.add(self.find(var_12))\n\n return len(var_16) - 1\n\n\nvar_4, var_2 = func_3()\nvar_5 = [var_15 - 1 for var_15 in func_2()]\nvar_17 = Class_1(var_4)\nfor var_12 in range(var_2):\n var_6, var_7 = func_3()\n var_6 -= 1\n var_7 -= 1\n var_17.union(var_5[var_6], var_5[var_7])\nvar_9 = 0\nfor var_12 in range(var_4):\n var_15 = var_5[var_12]\n if var_17.same(var_15, var_12):\n var_9 += 1\nprint(var_9)\n", "fast_code": "var_8, var_6 = list(map(int, input().split()))\nvar_9 = list(map(int, input().split()))\nvar_10 = [var_5 for var_5 in range(var_8)]\n\n\ndef func_1(var_11):\n if var_10[var_11] == var_11:\n return var_10[var_11]\n else:\n var_10[var_11] = func_1(var_10[var_11])\n return var_10[var_11]\n\n\ndef func_2(var_11, var_12):\n var_3 = func_1(var_11)\n var_4 = func_1(var_12)\n if var_3 != var_4:\n var_10[var_3] = var_4\n\n\nvar_2 = lambda var_11: int(var_11) - 1\nfor var_7 in range(var_6):\n var_11, var_12 = list(map(var_2, input().split()))\n func_2(var_11, var_12)\nvar_1 = 0\nfor var_5 in range(var_8):\n if func_1(var_9[var_5] - 1) == func_1(var_5):\n var_1 += 1\nprint(var_1)\n", "slow_time": 247598194, "fast_time": 68337969, "speedup": 3.6231, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_16"} -{"pair_id": "python_14960", "problem_id": "p03212", "language": "python", "slow_code": "import itertools\n\nvar_1 = int(eval(input()))\nvar_3 = 0\nvar_2 = []\nfor var_4 in range(10):\n var_2 += list(itertools.product(\"357\", repeat=var_4))\nfor var_5 in var_2:\n if len(set(var_5)) > 2 and int(\"\".join(var_5)) <= var_1:\n var_3 += 1\nprint(var_3)\n", "fast_code": "var_5 = int(eval(input()))\nvar_3 = len(str(var_5))\nif var_3 <= 2:\n print((0))\nelse:\n\n var_1 = 0\n for var_2 in range(3, var_3):\n var_1 += pow(3, var_2) - 3 - (3 * (pow(2, var_2) - 2))\n from itertools import product\n\n for var_4 in product([\"3\", \"5\", \"7\"], repeat=var_3):\n if not \"3\" in var_4 or not \"5\" in var_4 or not \"7\" in var_4:\n continue\n var_6 = int(\"\".join(var_4))\n if var_6 <= var_5:\n var_1 += 1\n print(var_1)\n", "slow_time": 8827412284, "fast_time": 1696944730, "speedup": 5.2019, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_23"} -{"pair_id": "python_1377", "problem_id": "p03037", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\nvar_7 = 10**20\nvar_10 = 10**9 + 7\nvar_4 = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nvar_5 = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef func_2():\n return [int(var_12) for var_12 in sys.stdin.readline().split()]\n\n\ndef func_3():\n return [int(var_12) - 1 for var_12 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_4():\n return sys.stdin.readline().split()\n\n\ndef func_5():\n return eval(input())\n\n\ndef func_6():\n var_11, var_8 = func_2()\n var_9 = [0] * (var_11 + 1)\n for _ in range(var_8):\n var_1, var_3 = func_2()\n var_9[var_1 - 1] += 1\n var_9[var_3] -= 1\n for var_6 in range(var_11 - 1):\n var_9[var_6 + 1] += var_9[var_6]\n var_2 = 0\n for var_12 in var_9[:-1]:\n if var_12 == var_8:\n var_2 += 1\n return var_2\n\n\nprint((func_6()))\n", "fast_code": "var_5, var_4 = list(map(int, input().split()))\nvar_3 = 0\nvar_7 = 10**5 + 1\nfor var_1 in range(var_4):\n var_2, var_6 = list(map(int, input().split()))\n if var_2 > var_3:\n var_3 = var_2\n if var_6 < var_7:\n var_7 = var_6\nelse:\n\n if var_7 - var_3 + 1 > var_5:\n print(var_5)\n elif var_7 - var_3 + 1 < 0:\n print((0))\n else:\n print((var_7 - var_3 + 1))\n", "slow_time": 2050306644, "fast_time": 25339175, "speedup": 80.9145, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_28"} -{"pair_id": "python_10641", "problem_id": "p04006", "language": "python", "slow_code": "from collections import deque\n\n\nclass Class_1:\n \"\"\"\"\"\"\n\n def __init__(self, var_9):\n self.que = deque([])\n self.leng = var_9\n\n def func_3(self):\n return self.que[0]\n\n def func_1(self):\n return self.que\n\n def func_4(self, var_8, var_13):\n while self.que:\n if self.que[-1][1] >= var_13:\n self.que.pop()\n else:\n break\n self.que.append((var_8, var_13))\n if self.que[0][0] == var_8 - self.leng:\n self.que.popleft()\n\n\nvar_3, var_4 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\n\n\ndef func_2(var_10):\n\n var_2 = var_1 + var_1\n var_11 = Class_1(var_10 + 1)\n var_12 = [10**18] * var_3\n for var_7, var_5 in enumerate(var_2):\n var_11.update(var_7, var_5)\n var_12[var_7 % var_3] = min(var_12[var_7 % var_3], var_11.top()[1])\n return sum(var_12) + var_10 * var_4\n\n\nvar_6 = sum(var_1)\nfor var_7 in range(var_3):\n var_6 = min(var_6, func_2(var_7))\nprint(var_6)\n", "fast_code": "var_6, var_8 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))[::-1] * 2\nvar_2 = var_1[:var_6]\nvar_3 = float(\"inf\")\nfor var_5 in range(var_6):\n var_7 = var_8 * var_5 + sum(var_2)\n var_3 = min(var_3, var_7)\n for var_4 in range(var_6):\n var_2[var_4] = min(var_2[var_4], var_1[var_4 + var_5 + 1])\nprint(var_3)\n", "slow_time": 95219741, "fast_time": 34405462, "speedup": 2.7676, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_29"} -{"pair_id": "python_9245", "problem_id": "p02960", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(2**31 - 1)\nvar_10 = sys.stdin.readline\nvar_15 = sys.stdout.write\nvar_3 = lambda: list(map(int, var_10().split()))\nvar_2 = lambda: int(var_10())\nvar_7 = lambda *var_14: print(*var_14) if var_1 is True else 0\nvar_1 = True\nvar_4 = 10**9 + 7\n\n\nclass Class_1:\n def __init__(self, var_16):\n self.x = var_16.x if isinstance(var_16, Class_1) else var_16 % var_4\n\n __str__ = lambda self: str(self.x)\n __repr__ = __str__\n __int__ = lambda self: self.x\n __index__ = __int__\n __add__ = lambda self, var_13: Class_1(self.x + Class_1(var_13).x)\n __sub__ = lambda self, var_13: Class_1(self.x - Class_1(var_13).x)\n __mul__ = lambda self, var_13: Class_1(self.x * Class_1(var_13).x)\n __pow__ = lambda self, var_13: Class_1(pow(self.x, Class_1(var_13).x, var_4))\n __mod__ = lambda self, var_13: Class_1(self.x % Class_1(var_13).x)\n __truediv__ = lambda self, var_13: Class_1(\n self.x * pow(Class_1(var_13).x, var_4 - 2, var_4)\n )\n __floordiv__ = lambda self, var_13: Class_1(self.x // Class_1(var_13).x)\n __radd__ = lambda self, var_13: Class_1(var_13 + self.x)\n __rsub__ = lambda self, var_13: Class_1(var_13 - self.x)\n __rpow__ = lambda self, var_13: Class_1(pow(var_13, self.x, var_4))\n __rmod__ = lambda self, var_13: Class_1(var_13 % self.x)\n __rmul__ = lambda self, var_13: Class_1(var_13 * self.x)\n __rtruediv__ = lambda self, var_13: Class_1(var_13 * pow(self.x, var_4 - 2, var_4))\n __rfloordiv__ = lambda self, var_13: Class_1(var_13 // self.x)\n __lt__ = lambda self, var_13: self.x < Class_1(var_13).x\n __gt__ = lambda self, var_13: self.x > Class_1(var_13).x\n __le__ = lambda self, var_13: self.x <= Class_1(var_13).x\n __ge__ = lambda self, var_13: self.x >= Class_1(var_13).x\n __eq__ = lambda self, var_13: self.x == Class_1(var_13).x\n __ne__ = lambda self, var_13: self.x != Class_1(var_13).x\n\n\ndef func_1():\n var_6 = var_10()\n var_5 = len(var_6) - 1\n var_8 = [[0] * 13 for _ in range(var_5)]\n var_8[0] = [Class_1(0) for _ in range(13)]\n if var_6[0] == \"?\":\n for var_9 in range(10):\n var_8[0][var_9] = Class_1(1)\n else:\n var_8[0][int(var_6[0])] = Class_1(1)\n for var_9 in range(1, var_5):\n if var_6[var_9] == \"?\":\n for var_11 in range(13):\n for var_12 in range(10):\n var_8[var_9][(var_11 * 10 + var_12) % 13] += var_8[var_9 - 1][\n var_11\n ]\n else:\n for var_11 in range(13):\n var_8[var_9][(var_11 * 10 + int(var_6[var_9])) % 13] += var_8[\n var_9 - 1\n ][var_11]\n print(var_8[len(var_6) - 2][5])\n pass\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "def func_1():\n var_8 = input()[::-1]\n var_6 = 13\n var_7 = 10**9 + 7\n var_2 = [0] * var_6\n var_2[0] = 1\n for var_3, var_9 in enumerate(var_8):\n var_10 = [0] * var_6\n if var_9 == \"?\":\n for var_4 in range(10):\n var_1 = var_4 * pow(10, var_3, var_6)\n for var_5 in range(var_6):\n var_10[(var_5 + var_1) % var_6] += var_2[var_5]\n var_10[(var_5 + var_1) % var_6] %= var_7\n else:\n var_1 = int(var_9) * pow(10, var_3, var_6)\n for var_5 in range(var_6):\n var_10[(var_5 + var_1) % var_6] += var_2[var_5]\n var_2 = var_10\n print((var_2[5]))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 1268853843, "fast_time": 415631791, "speedup": 3.0528, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_5"} -{"pair_id": "python_7952", "problem_id": "p02708", "language": "python", "slow_code": "var_5, var_2 = list(map(int, input().split()))\nvar_4 = 10**9 + 7\nvar_3, var_1 = 0, var_5\nvar_6 = 0\nif 1 >= var_2:\n var_6 += var_1 - var_3 + 1\nfor var_7 in range(2, var_5 + 2):\n var_3 += var_7 - 1\n var_1 += var_5 - var_7 + 1\n var_3 %= var_4\n var_1 %= var_4\n if var_7 >= var_2:\n var_6 += var_1 - var_3 + 1\n var_6 %= var_4\nprint(var_6)\n", "fast_code": "var_4, var_3 = list(map(int, input().split()))\nvar_1 = 0\nfor var_2 in range(var_3 - 1, var_4 + 1):\n var_1 += (var_2 + 1) * (var_4 - var_2) + 1\nprint((var_1 % (10**9 + 7)))\n", "slow_time": 6613404738, "fast_time": 1030575116, "speedup": 6.4172, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_11"} -{"pair_id": "python_11844", "problem_id": "p03150", "language": "python", "slow_code": "import re\nfrom sys import stdin\n\nvar_1 = stdin.readline().rstrip()\nfor var_3 in range(7):\n var_4 = \"keyence\"[0 : var_3 + 1]\n var_2 = \"keyence\"[var_3 + 1 : 8]\n if re.search(\".*keyencekeyence\", var_1):\n if (re.sub(\".*keyencekeyence\", \"\", var_1) == \"\") == True:\n print(\"YES\")\n break\n if re.search(\"keyencekeyence.*\", var_1):\n if (re.sub(\"keyencekeyence.*\", \"\", var_1) == \"\") == True:\n print(\"YES\")\n break\n if (re.sub(\".*keyence\", \"\", var_1) == \"\") == True:\n print(\"YES\")\n break\n if (re.sub(\"keyence.*\", \"\", var_1) == \"\") == True:\n print(\"YES\")\n break\n if re.match(\"%s.*%s\" % (var_4, var_2), var_1):\n if (re.sub(\"%s.*%s\" % (var_4, var_2), \"\", var_1) == \"\") == True:\n print(\"YES\")\n break\nif var_3 == 6:\n print(\"NO\")\n", "fast_code": "def func_1():\n var_2 = input()\n var_1 = len(var_2)\n var_4 = \"keyence\"\n for var_5 in range(var_1):\n for var_6 in range(var_1 + 1):\n var_3 = var_2[:var_5] + var_2[var_5 + var_6 :]\n if var_3 == var_4:\n return print(\"YES\")\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 137922673, "fast_time": 32582832, "speedup": 4.233, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_14"} -{"pair_id": "python_7573", "problem_id": "p03835", "language": "python", "slow_code": "var_1, var_2 = list(map(int, input().split()))\nvar_3 = 0\nfor var_4 in range(var_1 + 1):\n for var_5 in range(var_1 + 1):\n if 0 <= var_2 - var_4 - var_5 <= var_1:\n var_3 += 1\nprint(var_3)\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nvar_3 = 0\nfor var_4 in range(min(var_2, var_1) + 1):\n for var_5 in range(min(var_2 - var_4, var_1) + 1):\n if var_2 - var_4 - var_5 <= var_1:\n var_3 += 1\nprint(var_3)\n", "slow_time": 351228075, "fast_time": 45731781, "speedup": 7.6802, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_13"} -{"pair_id": "python_10781", "problem_id": "p02935", "language": "python", "slow_code": "import math\nimport statistics\n\n\ndef func_1(var_7):\n if var_7 == 1:\n return 1\n else:\n return var_7 * func_1(var_7 - 1)\n\n\ndef func_2(var_1, var_2):\n if var_1 == 0:\n return var_2\n elif var_2 == 0:\n return var_1\n else:\n return func_2(var_2, var_1 % var_2)\n\n\ndef func_3(var_1, var_2):\n return var_1 * var_2 / func_2(var_1, var_2)\n\n\ndef func_4(var_10):\n if len(var_10) < 1:\n return var_10\n var_8 = var_10[0]\n var_6 = []\n var_9 = []\n for var_13 in range(1, len(var_10)):\n if var_10[var_13] <= var_8:\n var_6.append(var_10[var_13])\n else:\n var_9.append(var_10[var_13])\n var_6 = func_4(var_6)\n var_9 = func_4(var_9)\n var_3 = [var_8]\n return var_6 + var_3 + var_9\n\n\nvar_7 = int(eval(input()))\n\nvar_11 = list(int(var_4) for var_4 in input().split())\nvar_5 = 0.00\nfor var_4 in range(var_7):\n var_12 = sorted(var_11)\n if len(var_11) == 2:\n var_5 = (var_11[0] + var_11[1]) / 2.00\n break\n\n var_11 = var_12\n var_5 = (var_11[0] + var_11[1]) / 2.00\n del var_11[0]\n del var_11[0]\n var_11.append(var_5)\n\nprint((\"{:.6f}\".format(var_5)))\n", "fast_code": "var_3 = int(eval(input()))\nvar_4 = list(map(int, input().split()))\nvar_4.sort()\nvar_1 = var_4[0]\nfor var_2 in range(1, var_3):\n var_1 = (var_1 + var_4[var_2]) / 2\nprint(var_1)\n", "slow_time": 92880138, "fast_time": 21829111, "speedup": 4.2549, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_6"} -{"pair_id": "python_14699", "problem_id": "p02713", "language": "python", "slow_code": "import math\nfrom functools import reduce\n\nvar_4 = int(eval(input()))\n\n\ndef func_1(*var_6):\n return reduce(math.gcd, var_6)\n\n\nvar_1 = 0\nfor var_2 in range(1, var_4 + 1):\n for var_3 in range(1, var_4 + 1):\n for var_5 in range(1, var_4 + 1):\n var_1 += func_1(var_2, var_3, var_5)\nprint(var_1)\n", "fast_code": "from math import gcd\n\nvar_4 = int(eval(input()))\nvar_1 = [\n gcd(var_2, var_3) for var_2 in range(1, var_4 + 1) for var_3 in range(1, var_4 + 1)\n]\nvar_5 = [gcd(var_2, var_3) for var_2 in range(1, var_4 + 1) for var_3 in var_1]\nprint((sum(var_5)))\n", "slow_time": 44139168611, "fast_time": 5961110849, "speedup": 7.4045, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_14"} -{"pair_id": "python_6674", "problem_id": "p00100", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys\n\n\ndef func_2(var_2):\n var_7 = []\n var_8 = [0 for _ in range(4000 + 1)]\n for var_4, var_9, var_6 in var_2:\n var_8[var_4] += var_9 * var_6\n if var_8[var_4] >= 1000000:\n if var_4 not in var_7:\n var_7.append(var_4)\n\n return var_7\n\n\ndef func_1(var_1):\n\n while True:\n var_5 = int(eval(input()))\n if var_5 == 0:\n break\n var_2 = []\n for _ in range(var_5):\n var_2.append([int(var_10) for var_10 in input().split(\" \")])\n var_7 = func_2(var_2)\n if var_7:\n for var_3 in var_7:\n print(var_3)\n else:\n print(\"NA\")\n\n\nif __name__ == \"__main__\":\n func_1(sys.argv[1:])\n", "fast_code": "var_7 = int(eval(input()))\nwhile var_7 != 0:\n var_6 = 0\n var_1 = []\n var_2 = []\n for var_7 in range(0, var_7):\n var_8 = input().split()\n if var_8[0] in var_1:\n var_4 = var_1.index(var_8[0])\n var_2[var_4] = var_2[var_4] + (int(var_8[1]) * int(var_8[2]))\n else:\n var_1.append(var_8[0])\n var_2.append(int(var_8[1]) * int(var_8[2]))\n for var_5, var_3 in enumerate(var_2):\n if var_3 >= 10**6:\n print((var_1[var_5]))\n var_6 = 1\n if var_6 == 0:\n print(\"NA\")\n var_7 = int(eval(input()))\n", "slow_time": 212744608, "fast_time": 59002991, "speedup": 3.6057, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_6"} -{"pair_id": "python_8603", "problem_id": "p02848", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nfrom inspect import currentframe\n\nvar_1 = 10**10\nvar_2 = 10**9 + 7\n\n\ndef func_8():\n return sys.stdin.readline().strip()\n\n\ndef func_7(var_12, var_13):\n return var_13 if var_12 % var_13 == 0 else func_7(var_13, var_12 % var_13)\n\n\ndef func_9(var_12, var_13):\n return (var_12 * var_13) // func_7(var_12, var_13)\n\n\ndef func_1():\n return int(func_8())\n\n\ndef func_4():\n return map(int, func_8().split())\n\n\ndef func_2():\n return [int(var_12) for var_12 in func_8().split()]\n\n\ndef func_5(var_3):\n return [int(func_8()) for _ in range(var_3)]\n\n\ndef func_3(var_3):\n return [[int(var_12) for var_12 in func_8().split()] for _ in range(var_3)]\n\n\ndef func_6(*var_7):\n var_9 = {\n id(var_11): var_8 for var_8, var_11 in currentframe().f_back.f_locals.items()\n }\n print(\n \", \".join(var_9.get(id(var_6), \"???\") + \" = \" + repr(var_6) for var_6 in var_7)\n )\n\n\nvar_3 = func_1()\nvar_4 = func_8()\nvar_5 = [\n \"A\",\n \"B\",\n \"C\",\n \"D\",\n \"E\",\n \"F\",\n \"G\",\n \"H\",\n \"I\",\n \"J\",\n \"K\",\n \"L\",\n \"M\",\n \"N\",\n \"O\",\n \"P\",\n \"Q\",\n \"R\",\n \"S\",\n \"T\",\n \"U\",\n \"V\",\n \"W\",\n \"X\",\n \"Y\",\n \"Z\",\n]\nfor var_10 in var_4:\n print(var_5[(var_5.index(var_10) + var_3) % 26], end=\"\")\n", "fast_code": "var_1 = int(input())\nvar_2 = input()\nfor var_4 in var_2:\n var_3 = chr((ord(var_4) - ord(\"A\") + var_1) % 26 + ord(\"A\"))\n print(var_3, end=\"\")\n", "slow_time": 118302228, "fast_time": 21722592, "speedup": 5.446, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_7"} -{"pair_id": "python_17731", "problem_id": "p03456", "language": "python", "slow_code": "var_1, var_3 = list(map(str, input().split()))\nvar_5 = int(var_1 + var_3)\nvar_2 = \"No\"\nfor var_4 in range(var_5 // 2):\n if var_5 == var_4 * var_4:\n var_2 = \"Yes\"\nprint(var_2)\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nif str(int(str(var_1) + str(var_2)) ** 0.5).split(\".\")[1:][0] == \"0\":\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 729346459, "fast_time": 18554788, "speedup": 39.3077, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_22"} -{"pair_id": "python_6429", "problem_id": "p03332", "language": "python", "slow_code": "var_8 = 998244353\nvar_7 = int(3e5 + 1)\n\n\ndef func_1(var_10, var_12):\n return var_10 * pow(var_12, var_8 - 2, var_8) % var_8\n\n\nvar_4 = [1] * (var_7 + 1)\nfor var_13 in range(1, var_7 + 1):\n var_4[var_13] = (var_13 * var_4[var_13 - 1]) % var_8\nvar_5 = [1] * (var_7 + 1)\nvar_5[var_7] = func_1(1, var_4[var_7])\nfor var_13 in range(var_7, 0, -1):\n var_5[var_13 - 1] = (var_5[var_13] * var_13) % var_8\n\n\ndef func_2():\n var_9, var_1, var_2, var_6 = list(map(int, input().split()))\n var_11 = 0\n\n for var_16 in range(var_9 + 1):\n var_3 = var_6 - var_16 * var_1\n if var_3 >= 0 and var_3 % var_2 == 0 and var_3 <= var_2 * var_9:\n var_17 = var_3 // var_2\n var_14 = var_4[var_9] * var_5[var_16] * var_5[var_9 - var_16] % var_8\n var_15 = var_4[var_9] * var_5[var_17] * var_5[var_9 - var_17] % var_8\n var_11 = (var_11 + var_14 * var_15) % var_8\n print(var_11)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "import sys\nimport numpy as np\n\nvar_19 = lambda: sys.stdin.readline().rstrip()\nvar_15 = lambda: int(var_19())\nvar_17 = lambda: list(map(int, var_19().split()))\nvar_6 = 998244353\nvar_7, var_1, var_2, var_3 = var_17()\nvar_9 = 0\n\n\ndef func_1(var_18, var_16):\n if var_16 < 0 or var_16 > var_18:\n return 0\n return var_13 * var_14[var_16] % var_6 * var_14[var_18 - var_16] % var_6\n\n\ndef func_2(var_10, var_6):\n var_4 = len(var_10)\n var_5 = int(var_4**0.5 + 1)\n var_10 = np.resize(var_10, var_5**2).reshape(var_5, var_5)\n for var_18 in range(1, var_5):\n var_10[:, var_18] *= var_10[:, var_18 - 1]\n var_10[:, var_18] %= var_6\n for var_18 in range(1, var_5):\n var_10[var_18] *= var_10[var_18 - 1, -1]\n var_10[var_18] %= var_6\n return var_10.ravel()[:var_4]\n\n\ndef func_3(var_8, var_6):\n var_21 = np.arange(var_8, dtype=np.int64)\n var_21[0] = 1\n var_12 = func_2(var_21, var_6)\n var_21 = np.arange(var_8, 0, -1, dtype=np.int64)\n var_21[0] = pow(int(var_12[-1]), var_6 - 2, var_6)\n var_14 = func_2(var_21, var_6)[::-1]\n return var_12, var_14\n\n\nvar_8 = var_7 + 1\nvar_12, var_14 = func_3(var_8, var_6)\nvar_13 = var_12[var_7]\nvar_11 = var_13 * var_14 % var_6 * var_14[::-1] % var_6\nfor var_21 in range(var_7 + 1):\n var_20 = var_3 - var_1 * var_21\n if var_20 % var_2 != 0:\n continue\n var_22 = var_20 // var_2\n if var_22 > var_7:\n continue\n if var_22 < 0:\n break\n var_9 += var_11[var_21] * var_11[var_22]\n var_9 %= var_6\nprint((var_9 % var_6))\n", "slow_time": 37432130329, "fast_time": 2879442490, "speedup": 12.9998, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_17"} -{"pair_id": "python_11145", "problem_id": "p03816", "language": "python", "slow_code": "import sys\nfrom collections import Counter\n\n\ndef func_9():\n return sys.stdin.readline().strip()\n\n\ndef func_10(var_6, var_8, var_9):\n return [[var_9] * var_8 for var_13 in range(var_6)]\n\n\ndef func_11(var_6, var_8, var_9, var_11):\n return [[[var_11] * var_9 for var_14 in range(var_8)] for var_13 in range(var_6)]\n\n\ndef func_12(var_6, var_8, var_9, var_11, var_12):\n return [\n [[[var_12] * var_11 for var_14 in range(var_9)] for var_14 in range(var_8)]\n for var_13 in range(var_6)\n ]\n\n\ndef func_8(var_16, var_17=1):\n return int(-(-var_16 // var_17))\n\n\ndef func_1():\n return int(eval(func_9()))\n\n\ndef func_3():\n return list(map(int, func_9().split()))\n\n\ndef func_2(var_5=None):\n return list(func_3()) if var_5 is None else [func_1() for var_13 in range(var_5)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_3 = 10**18\nvar_4 = 10**9 + 7\nvar_5 = func_1()\nvar_1 = func_2()\nvar_2 = Counter(var_1)\nfor var_15 in list(var_2.keys()):\n var_2[var_15] -= 1\nvar_10 = func_8(sum(var_2.values()), 2)\nvar_7 = var_5 - var_10 * 2\nprint(var_7)\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = list(map(int, input().split(\" \")))\nvar_3 = len(list(set(var_2)))\nif var_3 % 2 == 0:\n var_3 -= 1\nprint(var_3)\n", "slow_time": 126232290, "fast_time": 20817730, "speedup": 6.0637, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_2"} -{"pair_id": "python_14579", "problem_id": "p03603", "language": "python", "slow_code": "var_1 = int(input())\nvar_2 = list(map(int, input().split()))\nvar_3 = [0] + list(map(int, input().split()))\nvar_10 = [[] for _ in range(var_1 + 1)]\nfor var_8, var_13 in enumerate(var_2, 2):\n var_10[var_13].append(var_8)\n\n\ndef func_1(var_13):\n var_11 = len(var_10[var_13])\n if var_11 == 0:\n return var_3[var_13], 0\n var_7 = [[float(\"inf\")] * 5001 for _ in range(var_11 + 1)]\n var_7[0][0] = 0\n for var_8, var_6 in enumerate(var_10[var_13], 1):\n var_4, var_5 = func_1(var_6)\n for var_9 in range(var_4, 5001):\n var_7[var_8][var_9] = min(\n var_7[var_8][var_9], var_7[var_8 - 1][var_9 - var_4] + var_5\n )\n for var_9 in range(var_5, 5001):\n var_7[var_8][var_9] = min(\n var_7[var_8][var_9], var_7[var_8 - 1][var_9 - var_5] + var_4\n )\n var_12 = min(var_7[-1][: var_3[var_13] + 1])\n if var_12 == float(\"inf\"):\n print(\"IMPOSSIBLE\")\n exit()\n elif var_12 > var_3[var_13]:\n return var_12, var_3[var_13]\n else:\n return var_3[var_13], var_12\n\n\nprint(\"POSSIBLE\") if min(func_1(1)) <= var_3[1] else print(\"IMPOSSIBLE\")\n", "fast_code": "import sys\n\nvar_10 = sys.stdin.readline\nsys.setrecursionlimit(10**7)\nimport numpy as np\n\nvar_2 = 2**30\nvar_13 = int(eval(var_10()))\nvar_3 = tuple(map(int, var_10().split()))\nvar_4 = [[] for _ in range(var_13)]\nfor var_9, var_15 in enumerate(var_3, 1):\n var_4[var_15 - 1].append(var_9)\nvar_5 = tuple(map(int, var_10().split()))\nvar_1 = [-1] * var_13\n\n\ndef func_1(var_17):\n if var_1[var_17] != -1:\n return var_1[var_17]\n var_12 = len(var_4[var_17])\n var_18 = var_5[var_17]\n var_8 = np.full(var_18 + 1, var_2, dtype=np.int64)\n var_8[0] = 0\n for var_9, var_14 in enumerate(var_4[var_17]):\n var_11 = np.full(var_18 + 1, var_2, dtype=np.int64)\n var_7 = func_1(var_14)\n if var_18 + 1 >= var_5[var_14]:\n np.minimum(\n var_11[var_5[var_14] :],\n var_8[: var_18 + 1 - var_5[var_14]] + var_7,\n out=var_11[var_5[var_14] :],\n )\n if var_18 + 1 >= var_7:\n np.minimum(\n var_11[var_7:],\n var_8[: var_18 + 1 - var_7] + var_5[var_14],\n out=var_11[var_7:],\n )\n var_8 = var_11.copy()\n var_16 = var_8.min()\n var_1[var_17] = var_16\n return var_16\n\n\nvar_6 = func_1(0)\nif var_6 == var_2:\n print(\"IMPOSSIBLE\")\nelse:\n print(\"POSSIBLE\")\n", "slow_time": 908704243, "fast_time": 99352776, "speedup": 9.1462, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_5"} -{"pair_id": "python_14640", "problem_id": "p02468", "language": "python", "slow_code": "def func_1(var_2, var_4, var_1):\n var_5 = 1\n if var_4 > 0:\n var_5 = func_1(var_2 * var_2 % var_1, var_4 / 2, var_1)\n if var_4 % 2 == 1:\n var_5 = var_5 * var_2 % var_1\n return var_5\n\n\nvar_3, var_4 = list(map(int, input().split()))\nprint(func_1(var_3, var_4, 1000000007))\n", "fast_code": "import sys\n\nvar_2 = 10**9 + 7\n\n\ndef func_1():\n var_1, var_3 = list(map(int, input().split()))\n print((pow(var_1, var_3, var_2)))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 141975333, "fast_time": 19493102, "speedup": 7.2834, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_1"} -{"pair_id": "python_8533", "problem_id": "p02573", "language": "python", "slow_code": "class Class_1:\n def __init__(self, var_6):\n self.n = var_6\n self.parents = [-1] * var_6\n\n def func_2(self, var_10):\n if self.parents[var_10] < 0:\n return var_10\n else:\n self.parents[var_10] = self.find(self.parents[var_10])\n return self.parents[var_10]\n\n def func_8(self, var_10, var_11):\n var_10 = self.find(var_10)\n var_11 = self.find(var_11)\n if var_10 == var_11:\n return\n if self.parents[var_10] > self.parents[var_11]:\n var_10, var_11 = var_11, var_10\n self.parents[var_10] += self.parents[var_11]\n self.parents[var_11] = var_10\n\n def func_7(self, var_10):\n return -self.parents[self.find(var_10)]\n\n def func_6(self, var_10, var_11):\n return self.find(var_10) == self.find(var_11)\n\n def func_4(self, var_10):\n var_8 = self.find(var_10)\n return [var_4 for var_4 in range(self.n) if self.find(var_4) == var_8]\n\n def func_5(self):\n return [var_4 for var_4, var_10 in enumerate(self.parents) if var_10 < 0]\n\n def func_3(self):\n return len(self.roots())\n\n def func_1(self):\n return {var_7: self.members(var_7) for var_7 in self.roots()}\n\n def __str__(self):\n return \"\\n\".join(\n \"{}: {}\".format(var_7, self.members(var_7)) for var_7 in self.roots()\n )\n\n\nvar_6, var_5 = list(map(int, input().split()))\nvar_9 = Class_1(var_6 + 1)\nfor var_4 in range(var_5):\n var_1, var_3 = list(map(int, input().split()))\n var_9.union(var_1, var_3)\nvar_2 = 0\nfor var_4 in range(1, var_6 + 1):\n var_2 = max(var_2, var_9.size(var_4))\nprint(var_2)\n", "fast_code": "from collections import deque\n\nvar_8, var_7 = list(map(int, input().split()))\nvar_1 = [[] for var_5 in range(var_8 + 1)]\nfor var_5 in range(var_7):\n var_2, var_4 = list(map(int, input().split()))\n var_1[var_2].append(var_4)\n var_1[var_4].append(var_2)\nvar_10 = [0] * (var_8 + 1)\nvar_3 = 0\nfor var_5 in range(1, var_8 + 1):\n if var_10[var_5] != 0:\n pass\n else:\n var_9 = deque([])\n var_9.append(var_5)\n var_10[var_5] = 1\n var_6 = 1\n while var_9:\n var_11 = var_9.popleft()\n for var_12 in var_1[var_11]:\n if var_10[var_12] == 0:\n var_10[var_12] = 1\n var_9.append(var_12)\n var_6 += 1\n var_3 = max(var_3, var_6)\nprint(var_3)\n", "slow_time": 135268108, "fast_time": 59496430, "speedup": 2.2735, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_15"} -{"pair_id": "python_5442", "problem_id": "p03288", "language": "python", "slow_code": "import bisect, collections, copy, heapq, itertools, math, string\nimport sys\n\n\ndef func_5():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(sys.stdin.readline().rstrip().split())\n\n\nvar_1 = func_1()\nif var_1 < 1200:\n print(\"ABC\")\nelif var_1 < 2800:\n print(\"ARC\")\nelse:\n print(\"AGC\")\n", "fast_code": "var_1 = int(eval(input()))\nprint((\"ABC\" if var_1 < 1200 else (\"ARC\" if var_1 < 2800 else \"AGC\")))\n", "slow_time": 47184560, "fast_time": 13202927, "speedup": 3.5738, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_19"} -{"pair_id": "python_14620", "problem_id": "p00076", "language": "python", "slow_code": "var_1 = [[]] * 1001\nvar_5 = 1.0\nvar_6 = 0.0\nfor var_2 in range(1, 1001):\n var_1[var_2] = [var_5, var_6]\n var_4 = var_2**0.5\n var_5, var_6 = var_5 - var_6 / var_4, var_6 + var_5 / var_4\nwhile 1:\n var_3 = eval(input())\n if var_3 == -1:\n break\n print(var_1[var_3][0])\n print(var_1[var_3][1])\n", "fast_code": "import sys\n\nfor var_2 in sys.stdin:\n var_3 = int(var_2)\n if var_3 < 0:\n break\n var_4 = 1\n for _ in range(var_3 - 1):\n var_1 = var_4 * 1j\n var_1 /= abs(var_1)\n var_4 += var_1\n print(f\"{var_4.real}\\n{var_4.imag}\")\n", "slow_time": 222070440, "fast_time": 27781080, "speedup": 7.9936, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_2"} -{"pair_id": "python_6597", "problem_id": "p00741", "language": "python", "slow_code": "import sys\nfrom pprint import pprint\n\n\nclass Class_1:\n def __init__(self):\n self._parent = {}\n self._rank = {}\n self._equiv = {}\n\n def _find(self, var_12):\n if self._parent[var_12] == var_12:\n return self._parent[var_12]\n else:\n var_7 = self._find(self._parent[var_12])\n self._parent[var_12] = var_7\n return var_7\n\n def _set_parent(self, var_1, var_9):\n self._parent[var_1] = var_9\n self._equiv[var_9].update(self._equiv.pop(var_1))\n\n def _union(self, var_12, var_16):\n var_12 = self._find(var_12)\n var_16 = self._find(var_16)\n if var_12 == var_16:\n return\n if self._rank[var_12] > self._rank[var_16]:\n self._set_parent(var_16, var_12)\n elif self._rank[var_12] < self._rank[var_16]:\n self._set_parent(var_12, var_16)\n else:\n self._set_parent(var_12, var_16)\n self._rank[var_12] += 1\n\n def _make_set(self, var_12):\n self._parent[var_12] = var_12\n self._rank[var_12] = 0\n self._equiv[var_12] = {var_12}\n\n def func_4(self, *var_3):\n if not var_3:\n return\n for var_12 in var_3:\n if var_12 in self._parent:\n continue\n self._make_set(var_12)\n var_13 = var_3[0]\n for var_12 in var_3[1:]:\n self._union(var_13, var_12)\n\n def func_1(self):\n return [set(var_2) for var_2 in list(self._equiv.values())]\n\n\ndef func_3(var_5, var_6, var_11):\n var_8 = []\n\n for var_12 in range(var_5 - 1):\n for var_16 in range(var_6):\n var_8.append([(var_12, var_16), (var_12 + 1, var_16)])\n\n for var_12 in range(var_5):\n for var_16 in range(var_6 - 1):\n var_8.append([(var_12, var_16), (var_12, var_16 + 1)])\n\n for var_12 in range(var_5 - 1):\n for var_16 in range(var_6 - 1):\n var_8.append([(var_12, var_16), (var_12 + 1, var_16 + 1)])\n\n for var_12 in range(var_5 - 1):\n for var_16 in range(1, var_6):\n var_8.append([(var_12, var_16), (var_12 + 1, var_16 - 1)])\n var_4 = Class_1()\n for var_12 in range(var_5):\n for var_16 in range(var_6):\n if var_11[var_16][var_12]:\n var_4.unite((var_12, var_16))\n for (var_14, var_17), (var_15, var_18) in var_8:\n if var_11[var_17][var_14] and var_11[var_18][var_15]:\n var_4.unite((var_14, var_17), (var_15, var_18))\n return len(var_4.groups())\n\n\ndef func_2():\n while True:\n var_5, var_6 = list(map(int, input().split()))\n if var_5 == 0 and var_6 == 0:\n break\n var_11 = []\n for _ in range(var_6):\n var_10 = list(map(int, input().split()))\n var_11.append(var_10)\n\n print((func_3(var_5, var_6, var_11)))\n\n\nfunc_2()\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**5)\n\n\ndef func_1(var_10, var_11):\n var_2[var_11][var_10] = \"0\"\n for var_3, var_4 in (\n (1, 0),\n (1, 1),\n (0, 1),\n (-1, 1),\n (-1, 0),\n (-1, -1),\n (0, -1),\n (1, -1),\n ):\n var_7, var_8 = var_10 + var_3, var_11 + var_4\n if 0 <= var_7 < var_9 and 0 <= var_8 < var_5 and var_2[var_8][var_7] == \"1\":\n func_1(var_7, var_8)\n\n\nwhile True:\n var_9, var_5 = list(map(int, input().split()))\n if var_9 == var_5 == 0:\n break\n var_2 = [[var_6 for var_6 in input().split()] for _ in range(var_5)]\n var_1 = 0\n for var_11 in range(var_5):\n for var_10 in range(var_9):\n if var_2[var_11][var_10] == \"1\":\n var_1 += 1\n func_1(var_10, var_11)\n print(var_1)\n", "slow_time": 271364665, "fast_time": 101169892, "speedup": 2.6823, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_9"} -{"pair_id": "python_589", "problem_id": "p02793", "language": "python", "slow_code": "var_5 = int(eval(input()))\n(*var_1,) = list(map(int, input().split()))\nvar_3 = 10**3\nvar_6 = []\nvar_12 = [True] * var_3\nfor var_15 in range(2, var_3):\n if var_12[var_15] == False:\n continue\n var_6.append(var_15)\n for var_14 in range(var_15 * var_15, var_3, var_15):\n var_12[var_14] = False\nfrom collections import defaultdict\n\nvar_2 = [defaultdict(int) for _ in range(var_5)]\nfor var_11 in range(var_5):\n var_7 = var_1[var_11]\n for var_18 in var_6:\n while var_7 > 1:\n if var_7 % var_18 == 0:\n var_2[var_11][var_18] += 1\n var_7 //= var_18\n else:\n break\n else:\n break\n if var_7 > 1:\n var_2[var_11][var_7] += 1\nvar_9 = defaultdict(int)\nfor var_11 in range(var_5):\n for var_13, var_21 in list(var_2[var_11].items()):\n var_9[var_13] = max(var_9[var_13], var_21)\nvar_4 = 10**9 + 7\n\n\nclass Class_1:\n def __init__(self, var_22=0):\n self.value = var_22 % var_4\n if self.value < 0:\n self.value += var_4\n\n @staticmethod\n def func_1(var_23):\n return var_23.value if isinstance(var_23, Class_1) else var_23\n\n def func_2(self):\n var_7, var_8 = self.value, var_4\n var_20, var_21 = 1, 0\n while var_8:\n var_19 = var_7 // var_8\n var_8, var_7 = var_7 - var_19 * var_8, var_8\n var_21, var_20 = var_20 - var_19 * var_21, var_21\n if var_20 < 0:\n var_20 += var_4\n return var_20\n\n def __repr__(self):\n return str(self.value)\n\n def __eq__(self, var_17):\n return self.value == var_17.value\n\n def __neg__(self):\n return Class_1(-self.value)\n\n def __hash__(self):\n return hash(self.value)\n\n def __bool__(self):\n return self.value != 0\n\n def __iadd__(self, var_17):\n self.value += Class_1.get_value(var_17)\n if self.value >= var_4:\n self.value -= var_4\n return self\n\n def __add__(self, var_17):\n var_16 = Class_1(self.value)\n var_16 += var_17\n return var_16\n\n __radd__ = __add__\n\n def __isub__(self, var_17):\n self.value -= Class_1.get_value(var_17)\n if self.value < 0:\n self.value += var_4\n return self\n\n def __sub__(self, var_17):\n var_16 = Class_1(self.value)\n var_16 -= var_17\n return var_16\n\n def __rsub__(self, var_17):\n var_16 = Class_1(Class_1.get_value(var_17))\n var_16 -= self\n return var_16\n\n def __imul__(self, var_17):\n self.value = self.value * Class_1.get_value(var_17) % var_4\n return self\n\n def __mul__(self, var_17):\n var_16 = Class_1(self.value)\n var_16 *= var_17\n return var_16\n\n __rmul__ = __mul__\n\n def __ifloordiv__(self, var_17):\n var_17 = var_17 if isinstance(var_17, Class_1) else Class_1(var_17)\n self *= var_17.inverse()\n return self\n\n def __floordiv__(self, var_17):\n var_16 = Class_1(self.value)\n var_16 //= var_17\n return var_16\n\n def __rfloordiv__(self, var_17):\n var_16 = Class_1(Class_1.get_value(var_17))\n var_16 //= self\n return var_16\n\n\nvar_10 = Class_1(1)\nfor var_13, var_21 in list(var_9.items()):\n var_10 *= pow(var_13, var_21, var_4)\nprint((sum([var_10 // var_7 for var_7 in var_1])))\n", "fast_code": "from functools import reduce\n\nvar_1 = 10**9 + 7\n\n\ndef func_1(var_2, var_4):\n while var_4:\n var_2, var_4 = var_4, var_2 % var_4\n return var_2\n\n\ndef func_3(var_9, var_10):\n return (var_9 * var_10) // func_1(var_9, var_10)\n\n\ndef func_2(var_8):\n return reduce(func_1, var_8)\n\n\ndef func_4(var_8):\n return reduce(func_3, var_8)\n\n\nvar_7 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nvar_6 = func_4(var_2)\nvar_4 = list([var_6 // var_9 for var_9 in var_2])\nvar_3 = 0\nfor var_5 in range(len(var_4)):\n var_3 += var_4[var_5]\nprint((var_3 % var_1))\n", "slow_time": 211446927, "fast_time": 32080020, "speedup": 6.5912, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_21"} -{"pair_id": "python_451", "problem_id": "p02572", "language": "python", "slow_code": "import sys\n\nvar_3 = 1000000007\n\n\ndef func_3(var_4: int, var_1: \"List[int]\"):\n var_7 = 0\n var_2 = [sum(var_1[1:])]\n for var_8, var_5 in enumerate(var_1[1:-1]):\n var_2.append(var_2[var_8] - var_5)\n for var_8, var_6 in enumerate(var_1[:-1]):\n var_7 += var_6 * var_2[var_8]\n print((var_7 % var_3))\n return\n\n\ndef func_2():\n def func_1():\n for var_9 in sys.stdin:\n for var_11 in var_9.split():\n yield var_11\n\n var_10 = func_1()\n var_4 = int(next(var_10))\n var_1 = [int(next(var_10)) for _ in range(var_4)]\n func_3(var_4, var_1)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "_ = eval(input())\nvar_1 = 10**9 + 7\nvar_3 = var_4 = 0\nfor var_2 in map(int, input().split()):\n var_3 += var_2 * var_4\n var_3 %= var_1\n var_4 += var_2\nprint(var_3)\n", "slow_time": 57090536, "fast_time": 18885970, "speedup": 3.0229, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_23"} -{"pair_id": "python_8195", "problem_id": "p03352", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_2 = 1\nfor var_3 in range(1, var_1 + 1):\n for var_4 in range(2, var_1 + 1):\n if var_3**var_4 <= var_1:\n var_2 = max(var_2, var_3**var_4)\n else:\n break\nprint(var_2)\n", "fast_code": "def func_1(var_2):\n var_3 = int(var_2 ** (0.5))\n var_4 = [32, 128, 243]\n\n func_1 = var_3**2\n for var_1 in var_4:\n if var_1 <= var_2:\n func_1 = max(var_1, func_1)\n for var_1 in range(1, 11):\n if var_1**3 <= var_2:\n func_1 = max((var_1**3), func_1)\n return func_1\n\n\nvar_2 = int(eval(input()))\nfor var_1 in range(var_2, var_2 + 1):\n print((func_1(var_1)))\n", "slow_time": 149546981, "fast_time": 36416333, "speedup": 4.1066, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_9"} -{"pair_id": "python_15345", "problem_id": "p02780", "language": "python", "slow_code": "var_6, var_4 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_7 = {}\nvar_1 = 0\nfor var_3 in range(1, 1000 + 1):\n var_7[var_3] = (var_3 + 1) * 0.5\nif var_6 == 1:\n print((var_7[var_2[0]]))\n exit()\nvar_5 = [0 for _ in range(var_6)]\nvar_5[0] = var_7[var_2[0]]\nfor var_3 in range(var_6 - 1):\n if var_3 + 1 < var_4:\n var_5[var_3 + 1] = var_5[var_3] + var_7[var_2[var_3 + 1]]\n else:\n var_5[var_3 + 1] = (\n var_5[var_3] + var_7[var_2[var_3 + 1]] - var_7[var_2[var_3 - var_4 + 1]]\n )\n var_1 = max(var_1, var_5[var_3 + 1])\nprint(var_1)\n", "fast_code": "from itertools import accumulate\nimport numpy as np\n\nvar_4, var_3 = list(map(int, input().split()))\nvar_5 = np.array(list(map(int, input().split())), dtype=np.int64)\nvar_5 = (1 + var_5) / 2\nvar_5 = [0] + list(accumulate(var_5))\nvar_1 = 0\nfor var_2 in range(var_4 - var_3 + 1):\n var_1 = max(var_1, var_5[var_2 + var_3] - var_5[var_2])\nprint(var_1)\n", "slow_time": 91479968, "fast_time": 22969693, "speedup": 3.9826, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_12"} -{"pair_id": "python_8718", "problem_id": "p03371", "language": "python", "slow_code": "var_1, var_4, var_5, var_10, var_11 = list(map(int, input().split()))\nvar_2 = min(var_1 + var_4, var_5 * 2)\nif var_10 > var_11:\n var_7, var_8, var_9 = var_11, (var_10 - var_11) * var_1, (var_10 - var_11) * var_2\nelse:\n var_7, var_8, var_9 = var_10, (var_11 - var_10) * var_4, (var_11 - var_10) * var_2\nvar_3 = 0\nfor var_6 in range(var_7):\n var_3 += var_2\nprint((var_3 + min(var_8, var_9)))\n", "fast_code": "\"\"\"\"\"\"\n\n\"\"\"\"\"\"\nvar_1, var_2, var_3, var_4, var_5 = list(map(int, input().split()))\nif var_1 + var_2 > 2 * var_3:\n var_6 = max(var_4, var_5) * var_3 * 2\n if var_4 > var_5:\n var_7 = var_5 * var_3 * 2 + abs(var_4 - var_5) * var_1\n else:\n var_7 = var_4 * var_3 * 2 + abs(var_4 - var_5) * var_2\n print((min(var_6, var_7)))\nelse:\n var_6 = var_4 * var_1 + var_5 * var_2\n print(var_6)\n", "slow_time": 227526301, "fast_time": 32104618, "speedup": 7.087, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_2"} -{"pair_id": "python_505", "problem_id": "p03221", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = []\nvar_4 = []\nvar_5 = [[] for var_7 in range(10**5 + 1)]\nfor var_6 in range(var_1):\n var_10 = list(map(int, input().split()))\n var_3.append(var_10[0])\n var_4.append(var_10[1])\n var_5[var_10[0]].append(var_10[1])\nfor var_6 in range(var_2 + 1):\n var_5[var_6].sort()\nfor var_6 in range(var_1):\n\n var_9 = 0\n var_12 = len(var_5[var_3[var_6]]) - 1\n while var_9 <= var_12:\n var_11 = (var_9 + var_12) // 2\n if var_5[var_3[var_6]][var_11] == var_4[var_6]:\n var_8 = var_11\n break\n elif var_5[var_3[var_6]][var_11] > var_4[var_6]:\n var_12 = var_11 - 1\n else:\n var_9 = var_11 + 1\n print((str(var_3[var_6]).rjust(6, \"0\") + str(var_8 + 1).rjust(6, \"0\")))\n", "fast_code": "from collections import defaultdict as dd\n\nvar_1 = dd(int)\nvar_6, var_5 = list(map(int, input().split()))\nvar_4 = [[var_2] + list(map(int, input().split())) + [0] for var_2 in range(var_5)]\nvar_7 = sorted(var_4, key=lambda var_8: var_8[2])\nfor var_2, var_3 in enumerate(var_7):\n var_1[var_3[1]] += 1\n var_7[var_2][3] = var_1[var_3[1]]\nfor var_2 in sorted(var_7):\n print((\"%06d%06d\" % (var_2[1], var_2[3])))\n", "slow_time": 2260230442, "fast_time": 31963502, "speedup": 70.7129, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_10"} -{"pair_id": "python_10597", "problem_id": "p02982", "language": "python", "slow_code": "var_6, var_3 = list(map(int, input().split()))\nvar_1 = [list(map(int, input().split())) for _ in range(var_6)]\n\n\ndef func_1(var_8, var_9):\n var_3 = 0\n for var_4, var_5 in zip(var_8, var_9):\n var_3 += (var_4 - var_5) ** 2\n return var_3\n\n\nvar_7 = set([var_4 * var_4 for var_4 in range(10000)])\n\n\ndef func_2(var_8):\n return var_8 in var_7\n\n\nfrom itertools import combinations\n\nvar_2 = 0\nfor var_8, var_9 in combinations(var_1, 2):\n if func_2(func_1(var_8, var_9)):\n var_2 += 1\nprint(var_2)\n", "fast_code": "var_11, var_4 = list(map(int, input().split()))\nvar_13 = [list(map(int, input().split())) for _ in range(var_11)]\n\n\ndef func_1(var_1, var_3):\n var_12 = 0\n for var_6, var_7 in zip(var_1, var_3):\n var_12 += (var_6 - var_7) ** 2\n return var_12**0.5\n\n\nvar_2 = 0\nfor var_8 in range(var_11):\n for var_9 in range(var_8 + 1, var_11):\n var_5 = func_1(var_13[var_8], var_13[var_9])\n for var_10 in range(int(16000**0.5) + 1):\n if var_10 == var_5:\n var_2 += 1\n break\nprint(var_2)\n", "slow_time": 242815463, "fast_time": 36405830, "speedup": 6.6697, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_6"} -{"pair_id": "python_17065", "problem_id": "p03475", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**6)\nvar_9 = sys.stdin.readline\nfrom math import floor, ceil, sqrt, factorial, log\nfrom heapq import heappop, heappush, heappushpop\nfrom collections import Counter, defaultdict, deque\nfrom itertools import (\n accumulate,\n permutations,\n combinations,\n product,\n combinations_with_replacement,\n)\nfrom bisect import bisect_left, bisect_right\nfrom copy import deepcopy\n\nvar_8 = float(\"inf\")\nvar_11 = 10**9 + 7\n\n\ndef func_16(*var_1):\n for var_4 in var_1:\n print(*var_4, sep=\"\\n\")\n\n\ndef func_3(var_12):\n return int(var_12) - 1\n\n\ndef func_12():\n return map(int, var_9().split())\n\n\ndef func_11():\n return map(float, var_9().split())\n\n\ndef func_13():\n return map(func_3, var_9().split())\n\n\ndef func_5():\n return list(func_12())\n\n\ndef func_7():\n return [int(var_15) - 1 for var_15 in var_9().split()]\n\n\ndef func_4():\n return list(func_11())\n\n\ndef func_6(var_12: int):\n return [func_2() for _ in range(var_12)]\n\n\ndef func_9(var_12: int):\n return [func_5() for _ in range(var_12)]\n\n\ndef func_10(var_12: int):\n return [func_7() for _ in range(var_12)]\n\n\ndef func_8():\n return [list(map(int, var_10.split())) for var_10 in var_9()]\n\n\ndef func_2():\n return int(var_9())\n\n\ndef func_1():\n return float(var_9())\n\n\ndef func_14():\n return var_9().replace(\"\\n\", \"\")\n\n\ndef func_15():\n var_3 = func_2()\n var_2 = func_9(var_3 - 1)\n\n def func_17(var_2):\n var_13 = 0\n for var_7, (var_5, var_14, var_6) in enumerate(var_2):\n if var_13 <= var_14:\n var_13 = var_14 + var_5\n continue\n else:\n if var_13 % var_6 != 0:\n var_13 += var_6 - var_13 % var_6\n var_13 += var_5\n print(var_13)\n\n for var_7 in range(var_3):\n func_17(var_2[var_7:])\n\n\nif __name__ == \"__main__\":\n func_15()\n", "fast_code": "var_1 = int(eval(input()))\nvar_5 = [list(map(int, input().split())) for _ in range(var_1 - 1)]\nfor var_2 in range(var_1 - 1):\n var_4 = var_5[var_2][0] + var_5[var_2][1]\n for var_3 in range(var_2 + 1, var_1 - 1):\n if var_5[var_3][1] >= var_4:\n var_4 = var_5[var_3][1] + var_5[var_3][0]\n elif var_4 % var_5[var_3][2] == 0:\n var_4 += var_5[var_3][0]\n else:\n\n var_4 = var_4 + var_5[var_3][2] - var_4 % var_5[var_3][2]\n var_4 += var_5[var_3][0]\n print(var_4)\nprint((0))\n", "slow_time": 159141389, "fast_time": 50227288, "speedup": 3.1684, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_22"} -{"pair_id": "python_13591", "problem_id": "p03260", "language": "python", "slow_code": "from collections import defaultdict, deque\nimport sys, heapq, bisect, math, itertools, string, queue, datetime\n\nsys.setrecursionlimit(10**8)\nvar_3 = float(\"inf\")\nvar_5 = 10**9 + 7\nvar_4 = 10**-7\n\n\ndef func_1():\n return list(map(int, input().split()))\n\n\ndef func_2():\n return list(input().split())\n\n\nvar_1, var_2 = func_1()\nif (var_1 * var_2) % 2 == 0:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nif var_1 % 2 == var_2 % 2 == 1:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 21432741, "fast_time": 8340150, "speedup": 2.5698, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_6"} -{"pair_id": "python_13820", "problem_id": "p02401", "language": "python", "slow_code": "import sys\nimport operator\nfrom math import floor\n\n\ndef func_2():\n var_2 = [var_1 for var_1 in sys.stdin.readline().split()]\n return var_2\n\n\ndef func_1():\n var_3 = {\n \"+\": operator.add,\n \"-\": operator.sub,\n \"*\": operator.mul,\n \"/\": operator.truediv,\n }\n\n while True:\n var_2 = func_2()\n if var_2[1] == \"?\":\n break\n elif var_2[1] == \"+\":\n print((var_3[var_2[1]](int(var_2[0]), int(var_2[2]))))\n elif var_2[1] == \"-\":\n print((var_3[var_2[1]](int(var_2[0]), int(var_2[2]))))\n elif var_2[1] == \"*\":\n print((var_3[var_2[1]](int(var_2[0]), int(var_2[2]))))\n elif var_2[1] == \"/\":\n print((floor(var_3[var_2[1]](int(var_2[0]), int(var_2[2])))))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "while True:\n var_3 = input().split()\n var_1 = int(var_3[0])\n var_2 = int(var_3[2])\n var_4 = var_3[1]\n if var_4 == \"+\":\n print((var_1 + var_2))\n elif var_4 == \"-\":\n print((var_1 - var_2))\n elif var_4 == \"*\":\n print((var_1 * var_2))\n elif var_4 == \"/\":\n print((var_1 // var_2))\n else:\n break\n", "slow_time": 73681624, "fast_time": 30272383, "speedup": 2.434, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_2"} -{"pair_id": "python_1901", "problem_id": "p02821", "language": "python", "slow_code": "import sys\nimport math\nfrom collections import defaultdict\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_6():\n return sys.stdin.readline()[:-1]\n\n\nvar_16 = 10**9 + 7\n\n\ndef func_2():\n return int(eval(func_6()))\n\n\ndef func_3():\n return list(map(int, func_6().split()))\n\n\ndef func_4():\n return list(map(int, func_6().split()))\n\n\ndef func_5(var_4, var_17):\n if var_4 <= 0:\n return [[] for _ in range(var_17)]\n elif var_17 == 1:\n return [func_2() for _ in range(var_4)]\n else:\n var_18 = [tuple(func_3()) for _ in range(var_4)]\n return list(map(list, list(zip(*var_18))))\n\n\nimport numpy as np\n\n\ndef func_1(var_5, var_7):\n var_8 = (len(var_5) + len(var_7)).bit_length() + 1\n var_2 = 2**var_8\n var_12, var_13 = np.fft.rfft(var_5, var_2), np.fft.rfft(var_7, var_2)\n var_9 = np.rint(np.fft.irfft(var_12 * var_13, var_2)).astype(np.int64)\n return var_9[: len(var_5) + len(var_7) - 1]\n\n\nvar_4, var_3 = func_3()\nvar_1 = func_4()\nvar_14 = [0] * (max(var_1))\nfor var_5 in var_1:\n var_14[var_5 - 1] += 1\nvar_10 = np.append([0, 0], func_1(var_14, var_14))\nvar_6 = 0\nvar_11 = 0\nfor var_15 in range(2, 2 * max(var_1) + 1)[::-1]:\n if var_10[var_15]:\n var_17 = min(var_3 - var_11, var_10[var_15])\n var_11 += var_17\n var_6 += var_15 * var_17\n if var_11 == var_3:\n break\nprint(var_6)\n", "fast_code": "var_8, var_7 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_1.sort()\nif var_8 == 1:\n print((var_1[0] * 2))\n exit()\nfrom bisect import bisect_left, bisect_right\n\n\ndef func_1(var_11):\n global n, a\n var_10 = 0\n for var_4 in range(var_8):\n var_10 += var_8 - bisect_left(var_1, var_11 - var_1[var_4])\n return var_10\n\n\nvar_6, var_9 = -1, 10**6\nwhile var_6 + 1 < var_9:\n var_5 = var_6 + (var_9 - var_6) // 2\n if func_1(var_5) >= var_7:\n var_6 = var_5\n else:\n var_9 = var_5\n\n\nif func_1(var_9) >= var_7:\n var_3, var_2 = 0, 0\n for var_4 in range(var_8):\n var_3 += var_8 - bisect_right(var_1, var_9 - var_1[var_4])\n var_2 += (var_8 - bisect_right(var_1, var_9 - var_1[var_4])) * var_1[var_4]\n print((2 * var_2 + (var_7 - var_3) * var_9))\nelse:\n var_3, var_2 = 0, 0\n for var_4 in range(var_8):\n var_3 += var_8 - bisect_right(var_1, var_6 - var_1[var_4])\n var_2 += (var_8 - bisect_right(var_1, var_6 - var_1[var_4])) * var_1[var_4]\n print((2 * var_2 + (var_7 - var_3) * var_6))\n", "slow_time": 694693232, "fast_time": 66933541, "speedup": 10.3789, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_20"} -{"pair_id": "python_7713", "problem_id": "p02838", "language": "python", "slow_code": "var_8 = 1000000007\nvar_2 = 0\nvar_9 = int(eval(input()))\nvar_1 = [int(var_5) for var_5 in input().split()]\nvar_11 = [[0] * 63 for var_5 in range(var_9 + 1)]\nvar_7 = [(2**var_5) % var_8 for var_5 in range(63)]\nfor var_5 in range(var_9):\n var_4 = var_1[var_5]\n var_3 = 0\n for var_6 in range(63):\n if var_4 & 1:\n var_11[var_5 + 1][var_3] = var_11[var_5][var_3] + 1\n else:\n var_11[var_5 + 1][var_3] = var_11[var_5][var_3]\n var_3 += 1\n var_4 = var_4 >> 1\nfor var_5 in range(1, var_9):\n for var_6 in range(63):\n var_10 = var_11[var_5][var_6] - var_11[var_5 - 1][var_6]\n if var_10:\n var_2 += var_7[var_6] * (\n (var_9 - var_5) - (var_11[-1][var_6] - var_11[var_5][var_6])\n )\n else:\n var_2 += var_7[var_6] * (var_11[-1][var_6] - var_11[var_5][var_6])\n var_2 %= var_8\nprint(var_2)\n", "fast_code": "\"\"\"\"\"\"\n\nvar_8 = int(eval(input()))\nvar_3 = list(map(int, input().split()))\nvar_1 = 10**9 + 7\nvar_4 = 0\nvar_7 = 1\nfor var_6 in range(60):\n var_5 = sum(var_2 & var_7 for var_2 in var_3)\n\n var_5 >>= var_6\n var_9 = var_8 - var_5\n var_4 = (var_4 + var_5 * var_9 * var_7) % var_1\n\n var_7 <<= 1\nprint(var_4)\n\"\"\"\"\"\"\n", "slow_time": 280836259, "fast_time": 77002155, "speedup": 3.6471, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_0"} -{"pair_id": "python_8943", "problem_id": "p02641", "language": "python", "slow_code": "var_8, var_5 = list(map(int, input().split()))\nif var_5 == 0:\n print(var_8)\n exit()\nvar_1 = list(map(int, input().split()))\nvar_2 = []\nvar_3 = []\nfor var_4 in range(-50, 110):\n if not var_4 in var_1:\n var_2.append(var_4)\n var_3.append(abs(var_8 - var_4))\nvar_6 = min([var_4 for var_4, var_7 in enumerate(var_3) if var_7 == min(var_3)])\nprint((var_2[var_6]))\n", "fast_code": "var_8, var_4 = list(map(int, input().split()))\nvar_7 = list(map(int, input().split()))\nvar_7 = set(var_7)\nvar_2 = 101\nvar_3 = 0\nvar_1 = (101, 0)\nif var_4 != 0:\n for var_5 in range(0, 102):\n if var_5 not in var_7:\n var_6 = abs(var_5 - var_8)\n var_1 = min(var_1, (var_6, var_5))\n print((var_1[1]))\nelse:\n print(var_8)\n", "slow_time": 200917191, "fast_time": 44975683, "speedup": 4.4672, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_8"} -{"pair_id": "python_6023", "problem_id": "p03566", "language": "python", "slow_code": "var_2 = int(eval(input()))\nvar_7 = list(map(int, input().split()))\nvar_9 = list(map(int, input().split()))\n\n\nvar_3 = -(10**15)\nvar_1 = [[var_3] * (102) for _ in range(100 * 200 + 2)]\nvar_1[0][0] = 0\n\nvar_8 = 1\nfor var_4 in range(var_2):\n\n for var_5 in range(var_8, var_8 + var_7[var_4]):\n\n for var_6 in range(0, var_9[var_4] + 1):\n if var_6 == 0:\n\n var_1[var_5][var_6] = max(\n var_1[var_5 - 1][0] + 0.25, var_1[var_5 - 1][1] + 1 / 2\n )\n elif var_6 != var_9[var_4]:\n var_1[var_5][var_6] = max(\n var_1[var_5 - 1][var_6 - 1] + var_6 - 1 / 2,\n var_1[var_5 - 1][var_6] + var_6 + 0.25,\n var_1[var_5 - 1][var_6 + 1] + var_6 + 1 / 2,\n )\n else:\n var_1[var_5][var_6] = max(\n var_1[var_5 - 1][var_6 - 1] + var_6 - 1 / 2,\n var_1[var_5 - 1][var_6] + var_6,\n )\n\n var_8 += var_7[var_4]\n\nprint((var_1[var_8 - 1][0]))\n", "fast_code": "import heapq\n\nvar_9 = int(eval(input()))\nvar_7 = 10000000000000\n\n\nvar_1 = [[-1, -1] for var_6 in range(var_9)]\nvar_1[-1][1] = 0\nvar_1[0][0] = 0\nvar_12 = list(map(int, input().split()))\nvar_13 = list(map(int, input().split()))\nvar_14 = []\nfor var_6 in range(var_9):\n heapq.heappush(var_14, (var_13[var_6], var_6))\nfor var_6 in range(var_9):\n\n var_15 = heapq.heappop(var_14)\n\n if var_1[var_15[1]][0] == -1:\n\n var_10 = 0\n var_2 = var_7\n for var_8 in range(var_15[1] - 1, -1, -1):\n\n if var_1[var_8][1] != -1:\n var_2 = min(var_2, var_1[var_8][1] + var_10)\n var_10 += var_12[var_8]\n if var_1[var_8][0] != -1:\n var_2 = min(var_2, var_1[var_8][0] + var_10)\n var_10 = 0\n for var_8 in range(var_15[1], var_9):\n if var_1[var_8][0] != -1:\n var_2 = min(var_2, var_1[var_8][0] + var_10)\n var_10 += var_12[var_8]\n if var_1[var_8][1] != -1:\n var_2 = min(var_2, var_1[var_8][1] + var_10)\n var_1[var_15[1]][0] = min(var_2, var_15[0])\n var_1[var_15[1] - 1][1] = var_1[var_15[1]][0]\n\n if var_1[var_15[1]][1] == -1:\n\n var_11 = 0\n var_3 = var_7\n for var_8 in range(var_15[1], -1, -1):\n if var_1[var_8][1] != -1:\n var_3 = min(var_3, var_1[var_8][1] + var_11)\n var_11 += var_12[var_8]\n if var_1[var_8][0] != -1:\n var_3 = min(var_3, var_1[var_8][0] + var_11)\n var_11 = 0\n for var_8 in range(var_15[1] + 1, var_9):\n if var_1[var_8][0] != -1:\n var_3 = min(var_3, var_1[var_8][0] + var_11)\n var_11 += var_12[var_8]\n if var_1[var_8][1] != -1:\n var_3 = min(var_3, var_1[var_8][1] + var_11)\n var_1[var_15[1]][1] = min(var_3, var_15[0])\n var_1[var_15[1] + 1][0] = var_1[var_15[1]][1]\n\nvar_4 = 0\nfor var_6 in range(var_9):\n var_5 = min((var_12[var_6] + sum(var_1[var_6])) / 2, var_13[var_6])\n var_4 += (var_5**2 - var_1[var_6][0] ** 2) / 2\n var_4 += (var_5**2 - var_1[var_6][1] ** 2) / 2\n var_4 += var_5 * (var_12[var_6] + sum(var_1[var_6]) - 2 * var_5)\nprint(var_4)\n", "slow_time": 6434338277, "fast_time": 175113223, "speedup": 36.7439, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_0"} -{"pair_id": "python_11614", "problem_id": "p02621", "language": "python", "slow_code": "var_1 = 10**7\n\n\nfor var_3 in range(var_1):\n pass\n\nvar_2 = int(eval(input()))\nprint((var_2 + var_2**2 + var_2**3))\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = var_1**2\nvar_3 = var_1**3\nprint((var_1 + var_2 + var_3))\n", "slow_time": 202512920251, "fast_time": 12100112, "speedup": 16736.4501, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_19"} -{"pair_id": "python_1905", "problem_id": "p02821", "language": "python", "slow_code": "import sys\n\nvar_8 = sys.stdin.readline\nvar_12 = 10**10\nvar_9 = var_12.bit_length()\nvar_1 = 1 << var_9\nvar_14 = lambda var_2: int(\n \"\".join([bin(var_1 + var_3)[-var_9:] for var_3 in var_2[::-1]]), 2\n)\nvar_17 = lambda var_13: bin(var_13)[2:] + \"0\"\nvar_10 = lambda var_16: [\n int(var_3, 2) if len(var_3) else 0\n for var_3 in [\n var_16[-(var_7 + 1) * var_9 - 1 : -var_7 * var_9 - 1] for var_7 in range(200001)\n ]\n]\nvar_13, var_11 = list(map(int, var_8().split()))\nvar_3 = [int(var_7) for var_7 in var_8().split()]\nvar_5 = [0] * 100001\nfor var_7 in var_3:\n var_5[var_7] += 1\nvar_6 = var_10(var_17(var_14(var_5) * var_14(var_5)))\nvar_4 = 0\nfor var_7 in range(200001)[::-1]:\n if var_6[var_7] > 0:\n var_15 = min(var_11, var_6[var_7])\n var_11 -= var_15\n var_4 += var_7 * var_15\n if var_11 == 0:\n break\nprint(var_4)\n", "fast_code": "var_8, var_7 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_1.sort()\nif var_8 == 1:\n print((var_1[0] * 2))\n exit()\nfrom bisect import bisect_left, bisect_right\n\n\ndef func_1(var_11):\n global n, a\n var_10 = 0\n for var_4 in range(var_8):\n var_10 += var_8 - bisect_left(var_1, var_11 - var_1[var_4])\n return var_10\n\n\nvar_6, var_9 = -1, 10**6\nwhile var_6 + 1 < var_9:\n var_5 = var_6 + (var_9 - var_6) // 2\n if func_1(var_5) >= var_7:\n var_6 = var_5\n else:\n var_9 = var_5\n\n\nif func_1(var_9) >= var_7:\n var_3, var_2 = 0, 0\n for var_4 in range(var_8):\n var_3 += var_8 - bisect_right(var_1, var_9 - var_1[var_4])\n var_2 += (var_8 - bisect_right(var_1, var_9 - var_1[var_4])) * var_1[var_4]\n print((2 * var_2 + (var_7 - var_3) * var_9))\nelse:\n var_3, var_2 = 0, 0\n for var_4 in range(var_8):\n var_3 += var_8 - bisect_right(var_1, var_6 - var_1[var_4])\n var_2 += (var_8 - bisect_right(var_1, var_6 - var_1[var_4])) * var_1[var_4]\n print((2 * var_2 + (var_7 - var_3) * var_6))\n", "slow_time": 42079314749, "fast_time": 66933541, "speedup": 628.6731, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_20"} -{"pair_id": "python_9491", "problem_id": "p03168", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**6)\nimport functools\nimport operator\n\nvar_5 = int(eval(input()))\nvar_6 = list(map(float, input().split()))\nvar_3 = var_5 // 2 + 1\nvar_2 = [[None] * (var_5 + 1) for _ in range(var_5 + 1)]\n\n\nfor var_4 in range(0, var_5 + 1):\n for var_1 in range(-1, var_5):\n if var_1 == -1:\n var_2[var_4][var_1] = 0\n elif var_4 == 0:\n var_2[var_4][var_1] = functools.reduce(\n operator.mul, [1 - var_7 for var_7 in var_6[: var_1 + 1]]\n )\n elif (var_4 - 1) == var_1:\n var_2[var_4][var_1] = functools.reduce(operator.mul, var_6[: var_1 + 1])\n else:\n var_2[var_4][var_1] = var_2[var_4 - 1][var_1 - 1] * var_6[var_1] + var_2[\n var_4\n ][var_1 - 1] * (1 - var_6[var_1])\nprint((sum(var_2[var_4][var_5 - 1] for var_4 in range(var_3, var_5 + 1))))\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = list(map(float, input().split()))\nvar_5 = [1] + [0] * var_1\nfor var_6 in var_2:\n var_5 = [\n var_6 * var_3 + (1 - var_6) * var_4 for var_3, var_4 in zip([0] + var_5, var_5)\n ]\nprint((sum(var_5[-(-var_1 // 2) :])))\n", "slow_time": 79103016, "fast_time": 31936256, "speedup": 2.4769, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_21"} -{"pair_id": "python_16631", "problem_id": "p03147", "language": "python", "slow_code": "var_3 = int(eval(input()))\nvar_1 = [int(var_2) for var_2 in input().split()]\nvar_4 = var_2 = 0\nwhile sum(var_1) != 0:\n if var_1[var_2] == 0:\n var_2 += 1\n else:\n var_4 += 1\n while var_2 < var_3 and var_1[var_2] > 0:\n var_1[var_2] -= 1\n var_2 += 1\n var_2 = 0\nprint(var_4)\n", "fast_code": "var_3 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nprint(\n (\n sum([max(0, var_1[var_2 + 1] - var_1[var_2]) for var_2 in range(var_3 - 1)])\n + var_1[0]\n )\n)\n", "slow_time": 189440229, "fast_time": 24337397, "speedup": 7.7839, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_26"} -{"pair_id": "python_11709", "problem_id": "p02536", "language": "python", "slow_code": "from networkx.utils import UnionFind\nimport sys\n\n\ndef func_1():\n return sys.stdin.readline().rstrip()\n\n\ndef func_2():\n var_5, var_4 = list(map(int, func_1().split()))\n var_6 = UnionFind()\n for var_3 in range(1, var_5 + 1):\n _ = var_6[var_3]\n for _ in range(var_4):\n var_1, var_2 = list(map(int, func_1().split()))\n var_6.union(var_1, var_2)\n print((len(list(var_6.to_sets())) - 1))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "class Class_1:\n def __init__(self, var_6):\n self.prsz = [-1] * var_6\n\n def func_1(self, var_9):\n if self.prsz[var_9] < 0:\n return var_9\n self.prsz[var_9] = self.find(self.prsz[var_9])\n return self.prsz[var_9]\n\n def func_2(self, var_9, var_7):\n var_9 = self.find(var_9)\n var_7 = self.find(var_7)\n if var_9 == var_7:\n return False\n if self.prsz[var_9] > self.prsz[var_7]:\n var_9, var_7 = var_7, var_9\n self.prsz[var_9] += self.prsz[var_7]\n self.prsz[var_7] = var_9\n return True\n\n\nvar_6, var_5 = list(map(int, input().split()))\nvar_8 = Class_1(var_6)\nfor var_4 in range(var_5):\n var_1, var_3 = [int(var_10) - 1 for var_10 in input().split()]\n var_8.union(var_1, var_3)\nvar_2 = set()\nfor var_4 in range(var_6):\n var_2.add(var_8.find(var_4))\nprint((len(var_2) - 1))\n", "slow_time": 18069444838, "fast_time": 77172190, "speedup": 234.1445, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_20"} -{"pair_id": "python_7104", "problem_id": "p02732", "language": "python", "slow_code": "var_2 = [0] * 8**6\n_, var_1 = open(0)\n(*var_1,) = list(map(int, var_1.split()))\nfor var_3 in var_1:\n var_2[var_3] += 1\nvar_4 = sum(var_3 * ~-var_3 // 2 for var_3 in var_2)\nprint((\" \".join(str(var_4 - var_2[var_3] + 1) for var_3 in var_1)))\n", "fast_code": "import sys\nfrom math import factorial\nfrom collections import Counter, defaultdict\n\nvar_14 = lambda: sys.stdin.readline().rstrip()\nvar_8 = lambda: int(var_14())\nvar_10 = lambda: list(map(int, var_14().split()))\n\n\ndef func_1(var_11, var_13):\n if var_11 <= 0 or var_13 > var_11:\n return 0\n return factorial(var_11) // factorial(var_11 - var_13) // factorial(var_13)\n\n\nvar_2 = var_8()\nvar_1 = var_10()\nvar_6 = Counter(var_1)\nvar_5 = 0\nvar_7 = defaultdict(int)\nfor var_9, var_15 in list(var_6.items()):\n var_7[var_9] = var_15\n var_5 += func_1(var_15, 2)\nfor var_3 in var_1:\n var_12 = var_7[var_3]\n var_4 = var_5 - (var_12 - 1)\n print(var_4)\n", "slow_time": 8948614458, "fast_time": 61557632, "speedup": 145.3697, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_9"} -{"pair_id": "python_5762", "problem_id": "p03039", "language": "python", "slow_code": "var_5, var_2, var_1 = list(map(int, input().split()))\nvar_4 = 10**9 + 7\nvar_6 = 0\nfor var_11 in range(var_5):\n var_13 = var_5 - 1 - var_11\n var_6 += var_11 * (var_11 + 1) // 2 + var_13 * (var_13 + 1) // 2\nvar_8 = 0\nfor var_11 in range(var_2):\n var_13 = var_2 - 1 - var_11\n var_8 += var_11 * (var_11 + 1) // 2 + var_13 * (var_13 + 1) // 2\nvar_3 = var_5 * var_2 + 5\nvar_9 = [1, 1] + [0] * var_3\nvar_10 = [1, 1] + [0] * var_3\nvar_12 = [0, 1] + [0] * var_3\nfor var_11 in range(2, var_3 + 2):\n var_9[var_11] = var_9[var_11 - 1] * var_11 % var_4\n var_12[var_11] = -var_12[var_4 % var_11] * (var_4 // var_11) % var_4\n var_10[var_11] = var_10[var_11 - 1] * var_12[var_11] % var_4\n\n\ndef func_1(var_14, var_15):\n if var_14 < var_15:\n return 0\n if var_14 < 0 or var_15 < 0:\n return 0\n return var_9[var_14] * (var_10[var_15] * var_10[var_14 - var_15] % var_4) % var_4\n\n\nvar_7 = (\n (var_6 * var_12[var_5] ** 2 + var_8 * var_12[var_2] ** 2)\n * var_12[var_5 * var_2 - 1]\n * (var_5 * var_2)\n)\nvar_7 *= var_1 * (var_1 - 1) // 2\nvar_7 *= func_1(var_5 * var_2, var_1)\nprint((var_7 % var_4))\n", "fast_code": "var_4 = 10**9 + 7\nvar_5, var_3, var_2 = list(map(int, input().split()))\nvar_9 = [1] * (var_2 - 1)\nfor var_10 in range(2, var_2 - 1):\n var_9[var_10] = (-(var_4 // var_10) * var_9[var_4 % var_10]) % var_4\nvar_1 = 1\nfor var_10 in range(var_5 * var_3 - var_2 + 1, var_5 * var_3 - 1):\n var_1 *= var_10\n var_1 %= var_4\nfor var_10 in range(1, var_2 - 1):\n var_1 *= var_9[var_10]\n var_1 %= var_4\nvar_6 = 0\nfor var_8 in range(1, var_5):\n var_6 += (var_5 - var_8) * var_8\n var_6 %= var_4\nvar_6 *= var_3**2\nvar_6 %= var_4\nvar_7 = 0\nfor var_8 in range(1, var_3):\n var_7 += (var_3 - var_8) * var_8\n var_7 %= var_4\nvar_7 *= var_5**2\nvar_7 %= var_4\nprint(((var_6 + var_7) * var_1 % var_4))\n", "slow_time": 2276036514, "fast_time": 385009370, "speedup": 5.9116, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_13"} -{"pair_id": "python_9480", "problem_id": "p03030", "language": "python", "slow_code": "import sys\n\nvar_5 = sys.stdin.readline\n\n\ndef func_1(*var_2, **var_7):\n print(*var_2, file=sys.stderr, **var_7)\n\n\nfrom queue import PriorityQueue as pq\n\n\ndef func_2():\n var_9 = int(eval(var_5()))\n var_3 = {}\n for var_4 in range(1, var_9 + 1):\n var_11, var_10 = var_5().split()\n var_10 = int(var_10)\n if var_11 in var_3:\n var_3[var_11].put((-var_10, var_4))\n\n else:\n var_1 = pq()\n var_3[var_11] = var_1\n var_3[var_11].put((-var_10, var_4))\n\n func_1(var_3)\n var_8 = sorted(list(var_3.items()))\n func_1(var_8)\n\n for var_6 in var_8:\n while var_6[1].qsize():\n print((var_6[1].get())[1])\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_2 = int(eval(input()))\nvar_3 = [[input().split(), var_1 + 1] for var_1 in range(var_2)]\nvar_3 = sorted(var_3, key=lambda var_4: (var_4[0][0], -int(var_4[0][1])))\nfor var_1 in range(var_2):\n print((var_3[var_1][1]))\n", "slow_time": 85144218, "fast_time": 35156431, "speedup": 2.4219, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_1"} -{"pair_id": "python_2145", "problem_id": "p02989", "language": "python", "slow_code": "from bisect import bisect_left\n\nvar_1 = int(eval(input()))\nvar_3 = list(map(int, input().split()))\nvar_3.sort()\nvar_5 = var_1 // 2\nvar_2 = 0\nfor var_6 in range(var_3[0], var_3[-1] + 1):\n var_4 = bisect_left(var_3, var_6)\n\n if var_4 == var_5:\n var_2 += 1\nprint(var_2)\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = sorted([int(var_3) for var_3 in input().split()])\nvar_4 = var_1[var_2 // 2]\nvar_5 = var_1[var_2 // 2 - 1]\nprint((var_4 - var_5))\n", "slow_time": 4404972353, "fast_time": 22215089, "speedup": 198.2874, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_8"} -{"pair_id": "python_1612", "problem_id": "p02990", "language": "python", "slow_code": "def func_1(var_11, var_12):\n if var_12 < 0 or var_12 > var_11:\n return 0\n var_12 = min(var_12, var_11 - var_12)\n return var_6[var_11] * var_7[var_12] * var_7[var_11 - var_12] % var_3\n\n\nvar_3 = 10**9 + 7\nvar_2 = 4000 + 10\nvar_6 = [1, 1]\nvar_7 = [1, 1]\nvar_9 = [0, 1]\nfor var_8 in range(2, var_2 + 1):\n var_6.append((var_6[-1] * var_8) % var_3)\n var_9.append(-var_9[var_3 % var_8] * (var_3 // var_8) % var_3)\n var_7.append((var_7[-1] * var_9[-1]) % var_3)\n\n\ndef func_2(var_11, var_10):\n if var_11 < var_10:\n return 0\n if var_11 == 0 and var_10 == 0:\n return 1\n if var_10 < 1:\n return 0\n return func_3(var_11 - var_10, var_10)\n\n\ndef func_3(var_11, var_10):\n return func_1(var_11 + var_10 - 1, var_10 - 1)\n\n\nvar_4, var_1 = list(map(int, input().split()))\nfor var_8 in range(1, var_1 + 1):\n var_5 = func_2(var_1, var_8)\n var_12 = (\n func_2(var_4 - var_1, var_8 - 1)\n + 2 * func_2(var_4 - var_1, var_8)\n + func_2(var_4 - var_1, var_8 + 1)\n )\n print(((var_5 * var_12) % var_3))\n", "fast_code": "import math\n\n\ndef func_1(var_8, var_7):\n return (\n math.factorial(var_8) // math.factorial(var_7) // math.factorial(var_8 - var_7)\n )\n\n\ndef func_2():\n var_2 = 10**9 + 7\n var_3, var_1 = list(map(int, input().split()))\n for var_6 in range(1, var_1 + 1):\n if var_6 > var_3 - var_1 + 1:\n print((0))\n continue\n var_5 = func_1(var_3 - var_1 + 1, var_6) % var_2\n var_9 = func_1(var_1 - 1, var_6 - 1) % var_2\n var_4 = var_5 * var_9 % var_2\n print(var_4)\n\n\nfunc_2()\n", "slow_time": 1043671507, "fast_time": 57750934, "speedup": 18.0719, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_7"} -{"pair_id": "python_15781", "problem_id": "p03331", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_5 = 100000\nfor var_2 in range(1, var_4):\n var_3 = var_4 - var_2\n var_6 = 0\n for var_1 in str(var_2):\n var_6 += int(var_1)\n for var_1 in str(var_3):\n var_6 += int(var_1)\n var_5 = min(var_5, var_6)\nprint(var_5)\n", "fast_code": "var_1 = int(eval(input()))\nif var_1 % 10 == 0:\n print((10))\nelse:\n print((sum(map(int, list(str(var_1))))))\n", "slow_time": 131029901, "fast_time": 17095953, "speedup": 7.6644, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_7"} -{"pair_id": "python_7436", "problem_id": "p02912", "language": "python", "slow_code": "def func_1(var_14, var_11, var_10):\n\n var_12 = 0\n var_8 = var_10 - 1\n while var_8 - var_12 > 1:\n var_13 = var_12 + (var_8 - var_12) // 2\n var_7 = var_11[var_13]\n if var_7 >= var_14:\n var_8 = var_13\n else:\n var_12 = var_13\n return var_12\n\n\nvar_3 = input().split()\nvar_5 = int(var_3[0])\nvar_4 = int(var_3[1])\n\n\nvar_1 = list(map(int, input().split()))\nvar_1.sort()\nwhile var_4 > 0:\n var_4 -= 1\n var_14 = var_1.pop(var_5 - 1)\n var_14 = var_14 // 2\n if len(var_1) == 0:\n var_6 = 0\n elif var_14 < var_1[0]:\n var_6 = 0\n else:\n var_6 = func_1(var_14, var_1, var_5 - 1) + 1\n\n var_1[var_6:var_6] = [var_14]\nvar_2 = 0\nfor var_9 in range(var_5):\n var_2 += var_1[var_9]\nprint(var_2)\n", "fast_code": "var_10, var_9 = list(map(int, input().split()))\nvar_3 = list(map(int, input().split()))\nvar_2 = max(var_3)\nvar_3 = sorted(var_3, reverse=True)\nvar_12 = 0\nwhile var_2 > 1:\n var_2 = -(-var_2 // 2)\n var_12 += 1\nvar_13 = [[] for var_8 in range(var_12 + 2)]\nfor var_8 in range(var_10):\n var_11 = 0\n var_5 = var_3[var_8]\n while var_5 > 1:\n var_5 = -(-var_5 // 2)\n var_11 += 1\n var_13[var_12 - var_11].append(var_3[var_8])\nvar_7 = 0\nfor var_8 in range(var_12 + 1):\n var_13[var_8] = sorted(var_13[var_8])\n if var_7 > var_9:\n break\n while var_13[var_8]:\n if var_7 >= var_9:\n break\n var_6 = var_13[var_8].pop()\n var_13[var_8 + 1].append(var_6 // 2)\n var_7 += 1\nvar_4 = 0\nfor var_1 in var_13:\n var_4 += sum(var_1)\nprint(var_4)\n", "slow_time": 529707210, "fast_time": 92701696, "speedup": 5.7141, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_26"} -{"pair_id": "python_14137", "problem_id": "p02692", "language": "python", "slow_code": "import sys\n\nvar_6 = \"Yes\"\nvar_5 = \"No\"\n\n\ndef func_5(var_4: int, var_1: int, var_2: int, var_3: int, var_14: \"List[int]\"):\n var_16 = [var_1, var_2, var_3]\n var_7 = []\n if sum(var_16) == 0:\n return None\n if sum(var_16) == 1:\n for var_9, var_12 in var_14:\n if var_16[var_9] + var_16[var_12] == 0:\n return None\n if var_16[var_9] == 0:\n var_7.append(var_9)\n else:\n var_7.append(var_12)\n var_16[var_9], var_16[var_12] = var_16[var_12], var_16[var_9]\n return var_7\n if sum(var_16) > 1:\n for var_8 in range(var_4):\n var_9, var_12 = var_14[var_8]\n if var_16[var_9] + var_16[var_12] == 0:\n return None\n if (\n var_16[var_12] == 1\n and var_16[var_9] == 1\n and var_8 != var_4 - 1\n and var_14[var_8] != var_14[var_8 + 1]\n ):\n var_11, var_13 = var_14[var_8 + 1]\n if var_12 == var_11 or var_12 == var_13:\n var_7.append(var_12)\n var_16[var_9] -= 1\n var_16[var_12] += 1\n else:\n var_7.append(var_9)\n var_16[var_9] += 1\n var_16[var_12] -= 1\n elif var_16[var_12] == 0 or var_16[var_9] > var_16[var_12]:\n var_7.append(var_12)\n var_16[var_9] -= 1\n var_16[var_12] += 1\n else:\n var_7.append(var_9)\n var_16[var_9] += 1\n var_16[var_12] -= 1\n return var_7\n\n\ndef func_3():\n def func_2():\n for var_10 in sys.stdin:\n for var_17 in var_10.split():\n yield var_17\n\n def func_4(var_14: str):\n return ord(var_14[0]) - ord(\"A\"), ord(var_14[1]) - ord(\"A\")\n\n def func_1(var_8: int):\n return chr(var_8 + ord(\"A\"))\n\n var_15 = func_2()\n var_4 = int(next(var_15))\n var_1 = int(next(var_15))\n var_2 = int(next(var_15))\n var_3 = int(next(var_15))\n var_14 = [func_4(next(var_15)) for _ in range(var_4)]\n var_7 = func_5(var_4, var_1, var_2, var_3, var_14)\n if var_7 == None:\n print(var_5)\n else:\n print(var_6)\n print((\"\\n\".join(list(map(func_1, var_7)))))\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_7, var_1, var_3, var_4 = map(int, input().split())\nvar_8 = [\n (0, 1) if var_9 == \"AB\" else (1, 2) if var_9 == \"BC\" else (0, 2)\n for var_9 in (input() for _ in range(var_7))\n]\nvar_2 = []\nvar_5 = (\"A\", \"B\", \"C\")\nvar_6 = [var_1, var_3, var_4]\nfor (var_11, var_12), var_10 in zip(var_8, var_8[1:] + [()]):\n if var_6[var_11] + var_6[var_12] == 0:\n print(\"No\")\n break\n if (\n var_6[var_11] > var_6[var_12]\n or var_6[var_11] * var_6[var_12] == 1\n and var_12 in var_10\n ):\n var_11, var_12 = var_12, var_11\n var_6[var_11] += 1\n var_6[var_12] -= 1\n var_2.append(var_5[var_11])\nelse:\n print(\"Yes\", *var_2, sep=\"\\n\")\n", "slow_time": 137002024, "fast_time": 53241305, "speedup": 2.5732, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_9"} -{"pair_id": "python_10530", "problem_id": "p02657", "language": "python", "slow_code": "import numpy as np\nimport scipy as sp\nimport math\n\nvar_1, var_3 = list(map(str, input().split()))\nvar_1 = int(var_1)\nvar_3 = int(float(var_3) * 100.001)\nvar_2 = int(var_1 * var_3 // 100)\nprint(var_2)\n", "fast_code": "def func_1():\n var_1, var_2 = list(map(int, input().split()))\n print((var_1 * var_2))\n\n\nfunc_1()\n", "slow_time": 601968667, "fast_time": 9335678, "speedup": 64.4804, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_10"} -{"pair_id": "python_6375", "problem_id": "p02551", "language": "python", "slow_code": "var_2, var_3 = list(map(int, input().split()))\n\n\nclass Class_1:\n def __init__(self, var_10: list, var_20, var_9):\n var_13 = len(var_10)\n self.N0 = 1 << (var_13 - 1).bit_length()\n self.ide_ele = var_9\n self.data = [var_9] * (2 * self.N0)\n self.segfunc = var_20\n for var_8, var_21 in enumerate(var_10):\n self.data[var_8 + self.N0 - 1] = var_21\n for var_8 in range(self.N0 - 2, -1, -1):\n self.data[var_8] = self.segfunc(\n self.data[2 * var_8 + 1], self.data[2 * var_8 + 2]\n )\n\n def func_3(self, var_11: int, var_21):\n var_11 += self.N0 - 1\n\n self.data[var_11] = var_21\n\n while var_11:\n var_11 = (var_11 - 1) // 2\n self.data[var_11] = self.segfunc(\n self.data[var_11 * 2 + 1], self.data[var_11 * 2 + 2]\n )\n\n def func_1(self, var_11):\n return self.query(var_11, var_11 + 1)\n\n def func_2(self, var_12: int, var_17: int):\n var_1 = var_12 + self.N0\n var_4 = var_17 + self.N0\n var_16 = self.ide_ele\n\n var_5, var_7 = [], []\n while var_1 < var_4:\n if var_1 & 1:\n var_5.append(var_1 - 1)\n var_1 += 1\n if var_4 & 1:\n var_4 -= 1\n var_7.append(var_4 - 1)\n var_1 >>= 1\n var_4 >>= 1\n for var_8 in var_5 + var_7[::-1]:\n var_16 = self.segfunc(var_16, self.data[var_8])\n\n return var_16\n\n\n\"\"\"\"\"\"\n\nvar_19 = Class_1([var_2 - 1] * var_2, min, float(\"INF\"))\nvar_18 = Class_1([var_2 - 1] * var_2, min, float(\"INF\"))\nvar_6 = (var_2 - 2) ** 2\nfor var_8 in range(var_3):\n var_15, var_21 = list(map(int, input().split()))\n if var_15 == 1:\n var_16 = var_19.query(var_21 - 1, var_2)\n var_14 = var_18.get(var_16 - 1)\n var_18.update(var_16 - 1, min(var_21 - 1, var_14))\n var_6 -= max(var_16 - 1, 0)\n else:\n var_16 = var_18.query(var_21 - 1, var_2)\n var_14 = var_19.get(var_16 - 1)\n var_19.update(var_16 - 1, min(var_21 - 1, var_14))\n var_6 -= max(var_16 - 1, 0)\n\nprint(var_6)\n", "fast_code": "import sys\n\nvar_12 = sys.stdin.read\nvar_13 = sys.stdin.readline\nvar_14 = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nvar_2 = 1 << 60\nvar_3 = 1000000007\n\n\ndef func_1():\n var_4, var_5, *var_11 = list(map(int, var_12().split()))\n var_4 -= 2\n var_15 = [var_4] * var_4\n var_8 = [var_4] * var_4\n var_6 = var_1 = var_4\n var_7 = var_4 * var_4\n for var_10, var_16 in zip(*[iter(var_11)] * 2):\n var_16 -= 2\n if var_10 == 1:\n if var_16 < var_1:\n var_7 -= var_6\n for var_9 in range(var_16 + 1, var_1):\n var_8[var_9] = var_6\n var_1 = var_16\n else:\n var_7 -= var_8[var_16]\n else:\n if var_16 < var_6:\n var_7 -= var_1\n for var_9 in range(var_16 + 1, var_6):\n var_15[var_9] = var_1\n var_6 = var_16\n else:\n var_7 -= var_15[var_16]\n print(var_7)\n return\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 34125142256, "fast_time": 1845501096, "speedup": 18.491, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_14"} -{"pair_id": "python_13134", "problem_id": "p02783", "language": "python", "slow_code": "import sys\nimport socket\n\nvar_3 = socket.gethostname()\nif var_3 == \"F451C\":\n sys.stdin = open(\"a1.in\")\n\n\ndef func_5():\n return list(map(int, input().split()))\n\n\ndef func_7():\n return input().split()\n\n\ndef func_4():\n return int(eval(input()))\n\n\ndef func_6():\n return eval(input())\n\n\ndef func_2():\n var_2, var_1 = func_5()\n var_5 = 0\n for var_4 in range(10001):\n var_2 = var_2 - var_1\n var_5 += 1\n if var_2 <= 0:\n break\n print(var_5)\n\n\ndef func_3():\n var_2, var_1 = func_5()\n var_5 = var_2 // var_1\n if var_2 % var_1 != 0:\n var_5 += 1\n print(var_5)\n\n\ndef func_1():\n var_2, var_1 = func_5()\n var_5 = 0\n while var_2 > 0:\n var_2 -= var_1\n var_5 += 1\n print(var_5)\n\n\nfunc_1()\n", "fast_code": "import math\n\n\ndef func_1():\n var_2, var_1 = (int(var_3) for var_3 in input().rstrip().split(\" \"))\n print((str(math.ceil(var_2 / var_1))))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 135296255, "fast_time": 20707987, "speedup": 6.5335, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_25"} -{"pair_id": "python_3952", "problem_id": "p03564", "language": "python", "slow_code": "import itertools\n\nvar_2 = int(eval(input()))\nvar_1 = int(eval(input()))\nvar_3 = 10**18\nfor var_4 in itertools.product(\"AB\", repeat=var_2):\n var_6 = 1\n for var_5 in var_4:\n if var_5 == \"A\":\n var_6 *= 2\n else:\n var_6 += var_1\n\n var_3 = min(var_3, var_6)\nprint(var_3)\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_2, var_1 = func_1(), func_1()\nvar_4 = 10**6\nfor var_5 in range(var_2 + 1):\n var_3 = 2**var_5\n var_3 += var_1 * (var_2 - var_5)\n var_4 = min(var_4, var_3)\nprint(var_4)\n", "slow_time": 444510237, "fast_time": 63363242, "speedup": 7.0153, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_26"} -{"pair_id": "python_12588", "problem_id": "p02703", "language": "python", "slow_code": "def func_2():\n import heapq\n\n def func_1(var_8, var_18, var_5, var_4):\n var_7 = [[float(\"inf\")] * 2505 for _ in range(var_12)]\n var_17 = []\n var_7[var_18][var_4] = 0\n heapq.heappush(var_17, (0, var_18, var_4))\n while var_17:\n var_6, var_16, var_4 = heapq.heappop(var_17)\n if var_7[var_16][var_4] < var_6:\n continue\n for var_14, var_13, var_15 in var_8[var_16]:\n if var_4 >= var_13 and var_7[var_14][var_4 - var_13] > var_6 + var_15:\n var_7[var_14][var_4 - var_13] = var_6 + var_15\n heapq.heappush(var_17, (var_6 + var_15, var_14, var_4 - var_13))\n if var_4 + var_5[var_16][0] < 2500:\n if var_7[var_16][var_4 + var_5[var_16][0]] > var_6 + var_5[var_16][1]:\n var_7[var_16][var_4 + var_5[var_16][0]] = var_6 + var_5[var_16][1]\n heapq.heappush(\n var_17,\n (var_6 + var_5[var_16][1], var_16, var_4 + var_5[var_16][0]),\n )\n else:\n if var_7[var_16][2500] > var_6 + var_5[var_16][1]:\n var_7[var_16][2500] = var_6 + var_5[var_16][1]\n heapq.heappush(var_17, (var_6 + var_5[var_16][1], var_16, 2500))\n for var_9 in var_7[1:]:\n print((min(var_9)))\n\n var_12, var_11, var_18 = list(map(int, input().split()))\n var_1 = [[] for var_9 in range(var_12)]\n var_10 = []\n for var_9 in range(var_11):\n var_19, var_20, var_2, var_3 = list(map(int, input().split()))\n var_19 -= 1\n var_20 -= 1\n var_10.append(var_2)\n var_1[var_19].append((var_20, var_2, var_3))\n var_1[var_20].append((var_19, var_2, var_3))\n var_5 = [list(map(int, input().split())) for var_9 in range(var_12)]\n func_1(var_1, 0, var_5, min(var_18, 2500))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "import sys\nfrom heapq import heappush, heappop\nimport numpy as np\n\n\ndef func_3():\n return sys.stdin.readline().rstrip()\n\n\ndef func_2():\n return int(func_3())\n\n\ndef func_6():\n return map(int, func_3().split())\n\n\ndef func_4():\n return list(func_6())\n\n\ndef func_5():\n def func_1(var_16):\n def func_7(var_18, var_16, var_19):\n if var_16 < 0:\n return\n if var_8[var_18, var_16] <= var_19:\n return\n var_8[var_18, var_16] = var_19\n heappush(var_15, (var_19, var_18, var_16))\n\n var_10 = 10**18\n var_8 = np.full((var_12, var_1 + 1), var_10, dtype=int)\n\n var_15 = []\n func_7(0, var_16, 0)\n while var_15:\n var_19, var_18, var_16 = heappop(var_15)\n if var_8[var_18, var_16] < var_19:\n continue\n var_13 = min(var_16 + var_6[var_18], var_1)\n func_7(var_18, var_13, var_19 + var_7[var_18])\n for var_14, var_2, var_5 in var_3[var_18]:\n func_7(var_14, var_16 - var_2, var_19 + var_5)\n return np.min(var_8, axis=1)\n\n var_12, var_11, var_16 = func_6()\n var_3 = [[] for var_9 in range(var_12)]\n var_1 = 0\n for var_9 in range(var_11):\n var_17, var_18, var_2, var_5 = func_6()\n var_17 -= 1\n var_18 -= 1\n var_3[var_17].append((var_18, var_2, var_5))\n var_3[var_18].append((var_17, var_2, var_5))\n var_1 = max(var_1, var_2)\n var_1 *= var_12 - 1\n var_16 = min(var_16, var_1)\n var_6, var_7 = [0] * var_12, [0] * var_12\n for var_9 in range(var_12):\n var_6[var_9], var_7[var_9] = func_6()\n var_4 = func_1(var_16)\n print(*var_4[1:], sep=\"\\n\")\n\n\nif __name__ == \"__main__\":\n func_5()\n", "slow_time": 4949677909, "fast_time": 538991161, "speedup": 9.1832, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_3"} -{"pair_id": "python_7166", "problem_id": "p02683", "language": "python", "slow_code": "import numpy as np\n\nvar_5, var_4, var_7 = list(map(int, input().split()))\nvar_2 = []\nvar_1 = []\nfor var_11 in range(var_5):\n var_10 = 0\n var_8 = []\n var_10, *var_8 = list(map(int, input().split()))\n var_2.append(var_10)\n var_1.append(var_8)\nvar_1 = np.array(var_1)\nvar_12 = float(\"inf\")\nvar_13 = var_12\nfor var_9 in range(1 << var_5):\n var_3 = 0\n var_6 = np.zeros(var_4)\n for var_11 in range(var_5):\n if (var_9 >> var_11) & 1:\n var_3 += var_2[var_11]\n var_6 += var_1[var_11]\n var_6 = var_6.tolist()\n\n if min(var_6) >= var_7 and var_3 <= var_13:\n var_13 = var_3\nif var_13 == var_12:\n print(\"-1\")\nelse:\n print(var_13)\n\"\"\"\"\"\"\n", "fast_code": "import math\n\n\ndef func_2(var_2, var_1, var_14, var_7, var_10, var_3):\n if var_7 == 0:\n if min(var_3) >= var_14:\n return var_10\n else:\n return math.inf\n else:\n var_11 = var_10 + var_2[var_7 - 1]\n var_4 = [var_13 + var_5 for var_13, var_5 in zip(var_3, var_1[var_7 - 1])]\n return min(\n func_2(var_2, var_1, var_14, var_7 - 1, var_10, var_3),\n func_2(var_2, var_1, var_14, var_7 - 1, var_11, var_4),\n )\n\n\ndef func_1():\n from sys import stdin\n\n var_9, var_8, var_14 = list(map(int, stdin.readline().rstrip().split()))\n var_2 = []\n var_1 = []\n for _ in range(var_9):\n var_12 = list(map(int, stdin.readline().rstrip().split()))\n var_2.append(var_12[0])\n var_1.append(var_12[1:])\n var_3 = [0] * var_8\n var_6 = func_2(var_2, var_1, var_14, var_9, 0, var_3)\n print((var_6 if var_6 != math.inf else -1))\n\n\nfunc_1()\n", "slow_time": 854153208, "fast_time": 158271337, "speedup": 5.3968, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_3"} -{"pair_id": "python_16133", "problem_id": "p03317", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time\n\nsys.setrecursionlimit(10**7)\nvar_4 = 10**20\nvar_6 = 10**9 + 7\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_1():\n return int(eval(input()))\n\n\ndef func_3():\n return input().split()\n\n\ndef func_4():\n return eval(input())\n\n\ndef func_5():\n var_1, var_2 = func_2()\n var_5 = func_2()\n var_3 = 1\n _b = var_2\n while True:\n if var_1 <= _b:\n break\n else:\n _b += var_2 - 1\n var_3 += 1\n return var_3\n\n\nprint((func_5()))\n", "fast_code": "var_2, var_3 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nprint((-(-(var_2 - 1) // (var_3 - 1))))\n", "slow_time": 28243298, "fast_time": 8410913, "speedup": 3.3579, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_6"} -{"pair_id": "python_14471", "problem_id": "p02669", "language": "python", "slow_code": "from collections import defaultdict\n\n\ndef func_1(*var_4: str) -> str:\n var_17 = int(var_4[0])\n var_2 = [tuple(map(int, var_13.split())) for var_13 in var_4[1:]]\n var_15 = []\n for var_12, var_3, var_5, var_6, var_8 in var_2:\n var_1 = ((2, var_3), (3, var_5), (5, var_6))\n var_10 = defaultdict(lambda: var_12 * var_8)\n var_16 = [(var_12, 0)]\n while var_16:\n var_14, var_7 = var_16.pop()\n if min(var_10[0], var_10[var_14]) <= var_7:\n continue\n var_10[var_14] = var_7\n var_10[0] = min(var_10[0], var_7 + var_14 * var_8)\n if 0 < var_14:\n for var_18, var_19 in var_1:\n var_9, var_11 = divmod(var_14, var_18)\n if var_9:\n var_16.append((var_9, var_8 * var_11 + var_7 + var_19))\n if var_11:\n var_16.append(\n (var_9 + 1, var_8 * (var_18 - var_11) + var_7 + var_19)\n )\n var_15.append(str(var_10[0]))\n return \"\\n\".join(var_15)\n\n\nif __name__ == \"__main__\":\n print((func_1(*(open(0).read().splitlines()))))\n", "fast_code": "from functools import lru_cache\nimport sys\n\nvar_10 = sys.stdin.readline\nvar_15 = sys.stdin.readline\nvar_5 = 2**62 - 1\n\n\ndef func_7():\n return int(var_10())\n\n\ndef func_8():\n return list(map(int, var_10().split()))\n\n\ndef func_5():\n return float(var_10())\n\n\ndef func_6():\n return list(map(float, var_10().split()))\n\n\ndef func_9():\n return var_15().strip()\n\n\ndef func_10():\n return var_15().strip().split()\n\n\ndef func_1(*var_9):\n print(*var_9, file=sys.stderr)\n\n\ndef func_4(func_2):\n import time\n\n def func_12(*var_9, **var_13):\n var_17 = time.time()\n var_16 = func_2(*var_9, **var_13)\n var_11 = time.time()\n func_1(var_11 - var_17, \"sec\")\n return var_16\n\n return func_12\n\n\ndef func_11(var_6, var_1, var_2, var_3, var_4):\n @lru_cache(maxsize=None)\n def func_2(var_14):\n if var_14 == 1:\n return var_4\n if var_14 == 0:\n return 0\n var_8 = var_14 * var_4\n var_12 = (var_14 // 2) * 2\n var_8 = min(var_8, func_2(var_12 // 2) + var_1 + var_4 * abs(var_14 - var_12))\n var_12 = -(-var_14 // 2) * 2\n var_8 = min(var_8, func_2(var_12 // 2) + var_1 + var_4 * abs(var_14 - var_12))\n var_12 = (var_14 // 3) * 3\n var_8 = min(var_8, func_2(var_12 // 3) + var_2 + var_4 * abs(var_14 - var_12))\n var_12 = -(-var_14 // 3) * 3\n var_8 = min(var_8, func_2(var_12 // 3) + var_2 + var_4 * abs(var_14 - var_12))\n var_12 = (var_14 // 5) * 5\n var_8 = min(var_8, func_2(var_12 // 5) + var_3 + var_4 * abs(var_14 - var_12))\n var_12 = -(-var_14 // 5) * 5\n var_8 = min(var_8, func_2(var_12 // 5) + var_3 + var_4 * abs(var_14 - var_12))\n return var_8\n\n return func_2(var_6)\n\n\ndef func_3():\n var_7 = func_7()\n for _ in range(var_7):\n var_6, var_1, var_2, var_3, var_4 = func_8()\n print(func_11(var_6, var_1, var_2, var_3, var_4))\n\n\nif __name__ == \"__main__\":\n func_3()\n", "slow_time": 113056650889, "fast_time": 18347069002, "speedup": 6.1621, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_12"} -{"pair_id": "python_4483", "problem_id": "p02830", "language": "python", "slow_code": "from collections import Counter, defaultdict, deque\nfrom heapq import heappop, heappush, heapify\nimport sys, bisect, math, itertools, fractions, pprint\n\nsys.setrecursionlimit(10**8)\nvar_3 = 10**9 + 7\nvar_4 = 998244353\nvar_1 = float(\"inf\")\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_3(var_5):\n return list(int(sys.stdin.readline()) for var_2 in range(var_5))\n\n\nvar_5 = func_1()\nvar_7, var_8 = input().split()\nvar_6 = \"\"\nfor var_2 in range(var_5):\n var_6 += var_7[var_2] + var_8[var_2]\nprint(var_6)\n", "fast_code": "var_3 = int(input())\nvar_1, var_2 = input().split()\nprint(*[var_4 + var_5 for var_4, var_5 in zip(var_1, var_2)], sep=\"\")\n", "slow_time": 51953231, "fast_time": 16379205, "speedup": 3.1719, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_17"} -{"pair_id": "python_6081", "problem_id": "p02789", "language": "python", "slow_code": "import math\nimport statistics\nimport numpy as np\nimport queue\n\n\ndef func_1(var_10):\n if var_10 == 1:\n return 1\n else:\n return var_10 * func_1(var_10 - 1)\n\n\ndef func_2(var_1, var_2):\n if var_1 == 0:\n return var_2\n elif var_2 == 0:\n return var_1\n else:\n return func_2(var_2, var_1 % var_2)\n\n\ndef func_3(var_1, var_2):\n return var_1 * var_2 / func_2(var_1, var_2)\n\n\ndef func_4(var_11):\n if len(var_11) < 2:\n return var_11\n else:\n var_3, var_5 = 0, len(var_11) - 1\n var_9 = (var_3 + var_5) // 2\n var_12 = [var_4 for var_4 in var_11 if var_11[var_9] > var_4]\n var_6 = [var_4 for var_4 in var_11 if var_11[var_9] == var_4]\n var_7 = [var_4 for var_4 in var_11 if var_11[var_9] < var_4]\n return func_4(var_12) + var_6 + func_4(var_7)\n\n\nvar_10, var_8 = list(map(int, input().split()))\nif var_10 == var_8:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "var_1, var_2 = input().split()\nprint((\"YNeos\"[var_1 != var_2 :: 2]))\n", "slow_time": 76445893, "fast_time": 8196760, "speedup": 9.3264, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_9"} -{"pair_id": "python_7245", "problem_id": "p02683", "language": "python", "slow_code": "var_11, var_9, var_13 = list(map(int, input().split()))\nvar_7 = [list(map(int, input().split())) for _ in range(var_11)]\nvar_3 = [var_7[_][0] for _ in range(var_11)]\nvar_2 = [var_7[_][1:] for _ in range(var_11)]\nvar_1 = 1e9\nfor var_10 in range(2**15):\n var_5 = 0\n var_4 = [0 for _ in range(var_9)]\n for var_6 in range(var_11):\n if ((1 << var_6) & var_10) == 0:\n continue\n var_5 += var_3[var_6]\n for var_8 in range(var_9):\n var_4[var_8] += var_2[var_6][var_8]\n var_12 = 1\n for var_6 in range(var_9):\n if var_4[var_6] < var_13:\n var_12 = 0\n if var_12:\n var_1 = min(var_1, var_5)\nif var_1 == 1e9:\n var_1 = -1\nprint(var_1)\n", "fast_code": "import numpy as np\nimport sys\n\nvar_10, var_9, var_11 = list(map(int, input().split()))\nvar_4 = np.array([list(map(int, input().split())) for var_7 in range(var_10)])\nvar_5 = var_4.T[0]\nvar_1 = var_4.T[1:].T\nvar_3 = np.inf\nfor var_7 in range(2**var_10):\n var_2 = np.zeros(var_9, np.int64)\n var_6 = 0\n for var_8 in range(var_10):\n if (var_7 >> var_8) & 1:\n var_2 += var_1[var_8]\n var_6 += var_5[var_8]\n\n if all(var_7 >= var_11 for var_7 in var_2):\n var_3 = min(var_3, var_6)\nvar_3 = -1 if var_3 == np.inf else var_3\nprint(var_3)\n", "slow_time": 78624060680, "fast_time": 560384050, "speedup": 140.3039, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_25"} -{"pair_id": "python_3642", "problem_id": "p02786", "language": "python", "slow_code": "import sys\nimport math\nimport os\nimport itertools\nimport string\nimport heapq\nimport _collections\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nfrom functools import lru_cache\nimport bisect\nimport re\nimport queue\nimport copy\nimport decimal\n\n\nclass Class_1:\n @staticmethod\n def int():\n return int(sys.stdin.readline().rstrip())\n\n @staticmethod\n def string():\n return sys.stdin.readline().rstrip()\n\n @staticmethod\n def func_4():\n return [int(var_6) for var_6 in Class_1.string().split()]\n\n @staticmethod\n def func_6(var_4):\n return [Class_1.string() for var_3 in range(var_4)]\n\n @staticmethod\n def func_2(var_4):\n return [Class_1.map_int() for var_3 in range(var_4)]\n\n @staticmethod\n def func_1(var_4):\n return [Class_1.int() for var_3 in range(var_4)]\n\n\ndef func_5():\n var_1 = Class_1.int()\n var_2 = 0\n var_5 = 1\n while var_1 > 1:\n var_2 += var_5\n var_5 *= 2\n var_1 //= 2\n var_2 += var_5\n print(var_2)\n\n\ndef func_3():\n\n func_5()\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_2 = int(eval(input()))\nvar_3 = format(var_2, \"0b\")\nvar_1 = len(var_3)\nprint((2**var_1 - 1))\n", "slow_time": 97773077, "fast_time": 14195855, "speedup": 6.8874, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_25"} -{"pair_id": "python_4468", "problem_id": "p03136", "language": "python", "slow_code": "import sys\n\nvar_14 = lambda var_13: [int(var_3) for var_3 in var_13.split(\" \")]\nvar_16 = lambda var_15: [int(var_13) for var_13 in var_15]\nvar_17 = lambda var_15: [var_14(var_13) for var_13 in var_15]\nvar_6 = lambda: sys.stdin.readline().rstrip()\nvar_4 = lambda: int(var_6())\nvar_5 = lambda: var_14(var_6())\nvar_9 = lambda var_12: [sys.stdin.readline().rstrip() for _ in range(var_12)]\nvar_7 = lambda var_12: var_16(var_9(var_12))\nvar_8 = lambda var_12: var_17(var_9(var_12))\n\n\ndef func_1():\n var_2 = var_4()\n var_1 = var_5()\n var_1.sort()\n var_10 = sum(var_1[:-1])\n var_11 = var_1[-1]\n if var_10 > var_11:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nfunc_1()\n", "fast_code": "def func_1():\n var_2 = int(eval(input()))\n var_1 = [int(var_3) for var_3 in input().split()]\n var_4 = max(var_1)\n var_5 = sum(var_1) - var_4\n if var_4 < var_5:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 75579739, "fast_time": 30170786, "speedup": 2.5051, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_8"} -{"pair_id": "python_18487", "problem_id": "p03409", "language": "python", "slow_code": "from collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_11():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_9():\n return int(sys.stdin.readline())\n\n\ndef func_13():\n return list(map(list, sys.stdin.readline().split()))\n\n\ndef func_15():\n return list(sys.stdin.readline())[:-1]\n\n\ndef func_10(var_18):\n var_12 = [None for var_9 in range(var_18)]\n for var_9 in range(var_18):\n var_12[var_9] = func_9()\n return var_12\n\n\ndef func_12(var_18):\n var_12 = [None for var_9 in range(var_18)]\n for var_9 in range(var_18):\n var_12[var_9] = func_11()\n return var_12\n\n\ndef func_16(var_18):\n var_12 = [None for var_9 in range(var_18)]\n for var_9 in range(var_18):\n var_12[var_9] = func_15()\n return var_12\n\n\ndef func_14(var_18):\n var_12 = [None for var_9 in range(var_18)]\n for var_9 in range(var_18):\n var_12[var_9] = func_16()\n return var_12\n\n\nvar_17 = 1000000007\n\n\ndef func_1():\n return\n\n\ndef func_2():\n return\n\n\ndef func_3():\n def func_17(var_23, var_8, var_18):\n var_5 = [-1 for var_9 in range(var_18)]\n var_5[var_23] = 0\n var_21 = deque()\n var_21.append(var_23)\n var_7 = False\n while var_21:\n var_24 = var_21.popleft()\n for var_25 in range(var_18):\n if var_6[var_24][var_25] > 0 and var_5[var_25] < 0:\n var_5[var_25] = var_5[var_24] + 1\n if var_25 == var_8:\n var_7 = True\n break\n var_21.append(var_25)\n if var_7:\n break\n if var_5[var_8] == -1:\n return [None, 0]\n var_20 = [None for var_9 in range(var_5[var_8] + 1)]\n var_16 = float(\"inf\")\n var_20[var_5[var_8]] = var_8\n var_25 = var_8\n for var_9 in range(var_5[var_8])[::-1]:\n for var_24 in range(var_18 + 1):\n if var_6[var_24][var_25] > 0 and var_5[var_24] == var_5[var_25] - 1:\n var_20[var_9] = var_24\n if var_6[var_24][var_25] < var_16:\n var_16 = var_6[var_24][var_25]\n var_25 = var_24\n break\n return [var_20, var_16]\n\n def func_18(var_23, var_8, var_6, var_18):\n while 1:\n var_19, var_16 = func_17(var_23, var_8, var_18)\n if not var_16:\n break\n for var_9 in range(len(var_19) - 1):\n var_6[var_19[var_9]][var_19[var_9 + 1]] -= var_16\n var_6[var_19[var_9 + 1]][var_19[var_9]] += var_16\n return sum(var_6[var_8])\n\n var_18 = func_9()\n var_22 = func_12(var_18)\n var_4 = func_12(var_18)\n var_6 = [[0 for var_9 in range(2 * var_18 + 2)] for var_9 in range(2 * var_18 + 2)]\n for var_9 in range(var_18):\n var_6[0][var_9 + 1] = 1\n for var_10 in range(var_18):\n if (\n var_22[var_9][0] < var_4[var_10][0]\n and var_22[var_9][1] < var_4[var_10][1]\n ):\n var_6[var_9 + 1][var_18 + var_10 + 1] = 1\n for var_10 in range(var_18):\n var_6[var_18 + var_10 + 1][2 * var_18 + 1] = 1\n print((func_18(0, 2 * var_18 + 1, var_6, 2 * var_18 + 2)))\n\n\ndef func_4():\n var_18 = func_9()\n var_1 = func_11()\n var_4 = func_11()\n var_3 = 0\n var_19 = 1\n for var_11 in range(30):\n var_23 = 0\n var_6 = [var_4[var_9] % (var_19 * 2) for var_9 in range(var_18)]\n var_2 = [var_1[var_9] % (var_19 * 2) for var_9 in range(var_18)]\n var_6.sort()\n var_2.sort()\n var_13, var_14, var_15 = 0, 0, 0\n var_25 = float(\"inf\")\n for var_24 in var_2[::-1]:\n if var_24 != var_25:\n while var_13 < var_18 and var_6[var_13] < var_19 - var_24:\n var_13 += 1\n while var_14 < var_18 and var_6[var_14] < 2 * var_19 - var_24:\n var_14 += 1\n while var_15 < var_18 and var_6[var_15] < 3 * var_19 - var_24:\n var_15 += 1\n var_23 += var_18 - var_14 - var_13 - var_15\n var_25 = var_24\n var_3 += (var_23 % 2) * var_19\n var_19 *= 2\n print(var_3)\n\n\ndef func_5():\n return\n\n\ndef func_6():\n return\n\n\ndef func_7():\n return\n\n\ndef func_8():\n return\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "def func_1():\n var_3 = int(eval(input()))\n var_1 = sorted(\n [list(map(int, input().split())) for _ in range(var_3)],\n key=lambda var_9: -var_9[1],\n )\n var_2 = sorted([list(map(int, input().split())) for _ in range(var_3)])\n var_7 = 0\n for var_6, var_8 in var_2:\n for var_4, var_5 in var_1:\n if var_4 < var_6 and var_5 < var_8:\n var_7 += 1\n var_1.remove([var_4, var_5])\n break\n print(var_7)\n\n\nfunc_1()\n", "slow_time": 321964356, "fast_time": 52582925, "speedup": 6.123, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_9"} -{"pair_id": "python_788", "problem_id": "p02642", "language": "python", "slow_code": "var_8 = int(eval(input()))\nvar_1 = sorted(map(int, input().split()))\nvar_2 = 10**6\nvar_7 = [1] * (var_2 + 1)\nvar_4 = set()\nvar_6 = set()\nvar_5 = [0] * (var_2 + 1)\nfor var_3 in var_1:\n var_5[var_3] += 1\n if var_5[var_3] == 2 and var_7[var_3]:\n var_6.add(var_3)\n continue\n if 2 < var_5[var_3]:\n continue\n if var_7[var_3]:\n var_4.add(var_3)\n for var_9 in range(2 * var_3, var_2 + 1, var_3):\n var_7[var_9] = 0\nprint((len(var_4 - var_6)))\n", "fast_code": "var_8 = int(eval(input()))\nvar_1 = [int(var_5) for var_5 in input().split()]\nvar_7 = max(var_1)\nvar_4 = [True for var_5 in range(var_7 + 1)]\nvar_3 = set()\nfor var_5 in range(var_8):\n if var_1[var_5] in var_3:\n var_4[var_1[var_5]] = False\n else:\n var_3.add(var_1[var_5])\n for var_6 in range(2 * var_1[var_5], var_7 + 1, var_1[var_5]):\n var_4[var_6] = False\nvar_2 = 0\nfor var_5 in var_1:\n var_2 += var_4[var_5]\nprint(var_2)\n", "slow_time": 24452317730, "fast_time": 49265852, "speedup": 496.334, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_22"} -{"pair_id": "python_858", "problem_id": "p03556", "language": "python", "slow_code": "var_2 = int(eval(input()))\nfor var_1 in range(var_2, 0, -1):\n if float(var_1**0.5).is_integer():\n print(var_1)\n break\n", "fast_code": "import math\n\nvar_1 = int(eval(input()))\nvar_3 = math.sqrt(var_1)\nvar_2 = int(var_3)\nprint((var_2 * var_2))\n", "slow_time": 868435773, "fast_time": 14440448, "speedup": 60.1391, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_29"} -{"pair_id": "python_12060", "problem_id": "p00008", "language": "python", "slow_code": "while True:\n try:\n var_6 = int(eval(input()))\n var_4 = 0\n for var_1 in range(10):\n for var_2 in range(10):\n for var_3 in range(10):\n var_5 = var_6 - (var_1 + var_2 + var_3)\n if 0 <= var_5 <= 9:\n var_4 += 1\n print(var_4)\n except EOFError:\n break\n", "fast_code": "import sys\n\nvar_1 = [0] * 51\nfor var_3 in range(19):\n var_1[var_3] = var_1[36 - var_3] = (var_3 + 3) * (var_3 + 2) * (\n var_3 + 1\n ) // 6 - max(2 * (var_3 - 9) * (var_3 - 8) * (var_3 - 7) // 3, 0)\nfor var_2 in sys.stdin:\n print((var_1[int(var_2)]))\n", "slow_time": 210429027, "fast_time": 26712620, "speedup": 7.8775, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_3"} -{"pair_id": "python_6065", "problem_id": "p03566", "language": "python", "slow_code": "var_2 = int(eval(input()))\nvar_7 = list(map(int, input().split()))\nvar_9 = list(map(int, input().split()))\n\n\nvar_3 = -(10**15)\nvar_1 = [[var_3] * (102) for _ in range(100 * 200 + 2)]\nvar_1[0][0] = 0\n\nvar_8 = 1\nfor var_4 in range(var_2):\n\n for var_5 in range(var_8, var_8 + var_7[var_4]):\n\n for var_6 in range(0, var_9[var_4] + 1):\n if var_6 == 0:\n\n var_1[var_5][var_6] = max(\n var_1[var_5 - 1][0] + 0.25, var_1[var_5 - 1][1] + 1 / 2\n )\n elif var_6 != var_9[var_4]:\n var_1[var_5][var_6] = max(\n var_1[var_5 - 1][var_6 - 1] + var_6 - 1 / 2,\n var_1[var_5 - 1][var_6] + var_6 + 0.25,\n var_1[var_5 - 1][var_6 + 1] + var_6 + 1 / 2,\n )\n else:\n var_1[var_5][var_6] = max(\n var_1[var_5 - 1][var_6 - 1] + var_6 - 1 / 2,\n var_1[var_5 - 1][var_6] + var_6,\n )\n\n var_8 += var_7[var_4]\n\nprint((var_1[var_8 - 1][0]))\n", "fast_code": "var_1 = int(eval(input()))\nvar_3 = list([int(var_10) * 10 for var_10 in input().split()])\nvar_4 = list(map(int, input().split())) + [0]\nvar_2 = sum(var_3)\nvar_8 = [10**18] * (var_2 + 1)\nvar_8[0] = 0\nvar_8[var_2] = 0\nvar_9 = 0\nfor var_7, var_10 in enumerate(var_3):\n var_9 += var_10\n var_8[var_9] = min(var_4[var_7], var_4[var_7 + 1])\nvar_9 = 0\nfor var_12, var_10 in zip(var_4, var_3):\n for var_7 in range(var_10 + 1):\n var_8[var_9 + var_7] = min(var_8[var_9 + var_7], var_12)\n var_9 += var_10\nfor var_10 in range(1, var_2 + 1):\n var_8[var_10] = min(var_8[var_10], var_8[var_10 - 1] + 0.1)\nfor var_10 in range(var_2)[::-1]:\n var_8[var_10] = min(var_8[var_10], var_8[var_10 + 1] + 0.1)\nvar_6 = 0\nvar_11 = 0\nfor var_13, var_14 in zip(var_8, var_8[1:]):\n var_6 += min(var_13, var_14)\n var_11 += abs(var_13 - var_14)\nvar_5 = var_6 + var_11 / 2\nprint((var_5 / 10))\n", "slow_time": 6434338277, "fast_time": 966177479, "speedup": 6.6596, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_6"} -{"pair_id": "python_15901", "problem_id": "p03112", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import sqrt, hypot, factorial, pi, sin, cos, radians, log10\n\nif sys.version_info.minor >= 5:\n from math import gcd\nelse:\n from fractions import gcd\nfrom heapq import heappop, heappush, heapify, heappushpop\nfrom bisect import bisect_left, bisect_right\nfrom itertools import permutations, combinations, product, accumulate\nfrom operator import itemgetter, mul, xor\nfrom copy import copy, deepcopy\nfrom functools import reduce, partial\nfrom fractions import Fraction\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom datetime import date\n\n\ndef func_11():\n return sys.stdin.readline().strip()\n\n\ndef func_14(var_8, var_9, var_10):\n return [[var_10] * var_9 for var_16 in range(var_8)]\n\n\ndef func_15(var_8, var_9, var_10, var_11):\n return [[[var_11] * var_10 for var_21 in range(var_9)] for var_16 in range(var_8)]\n\n\ndef func_8(var_23, var_24=1):\n return int(-(-var_23 // var_24))\n\n\ndef func_16(var_23):\n return int((var_23 * 2 + 1) // 2)\n\n\ndef func_9(var_23, var_24, var_4):\n return var_23 * pow(var_24, var_4 - 2, var_4) % var_4\n\n\ndef func_12(var_23, var_24):\n return (var_23 * var_24) // gcd(var_23, var_24)\n\n\ndef func_13(var_22):\n return reduce(func_12, var_22, 1)\n\n\ndef func_10(var_22):\n return reduce(gcd, var_22, var_22[0])\n\n\ndef func_1():\n return int(eval(func_11()))\n\n\ndef func_3():\n return list(map(int, func_11().split()))\n\n\ndef func_2():\n return list(map(int, func_11().split()))\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_3 = float(\"inf\")\nvar_4 = 10**9 + 7\nvar_1, var_2, var_5 = func_3()\nvar_6 = [-var_3] * (var_1 + 2)\nfor var_16 in range(var_1):\n var_6[var_16 + 1] = func_1()\nvar_7 = [-var_3] * (var_2 + 2)\nfor var_16 in range(var_2):\n var_7[var_16 + 1] = func_1()\nvar_6[-1] = var_7[-1] = var_3\nfor var_16 in range(var_5):\n var_12 = var_13 = var_14 = var_15 = var_3\n var_23 = func_1()\n\n var_17 = bisect_right(var_6, var_23) - 1\n\n var_18 = bisect_left(var_6, var_23)\n var_19 = bisect_right(var_7, var_23) - 1\n var_20 = bisect_left(var_7, var_23)\n\n var_12 = var_23 - var_6[var_17]\n\n if var_12 != var_3:\n var_12 += min(\n abs(var_6[var_17] - var_7[var_19]), abs(var_6[var_17] - var_7[var_20])\n )\n var_13 = var_6[var_18] - var_23\n if var_13 != var_3:\n var_13 += min(\n abs(var_6[var_18] - var_7[var_19]), abs(var_6[var_18] - var_7[var_20])\n )\n var_14 = var_23 - var_7[var_19]\n if var_14 != var_3:\n var_14 += min(\n abs(var_7[var_19] - var_6[var_17]), abs(var_7[var_19] - var_6[var_18])\n )\n var_15 = var_7[var_20] - var_23\n if var_15 != var_3:\n var_15 += min(\n abs(var_7[var_20] - var_6[var_17]), abs(var_7[var_20] - var_6[var_18])\n )\n print((min(var_12, var_13, var_14, var_15)))\n", "fast_code": "import bisect\nimport sys\n\nvar_1, var_2, var_4 = list(map(int, input().split()))\nvar_3 = 10**13\nvar_14 = [-var_3] + [int(eval(input())) for var_11 in range(var_1)] + [var_3]\nvar_15 = [-var_3] + [int(eval(input())) for var_11 in range(var_2)] + [var_3]\nfor var_12 in range(var_4):\n var_16 = int(sys.stdin.readline())\n var_7, var_8 = bisect.bisect_right(var_14, var_16), bisect.bisect_right(\n var_15, var_16\n )\n var_13 = var_3\n for var_5 in [var_14[var_7 - 1], var_14[var_7]]:\n for var_6 in [var_15[var_8 - 1], var_15[var_8]]:\n var_9, var_10 = abs(var_5 - var_16) + abs(var_6 - var_5), abs(\n var_6 - var_16\n ) + abs(var_5 - var_6)\n var_13 = min(var_13, var_9, var_10)\n print(var_13)\n", "slow_time": 209429987, "fast_time": 66012821, "speedup": 3.1726, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_12"} -{"pair_id": "python_7592", "problem_id": "p03835", "language": "python", "slow_code": "var_4, var_5 = list(map(int, input().split()))\nvar_1 = 0\nfor var_2 in range(var_4 + 1):\n for var_3 in range(var_4 + 1):\n if var_5 >= var_2 + var_3 >= var_5 - var_4:\n var_1 += 1\nprint(var_1)\n", "fast_code": "import sys\n\n\ndef func_1():\n return sys.stdin.readline().strip()\n\n\nvar_2, var_3 = list(map(int, func_1().split()))\nvar_1 = 0\nfor var_4 in range(max(0, var_3 - 2 * var_2), var_2 + 1):\n for var_5 in range(max(0, var_3 - var_4 - var_2), min(var_2, var_3 - var_4) + 1):\n var_1 += 1\nprint(var_1)\n", "slow_time": 301802361, "fast_time": 46133200, "speedup": 6.542, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_27"} -{"pair_id": "python_9225", "problem_id": "p02883", "language": "python", "slow_code": "import math\n\nvar_3, var_1 = list(map(int, input().split()))\nvar_4 = [\n (var_6, var_5 * var_6)\n for var_5, var_6 in zip(\n sorted(list(map(int, input().split()))),\n sorted(list(map(int, input().split())))[::-1],\n )\n]\nvar_8, var_2, var_7 = 0, 10**12, 1\nexec(\n \"i,M,m=((i+m)//2,i,m) if sum(math.ceil(max(0,c-i)/b)for b, c in X)<=K else((i+M)//2,M,i);\"\n * 50\n)\nprint(var_2)\n", "fast_code": "def func_1(*, var_13, var_12, var_9):\n while abs(var_13 - var_12) > 1:\n var_10 = (var_13 + var_12) // 2\n if var_9(var_10):\n var_13 = var_10\n else:\n var_12 = var_10\n return var_13\n\n\ndef func_3():\n var_4, var_3 = list(map(int, input().split()))\n (*var_1,) = sorted(map(int, input().split()))\n (*var_2,) = sorted(map(int, input().split()), reverse=True)\n\n def func_2(var_15):\n var_14 = var_3\n for var_5, var_8 in zip(var_1, var_2):\n var_7 = max(0, var_5 * var_8 - var_15)\n if var_7:\n var_11 = (var_7 + var_8 - 1) // var_8\n if var_11 > var_5 or var_11 > var_14:\n return False\n var_14 -= var_11\n return True\n\n var_6 = func_1(ok=10**12, ng=-1, func=func_2)\n print(var_6)\n\n\nif __name__ == \"__main__\":\n func_3()\n", "slow_time": 822717967, "fast_time": 87743539, "speedup": 9.3764, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_29"} -{"pair_id": "python_5011", "problem_id": "p03606", "language": "python", "slow_code": "var_4 = int(eval(input()))\n\nvar_7 = [0] * 10**5\nfor var_1 in range(var_4):\n var_3, var_5 = list(map(int, input().split()))\n for var_2 in range(var_3, var_5 + 1):\n var_7[var_2 - 1] = 1\nvar_6 = 0\n\nfor var_1 in range(10**5):\n if var_7[var_1] == 1:\n var_6 += 1\nprint(var_6)\n", "fast_code": "var_4 = int(eval(input()))\nvar_3 = [tuple(map(int, input().split())) for _ in range(var_4)]\nvar_1 = 0\nfor var_2, var_5 in var_3:\n var_1 += var_5 - var_2 + 1\nprint(var_1)\n", "slow_time": 4037627509, "fast_time": 24107319, "speedup": 167.4855, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_24"} -{"pair_id": "python_2797", "problem_id": "p02577", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_1 = func_3()\nprint((\"Yes\" if sum(var_1) % 9 == 0 else \"No\"))\n", "fast_code": "def func_1():\n var_1 = int(input())\n print(\"Yes\") if var_1 % 9 == 0 else print(\"No\")\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 55150974, "fast_time": 14811744, "speedup": 3.7235, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_21"} -{"pair_id": "python_6084", "problem_id": "p02789", "language": "python", "slow_code": "import math\nimport statistics\nimport numpy as np\nimport queue\n\n\ndef func_1(var_10):\n if var_10 == 1:\n return 1\n else:\n return var_10 * func_1(var_10 - 1)\n\n\ndef func_2(var_1, var_2):\n if var_1 == 0:\n return var_2\n elif var_2 == 0:\n return var_1\n else:\n return func_2(var_2, var_1 % var_2)\n\n\ndef func_3(var_1, var_2):\n return var_1 * var_2 / func_2(var_1, var_2)\n\n\ndef func_4(var_11):\n if len(var_11) < 2:\n return var_11\n else:\n var_3, var_5 = 0, len(var_11) - 1\n var_9 = (var_3 + var_5) // 2\n var_12 = [var_4 for var_4 in var_11 if var_11[var_9] > var_4]\n var_6 = [var_4 for var_4 in var_11 if var_11[var_9] == var_4]\n var_7 = [var_4 for var_4 in var_11 if var_11[var_9] < var_4]\n return func_4(var_12) + var_6 + func_4(var_7)\n\n\nvar_10, var_8 = list(map(int, input().split()))\nif var_10 == var_8:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "var_1 = input().split()\nprint((\"Yes\" if var_1[0] == var_1[1] else \"No\"))\n", "slow_time": 76445893, "fast_time": 9019597, "speedup": 8.4755, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_3"} -{"pair_id": "python_10200", "problem_id": "p03222", "language": "python", "slow_code": "var_2, var_11, var_6 = list(map(int, input().split()))\nvar_1 = [[[] for var_4 in range(var_11)] for var_3 in range(var_2 + 1)]\n\n\nfor var_3 in range(var_2 + 1):\n for var_4 in range(var_11):\n var_1[var_3][var_4] = 0\nvar_1[0][0] = 1\nvar_9 = 1000000007\nfor var_3 in range(1, var_2 + 1):\n for var_4 in range(1 << (var_11 - 1)):\n var_12 = [False for var_8 in range(var_11)]\n for var_5 in range((var_11 - 1)):\n var_12[var_5] = True if ((var_4 >> var_5) & 1) else False\n var_10 = True\n for var_7 in range(var_11 - 2):\n if var_12[var_7] == True and var_12[var_7 + 1] == True:\n var_10 = False\n if not var_10:\n continue\n for var_7 in range(var_11):\n if var_7 == 0:\n if var_12[var_7]:\n var_1[var_3][var_7] += var_1[var_3 - 1][var_7 + 1]\n else:\n var_1[var_3][var_7] += var_1[var_3 - 1][var_7]\n var_1[var_3][var_7] %= var_9\n continue\n if var_7 == var_11 - 1:\n if var_12[var_7 - 1]:\n var_1[var_3][var_7] += var_1[var_3 - 1][var_7 - 1]\n else:\n var_1[var_3][var_7] += var_1[var_3 - 1][var_7]\n var_1[var_3][var_7] %= var_9\n continue\n if var_12[var_7 - 1] or var_12[var_7]:\n if var_12[var_7 - 1]:\n var_1[var_3][var_7] += var_1[var_3 - 1][var_7 - 1]\n else:\n var_1[var_3][var_7] += var_1[var_3 - 1][var_7 + 1]\n else:\n var_1[var_3][var_7] += var_1[var_3 - 1][var_7]\n var_1[var_3][var_7] %= var_9\nprint((var_1[var_2][var_6 - 1]))\n", "fast_code": "import sys\nfrom itertools import product\n\nvar_13 = sys.stdin.read\nvar_14 = sys.stdin.readline\nvar_15 = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nvar_4 = 1 << 60\nvar_6 = 1000000007\n\n\ndef func_1():\n var_3, var_7, var_5 = list(map(int, var_14().split()))\n var_1 = product((0, 1), repeat=var_7 - 1)\n var_2 = []\n for var_8 in var_1:\n var_12 = True\n for var_11 in range(var_7 - 2):\n if var_8[var_11] and var_8[var_11 + 1]:\n var_12 = False\n break\n if var_12:\n var_2.append(var_8)\n var_9 = [0] * var_7\n var_9[0] = 1\n for _ in range(var_3):\n var_9, var_10 = [0] * var_7, var_9\n for var_8 in var_2:\n for var_11 in range(var_7):\n if var_11 > 0 and var_8[var_11 - 1]:\n var_9[var_11 - 1] = (var_9[var_11 - 1] + var_10[var_11]) % var_6\n elif var_11 < var_7 - 1 and var_8[var_11]:\n var_9[var_11 + 1] = (var_9[var_11 + 1] + var_10[var_11]) % var_6\n else:\n var_9[var_11] = (var_9[var_11] + var_10[var_11]) % var_6\n print((var_9[var_5 - 1]))\n return\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 879549979, "fast_time": 143342189, "speedup": 6.136, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_18"} -{"pair_id": "python_14577", "problem_id": "p03603", "language": "python", "slow_code": "var_1 = int(input())\nvar_2 = list(map(int, input().split()))\nvar_3 = [0] + list(map(int, input().split()))\nvar_10 = [[] for _ in range(var_1 + 1)]\nfor var_8, var_13 in enumerate(var_2, 2):\n var_10[var_13].append(var_8)\n\n\ndef func_1(var_13):\n var_11 = len(var_10[var_13])\n if var_11 == 0:\n return var_3[var_13], 0\n var_7 = [[float(\"inf\")] * 5001 for _ in range(var_11 + 1)]\n var_7[0][0] = 0\n for var_8, var_6 in enumerate(var_10[var_13], 1):\n var_4, var_5 = func_1(var_6)\n for var_9 in range(var_4, 5001):\n var_7[var_8][var_9] = min(\n var_7[var_8][var_9], var_7[var_8 - 1][var_9 - var_4] + var_5\n )\n for var_9 in range(var_5, 5001):\n var_7[var_8][var_9] = min(\n var_7[var_8][var_9], var_7[var_8 - 1][var_9 - var_5] + var_4\n )\n var_12 = min(var_7[-1][: var_3[var_13] + 1])\n if var_12 == float(\"inf\"):\n print(\"IMPOSSIBLE\")\n exit()\n elif var_12 > var_3[var_13]:\n return var_12, var_3[var_13]\n else:\n return var_3[var_13], var_12\n\n\nprint(\"POSSIBLE\") if min(func_1(1)) <= var_3[1] else print(\"IMPOSSIBLE\")\n", "fast_code": "var_1 = int(input())\nvar_2 = list(map(int, input().split()))\nvar_3 = [0] + list(map(int, input().split()))\nvar_10 = [[] for _ in range(var_1 + 1)]\nfor var_8, var_13 in enumerate(var_2, 2):\n var_10[var_13].append(var_8)\n\n\ndef func_1(var_13):\n var_11 = len(var_10[var_13])\n if var_11 == 0:\n return var_3[var_13], 0\n var_7 = [[float(\"inf\")] * (var_3[var_13] + 1) for _ in range(var_11 + 1)]\n var_7[0][0] = 0\n for var_8, var_6 in enumerate(var_10[var_13], 1):\n var_4, var_5 = func_1(var_6)\n for var_9 in range(var_4, var_3[var_13] + 1):\n var_7[var_8][var_9] = min(\n var_7[var_8][var_9], var_7[var_8 - 1][var_9 - var_4] + var_5\n )\n for var_9 in range(var_5, var_3[var_13] + 1):\n var_7[var_8][var_9] = min(\n var_7[var_8][var_9], var_7[var_8 - 1][var_9 - var_5] + var_4\n )\n var_12 = min(var_7[-1])\n if var_12 == float(\"inf\"):\n print(\"IMPOSSIBLE\")\n exit()\n elif var_12 > var_3[var_13]:\n return var_12, var_3[var_13]\n else:\n return var_3[var_13], var_12\n\n\nprint(\"POSSIBLE\") if min(func_1(1)) <= var_3[1] else print(\"IMPOSSIBLE\")\n", "slow_time": 908704243, "fast_time": 93010519, "speedup": 9.7699, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_3"} -{"pair_id": "python_16578", "problem_id": "p02845", "language": "python", "slow_code": "_, var_1 = open(0)\nvar_2 = 1\nvar_3 = [3] + [0] * 10**6\nfor var_1 in map(int, var_1.split()):\n var_2 = var_2 * var_3[var_1] % (10**9 + 7)\n var_3[var_1] -= 1\n var_3[var_1 + 1] += 1\nprint(var_2)\n", "fast_code": "var_3 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = 1_000_000_007\nvar_6 = [0, 0, 0]\nvar_4 = 1\nfor var_7 in range(var_3):\n var_4 *= sum(var_5 == var_1[var_7] for var_5 in var_6)\n var_4 %= var_2\n for var_8 in range(3):\n if var_6[var_8] == var_1[var_7]:\n var_6[var_8] += 1\n break\nprint(var_4)\n", "slow_time": 815333677, "fast_time": 41667204, "speedup": 19.5678, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_29"} -{"pair_id": "python_2671", "problem_id": "p02630", "language": "python", "slow_code": "var_3 = lambda: [*list(map(int, input().split()))]\nvar_3()\nvar_7, *var_5 = [0] * 100002\nfor var_4 in var_3():\n var_7 += var_4\n var_5[var_4] += 1\nvar_6 = var_3()[0]\nfor _ in range(var_6):\n var_1, var_2 = var_3()\n var_7 += (var_2 - var_1) * var_5[var_1]\n var_5[var_2] += var_5[var_1]\n var_5[var_1] = 0\n print(var_7)\n", "fast_code": "var_5 = lambda: [*list(map(int, input().split()))]\nvar_5()\nvar_6, var_7 = var_5(), var_5()[0]\nfrom collections import *\n\nvar_1, var_8 = var_2(var_6), sum(var_6)\nfor _ in range(var_7):\n var_3, var_4 = var_5()\n var_8 += (var_4 - var_3) * var_1[var_3]\n var_1[var_4] += var_1[var_3]\n var_1[var_3] = 0\n print(var_8)\n", "slow_time": 246048618, "fast_time": 38436601, "speedup": 6.4014, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_25"} -{"pair_id": "python_15424", "problem_id": "p02695", "language": "python", "slow_code": "var_23, var_22, var_24 = list(map(int, input().split()))\nvar_17 = []\nfor var_14 in range(var_24):\n var_18, var_19, var_20, var_21 = list(map(int, input().split()))\n var_17.append([var_18, var_19, var_20, var_21])\nvar_2 = []\nfor var_6 in range(1, var_22 + 1):\n for var_7 in range(var_6, var_22 + 1):\n for var_8 in range(var_7, var_22 + 1):\n for var_9 in range(var_8, var_22 + 1):\n for var_10 in range(var_9, var_22 + 1):\n for var_11 in range(var_10, var_22 + 1):\n for var_12 in range(var_11, var_22 + 1):\n for var_13 in range(var_12, var_22 + 1):\n for var_14 in range(var_13, var_22 + 1):\n for var_15 in range(var_14, var_22 + 1):\n var_5 = [\n var_6,\n var_7,\n var_8,\n var_9,\n var_10,\n var_11,\n var_12,\n var_13,\n var_14,\n var_15,\n ]\n var_1 = []\n for var_4 in range(var_23):\n var_1.append(var_5[var_4])\n var_3 = 0\n for var_16 in range(var_24):\n if (\n var_1[var_17[var_16][1] - 1]\n - var_1[var_17[var_16][0] - 1]\n == var_17[var_16][2]\n ):\n var_3 += var_17[var_16][3]\n var_2.append(var_3)\nprint((max(var_2)))\n", "fast_code": "import sys\nimport itertools\n\nsys.setrecursionlimit(10**9)\nvar_13 = sys.stdin.readline\nvar_3, var_2, var_4 = list(map(int, var_13().split()))\nvar_7 = [list(map(int, var_13().split())) for _ in range(var_4)]\n\n\ndef func_1():\n var_16 = 0\n for var_6 in var_7:\n var_5, var_9, var_10, var_11 = var_6\n var_5 -= 1\n var_9 -= 1\n if var_10 == var_1[var_9] - var_1[var_5]:\n var_16 += var_11\n return var_16\n\n\ndef func_2(var_12, var_14):\n if var_12 == var_3:\n return func_1()\n var_16 = 0\n for var_17 in range(var_14, var_2 + 1):\n var_1[var_12] = var_17\n var_15 = func_2(var_12 + 1, var_17)\n var_16 = max(var_15, var_16)\n return var_16\n\n\nvar_1 = [0] * var_3\nvar_8 = func_2(0, 1)\nprint(var_8)\n", "slow_time": 6526662255, "fast_time": 566050900, "speedup": 11.5302, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_26"} -{"pair_id": "python_15784", "problem_id": "p03331", "language": "python", "slow_code": "var_5 = int(eval(input()))\nif var_5 % 10 == 0 and var_5 != 10:\n print((10))\nelse:\n var_1, var_2 = 1, 0\n var_6, var_7 = 0, 0\n var_8 = []\n while var_1 <= var_5:\n var_2 = var_5 - var_1\n for var_3 in str(var_1):\n var_6 += int(var_3)\n for var_4 in str(var_2):\n var_7 += int(var_4)\n var_8.append(var_6 + var_7)\n var_1 = var_1 + 1\n print((min(var_8)))\n", "fast_code": "var_1 = int(eval(input()))\nif var_1 % 10 == 0:\n print((10))\nelse:\n print((sum(map(int, list(str(var_1))))))\n", "slow_time": 147052057, "fast_time": 17095953, "speedup": 8.6016, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_7"} -{"pair_id": "python_6201", "problem_id": "p00033", "language": "python", "slow_code": "def func_1(var_1, var_4, var_2, var_3):\n return (\n var_2 == sorted(var_2) and var_3 == sorted(var_3)\n if var_4 == 10\n else func_1(var_1, var_4 + 1, var_2 + [var_1[var_4]], var_3)\n or func_1(var_1, var_4 + 1, var_2, var_3 + [var_1[var_4]])\n )\n\n\nfor var_5 in range(int(input())):\n print(\"YES\" if func_1(list(map(int, input().split())), 0, [], []) else \"NO\")\n", "fast_code": "import sys\n\n\ndef func_4(var_4):\n if func_1(var_4, [], []):\n print(\"YES\")\n else:\n print(\"NO\")\n\n\ndef func_1(var_4, var_2, var_1):\n if len(var_4) != 0:\n var_11 = var_4[0]\n if func_2(var_11, var_2):\n var_10 = var_2\n var_10.append(var_11)\n if func_1(var_4[1:], var_10, var_1):\n return True\n if func_2(var_11, var_1):\n var_9 = var_1\n var_9.append(var_11)\n if func_1(var_4[1:], var_2, var_9):\n return True\n else:\n return func_3(var_2) and func_3(var_1)\n\n\ndef func_2(var_11, var_8):\n if len(var_8) != 0:\n return var_11 >= var_8[len(var_8) - 1]\n return True\n\n\ndef func_3(var_8):\n\n var_5 = sorted(var_8)\n return var_5 == var_8\n\n\nvar_7 = 2**11\nsys.setrecursionlimit(var_7)\nvar_12 = int(eval(input()))\nfor var_6 in range(0, var_12):\n var_4 = []\n for var_3 in input().split(\" \"):\n var_4.append(int(var_3))\n func_4(var_4)\n var_12 -= 1\n if var_12 == 0:\n break\n", "slow_time": 487982458, "fast_time": 88264637, "speedup": 5.5286, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_3"} -{"pair_id": "python_6334", "problem_id": "p03719", "language": "python", "slow_code": "import functools\nimport os\nimport sys\n\nsys.setrecursionlimit(10000)\nvar_1 = float(\"inf\")\n\n\ndef func_8():\n return int(input())\n\n\ndef func_9():\n return float(input())\n\n\ndef func_12():\n return input()\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_3():\n return list(map(float, input().split()))\n\n\ndef func_6():\n return input().split()\n\n\ndef func_11(var_9):\n return [func_8() for _ in range(var_9)]\n\n\ndef func_10(var_9):\n return [func_9() for _ in range(var_9)]\n\n\ndef func_13(var_9):\n return [func_12() for _ in range(var_9)]\n\n\ndef func_5(var_9):\n return [func_2() for _ in range(var_9)]\n\n\ndef func_4(var_9):\n return [func_3() for _ in range(var_9)]\n\n\ndef func_7(var_9):\n return [func_6() for _ in range(var_9)]\n\n\ndef func_1(var_6):\n if not os.getenv(\"LOCAL\"):\n return var_6\n\n @functools.wraps(var_6)\n def func_14(*var_3, **var_8):\n var_10 = var_6(*var_3, **var_8)\n print(\n \"DEBUG: {}({}) -> \".format(\n var_6.__name__,\n \", \".join(\n list(map(str, var_3))\n + [\n \"{}={}\".format(var_7, str(var_11))\n for var_7, var_11 in var_8.items()\n ]\n ),\n ),\n end=\"\",\n )\n print(var_10)\n return var_10\n\n return func_14\n\n\nvar_2, var_4, var_5 = func_2()\nprint(\"Yes\" if var_2 <= var_5 <= var_4 else \"No\")\n", "fast_code": "var_4 = input().split()\nvar_1 = int(var_4[0])\nvar_2 = int(var_4[1])\nvar_3 = int(var_4[2])\nif var_3 in range(var_1, var_2 + 1):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 130412764, "fast_time": 18254153, "speedup": 7.1443, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_1"} -{"pair_id": "python_2302", "problem_id": "p02700", "language": "python", "slow_code": "from math import floor, ceil, sqrt, factorial, log\nfrom collections import Counter, deque\nfrom functools import reduce\n\n\ndef func_11():\n return eval(input())\n\n\ndef func_2():\n return int(eval(input()))\n\n\ndef func_10():\n return list(map(str, input().split()))\n\n\ndef func_9():\n return list(map(int, input().split()))\n\n\ndef func_1():\n return [int(var_5) for var_5 in input().split()]\n\n\ndef func_8():\n return list(func_10())\n\n\ndef func_3():\n return list(func_9())\n\n\ndef func_6():\n return [list(map(str, var_6.split())) for var_6 in eval(input())]\n\n\ndef func_4():\n return [list(map(int, var_6.split())) for var_6 in eval(input())]\n\n\ndef func_7(var_7: int):\n return [func_8() for _ in range(var_7)]\n\n\ndef func_5(var_7: int):\n return [func_3() for _ in range(var_7)]\n\n\nvar_1, var_2, var_3, var_4 = func_9()\nvar_8 = -(-var_1 // var_4)\nvar_9 = -(-var_3 // var_2)\nif var_8 >= var_9:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "import math\n\nvar_1, var_2, var_3, var_4 = list(map(int, input().split()))\nif math.ceil(var_3 / var_2) <= math.ceil(var_1 / var_4):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 100220167, "fast_time": 16790758, "speedup": 5.9688, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_11"} -{"pair_id": "python_5475", "problem_id": "p02392", "language": "python", "slow_code": "import sys\n\nif __name__ == \"__main__\":\n import doctest\n\n doctest.testmod()\n var_1, var_2, var_3 = list(map(int, sys.stdin.read().split()))\n if var_1 < var_2 < var_3:\n print(\"Yes\")\n else:\n print(\"No\")\n", "fast_code": "var_1, var_2, var_3 = list(map(int, input().split()))\nprint(\"Yes\" if var_1 < var_2 < var_3 else \"No\")\n", "slow_time": 3028838454, "fast_time": 11874774, "speedup": 255.0649, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_6"} -{"pair_id": "python_404", "problem_id": "p03160", "language": "python", "slow_code": "def func_2(var_3, var_4):\n return var_4 if var_3 > var_4 else var_3\n\n\ndef func_1(var_3, var_4):\n return var_4 if var_3 < var_4 else var_3\n\n\ndef func_3(var_2, var_6):\n var_1 = 10**9\n var_5 = [var_1] * (10**5 + 10)\n var_5[0] = 0\n var_5[1] = abs(var_6[1] - var_6[0])\n for var_7 in range(2, var_2):\n var_5[var_7] = func_2(\n var_5[var_7], var_5[var_7 - 1] + abs(var_6[var_7] - var_6[var_7 - 1])\n )\n var_5[var_7] = func_2(\n var_5[var_7], var_5[var_7 - 2] + abs(var_6[var_7] - var_6[var_7 - 2])\n )\n return var_5[var_2 - 1]\n\n\nif __name__ == \"__main__\":\n var_2 = int(eval(input()))\n var_6 = list(map(int, input().split()))\n print((func_3(var_2, var_6)))\n", "fast_code": "var_4 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nvar_1 = [float(\"inf\")] * var_4\nvar_1[0] = 0\nvar_1[1] = var_1[0] + abs(var_2[1] - var_2[0])\nfor var_3 in range(2, var_4):\n var_1[var_3] = min(\n var_1[var_3 - 1] + abs(var_2[var_3] - var_2[var_3 - 1]),\n var_1[var_3 - 2] + abs(var_2[var_3] - var_2[var_3 - 2]),\n )\nprint((var_1[var_4 - 1]))\n", "slow_time": 117408668, "fast_time": 37191112, "speedup": 3.1569, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_20"} -{"pair_id": "python_14573", "problem_id": "p03647", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_5 = [False] * var_2\nvar_7 = [False] * var_2\nfor _ in range(var_1):\n var_3, var_4 = list(map(int, input().split()))\n if var_3 == 1:\n var_5[var_4 - 1] = True\n elif var_4 == var_2:\n var_7[var_3 - 1] = True\nfor var_6 in range(1, var_2):\n if var_5[var_6] and var_7[var_6]:\n print(\"POSSIBLE\")\n break\nelse:\n print(\"IMPOSSIBLE\")\n", "fast_code": "import sys\n\nvar_4, var_3 = list(map(int, sys.stdin.readline().split()))\nvar_5, var_6 = set(), set()\nfor _ in range(var_3):\n var_1, var_2 = list(map(int, sys.stdin.readline().split()))\n if var_1 in [1, var_4] or var_2 in [1, var_4]:\n if var_1 == 1:\n var_5.add(var_2)\n if var_1 == var_4:\n var_6.add(var_2)\n if var_2 == 1:\n var_5.add(var_1)\n if var_2 == var_4:\n var_6.add(var_1)\nif var_5 & var_6:\n print(\"POSSIBLE\")\nelse:\n print(\"IMPOSSIBLE\")\n", "slow_time": 1854976633, "fast_time": 42212638, "speedup": 43.9436, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_2"} -{"pair_id": "python_7379", "problem_id": "p03044", "language": "python", "slow_code": "import sys\n\nvar_18 = sys.stdin.readline\n\n\ndef func_5():\n return int(eval(var_18()))\n\n\ndef func_9():\n return list(map(int, var_18().rstrip().split()))\n\n\ndef func_8():\n return list(map(int, var_18().rstrip().split()))\n\n\ndef func_7():\n return list(var_18().rstrip())\n\n\n \n \nfrom queue import Queue\n\n\ndef func_4(var_13, var_30, var_29, var_33, var_8):\n var_16 = len(var_13)\n var_32 = len(var_13[0])\n var_10 = [[-1 for _j in range(var_32)] for _i in range(var_16)]\n var_26 = Queue()\n var_10[var_30][var_29] = 0\n var_26.put((var_30, var_29))\n var_12 = [1, -1, 0, 0, 1, 1, -1, -1]\n var_11 = [0, 0, 1, -1, 1, -1, 1, -1]\n\n def func_6(var_34, var_35):\n return 0 <= var_35 and var_35 < var_16 and 0 <= var_34 and var_34 < var_32\n\n while not var_26.empty():\n var_35, var_34 = var_26.get()\n for var_21 in range(var_8):\n var_25, var_24 = var_35 + var_12[var_21], var_34 + var_11[var_21]\n if not func_6(var_24, var_25) or var_13[var_25][var_24] == var_33:\n continue\n elif var_10[var_25][var_24] != -1:\n continue\n var_10[var_25][var_24] = var_10[var_35][var_34] + 1\n var_26.put((var_25, var_24))\n return var_10\n\n\n \ndef func_1():\n var_16, var_32 = func_9()\n var_28 = [[\"\" for _j in range(var_32)] for _i in range(var_16)]\n for var_17 in range(var_16):\n var_28[var_17] = func_7()\n var_10 = func_4(var_28, 0, 0, \"#\", 4)\n if var_10[var_16 - 1][var_32 - 1] < 0:\n print((-1))\n else:\n var_7 = 0\n for var_17 in range(var_16):\n for var_20 in range(var_32):\n var_7 += var_28[var_17][var_20] == \".\"\n print((var_7 - (var_10[var_16 - 1][var_32 - 1] + 1))) \n\n\n \n \n \n \ndef func_3():\n var_4, var_1 = func_9()\n var_30, var_29 = func_9()\n var_15, var_14 = func_9()\n var_28 = [[\"\" for _j in range(var_1)] for _i in range(var_4)]\n for var_17 in range(var_4):\n var_28[var_17] = func_7()\n var_10 = func_4(var_28, var_30 - 1, var_29 - 1, \"#\", 4) \n print((var_10[var_15 - 1][var_14 - 1])) \n\n\n \ndef func_2():\n var_3 = func_5()\n var_2 = [[] for var_17 in range(var_3)]\n for var_17 in range(var_3 - 1):\n var_5, var_6, var_32 = func_9()\n var_5 -= 1\n var_6 -= 1\n var_2[var_5].append((var_6, var_32))\n var_2[var_6].append((var_5, var_32))\n var_19 = True\n var_9 = [-1 for _ in range(var_3)]\n var_27 = Queue()\n for var_31 in range(var_3):\n if var_9[var_31] != -1:\n \n continue\n var_9[var_31] = 0\n var_27.put(var_31)\n while not var_27.empty():\n var_31 = var_27.get()\n for var_22, var_23 in var_2[var_31]:\n if var_9[var_22] == -1:\n var_9[var_22] = var_9[var_31] + var_23\n var_27.put(var_22)\n for var_17 in var_9:\n if var_17 % 2 == 0:\n print((0))\n else:\n print((1))\n\n\nif __name__ == \"__main__\":\n \n \n func_2()\n", "fast_code": "import sys\nfrom heapq import heappush, heappop\n\nvar_13 = sys.stdin.read\nvar_14 = sys.stdin.readline\nvar_15 = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nvar_2 = 1 << 60\nvar_3 = 1000000007\n\n\ndef func_1():\n var_4, *var_5 = map(int, var_13().split())\n var_1 = [[] for _ in range(var_4)]\n for var_16, var_17, var_18 in zip(*[iter(var_5)] * 3):\n var_1[var_16 - 1].append((var_17 - 1, var_18))\n var_1[var_17 - 1].append((var_16 - 1, var_18))\n var_9 = [var_2] * var_4\n var_9[0] = 0\n var_10 = [(0, 0)]\n while var_10:\n var_8, var_17 = heappop(var_10)\n if var_8 > var_9[var_17]:\n continue\n for var_12, var_7 in var_1[var_17]:\n if var_9[var_12] > var_9[var_17] + var_7:\n var_9[var_12] = var_9[var_17] + var_7\n heappush(var_10, (var_9[var_12], var_12))\n var_6 = [0] * var_4\n for var_11 in range(var_4):\n var_6[var_11] = 0 if var_9[var_11] % 2 == 0 else 1\n print(*var_6, sep=\"\\n\")\n return\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 204160464, "fast_time": 67326738, "speedup": 3.0324, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_14"} -{"pair_id": "python_7890", "problem_id": "p02708", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = 0\nfor var_4 in range(var_1, var_2 + 2):\n var_6 = var_4 * (var_4 - 1) // 2\n var_5 = var_4 * var_2 - var_6\n var_3 = var_3 + (var_5 - var_6 + 1)\nprint((var_3 % (10**9 + 7)))\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nprint(\n (\n (\n var_2 * (var_2 + 1) * (var_2 + 2) // 6\n - (3 * var_2 - 2 * var_1 + 4) * (var_1 - 1) * var_1 // 6\n - var_1\n + var_2\n + 2\n )\n % (10**9 + 7)\n )\n)\n", "slow_time": 2003161693, "fast_time": 17504024, "speedup": 114.4401, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_25"} -{"pair_id": "python_18283", "problem_id": "p02831", "language": "python", "slow_code": "var_1, var_2 = list(map(int, input().split()))\nvar_3, var_4 = var_1, var_2\nwhile True:\n if var_3 > var_4:\n var_4 += var_2\n elif var_3 < var_4:\n var_3 += var_1\n if var_3 == var_4:\n print(var_3)\n break\n", "fast_code": "var_2, var_3 = list(map(int, input().split()))\nimport math\n\n\ndef func_1(var_2, var_3):\n for var_1 in range(min(var_2, var_3), 0, -1):\n if var_2 % var_1 == 0 and var_3 % var_1 == 0:\n return var_1\n\n\nprint((int(var_2 * var_3 / func_1(var_2, var_3))))\n", "slow_time": 1958684566, "fast_time": 282756854, "speedup": 6.9271, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_27"} -{"pair_id": "python_6685", "problem_id": "p03275", "language": "python", "slow_code": "import sys\nfrom itertools import accumulate\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\nclass Class_1:\n def __init__(self, var_8):\n self.n = len(var_8)\n self.tree = [0] * (self.n + 1)\n for var_7 in range(1, self.n + 1):\n var_13 = var_8[var_7 - 1]\n while var_7 <= self.n:\n self.tree[var_7] += var_13\n var_7 += var_7 & (-var_7)\n\n def func_5(self, var_7, var_13):\n while var_7 <= self.n:\n self.tree[var_7] += var_13\n var_7 += var_7 & (-var_7)\n return\n\n def func_4(self, var_7):\n var_12 = 0\n while var_7 > 0:\n var_12 += self.tree[var_7]\n var_7 -= var_7 & (-var_7)\n return var_12\n\n\nvar_3 = func_1()\nvar_1 = func_2()\n\n\ndef func_3(var_13):\n var_2 = [0] + [1 if var_1[var_7] >= var_13 else -1 for var_7 in range(var_3)]\n var_2 = list(accumulate(var_2))\n var_2 = [var_4 + var_3 + 1 for var_4 in var_2]\n\n var_5 = Class_1([0] * (2 * var_3 + 2))\n var_6 = 0\n for var_7 in range(var_3 + 1):\n var_4 = var_2[var_7]\n var_6 += var_5.query(var_4)\n var_5.update(var_4, 1)\n if var_6 >= (var_3 * (var_3 + 1) + 3) // 4:\n return True\n return False\n\n\nvar_11 = 1\nvar_10 = 10**9 + 1\nwhile var_11 + 1 < var_10:\n var_9 = (var_11 + var_10) // 2\n if func_3(var_9):\n var_11 = var_9\n else:\n var_10 = var_9\nprint(var_11)\n", "fast_code": "var_10 = int(eval(input()))\nvar_4 = list(map(int, input().split()))\nvar_14 = list(sorted(set(var_4)))\nvar_11 = var_10 * (var_10 + 1) // 2\nvar_1 = 0\nvar_2 = len(var_14)\nwhile var_2 > var_1 + 1:\n var_8 = (var_1 + var_2) // 2\n var_15 = var_14[var_8]\n var_3 = [1 if var_5 >= var_15 else -1 for var_5 in var_4]\n var_6 = [0] * (2 * var_10 + 1)\n var_7 = 0\n var_6[var_7 + var_10] = 1\n var_9 = 0\n var_12 = 0\n for var_13 in var_3:\n var_7 += var_13\n if var_13 == 1:\n var_12 += var_6[var_7 + var_10] + 1\n else:\n var_12 -= var_6[var_7 + var_10 + 1] - 1\n var_6[var_7 + var_10] += 1\n var_9 += var_12\n if var_9 >= var_11 // 2:\n var_1 = var_8\n break\n else:\n var_2 = var_8\nprint((var_14[var_1]))\n", "slow_time": 119661320, "fast_time": 32655938, "speedup": 3.6643, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_6"} -{"pair_id": "python_11718", "problem_id": "p02536", "language": "python", "slow_code": "from networkx.utils import UnionFind\nimport sys\n\n\ndef func_1():\n return sys.stdin.readline().rstrip()\n\n\ndef func_2():\n var_5, var_4 = list(map(int, func_1().split()))\n var_6 = UnionFind()\n for var_3 in range(1, var_5 + 1):\n _ = var_6[var_3]\n for _ in range(var_4):\n var_1, var_2 = list(map(int, func_1().split()))\n var_6.union(var_1, var_2)\n print((len(list(var_6.to_sets())) - 1))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\n\n\nclass Class_1:\n def __init__(self, var_6):\n self.n = var_6\n self.parents = [-1] * var_6\n\n def func_2(self, var_10):\n if self.parents[var_10] < 0:\n return var_10\n else:\n self.parents[var_10] = self.find(self.parents[var_10])\n return self.parents[var_10]\n\n def func_8(self, var_10, var_11):\n var_10 = self.find(var_10)\n var_11 = self.find(var_11)\n if var_10 == var_11:\n return\n if self.parents[var_10] > self.parents[var_11]:\n var_10, var_11 = var_11, var_10\n self.parents[var_10] += self.parents[var_11]\n self.parents[var_11] = var_10\n\n def func_7(self, var_10):\n return -self.parents[self.find(var_10)]\n\n def func_6(self, var_10, var_11):\n return self.find(var_10) == self.find(var_11)\n\n def func_4(self, var_10):\n var_8 = self.find(var_10)\n return [var_5 for var_5 in range(self.n) if self.find(var_5) == var_8]\n\n def func_5(self):\n return [var_5 for var_5, var_10 in enumerate(self.parents) if var_10 < 0]\n\n def func_3(self):\n return len(self.roots())\n\n def func_1(self):\n return {var_7: self.members(var_7) for var_7 in self.roots()}\n\n def __str__(self):\n return \"\\n\".join(\n \"{}: {}\".format(var_7, self.members(var_7)) for var_7 in self.roots()\n )\n\n\nvar_9 = Class_1(var_2 + 1)\nfor var_5 in range(var_1):\n var_3, var_4 = list(map(int, input().split()))\n var_9.union(var_3, var_4)\nprint((var_9.group_count() - 2))\n", "slow_time": 18069444838, "fast_time": 128200785, "speedup": 140.9464, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_18"} -{"pair_id": "python_8203", "problem_id": "p03352", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_2 = 1\nfor var_3 in range(1, 1000):\n for var_4 in range(2, 1000):\n var_5 = var_3**var_4\n if var_5 > var_1:\n break\n var_2 = max(var_2, var_5)\nprint(var_2)\n", "fast_code": "from sys import stdin\nimport bisect\nfrom itertools import accumulate\nimport numpy as np\n\nvar_3 = int(stdin.readline().rstrip())\nvar_2 = [1]\nfor var_1 in range(2, 34):\n for var_4 in range(2, 10):\n if var_1**var_4 <= 1000:\n var_2.append(var_1**var_4)\n else:\n break\nvar_2 = list(set(var_2))\nvar_2.sort()\nprint((var_2[bisect.bisect(var_2, var_3) - 1]))\n", "slow_time": 300783133, "fast_time": 38248694, "speedup": 7.8639, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_3"} -{"pair_id": "python_346", "problem_id": "p03164", "language": "python", "slow_code": "import sys\n\n\ndef func_1():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\nvar_1, var_3 = func_1()\nvar_9 = [func_1() for _ in range(var_1)]\nvar_2 = var_1 * 10**3\nvar_4 = [[float(\"INF\")] * (var_2 + 1) for _ in range(var_1 + 1)]\nvar_4[0][0] = 0\nfor var_5 in range(1, var_1 + 1):\n var_8, var_7 = var_9[var_5 - 1]\n for var_6 in range(var_2 + 1):\n if var_6 - var_7 >= 0:\n var_4[var_5][var_6] = min(\n var_4[var_5][var_6], var_4[var_5 - 1][var_6 - var_7] + var_8\n )\n var_4[var_5][var_6] = min(var_4[var_5][var_6], var_4[var_5 - 1][var_6])\nprint((max([var_5 for var_5 in range(var_2 + 1) if var_4[-1][var_5] <= var_3])))\n", "fast_code": "\"\"\"\"\"\"\n\nvar_1 = 2000000000\nvar_8, var_3 = list(map(int, input().split()))\nvar_10 = [0] * var_8\nvar_9 = [0] * var_8\nfor var_6 in range(var_8):\n var_10[var_6], var_9[var_6] = list(map(int, input().split()))\nvar_2 = sum(var_9)\nvar_5 = [[var_1 for var_6 in range(var_2 + 1)] for var_7 in range(var_8 + 1)]\n\nvar_5[0][0] = 0\nfor var_6 in range(var_8):\n for var_7 in range(var_2 + 1):\n if var_7 < var_9[var_6]:\n var_5[var_6 + 1][var_7] = var_5[var_6][var_7]\n else:\n var_5[var_6 + 1][var_7] = min(\n var_5[var_6][var_7], var_5[var_6][var_7 - var_9[var_6]] + var_10[var_6]\n )\nvar_4 = 0\nfor var_6 in range(var_2 + 1):\n if var_5[var_8][var_6] <= var_3:\n var_4 = var_6\nprint(var_4)\n", "slow_time": 5389440474, "fast_time": 109898705, "speedup": 49.0401, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_24"} -{"pair_id": "python_11019", "problem_id": "p02640", "language": "python", "slow_code": "var_3, var_4 = list(map(int, input().split()))\nfor var_1 in range(0, 101):\n for var_2 in range(0, 101):\n if var_1 + var_2 == var_3 and var_1 * 2 + var_2 * 4 == var_4:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "fast_code": "var_4, var_5 = list(map(int, input().split()))\nvar_1 = \"No\"\nfor var_2 in range(var_4 + 1):\n var_3 = var_4 - var_2\n if var_2 * 2 + var_3 * 4 == var_5:\n var_1 = \"Yes\"\nprint(var_1)\n", "slow_time": 502995557, "fast_time": 17325743, "speedup": 29.0317, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_27"} -{"pair_id": "python_18282", "problem_id": "p02831", "language": "python", "slow_code": "var_1, var_2 = list(map(int, input().split()))\nvar_3 = 0\nfor var_4 in range(max(var_1, var_2), 0, -1):\n if var_1 % var_4 == 0 and var_2 % var_4 == 0:\n var_3 = var_4\n break\nprint((var_1 * var_2 // var_3))\n", "fast_code": "var_2, var_3 = list(map(int, input().split()))\nimport math\n\n\ndef func_1(var_2, var_3):\n for var_1 in range(min(var_2, var_3), 0, -1):\n if var_2 % var_1 == 0 and var_3 % var_1 == 0:\n return var_1\n\n\nprint((int(var_2 * var_3 / func_1(var_2, var_3))))\n", "slow_time": 1631239856, "fast_time": 282756854, "speedup": 5.7691, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_27"} -{"pair_id": "python_9238", "problem_id": "p02960", "language": "python", "slow_code": "var_8 = input()[::-1]\nvar_6 = 13\nvar_7 = 10**9 + 7\nvar_2 = [[0] * 13 for _ in range(len(var_8) + 1)]\nvar_2[0][0] = 1\nfor var_3 in range(len(var_8)):\n if var_8[var_3] == \"?\":\n for var_4 in range(10):\n var_1 = var_4 * pow(10, var_3, var_6)\n for var_5 in range(13):\n var_2[var_3 + 1][(var_5 + var_1) % var_6] += var_2[var_3][var_5]\n var_2[var_3 + 1][(var_5 + var_1) % var_6] %= var_7\n else:\n var_1 = int(var_8[var_3]) * pow(10, var_3, var_6)\n for var_5 in range(13):\n var_2[var_3 + 1][(var_5 + var_1) % var_6] += var_2[var_3][var_5]\nprint((var_2[-1][5]))\n", "fast_code": "import sys\n\n\ndef func_1():\n var_2 = sys.stdin.readline\n var_6 = 10**9 + 7\n var_8 = str(var_2().rstrip(\"\\n\"))\n var_5 = [[0] * 13 for _ in range(len(var_8))]\n for var_1 in range(len(var_8)):\n if var_1 == 0:\n if var_8[-var_1 - 1] == \"?\":\n for var_3 in range(10):\n var_5[var_1][var_3] += 1\n else:\n var_5[var_1][int(var_8[-var_1 - 1])] += 1\n else:\n var_7 = pow(10, var_1, 13)\n if var_8[-var_1 - 1] == \"?\":\n for var_3 in range(13):\n for var_4 in range(10):\n var_5[var_1][(var_4 * var_7 + var_3) % 13] += var_5[var_1 - 1][\n var_3\n ]\n else:\n var_9 = int(var_8[-var_1 - 1])\n for var_3 in range(13):\n var_5[var_1][(var_9 * var_7 + var_3) % 13] += var_5[var_1 - 1][\n var_3\n ]\n for var_3 in range(13):\n var_5[var_1][var_3] = var_5[var_1][var_3] % var_6\n print((var_5[-1][5]))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 991064274, "fast_time": 362355066, "speedup": 2.7351, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_4"} -{"pair_id": "python_6105", "problem_id": "p02789", "language": "python", "slow_code": "import math\nimport statistics\nimport numpy as np\nimport queue\n\n\ndef func_1(var_10):\n if var_10 == 1:\n return 1\n else:\n return var_10 * func_1(var_10 - 1)\n\n\ndef func_2(var_1, var_2):\n if var_1 == 0:\n return var_2\n elif var_2 == 0:\n return var_1\n else:\n return func_2(var_2, var_1 % var_2)\n\n\ndef func_3(var_1, var_2):\n return var_1 * var_2 / func_2(var_1, var_2)\n\n\ndef func_4(var_11):\n if len(var_11) < 2:\n return var_11\n else:\n var_3, var_5 = 0, len(var_11) - 1\n var_9 = (var_3 + var_5) // 2\n var_12 = [var_4 for var_4 in var_11 if var_11[var_9] > var_4]\n var_6 = [var_4 for var_4 in var_11 if var_11[var_9] == var_4]\n var_7 = [var_4 for var_4 in var_11 if var_11[var_9] < var_4]\n return func_4(var_12) + var_6 + func_4(var_7)\n\n\nvar_10, var_8 = list(map(int, input().split()))\nif var_10 == var_8:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "import queue as Q\n\nvar_2, var_1 = list(map(int, input().split()))\nif var_2 > var_1:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "slow_time": 76445893, "fast_time": 13369748, "speedup": 5.7178, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_17"} -{"pair_id": "python_3778", "problem_id": "p03564", "language": "python", "slow_code": "from copy import deepcopy\nimport math\nimport string\nimport collections\nfrom collections import Counter\nfrom collections import deque\nfrom decimal import Decimal\nimport sys\nimport fractions\nfrom operator import itemgetter\nimport itertools\nimport copy\n\n\ndef func_5():\n return list(map(int, input().split()))\n\n\ndef func_4(var_9, var_10):\n return math.factorial(var_9) // (\n math.factorial(var_9 - var_10) * math.factorial(var_10)\n )\n\n\ndef func_3(var_12):\n var_11 = []\n for var_7 in var_12:\n if not (var_7 in var_11):\n var_11.append(var_7)\n return len(var_12) != len(var_11)\n\n\ndef func_1(var_9):\n func_1 = []\n for var_6 in range(1, var_9 + 1):\n if var_9 % var_6 == 0:\n func_1.append(var_6)\n return func_1\n\n\ndef func_2(var_1, var_3):\n while var_3 != 0:\n var_1, var_3 = var_3, var_1 % var_3\n return var_1\n\n\nvar_4 = [-1, -1, -1, 0, 0, 1, 1, 1]\nvar_5 = [-1, 0, 1, -1, 1, -1, 0, 1]\nvar_9 = int(eval(input()))\nvar_8 = int(eval(input()))\nvar_2 = 1\nfor var_6 in range(var_9):\n var_2 = min(var_2 * 2, var_2 + var_8)\nprint(var_2)\n", "fast_code": "var_3 = int(input())\nvar_4 = int(input())\nvar_1 = 1\nfor var_2 in range(0, var_3):\n if var_4 > var_1:\n var_1 += var_1\n else:\n var_1 += var_4\nprint(var_1)\n", "slow_time": 90173136, "fast_time": 16380269, "speedup": 5.505, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_9"} -{"pair_id": "python_6062", "problem_id": "p03566", "language": "python", "slow_code": "var_8 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_5 = [[-1] * 102 for _ in range(sum(var_1) + 1)]\nvar_5[0][0] = 0\nvar_10 = 0\nvar_11 = var_1[0]\n\nvar_4 = [-1, 0, 1]\nfor var_6 in range(sum(var_1)):\n if var_11 == var_6:\n var_10 += 1\n var_11 += var_1[var_10]\n for var_7 in range(101):\n if var_7 > var_2[var_10] or var_5[var_6][var_7] == -1:\n break\n for var_3 in var_4:\n var_9 = var_7 + var_3\n if 0 <= var_9 <= var_2[var_10]:\n if var_3 != 0 or var_7 == var_2[var_10]:\n var_5[var_6 + 1][var_9] = max(\n var_5[var_6 + 1][var_9],\n var_5[var_6][var_7] + (var_7 + var_9) / 2,\n )\n else:\n var_5[var_6 + 1][var_9] = max(\n var_5[var_6 + 1][var_9], var_5[var_6][var_7] + var_7 + 0.25\n )\nprint((var_5[-1][0]))\n", "fast_code": "var_8 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_9 = [0] * var_8\nfor var_5 in range(var_8 - 1):\n var_9[var_5 + 1] = var_9[var_5] + var_1[var_5]\nvar_7 = (var_9[-1] + var_1[var_8 - 1]) * 2 + 1\nvar_3 = [1e100] * var_7\nfor var_5 in range(var_7):\n var_3[var_5] = min(var_3[var_5], var_5 / 2)\n var_3[var_7 - var_5 - 1] = min(var_3[var_5], var_5 / 2)\nfor var_6 in range(var_8):\n for var_5 in range(var_7):\n if var_5 <= var_9[var_6] * 2:\n var_3[var_5] = min(\n var_3[var_5], var_2[var_6] + (var_9[var_6] * 2 - var_5) / 2\n )\n elif var_9[var_6] * 2 <= var_5 <= var_9[var_6] * 2 + var_1[var_6] * 2:\n var_3[var_5] = min(var_3[var_5], var_2[var_6])\n else:\n var_3[var_5] = min(\n var_3[var_5],\n var_2[var_6] + (var_5 - var_9[var_6] * 2 - var_1[var_6] * 2) / 2,\n )\nvar_4 = 0\nfor var_5 in range(var_7 - 1):\n var_4 += (var_3[var_5] + var_3[var_5 + 1]) / 4\nprint(var_4)\n", "slow_time": 4557267717, "fast_time": 810617711, "speedup": 5.622, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_21"} -{"pair_id": "python_13149", "problem_id": "p03698", "language": "python", "slow_code": "import sys\n\nvar_16 = sys.stdin\nvar_1 = 1 << 60\nvar_2 = 1000000007\nvar_11 = lambda: int(var_13())\nvar_12 = lambda var_17: [var_11() for _ in range(var_17)]\nvar_3 = lambda: list(map(int, var_16.readline().split()))\nvar_4 = lambda var_17: [var_3() for _ in range(var_17)]\nvar_7 = lambda: float(var_13())\nvar_10 = lambda var_17: [var_7() for _ in range(var_17)]\nvar_8 = lambda: list(map(float, var_16.readline().split()))\nvar_9 = lambda var_17: [var_8() for _ in range(var_17)]\nvar_13 = lambda: var_16.readline().rstrip()\nvar_14 = lambda var_17: [var_13() for _ in range(var_17)]\nvar_6 = lambda var_17: [list(var_13()) for _ in range(var_17)]\nvar_5 = lambda: var_16.readline().split()\nvar_15 = var_13()\nprint((\"yes\" if len(var_15) == len(set(var_15)) else \"no\"))\n", "fast_code": "var_1 = list(input())\nvar_2 = set(var_1)\nprint(\"yes\") if (len(var_1) == len(var_2)) else print(\"no\")\n", "slow_time": 91067072, "fast_time": 12604997, "speedup": 7.2247, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_2"} -{"pair_id": "python_15529", "problem_id": "p02695", "language": "python", "slow_code": "var_23, var_22, var_24 = list(map(int, input().split()))\nvar_17 = []\nfor var_14 in range(var_24):\n var_18, var_19, var_20, var_21 = list(map(int, input().split()))\n var_17.append([var_18, var_19, var_20, var_21])\nvar_2 = []\nfor var_6 in range(1, var_22 + 1):\n for var_7 in range(var_6, var_22 + 1):\n for var_8 in range(var_7, var_22 + 1):\n for var_9 in range(var_8, var_22 + 1):\n for var_10 in range(var_9, var_22 + 1):\n for var_11 in range(var_10, var_22 + 1):\n for var_12 in range(var_11, var_22 + 1):\n for var_13 in range(var_12, var_22 + 1):\n for var_14 in range(var_13, var_22 + 1):\n for var_15 in range(var_14, var_22 + 1):\n var_5 = [\n var_6,\n var_7,\n var_8,\n var_9,\n var_10,\n var_11,\n var_12,\n var_13,\n var_14,\n var_15,\n ]\n var_1 = []\n for var_4 in range(var_23):\n var_1.append(var_5[var_4])\n var_3 = 0\n for var_16 in range(var_24):\n if (\n var_1[var_17[var_16][1] - 1]\n - var_1[var_17[var_16][0] - 1]\n == var_17[var_16][2]\n ):\n var_3 += var_17[var_16][3]\n var_2.append(var_3)\nprint((max(var_2)))\n", "fast_code": "import itertools\n\nvar_4, var_3, var_5 = list(map(int, input().split()))\nvar_2 = [list(map(int, input().split())) for var_13 in range(var_5)]\nvar_1 = list(itertools.combinations_with_replacement(list(range(1, var_3 + 1)), var_4))\nvar_7 = 0\nfor var_10 in var_1:\n var_11 = 0\n for var_13 in range(var_5):\n var_6, var_8, var_9, var_12 = var_2[var_13]\n if var_10[var_8 - 1] - var_10[var_6 - 1] == var_9:\n var_11 += var_12\n var_7 = max(var_11, var_7)\nprint(var_7)\n", "slow_time": 6526662255, "fast_time": 918733146, "speedup": 7.104, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_5"} -{"pair_id": "python_1778", "problem_id": "p03608", "language": "python", "slow_code": "from itertools import permutations\nfrom scipy.sparse.csgraph import floyd_warshall\n\nvar_10, var_9, var_12 = list(map(int, input().split()))\nvar_14 = list(map(int, input().split()))\nvar_1 = 10**18\nvar_11 = [[var_1] * var_10 for var_7 in range(var_10)]\nfor var_7 in range(var_9):\n var_2, var_4, var_5 = list(map(int, input().split()))\n var_11[var_2 - 1][var_4 - 1] = var_5\n var_11[var_4 - 1][var_2 - 1] = var_5\nvar_11 = floyd_warshall(var_11)\nvar_3 = 10**18\nfor var_13 in permutations(var_14):\n var_6 = 0\n for var_8 in range(1, var_12):\n var_6 += var_11[var_13[var_8 - 1] - 1][var_13[var_8] - 1]\n var_3 = min(var_3, var_6)\nprint((int(var_3)))\n", "fast_code": "from heapq import heappop, heappush\nfrom itertools import permutations\n\n\ndef func_1(var_15: int) -> \"Array[int]\":\n\n var_14 = len(var_2)\n var_10 = [float(\"inf\")] * var_14\n var_10[var_15] = 0\n var_17 = var_14 - 2\n var_13 = [(0, var_15)]\n while var_13:\n var_8, var_18 = heappop(var_13)\n if var_8 > var_10[var_18]:\n continue\n for var_11, var_16 in var_2[var_18]:\n if var_8 + var_11 < var_10[var_16]:\n var_10[var_16] = var_8 + var_11\n heappush(var_13, (var_10[var_16], var_16))\n var_17 -= 1\n if not var_17:\n return var_10\n return var_10\n\n\ndef func_2():\n global G\n var_4, var_3, var_5, *var_6 = list(map(int, open(0).read().split()))\n var_19, var_1 = var_6[:var_5], var_6[var_5:]\n var_2 = [[] for _ in range(var_4 + 1)]\n for var_18, var_16, var_8 in zip(*[iter(var_1)] * 3):\n var_2[var_18].append((var_8, var_16)), var_2[var_16].append((var_8, var_18))\n var_10 = {var_18: func_1(var_18) for var_18 in var_19}\n var_7 = float(\"inf\")\n for var_12 in permutations(var_19):\n var_9 = sum(\n var_10[var_18][var_16] for var_18, var_16 in zip(var_12, var_12[1:])\n )\n var_7 = min(var_7, var_9)\n print(var_7)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "slow_time": 16547903576, "fast_time": 78060632, "speedup": 211.9878, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_2"} -{"pair_id": "python_6219", "problem_id": "p00040", "language": "python", "slow_code": "var_7 = [\n \"a\",\n \"b\",\n \"c\",\n \"d\",\n \"e\",\n \"f\",\n \"g\",\n \"h\",\n \"i\",\n \"j\",\n \"k\",\n \"l\",\n \"m\",\n \"n\",\n \"o\",\n \"p\",\n \"q\",\n \"r\",\n \"s\",\n \"t\",\n \"u\",\n \"v\",\n \"w\",\n \"x\",\n \"y\",\n \"z\",\n]\nvar_11 = [1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25]\nvar_12 = int(input())\nfor var_13 in range(var_12):\n var_4 = input()\n for var_1 in var_11:\n var_9 = 0\n for var_2 in range(26):\n var_6 = \"\"\n for var_3 in var_4:\n if var_3 != \" \":\n var_8 = var_7.index(var_3)\n for var_10 in range(26):\n if (var_1 * var_10 + var_2) % 26 == var_8:\n var_5 = var_7[var_10]\n break\n var_6 += var_5\n else:\n var_6 += \" \"\n if var_6.count(\"that\") > 0 or var_6.count(\"this\") > 0:\n var_9 = 1\n break\n if var_9 == 1:\n break\n print(var_6)\n", "fast_code": "import sys\nimport os\nimport math\n\nvar_1 = int(eval(input()))\nvar_4 = \"abcdefghijklmnopqrstuvwxyz\"\n\n\ndef func_1(var_14, var_3, var_6):\n var_15 = []\n for var_7 in var_14:\n if var_7 == \" \":\n var_15.append(var_7)\n else:\n var_12 = ord(var_7) - 97\n var_17 = (var_3 * var_12 + var_6) % 26\n var_18 = var_4[var_17]\n var_15.append(var_18)\n return \"\".join(var_15)\n\n\nfor var_13 in range(var_1):\n var_14 = input().strip()\n for var_2 in range(0, 26):\n for var_5 in range(0, 26):\n var_11 = func_1(\"this\", var_2, var_5)\n var_10 = func_1(\"that\", var_2, var_5)\n if var_11 in var_14 or var_10 in var_14:\n var_9 = func_1(var_4, var_2, var_5)\n var_16 = str.maketrans(var_9, var_4)\n var_8 = var_14.translate(var_16)\n print(var_8)\n", "slow_time": 6096430089, "fast_time": 559587423, "speedup": 10.8945, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_7"} -{"pair_id": "python_2230", "problem_id": "p02585", "language": "python", "slow_code": "import sys\n\nvar_21 = sys.stdin.readline\nvar_20 = sys.stdin.read\nvar_14 = lambda: var_21().rstrip()\nvar_11 = lambda: int(var_21().rstrip())\nvar_13 = lambda: map(int, var_21().split())\nvar_12 = lambda: list(map(int, var_21().split()))\nvar_18 = lambda var_24: print(*var_24, sep=\"\\n\")\n\n\ndef func_1():\n var_10, var_8 = var_13()\n var_16 = var_12()\n _c = var_12()\n var_5 = [0] * var_10\n for var_7 in range(var_10):\n var_16[var_7] -= 1\n var_5[var_7] = _c[var_16[var_7]]\n var_9 = 31\n var_1 = -(1 << 63)\n var_23 = list()\n var_22 = list()\n var_23.append(var_16)\n var_22.append(var_5)\n for var_2 in range(1, var_9 + 1):\n var_17 = [0] * var_10\n var_6 = [0] * var_10\n for var_7 in range(var_10):\n var_17[var_7] = var_23[var_2 - 1][var_23[var_2 - 1][var_7]]\n var_6[var_7] = (\n var_22[var_2 - 1][var_7] + var_22[var_2 - 1][var_23[var_2 - 1][var_7]]\n )\n var_23.append(var_17)\n var_22.append(var_6)\n var_19 = [[var_1, 0] for _ in range(var_10)]\n var_15 = [[var_1, var_1] for _ in range(var_10)]\n for var_4 in range(var_9, -1, -1):\n for var_7 in range(var_10):\n if (var_8 >> var_4) & 1:\n var_15[var_23[var_4][var_7]][0] = max(\n var_15[var_23[var_4][var_7]][0],\n var_19[var_7][0] + var_22[var_4][var_7],\n )\n var_15[var_23[var_4][var_7]][1] = max(\n var_15[var_23[var_4][var_7]][1],\n var_19[var_7][1] + var_22[var_4][var_7],\n )\n var_15[var_7][0] = max(\n var_15[var_7][0], var_19[var_7][0], var_19[var_7][1]\n )\n else:\n var_15[var_23[var_4][var_7]][0] = max(\n var_15[var_23[var_4][var_7]][0],\n var_19[var_7][0] + var_22[var_4][var_7],\n )\n var_15[var_7][0] = max(var_15[var_7][0], var_19[var_7][0])\n var_15[var_7][1] = max(var_15[var_7][1], var_19[var_7][1])\n var_19, var_15 = var_15, var_19\n var_3 = max(max(var_24) for var_24 in var_19)\n if var_3 == 0:\n var_3 = max(var_5)\n print(var_3)\n return\n\n\nfunc_1()\n", "fast_code": "import sys\n\nvar_14 = sys.stdin.read\nvar_15 = sys.stdin.readlines\nfrom itertools import accumulate\n\n\ndef func_1():\n var_12, var_9 = list(map(int, input().split()))\n var_13 = tuple(map(int, input().split()))\n var_1 = tuple(map(int, input().split()))\n if var_9 == 1:\n print((max(var_1)))\n sys.exit()\n var_19 = [0] * var_12\n var_6 = []\n for var_7 in range(var_12):\n if not var_19[var_7]:\n var_5 = []\n var_11 = var_7\n while True:\n if var_19[var_11]:\n var_6.append(var_5)\n break\n var_5.append(var_1[var_11])\n var_19[var_11] = 1\n var_11 = var_13[var_11] - 1\n var_17 = max(var_1)\n for var_2 in var_6:\n var_18 = max(var_2)\n var_3 = len(var_2)\n var_4 = sum(var_2)\n var_10, var_16 = divmod(var_9, var_3)\n if var_16 == 0:\n var_10 -= 1\n var_16 = var_3\n if var_10 > 0:\n var_10 -= 1\n var_16 += var_3\n var_2 = tuple(accumulate(var_2 + var_2 + var_2))\n for var_7 in range(2, var_16 + 1):\n for var_8 in range(var_3):\n var_18 = max(var_18, var_2[var_7 + var_8] - var_2[var_8])\n if var_4 > 0:\n var_18 += var_10 * var_4\n var_17 = max(var_17, var_18)\n print(var_17)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 231578340, "fast_time": 101824874, "speedup": 2.2743, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_27"} -{"pair_id": "python_14582", "problem_id": "p00687", "language": "python", "slow_code": "while 1:\n var_6, var_1, var_2 = list(map(int, input().split()))\n if var_6 == var_1 == var_2 == 0:\n break\n var_3 = 0\n var_4 = [1] + [0] * 2000000\n for var_5 in range(0, var_6 + 1):\n if var_4[var_5]:\n var_4[var_5 + var_1] = var_4[var_5 + var_2] = 1\n else:\n var_3 += 1\n print(var_3)\n", "fast_code": "while 1:\n var_5, var_2, var_3 = list(map(int, input().split()))\n if var_5 == 0:\n break\n var_1 = [1] * (var_5 + 1)\n for var_4 in range(var_2):\n var_6 = var_3 * var_4\n while var_6 <= var_5:\n var_1[var_6] = 0\n var_6 += var_2\n print(sum(var_1))\n", "slow_time": 6644536519, "fast_time": 30546868, "speedup": 217.5194, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_2"} -{"pair_id": "python_10533", "problem_id": "p02657", "language": "python", "slow_code": "import numpy as np\nimport scipy as sp\nimport math\n\nvar_1, var_3 = list(map(str, input().split()))\nvar_1 = int(var_1)\nvar_3 = int(float(var_3) * 100.001)\nvar_2 = int(var_1 * var_3 // 100)\nprint(var_2)\n", "fast_code": "import math\n\nvar_1, var_2 = list(map(float, input().split()))\nvar_2 *= 100\nvar_3 = math.floor(var_1 * var_2)\nprint((int(var_3 / 100)))\n", "slow_time": 601968667, "fast_time": 10551881, "speedup": 57.0485, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_3"} -{"pair_id": "python_14495", "problem_id": "p02669", "language": "python", "slow_code": "from functools import lru_cache\n\n\nimport sys\n\nvar_10 = sys.stdin.readline\nvar_16 = sys.stdin.readline\nvar_5 = 2**62 - 1\n\n\ndef func_7():\n return int(var_10())\n\n\ndef func_8():\n return list(map(int, var_10().split()))\n\n\ndef func_5():\n return float(var_10())\n\n\ndef func_6():\n return list(map(float, var_10().split()))\n\n\ndef func_9():\n return var_16().strip()\n\n\ndef func_10():\n return var_16().strip().split()\n\n\ndef func_1(*var_9):\n print(*var_9, file=sys.stderr)\n\n\ndef func_4(func_2):\n import time\n\n def func_12(*var_9, **var_13):\n var_18 = time.time()\n var_17 = func_2(*var_9, **var_13)\n var_11 = time.time()\n func_1(var_11 - var_18, \"sec\")\n return var_17\n\n return func_12\n\n\ndef func_11(var_6, var_1, var_2, var_3, var_4):\n if var_6 == 1:\n return var_4\n\n @lru_cache(maxsize=None)\n def func_2(var_15):\n var_8 = var_15 * var_4\n for var_12 in range(-5, 6 if var_15 > 10 else 1):\n var_14 = var_15 + var_12\n var_12 = abs(var_12)\n if var_14 < 0:\n continue\n if var_14 == 0:\n var_8 = min(var_8, var_4 * var_12)\n continue\n if var_14 % 5 == 0:\n var_8 = min(var_8, func_2(var_14 // 5) + var_3 + var_4 * var_12)\n\n if var_14 % 3 == 0:\n var_8 = min(var_8, func_2(var_14 // 3) + var_2 + var_4 * var_12)\n\n if var_14 % 2 == 0:\n var_8 = min(var_8, func_2(var_14 // 2) + var_1 + var_4 * var_12)\n\n return var_8\n\n return func_2(var_6)\n\n\ndef func_3():\n var_7 = func_7()\n for _ in range(var_7):\n var_6, var_1, var_2, var_3, var_4 = func_8()\n print(func_11(var_6, var_1, var_2, var_3, var_4))\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_9 = int(eval(input()))\nvar_10 = []\nfor var_11 in range(var_9):\n var_6, var_1, var_2, var_3, var_4 = list(map(int, input().split()))\n var_5 = {0: 0, 1: var_4}\n var_8 = {2: var_1, 3: var_2, 5: var_3}\n\n def func_1(var_6):\n if var_6 in var_5:\n return var_5[var_6]\n var_7 = var_4 * var_6\n for var_12 in var_8:\n var_13, var_14 = (\n var_6 // var_12 * var_12,\n (var_6 + var_12 - 1) // var_12 * var_12,\n )\n var_7 = min(\n var_7,\n var_4 * abs(var_6 - var_13) + var_8[var_12] + func_1(var_13 // var_12),\n var_4 * abs(var_6 - var_14) + var_8[var_12] + func_1(var_14 // var_12),\n )\n var_5[var_6] = var_7\n return var_7\n\n var_10.append(func_1(var_6))\nprint((\"\\n\".join(map(str, var_10))))\n", "slow_time": 169828749809, "fast_time": 20584269513, "speedup": 8.2504, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_22"} -{"pair_id": "python_15323", "problem_id": "p02971", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**9)\nvar_6 = sys.stdin.readline\nfrom itertools import permutations, combinations, accumulate\nfrom functools import *\nfrom collections import deque, defaultdict, Counter\nfrom heapq import heapify, heappop, heappush, heappushpop\n\nvar_2 = float(\"inf\")\nvar_4 = -1\nvar_3 = int(eval(var_6()))\nvar_1 = [int(eval(var_6())) for _ in range(var_3)]\nvar_7 = max(var_1)\nvar_8 = [var_5 for var_5, var_10 in enumerate(var_1) if var_10 == var_7]\nif len(var_8) > 1:\n for var_5 in range(var_3):\n print(var_7)\n exit()\nelse:\n for var_5 in var_8:\n var_1[var_5] = var_4\n var_9 = max(var_1)\n for var_5 in range(var_3):\n if var_5 in var_8:\n print(var_9)\n else:\n print(var_7)\n", "fast_code": "var_1 = [int(eval(input())) for var_2 in range(int(eval(input())))]\nvar_3 = sorted(var_1)[-1]\nvar_4 = sorted(var_1)[-2]\nfor var_2 in var_1:\n print((var_3 if var_2 != var_3 else var_4))\n", "slow_time": 60612209, "fast_time": 27341638, "speedup": 2.2168, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_8"} -{"pair_id": "python_14033", "problem_id": "p00028", "language": "python", "slow_code": "var_1 = [0 for var_3 in range(101)]\nwhile True:\n try:\n var_4 = eval(input())\n var_1[var_4] += 1\n except:\n break\nfor var_2 in [var_3 for var_3, var_2 in enumerate(var_1) if var_2 == max(var_1)]:\n print(var_2)\n", "fast_code": "var_2 = {}\ntry:\n while True:\n var_6 = int(input())\n if var_6 in var_2:\n var_2[var_6] += 1\n else:\n var_2[var_6] = 1\nexcept EOFError:\n pass\nvar_1 = []\nvar_5 = max(var_2.values())\nfor var_4, var_7 in list(var_2.items()):\n if var_7 == var_5:\n var_1.append(var_4)\nvar_1.sort()\nfor var_3 in var_1:\n print(var_3)\n", "slow_time": 122839158, "fast_time": 34750615, "speedup": 3.5349, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_3"} -{"pair_id": "python_3490", "problem_id": "p02922", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\nvar_7 = 10**20\nvar_8 = 10**9 + 7\nvar_5 = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nvar_6 = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef func_2():\n return [int(var_9) for var_9 in sys.stdin.readline().split()]\n\n\ndef func_3():\n return [int(var_9) - 1 for var_9 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_4():\n return sys.stdin.readline().split()\n\n\ndef func_5():\n return eval(input())\n\n\ndef func_6():\n var_1, var_3 = func_2()\n var_4 = 1\n var_2 = 0\n while True:\n if var_4 >= var_3:\n return var_2\n var_2 += 1\n var_4 -= 1\n var_4 += var_1\n\n\nprint((func_6()))\n", "fast_code": "var_1, var_3 = list(map(int, input().split()))\nvar_4 = 1\nvar_2 = 0\nwhile var_4 < var_3:\n var_4 += var_1 - 1\n var_2 += 1\nprint(var_2)\n", "slow_time": 80117443, "fast_time": 15995403, "speedup": 5.0088, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_9"} -{"pair_id": "python_13497", "problem_id": "p02406", "language": "python", "slow_code": "def func_1():\n def func_2():\n var_2 = eval(input())\n var_1 = 1\n var_3 = \"\"\n\n while True:\n var_4 = var_1\n if var_4 % 3 == 0:\n var_3 += \" \" + str(var_1)\n\n var_1 += 1\n if var_1 <= var_2:\n\n continue\n else:\n\n break\n\n while True:\n if var_4 % 10 == 3:\n var_3 += \" \" + str(var_1)\n\n var_1 += 1\n if var_1 <= var_2:\n\n break\n else:\n\n return var_3\n\n else:\n var_4 /= 10\n if var_4:\n\n continue\n else:\n\n var_1 += 1\n if var_1 <= var_2:\n\n break\n else:\n\n return var_3\n\n return var_3\n\n print(func_2())\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_2 = int(input())\nfor var_1 in range(1, var_2 + 1):\n var_3 = str(var_1)\n if var_1 % 3 == 0 or \"3\" in var_3:\n print(\"\", var_1, end=\"\")\nprint()\n", "slow_time": 828189394, "fast_time": 34016214, "speedup": 24.3469, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_11"} -{"pair_id": "python_17497", "problem_id": "p02615", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(1 << 25)\nvar_15 = sys.stdin.readline\nvar_14 = range\nvar_11 = enumerate\n\n\ndef func_2(*var_8, **var_13):\n print(*var_8, **var_13)\n sys.exit()\n\n\ndef func_5(*var_8, var_17=1):\n return list(map(lambda var_18: var_18 - var_17, var_8))\n\n\n \ndef func_1():\n return int(var_15())\n\n\ndef func_3():\n return list(map(int, var_15().split()))\n\n\ndef func_6(var_2):\n\\\n\\\n \n var_16 = []\n for _ in range(var_2):\n var_16.append(list(map(int, var_15().split())))\n return tuple(map(list, zip(*var_16)))\n\n\ndef func_8(var_2):\n \n var_16 = []\n for _ in range(var_2):\n var_16.append(tuple(map(int, var_15().split())))\n return var_16\n\n\ndef func_7(var_2):\n \n var_16 = []\n for _ in range(var_2):\n var_16.append(list(map(int, var_15().split())))\n return var_16\n \n\n\nvar_4 = 10**9 + 7\nvar_3 = 2**31 \n \nfrom collections import defaultdict, Counter, deque\nfrom operator import itemgetter, xor, add\nfrom itertools import product, permutations, combinations\nfrom bisect import bisect_left, bisect_right \nfrom functools import reduce\nfrom math import gcd\n\n\ndef func_4(var_6, var_9):\n \n var_12 = gcd(var_6, var_9)\n return var_6 // var_12 * var_9\n\n\n \n \nvar_5 = func_1()\nvar_1 = func_3()\nvar_1.sort(reverse=True)\nvar_7 = var_1[0]\nvar_10 = 1\nfor var_6 in var_1[1:]:\n if var_10 == var_5 - 1:\n break\n var_7 += var_6\n var_10 += 1\n if var_10 == var_5 - 1:\n break\n var_7 += var_6\n var_10 += 1\nprint(var_7)\n", "fast_code": "import sys\n\nvar_5 = sys.stdin.readline\nvar_2 = int(eval(var_5()))\nvar_1 = list(map(int, var_5().split()))\nvar_1.sort(reverse=True)\nvar_3 = 0\nfor var_4 in range(1, var_2):\n var_3 += var_1[var_4 // 2]\nprint(var_3)\n", "slow_time": 122798898, "fast_time": 24314593, "speedup": 5.0504, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_24"} -{"pair_id": "python_9757", "problem_id": "p02554", "language": "python", "slow_code": "var_3 = 10**9 + 7\nvar_1 = int(eval(input()))\nvar_5, var_4, var_6, var_2 = 1, 0, 0, 0\nfor _ in range(var_1):\n var_5, var_4, var_6, var_2 = (\n 8 * var_5,\n var_5 + var_4 * 9,\n var_5 + var_6 * 9,\n var_4 + var_6 + var_2 * 10,\n )\n var_5 %= var_3\n var_4 %= var_3\n var_6 %= var_3\n var_2 %= var_3\nprint(var_2)\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = 10**9 + 7\nprint(((10**var_2 - 2 * 9**var_2 + 8**var_2) % var_1))\n", "slow_time": 16138820276, "fast_time": 3865871345, "speedup": 4.1747, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_4"} -{"pair_id": "python_5934", "problem_id": "p03693", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_3():\n return [int(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return [list(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_7():\n return list(sys.stdin.readline())[:-1]\n\n\ndef func_2(var_5):\n return [func_1() for var_3 in range(var_5)]\n\n\ndef func_4(var_5):\n return [func_3() for var_3 in range(var_5)]\n\n\ndef func_8(var_5):\n return [func_7() for var_3 in range(var_5)]\n\n\ndef func_6(var_5):\n return [func_5() for var_3 in range(var_5)]\n\n\nsys.setrecursionlimit(1000000)\nvar_4 = 1000000007\n\n\ndef func_9():\n var_6, var_2, var_1 = func_3()\n var_7 = var_6 * 100 + var_2 * 10 + var_1\n if var_7 % 4 == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n return\n\n\nif __name__ == \"__main__\":\n func_9()\n", "fast_code": "var_4 = input().split()\nvar_2 = \"\"\nfor var_3 in var_4:\n var_2 = var_2 + var_3\nvar_1 = int(var_2)\nif var_1 % 4 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "slow_time": 90554878, "fast_time": 16370993, "speedup": 5.5314, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_5"} -{"pair_id": "python_10399", "problem_id": "p03576", "language": "python", "slow_code": "import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import (\n ceil,\n sqrt,\n hypot,\n factorial,\n pi,\n sin,\n cos,\n tan,\n asin,\n acos,\n atan,\n radians,\n degrees,\n log2,\n gcd,\n)\nfrom itertools import (\n accumulate,\n permutations,\n combinations,\n combinations_with_replacement,\n product,\n groupby,\n)\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom bisect import bisect, bisect_left, insort, insort_left\nfrom heapq import heappush, heappop\nfrom functools import reduce\n\n\ndef func_6():\n return sys.stdin.readline().strip()\n\n\ndef func_1():\n return int(eval(func_6()))\n\n\ndef func_3():\n return list(map(int, func_6().split()))\n\n\ndef func_2():\n return list(map(int, func_6().split()))\n\n\ndef func_4():\n return tuple(map(int, func_6().split()))\n\n\ndef func_5(var_13):\n return list(zip(*(func_3() for _ in range(var_13))))\n\n\nsys.setrecursionlimit(10**9)\nvar_1 = float(\"inf\")\nvar_12 = 10**9 + 7\n\nfrom decimal import *\n\nvar_3, var_2 = func_3()\nvar_15 = [func_2() for _ in range(var_3)]\nvar_14, var_16 = list(zip(*var_15))\nvar_14 = sorted(var_14)\nvar_16 = sorted(var_16)\nvar_4 = var_1\nfor var_5, var_7 in combinations(var_14, 2):\n for var_6, var_8 in combinations(var_16, 2):\n var_9 = 0\n for var_10, var_11 in var_15:\n if var_5 <= var_10 <= var_7 and var_6 <= var_11 <= var_8:\n var_9 += 1\n if var_2 <= var_9:\n var_4 = min(var_4, (var_7 - var_5) * (var_8 - var_6))\nprint(var_4)\n", "fast_code": "var_6, var_4 = list(map(int, input().split()))\nvar_11 = [list(map(int, input().split())) for _ in range(var_6)]\nvar_11.sort()\nvar_1 = 10**20\nfor var_2 in range(var_6):\n for var_3 in range(var_2 + 1, var_6):\n var_10 = var_11[var_3][0] - var_11[var_2][0]\n var_5 = sorted(var_7[1] for var_7 in var_11[var_2 : var_3 + 1])\n for var_8, var_9 in zip(var_5, var_5[var_4 - 1 :]):\n var_1 = min(var_1, var_10 * (var_9 - var_8))\nprint(var_1)\n", "slow_time": 140828526, "fast_time": 50545175, "speedup": 2.7862, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_29"} -{"pair_id": "python_7403", "problem_id": "p02912", "language": "python", "slow_code": "import math\nimport heapq\n\nvar_3, var_2 = list(map(int, input().split()))\nvar_1 = list([-int(var_4) for var_4 in input().split()])\nvar_1.sort()\nheapq.heapify(var_1)\nfor var_6 in range(var_2):\n var_4 = heapq.heappop(var_1)\n var_4 = -(-var_4 / 2.0)\n heapq.heappush(var_1, var_4)\nvar_5 = 0\nfor var_4 in var_1:\n var_5 += math.floor(-var_4)\nprint(var_5)\n", "fast_code": "def func_1(var_4, var_3, var_1):\n if var_4 == 1:\n return var_1[0] // (2**var_3)\n var_1.sort(key=lambda var_5: -var_5)\n var_2 = [var_1]\n for _ in range(var_3):\n var_7 = 0\n var_9 = var_2[0][0] if var_2[0] else -1\n for var_8 in range(1, len(var_2)):\n if var_2[var_8] and var_2[var_8][0] > var_9:\n var_7 = var_8\n var_9 = var_2[var_8][0]\n var_10 = var_2[var_7].pop(0) // 2\n if len(var_2) == var_7 + 1:\n var_2 += [[]]\n var_2[var_7 + 1] += [var_10]\n if not (var_2[0]):\n var_2.pop(0)\n return sum([sum(var_6) for var_6 in var_2])\n\n\nvar_4, var_3 = tuple([int(var_11) for var_11 in input().split(\" \")])\nvar_1 = [int(var_11) for var_11 in input().split()]\nprint((func_1(var_4, var_3, var_1)))\n", "slow_time": 301341291, "fast_time": 75792722, "speedup": 3.9759, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_12"} -{"pair_id": "python_5060", "problem_id": "p03292", "language": "python", "slow_code": "var_1, var_3, var_4 = list(map(int, input().split()))\nvar_2 = 9999\nvar_2 = min(\n var_2,\n abs(var_1 - var_3) + abs(var_3 - var_4),\n abs(var_1 - var_4) + abs(var_4 - var_3),\n)\nvar_2 = min(\n var_2,\n abs(var_3 - var_1) + abs(var_1 - var_4),\n abs(var_3 - var_4) + abs(var_4 - var_1),\n)\nvar_2 = min(\n var_2,\n abs(var_4 - var_1) + abs(var_1 - var_3),\n abs(var_4 - var_3) + abs(var_3 - var_1),\n)\nprint(var_2)\n", "fast_code": "var_1, _, var_2 = sorted(map(int, input().split()))\nprint((var_2 - var_1))\n", "slow_time": 33306774, "fast_time": 9736665, "speedup": 3.4208, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_14"} -{"pair_id": "python_11833", "problem_id": "p03579", "language": "python", "slow_code": "from networkx import *\n\nvar_7, *var_8 = list(map(str.split, open(0)))\nvar_7, var_6 = list(map(int, var_7))\nvar_5 = var_1()\nvar_5.add_edges_from(var_8)\ntry:\n var_2, var_3 = list(map(len, var_4.sets(var_5)))\n var_2 *= var_3\nexcept:\n var_2 = var_7 * ~-var_7 // 2\nprint((var_2 - var_6))\n", "fast_code": "from sys import stdin, stdout\n\n\ndef func_3():\n return list(map(int, stdin.readline().split()))\n\n\ndef func_1(var_7):\n \"\"\"\"\"\"\n var_5 = [-1] * var_10\n var_5[0] = 0\n var_11 = [(0, 0)]\n var_14 = set()\n while var_11:\n var_13, var_4 = var_11.pop()\n if var_13 in var_14:\n if var_5[var_13] != var_4:\n return -1\n continue\n var_14.add(var_13)\n var_5[var_13] = var_4\n for var_12 in var_7[var_13]:\n var_11.append((var_12, var_4 ^ 1))\n return sum(var_5)\n\n\nvar_10, var_8 = func_3()\nvar_6 = [set() for _ in range(var_10)]\n\n\ndef func_2():\n for _ in range(var_8):\n var_1, var_2 = func_3()\n var_1 -= 1\n var_2 -= 1\n var_6[var_1].add(var_2)\n var_6[var_2].add(var_1)\n var_3 = func_1(var_6)\n if var_3 == -1:\n \"\"\"\"\"\"\n var_9 = var_10 * (var_10 - 1) // 2\n else:\n \"\"\"\"\"\"\n var_9 = var_3 * (var_10 - var_3)\n print((var_9 - var_8))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "slow_time": 18150154613, "fast_time": 85864159, "speedup": 211.3822, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_15"} -{"pair_id": "python_14589", "problem_id": "p03183", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(2147483647)\nvar_2 = float(\"inf\")\nvar_3 = 10**9 + 7\nvar_8 = lambda: sys.stdin.readline().rstrip()\n\n\ndef func_2():\n from functools import cmp_to_key\n\n var_10 = int(eval(var_8()))\n var_1 = [list(map(int, var_8().split())) for _ in range(var_10)]\n\n def func_1(var_4, var_5):\n var_15 = min(var_4[1], var_5[1] - var_4[0])\n var_16 = min(var_5[1], var_4[1] - var_5[0])\n if var_15 == var_16:\n return 0\n return -1 if (var_15 > var_16) else 1\n\n var_1.sort(key=cmp_to_key(func_1))\n var_9 = 20000\n var_6 = [-var_2] * (var_9 + 1)\n var_6[0] = 0\n for var_7 in range(var_10):\n var_17, var_12, var_14 = var_1[var_7]\n var_11 = var_6[:]\n for var_13 in range(var_9 + 1):\n if var_13 <= var_12 and var_13 + var_12 <= var_9:\n var_11[var_13 + var_17] = max(\n var_11[var_13 + var_17], var_6[var_13] + var_14\n )\n var_6 = var_11[:]\n print((max(var_6)))\n\n\nfunc_2()\n", "fast_code": "import sys\n\nvar_5 = int(eval(input()))\nvar_1 = []\nfor var_4 in sys.stdin.readlines():\n var_8, var_6, var_7 = list(map(int, var_4.split()))\n var_1.append((var_8 + var_6, var_8, var_6, var_7))\nvar_1.sort()\nvar_2 = [-1] * 20001\nvar_2[0] = 0\nfor _, var_8, var_6, var_7 in var_1:\n for var_3 in range(var_6, -1, -1):\n if var_2[var_3] == -1:\n continue\n var_2[var_3 + var_8] = max(var_2[var_3 + var_8], var_2[var_3] + var_7)\nprint((max(var_2)))\n", "slow_time": 3166264104, "fast_time": 839094136, "speedup": 3.7734, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_7"} -{"pair_id": "python_8554", "problem_id": "p03722", "language": "python", "slow_code": "var_9, var_8 = list(map(int, input().split()))\nvar_1 = [list(map(int, input().split())) for var_6 in range(var_8)]\nfor var_6 in range(var_8):\n var_1[var_6][2] = -var_1[var_6][2]\nvar_3 = [float(\"inf\")] * (var_9 + 1)\nvar_3[1] = 0\nvar_2 = [[0] * 2 for var_6 in range(var_9 + 1)]\nvar_2[1][0] = 1\nvar_2[var_9][1] = 1\nfor var_6 in range(var_9):\n for var_7 in range(var_8):\n if var_2[var_1[var_7][0]][0] == 1:\n var_2[var_1[var_7][1]][0] = 1\n if var_2[var_1[var_7][1]][1] == 1:\n var_2[var_1[var_7][0]][1] = 1\n var_3[var_1[var_7][1]] = min(\n var_3[var_1[var_7][1]], var_3[var_1[var_7][0]] + var_1[var_7][2]\n )\nvar_4 = var_3[:]\nfor var_6 in range(var_9):\n for var_7 in range(var_8):\n if var_2[var_1[var_7][0]][0] == 1:\n var_2[var_1[var_7][1]][0] = 1\n if var_2[var_1[var_7][1]][1] == 1:\n var_2[var_1[var_7][0]][1] = 1\n var_3[var_1[var_7][1]] = min(\n var_3[var_1[var_7][1]], var_3[var_1[var_7][0]] + var_1[var_7][2]\n )\nvar_5 = var_3[:]\n\n\ndef func_1():\n for var_6 in range(var_9 + 1):\n if var_2[var_6] == [1, 1] and var_5[var_6] < var_4[var_6]:\n return \"inf\"\n return -var_4[var_9]\n\n\nprint((func_1()))\n", "fast_code": "var_3, var_1 = list(map(int, input().split()))\nvar_5 = []\nfor _ in range(var_1):\n var_5.append(list(map(int, input().split())))\nvar_9 = [-float(\"inf\")] * var_3\nvar_9[0] = 0\nfor var_10 in range(2):\n for var_4, var_7, var_8 in var_5:\n var_4, var_7 = var_4 - 1, var_7 - 1\n var_9[var_7] = max(var_9[var_7], var_9[var_4] + var_8)\n if var_10 == 0:\n var_6 = var_9[var_3 - 1]\n else:\n var_2 = var_9[var_3 - 1]\nif var_6 != var_2:\n print(\"inf\")\nelse:\n print(var_6)\n", "slow_time": 119813492, "fast_time": 45176202, "speedup": 2.6521, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_20"} -{"pair_id": "python_13801", "problem_id": "p02385", "language": "python", "slow_code": "class Class_1:\n def __init__(self):\n\n self.t = 1\n self.s = 2\n self.e = 3\n self.w = 4\n self.n = 5\n self.b = 6\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def __init__(self, var_17, var_13, var_6, var_20, var_10, var_1):\n\n self.t = var_17\n self.s = var_13\n self.e = var_6\n self.w = var_20\n self.n = var_10\n self.b = var_1\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def func_2(self, var_23):\n if var_23 == 0:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.n,\n self.t,\n self.e,\n self.w,\n self.b,\n self.s,\n )\n elif var_23 == 1:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.s,\n self.b,\n self.e,\n self.w,\n self.t,\n self.n,\n )\n elif var_23 == 2:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.w,\n self.s,\n self.t,\n self.b,\n self.n,\n self.e,\n )\n elif var_23 == 3:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.e,\n self.s,\n self.b,\n self.t,\n self.n,\n self.w,\n )\n\n\ndef func_1():\n import random\n\n var_18, var_14, var_7, var_21, var_11, var_2 = list(map(int, input().split()))\n var_19, var_15, var_8, var_22, var_12, var_3 = list(map(int, input().split()))\n var_4 = Class_1(var_18, var_14, var_7, var_21, var_11, var_2)\n var_5 = Class_1(var_19, var_15, var_8, var_22, var_12, var_3)\n var_9 = 0\n for _ in range(10000):\n if (var_4.t, var_4.s, var_4.e, var_4.w, var_4.n, var_4.b) == (\n var_5.t,\n var_5.s,\n var_5.e,\n var_5.w,\n var_5.n,\n var_5.b,\n ):\n var_9 = 1\n break\n else:\n var_16 = random.randint(0, 3)\n var_5.rot(var_16)\n if var_9 == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "import itertools\n\n\ndef func_1(var_6, var_5):\n for var_4 in var_5:\n if var_4 == \"N\":\n var_6[0], var_6[1], var_6[5], var_6[4] = (\n var_6[1],\n var_6[5],\n var_6[4],\n var_6[0],\n )\n elif var_4 == \"S\":\n var_6[0], var_6[1], var_6[5], var_6[4] = (\n var_6[4],\n var_6[0],\n var_6[1],\n var_6[5],\n )\n elif var_4 == \"W\":\n var_6[0], var_6[3], var_6[5], var_6[2] = (\n var_6[2],\n var_6[0],\n var_6[3],\n var_6[5],\n )\n elif var_4 == \"E\":\n var_6[0], var_6[3], var_6[5], var_6[2] = (\n var_6[3],\n var_6[5],\n var_6[2],\n var_6[0],\n )\n\n\nvar_1 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nfor var_7 in range(4):\n for var_8 in range(4):\n for var_5 in itertools.permutations(\"S\" * var_7 + \"W\" * var_8):\n var_3 = var_1[::]\n func_1(var_3, var_5)\n if var_2 == var_3:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "slow_time": 3599802039, "fast_time": 586452876, "speedup": 6.1383, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_14"} -{"pair_id": "python_6696", "problem_id": "p02817", "language": "python", "slow_code": "import sys\n\nvar_1, var_2 = input().split()\nif not (var_1.islower() and var_2.islower()):\n sys.exit()\nif not (1 <= len(var_1) <= 100 and 1 <= len(var_1) <= 100):\n sys.exit()\nprint(var_2, var_1, sep=\"\")\n", "fast_code": "var_1, var_2 = input().split()\nprint((var_2 + var_1))\n", "slow_time": 21383088, "fast_time": 6789657, "speedup": 3.1494, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_6"} -{"pair_id": "python_9234", "problem_id": "p02883", "language": "python", "slow_code": "import math\n\nvar_3, var_1 = list(map(int, input().split()))\nvar_4 = [\n (var_6, var_5 * var_6)\n for var_5, var_6 in zip(\n sorted(list(map(int, input().split()))),\n sorted(list(map(int, input().split())))[::-1],\n )\n]\nvar_8, var_2, var_7 = 0, 10**12, 1\nexec(\n \"i,M,m=((i+m)//2,i,m) if sum(math.ceil(max(0,c-i)/b)for b, c in X)<=K else((i+M)//2,M,i);\"\n * 50\n)\nprint(var_2)\n", "fast_code": "import sys\n\n\ndef func_11():\n return sys.stdin.readline().strip()\n\n\ndef func_12(var_7, var_8, var_9):\n return [[var_9] * var_8 for var_13 in range(var_7)]\n\n\ndef func_13(var_7, var_8, var_9, var_10):\n return [[[var_10] * var_9 for var_14 in range(var_8)] for var_13 in range(var_7)]\n\n\ndef func_14(var_7, var_8, var_9, var_10, var_11):\n return [\n [[[var_11] * var_10 for var_14 in range(var_9)] for var_14 in range(var_8)]\n for var_13 in range(var_7)\n ]\n\n\ndef func_9(var_22, var_23=1):\n return int(-(-var_22 // var_23))\n\n\ndef func_1():\n return int(eval(func_11()))\n\n\ndef func_3():\n return list(map(int, func_11().split()))\n\n\ndef func_2(var_6=None):\n return list(func_3()) if var_6 is None else [func_1() for var_13 in range(var_6)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**7)\nvar_3 = 10**18\nvar_5 = 10**9 + 7\n\n\ndef func_8(var_18, var_19, var_12):\n \"\"\"\"\"\"\n var_21 = var_19\n var_20 = var_18\n while var_20 + 1 < var_21:\n var_17 = (var_21 + var_20) // 2\n if var_12(var_17):\n\n var_21 = var_17\n else:\n\n var_20 = var_17\n return var_21\n\n\nvar_6, var_4 = func_3()\nvar_1 = func_2()\nvar_2 = func_2()\nvar_1.sort(reverse=True)\nvar_2.sort()\n\n\ndef func_10(var_16):\n var_15 = 0\n for var_13, var_7 in enumerate(var_1):\n var_8 = var_2[var_13]\n var_15 += max(func_9(var_7 - var_16 / var_8), 0)\n if var_15 > var_4:\n return False\n return True\n\n\nprint((func_8(-1, 10**12, func_10)))\n", "slow_time": 822717967, "fast_time": 188561044, "speedup": 4.3631, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_13"} -{"pair_id": "python_1783", "problem_id": "p03608", "language": "python", "slow_code": "import itertools\nfrom scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall\n\nvar_6, var_5, var_8 = list(map(int, input().split()))\nvar_14 = [int(var_13) for var_13 in input().split()]\nvar_4 = [[10**8] * (var_6 + 1) for _ in range(var_6 + 1)]\nfor _ in range(var_5):\n var_1, var_2, var_3 = list(map(int, input().split()))\n\n var_4[var_1][var_2] = var_3\n var_4[var_2][var_1] = var_3\n\n\nvar_12 = csgraph_from_dense(var_4, null_value=10**8)\nvar_11 = floyd_warshall(var_12)\nvar_9 = 10**12\nfor var_7 in itertools.permutations(var_14):\n var_10 = 0\n for var_13 in range(var_8 - 1):\n var_10 += var_11[var_7[var_13]][var_7[var_13 + 1]]\n var_9 = min(var_9, var_10)\nprint((int(var_9)))\n", "fast_code": "from heapq import heapify, heappop, heappush\nfrom itertools import permutations\n\n\ndef func_1(var_2: \"Array[Array[int]]\", var_14: int, var_15: int) -> list:\n var_10 = [float(\"inf\")] * var_14\n var_13 = [(0, var_15)]\n var_17 = var_14 - 1\n heapify(var_13)\n while var_13:\n var_8, var_18 = heappop(var_13)\n if var_8 > var_10[var_18]:\n continue\n var_10[var_18] = var_8\n for var_11, var_16 in var_2[var_18]:\n if var_8 + var_11 < var_10[var_16]:\n heappush(var_13, (var_8 + var_11, var_16))\n var_17 -= 1\n if not var_17:\n break\n return var_10\n\n\ndef func_2():\n global G, N\n var_4, var_3, var_5, *var_6 = list(map(int, open(0).read().split()))\n var_19, var_1 = var_6[:var_5], var_6[var_5:]\n var_2 = [[] for _ in range(var_4 + 1)]\n for var_18, var_16, var_8 in zip(*[iter(var_1)] * 3):\n var_2[var_18].append((var_8, var_16)), var_2[var_16].append((var_8, var_18))\n var_10 = {var_18: func_1(var_2, var_4 + 1, var_18) for var_18 in var_19}\n var_7 = float(\"inf\")\n for var_12 in permutations(var_19):\n var_9 = sum(\n var_10[var_18][var_16] for var_18, var_16 in zip(var_12, var_12[1:])\n )\n var_7 = min(var_7, var_9)\n print(var_7)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "slow_time": 16554399588, "fast_time": 79257828, "speedup": 208.8677, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_4"} -{"pair_id": "python_17727", "problem_id": "p03456", "language": "python", "slow_code": "var_5, var_6 = input().split()\nvar_2 = int(var_5 + var_6)\nvar_3 = []\nfor var_1 in range(1, 1000):\n var_3.append(var_1 * var_1)\nfor var_4 in var_3:\n if var_4 == var_2:\n print(\"Yes\")\n quit()\nprint(\"No\")\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nif str(int(str(var_1) + str(var_2)) ** 0.5).split(\".\")[1:][0] == \"0\":\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 98989051, "fast_time": 18554788, "speedup": 5.335, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_22"} -{"pair_id": "python_3067", "problem_id": "p02724", "language": "python", "slow_code": "var_2 = int(eval(input()))\nvar_1 = 0\nwhile var_2 >= 500:\n var_1 += 1000\n var_2 -= 500\nwhile var_2 >= 5:\n var_1 += 5\n var_2 -= 5\nprint(var_1)\n", "fast_code": "var_1 = int(eval(input()))\nprint(((var_1 // 500) * 1000 + (var_1 % 500) // 5 * 5))\n", "slow_time": 2924466792, "fast_time": 10495253, "speedup": 278.6466, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_13"} -{"pair_id": "python_14196", "problem_id": "p03296", "language": "python", "slow_code": "import sys\n\nvar_2 = float(\"inf\")\nvar_3 = 10**9 + 7\n\n\ndef func_3():\n return [int(var_7) for var_7 in sys.stdin.readline().split()]\n\n\ndef func_4():\n return [int(var_7) - 1 for var_7 in sys.stdin.readline().split()]\n\n\ndef func_2():\n return [float(var_7) for var_7 in sys.stdin.readline().split()]\n\n\ndef func_5():\n return sys.stdin.readline().split()\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_6():\n return eval(input())\n\n\ndef func_7():\n var_5 = func_1()\n var_1 = func_3()\n var_6 = 0\n for var_4 in range(1, var_5):\n if var_1[var_4] == var_1[var_4 - 1]:\n var_1[var_4] = 0\n var_6 += 1\n return var_6\n\n\nprint((func_7()))\n", "fast_code": "eval(input())\nvar_2 = 0\nvar_3 = 0\nvar_4 = 0\nfor var_1 in map(int, input().split()):\n if var_1 == var_3:\n var_2 += 1\n else:\n var_4 += var_2 // 2\n var_2 = 1\n var_3 = var_1\nprint((var_4 + var_2 // 2))\n", "slow_time": 65246975, "fast_time": 23246463, "speedup": 2.8067, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_4"} -{"pair_id": "python_14007", "problem_id": "p02283", "language": "python", "slow_code": "class Class_1:\n var_3 = 0\n var_4 = None\n var_6 = None\n\n def __init__(self, var_3):\n self.key = var_3\n\n\nvar_1 = [None] * 5000005\n\n\ndef func_2(var_10):\n if var_10 == 0:\n return\n var_9 = 0\n var_8 = 0\n while var_8 is not None:\n var_9 = var_8\n var_8 = (\n var_1[var_8].l if var_1[var_10].key < var_1[var_8].key else var_1[var_8].r\n )\n if var_1[var_10].key < var_1[var_9].key:\n var_1[var_9].l = var_10\n else:\n var_1[var_9].r = var_10\n\n\ndef func_1(var_8):\n if var_8 == None:\n return\n func_1(var_1[var_8].l)\n print(\"\", var_1[var_8].key, end=\"\")\n func_1(var_1[var_8].r)\n\n\ndef func_3(var_8):\n if var_8 == None:\n return\n print(\"\", var_1[var_8].key, end=\"\")\n func_3(var_1[var_8].l)\n func_3(var_1[var_8].r)\n\n\nvar_5 = int(input())\nfor var_2 in range(var_5):\n var_7 = input()\n if var_7 == \"print\":\n func_1(0)\n print()\n func_3(0)\n print()\n else:\n var_8 = int(var_7.split()[1])\n var_1[var_2] = Class_1(var_8)\n func_2(var_2)\n", "fast_code": "class Class_1:\n def __init__(self, var_2):\n self.key = var_2\n self.parent = None\n self.left = None\n self.right = None\n\n\nclass Class_2:\n def __init__(self):\n self.root = None\n\n def func_1(self, var_5):\n var_8 = None\n var_7 = self.root\n while var_7 is not None:\n var_8 = var_7\n if var_5.key <= var_7.key:\n var_7 = var_7.left\n else:\n var_7 = var_7.right\n if var_8 is None:\n self.root = var_5\n elif var_5.key < var_8.key:\n var_8.left = var_5\n else:\n var_8.right = var_5\n\n def func_2(self, var_5):\n if var_5 is None:\n return\n self.print_in_order(var_5.left)\n print(\" \" + str(var_5.key), end=\"\")\n self.print_in_order(var_5.right)\n\n def func_3(self, var_5):\n if var_5 is None:\n return\n print(\" \" + str(var_5.key), end=\"\")\n self.print_pre_order(var_5.left)\n self.print_pre_order(var_5.right)\n\n\nvar_6 = Class_2()\nvar_4 = int(input())\nfor var_1 in range(var_4):\n var_3 = input().split()\n if var_3[0] == \"print\":\n var_6.print_in_order(var_6.root)\n print(\"\")\n var_6.print_pre_order(var_6.root)\n print(\"\")\n else:\n var_2 = var_3[1]\n var_6.insert(Class_1(int(var_2)))\n", "slow_time": 267495056, "fast_time": 107324650, "speedup": 2.4924, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_12"} -{"pair_id": "python_10617", "problem_id": "p03018", "language": "python", "slow_code": "import sys\n\nvar_9 = sys.stdin\nvar_5 = lambda: int(var_7())\nvar_6 = lambda: list(map(int, var_9.readline().split()))\nvar_7 = lambda: var_9.readline().rstrip()\nvar_2 = list(var_7())\nvar_4 = \"D\"\nvar_3 = 0\nvar_1 = 0\nfor var_8 in var_2:\n if var_4 == \"A\":\n if var_8 == \"A\":\n var_1 += 1\n elif var_8 == \"B\":\n var_4 = var_8\n else:\n var_4 = \"D\"\n var_1 = 0\n elif var_4 == \"B\":\n if var_8 == \"A\":\n var_1 = 1\n var_4 = var_8\n elif var_8 == \"B\":\n var_1 = 0\n var_4 = \"D\"\n elif var_8 == \"C\":\n var_3 += var_1\n var_4 = var_8\n else:\n var_4 = \"D\"\n var_1 = 0\n elif var_4 == \"C\":\n if var_8 == \"A\":\n var_1 += 1\n var_4 = var_8\n elif var_8 == \"B\":\n var_4 = var_8\n else:\n var_4 = \"D\"\n var_1 = 0\n else:\n if var_8 == \"A\":\n var_1 += 1\n var_4 = var_8\n else:\n var_1 = 0\n var_4 = \"D\"\nprint(var_3)\n", "fast_code": "def func_1():\n var_1 = input().replace(\"BC\", \"1\")\n var_3 = 0\n var_2 = 0\n for var_4 in var_1:\n if var_4 == \"A\":\n var_2 += 1\n elif var_4 == \"1\":\n var_3 += var_2\n else:\n var_2 = 0\n print(var_3)\n\n\nfunc_1()\n", "slow_time": 67556438, "fast_time": 20560575, "speedup": 3.2857, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_1"} -{"pair_id": "python_13292", "problem_id": "p03035", "language": "python", "slow_code": "import sys, math, collections, heapq, itertools\n\nvar_3 = sys.stdin\n\n\ndef func_3():\n return var_3.readline().strip(\"\\n\")\n\n\ndef func_2():\n return var_3.readline().strip(\"\\n\").split()\n\n\ndef func_1(var_4, var_5):\n var_4, var_5 = max(var_4, var_5), min(var_4, var_5)\n while var_4 % var_5 > 0:\n var_4, var_5 = var_5, var_4 % var_5\n return var_5\n\n\ndef func_4():\n var_1, var_2 = list(map(int, func_2()))\n if var_1 >= 13:\n print(var_2)\n elif var_1 >= 6:\n print((var_2 // 2))\n else:\n print((0))\n return 0\n\n\nif __name__ == \"__main__\":\n func_4()\n", "fast_code": "import os, sys, re, math\n\nvar_1, var_2 = list(map(int, input().split(\" \")))\nif var_1 >= 13:\n print(var_2)\nelif var_1 >= 6:\n print((var_2 // 2))\nelse:\n print((0))\n", "slow_time": 48276073, "fast_time": 19662105, "speedup": 2.4553, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_9"} -{"pair_id": "python_17474", "problem_id": "p02834", "language": "python", "slow_code": "class Class_2:\n def __init__(self, var_18, var_7, var_12=1):\n self.n = var_18\n self.tree = [[] for _ in range(var_18)]\n for var_6 in var_7:\n self.tree[var_6[0] - var_12].append(var_6[1] - var_12)\n self.tree[var_6[1] - var_12].append(var_6[0] - var_12)\n\n def func_6(self, var_22):\n self.root = var_22\n self.parent = [None for _ in range(self.n)]\n self.parent[var_22] = -1\n self.depth = [None for _ in range(self.n)]\n self.depth[var_22] = 0\n self.order = []\n self.order.append(var_22)\n self.size = [1 for _ in range(self.n)]\n var_25 = [var_22]\n while var_25:\n var_19 = var_25.pop()\n for var_3 in self.tree[var_19]:\n if self.parent[var_3] is None:\n self.parent[var_3] = var_19\n self.depth[var_3] = self.depth[var_19] + 1\n self.order.append(var_3)\n var_25.append(var_3)\n for var_19 in self.order[::-1]:\n for var_3 in self.tree[var_19]:\n if self.parent[var_19] == var_3:\n continue\n self.size[var_19] += self.size[var_3]\n\n def func_1(self):\n self.order = [None for _ in range(self.n)]\n self.head = [None for _ in range(self.n)]\n self.head[self.root] = self.root\n self.next = [None for _ in range(self.n)]\n var_25 = [self.root]\n var_20 = 0\n while var_25:\n var_19 = var_25.pop()\n self.order[var_19] = var_20\n var_20 += 1\n var_17 = 0\n for var_3 in self.tree[var_19]:\n if self.parent[var_19] == var_3:\n continue\n if var_17 < self.size[var_3]:\n var_17 = self.size[var_3]\n self.next[var_19] = var_3\n for var_3 in self.tree[var_19]:\n if self.parent[var_19] == var_3 or self.next[var_19] == var_3:\n continue\n self.head[var_3] = var_3\n var_25.append(var_3)\n if self.next[var_19] is not None:\n self.head[self.next[var_19]] = self.head[var_19]\n var_25.append(self.next[var_19])\n\n def func_4(self, var_27, var_28, var_7=False):\n var_21 = []\n while True:\n if self.order[var_27] > self.order[var_28]:\n var_27, var_28 = var_28, var_27\n if self.head[var_27] != self.head[var_28]:\n var_21.append((self.order[self.head[var_28]], self.order[var_28] + 1))\n var_28 = self.parent[self.head[var_28]]\n else:\n var_21.append((self.order[var_27] + var_7, self.order[var_28] + 1))\n return var_21\n\n def func_7(self, var_27):\n return self.order[var_27], self.order[var_27] + self.size[var_27]\n\n def func_2(self, var_27, var_28):\n while True:\n if self.order[var_27] > self.order[var_28]:\n var_27, var_28 = var_28, var_27\n if self.head[var_27] != self.head[var_28]:\n var_28 = self.parent[self.head[var_28]]\n else:\n return var_27\n\n\nclass Class_1:\n def __init__(self, var_4, var_8=min, var_11=2**63):\n self.h = (len(var_4) - 1).bit_length()\n self.n = 2**self.h\n self.ie = var_11\n self.func = var_8\n self.tree = [var_11 for _ in range(2 * self.n)]\n for var_9 in range(len(var_4)):\n self.tree[self.n + var_9] = var_4[var_9]\n for var_9 in range(1, self.n)[::-1]:\n self.tree[var_9] = var_8(self.tree[2 * var_9], self.tree[2 * var_9 + 1])\n\n def func_5(self, var_10, var_31):\n var_10 += self.n\n self.tree[var_10] = var_31\n while var_10:\n var_10 >>= 1\n self.tree[var_10] = self.func(\n self.tree[2 * var_10], self.tree[2 * var_10 + 1]\n )\n\n def func_3(self, var_15, var_23):\n var_15 += self.n\n var_23 += self.n\n var_29 = var_30 = self.ie\n while var_23 - var_15 > 0:\n if var_15 & 1:\n var_29 = self.func(var_29, self.tree[var_15])\n var_15 += 1\n if var_23 & 1:\n var_23 -= 1\n var_30 = self.func(self.tree[var_23], var_30)\n var_15 >>= 1\n var_23 >>= 1\n return self.func(var_29, var_30)\n\n\nimport sys\n\nvar_13 = sys.stdin.readline\nvar_2, var_27, var_28 = list(map(int, var_13().split()))\nvar_27 -= 1\nvar_28 -= 1\nvar_1 = [tuple(map(int, var_13().split())) for _ in range(var_2 - 1)]\nvar_26 = Class_2(var_2, var_1)\nvar_26.setroot(var_28)\nvar_26.heavylight_decomposition()\nvar_5 = var_26.depth[var_27]\nvar_14 = (var_5 + 1) // 2 - 1\nfor _ in range(var_14):\n var_27 = var_26.parent[var_27]\nvar_4 = [None for _ in range(var_2)]\nfor var_9 in range(var_2):\n var_4[var_26.order[var_9]] = var_26.depth[var_9]\nvar_24 = Class_1(var_4, max, -1)\nvar_15, var_23 = var_26.subtree_hld(var_27)\nvar_16 = var_24.query(var_15, var_23)\nprint((var_16 - 1))\n", "fast_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(1000000)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nvar_10 = 10**9 + 7\nvar_9 = float(\"inf\")\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\nvar_11, var_2, var_1 = func_2()\nvar_2 -= 1\nvar_1 -= 1\nvar_8 = [[] for _ in range(var_11)]\nfor _ in range(var_11 - 1):\n var_3, var_5 = func_2()\n var_8[var_3 - 1].append(var_5 - 1)\n var_8[var_5 - 1].append(var_3 - 1)\nif var_11 == 2:\n print((0))\nelse:\n var_7 = [None] * var_11\n var_7[var_2] = 0\n var_12 = deque()\n var_12.append(var_2)\n while var_12:\n var_14 = var_12.popleft()\n for var_13 in var_8[var_14]:\n if var_7[var_13] == None:\n var_7[var_13] = var_7[var_14] + 1\n var_12.append(var_13)\n var_6 = [None] * var_11\n var_6[var_1] = 0\n var_12 = deque()\n var_12.append(var_1)\n while var_12:\n var_13 = var_12.popleft()\n for var_14 in var_8[var_13]:\n if var_6[var_14] == None:\n var_6[var_14] = var_6[var_13] + 1\n var_12.append(var_14)\n var_4 = 0\n for var_14 in range(var_11):\n if var_7[var_14] < var_6[var_14]:\n var_4 = max(var_4, var_6[var_14] - 1)\n print(var_4)\n", "slow_time": 196965124, "fast_time": 61640718, "speedup": 3.1954, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_11"} -{"pair_id": "python_5464", "problem_id": "p03288", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**9)\nvar_1 = 10**18\nvar_2 = 10**9 + 7\nvar_7 = lambda: sys.stdin.readline().rstrip()\nvar_5 = lambda var_6: bool([print(\"Yes\")] if var_6 else print(\"No\"))\nvar_4 = lambda var_6: bool([print(\"YES\")] if var_6 else print(\"NO\"))\nvar_8 = lambda var_9: int(var_9) - 1\nvar_3 = int(var_7())\nif var_3 >= 2800:\n print(\"AGC\")\nelif var_3 >= 1200:\n print(\"ARC\")\nelse:\n print(\"ABC\")\n", "fast_code": "import sys\n\nvar_2 = lambda: int(sys.stdin.readline())\nvar_1 = var_2()\nif var_1 < 1200:\n print(\"ABC\")\nelif var_1 < 2800:\n print(\"ARC\")\nelse:\n print(\"AGC\")\n", "slow_time": 41475856, "fast_time": 17084681, "speedup": 2.4277, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_15"} -{"pair_id": "python_16328", "problem_id": "p03309", "language": "python", "slow_code": "import sys\n\n\ndef func_10():\n return sys.stdin.readline().strip()\n\n\ndef func_11(var_5, var_6, var_7):\n return [[var_7] * var_6 for var_11 in range(var_5)]\n\n\ndef func_12(var_5, var_6, var_7, var_8):\n return [[[var_8] * var_7 for var_12 in range(var_6)] for var_11 in range(var_5)]\n\n\ndef func_13(var_5, var_6, var_7, var_8, var_9):\n return [\n [[[var_9] * var_8 for var_12 in range(var_7)] for var_12 in range(var_6)]\n for var_11 in range(var_5)\n ]\n\n\ndef func_8(var_20, var_21=1):\n return int(-(-var_20 // var_21))\n\n\ndef func_1():\n return int(eval(func_10()))\n\n\ndef func_3():\n return list(map(int, func_10().split()))\n\n\ndef func_2(var_4=None):\n return list(func_3()) if var_4 is None else [func_1() for var_11 in range(var_4)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_2 = 10**18\nvar_3 = 10**9 + 7\nvar_4 = func_1()\nvar_1 = func_2()\n\n\ndef func_9(var_14):\n var_19 = 0\n for var_11, var_5 in enumerate(var_1):\n var_19 += abs(var_5 - (var_14 + var_11 + 1))\n return var_19\n\n\nvar_13 = -(10**9)\nvar_10 = 10**9\nwhile var_13 + 2 < var_10:\n var_15 = (var_13 * 2 + var_10) // 3\n var_16 = (var_13 + var_10 * 2) // 3\n var_17 = func_9(var_15)\n var_18 = func_9(var_16)\n\n if var_17 <= var_18:\n var_10 = var_16\n else:\n var_13 = var_15\nprint((min(func_9(var_15), func_9(var_16))))\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_6 = []\nfor var_4 in range(var_2):\n var_6.append(var_1[var_4] - (var_4 + 1))\nvar_6.sort()\nvar_5 = var_6[int(var_2 / 2)]\nvar_3 = 0\nfor var_4 in range(var_2):\n var_3 += abs(var_6[var_4] - var_5)\nprint(var_3)\n", "slow_time": 198949924, "fast_time": 31926142, "speedup": 6.2316, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_1"} -{"pair_id": "python_11820", "problem_id": "p03579", "language": "python", "slow_code": "from networkx import *\n\nvar_7, *var_8 = list(map(str.split, open(0)))\nvar_7, var_6 = list(map(int, var_7))\nvar_5 = var_1()\nvar_5.add_edges_from(var_8)\ntry:\n var_2, var_3 = list(map(len, var_4.sets(var_5)))\n var_2 *= var_3\nexcept:\n var_2 = var_7 * ~-var_7 // 2\nprint((var_2 - var_6))\n", "fast_code": "import sys\n\nsys.setrecursionlimit(2147483647)\nvar_2 = float(\"inf\")\nvar_3 = 10**9 + 7\nvar_8 = lambda: sys.stdin.readline().rstrip()\n\n\ndef func_1():\n var_10, var_9 = list(map(int, var_8().split()))\n var_1 = [[] for _ in range(var_10)]\n for var_7 in range(var_9):\n var_13, var_14 = list(map(int, var_8().split()))\n var_13 -= 1\n var_14 -= 1\n var_1[var_13].append(var_14)\n var_1[var_14].append(var_13)\n\n var_5 = [-1] * var_10\n var_5[0] = 0\n var_4 = [0]\n while var_4:\n var_14 = var_4.pop()\n for var_11 in var_1[var_14]:\n if var_5[var_14] == var_5[var_11]:\n print((var_10 * (var_10 - 1) // 2 - var_9))\n return\n elif var_5[var_11] != -1 and var_5[var_11] ^ var_5[var_14]:\n continue\n var_5[var_11] = 1 - var_5[var_14]\n var_4.append(var_11)\n\n var_6 = var_5.count(0)\n var_12 = var_5.count(1)\n print((var_6 * var_12 - var_9))\n\n\nfunc_1()\n", "slow_time": 18150154613, "fast_time": 75997011, "speedup": 238.8272, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_18"} -{"pair_id": "python_13237", "problem_id": "p02699", "language": "python", "slow_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nvar_2 = 10**9 + 7\nvar_1 = float(\"inf\")\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\nvar_3, var_4 = func_2()\nif var_4 >= var_3:\n print(\"unsafe\")\nelse:\n print(\"safe\")\n", "fast_code": "var_1, var_2 = input().split()\nif int(var_2) >= int(var_1):\n print(\"unsafe\")\nelse:\n print(\"safe\")\n", "slow_time": 41795967, "fast_time": 11428375, "speedup": 3.6572, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_20"} -{"pair_id": "python_13150", "problem_id": "p03698", "language": "python", "slow_code": "import sys\n\nvar_17 = sys.stdin\nvar_2 = 1 << 60\nvar_3 = 1000000007\nvar_12 = lambda: int(var_14())\nvar_13 = lambda var_18: [var_12() for _ in range(var_18)]\nvar_4 = lambda: list(map(int, var_17.readline().split()))\nvar_5 = lambda var_18: [var_4() for _ in range(var_18)]\nvar_8 = lambda: float(var_14())\nvar_11 = lambda var_18: [var_8() for _ in range(var_18)]\nvar_9 = lambda: list(map(float, var_17.readline().split()))\nvar_10 = lambda var_18: [var_9() for _ in range(var_18)]\nvar_14 = lambda: var_17.readline().rstrip()\nvar_15 = lambda var_18: [var_14() for _ in range(var_18)]\nvar_7 = lambda var_18: [list(var_14()) for _ in range(var_18)]\nvar_6 = lambda: var_17.readline().split()\nfrom collections import Counter\n\nvar_16 = var_14()\nvar_1 = Counter(var_16)\nprint((\"yes\" if len(var_16) == len(var_1) else \"no\"))\n", "fast_code": "var_1 = list(input())\nvar_2 = set(var_1)\nprint(\"yes\") if (len(var_1) == len(var_2)) else print(\"no\")\n", "slow_time": 100001071, "fast_time": 12604997, "speedup": 7.9334, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_2"} -{"pair_id": "python_6659", "problem_id": "p04014", "language": "python", "slow_code": "from collections import defaultdict, Counter\nfrom itertools import product, groupby, count, permutations, combinations\nfrom math import pi, sqrt, floor\nfrom collections import deque\nfrom bisect import bisect, bisect_left, bisect_right\nfrom string import ascii_lowercase\nfrom functools import lru_cache\nimport sys\n\nsys.setrecursionlimit(10000)\nvar_2 = float(\"inf\")\nvar_8, var_9, var_24, var_4, var_5, var_20 = \"YES\", \"Yes\", \"yes\", \"NO\", \"No\", \"no\"\nvar_16, var_14 = [0, 1, 0, -1], [1, 0, -1, 0]\nvar_17, var_15 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]\n\n\ndef func_3(var_23, var_22, var_1, var_7):\n return 0 <= var_23 < var_1 and 0 <= var_22 < var_7\n\n\ndef func_1(var_10, var_12):\n return (var_10 + var_12 - 1) // var_12\n\n\ndef func_2(var_12, var_19):\n if var_19 < var_12:\n return var_19\n return func_2(var_12, var_19 // var_12) + var_19 % var_12\n\n\ndef func_4():\n var_3 = int(eval(input()))\n var_6 = int(eval(input()))\n if var_3 == var_6:\n print((var_3 + 1))\n return\n if var_3 < var_6:\n print((-1))\n return\n var_11 = var_2\n for var_12 in range(2, int(sqrt(var_3)) + 1):\n if func_2(var_12, var_3) == var_6:\n var_11 = min(var_11, var_12)\n var_13 = set()\n var_21 = var_3 - var_6\n for var_18 in range(1, int(sqrt(var_3)) + 1):\n if var_21 % var_18 == 0:\n var_13.add(var_18 + 1)\n var_13.add((var_21 // var_18) + 1)\n for var_12 in var_13:\n if var_12 == 1:\n continue\n if func_2(var_12, var_3) == var_6:\n var_11 = min(var_11, var_12)\n if var_11 == var_2:\n print((-1))\n else:\n print(var_11)\n\n\nif __name__ == \"__main__\":\n func_4()\n", "fast_code": "def func_7(var_1):\n var_9 = 2\n var_18 = {}\n var_13 = var_1\n var_12 = 0\n while var_9**2 <= var_13:\n var_11 = 0\n while var_13 % var_9 == 0:\n var_13 //= var_9\n var_11 += 1\n var_18[var_9] = var_11\n var_9 += 1\n if var_9 == 101 and var_13 >= (2**20):\n\n def func_4(var_1):\n def func_5(var_5, var_6):\n while var_6:\n var_5, var_6 = var_6, var_5 % var_6\n return abs(var_5)\n\n def func_3(var_22, var_7):\n return ((var_22**2) + var_7) % var_1\n\n var_20 = [var_1]\n for var_7 in range(1, 99):\n var_22, var_23, var_8 = 2, 2, 1\n while var_8 == 1:\n var_22 = func_3(var_22, var_7)\n var_23 = func_3(func_3(var_23, var_7), var_7)\n var_8 = func_5(abs(var_22 - var_23), var_1)\n if var_8 != var_1:\n if func_6(var_8):\n return var_8\n elif func_6(var_1 // var_8):\n return var_1 // var_8\n else:\n var_20.append(var_8)\n\n while True:\n if func_6(var_13):\n var_18[var_13], var_13 = 1, 1\n break\n else:\n var_12 = 1\n var_10 = func_4(var_13)\n var_11 = 0\n while var_13 % var_10 == 0:\n var_13 //= var_10\n var_11 += 1\n var_18[var_10] = var_11\n if var_13 == 1:\n break\n if var_13 > 1:\n var_18[var_13] = 1\n if var_12 > 0:\n\n def func_1(var_3):\n var_4 = {}\n for var_22 in sorted(var_3.keys()):\n var_4[var_22] = var_3[var_22]\n return var_4\n\n var_18 = func_1(var_18)\n return var_18\n\n\ndef func_6(var_13):\n if var_13 == 2:\n return True\n if var_13 == 1 or var_13 & 1 == 0:\n return False\n var_8 = (var_13 - 1) >> 1\n while var_8 & 1 == 0:\n var_8 >>= 1\n for var_5 in [2, 3, 5, 7, 11, 13, 17, 19, 23]:\n var_21 = var_8\n var_23 = pow(var_5, var_21, var_13)\n while var_21 != var_13 - 1 and var_23 != 1 and var_23 != var_13 - 1:\n var_23 = (var_23 * var_23) % var_13\n var_21 <<= 1\n if var_23 != var_13 - 1 and var_21 & 1 == 0:\n return False\n return True\n\n\ndef func_2(var_1):\n var_15 = func_7(var_1)\n var_18 = [1]\n for var_14 in var_15:\n var_19 = var_18\n var_18 = []\n for var_9 in range(var_15[var_14] + 1):\n for var_16 in var_19:\n var_18.append(var_16 * (var_14**var_9))\n return sorted(var_18)\n\n\ndef func_3(var_6, var_13):\n var_17 = 0\n while var_13:\n var_17 += var_13 % var_6\n var_13 //= var_6\n return var_17\n\n\nvar_1 = int(eval(input()))\nvar_2 = int(eval(input()))\nif var_1 < var_2:\n print((-1))\nelif var_1 == var_2:\n print((var_1 + 1))\nelse:\n for var_6 in func_2(var_1 - var_2):\n var_6 += 1\n if func_3(var_6, var_1) == var_2:\n print(var_6)\n break\n else:\n print((-1))\n", "slow_time": 1525806412, "fast_time": 157911457, "speedup": 9.6624, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_5"} -{"pair_id": "python_14651", "problem_id": "p03649", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\n\n\ndef func_1(var_2):\n var_8 = 0\n for var_9 in var_1:\n if var_9 + var_2 - var_4 >= 0:\n var_8 += (var_9 + var_2 - var_4) // (var_4 + 1) + 1\n\n return int(var_8 <= var_2)\n\n\nvar_6 = 0\nvar_7 = 10**30\nwhile var_7 - var_6 > 1:\n var_3 = (var_6 + var_7) // 2\n if func_1(var_3) > 0:\n var_7 = var_3\n else:\n var_6 = var_3\nfor var_5 in range(10**5, -1, -1):\n if func_1(var_7 - var_5):\n print((var_7 - var_5))\n break\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_4 = 0\nwhile any([var_3 > var_2 - 1 for var_3 in var_1]):\n var_1.sort()\n var_5 = var_1[-1] - (var_2 - 1)\n var_7 = -(-var_5 // var_2)\n var_4 += var_7\n var_1[-1] -= var_7 * var_2\n for var_6 in range(var_2 - 1):\n var_1[var_6] += var_7\nprint(var_4)\n", "slow_time": 100454038038, "fast_time": 876176704, "speedup": 114.6504, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_0"} -{"pair_id": "python_177", "problem_id": "p03805", "language": "python", "slow_code": "import itertools\n\nvar_10, var_9 = list(map(int, input().split()))\nvar_8 = [[0] * var_10 for var_6 in range(var_10)]\nfor var_6 in range(var_9):\n var_1, var_3 = list(map(int, input().split()))\n var_8[var_1 - 1][var_3 - 1] = 1\n var_8[var_3 - 1][var_1 - 1] = 1\nvar_5 = [int(var_6) + 1 for var_6 in range(var_10)]\nvar_2 = var_4 = 0\nfor var_6 in list(itertools.permutations(var_5, var_10)):\n var_4 = 1\n if var_6[0] != 1:\n continue\n for var_7 in range(var_10 - 1):\n var_4 *= var_8[var_6[var_7 + 1] - 1][var_6[var_7] - 1]\n var_2 += var_4\nprint(var_2)\n", "fast_code": "from collections import defaultdict\nimport itertools\n\nvar_8, var_7 = list(map(int, input().split()))\nvar_3 = defaultdict(lambda: [])\nfor var_6 in range(var_7):\n var_1, var_2 = list(map(int, input().split()))\n var_3[var_1].append(var_2)\n var_3[var_2].append(var_1)\nvar_4 = 0\nfor var_10 in list(itertools.permutations(list(range(2, var_8 + 1)))):\n var_5 = True\n var_11 = 1\n for var_9 in var_10:\n if var_9 not in var_3[var_11]:\n var_5 = False\n break\n var_11 = var_9\n if var_5:\n var_4 += 1\nprint(var_4)\n", "slow_time": 6143449708, "fast_time": 782777284, "speedup": 7.8483, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_27"} -{"pair_id": "python_6922", "problem_id": "p03713", "language": "python", "slow_code": "var_8, var_10 = list(map(int, input().split()))\n\n\ndef func_1(var_1, var_5):\n var_11 = var_1 * var_5\n for var_2 in range(1, var_1):\n var_3 = (var_1 - var_2) // 2\n var_4 = var_1 - var_2 - var_3\n var_9 = [var_2 * var_5, var_3 * var_5, var_4 * var_5]\n var_11 = min(var_11, max(var_9) - min(var_9))\n for var_2 in range(1, var_1):\n var_6 = var_5 // 2\n var_7 = var_5 - var_6\n var_9 = [var_2 * var_5, (var_1 - var_2) * var_6, (var_1 - var_2) * var_7]\n var_11 = min(var_11, max(var_9) - min(var_9))\n return var_11\n\n\nprint((min(func_1(var_8, var_10), func_1(var_10, var_8))))\n", "fast_code": "import sys\n\n\ndef func_9():\n return sys.stdin.readline().strip()\n\n\ndef func_10(var_5, var_12, var_14):\n return [[var_14] * var_12 for var_16 in range(var_5)]\n\n\ndef func_11(var_5, var_12, var_14, var_15):\n return [[[var_15] * var_14 for var_17 in range(var_12)] for var_16 in range(var_5)]\n\n\ndef func_8(var_18, var_19=1):\n return int(-(-var_18 // var_19))\n\n\ndef func_1():\n return int(eval(func_9()))\n\n\ndef func_3():\n return list(map(int, func_9().split()))\n\n\ndef func_2():\n return list(map(int, func_9().split()))\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_2 = float(\"inf\")\nvar_3 = 10**9 + 7\nvar_1, var_4 = func_3()\nif var_1 % 3 == 0 or var_4 % 3 == 0:\n print((0))\n exit()\nvar_1, var_4 = max(var_1, var_4), min(var_1, var_4)\nvar_5 = var_1 // 3\nvar_13 = var_1 - var_5\nvar_6 = max(\n abs(var_13 * func_8(var_4, 2) - var_5 * var_4),\n abs(var_13 * (var_4 // 2) - var_5 * var_4),\n)\nvar_5 = func_8(var_1, 3)\nvar_13 = var_1 - var_5\nvar_7 = max(\n abs(var_13 * func_8(var_4, 2) - var_5 * var_4),\n abs(var_13 * (var_4 // 2) - var_5 * var_4),\n)\nvar_1, var_4 = min(var_1, var_4), max(var_1, var_4)\nvar_5 = var_1 // 3\nvar_13 = var_1 - var_5\nvar_8 = max(\n abs(var_13 * func_8(var_4, 2) - var_5 * var_4),\n abs(var_13 * (var_4 // 2) - var_5 * var_4),\n)\nvar_5 = func_8(var_1, 3)\nvar_13 = var_1 - var_5\nvar_9 = max(\n abs(var_13 * func_8(var_4, 2) - var_5 * var_4),\n abs(var_13 * (var_4 // 2) - var_5 * var_4),\n)\nvar_10 = abs(func_8(var_4, 3) * var_1 - var_4 // 3 * var_1)\nvar_11 = abs(func_8(var_1, 3) * var_4 - var_1 // 3 * var_4)\nprint((min(var_6, var_7, var_8, var_9, var_10, var_11)))\n", "slow_time": 55978952970, "fast_time": 134841246, "speedup": 415.1471, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_21"} -{"pair_id": "python_2968", "problem_id": "p03146", "language": "python", "slow_code": "var_5 = int(eval(input()))\nvar_1 = [var_5]\nvar_3 = 0\nwhile True:\n if var_1[var_3] % 2 == 0:\n var_1.append(int(var_1[var_3] / 2))\n var_3 += 1\n else:\n var_1.append(int(3 * var_1[var_3] + 1))\n var_3 += 1\n if [var_4 for var_4 in set(var_1) if var_1.count(var_4) > 1]:\n var_2 = sorted(\n [var_4 for var_4 in set(var_1) if var_1.count(var_4) > 1], key=var_1.index\n )\n break\nvar_1[var_1.index(var_2[0])] = 0\nprint((var_1.index((var_2[0])) + 1))\n", "fast_code": "var_5 = int(eval(input()))\nvar_1 = [var_5]\nvar_3 = 0\nvar_2 = -1\nwhile var_2 == -1:\n if var_1[var_3] % 2 == 0:\n var_1.append(var_1[var_3] // 2)\n else:\n var_1.append(3 * var_1[var_3] + 1)\n var_3 += 1\n for var_4 in range(len(var_1) - 1):\n if var_1[var_3] == var_1[var_4]:\n var_2 = var_3\n break\nprint((var_2 + 1))\n", "slow_time": 983405746, "fast_time": 142367227, "speedup": 6.9075, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_4"} -{"pair_id": "python_9326", "problem_id": "p02792", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_6 = len(str(var_1))\nvar_3 = 0\nfor var_2 in range(1, 10):\n for var_4 in range(1, 10):\n var_8, var_9 = 0, 0\n if var_2 == var_4:\n if var_2 <= var_1:\n var_8 += 1\n var_9 += 1\n if var_2 * 10 + var_4 <= var_1:\n var_8 += 1\n if var_4 * 10 + var_2 <= var_1:\n var_9 += 1\n if var_6 <= 2:\n var_3 += var_8 * var_9\n continue\n var_5 = 3\n while var_5 < var_6:\n var_8 += 10 ** (var_5 - 2)\n var_9 += 10 ** (var_5 - 2)\n var_5 += 1\n for var_7 in range(10 ** (var_6 - 2)):\n if int(str(var_2) + str(var_7).zfill(var_6 - 2) + str(var_4)) <= var_1:\n var_8 += 1\n if int(str(var_4) + str(var_7).zfill(var_6 - 2) + str(var_2)) <= var_1:\n var_9 += 1\n var_3 += var_8 * var_9\nprint(var_3)\n", "fast_code": "var_5 = int(eval(input()))\nvar_2 = [[0] * 10 for var_3 in range(10)]\nfor var_3 in range(1, var_5 + 1):\n var_6 = str(var_3)\n var_2[int(var_6[0])][int(var_6[-1])] += 1\nvar_1 = 0\nfor var_3 in range(10):\n for var_4 in range(10):\n var_1 += var_2[var_3][var_4] * var_2[var_4][var_3]\nprint(var_1)\n", "slow_time": 777891931, "fast_time": 138635891, "speedup": 5.611, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_5"} -{"pair_id": "python_14953", "problem_id": "p03212", "language": "python", "slow_code": "from itertools import product\n\nvar_8 = int(eval(input()))\nvar_1 = 0\nvar_4 = [3, 5, 7]\nfor var_3 in range(3, 10):\n var_6 = list(product(var_4, repeat=var_3))\n for var_5 in var_6:\n var_9 = \"\"\n for var_7 in var_5:\n var_9 += str(var_7)\n if \"3\" not in var_9:\n continue\n if \"5\" not in var_9:\n continue\n if \"7\" not in var_9:\n continue\n var_2 = int(var_9)\n if var_2 <= var_8:\n var_1 += 1\nprint(var_1)\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**9)\nvar_3 = sys.stdin.readline\nvar_1 = int(eval(var_3()))\nvar_2 = 0\n\n\ndef func_1(var_8: str) -> bool:\n return \"3\" in var_8 and \"5\" in var_8 and \"7\" in var_8\n\n\ndef func_2(var_8: str) -> int:\n var_7 = 0\n if int(var_8) > var_1:\n return 0\n else:\n if func_1(var_8):\n var_7 += 1\n var_4 = func_2(var_8 + \"3\")\n var_5 = func_2(var_8 + \"5\")\n var_6 = func_2(var_8 + \"7\")\n var_7 += var_4 + var_5 + var_6\n return var_7\n\n\nprint((func_2(\"0\")))\n", "slow_time": 31806904162, "fast_time": 1568533929, "speedup": 20.2781, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_14"} -{"pair_id": "python_15557", "problem_id": "p02712", "language": "python", "slow_code": "var_1 = int(eval(input()))\nprint((sum(var_2 for var_2 in range(1 + var_1) if var_2 % 3 != 0 and var_2 % 5 != 0)))\n", "fast_code": "def func_1(var_1):\n return var_1 * (var_1 + 1) // 2\n\n\nvar_1 = int(eval(input()))\nprint(\n (\n func_1(var_1)\n - func_1(var_1 // 3) * 3\n - func_1(var_1 // 5) * 5\n + func_1(var_1 // 15) * 15\n )\n)\n", "slow_time": 15158330495, "fast_time": 19614333, "speedup": 772.8191, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_4"} -{"pair_id": "python_18465", "problem_id": "p02676", "language": "python", "slow_code": "def func_4():\n return int(input())\n\n\ndef func_5():\n return map(int, input().split())\n\n\ndef func_1():\n return list(func_5())\n\n\ndef func_3(var_3):\n return [func_4() for var_1 in range(var_3)]\n\n\ndef func_2(var_3):\n return [func_1() for var_1 in range(var_3)]\n\n\ndef func_6(var_5):\n print(\"Yes\") if var_5 == True else print(\"No\")\n\n\nvar_2 = func_4()\nvar_4 = input()\nif len(var_4) <= var_2:\n print(var_4)\nelse:\n print(var_4[:var_2] + \"...\")\n", "fast_code": "var_1 = int(input())\nvar_2 = input()\nfor var_3, var_4 in enumerate(var_2):\n if var_3 == var_1:\n print(\"...\")\n break\n print(var_4, end=\"\")\nprint(\"\")\n", "slow_time": 49635108, "fast_time": 22267755, "speedup": 2.229, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_28"} -{"pair_id": "python_5048", "problem_id": "p03606", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_7 = [0] * 10**6\nfor var_1 in range(var_4):\n var_3, var_5 = list(map(int, input().split()))\n for var_2 in range(var_3, var_5 + 1):\n var_7[var_2 - 1] = 1\nvar_6 = 0\nfor var_1 in range(10**6):\n if var_7[var_1] == 1:\n var_6 += 1\nprint(var_6)\n", "fast_code": "var_4 = int(eval(input()))\n\nvar_7 = [0] * 10**5\nfor var_1 in range(var_4):\n var_3, var_5 = list(map(int, input().split()))\n for var_2 in range(var_3, var_5 + 1):\n var_7[var_2 - 1] = 1\nvar_6 = 0\n\nfor var_1 in range(10**5):\n if var_7[var_1] == 1:\n var_6 += 1\nprint(var_6)\n", "slow_time": 40113578180, "fast_time": 4037627509, "speedup": 9.9349, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_4"} -{"pair_id": "python_13311", "problem_id": "p03860", "language": "python", "slow_code": "var_3 = input().split()\nvar_1 = []\n\n\ndef func_1():\n print(\"111\")\n print(\"222\")\n print(\"333\")\n print(\"ii\")\n\n\nfor var_2 in var_3:\n var_1.append(var_2[0])\nprint((\"\".join(var_1)))\n", "fast_code": "print((\"A%sC\" % input()[8]))\n", "slow_time": 21301645, "fast_time": 5431287, "speedup": 3.922, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_0"} -{"pair_id": "python_18432", "problem_id": "p03001", "language": "python", "slow_code": "import sys\n\n\ndef func_1():\n return sys.stdin.readline().strip()\n\n\ndef func_2():\n return int(eval(func_1()))\n\n\ndef func_3():\n return [int(var_4) for var_4 in func_1().split()]\n\n\ndef func_4():\n var_5, var_3, var_6, var_7 = func_3()\n var_1 = (var_5 * var_3) / 2\n var_2 = var_5 == 2 * var_6 and var_3 == 2 * var_7\n print((var_1, 1 if var_2 else 0))\n return\n\n\nif __name__ == \"__main__\":\n func_4()\n", "fast_code": "var_2, var_1, var_3, var_4 = list(map(int, input().split()))\nif var_2 / 2 == var_3 and var_1 / 2 == var_4:\n var_5 = 1\nelse:\n var_5 = 0\nprint((var_2 * var_1 / 2, var_5))\n", "slow_time": 40034162, "fast_time": 16332926, "speedup": 2.4511, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_13"} -{"pair_id": "python_3425", "problem_id": "p02556", "language": "python", "slow_code": "var_6 = __import__(\"sys\").stdin.readline\n\n\ndef func_3(var_1, var_3):\n return abs(var_1[0] - var_3[0]) + abs(var_1[1] - var_3[1])\n\n\nvar_7 = int(eval(var_6()))\nvar_8 = []\nfor _ in range(var_7):\n var_8.append([*list(map(int, var_6().split()))])\nvar_2 = 0\nvar_9 = sorted(var_8)\nvar_10 = sorted(var_8, key=lambda var_11: var_11[1])\nvar_2 = max(var_2, func_3(var_9[-1], var_9[-2]))\nvar_2 = max(var_2, func_3(var_9[0], var_9[1]))\nvar_2 = max(var_2, func_3(var_10[-1], var_10[-2]))\nvar_2 = max(var_2, func_3(var_10[0], var_10[1]))\n\n\ndef func_1(var_11):\n return var_11[0] + var_11[1]\n\n\ndef func_2(var_11):\n return var_11[0] - var_11[1]\n\n\nvar_4 = sorted(var_8, key=func_1)\nvar_5 = sorted(var_8, key=func_2)\nvar_2 = max(var_2, func_3(var_4[0], var_4[-1]))\nvar_2 = max(var_2, func_3(var_4[0], var_4[1]))\nvar_2 = max(var_2, func_3(var_4[-1], var_4[-2]))\nvar_2 = max(var_2, func_3(var_5[0], var_5[-1]))\nvar_2 = max(var_2, func_3(var_5[0], var_5[1]))\nvar_2 = max(var_2, func_3(var_5[-1], var_5[-2]))\n\n\ndef func_1(var_11):\n return abs(var_11[0] + var_11[1])\n\n\ndef func_2(var_11):\n return abs(var_11[0] - var_11[1])\n\n\nvar_4 = sorted(var_8, key=func_1)\nvar_5 = sorted(var_8, key=func_2)\nvar_2 = max(var_2, func_3(var_4[0], var_4[-1]))\nvar_2 = max(var_2, func_3(var_4[0], var_4[1]))\nvar_2 = max(var_2, func_3(var_4[-1], var_4[-2]))\nvar_2 = max(var_2, func_3(var_5[0], var_5[-1]))\nvar_2 = max(var_2, func_3(var_5[0], var_5[1]))\nvar_2 = max(var_2, func_3(var_5[-1], var_5[-2]))\nprint(var_2)\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = 0\nvar_6 = []\nvar_4 = []\nvar_3 = []\nfor _ in range(var_1):\n var_5, var_7 = list(map(int, input().split()))\n var_6.append((var_5, var_7))\n var_4.append(var_5 + var_7)\n var_3.append(var_5 - var_7)\nvar_4.sort()\nvar_3.sort()\nvar_2 = max(var_4[-1] - var_4[0], var_3[-1] - var_3[0])\nprint(var_2)\n", "slow_time": 146157102, "fast_time": 36596704, "speedup": 3.9937, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_9"} -{"pair_id": "python_3267", "problem_id": "p03354", "language": "python", "slow_code": "import sys\n\n\ndef func_11():\n return sys.stdin.readline().strip()\n\n\ndef func_14(var_6, var_8, var_9):\n return [[var_9] * var_8 for var_12 in range(var_6)]\n\n\ndef func_15(var_6, var_8, var_9, var_10):\n return [[[var_10] * var_9 for var_13 in range(var_8)] for var_12 in range(var_6)]\n\n\ndef func_16(var_6, var_8, var_9, var_10, var_11):\n return [\n [[[var_11] * var_10 for var_13 in range(var_9)] for var_13 in range(var_8)]\n for var_12 in range(var_6)\n ]\n\n\ndef func_8(var_17, var_18=1):\n return int(-(-var_17 // var_18))\n\n\ndef func_1():\n return int(eval(func_11()))\n\n\ndef func_3():\n return list(map(int, func_11().split()))\n\n\ndef func_2(var_5=None):\n return list(func_3()) if var_5 is None else [func_1() for var_12 in range(var_5)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_2 = 10**18\nvar_4 = 10**9 + 7\n\n\nclass Class_1:\n \"\"\"\"\"\"\n\n def __init__(self, var_14):\n self.n = var_14\n\n self.par = [var_12 for var_12 in range(var_14 + 1)]\n\n self.rank = [0] * (var_14 + 1)\n\n self.size = [1] * (var_14 + 1)\n\n self.tree = [True] * (var_14 + 1)\n\n def func_9(self, var_17):\n \"\"\"\"\"\"\n\n if self.par[var_17] == var_17:\n return var_17\n else:\n\n self.par[var_17] = self.find(self.par[var_17])\n return self.par[var_17]\n\n def func_17(self, var_17, var_18):\n \"\"\"\"\"\"\n\n var_17 = self.find(var_17)\n var_18 = self.find(var_18)\n\n if var_17 == var_18:\n self.tree[var_17] = False\n return\n if not self.tree[var_17] or not self.tree[var_18]:\n self.tree[var_17] = self.tree[var_18] = False\n\n if self.rank[var_17] < self.rank[var_18]:\n self.par[var_17] = var_18\n self.size[var_18] += self.size[var_17]\n else:\n self.par[var_18] = var_17\n self.size[var_17] += self.size[var_18]\n\n if self.rank[var_17] == self.rank[var_18]:\n self.rank[var_17] += 1\n\n def func_12(self, var_17, var_18):\n \"\"\"\"\"\"\n return self.find(var_17) == self.find(var_18)\n\n def func_10(self, var_17=None):\n if var_17 is not None:\n \"\"\"\"\"\"\n return self.size[self.find(var_17)]\n else:\n \"\"\"\"\"\"\n var_15 = set()\n for var_12 in range(self.n + 1):\n var_15.add(self.find(var_12))\n\n return len(var_15) - 1\n\n def func_13(self, var_17):\n \"\"\"\"\"\"\n return self.tree[self.find(var_17)]\n\n\nvar_5, var_3 = func_3()\nvar_1 = func_2()\nvar_16 = Class_1(var_5)\nfor var_12 in range(var_3):\n var_6, var_8 = func_3()\n var_16.union(var_6, var_8)\nvar_7 = 0\nfor var_12, var_6 in enumerate(var_1):\n\n if var_16.is_same(var_12 + 1, var_6):\n var_7 += 1\nprint(var_7)\n", "fast_code": "var_8, var_7 = list(map(int, input().split()))\nvar_4 = lambda var_15: int(var_15) - 1\nvar_9 = list(map(var_4, input().split()))\nvar_10 = [var_6 for var_6 in range(var_8)]\n\n\ndef func_1(var_15):\n if var_15 == var_10[var_15]:\n return var_15\n else:\n var_10[var_15] = func_1(var_10[var_15])\n return var_10[var_15]\n\n\ndef func_2(var_1, var_3):\n var_11 = func_1(var_1)\n var_12 = func_1(var_3)\n if var_11 != var_12:\n var_10[var_11] = var_10[var_12]\n\n\nfor var_5 in range(var_7):\n var_13, var_14 = list(map(var_4, input().split()))\n func_2(var_13, var_14)\nvar_2 = 0\nfor var_6 in range(var_8):\n if func_1(var_6) == func_1(var_9[var_6]):\n var_2 += 1\nprint(var_2)\n", "slow_time": 237950254, "fast_time": 67859685, "speedup": 3.5065, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_28"} -{"pair_id": "python_16282", "problem_id": "p03721", "language": "python", "slow_code": "import sys\n\nvar_8 = [0] * (100000 + 1)\nvar_7, var_6 = [int(var_9) for var_9 in sys.stdin.readline().split()]\nfor var_4 in range(var_7):\n var_1, var_2 = [int(var_9) for var_9 in sys.stdin.readline().split()]\n var_8[var_1] += var_2\nvar_3 = 0\nfor var_4, var_5 in enumerate(var_8):\n var_3 += var_5\n if var_3 >= var_6:\n print(var_4)\n break\n", "fast_code": "import sys\nimport numpy as np\nimport collections\n\nvar_8, var_7 = [int(var_10) for var_10 in sys.stdin.readline().split()]\nvar_9 = collections.defaultdict(int)\nfor var_5 in range(var_8):\n var_1, var_2 = [int(var_10) for var_10 in sys.stdin.readline().split()]\n var_9[var_1] += var_2\nvar_4 = sorted(var_9.items())\nvar_3 = 0\nfor var_5, var_6 in enumerate(var_4):\n var_3 += var_6[1]\n if var_3 >= var_7:\n print((int(var_6[0])))\n break\n", "slow_time": 225541028, "fast_time": 41328319, "speedup": 5.4573, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_0"} -{"pair_id": "python_11922", "problem_id": "p02549", "language": "python", "slow_code": "import sys\n\nvar_7 = sys.stdin.readline\n\n\nclass Class_1:\n def __init__(self, var_11):\n self.bit = [0] * (var_11 + 1)\n self.size = var_11\n\n def func_2(self, var_6):\n var_6 += 1\n var_10 = 0\n while var_6 > 0:\n var_10 += self.bit[var_6]\n var_10 %= var_9\n var_6 -= var_6 & -var_6\n return var_10\n\n def func_1(self, var_6, var_12):\n var_6 += 1\n while var_6 <= self.size:\n self.bit[var_6] += var_12\n self.bit[var_6] %= var_9\n var_6 += var_6 & -var_6\n\n\nvar_9 = 998244353\nvar_3, var_1 = list(map(int, var_7().split()))\nvar_2, var_4 = list(zip(*[list(map(int, var_7().split())) for _ in range(var_1)]))\nvar_5 = Class_1(var_3 + 1)\nvar_5.add(1, 1)\nvar_5.add(2, -1)\nfor var_6 in range(1, var_3):\n var_12 = var_5.sum(var_6)\n for var_8 in range(var_1):\n var_5.add(var_6 + var_2[var_8], var_12)\n if var_6 + var_4[var_8] + 1 <= var_3:\n var_5.add(var_6 + var_4[var_8] + 1, -var_12)\nprint((var_5.sum(var_3)))\n", "fast_code": "var_3, var_1 = list(map(int, input().split()))\nvar_2 = 998244353\nvar_9 = []\nfor _ in range(var_1):\n var_7, var_10 = list(map(int, input().split()))\n var_9.append((var_7, var_10))\nvar_9.sort()\nvar_4 = [0] * (var_3 + 1)\nvar_5 = [0] * (var_3 + 1)\nvar_4[1] = 1\nvar_5[1] = 1\n\n\nfor var_6 in range(2, var_3 + 1):\n\n for var_7, var_10 in var_9:\n\n var_8 = max(var_6 - var_10, 1)\n var_11 = var_6 - var_7\n\n if var_11 < 1:\n continue\n var_4[var_6] += var_5[var_11] - var_5[var_8 - 1]\n var_4[var_6] %= var_2\n var_5[var_6] = var_5[var_6 - 1] + var_4[var_6]\nprint((var_4[var_3]))\n", "slow_time": 166096985, "fast_time": 80417355, "speedup": 2.0654, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_6"} -{"pair_id": "python_6765", "problem_id": "p02319", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys\nfrom collections import namedtuple\n\nvar_2, var_3 = 100, 100\n\n\ndef func_1():\n var_6 = [[float(\"inf\")] * (var_2 * var_3 + 1) for _ in range(var_2 + 1)]\n var_6[0][0] = 0\n for var_7, var_8 in enumerate(var_9):\n var_13, var_14 = var_8.value, var_8.weight\n for var_11 in range(var_2 * var_3 + 1):\n if var_11 < var_13:\n var_6[var_7 + 1][var_11] = var_6[var_7][var_11]\n else:\n var_6[var_7 + 1][var_11] = min(\n var_6[var_7][var_11], var_6[var_7][var_11 - var_13] + var_14\n )\n var_4 = 0\n for var_7 in range(var_2 * var_3 + 1):\n if var_6[var_5][var_7] <= var_12:\n var_4 = var_7\n return var_4\n\n\nif __name__ == \"__main__\":\n _input = sys.stdin.readlines()\n var_5, var_12 = list(map(int, _input[0].split()))\n var_10 = [var_15.split() for var_15 in _input[1:]]\n var_1 = namedtuple(\"Item\", (\"value\", \"weight\"))\n var_9 = [var_1(int(var_13), int(var_14)) for var_13, var_14 in var_10]\n print((func_1()))\n", "fast_code": "\"\"\"\"\"\"\n\nimport sys\nfrom collections import namedtuple\n\nvar_2 = 100\n\n\ndef func_1():\n var_5 = [[float(\"inf\")] * (var_4 * var_2 + 1) for _ in range(var_4 + 1)]\n var_5[0][0] = 0\n for var_6, var_7 in enumerate(var_8):\n var_12, var_13 = var_7.value, var_7.weight\n for var_10 in range(var_4 * var_2 + 1):\n if var_10 < var_12:\n var_5[var_6 + 1][var_10] = var_5[var_6][var_10]\n else:\n var_5[var_6 + 1][var_10] = min(\n var_5[var_6][var_10], var_5[var_6][var_10 - var_12] + var_13\n )\n var_3 = 0\n for var_6 in range(var_4 * var_2 + 1):\n if var_5[var_4][var_6] <= var_11:\n var_3 = var_6\n return var_3\n\n\nif __name__ == \"__main__\":\n _input = sys.stdin.readlines()\n var_4, var_11 = list(map(int, _input[0].split()))\n var_9 = [var_14.split() for var_14 in _input[1:]]\n var_1 = namedtuple(\"Item\", (\"value\", \"weight\"))\n var_8 = [var_1(int(var_12), int(var_13)) for var_12, var_13 in var_9]\n print((func_1()))\n", "slow_time": 2625923279, "fast_time": 138508545, "speedup": 18.9586, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_1"} -{"pair_id": "python_8266", "problem_id": "p03352", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_1 = [\n var_2**var_3\n for var_2 in range(1001)\n for var_3 in range(2, 10)\n if var_2**var_3 <= var_4\n]\nprint((max(var_1)))\n", "fast_code": "import math\n\nvar_1 = int(eval(input()))\nvar_4 = 0\nfor var_2 in range(1, int(math.sqrt(var_1)) + 1):\n for var_3 in range(2, int(math.sqrt(var_1)) + 2):\n var_5 = var_2**var_3\n if (var_5 <= var_1) and (var_5 > var_4):\n var_4 = var_5\nprint(var_4)\n", "slow_time": 515973115, "fast_time": 69747498, "speedup": 7.3977, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_16"} -{"pair_id": "python_5996", "problem_id": "p03566", "language": "python", "slow_code": "def func_1():\n var_7 = int(eval(input()))\n (*var_10,) = list(map(int, input().split()))\n var_15 = sum(var_10)\n (*var_17,) = list(map(int, input().split()))\n var_5 = []\n var_6 = [(1, 0, 0), (-1, var_15, var_15)]\n var_13 = 0\n for var_11, var_12, var_18 in zip([0] + var_10, var_10, var_17):\n var_5.append((var_13, var_13 + var_12, var_18))\n var_6.append((-1, var_13, var_13 + var_18))\n var_6.append((1, var_13 + var_12, var_18 - (var_13 + var_12)))\n var_13 += var_12\n\n def func_2(var_14):\n var_9 = float(\"inf\")\n for var_3, var_8, var_4 in var_5:\n if var_3 <= var_14 <= var_8:\n var_9 = min(var_9, var_4)\n for var_1, var_16, var_19 in var_6:\n if var_1 == -1 and var_14 <= var_16:\n var_9 = min(var_9, var_19 - var_14)\n if var_1 == 1 and var_14 >= var_16:\n var_9 = min(var_9, var_14 + var_19)\n return var_9\n\n print((sum(func_2(var_2 / 2) for var_2 in range(var_15 * 2 + 1)) / 2))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "from sys import stdin\n\n\ndef func_1(var_8, var_10):\n if len(var_8) == 0:\n return 0.0\n var_7 = sum(var_8)\n var_4 = min(var_10)\n if var_7 / 2.0 <= var_4:\n return (var_7 / 2.0) ** 2\n\n if var_4 == 0:\n\n var_11 = [var_3 for var_3 in range(len(var_10)) if var_10[var_3] == 0][0]\n return func_1(var_8[:var_11], var_10[:var_11]) + func_1(\n var_8[var_11 + 1 :], var_10[var_11 + 1 :]\n )\n\n var_6 = len(var_8)\n var_8[0] -= 1\n var_8[var_6 - 1] -= 1\n\n if var_8[var_6 - 1] == 0:\n var_8 = var_8[: var_6 - 1]\n var_10 = var_10[: var_6 - 1]\n if var_8[0] == 0:\n var_8 = var_8[1:]\n var_10 = var_10[1:]\n\n var_10 = [var_9 - 1 for var_9 in var_10]\n\n var_2 = var_7 - 2 + 1\n return var_2 + func_1(var_8, var_10)\n\n\ndef func_2(var_5):\n var_13 = var_5.strip().split()\n return [int(var_12) for var_12 in var_13]\n\n\nvar_1 = int(stdin.readline())\nvar_8 = func_2(stdin.readline())\nvar_10 = func_2(stdin.readline())\nif len(var_8) != var_1 or len(var_10) != var_1:\n raise\nprint(func_1(var_8, var_10))\n", "slow_time": 505488132, "fast_time": 100116364, "speedup": 5.049, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_4"} -{"pair_id": "python_13976", "problem_id": "p03762", "language": "python", "slow_code": "import sys\nfrom itertools import accumulate\n\n\ndef func_9():\n return sys.stdin.readline().strip()\n\n\ndef func_10(var_9, var_11, var_12):\n return [[var_12] * var_11 for var_16 in range(var_9)]\n\n\ndef func_11(var_9, var_11, var_12, var_13):\n return [[[var_13] * var_12 for var_17 in range(var_11)] for var_16 in range(var_9)]\n\n\ndef func_12(var_9, var_11, var_12, var_13, var_14):\n return [\n [[[var_14] * var_13 for var_17 in range(var_12)] for var_17 in range(var_11)]\n for var_16 in range(var_9)\n ]\n\n\ndef func_8(var_21, var_22=1):\n return int(-(-var_21 // var_22))\n\n\ndef func_1():\n return int(eval(func_9()))\n\n\ndef func_3():\n return list(map(int, func_9().split()))\n\n\ndef func_2(var_8=None):\n return list(func_3()) if var_8 is None else [func_1() for var_16 in range(var_8)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_5 = 10**18\nvar_7 = 10**9 + 7\nvar_8, var_6 = func_3()\nvar_1 = func_2()\nvar_3 = func_2()\n\nvar_2 = []\nfor var_16 in range(var_8 - 1):\n var_2.append(var_1[var_16 + 1] - var_1[var_16])\nvar_4 = []\nfor var_16 in range(var_6 - 1):\n var_4.append(var_3[var_16 + 1] - var_3[var_16])\nvar_2 = [0] + list(accumulate(var_2))\nvar_4 = [0] + list(accumulate(var_4))\n\nvar_18 = var_19 = 0\nfor var_16 in range(var_8):\n var_18 += var_2[var_16] * (var_8 - var_16 - 1)\n var_19 += var_2[var_16] * var_16\n var_18 %= var_7\n var_19 %= var_7\nvar_15 = var_19 - var_18\nvar_18 = var_19 = 0\nfor var_16 in range(var_6):\n var_18 += var_4[var_16] * (var_6 - var_16 - 1)\n var_19 += var_4[var_16] * var_16\n var_18 %= var_7\n var_19 %= var_7\nvar_20 = var_19 - var_18\nvar_10 = var_15 * var_20 % var_7\nprint(var_10)\n", "fast_code": "var_6 = 10**9 + 7\n\n\ndef func_1(var_3, var_4):\n return var_3 * var_4 % var_6\n\n\nvar_2, var_1 = list(map(int, input().split()))\n(*var_9,) = list(map(int, input().split()))\n(*var_10,) = list(map(int, input().split()))\nvar_7 = sum(func_1(_x, var_5 - (var_2 - 1 - var_5)) for var_5, _x in enumerate(var_9))\nvar_8 = sum(func_1(_y, var_5 - (var_1 - 1 - var_5)) for var_5, _y in enumerate(var_10))\nprint((var_7 * var_8 % var_6))\n", "slow_time": 159803774, "fast_time": 47602687, "speedup": 3.357, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_18"} -{"pair_id": "python_15799", "problem_id": "p03331", "language": "python", "slow_code": "var_6 = int(eval(input()))\nvar_3 = 10000\nfor var_1 in range(1, var_6):\n var_4 = 0\n var_5 = 0\n var_2 = var_6 - var_1\n while var_1 > 0:\n var_4 += var_1 % 10\n var_1 = var_1 // 10\n while var_2 > 0:\n var_5 += var_2 % 10\n var_2 = var_2 // 10\n var_3 = min(var_3, var_4 + var_5)\nprint(var_3)\n", "fast_code": "var_1 = int(eval(input()))\nprint((10 if var_1 in [10**var_2 for var_2 in range(6)] else sum(map(int, str(var_1)))))\n", "slow_time": 110311192, "fast_time": 18462413, "speedup": 5.9749, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_3"} -{"pair_id": "python_5171", "problem_id": "p03734", "language": "python", "slow_code": "var_1, var_2 = list(map(int, input().split()))\nvar_14 = []\nfor var_8 in range(var_1):\n var_12, var_11 = list(map(int, input().split()))\n var_14.append((var_12, var_11))\n\nvar_13 = var_14[0][0]\nvar_6 = [[[-1] * (330) for var_8 in range(110)] for var_10 in range(110)]\nvar_6[0][0][0] = 0\nfor var_8 in range(var_1):\n var_12, var_11 = var_14[var_8]\n var_7 = var_12 - var_13\n for var_9 in range(var_8 + 1):\n for var_10 in range(310):\n\n if var_6[var_8][var_9][var_9] == -1:\n continue\n var_6[var_8 + 1][var_9][var_10] = max(\n var_6[var_8 + 1][var_9][var_10], var_6[var_8][var_9][var_10]\n )\n var_6[var_8 + 1][var_9 + 1][var_10 + var_7] = max(\n var_6[var_8][var_9][var_10] + var_11,\n var_6[var_8 + 1][var_9 + 1][var_10 + var_7],\n )\nvar_5 = var_6[var_1]\nvar_4 = 0\nfor var_9 in range(var_1 + 1):\n if var_2 - var_9 * var_13 >= 0:\n var_3 = max(var_5[var_9][: var_2 - var_9 * var_13 + 1])\n var_4 = max(var_4, var_3)\nprint(var_4)\n", "fast_code": "def func_1():\n from itertools import accumulate\n\n var_1, var_2 = list(map(int, input().split()))\n var_8 = tuple([] for _ in range(4))\n var_13, var_12 = list(map(int, input().split()))\n var_8[0].append(var_12)\n for _ in range(var_1 - 1):\n _w, _v = list(map(int, input().split()))\n var_8[_w - var_13].append(_v)\n var_9 = [None for _ in range(4)]\n for var_10 in range(4):\n var_8[var_10].sort(reverse=True)\n var_9[var_10] = (0,) + tuple(accumulate(var_8[var_10]))\n var_11 = 0\n for var_3 in range(len(var_8[0]) + 1):\n for var_4 in range(len(var_8[1]) + 1):\n for var_5 in range(len(var_8[2]) + 1):\n var_7 = var_2 - (\n var_13 * var_3 + (var_13 + 1) * var_4 + (var_13 + 2) * var_5\n )\n if var_7 < 0:\n break\n var_6 = min(len(var_8[3]), var_7 // (var_13 + 3))\n var_11 = max(\n var_11,\n var_9[0][var_3]\n + var_9[1][var_4]\n + var_9[2][var_5]\n + var_9[3][var_6],\n )\n return var_11\n\n\nprint((func_1()))\n", "slow_time": 7051948785, "fast_time": 91563579, "speedup": 77.017, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_20"} -{"pair_id": "python_16510", "problem_id": "p02763", "language": "python", "slow_code": "import sys\n\nvar_11 = sys.stdin.readline\n\n\nclass Class_1:\n def __init__(self, var_13):\n self.size = var_13\n self.tree = [0] * (var_13 + 1)\n\n def func_2(self, var_10):\n if var_10 == 0:\n return 0\n var_15 = 0\n while var_10 > 0:\n var_15 += self.tree[var_10]\n var_10 -= var_10 & -var_10\n return var_15\n\n def func_1(self, var_10, var_17):\n while var_10 <= self.size:\n self.tree[var_10] += var_17\n var_10 += var_10 & -var_10\n\n\nvar_6 = \"abcdefghijklmnopqrstuvwxyz\"\nvar_2 = int(var_11().strip())\nvar_4 = list(var_11().strip())\nvar_3 = int(var_11().strip())\nvar_9 = dict()\nvar_1 = 5 * 10**5 + 2\nfor var_8 in var_6:\n var_9[var_8] = Class_1(var_1)\n for var_10, var_5 in enumerate(var_4):\n if var_5 == var_8:\n var_9[var_8].add(var_10 + 1, 1)\nfor _ in range(var_3):\n var_16, var_10, var_8 = var_11().split()\n var_16 = int(var_16)\n if var_16 == 1:\n var_10 = int(var_10)\n if var_4[var_10 - 1] != var_8:\n var_9[var_4[var_10 - 1]].add(var_10, -1)\n var_9[var_8].add(var_10, 1)\n var_4[var_10 - 1] = var_8\n else:\n\n var_12, var_14 = int(var_10), int(var_8)\n\n var_15 = 0\n for var_5 in var_6:\n var_7 = var_9[var_5]\n\n var_15 += var_7.sum(var_14) - var_7.sum(var_12 - 1) > 0\n print(var_15)\n", "fast_code": "def func_4():\n import sys\n\n var_18 = sys.stdin.readline\n var_23 = ord(\"a\")\n var_4 = int(eval(var_18()))\n var_8 = var_18().strip()\n var_20 = [ord(var_7) - var_23 for var_7 in var_8]\n var_5 = int(eval(var_18()))\n var_17 = 0\n\n def _binOpe(var_29, var_30):\n return var_29 | var_30\n\n def func_2(var_21):\n var_22 = 2 ** (var_21 - 1).bit_length()\n var_12 = [var_17] * (2 * var_22)\n return var_12, var_22\n\n def func_3(var_2):\n for var_15, var_1 in enumerate(var_2, var_22):\n var_12[var_15] = var_1\n for var_15 in reversed(list(range(1, var_22))):\n var_12[var_15] = _binOpe(var_12[2 * var_15], var_12[2 * var_15 + 1])\n\n def _update1(var_13, var_1):\n var_15 = var_13 + var_22\n var_12[var_15] = var_1\n\n def func_5(var_13, var_1):\n _update1(var_13, var_1)\n var_15 = var_13 + var_22\n while var_15 > 1:\n var_15 >>= 1\n var_12[var_15] = _binOpe(var_12[2 * var_15], var_12[2 * var_15 + 1])\n\n def func_1(var_16, var_14):\n var_3 = var_16 + var_22\n var_6 = var_14 + var_22\n var_9 = var_17\n while var_3 < var_6:\n if var_3 & 1:\n var_9 = _binOpe(var_9, var_12[var_3])\n var_3 += 1\n if var_6 & 1:\n var_6 -= 1\n var_9 = _binOpe(var_9, var_12[var_6])\n var_3 >>= 1\n var_6 >>= 1\n return var_9\n\n var_12, var_22 = func_2(var_4)\n var_2 = [(1 << var_19) for var_19 in var_20]\n func_3(var_2)\n var_10 = []\n for _ in range(var_5):\n var_25, var_27, var_28 = var_18().split()\n if var_25 == \"1\":\n var_24 = int(var_27) - 1\n var_11 = ord(var_28) - var_23\n func_5(var_24, 1 << var_11)\n else:\n var_3, var_6 = int(var_27) - 1, int(var_28) - 1\n var_26 = func_1(var_3, var_6 + 1)\n var_9 = bin(var_26).count(\"1\")\n var_10.append(var_9)\n print((\"\\n\".join(map(str, var_10))))\n\n\nfunc_4()\n", "slow_time": 565348597, "fast_time": 154181809, "speedup": 3.6668, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_15"} -{"pair_id": "python_9390", "problem_id": "p02675", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\n\nvar_2 = 10**13\nvar_4 = 10**9 + 7\n\n\ndef func_11():\n return sys.stdin.readline().strip()\n\n\ndef func_12(var_7, var_8):\n return (var_7 * var_8) // math.gcd(var_7, var_8)\n\n\ndef func_1():\n return int(func_11())\n\n\ndef func_2():\n return [int(var_7) for var_7 in func_11().split()]\n\n\ndef func_7(var_5):\n return [int(func_11()) for _ in range(var_5)]\n\n\ndef func_3(var_5):\n return [[int(var_7) for var_7 in func_11().split()] for _ in range(var_5)]\n\n\ndef func_5():\n return func_11().split()\n\n\ndef func_8(var_5):\n return [func_11() for _ in range(var_5)]\n\n\ndef func_4(var_5):\n return [func_11().split() for _ in range(var_5)]\n\n\ndef func_6(var_3):\n print(*var_3, sep=\"\\n\")\n\n\ndef func_10(var_1):\n print(\"Yes\" if var_1 else \"No\")\n\n\ndef func_9(var_1):\n print(\"YES\" if var_1 else \"NO\")\n\n\nvar_5 = func_11()\nvar_6 = int(var_5[-1])\nif var_6 in [2, 4, 5, 7, 9]:\n print(\"hon\")\nelif var_6 in [0, 1, 6, 8]:\n print(\"pon\")\nelse:\n print(\"bon\")\n", "fast_code": "var_1 = input()[-1]\nif var_1 == \"3\":\n print(\"bon\")\nelif var_1 in list(\"0168\"):\n print(\"pon\")\nelse:\n print(\"hon\")\n", "slow_time": 108680948, "fast_time": 13486655, "speedup": 8.0584, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_19"} -{"pair_id": "python_7813", "problem_id": "p02888", "language": "python", "slow_code": "from collections import defaultdict, deque, Counter, OrderedDict\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce, lru_cache\nfrom heapq import heappush, heappop, heapify\nimport itertools\nimport math, fractions\nimport sys, copy\n\n\ndef func_3():\n return sys.stdin.readline().split()\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_12():\n return list(sys.stdin.readline().rstrip())\n\n\ndef func_4():\n return [int(var_16) for var_16 in sys.stdin.readline().split()]\n\n\ndef func_5():\n return [int(var_16) - 1 for var_16 in sys.stdin.readline().split()]\n\n\ndef func_9():\n return [list(var_16) for var_16 in sys.stdin.readline().split()]\n\n\ndef func_11(var_14):\n return [sys.stdin.readline().strip() for _ in range(var_14)]\n\n\ndef func_8(var_14):\n return [func_3() for _ in range(var_14)]\n\n\ndef func_2(var_14):\n return [func_1() for _ in range(var_14)]\n\n\ndef func_6(var_14):\n return [func_4() for _ in range(var_14)]\n\n\ndef func_7(var_14):\n return [func_5() for _ in range(var_14)]\n\n\ndef func_13(var_14):\n return [func_12() for _ in range(var_14)]\n\n\ndef func_10(var_14):\n return [func_9() for _ in range(var_14)]\n\n\ndef func_17(var_14, var_15):\n return math.factorial(var_14) // math.factorial(var_15)\n\n\ndef func_14(var_14, var_15):\n return math.factorial(var_14) // (\n math.factorial(var_15) * math.factorial(var_14 - var_15)\n )\n\n\ndef func_16(var_14, *var_7, var_8=0):\n return (\n [func_16(*var_7, default=var_8) for _ in range(var_14)]\n if len(var_7) > 0\n else [var_8 for _ in range(var_14)]\n )\n\n\nvar_9 = [[1, 0], [0, 1], [-1, 0], [0, -1]]\nvar_10 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]\nvar_5 = \"abcdefghijklmnopqrstuvwxyz\"\nvar_1 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nvar_3 = 1000000007\nvar_2 = float(\"inf\")\nsys.setrecursionlimit(1000000)\n\n\ndef func_15():\n var_4 = func_1()\n func_3 = sorted(func_4())\n var_6 = 0\n for var_11 in range(var_4):\n var_13 = var_11\n for var_12 in range(var_11 + 1, var_4):\n while var_13 < var_4 and func_3[var_13] < func_3[var_11] + func_3[var_12]:\n var_13 += 1\n var_6 += var_13 - (var_12 + 1)\n print(var_6)\n\n\nif __name__ == \"__main__\":\n func_15()\n", "fast_code": "import bisect\n\nvar_5 = int(eval(input()))\nvar_4 = sorted(list(map(int, input().split())))\nvar_1 = 0\nfor var_2 in range(var_5 - 2):\n for var_3 in range(var_2 + 1, var_5 - 1):\n var_1 += bisect.bisect_left(var_4, var_4[var_2] + var_4[var_3]) - var_3 - 1\nprint(var_1)\n", "slow_time": 203845466, "fast_time": 29149513, "speedup": 6.9931, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_23"} -{"pair_id": "python_18470", "problem_id": "p02631", "language": "python", "slow_code": "import sys\n\nvar_5 = sys.stdin.readline\nfrom itertools import accumulate\nfrom functools import reduce\nfrom operator import xor, add\n\n\ndef func_1():\n var_2 = int(var_5().strip())\n var_1 = list(map(int, var_5().strip().split()))\n return var_2, var_1\n\n\ndef func_2(var_2, var_1):\n var_3 = reduce(xor, var_1)\n for var_4 in var_1:\n print(var_3 ^ var_4, end=\" \")\n\n\nif __name__ == \"__main__\":\n var_6 = func_1()\n var_7 = func_2(*var_6)\n if var_7 is not None:\n print(\"%s\" % str(var_7))\n", "fast_code": "var_3 = int(input())\nvar_1 = list(map(int, input().split()))\nvar_4 = 0\nfor var_2 in var_1:\n var_4 ^= var_2\nfor var_2 in var_1:\n print(var_4 ^ var_2, end=\" \")\n", "slow_time": 42064619, "fast_time": 18384754, "speedup": 2.288, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_1"} -{"pair_id": "python_2819", "problem_id": "p02264", "language": "python", "slow_code": "import time as ti\n\n\nclass Class_1(object):\n \"\"\"\"\"\"\n\n def __init__(self):\n \"\"\"\"\"\"\n self.length = 50010\n self.queue = [0] * self.length\n\n self.head = 0\n self.tail = 0\n\n def func_2(self, var_7):\n \"\"\"\"\"\"\n self.queue[self.tail] = var_7\n\n self.tail = (self.tail + 1) % self.length\n\n def func_1(self):\n \"\"\"\"\"\"\n\n self.queue[self.head] = 0\n self.head = (self.head + 1) % self.length\n\n def func_4(self):\n \"\"\"\"\"\"\n if self.head == self.tail:\n return True\n else:\n return False\n\n def func_5(self):\n \"\"\"\"\"\"\n if self.tail - self.head >= len(self.queue):\n return True\n else:\n return False\n\n\nclass Class_2(object):\n \"\"\"\"\"\"\n\n def __init__(self, var_6=\"\", var_9=0):\n \"\"\"\"\"\"\n self.name = var_6\n self.time = var_9\n\n def func_3(self, var_9):\n \"\"\"\"\"\"\n self.time -= var_9\n return self.time\n\n\ndef func_6(\n var_4,\n var_3,\n var_2,\n):\n \"\"\"\"\"\"\n var_10 = var_4.queue[var_4.head].forward_time(var_3)\n if var_10 <= 0:\n var_2 += var_3 + var_10\n print(var_4.queue[var_4.head].name, var_2)\n var_4.dequeue()\n elif var_10 > 0:\n var_2 += var_3\n\n var_4.enqueue(var_4.queue[var_4.head])\n var_4.dequeue()\n return var_2\n\n\nvar_4 = Class_1()\nvar_5, var_8 = [int(var_11) for var_11 in input().split()]\nvar_1 = 0\nwhile var_1 < var_5:\n var_6, var_9 = input().split()\n var_4.enqueue(Class_2(var_6, int(var_9)))\n var_1 += 1\n\nvar_2 = 0\nwhile not var_4.is_empty():\n var_2 = func_6(var_4, var_8, var_2)\n", "fast_code": "from collections import deque\n\nvar_2, var_4 = list(map(int, input().split()))\nvar_5 = deque()\nfor var_1 in range(var_2):\n var_3, var_7 = input().split()\n var_5.append((var_3, int(var_7)))\nvar_6 = 0\nwhile var_5:\n var_3, var_7 = var_5.popleft()\n var_6 += min(var_4, var_7)\n if var_7 > var_4:\n var_5.append((var_3, var_7 - var_4))\n else:\n print((var_3, var_6))\n", "slow_time": 138359857, "fast_time": 37871035, "speedup": 3.6534, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_16"} -{"pair_id": "python_6661", "problem_id": "p04014", "language": "python", "slow_code": "from math import floor, sqrt\n\nvar_1 = 10**20\n\n\ndef func_1(var_3, var_4):\n if var_4 < var_3:\n return var_4\n else:\n return func_1(var_3, var_4 // var_3) + (var_4 % var_3)\n\n\ndef func_2():\n var_4 = int(eval(input()))\n var_7 = int(eval(input()))\n var_2 = var_1\n\n if var_4 == var_7:\n var_2 = min(var_2, var_4 + 1)\n\n for var_5 in range(1, int(sqrt(var_4)) + 1):\n var_6 = var_7 - var_5\n var_3 = (var_4 - var_6) // var_5\n if 2 <= var_3 and func_1(var_3, var_4) == var_7:\n var_2 = min(var_2, var_3)\n\n for var_3 in range(2, int(sqrt(var_4)) + 1):\n if func_1(var_3, var_4) == var_7:\n var_2 = min(var_2, var_3)\n print((-1 if var_2 == var_1 else var_2))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "def func_7(var_1):\n var_9 = 2\n var_18 = {}\n var_13 = var_1\n var_12 = 0\n while var_9**2 <= var_13:\n var_11 = 0\n while var_13 % var_9 == 0:\n var_13 //= var_9\n var_11 += 1\n var_18[var_9] = var_11\n var_9 += 1\n if var_9 == 101 and var_13 >= (2**20):\n\n def func_4(var_1):\n def func_5(var_5, var_6):\n while var_6:\n var_5, var_6 = var_6, var_5 % var_6\n return abs(var_5)\n\n def func_3(var_22, var_7):\n return ((var_22**2) + var_7) % var_1\n\n var_20 = [var_1]\n for var_7 in range(1, 99):\n var_22, var_23, var_8 = 2, 2, 1\n while var_8 == 1:\n var_22 = func_3(var_22, var_7)\n var_23 = func_3(func_3(var_23, var_7), var_7)\n var_8 = func_5(abs(var_22 - var_23), var_1)\n if var_8 != var_1:\n if func_6(var_8):\n return var_8\n elif func_6(var_1 // var_8):\n return var_1 // var_8\n else:\n var_20.append(var_8)\n\n while True:\n if func_6(var_13):\n var_18[var_13], var_13 = 1, 1\n break\n else:\n var_12 = 1\n var_10 = func_4(var_13)\n var_11 = 0\n while var_13 % var_10 == 0:\n var_13 //= var_10\n var_11 += 1\n var_18[var_10] = var_11\n if var_13 == 1:\n break\n if var_13 > 1:\n var_18[var_13] = 1\n if var_12 > 0:\n\n def func_1(var_3):\n var_4 = {}\n for var_22 in sorted(var_3.keys()):\n var_4[var_22] = var_3[var_22]\n return var_4\n\n var_18 = func_1(var_18)\n return var_18\n\n\ndef func_6(var_13):\n if var_13 == 2:\n return True\n if var_13 == 1 or var_13 & 1 == 0:\n return False\n var_8 = (var_13 - 1) >> 1\n while var_8 & 1 == 0:\n var_8 >>= 1\n for var_5 in [2, 3, 5, 7, 11, 13, 17, 19, 23]:\n var_21 = var_8\n var_23 = pow(var_5, var_21, var_13)\n while var_21 != var_13 - 1 and var_23 != 1 and var_23 != var_13 - 1:\n var_23 = (var_23 * var_23) % var_13\n var_21 <<= 1\n if var_23 != var_13 - 1 and var_21 & 1 == 0:\n return False\n return True\n\n\ndef func_2(var_1):\n var_15 = func_7(var_1)\n var_18 = [1]\n for var_14 in var_15:\n var_19 = var_18\n var_18 = []\n for var_9 in range(var_15[var_14] + 1):\n for var_16 in var_19:\n var_18.append(var_16 * (var_14**var_9))\n return sorted(var_18)\n\n\ndef func_3(var_6, var_13):\n var_17 = 0\n while var_13:\n var_17 += var_13 % var_6\n var_13 //= var_6\n return var_17\n\n\nvar_1 = int(eval(input()))\nvar_2 = int(eval(input()))\nif var_1 < var_2:\n print((-1))\nelif var_1 == var_2:\n print((var_1 + 1))\nelse:\n for var_6 in func_2(var_1 - var_2):\n var_6 += 1\n if func_3(var_6, var_1) == var_2:\n print(var_6)\n break\n else:\n print((-1))\n", "slow_time": 2534826177, "fast_time": 157911457, "speedup": 16.0522, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_5"} -{"pair_id": "python_3638", "problem_id": "p02786", "language": "python", "slow_code": "import sys\nimport math\nimport os\nimport itertools\nimport string\nimport heapq\nimport _collections\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nfrom functools import lru_cache\nimport bisect\nimport re\nimport queue\nimport copy\nimport decimal\n\n\nclass Class_1:\n @staticmethod\n def int():\n return int(sys.stdin.readline().rstrip())\n\n @staticmethod\n def string():\n return sys.stdin.readline().rstrip()\n\n @staticmethod\n def func_4():\n return [int(var_6) for var_6 in Class_1.string().split()]\n\n @staticmethod\n def func_6(var_4):\n return [Class_1.string() for var_3 in range(var_4)]\n\n @staticmethod\n def func_2(var_4):\n return [Class_1.map_int() for var_3 in range(var_4)]\n\n @staticmethod\n def func_1(var_4):\n return [Class_1.int() for var_3 in range(var_4)]\n\n\ndef func_5():\n var_1 = Class_1.int()\n var_2 = 0\n var_5 = 1\n while var_1 > 1:\n var_2 += var_5\n var_5 *= 2\n var_1 //= 2\n var_2 += var_5\n print(var_2)\n\n\ndef func_3():\n\n func_5()\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "print((2 ** len(bin(int(eval(input())))) // 4 - 1))\n", "slow_time": 97773077, "fast_time": 10638346, "speedup": 9.1906, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_11"} -{"pair_id": "python_7611", "problem_id": "p03835", "language": "python", "slow_code": "var_1, var_2 = list(map(int, input().split()))\nprint(\n (\n [\n 0 <= var_2 - var_3 - var_4 <= var_1\n for var_3 in range(var_1 + 1)\n for var_4 in range(var_1 + 1)\n ].count(True)\n )\n)\n", "fast_code": "var_2, var_3 = list(map(int, input().split()))\nvar_1 = 0\nfor var_4 in range(min(var_3 + 1, var_2 + 1)):\n for var_5 in range(min(var_3 + 1 - var_4, var_2 + 1)):\n if 0 <= var_3 - var_4 - var_5 <= var_2:\n var_1 += 1\nprint(var_1)\n", "slow_time": 265950136, "fast_time": 49581919, "speedup": 5.3639, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_8"} -{"pair_id": "python_6780", "problem_id": "p03713", "language": "python", "slow_code": "def func_1(var_1, var_10, var_11):\n for var_15 in range(1, var_10):\n var_16 = var_1 // 2\n var_4 = var_1 * var_15\n var_6 = (var_10 - var_15) * var_16\n var_8 = (var_10 - var_15) * (var_1 - var_16)\n var_2 = max(var_4, var_6, var_8)\n var_13 = min(var_4, var_6, var_8)\n var_17 = (var_10 - var_15) // 2\n var_5 = var_1 * var_15\n var_7 = var_1 * var_17\n var_9 = var_1 * (var_10 - var_15 - var_17)\n var_3 = max(var_5, var_7, var_9)\n var_14 = min(var_5, var_7, var_9)\n if var_11 > min(var_2 - var_13, var_3 - var_14):\n var_11 = min(var_2 - var_13, var_3 - var_14)\n return var_11\n\n\nif __name__ == \"__main__\":\n var_1, var_10 = [int(var_12) for var_12 in input().split()]\n var_11 = var_1 * var_10\n var_11 = func_1(var_1, var_10, var_11)\n var_1, var_10 = var_10, var_1\n if func_1(var_1, var_10, var_11) < var_11:\n var_11 = func_1(var_1, var_10, var_11)\n print(var_11)\n", "fast_code": "var_6, var_7 = list(map(int, input().split()))\nif var_6 % 3 == 0 or var_7 % 3 == 0:\n print((0))\nelse:\n var_1 = (var_6 // 3 + 1) * var_7 - (var_6 - 1 - var_6 // 3) * (var_7 // 2)\n var_2 = (var_6 - var_6 // 3) * (var_7 - var_7 // 2) - var_6 // 3 * var_7\n var_3 = min(var_6, var_7)\n var_6, var_7 = var_7, var_6\n var_4 = (var_6 // 3 + 1) * var_7 - (var_6 - 1 - var_6 // 3) * (var_7 // 2)\n var_5 = (var_6 - var_6 // 3) * (var_7 - var_7 // 2) - var_6 // 3 * var_7\n print((min(var_1, var_2, var_3, var_4, var_5)))\n", "slow_time": 55092793362, "fast_time": 35436405, "speedup": 1554.6948, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_27"} -{"pair_id": "python_5365", "problem_id": "p02417", "language": "python", "slow_code": "var_1 = [0] * 26\nvar_4 = \"abcdefghijklmnopqrstuvwxyz\"\ntry:\n while True:\n var_3 = list(input().upper())\n for var_2 in var_3:\n if var_2 == \"A\":\n var_1[0] += 1\n elif var_2 == \"B\":\n var_1[1] += 1\n elif var_2 == \"C\":\n var_1[2] += 1\n elif var_2 == \"D\":\n var_1[3] += 1\n elif var_2 == \"E\":\n var_1[4] += 1\n elif var_2 == \"F\":\n var_1[5] += 1\n elif var_2 == \"G\":\n var_1[6] += 1\n elif var_2 == \"H\":\n var_1[7] += 1\n elif var_2 == \"I\":\n var_1[8] += 1\n elif var_2 == \"J\":\n var_1[9] += 1\n elif var_2 == \"K\":\n var_1[10] += 1\n elif var_2 == \"L\":\n var_1[11] += 1\n elif var_2 == \"M\":\n var_1[12] += 1\n elif var_2 == \"N\":\n var_1[13] += 1\n elif var_2 == \"O\":\n var_1[14] += 1\n elif var_2 == \"P\":\n var_1[15] += 1\n elif var_2 == \"Q\":\n var_1[16] += 1\n elif var_2 == \"R\":\n var_1[17] += 1\n elif var_2 == \"S\":\n var_1[18] += 1\n elif var_2 == \"T\":\n var_1[19] += 1\n elif var_2 == \"U\":\n var_1[20] += 1\n elif var_2 == \"V\":\n var_1[21] += 1\n elif var_2 == \"W\":\n var_1[22] += 1\n elif var_2 == \"X\":\n var_1[23] += 1\n elif var_2 == \"Y\":\n var_1[24] += 1\n elif var_2 == \"Z\":\n var_1[25] += 1\nexcept EOFError:\n pass\nfor var_2 in range(26):\n print((var_4[var_2 : var_2 + 1], \":\", str(var_1[var_2])))\n", "fast_code": "import sys, string\n\nvar_3 = []\nfor var_2 in sys.stdin:\n var_3.append(var_2)\nvar_4 = \"\".join(var_3).lower()\nfor var_1 in string.ascii_lowercase:\n print((\"{} : {}\".format(var_1, var_4.count(var_1))))\n", "slow_time": 119389800, "fast_time": 25020681, "speedup": 4.7716, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_2"} -{"pair_id": "python_6712", "problem_id": "p00070", "language": "python", "slow_code": "import sys\n\nvar_4 = 1024\nvar_5 = 331\nvar_6 = list(range(var_4))\nvar_1 = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]\nvar_2 = [0] * var_4\nvar_3 = [[0 for var_9 in range(var_5)] for var_11 in var_6]\n\n\ndef func_1():\n global C, D\n for var_9 in var_6:\n var_14 = format(var_9, \"b\")\n var_13 = var_14.count(\"1\")\n var_2[var_9] = var_13\n if var_13 == 1:\n var_3[var_9][var_1.index(var_9)] = 1\n else:\n for var_11 in range(len(var_14)):\n if var_14[-var_11 - 1] == \"1\":\n var_8 = var_13 * var_11\n var_10 = var_9 - var_1[var_11]\n for var_12 in range(var_5 - var_8):\n var_3[var_9][var_12 + var_8] += var_3[var_10][var_12]\n return\n\n\nfunc_1()\nfor var_7 in sys.stdin:\n var_13, var_14 = list(map(int, var_7.split()))\n var_15 = 0\n if var_14 < var_5:\n var_15 = sum(\n [var_3[var_9][var_14] for var_9 in var_6 if var_2[var_9] == var_13]\n )\n print(var_15)\n", "fast_code": "def func_3(var_5, var_6):\n global n\n var_9 = 0\n for var_3 in range(var_6):\n var_9 += (var_7 - var_3) * var_5[-var_3 - 1]\n return var_9\n\n\ndef func_2(var_5, var_6):\n global n\n var_9 = 0\n for var_3 in range(var_6):\n var_9 += (var_7 - var_3) * var_5[var_3]\n return var_9\n\n\ndef func_1(var_5, var_6, var_8):\n global n\n var_2 = 0\n if var_6 > 0:\n var_11, var_10 = func_3(var_5, var_6), func_2(var_5, var_6)\n if var_11 < var_8 or var_10 > var_8:\n return 0\n elif var_11 == var_8 or var_10 == var_8:\n return 1\n for var_3 in range(len(var_5)):\n var_4 = var_5[:]\n var_1 = (var_7 - var_6 + 1) * var_4.pop(var_3)\n if var_8 - var_1 < 0:\n break\n else:\n var_2 += func_1(var_4, var_6 - 1, var_8 - var_1)\n return var_2\n else:\n return 1 if var_8 == 0 else 0\n\n\nvar_5 = [var_3 for var_3 in range(10)]\nwhile True:\n try:\n var_7, var_8 = list(map(int, input().split()))\n print(func_1(var_5, var_7, var_8))\n except:\n break\n", "slow_time": 56673214149, "fast_time": 140551597, "speedup": 403.22, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_3"} -{"pair_id": "python_14851", "problem_id": "p02900", "language": "python", "slow_code": "def func_1(var_9, var_10):\n if var_9 < var_10:\n var_9, var_10 = var_10, var_9\n while var_10 > 0:\n var_9, var_10 = var_10, var_9 % var_10\n return var_9\n\n\nvar_3 = 10**6\nvar_4 = [1 for var_7 in range(var_3 + 1)]\nvar_4[0] = 0\nvar_4[1] = 0\nfor var_7 in range(2, int((var_3 + 1) ** 0.5) + 1):\n for var_8 in range(var_7 * var_7, var_3 + 1, var_7):\n var_4[var_8] = 0\nvar_5 = []\nfor var_7 in range(var_3):\n if var_4[var_7] == 1:\n var_5.append(var_7)\nvar_1, var_2 = list(map(int, input().split()))\nvar_9 = func_1(var_1, var_2)\nvar_6 = 1\nfor var_10 in var_5:\n if var_9 % var_10 == 0:\n var_6 += 1\n while var_9 % var_10 == 0:\n var_9 = var_9 // var_10\nif var_9 > 1:\n var_6 += 1\nprint(var_6)\n", "fast_code": "import math\n\nvar_1, var_4 = list(map(int, input().split()))\n\n\ndef func_1(var_6):\n var_3 = []\n var_7 = var_6\n for var_5 in range(2, int(var_6**0.5) + 1):\n while var_7 % var_5 == 0:\n var_7 //= var_5\n var_3.append(var_5)\n if var_7 != 1:\n var_3.append(var_7)\n if var_3 == []:\n var_3.append(var_6)\n return list(set(var_3))\n\n\nvar_2 = len(func_1(math.gcd(var_1, var_4)))\nprint((var_2 + 1 if math.gcd(var_1, var_4) != 1 else 1))\n", "slow_time": 293177338513, "fast_time": 42688358, "speedup": 6867.8523, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_28"} -{"pair_id": "python_14590", "problem_id": "p03183", "language": "python", "slow_code": "from sys import stdin, stdout, setrecursionlimit\nfrom collections import deque, defaultdict, Counter\nfrom heapq import heappush, heappop\nfrom functools import lru_cache\nimport math\n\nsetrecursionlimit(10**6)\nvar_11 = lambda: stdin.readline()\nvar_14 = lambda: stdin.readline().split()\nvar_13 = lambda: list(map(int, stdin.readline().split()))\nvar_12 = lambda: list(map(float, stdin.readline().split()))\nvar_3, var_5 = float(\"inf\"), float(\"-inf\")\nvar_4 = 10**9 + 7\n\n\ndef func_1():\n var_10 = int(var_11())\n var_1 = []\n for _ in range(var_10):\n var_17, var_15, var_16 = var_13()\n var_1.append((var_17, var_15, var_16))\n var_6 = 0\n var_1.sort(key=lambda var_2: (var_2[0] + var_2[1]))\n var_9 = 2 * 10**4 + 100\n var_7 = [0 for _ in range(var_9 + 1)]\n for var_17, var_15, var_16 in var_1:\n for var_8 in range(var_9, -1, -1):\n if var_8 - var_17 < 0:\n continue\n if var_8 - var_17 > var_15:\n continue\n var_7[var_8] = max(var_7[var_8], var_7[var_8 - var_17] + var_16)\n var_6 = max(var_6, var_7[var_8])\n print(var_6)\n stdout.close()\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "import sys\n\nvar_5 = int(eval(input()))\nvar_1 = []\nfor var_4 in sys.stdin.readlines():\n var_8, var_6, var_7 = list(map(int, var_4.split()))\n var_1.append((var_8 + var_6, var_8, var_6, var_7))\nvar_1.sort()\nvar_2 = [-1] * 20001\nvar_2[0] = 0\nfor _, var_8, var_6, var_7 in var_1:\n for var_3 in range(var_6, -1, -1):\n if var_2[var_3] == -1:\n continue\n var_2[var_3 + var_8] = max(var_2[var_3 + var_8], var_2[var_3] + var_7)\nprint((max(var_2)))\n", "slow_time": 5545721805, "fast_time": 839094136, "speedup": 6.6092, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_7"} -{"pair_id": "python_6746", "problem_id": "p02289", "language": "python", "slow_code": "import sys\n\n\ndef func_3(var_1, var_4):\n var_6 = var_4 * 2 + 1\n var_10 = var_4 * 2 + 2\n if var_6 < var_8:\n var_7 = var_6\n if var_10 < var_8 and var_1[var_10] > var_1[var_6]:\n var_7 = var_10\n if var_1[var_7] > var_1[var_4]:\n var_1[var_4], var_1[var_7] = var_1[var_7], var_1[var_4]\n func_3(var_1, var_7)\n\n\ndef func_2(var_2, var_5):\n global n\n var_2[var_8] = var_5\n var_8 += 1\n var_4 = var_8 - 1\n var_9 = (var_4 - 1) // 2\n while var_4 > 0 and var_2[var_4] > var_2[var_9]:\n var_2[var_4], var_2[var_9] = var_2[var_9], var_2[var_4]\n var_4 = var_9\n var_9 = (var_4 - 1) // 2\n\n\ndef func_1(var_2):\n global n\n if var_8 == 1:\n var_8 -= 1\n return var_2[0]\n var_3 = var_2[0]\n var_8 -= 1\n var_2[0] = var_2[var_8]\n var_4 = 0\n while True:\n var_6 = var_4 * 2 + 1\n var_10 = var_4 * 2 + 2\n if var_6 >= var_8:\n break\n var_7 = var_6\n if var_10 < var_8 and var_1[var_10] > var_1[var_6]:\n var_7 = var_10\n if var_1[var_7] > var_1[var_4]:\n var_1[var_4], var_1[var_7] = var_1[var_7], var_1[var_4]\n var_4 = var_7\n else:\n break\n return var_3\n\n\nvar_1 = [0] * 2000000\nvar_2 = []\nvar_8 = 0\nfor var_11 in sys.stdin:\n if var_11[2] == \"s\":\n func_2(var_1, int(var_11[7:]))\n elif var_11[2] == \"t\":\n var_2.append(func_1(var_1))\n else:\n break\nprint((\"\\n\".join(map(str, var_2))))\n", "fast_code": "import sys\nfrom heapq import heapify, heappush, heappop\n\nvar_2 = []\nvar_1 = []\nfor var_3 in sys.stdin:\n if var_3[2] == \"s\":\n heappush(var_2, -int(var_3[7:]))\n elif var_3[2] == \"t\":\n var_1.append(-heappop(var_2))\n else:\n break\nprint((\"\\n\".join(map(str, var_1))))\n", "slow_time": 170032903, "fast_time": 26220132, "speedup": 6.4848, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_3"} -{"pair_id": "python_10028", "problem_id": "p03222", "language": "python", "slow_code": "var_1, var_3, var_2 = [int(_) for _ in input().split()]\nif var_3 == 1:\n print((1))\nelse:\n\n def func_1(var_9):\n if var_9 == 0 or var_9 == 1:\n return 1\n else:\n var_5 = 0\n for var_10 in range(2 ** (var_9 - 1)):\n var_4 = str(bin(var_10))\n var_7 = 1\n for var_8 in range(2, len(var_4) - 1):\n if var_4[var_8] == \"1\" and var_4[var_8 + 1] == \"1\":\n var_7 = 0\n var_5 += var_7\n return var_5\n\n var_6 = [[1] + [0] * (var_3 - 1)]\n for var_9 in range(1, var_1 + 1):\n var_6.append([0] * var_3)\n for var_8 in range(var_3):\n if var_8 == 0:\n var_6[var_9][var_8] = (\n var_6[var_9 - 1][var_8] * func_1(var_8) * func_1(var_3 - var_8 - 1)\n + var_6[var_9 - 1][var_8 + 1]\n * func_1(var_8)\n * func_1(var_3 - var_8 - 2)\n ) % 1000000007\n elif var_8 == var_3 - 1:\n var_6[var_9][var_8] = (\n var_6[var_9 - 1][var_8] * func_1(var_8) * func_1(var_3 - var_8 - 1)\n + var_6[var_9 - 1][var_8 - 1]\n * func_1(var_8 - 1)\n * func_1(var_3 - var_8 - 1)\n ) % 1000000007\n else:\n var_6[var_9][var_8] = (\n var_6[var_9 - 1][var_8] * func_1(var_8) * func_1(var_3 - var_8 - 1)\n + var_6[var_9 - 1][var_8 + 1]\n * func_1(var_8)\n * func_1(var_3 - var_8 - 2)\n + var_6[var_9 - 1][var_8 - 1]\n * func_1(var_8 - 1)\n * func_1(var_3 - var_8 - 1)\n ) % 1000000007\n print((var_6[var_1][var_2 - 1]))\n", "fast_code": "var_1, var_4, var_2 = [int(_) for _ in input().split()]\nvar_3 = 1000000007\nvar_8 = [[0]]\nfor var_5 in range(1, var_4):\n var_8 = [var_7 + [var_5] for var_7 in var_8] + [\n var_7[:-1] + [var_5, var_5 - 1] for var_7 in var_8 if var_7[-1] == var_5 - 1\n ]\nvar_9 = [1] + [0] * (var_4 - 1)\nfor var_6 in range(var_1):\n var_9 = [\n sum(var_9[var_7[var_5]] for var_7 in var_8) % var_3 for var_5 in range(var_4)\n ]\nprint((var_9[var_2 - 1]))\n", "slow_time": 373854200, "fast_time": 72095515, "speedup": 5.1855, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_1"} -{"pair_id": "python_6831", "problem_id": "p03713", "language": "python", "slow_code": "var_3, var_5 = list(map(int, input().split()))\nvar_1 = lambda var_6: max(var_6) - min(var_6)\nvar_2 = lambda var_3, var_5: min(\n [\n min(\n var_1(\n [\n var_4 * var_5,\n ((var_3 - var_4) // 2) * var_5,\n ((var_3 - var_4) - (var_3 - var_4) // 2) * var_5,\n ]\n ),\n var_1(\n [\n var_4 * var_5,\n (var_3 - var_4) * (var_5 // 2),\n (var_3 - var_4) * (var_5 - var_5 // 2),\n ]\n ),\n )\n for var_4 in range(1, var_3)\n ]\n)\nprint((min(var_2(var_3, var_5), var_2(var_5, var_3))))\n", "fast_code": "var_2, var_7 = list(map(int, input().split()))\nif var_2 % 3 == 0 or var_7 % 3 == 0:\n print((0))\nelse:\n var_1 = min(var_7, var_2)\n for var_8 in range(var_7 // 3, var_7 // 3 + 3):\n var_4 = var_8 * var_2\n var_9 = var_7 - var_8\n for var_3 in range(var_2 // 2, var_2 // 2 + 2):\n var_5 = var_9 * var_3\n var_6 = var_9 * (var_2 - var_3)\n var_1 = min(var_1, max(var_4, var_5, var_6) - min(var_4, var_5, var_6))\n var_2, var_7 = var_7, var_2\n for var_8 in range(var_7 // 3, var_7 // 3 + 3):\n var_4 = var_8 * var_2\n var_9 = var_7 - var_8\n for var_3 in range(var_2 // 2, var_2 // 2 + 2):\n var_5 = var_9 * var_3\n var_6 = var_9 * (var_2 - var_3)\n var_1 = min(var_1, max(var_4, var_5, var_6) - min(var_4, var_5, var_6))\n print(var_1)\n", "slow_time": 61347374653, "fast_time": 56687230, "speedup": 1082.208, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_24"} -{"pair_id": "python_5160", "problem_id": "p03734", "language": "python", "slow_code": "var_1, var_2 = list(map(int, input().split()))\nvar_14 = []\nfor var_8 in range(var_1):\n var_12, var_11 = list(map(int, input().split()))\n var_14.append((var_12, var_11))\n\nvar_13 = var_14[0][0]\nvar_6 = [[[-1] * (330) for var_8 in range(110)] for var_10 in range(110)]\nvar_6[0][0][0] = 0\nfor var_8 in range(var_1):\n var_12, var_11 = var_14[var_8]\n var_7 = var_12 - var_13\n for var_9 in range(var_8 + 1):\n for var_10 in range(310):\n\n if var_6[var_8][var_9][var_9] == -1:\n continue\n var_6[var_8 + 1][var_9][var_10] = max(\n var_6[var_8 + 1][var_9][var_10], var_6[var_8][var_9][var_10]\n )\n var_6[var_8 + 1][var_9 + 1][var_10 + var_7] = max(\n var_6[var_8][var_9][var_10] + var_11,\n var_6[var_8 + 1][var_9 + 1][var_10 + var_7],\n )\nvar_5 = var_6[var_1]\nvar_4 = 0\nfor var_9 in range(var_1 + 1):\n if var_2 - var_9 * var_13 >= 0:\n var_3 = max(var_5[var_9][: var_2 - var_9 * var_13 + 1])\n var_4 = max(var_4, var_3)\nprint(var_4)\n", "fast_code": "var_6, var_9 = list(map(int, input().split()))\nvar_11 = [[] for var_2 in range(4)]\nvar_10 = None\nfor var_2 in range(var_6):\n var_12, var_8 = list(map(int, input().split()))\n if var_2 == 0:\n var_10 = var_12\n var_12 -= var_10\n var_11[var_12].append(var_8)\nfor var_2 in range(4):\n var_11[var_2].sort(reverse=True)\n var_7 = [0]\n for var_3 in var_11[var_2]:\n var_7.append(var_7[-1] + var_3)\n var_11[var_2] = var_7\nvar_1 = 0\nfor var_2 in range(len(var_11[0])):\n for var_3 in range(len(var_11[1])):\n for var_4 in range(len(var_11[2])):\n for var_5 in range(len(var_11[3])):\n if (\n var_9\n >= var_10 * (var_2 + var_3 + var_4 + var_5)\n + var_3\n + 2 * var_4\n + 3 * var_5\n ):\n var_1 = max(\n var_1,\n var_11[0][var_2]\n + var_11[1][var_3]\n + var_11[2][var_4]\n + var_11[3][var_5],\n )\nprint(var_1)\n", "slow_time": 7051948785, "fast_time": 78435664, "speedup": 89.9074, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_27"} -{"pair_id": "python_16492", "problem_id": "p03796", "language": "python", "slow_code": "import sys\nimport os\nimport math\n\nvar_1 = 1000000007\n\n\ndef func_1():\n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"input.txt\", \"r\")\n var_2 = int(sys.stdin.readline().rstrip())\n print((math.factorial(var_2) % var_1))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_3 = int(eval(input()))\nvar_1 = 1\nvar_2 = 1\nwhile var_2 < var_3 + 1:\n var_1 *= var_2\n var_2 += 1\n var_1 %= 10**9 + 7\nprint(var_1)\n", "slow_time": 27015242522, "fast_time": 4624202633, "speedup": 5.8421, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_16"} -{"pair_id": "python_11913", "problem_id": "p02549", "language": "python", "slow_code": "var_8 = 998244353\n\n\nclass Class_1:\n def __init__(self, var_9, var_3=None):\n self.n = var_9\n self.data = [0] * var_9\n if var_3:\n assert var_9 == len(var_3)\n for var_2 in range(var_9):\n self.add(var_2, var_3[var_2])\n\n def func_1(self, var_2, var_13):\n assert 0 <= var_2 < self.n\n var_2 += 1\n while var_2 <= self.n:\n self.data[var_2 - 1] = (var_13 + self.data[var_2 - 1]) % var_8\n var_2 += var_2 & -var_2\n\n def func_3(self, var_2, var_13):\n self.add(var_2, var_13 - self.sum(var_2, var_2 + 1))\n\n def func_2(self, var_7, var_10):\n assert 0 <= var_7 <= var_10 <= self.n\n if var_7 != 0:\n return (self.sum(0, var_10) - self.sum(0, var_7)) % var_8\n var_11 = 0\n while var_10 > 0:\n var_11 = (var_11 + self.data[var_10 - 1]) % var_8\n var_10 -= var_10 & -var_10\n return var_11\n\n\nvar_9, var_6 = list(map(int, input().split()))\nvar_12 = []\nfor _ in range(var_6):\n var_7, var_10 = list(map(int, input().split()))\n var_12.append((var_7, var_10))\nvar_1 = Class_1(var_9)\nvar_1.add(0, 1)\nfor var_2 in range(1, var_9):\n for var_7, var_10 in var_12:\n var_4 = var_2 - var_7\n var_5 = max(var_2 - var_10, 0)\n if var_4 < 0:\n continue\n var_1.add(var_2, var_1.sum(var_5, var_4 + 1) % var_8)\nprint((var_1.sum(var_9 - 1, var_9) % var_8))\n", "fast_code": "import sys\n\nvar_12 = sys.stdin.read\nvar_13 = sys.stdin.readline\nvar_14 = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nvar_1 = 1 << 60\nvar_4 = 998244353\n\n\ndef func_1():\n var_5, var_2, *var_3 = list(map(int, var_12().split()))\n var_9 = [(var_10, var_11) for var_10, var_11 in zip(*[iter(var_3)] * 2)]\n var_7 = [0] * (var_5 + 2)\n var_7[1] = 1\n var_7[2] = -1\n for var_8 in range(1, var_5 + 1):\n var_7[var_8] = (var_7[var_8] + var_7[var_8 - 1]) % var_4\n var_6 = var_7[var_8]\n for var_10, var_11 in var_9:\n if var_8 + var_10 <= var_5:\n var_7[var_8 + var_10] += var_6\n var_7[min(var_8 + var_11 + 1, var_5 + 1)] -= var_6\n print((var_7[var_5]))\n return\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 213589573, "fast_time": 66328330, "speedup": 3.2202, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_27"} -{"pair_id": "python_7705", "problem_id": "p02838", "language": "python", "slow_code": "var_8 = 1000000007\nvar_2 = 0\nvar_9 = int(eval(input()))\nvar_1 = [int(var_5) for var_5 in input().split()]\nvar_11 = [[0] * 63 for var_5 in range(var_9 + 1)]\nvar_7 = [(2**var_5) % var_8 for var_5 in range(63)]\nfor var_5 in range(var_9):\n var_4 = var_1[var_5]\n var_3 = 0\n for var_6 in range(63):\n if var_4 & 1:\n var_11[var_5 + 1][var_3] = var_11[var_5][var_3] + 1\n else:\n var_11[var_5 + 1][var_3] = var_11[var_5][var_3]\n var_3 += 1\n var_4 = var_4 >> 1\nfor var_5 in range(1, var_9):\n for var_6 in range(63):\n var_10 = var_11[var_5][var_6] - var_11[var_5 - 1][var_6]\n if var_10:\n var_2 += var_7[var_6] * (\n (var_9 - var_5) - (var_11[-1][var_6] - var_11[var_5][var_6])\n )\n else:\n var_2 += var_7[var_6] * (var_11[-1][var_6] - var_11[var_5][var_6])\n var_2 %= var_8\nprint(var_2)\n", "fast_code": "var_6 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_8 = [0 for var_4 in range(62)]\nfor var_4 in range(var_6):\n var_3 = bin(var_1[var_4])\n for var_4 in range(len(var_3) - 2):\n if var_3[-1 - var_4] == \"1\":\n var_8[-var_4 - 1] += 1\nvar_5 = 10**9 + 7\nvar_2 = 0\nvar_7 = 1\nfor var_4 in range(1, 62):\n var_2 = (var_2 + var_8[-var_4] * (var_6 - var_8[-var_4]) * var_7) % var_5\n var_7 = var_7 * 2 % var_5\nprint(var_2)\n", "slow_time": 280836259, "fast_time": 67740721, "speedup": 4.1458, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_4"} -{"pair_id": "python_6617", "problem_id": "p02770", "language": "python", "slow_code": "import sys, collections as cl, bisect as bs\n\nsys.setrecursionlimit(100000)\nvar_10 = sys.stdin.readline\nvar_15 = 10**9 + 7\nvar_1 = sys.maxsize\n\n\ndef func_6():\n return list(map(int, var_10().split()))\n\n\ndef func_10():\n return list(map(int, var_10().split()))\n\n\ndef func_12():\n return int(eval(var_10()))\n\n\ndef func_14(var_23):\n var_3 = []\n var_4 = var_23[0]\n var_22 = 1\n for var_9 in range(len(var_23) - 1):\n if var_4 != var_23[var_9 + 1]:\n var_3.append([var_4, var_22])\n var_4 = var_23[var_9 + 1]\n var_22 = 1\n else:\n var_22 += 1\n var_3.append([var_4, var_22])\n return var_3\n\n\ndef func_5(var_23):\n return \" \".join(map(str, var_23))\n\n\ndef func_11(var_23):\n return max(list(map(max, var_23)))\n\n\ndef func_1(var_23, var_3):\n var_13 = bs.bisect_left(var_3, var_23)\n if var_13 != len(var_3) and var_3[var_13] == var_23:\n return True\n else:\n return False\n\n\n\"\"\"\"\"\"\nvar_15 = 10**9 + 7\nvar_2 = 10**5 * 2\n\n\ndef func_2(var_16, var_21):\n if var_21 < 0 or var_21 > var_16:\n return 0\n var_21 = min(var_21, var_16 - var_21)\n return var_7[var_16] * var_8[var_21] * var_8[var_16 - var_21] % var_15\n\n\ndef func_13(var_16, var_21):\n if var_21 < 0 or var_21 > var_16:\n return 0\n return var_7[var_16] * var_8[var_16 - var_21] % var_15\n\n\nvar_7 = [1, 1]\nvar_8 = [1, 1]\nvar_11 = [0, 1]\nfor var_9 in range(2, var_2 + 1):\n var_7.append((var_7[-1] * var_9) % var_15)\n var_11.append((-var_11[var_15 % var_9] * (var_15 // var_9)) % var_15)\n var_8.append((var_8[-1] * var_11[-1]) % var_15)\n\nimport fractions\nfrom functools import reduce\n\n\ndef func_3(*var_17):\n return reduce(fractions.gcd, var_17)\n\n\ndef func_4(var_17):\n return reduce(fractions.gcd, var_17)\n\n\ndef func_8(var_23, var_24):\n return (var_23 * var_24) // fractions.gcd(var_23, var_24)\n\n\ndef func_7(*var_17):\n return reduce(func_8, var_17, 1)\n\n\ndef func_9(var_17):\n return reduce(func_8, var_17, 1)\n\n\nvar_13, var_20 = func_10()\nvar_6 = func_6()\nfor var_9 in range(var_20):\n var_16, var_23, var_14 = func_10()\n var_5 = 0\n var_18 = []\n for var_12 in range(var_13):\n var_18.append(var_6[var_12] % var_14 if var_6[var_12] % var_14 > 0 else var_14)\n \"\"\"\"\"\"\n var_19 = sum(var_18) * ((var_16 - 1) // var_13)\n var_19 += var_23\n for var_12 in range((var_16 - 1) % var_13):\n var_19 += var_18[var_12]\n var_5 += (var_19 // var_14) - (var_23 // var_14)\n print((var_16 - var_5 - 1))\n", "fast_code": "var_2, var_5 = list(map(int, input().split()))\nvar_1 = [int(var_7) for var_7 in input().split()]\nfor _ in range(var_5):\n var_4, var_6, var_3 = list(map(int, input().split()))\n var_9 = var_6 % var_3\n for var_8 in range(var_2):\n var_9 += ((var_1[var_8] - 1) % var_3 + 1) * ((var_4 - var_8 - 2) // var_2 + 1)\n print((var_4 - 1 - var_9 // var_3))\n", "slow_time": 57561469129, "fast_time": 38484533, "speedup": 1495.704, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_3"} -{"pair_id": "python_4519", "problem_id": "p02830", "language": "python", "slow_code": "def func_1():\n import sys\n\n var_2 = sys.stdin.readline\n sys.setrecursionlimit(10**7)\n from collections import Counter, deque\n\n from itertools import combinations, permutations, accumulate, groupby\n\n from bisect import bisect_left, bisect_right\n from heapq import heapify, heappop, heappush\n from math import floor, ceil\n\n var_3 = int(eval(var_2()))\n var_5, var_6 = var_2().rstrip().split()\n var_4 = \"\"\n for var_1 in range(var_3):\n var_4 += var_5[var_1]\n var_4 += var_6[var_1]\n print(var_4)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_3 = int(eval(input()))\nvar_4, var_5 = input().split()\nvar_2 = []\nfor var_1 in range(var_3):\n var_2 += var_4[var_1]\n var_2 += var_5[var_1]\nprint((\"\".join(var_2)))\n", "slow_time": 42041715, "fast_time": 20199637, "speedup": 2.0813, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_1"} -{"pair_id": "python_12878", "problem_id": "p03549", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_5 = 0.5**var_1\nvar_6 = 1 - var_5\nvar_3 = 0\nvar_7 = 0\nwhile True:\n var_4 = (\n (var_3 + 1) * (100 * (var_2 - var_1) + 1900 * var_1) * var_5 * (var_6**var_3)\n )\n if var_4 < 10 ** (-6):\n break\n var_7 += var_4\n var_3 += 1\nprint((int(var_7 + 1)))\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = 1900 * var_1 + 100 * (var_2 - var_1)\nprint((2**var_1 * var_3))\n", "slow_time": 95463640, "fast_time": 12391237, "speedup": 7.7041, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_3"} -{"pair_id": "python_10595", "problem_id": "p02982", "language": "python", "slow_code": "var_6, var_3 = list(map(int, input().split()))\nvar_1 = [list(map(int, input().split())) for _ in range(var_6)]\n\n\ndef func_1(var_8, var_9):\n var_3 = 0\n for var_4, var_5 in zip(var_8, var_9):\n var_3 += (var_4 - var_5) ** 2\n return var_3\n\n\nvar_7 = set([var_4 * var_4 for var_4 in range(10000)])\n\n\ndef func_2(var_8):\n return var_8 in var_7\n\n\nfrom itertools import combinations\n\nvar_2 = 0\nfor var_8, var_9 in combinations(var_1, 2):\n if func_2(func_1(var_8, var_9)):\n var_2 += 1\nprint(var_2)\n", "fast_code": "var_8, var_4 = list(map(int, input().split()))\nvar_9 = [list(map(int, input().split())) for var_6 in range(var_8)]\nvar_2 = 0\n\n\ndef func_1(var_1, var_3):\n var_5 = 0\n for var_6 in range(var_4):\n var_5 += (var_1[var_6] - var_3[var_6]) ** 2\n var_5 = var_5 ** (1 / 2)\n while var_5 > 0:\n var_5 -= 1\n if var_5 == 0:\n return True\n return False\n\n\nfor var_6 in range(var_8):\n for var_7 in range(var_6 + 1, var_8):\n if func_1(var_9[var_6], var_9[var_7]):\n var_2 += 1\nprint(var_2)\n", "slow_time": 242815463, "fast_time": 35223758, "speedup": 6.8935, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_3"} -{"pair_id": "python_6634", "problem_id": "p02770", "language": "python", "slow_code": "import sys, collections as cl, bisect as bs\n\nsys.setrecursionlimit(100000)\nvar_11 = sys.stdin.readline\nvar_16 = 10**9 + 7\nvar_1 = sys.maxsize\n\n\ndef func_6():\n return list(map(int, var_11().split()))\n\n\ndef func_10():\n return list(map(int, var_11().split()))\n\n\ndef func_12():\n return int(eval(var_11()))\n\n\ndef func_14(var_24):\n var_3 = []\n var_4 = var_24[0]\n var_23 = 1\n for var_10 in range(len(var_24) - 1):\n if var_4 != var_24[var_10 + 1]:\n var_3.append([var_4, var_23])\n var_4 = var_24[var_10 + 1]\n var_23 = 1\n else:\n var_23 += 1\n var_3.append([var_4, var_23])\n return var_3\n\n\ndef func_5(var_24):\n return \" \".join(map(str, var_24))\n\n\ndef func_11(var_24):\n return max(list(map(max, var_24)))\n\n\ndef func_1(var_24, var_3):\n var_14 = bs.bisect_left(var_3, var_24)\n if var_14 != len(var_3) and var_3[var_14] == var_24:\n return True\n else:\n return False\n\n\n\"\"\"\"\"\"\nvar_16 = 10**9 + 7\nvar_2 = 10**5 * 2\n\n\ndef func_2(var_17, var_22):\n if var_22 < 0 or var_22 > var_17:\n return 0\n var_22 = min(var_22, var_17 - var_22)\n return var_8[var_17] * var_9[var_22] * var_9[var_17 - var_22] % var_16\n\n\ndef func_13(var_17, var_22):\n if var_22 < 0 or var_22 > var_17:\n return 0\n return var_8[var_17] * var_9[var_17 - var_22] % var_16\n\n\nvar_8 = [1, 1]\nvar_9 = [1, 1]\nvar_12 = [0, 1]\nfor var_10 in range(2, var_2 + 1):\n var_8.append((var_8[-1] * var_10) % var_16)\n var_12.append((-var_12[var_16 % var_10] * (var_16 // var_10)) % var_16)\n var_9.append((var_9[-1] * var_12[-1]) % var_16)\n\nimport fractions\nfrom functools import reduce\n\n\ndef func_3(*var_18):\n return reduce(fractions.gcd, var_18)\n\n\ndef func_4(var_18):\n return reduce(fractions.gcd, var_18)\n\n\ndef func_8(var_24, var_25):\n return (var_24 * var_25) // fractions.gcd(var_24, var_25)\n\n\ndef func_7(*var_18):\n return reduce(func_8, var_18, 1)\n\n\ndef func_9(var_18):\n return reduce(func_8, var_18, 1)\n\n\nvar_14, var_21 = func_10()\nvar_7 = func_6()\nfor var_10 in range(var_21):\n var_17, var_24, var_15 = func_10()\n var_6 = 0\n var_19 = []\n for var_13 in range(var_14):\n\n var_19.append(var_7[var_13] % var_15)\n for var_13 in range(var_14):\n if var_19[var_13] == 0:\n var_5 = (var_17 - 1) // var_14\n if (var_17 - 1) % var_14 >= var_13 + 1:\n var_5 += 1\n var_6 += var_5\n var_20 = sum(var_19) * ((var_17 - 1) // var_14)\n var_20 += var_24\n for var_13 in range((var_17 - 1) % var_14):\n var_20 += var_19[var_13]\n var_6 += (var_20 // var_15) - (var_24 // var_15)\n print((var_17 - var_6 - 1))\n", "fast_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nvar_7 = 10**9 + 7\nvar_4 = float(\"inf\")\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\nvar_5, var_10 = func_2()\nvar_1 = func_2()\nvar_9 = [func_2() for _ in range(var_10)]\nfor var_8, var_13, var_6 in var_9:\n var_2 = list([(var_13 - 1) % var_6 + 1 for var_13 in var_1])\n var_3 = list(accumulate(var_2))\n var_11 = var_3[-1] * ((var_8 - 1) // var_5)\n if (var_8 - 1) % var_5 != 0:\n var_11 += var_3[(var_8 - 1) % var_5 - 1]\n var_12 = (var_11 + var_13 % var_6) // var_6\n print((var_8 - 1 - var_12))\n", "slow_time": 57571120536, "fast_time": 73722562, "speedup": 780.9159, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_8"} -{"pair_id": "python_5329", "problem_id": "p03997", "language": "python", "slow_code": "from collections import deque\nfrom heapq import heapify, heappop, heappush, heappushpop\nfrom copy import copy, deepcopy\nfrom itertools import product, permutations, combinations, combinations_with_replacement\nfrom collections import defaultdict, Counter\nfrom bisect import bisect_left, bisect_right\n\n\nfrom functools import reduce\nfrom pprint import pprint\n\nvar_1 = float(\"inf\")\n\n\ndef func_3():\n return list(map(int, input().split()))\n\n\ndef func_4(var_13):\n return [list(func_3()) for _ in range(var_13)]\n\n\ndef func_1(var_7, var_6):\n return [var_16[var_6] for var_16 in var_7]\n\n\ndef func_8(var_7, var_6, var_15):\n var_7.sort(key=lambda var_18: var_18[var_6], reverse=var_15)\n return var_7\n\n\ndef func_5(var_7):\n var_2 = -1 * float(\"inf\")\n for var_9 in range(len(var_7)):\n var_12 = max(var_7[var_9])\n var_2 = max(var_2, var_12)\n return var_2\n\n\ndef func_6(var_7):\n var_12 = float(\"inf\")\n for var_9 in range(len(var_7)):\n var_2 = min(var_7[var_9])\n var_12 = min(var_12, var_2)\n return var_12\n\n\ndef func_2(var_11, var_18):\n\n var_10 = bisect_left(var_11, var_18)\n var_14 = bisect_right(var_11, var_18)\n return var_14 - var_10\n\n\ndef func_7(var_11, var_17=True):\n if var_17:\n if len(var_11) == 0:\n print(\" \")\n elif type(var_11[0]) == str:\n print((\" \".join(var_11)))\n elif type(var_11[0]) == int:\n print((\" \".join(map(str, var_11))))\n else:\n print(\"Output Error\")\n else:\n if len(var_11) == 0:\n print(\"\")\n elif type(var_11[0]) == str:\n print((\"\".join(var_11)))\n elif type(var_11[0]) == int:\n print((\"\".join(map(str, var_11))))\n else:\n print(\"Output Error\")\n\n\nvar_3 = int(eval(input()))\nvar_5 = int(eval(input()))\nvar_8 = int(eval(input()))\nvar_4 = (var_3 + var_5) * var_8 / 2\nprint((int(var_4)))\n", "fast_code": "from collections import defaultdict\n\n\ndef func_1():\n var_1, var_2, var_3 = int(eval(input())), int(eval(input())), int(eval(input()))\n print(((var_1 + var_2) * var_3 // 2))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 157783046, "fast_time": 27240219, "speedup": 5.7923, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_9"} -{"pair_id": "python_2238", "problem_id": "p03281", "language": "python", "slow_code": "var_5 = int(eval(input()))\nvar_4 = []\nvar_1 = 0\nfor var_2 in range(var_5):\n for var_3 in range(var_2 + 1):\n if (var_2 + 1) % (var_3 + 1) == 0 and (var_2 + 1) % 2 != 0:\n var_4.append(var_2 + 1)\n if len(var_4) == 8:\n var_1 += 1\n if len(var_4) != 8:\n var_4.clear()\nprint(var_1)\n", "fast_code": "def func_1(var_4):\n var_2 = []\n for var_3 in range(1, int(var_4**0.5) + 1):\n if var_4 % var_3 == 0:\n var_2.append(var_3)\n if var_3 != var_4 // var_3:\n var_2.append(var_4 // var_3)\n return len(var_2)\n\n\nvar_4 = int(eval(input()))\nvar_1 = 0\nfor var_3 in range(1, var_4 + 1, 2):\n if func_1(var_3) == 8:\n var_1 += 1\nprint(var_1)\n", "slow_time": 118569525, "fast_time": 38652631, "speedup": 3.0676, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_18"} -{"pair_id": "python_3967", "problem_id": "p02607", "language": "python", "slow_code": "import sys\nfrom collections import deque\nimport numpy as np\nimport math\n\nsys.setrecursionlimit(10**6)\n\n\ndef func_4():\n return sys.stdin.readline().rstrip()\n\n\ndef func_5():\n return list(map(str, sys.stdin.readline().rstrip().split()))\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n var_3 = func_1()\n var_1 = list(func_2())\n var_2 = 0\n for var_4 in range(0, var_3, 2):\n if var_1[var_4] % 2:\n var_2 += 1\n print(var_2)\n return\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_4 = eval(input())\nvar_1 = 0\nfor var_2, var_3 in enumerate(map(int, input().split())):\n var_1 += ~var_2 & 1 and var_3 & 1\nprint(var_1)\n", "slow_time": 53007642, "fast_time": 18912831, "speedup": 2.8027, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_8"} -{"pair_id": "python_16503", "problem_id": "p02763", "language": "python", "slow_code": "import sys\n\nvar_11 = sys.stdin.readline\n\n\nclass Class_1:\n def __init__(self, var_13):\n self.size = var_13\n self.tree = [0] * (var_13 + 1)\n\n def func_2(self, var_10):\n if var_10 == 0:\n return 0\n var_15 = 0\n while var_10 > 0:\n var_15 += self.tree[var_10]\n var_10 -= var_10 & -var_10\n return var_15\n\n def func_1(self, var_10, var_17):\n while var_10 <= self.size:\n self.tree[var_10] += var_17\n var_10 += var_10 & -var_10\n\n\nvar_6 = \"abcdefghijklmnopqrstuvwxyz\"\nvar_2 = int(var_11().strip())\nvar_4 = list(var_11().strip())\nvar_3 = int(var_11().strip())\nvar_9 = dict()\nvar_1 = 5 * 10**5 + 2\nfor var_8 in var_6:\n var_9[var_8] = Class_1(var_1)\n for var_10, var_5 in enumerate(var_4):\n if var_5 == var_8:\n var_9[var_8].add(var_10 + 1, 1)\nfor _ in range(var_3):\n var_16, var_10, var_8 = var_11().split()\n var_16 = int(var_16)\n if var_16 == 1:\n var_10 = int(var_10)\n if var_4[var_10 - 1] != var_8:\n var_9[var_4[var_10 - 1]].add(var_10, -1)\n var_9[var_8].add(var_10, 1)\n var_4[var_10 - 1] = var_8\n else:\n\n var_12, var_14 = int(var_10), int(var_8)\n\n var_15 = 0\n for var_5 in var_6:\n var_7 = var_9[var_5]\n\n var_15 += var_7.sum(var_14) - var_7.sum(var_12 - 1) > 0\n print(var_15)\n", "fast_code": "var_6 = input\nvar_11, var_13, var_12 = int(var_6()), list(var_6()), int(var_6())\nvar_5 = {chr(97 + var_7): [] for var_7 in range(26)}\nfor var_7 in range(var_11):\n var_5[var_13[var_7]] += [var_7]\nfrom bisect import *\n\nfor var_7 in range(var_12):\n var_1, var_2, var_4 = var_6().split()\n var_2 = int(var_2) - 1\n if var_1 == \"1\":\n if var_13[var_2] == var_4:\n continue\n var_5[var_13[var_2]].pop(var_3(var_5[var_13[var_2]], var_2) - 1)\n var_13[var_2] = var_4\n var_8(var_5[var_4], var_2)\n else:\n var_14 = 0\n for var_9 in list(var_5.values()):\n var_10 = var_3(var_9, var_2 - 1)\n if var_10 < len(var_9) and var_9[var_10] < int(var_4):\n var_14 += 1\n print(var_14)\n", "slow_time": 565348597, "fast_time": 70275052, "speedup": 8.0448, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_2"} -{"pair_id": "python_12011", "problem_id": "p02716", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nfrom bisect import bisect_left, bisect_right\nimport sys, random, itertools, math\n\nsys.setrecursionlimit(10**5)\nvar_5 = sys.stdin.readline\nvar_8 = math.sqrt\n\n\ndef func_7():\n return list(map(int, var_5().split()))\n\n\ndef func_5():\n return list(map(float, var_5().split()))\n\n\ndef func_10():\n return list([int(var_9) - 1 for var_9 in var_5().split()])\n\n\ndef func_3():\n return int(eval(var_5()))\n\n\ndef func_2():\n return float(eval(var_5()))\n\n\ndef func_13():\n return var_5().rstrip()\n\n\ndef func_11():\n return func_13().split()\n\n\ndef func_4(var_7):\n return [func_3() for _ in range(var_7)]\n\n\ndef func_8(var_7):\n return [func_7() for _ in range(var_7)]\n\n\ndef func_1(var_7):\n return [func_2() for _ in range(var_7)]\n\n\ndef func_6(var_7):\n return [func_7() for _ in range(var_7)]\n\n\ndef func_9(var_7):\n return [func_10() for _ in range(var_7)]\n\n\ndef func_14(var_7):\n return [func_13() for _ in range(var_7)]\n\n\ndef func_12(var_7):\n return [func_11() for _ in range(var_7)]\n\n\nvar_6 = 1000000007\nvar_4 = float(\"INF\")\n\n\ndef func_15():\n var_7 = func_3()\n var_1 = func_7()\n if var_7 == 3:\n print((max(var_1)))\n return\n var_2 = [[-var_4] * 3 for var_3 in range(var_7 + 1)]\n var_2[0] = [0, 0, 0]\n var_2[1][0] = var_1[0]\n var_2[2][1] = var_1[1]\n for var_3 in range(3, var_7 + 1):\n var_2[var_3][0] = var_2[var_3 - 2][0] + var_1[var_3 - 1]\n var_2[var_3][1] = (\n max(var_2[var_3 - 2][1], var_2[var_3 - 3][0]) + var_1[var_3 - 1]\n )\n var_2[var_3][2] = (\n max(var_2[var_3 - 2][2], var_2[var_3 - 3][1], var_2[var_3 - 4][0])\n + var_1[var_3 - 1]\n )\n if var_7 & 1:\n print((max(var_2[-3][0], var_2[-2][1], var_2[-1][2])))\n else:\n print((max(var_2[-1][1], var_2[-2][0])))\n return\n\n\nif __name__ == \"__main__\":\n func_15()\n", "fast_code": "def func_1():\n from functools import lru_cache\n import sys\n\n sys.setrecursionlimit(10**7)\n var_5 = 2 * 10**14 + 1\n var_1 = int(eval(input()))\n (*var_2,) = list(map(int, input().split()))\n\n @lru_cache(maxsize=None)\n def func_2(var_4, var_6):\n \"\"\"\"\"\"\n if var_4 >= var_1:\n if var_6 == 0:\n return 0\n else:\n return -var_5\n var_7 = var_1 - var_4\n if (var_7 + 1) // 2 < var_6:\n return -var_5\n return max(\n var_2[var_4] + func_2(var_4 + 2, var_6 - 1), func_2(var_4 + 1, var_6)\n )\n\n var_3 = func_2(0, var_1 // 2)\n print(var_3)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 192340601, "fast_time": 59761629, "speedup": 3.2185, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_20"} -{"pair_id": "python_15779", "problem_id": "p03331", "language": "python", "slow_code": "var_6 = int(eval(input()))\nvar_3 = 10000\nfor var_1 in range(1, var_6):\n var_4 = 0\n var_5 = 0\n var_2 = var_6 - var_1\n while var_1 > 0:\n var_4 += var_1 % 10\n var_1 = var_1 // 10\n while var_2 > 0:\n var_5 += var_2 % 10\n var_2 = var_2 // 10\n var_3 = min(var_3, var_4 + var_5)\nprint(var_3)\n", "fast_code": "var_1 = int(eval(input()))\nif var_1 % 10 == 0:\n print((10))\nelse:\n print((sum(map(int, list(str(var_1))))))\n", "slow_time": 110311192, "fast_time": 17095953, "speedup": 6.4525, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_7"} -{"pair_id": "python_15926", "problem_id": "p03599", "language": "python", "slow_code": "var_1, var_2, var_3, var_4, var_5, var_6 = list(map(int, input().split()))\nvar_17 = set()\nfor var_13 in range(var_6 // (100 * var_1) + 1):\n var_16 = var_6 - 100 * var_13\n for var_14 in range(var_16 // (100 * var_2) + 1):\n var_7 = (var_1 * var_13 + var_2 * var_14) * 100\n var_17.add(var_7)\nvar_17.remove(0)\nvar_15 = set()\nvar_16 = var_5 * var_6 // 100\nfor var_13 in range(var_16 // var_3 + 1):\n for var_14 in range(var_16 // var_4 + 1):\n var_8 = var_3 * var_13 + var_4 * var_14\n if var_8 < var_16:\n var_15.add(var_8)\nvar_11 = -1\nvar_9 = -1\nvar_10 = -1\nfor var_7 in var_17:\n for var_8 in sorted(var_15):\n if var_7 + var_8 > var_6:\n break\n if var_8 > var_5 * var_7 // 100:\n break\n var_12 = 100 * var_8 / (var_7 + var_8)\n if var_12 > var_11:\n var_11 = var_12\n var_9 = var_7\n var_10 = var_8\nprint((var_9 + var_10, var_10))\n", "fast_code": "var_1, var_2, var_3, var_4, var_5, var_6 = list(map(int, input().split()))\n\n\ndef func_1():\n var_8 = (100 * var_1, 0)\n for var_7 in range(0, var_6, 100 * var_1):\n for var_9 in range(0, var_6, 100 * var_2):\n for var_10 in range(0, var_6, var_3):\n for var_11 in range(0, var_6, var_4):\n var_13, var_12 = (var_7 + var_9), (var_10 + var_11)\n if (\n var_13 == 0\n or var_13 + var_12 > var_6\n or 100 * var_12 > var_5 * var_13\n ):\n break\n elif 100 * var_12 == var_5 * var_13:\n return (var_13, var_12)\n elif var_12 * var_8[0] > var_8[1] * var_13:\n var_8 = (var_13, var_12)\n return var_8\n\n\nvar_8 = func_1()\nprint((sum(var_8), var_8[1]))\n", "slow_time": 932624651, "fast_time": 134120810, "speedup": 6.9536, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_27"} -{"pair_id": "python_14638", "problem_id": "p00789", "language": "python", "slow_code": "var_1 = 18\nvar_6 = [var_3**2 for var_3 in range(0, var_1)]\nvar_2 = [[0 for var_4 in range(600)] for var_3 in range(var_1)]\nvar_2[0][0] = 1\nfor var_3 in range(1, var_1):\n for var_5 in range(300):\n var_2[var_3][var_5] += var_2[var_3 - 1][var_5]\n for var_4 in range(var_6[var_3], 300, var_6[var_3]):\n var_2[var_3][var_5 + var_4] += var_2[var_3 - 1][var_5]\nwhile True:\n var_5 = int(eval(input()))\n if var_5 == 0:\n break\n print((var_2[var_1 - 1][var_5]))\n", "fast_code": "var_1 = [1] * 300\nfor var_2 in range(2, 18):\n for var_3 in range(var_2**2, 300):\n var_1[var_3] += var_1[var_3 - var_2**2]\nwhile True:\n var_4 = int(eval(input()))\n if var_4 == 0:\n break\n print((var_1[var_4]))\n", "slow_time": 13641756806, "fast_time": 312319986, "speedup": 43.6788, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_1"} -{"pair_id": "python_13363", "problem_id": "p02363", "language": "python", "slow_code": "def func_2(var_9, var_7):\n var_2 = len(var_9)\n var_11 = Class_2()\n for var_10 in range(var_2):\n for var_12 in range(var_2):\n if var_10 == var_12:\n var_9[var_10][var_12] = 0\n else:\n var_9[var_10][var_12] = var_11\n for var_6 in var_7:\n var_9[var_6.source][var_6.destination] = var_6.weight\n for var_13 in range(var_2):\n for var_10 in range(var_2):\n for var_12 in range(var_2):\n var_9[var_10][var_12] = min(\n var_9[var_10][var_12], var_9[var_10][var_13] + var_9[var_13][var_12]\n )\n for var_13 in range(var_2):\n for var_10 in range(var_2):\n for var_12 in range(var_2):\n if var_11 in (\n var_9[var_10][var_12],\n var_9[var_10][var_13],\n var_9[var_13][var_12],\n ):\n continue\n if (\n var_9[var_10][var_12]\n > var_9[var_10][var_13] + var_9[var_13][var_12]\n ):\n raise Class_3\n\n\ndef func_1():\n var_3, var_1 = list(map(int, input().split()))\n var_9 = [[None] * var_3 for _ in range(var_3)]\n var_7 = []\n for _ in range(var_1):\n var_15, var_17, var_4 = list(map(int, input().split()))\n var_7.append(Class_1(var_15, var_17, var_4))\n try:\n func_2(var_9, var_7)\n for var_8 in var_9:\n print(\" \".join(map(str, var_8)))\n except Class_3:\n print(\"NEGATIVE CYCLE\")\n\n\nclass Class_2(object):\n def __eq__(self, var_14):\n return var_14 is self\n\n def __lt__(self, var_14):\n return False\n\n def __gt__(self, var_14):\n return True\n\n def __add__(self, var_14):\n return self\n\n def __radd__(self, var_14):\n return self\n\n def __str__(self):\n return \"INF\"\n\n __repr__ = __str__\n\n\nclass Class_3(Exception):\n pass\n\n\nclass Class_1(object):\n def __init__(self, var_16, var_5, var_18):\n self.source = var_16\n self.destination = var_5\n self.weight = var_18\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "from sys import stdin\nfrom math import isinf\n\nvar_9, var_5 = list(map(int, stdin.readline().split()))\nvar_2 = [[float(\"inf\")] * var_9 for _ in range(var_9)]\nfor var_6 in range(var_9):\n var_2[var_6][var_6] = 0\nfor var_6 in range(var_5):\n var_10, var_11, var_1 = list(map(int, stdin.readline().split()))\n var_2[var_10][var_11] = var_1\nfor var_8 in range(var_9):\n for var_6 in range(var_9):\n for var_7 in range(var_9):\n if var_2[var_6][var_7] > var_2[var_6][var_8] + var_2[var_8][var_7]:\n var_2[var_6][var_7] = var_2[var_6][var_8] + var_2[var_8][var_7]\nfor var_6 in range(var_9):\n if var_2[var_6][var_6] < 0:\n print(\"NEGATIVE CYCLE\")\n exit(0)\nfor var_3 in var_2:\n print((\" \".join((\"INF\" if isinf(var_4) else str(var_4) for var_4 in var_3))))\n", "slow_time": 187926799, "fast_time": 92047175, "speedup": 2.0416, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_5"} -{"pair_id": "python_9817", "problem_id": "p03806", "language": "python", "slow_code": "from itertools import permutations\nimport sys\n\nsys.setrecursionlimit(10**6)\nfrom bisect import *\nfrom collections import *\nfrom heapq import *\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return map(int, sys.stdin.readline().split())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_7():\n return sys.stdin.readline()[:-1]\n\n\ndef func_4(var_17):\n return [func_2() for _ in range(var_17)]\n\n\nvar_10 = lambda var_20: int(var_20) - 1\n\n\ndef func_6():\n return map(var_10, sys.stdin.readline().split())\n\n\ndef func_3():\n return list(map(var_10, sys.stdin.readline().split()))\n\n\nvar_15 = lambda var_20: print(*var_20, sep=\"\\n\")\nvar_6 = [(1, 0), (0, 1), (-1, 0), (0, -1)]\n\n\ndef func_8():\n var_9 = 10**9\n var_14, var_12, var_13 = func_5()\n var_19 = []\n var_5 = []\n for _ in range(var_14):\n var_1, var_3, var_4 = func_5()\n var_19.append(var_1 * var_13 - var_3 * var_12)\n var_5.append(var_4)\n var_7 = [[var_9] * 8005 for _ in range(var_14 + 1)]\n for var_8 in range(var_14):\n var_18, var_4 = var_19[var_8], var_5[var_8]\n var_7[var_8 + 1][4000 + var_18] = min(var_7[var_8 + 1][4000 + var_18], var_4)\n for var_11 in range(8005):\n var_16 = var_7[var_8][var_11]\n if var_16 == var_9:\n continue\n var_7[var_8 + 1][var_11] = min(var_7[var_8 + 1][var_11], var_16)\n var_7[var_8 + 1][var_11 + var_18] = min(\n var_7[var_8 + 1][var_11 + var_18], var_16 + var_4\n )\n var_2 = var_7[-1][4000]\n if var_2 == var_9:\n print(-1)\n else:\n print(var_2)\n\n\nfunc_8()\n", "fast_code": "import sys\n\nvar_8 = lambda: sys.stdin.readline().rstrip()\nsys.setrecursionlimit(max(1000, 10**9))\nvar_23 = lambda var_24: sys.stdout.write(var_24 + \"\\n\")\nvar_15, var_13, var_14 = list(map(int, var_8().split()))\nvar_2 = [None] * var_15\nfor var_7 in range(var_15):\n var_1, var_4, var_5 = tuple(map(int, var_8().split()))\n var_2[var_7] = (var_1 * var_14 - var_4 * var_13, var_5)\nvar_2.sort()\n\n\ndef func_1(var_10):\n var_15 = len(var_10)\n var_16 = var_15 // 2\n var_17 = (var_15 + 1) // 2\n var_11 = []\n var_12 = []\n for var_4 in range(1, 1 << var_17):\n var_19, var_20 = 0, 0\n var_21, var_22 = 0, 0\n for var_7 in range(var_17):\n if var_4 & 1 << var_7:\n var_9 = var_10[var_16 + var_7]\n var_21 += var_9[0]\n var_22 += var_9[1]\n if var_4 < (1 << var_16) and var_7 < var_16:\n var_9 = var_10[var_7]\n var_19 += var_9[0]\n var_20 += var_9[1]\n if var_4 < (1 << var_16):\n var_11.append((var_19, var_20))\n var_12.append((var_21, var_22))\n return var_11, var_12\n\n\nvar_11, var_12 = func_1(var_2)\nvar_6 = {}\nfor var_18, var_5 in var_12:\n if var_18 in var_6:\n var_6[var_18] = min(var_6[var_18], var_5)\n else:\n var_6[var_18] = var_5\nvar_3 = float(\"inf\")\nfor var_18, var_5 in var_11:\n if var_18 == 0:\n var_3 = min(var_3, var_5)\nfor var_18, var_5 in var_12:\n if var_18 == 0:\n var_3 = min(var_3, var_5)\nfor var_18, var_5 in var_11:\n if -var_18 in var_6:\n var_3 = min(var_3, var_5 + var_6[-var_18])\nif var_3 == float(\"inf\"):\n var_3 = -1\nprint(var_3)\n", "slow_time": 340450294, "fast_time": 71119908, "speedup": 4.787, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_23"} -{"pair_id": "python_5495", "problem_id": "p02392", "language": "python", "slow_code": "import sys\n\nif __name__ == \"__main__\":\n import doctest\n\n doctest.testmod()\n var_1, var_2, var_3 = list(map(int, sys.stdin.read().split()))\n if var_1 < var_2 < var_3:\n print(\"Yes\")\n else:\n print(\"No\")\n", "fast_code": "var_4 = list(map(int, var_4().split()))\nvar_1 = var_4[0]\nvar_2 = var_4[1]\nvar_3 = var_4[2]\nif var_1 < var_2 and var_2 < var_3:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 3028838454, "fast_time": 17916304, "speedup": 169.0549, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_4"} -{"pair_id": "python_14209", "problem_id": "p00114", "language": "python", "slow_code": "from functools import reduce\n\n\ndef func_1(var_2, var_3):\n var_6, var_7 = var_2, var_3\n while var_7 != 0:\n var_6, var_7 = var_7, var_6 % var_7\n return var_2 / var_6 * var_3\n\n\nwhile 1:\n var_8 = list(map(int, input().split()))\n if any(var_8) == 0:\n break\n var_1 = []\n for var_5 in range(0, 6, 2):\n var_4 = 1\n while pow(var_8[var_5], var_4, var_8[var_5 + 1]) != 1:\n var_4 += 1\n var_1.append(var_4)\n var_8 = reduce(lambda var_2, var_3: func_1(var_2, var_3), var_1)\n print(var_8)\n", "fast_code": "def func_1(var_1, var_3):\n if var_3 == 0:\n return var_1\n return func_1(var_3, var_1 % var_3)\n\n\ndef func_2(var_2, var_9):\n var_10 = var_2 % var_9\n var_4 = 1\n while var_10 != 1:\n var_10 = var_2 * var_10 % var_9\n var_4 += 1\n return var_4\n\n\nwhile True:\n var_1 = list(map(int, input().split()))\n if var_1.count(0) == 6:\n break\n var_5 = func_2(var_1[0], var_1[1])\n var_7 = func_2(var_1[2], var_1[3])\n var_8 = func_2(var_1[4], var_1[5])\n var_6 = var_5 * var_7 // func_1(var_5, var_7)\n print((var_6 * var_8 // func_1(var_6, var_8)))\n", "slow_time": 1215695347, "fast_time": 198067977, "speedup": 6.1378, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_3"} -{"pair_id": "python_15115", "problem_id": "p02948", "language": "python", "slow_code": "var_8, var_7 = list(map(int, input().split()))\nvar_2 = [[] for _ in range(10**5)]\nfor var_5 in range(var_8):\n var_1, var_4 = list(map(int, input().split()))\n var_1 -= 1\n var_2[var_1].append(var_4)\nimport heapq\n\nvar_9 = []\nheapq.heapify(var_9)\nvar_3 = 0\nfor var_5 in range(var_7):\n if len(var_2[var_5]) != 0:\n for var_6 in range(len(var_2[var_5])):\n heapq.heappush(var_9, -1 * var_2[var_5][var_6])\n if len(var_9) != 0:\n var_3 += -1 * heapq.heappop(var_9)\nprint(var_3)\n", "fast_code": "import heapq\n\n\nclass Class_1:\n def __init__(self, var_6, var_8=False):\n if var_8:\n var_6 = [-var_4 for var_4 in var_6]\n self.sign = -1 if var_8 else 1\n self.hq = var_6\n heapq.heapify(self.hq)\n\n def func_1(self):\n return heapq.heappop(self.hq) * self.sign\n\n def func_2(self, var_4):\n heapq.heappush(self.hq, var_4 * self.sign)\n\n def func_4(self):\n return self.hq[0] * self.sign\n\n def func_3(self):\n return len(self.hq)\n\n\nvar_3, var_2 = list(map(int, input().split()))\nvar_1 = {var_9: [] for var_9 in range(1, var_2 + 1)}\nfor var_9 in range(var_3):\n var_4, var_7 = list(map(int, input().split()))\n if var_4 > var_2:\n continue\n var_1[var_4].append(var_7)\nvar_10 = Class_1([], True)\nvar_5 = 0\nfor var_4 in range(1, var_2 + 1):\n for var_7 in var_1[var_4]:\n var_10.push(var_7)\n if var_10.size() > 0:\n var_5 += var_10.pop()\nprint(var_5)\n", "slow_time": 3133712263, "fast_time": 89085164, "speedup": 35.1766, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_28"} -{"pair_id": "python_12926", "problem_id": "p03549", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_5 = 0.5**var_1\nvar_6 = 1 - var_5\nvar_3 = 0\nvar_7 = 0\nwhile True:\n var_4 = (\n (var_3 + 1) * (100 * (var_2 - var_1) + 1900 * var_1) * var_5 * (var_6**var_3)\n )\n if var_4 < 10 ** (-6):\n break\n var_7 += var_4\n var_3 += 1\nprint((int(var_7 + 1)))\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_4 = 1900 * var_1 + 100 * (var_2 - var_1)\nvar_3 = 1 / ((1 / 2) ** var_1)\nprint((int(var_4 * var_3)))\n", "slow_time": 95463640, "fast_time": 15127050, "speedup": 6.3108, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_12"} -{"pair_id": "python_6629", "problem_id": "p02770", "language": "python", "slow_code": "import sys, collections as cl, bisect as bs\n\nsys.setrecursionlimit(100000)\nvar_10 = sys.stdin.readline\nvar_15 = 10**9 + 7\nvar_1 = sys.maxsize\n\n\ndef func_6():\n return list(map(int, var_10().split()))\n\n\ndef func_10():\n return list(map(int, var_10().split()))\n\n\ndef func_12():\n return int(eval(var_10()))\n\n\ndef func_14(var_23):\n var_3 = []\n var_4 = var_23[0]\n var_22 = 1\n for var_9 in range(len(var_23) - 1):\n if var_4 != var_23[var_9 + 1]:\n var_3.append([var_4, var_22])\n var_4 = var_23[var_9 + 1]\n var_22 = 1\n else:\n var_22 += 1\n var_3.append([var_4, var_22])\n return var_3\n\n\ndef func_5(var_23):\n return \" \".join(map(str, var_23))\n\n\ndef func_11(var_23):\n return max(list(map(max, var_23)))\n\n\ndef func_1(var_23, var_3):\n var_13 = bs.bisect_left(var_3, var_23)\n if var_13 != len(var_3) and var_3[var_13] == var_23:\n return True\n else:\n return False\n\n\n\"\"\"\"\"\"\nvar_15 = 10**9 + 7\nvar_2 = 10**5 * 2\n\n\ndef func_2(var_16, var_21):\n if var_21 < 0 or var_21 > var_16:\n return 0\n var_21 = min(var_21, var_16 - var_21)\n return var_7[var_16] * var_8[var_21] * var_8[var_16 - var_21] % var_15\n\n\ndef func_13(var_16, var_21):\n if var_21 < 0 or var_21 > var_16:\n return 0\n return var_7[var_16] * var_8[var_16 - var_21] % var_15\n\n\nvar_7 = [1, 1]\nvar_8 = [1, 1]\nvar_11 = [0, 1]\nfor var_9 in range(2, var_2 + 1):\n var_7.append((var_7[-1] * var_9) % var_15)\n var_11.append((-var_11[var_15 % var_9] * (var_15 // var_9)) % var_15)\n var_8.append((var_8[-1] * var_11[-1]) % var_15)\n\nimport fractions\nfrom functools import reduce\n\n\ndef func_3(*var_17):\n return reduce(fractions.gcd, var_17)\n\n\ndef func_4(var_17):\n return reduce(fractions.gcd, var_17)\n\n\ndef func_8(var_23, var_24):\n return (var_23 * var_24) // fractions.gcd(var_23, var_24)\n\n\ndef func_7(*var_17):\n return reduce(func_8, var_17, 1)\n\n\ndef func_9(var_17):\n return reduce(func_8, var_17, 1)\n\n\nvar_13, var_20 = func_10()\nvar_6 = func_6()\nfor var_9 in range(var_20):\n var_16, var_23, var_14 = func_10()\n var_5 = 0\n var_18 = []\n for var_12 in range(var_13):\n var_18.append(var_6[var_12] % var_14 if var_6[var_12] % var_14 > 0 else var_14)\n \"\"\"\"\"\"\n var_19 = sum(var_18) * ((var_16 - 1) // var_13)\n var_19 += var_23\n for var_12 in range((var_16 - 1) % var_13):\n var_19 += var_18[var_12]\n var_5 += (var_19 // var_14) - (var_23 // var_14)\n print((var_16 - var_5 - 1))\n", "fast_code": "def func_2():\n from itertools import islice, tee\n\n var_10, var_14 = map(int, input().split())\n (*var_2,) = map(int, input().split())\n for var_4 in tee(var_2, var_14):\n var_13, var_17, var_12 = map(int, input().split())\n var_4 = map(lambda var_17: var_17 % var_12, var_4)\n var_5, var_6, var_7 = tee(var_4, 3)\n var_15, var_16 = divmod(var_13 - 1, var_10)\n var_11 = var_17 + (sum(var_5) * var_15) + sum(islice(var_6, 0, var_16))\n var_3 = sum(\n var_15 + (1 if var_9 < var_16 else 0)\n for var_9, var_8 in enumerate(var_7)\n if var_8 == 0\n )\n var_1 = (var_13 - 1) - var_3 - (var_11 // var_12 - var_17 // var_12)\n yield var_1\n\n\ndef func_1():\n print(*func_2(), sep=\"\\n\")\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 57561469129, "fast_time": 70556674, "speedup": 815.8189, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_1"} -{"pair_id": "python_17403", "problem_id": "p02834", "language": "python", "slow_code": "from collections import defaultdict, deque, Counter, OrderedDict\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce, lru_cache\nfrom heapq import heappush, heappop, heapify\nimport itertools\nimport math, fractions\nimport sys, copy\n\n\ndef func_3():\n return sys.stdin.readline().split()\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_11():\n return list(sys.stdin.readline().rstrip())\n\n\ndef func_4():\n return [int(var_29) for var_29 in sys.stdin.readline().split()]\n\n\ndef func_5():\n return [int(var_29) - 1 for var_29 in sys.stdin.readline().split()]\n\n\ndef func_9():\n return [list(var_29) for var_29 in sys.stdin.readline().split()]\n\n\ndef func_2(var_22):\n return [func_1() for _ in range(var_22)]\n\n\ndef func_6(var_22):\n return [func_4() for _ in range(var_22)]\n\n\ndef func_7(var_22):\n return [func_5() for _ in range(var_22)]\n\n\ndef func_12(var_22):\n return [func_11() for _ in range(var_22)]\n\n\ndef func_10(var_22):\n return [func_9() for _ in range(var_22)]\n\n\ndef func_8(var_22):\n return [func_3() for _ in range(var_22)]\n\n\ndef func_19(var_22, var_25):\n return math.factorial(var_22) // math.factorial(var_25)\n\n\ndef func_14(var_22, var_25):\n return math.factorial(var_22) // (\n math.factorial(var_25) * math.factorial(var_22 - var_25)\n )\n\n\ndef func_17(var_22, *var_8, var_11=0):\n return (\n [func_17(*var_8, default=var_11) for _ in range(var_22)]\n if len(var_8) > 0\n else [var_11 for _ in range(var_22)]\n )\n\n\ndef func_18(var_26, var_17):\n var_23, var_10, var_12, var_24 = (\n [-1] * len(var_17),\n func_17(len(var_17), 0),\n [-1] * len(var_17),\n deque([var_26]),\n )\n var_12[var_26] = 0\n while var_24:\n var_18 = var_24.popleft()\n for var_19 in var_17[var_18]:\n if var_12[var_19] != -1:\n var_23[var_18] = var_19\n else:\n var_12[var_19] = var_12[var_18] + 1\n var_10[var_18].append(var_19), var_24.append(var_19)\n return var_23, var_10, var_12\n\n\ndef func_13(var_5, var_16):\n var_17 = func_17(var_5, 0)\n for var_6, var_9 in var_16:\n var_17[var_6].append(var_9), var_17[var_9].append(var_6)\n return var_17\n\n\nsys.setrecursionlimit(1000000)\nvar_13, var_14 = [[1, 0], [0, 1], [-1, 0], [0, -1]], [\n [1, 0],\n [1, 1],\n [0, 1],\n [-1, 1],\n [-1, 0],\n [-1, -1],\n [0, -1],\n [1, -1],\n]\nvar_7, var_2 = \"abcdefghijklmnopqrstuvwxyz\", \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nvar_4, var_3 = 1000000007, float(\"inf\")\n\n\ndef func_16():\n var_5, var_27, var_28 = func_4()\n var_1 = func_7(var_5 - 1)\n var_20 = [None] * var_5\n var_17 = func_13(var_5, var_1)\n var_23, var_10, var_12 = func_18(var_28 - 1, var_17)\n\n def func_15(var_18):\n var_15 = max([0] + [func_15(var_19) for var_19 in var_10[var_18]])\n var_20[var_18] = var_15\n return var_15 + 1\n\n var_21 = var_27 - 1\n for _ in range((var_12[var_27 - 1] - 1) // 2):\n var_21 = var_23[var_21]\n func_15(var_21)\n print((var_12[var_21] + var_20[var_21] - 1))\n\n\nif __name__ == \"__main__\":\n func_16()\n", "fast_code": "def func_1(var_9):\n var_11 = [var_9]\n var_4 = [-1] * var_8\n var_4[var_9] = 0\n while len(var_11):\n var_13 = var_11.pop()\n for var_5 in var_10[var_13]:\n if var_4[var_5] == -1:\n var_4[var_5] = var_4[var_13] + 1\n var_11.append(var_5)\n return var_4\n\n\nvar_8, var_12, var_13 = list(map(int, input().split()))\nvar_12 -= 1\nvar_13 -= 1\nvar_10 = [[] for var_5 in range(var_8)]\nfor _ in range(var_8 - 1):\n var_1, var_3 = (int(var_14) for var_14 in input().split())\n var_10[var_3 - 1].append(var_1 - 1)\n var_10[var_1 - 1].append(var_3 - 1)\nvar_6 = func_1(var_12)\nvar_7 = func_1(var_13)\nvar_2 = 0\nfor var_5 in range(var_8):\n if var_6[var_5] < var_7[var_5]:\n var_2 = max(var_7[var_5] - 1, var_2)\nprint(var_2)\n", "slow_time": 140582903, "fast_time": 40643082, "speedup": 3.459, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_19"} -{"pair_id": "python_14054", "problem_id": "p02244", "language": "python", "slow_code": "from sys import stdin\nfrom itertools import permutations as per\n\n\ndef func_1(var_12):\n for var_14, var_4 in var_12:\n if not all(\n (var_14 == var_15 and var_4 == var_5)\n or (var_14 + var_4 != var_15 + var_5 and var_14 - var_4 != var_15 - var_5)\n for var_15, var_5 in var_12\n ):\n return False\n return True\n\n\nvar_8 = int(stdin.readline())\nvar_2, var_1 = [[var_6 for var_6 in range(8)] for _ in range(2)]\nvar_10 = []\nfor _ in range(var_8):\n var_13, var_3 = list(map(int, stdin.readline().split()))\n var_10.append((var_13, var_3))\n var_2.remove(var_13)\n var_1.remove(var_3)\nfor var_9 in per(var_1):\n var_11 = var_10[:] + [(var_13, var_3) for var_13, var_3 in zip(var_2, var_9)]\n if func_1(var_11):\n for var_6, var_7 in sorted(var_11):\n print((\".\" * var_7 + \"Q\" + \".\" * (8 - var_7 - 1)))\n break\n", "fast_code": "var_12 = [False] * 8\nvar_3 = [False] * 8\nvar_5 = [False] * 15\nvar_4 = [False] * 15\nvar_1 = [[\".\", \".\", \".\", \".\", \".\", \".\", \".\", \".\"] for var_7 in range(8)]\nimport sys\n\nvar_6 = sys.stdin\nvar_9 = int(var_6.readline())\nfor var_10 in var_6:\n var_11, var_2 = list(map(int, var_10.split()))\n var_12[var_11] = True\n var_3[var_2] = True\n var_5[var_11 + var_2] = True\n var_4[var_11 - var_2 + 7] = True\n var_1[var_11][var_2] = \"Q\"\n\n\ndef func_1(var_7=0):\n if var_7 == 8:\n for var_10 in var_1:\n print((\"\".join(var_10)))\n elif var_12[var_7]:\n func_1(var_7 + 1)\n else:\n for var_8 in range(8):\n if var_3[var_8] or var_5[var_7 + var_8] or var_4[var_7 - var_8 + 7]:\n continue\n var_12[var_7] = True\n var_3[var_8] = True\n var_5[var_7 + var_8] = True\n var_4[var_7 - var_8 + 7] = True\n var_1[var_7][var_8] = \"Q\"\n func_1(var_7 + 1)\n var_12[var_7] = False\n var_3[var_8] = False\n var_5[var_7 + var_8] = False\n var_4[var_7 - var_8 + 7] = False\n var_1[var_7][var_8] = \".\"\n\n\nfunc_1()\n", "slow_time": 419773437, "fast_time": 98153700, "speedup": 4.2767, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_9"} -{"pair_id": "python_9120", "problem_id": "p03837", "language": "python", "slow_code": "import sys\n\nvar_11 = sys.stdin.readline\n\n\nvar_3, var_2 = list(map(int, var_11().split()))\nvar_1 = [list(map(int, var_11().split())) for _ in range(var_2)]\nvar_10 = [[0 for _ in range(var_3)] for _ in range(var_3)]\nfor var_4, var_6, var_7 in var_1:\n var_10[var_4 - 1][var_6 - 1] = var_7\nfrom scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall\n\nvar_8 = csgraph_from_dense(var_10)\nvar_9 = floyd_warshall(var_8, directed=False)\nvar_5 = 0\nfor var_4, var_6, var_7 in var_1:\n if var_7 != var_9[var_4 - 1][var_6 - 1]:\n var_5 += 1\nprint(var_5)\n", "fast_code": "from collections import defaultdict\nimport heapq\n\n\ndef func_1():\n var_16, var_6 = list(map(int, input().split()))\n var_5 = [list(map(int, input().split())) for var_10 in range(var_6)]\n var_8 = defaultdict(set)\n var_22 = defaultdict(int)\n for var_10 in range(var_6):\n var_1, var_3, var_4 = var_5[var_10]\n var_8[var_1].add(var_3)\n var_8[var_3].add(var_1)\n var_22[(var_1, var_3)] = var_4\n var_22[(var_3, var_1)] = var_4\n\n var_11 = 10**5 + 1\n var_13 = [[var_11 for var_10 in range(var_16 + 1)] for var_12 in range(var_16 + 1)]\n for var_10 in range(1, var_16 + 1):\n var_20 = [0 for var_10 in range(var_16 + 1)]\n var_20[var_10] = 1\n var_13[var_10][var_10] = 0\n\n var_9 = []\n for var_7 in var_8[var_10]:\n var_21 = var_22[(var_10, var_7)]\n heapq.heappush(var_9, (var_21, var_7, var_10))\n while len(var_9) > 0:\n var_18, var_17, var_19 = heapq.heappop(var_9)\n\n if var_20[var_17]:\n continue\n var_20[var_17] = 1\n var_13[var_10][var_17] = var_13[var_10][var_19] + var_22[(var_19, var_17)]\n\n for var_14 in var_8[var_17]:\n if var_20[var_14]:\n continue\n var_15 = var_22[(var_17, var_14)] + var_13[var_10][var_17]\n heapq.heappush(var_9, (var_15, var_14, var_17))\n\n var_2 = 0\n for var_10 in range(var_6):\n var_1, var_3, var_4 = var_5[var_10]\n if var_4 > var_13[var_1][var_3]:\n var_2 += 1\n print(var_2)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 14541236116, "fast_time": 72981998, "speedup": 199.2441, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_1"} -{"pair_id": "python_691", "problem_id": "p03244", "language": "python", "slow_code": "def func_1():\n var_4, *var_6 = list(map(int, open(0).read().split()))\n var_1 = [0] * int(1e5)\n var_2 = [0] * int(1e5)\n for var_3, var_5 in zip(*[iter(var_6)] * 2):\n var_1[var_3 - 1] += 1\n var_2[var_5 - 1] += 1\n if var_1.index(max(var_1)) == var_2.index(max(var_2)):\n var_7 = max(var_1)\n var_8 = max(var_2)\n var_1[var_1.index(var_7)] = 0\n var_2[var_2.index(var_8)] = 0\n print((min(var_4 - var_7 - max(var_2), var_4 - var_8 - max(var_1))))\n else:\n print((var_4 - max(var_1) - max(var_2)))\n return\n\n\nfunc_1()\n", "fast_code": "import collections as coll\n\nvar_3 = int(eval(input()))\nvar_6 = list(map(int, input().split()))\nvar_1 = var_6[0::2]\nvar_4 = var_6[1::2]\nvar_5 = coll.Counter(var_4).most_common()[:2]\nvar_2 = coll.Counter(var_1).most_common()[:2]\nif len(var_5) == 1:\n var_5.append((0, 0))\nif len(var_2) == 1:\n var_2.append((0, 0))\nif var_5[0][0] != var_2[0][0]:\n print((var_3 - var_5[0][1] - var_2[0][1]))\nelse:\n print((min(var_3 - var_5[0][1] - var_2[1][1], var_3 - var_5[1][1] - var_2[0][1])))\n", "slow_time": 2695635546, "fast_time": 57579385, "speedup": 46.816, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_14"} -{"pair_id": "python_6762", "problem_id": "p00467", "language": "python", "slow_code": "for var_5 in iter(input, \"0 0\"):\n var_2, var_1 = list(map(int, var_5.split()))\n var_6, var_7 = 1, 0\n var_3 = [int(eval(input())) for _ in [0] * var_2]\n for var_4 in [int(eval(input())) for _ in [0] * var_1]:\n var_7 += var_4 if var_2 <= var_7 + var_4 else var_4 + var_3[var_7 + var_4]\n if var_2 <= var_7 + 1:\n break\n var_6 += 1\n print(var_6)\n", "fast_code": "def func_1():\n import sys\n\n var_8 = sys.stdin.readline\n for var_5 in iter(var_8, \"0 0\\n\"):\n var_2, var_1 = list(map(int, var_5.split()))\n var_6, var_7 = 1, 0\n var_3 = [int(var_8()) for _ in [0] * var_2]\n for var_4 in [int(var_8()) for _ in [0] * var_1]:\n var_7 += var_4 if var_2 <= var_7 + var_4 else var_4 + var_3[var_7 + var_4]\n if var_2 <= var_7 + 1:\n break\n var_6 += 1\n print(var_6)\n\n\nif \"__main__\" == __name__:\n func_1()\n", "slow_time": 112051390, "fast_time": 41733555, "speedup": 2.6849, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_1"} -{"pair_id": "python_18532", "problem_id": "p03409", "language": "python", "slow_code": "var_9 = 201\n\n\ndef func_1(var_2):\n global vis\n global EE\n var_14[var_2] = 1\n if var_2 == var_9:\n return 1\n for var_4 in range(var_9 + 1):\n if var_14[var_4] == 0 and var_1[var_2][var_4] > 0 and func_1(var_4) > 0:\n var_1[var_2][var_4] -= 1\n var_1[var_4][var_2] += 1\n return 1\n return 0\n\n\nvar_6 = int(eval(input()))\nvar_12 = []\nvar_13 = []\nfor var_4 in range(var_6):\n var_12.append([int(var_4) for var_4 in input().split()])\nfor var_4 in range(var_6):\n var_13.append([int(var_4) for var_4 in input().split()])\nvar_12.sort(key=lambda var_15: (var_15[0], var_15[1]))\nvar_13.sort(key=lambda var_15: (var_15[0], var_15[1]))\nvar_10 = []\nfor var_4 in range(len(var_12)):\n var_11 = []\n for var_5 in range(var_6):\n if var_12[var_5][0] < var_13[var_4][0] and var_12[var_5][1] < var_13[var_4][1]:\n var_11.append(var_5)\n var_10.append(var_11)\nvar_10.sort(key=lambda var_15: len(var_15))\n\n\nvar_1 = [[0 for var_15 in range(var_9 + 1)] for var_16 in range(var_9 + 11)]\nvar_14 = [0] * (var_9 + 1)\nfor var_4 in range(len(var_10)):\n var_1[0][var_4 + 1] = 1\n var_1[var_4 + 1][0] = 1\nfor var_4 in range(var_6):\n var_1[var_4 + 101][var_9] = 1\nfor var_4 in range(len(var_10)):\n for var_5 in range(len(var_10[var_4])):\n var_7, var_8 = var_4 + 1, var_10[var_4][var_5] + 101\n\n var_1[var_7][var_8] = 1\n\nvar_3 = 0\nwhile 1:\n for var_4 in range(0, var_9 + 1):\n var_14[var_4] = 0\n if func_1(0) == 0:\n break\n var_3 += 1\nprint(var_3)\n", "fast_code": "from operator import itemgetter\n\n\ndef func_1():\n var_1 = int(eval(input()))\n var_2 = [tuple(int(var_8) for var_8 in input().split()) for var_7 in range(var_1)]\n var_6 = [tuple(int(var_8) for var_8 in input().split()) for var_7 in range(var_1)]\n\n var_2.sort(key=itemgetter(1), reverse=True)\n\n var_6.sort(key=itemgetter(0))\n var_3 = 0\n for var_4, var_5 in var_6:\n for var_9, var_10 in var_2:\n if var_9 < var_4 and var_10 < var_5:\n var_2.remove((var_9, var_10))\n var_3 += 1\n break\n print(var_3)\n return\n\n\nfunc_1()\n", "slow_time": 579236453, "fast_time": 64637519, "speedup": 8.9613, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_29"} -{"pair_id": "python_8842", "problem_id": "p03371", "language": "python", "slow_code": "var_1, var_2, var_3, var_4, var_5 = list(map(int, input().split()))\nvar_6 = var_1 * var_4 + var_2 * var_5\nfor var_7 in range(2 * max(var_4, var_5) + 1):\n var_6 = min(\n var_6,\n 2 * var_3 * var_7\n + var_1 * max(0, var_4 - var_7)\n + var_2 * max(0, var_5 - var_7),\n )\nprint(var_6)\n", "fast_code": "import math\n\nvar_1, var_2, var_3, var_4, var_5 = list(map(int, input().split()))\nvar_6 = []\nvar_6.append(var_1 * var_4 + var_2 * var_5)\nfor var_7 in range(2 * min(var_4, var_5), 2 * max(var_4, var_5) + 1):\n var_6.append(\n var_3 * var_7\n + max(0, math.ceil(var_4 - var_7 / 2) * var_1)\n + max(0, math.ceil(var_5 - var_7 / 2) * var_2)\n )\nprint((min(var_6)))\n", "slow_time": 2119044393, "fast_time": 265456712, "speedup": 7.9826, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_18"} -{"pair_id": "python_3599", "problem_id": "p02934", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\nvar_3 = 10**20\nvar_5 = 10**9 + 7\nvar_1 = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nvar_2 = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef func_2():\n return [int(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_3():\n return [int(var_8) - 1 for var_8 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_4():\n return sys.stdin.readline().split()\n\n\ndef func_5():\n return eval(input())\n\n\ndef func_6():\n var_6 = func_1()\n var_4 = func_2()\n var_7 = 0\n for var_8 in var_4:\n var_7 += 1 / var_8\n return 1 / var_7\n\n\nprint((func_6()))\n", "fast_code": "def func_1():\n return list(map(int, input().split()))\n\n\nvar_1 = int(eval(input()))\nprint((1 / sum([1 / var_2 for var_2 in func_1()])))\n", "slow_time": 79645167, "fast_time": 21355077, "speedup": 3.7296, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_20"} -{"pair_id": "python_13834", "problem_id": "p02956", "language": "python", "slow_code": "import sys\n\nvar_22 = sys.stdin.readline\n\n\nclass Class_1:\n\n def __init__(self, var_21):\n self.size = var_21\n self.tree = [0] * (var_21 + 1)\n self.p = 2 ** (var_21.bit_length() - 1)\n self.dep = var_21.bit_length()\n\n def func_4(self, var_18):\n var_23 = 0\n while var_18 > 0:\n var_23 += self.tree[var_18]\n var_18 -= var_18 & -var_18\n return var_23\n\n def func_1(self, var_18, var_27):\n while var_18 <= self.size:\n self.tree[var_18] += var_27\n var_18 += var_18 & -var_18\n\n def func_2(self, var_26):\n if var_26 <= 0:\n return -1\n var_23 = 0\n var_19 = self.p\n for _ in range(self.dep):\n if var_23 + var_19 <= self.size and self.tree[var_23 + var_19] < var_26:\n var_23 += var_19\n var_26 -= self.tree[var_23 + var_19]\n var_19 //= 2\n return var_23 + 1\n\n\ndef func_3(var_5):\n var_6 = list(set(var_5))\n var_6.sort()\n var_3 = {var_26: var_19 for var_19, var_26 in enumerate(var_6)}\n return var_6, var_3\n\n\nvar_7 = 998244353\nvar_8 = int(var_22())\nvar_13 = [list(map(int, var_22().split())) for _ in range(var_8)]\nvar_13.sort()\nvar_14 = [-(10**10)]\nfor var_27, var_28 in var_13:\n var_14.append(var_28)\n_, var_4 = func_3(var_14)\nvar_13 = [(var_27, var_4[var_28]) for var_27, var_28 in var_13]\nvar_11, var_10, var_2, var_1 = (\n [None] * var_8,\n [None] * var_8,\n [None] * var_8,\n [None] * var_8,\n)\nvar_12 = Class_1(var_8)\nfor var_18 in range(var_8):\n var_19 = var_18\n var_28 = var_13[var_18][1]\n var_20 = var_12.get(var_28)\n var_11[var_18] = var_20\n var_10[var_18] = var_19 - var_20\n var_12.add(var_28, 1)\nvar_12 = Class_1(var_8)\nfor var_18 in range(var_8 - 1, -1, -1):\n var_19 = var_8 - 1 - var_18\n var_28 = var_13[var_18][1]\n var_20 = var_12.get(var_28)\n var_2[var_18] = var_20\n var_1[var_18] = var_19 - var_20\n var_12.add(var_28, 1)\nvar_9 = [1] * 1341398\nfor var_18 in range(1, len(var_9)):\n var_9[var_18] = var_9[var_18 - 1] * 2 % var_7\nvar_15 = 0\nfor var_18 in range(var_8):\n var_25 = var_11[var_18]\n var_24 = var_10[var_18]\n var_17 = var_2[var_18]\n var_16 = var_1[var_18]\n var_15 = (var_15 + var_9[var_8 - 1]) % var_7\n var_15 = (\n var_15\n + var_9[var_8 - 1 - var_25 - var_16] * (var_9[var_25] - 1) * (var_9[var_16] - 1)\n ) % var_7\n var_15 = (\n var_15\n + var_9[var_8 - 1 - var_24 - var_17] * (var_9[var_24] - 1) * (var_9[var_17] - 1)\n ) % var_7\n var_15 = (\n var_15\n - (var_9[var_24] - 1)\n * (var_9[var_17] - 1)\n * (var_9[var_25] - 1)\n * (var_9[var_16] - 1)\n ) % var_7\nprint(var_15)\n", "fast_code": "import sys\n\nvar_18 = sys.stdin.readline\nsys.setrecursionlimit(10**7)\nvar_5 = 998244353\nvar_6 = int(eval(var_18()))\nvar_12 = [[int(var_22) for var_22 in var_18().split()] for _ in range(var_6)]\nvar_12.sort()\nvar_11, var_13 = list(zip(*var_12))\nvar_14 = {var_22: var_17 for var_17, var_22 in enumerate(sorted(var_13), 1)}\n\n\ndef func_2(var_21, var_22):\n while var_22 <= var_6:\n var_21[var_22] += 1\n var_22 += var_22 & (-var_22)\n\n\ndef func_1(var_21, var_22):\n var_20 = 0\n while var_22:\n var_20 += var_21[var_22]\n var_22 -= var_22 & (-var_22)\n return var_20\n\n\nvar_19 = [1]\nfor _ in range(var_6):\n var_19.append(var_19[-1] * 2 % var_5)\nvar_15 = 0\nvar_21 = [0] * (var_6 + 1)\nfor var_2, (var_22, var_23) in enumerate(var_12):\n var_23 = var_14[var_23]\n var_7 = var_6 - 1 - var_2\n var_1 = var_23 - 1\n var_10 = var_6 - 1 - var_1\n var_3 = func_1(var_21, var_23)\n func_2(var_21, var_23)\n var_4 = var_2 - var_3\n var_8 = var_1 - var_3\n var_9 = var_7 - var_8\n\n var_16 = var_19[var_6]\n var_16 -= var_19[var_2]\n var_16 -= var_19[var_7]\n var_16 -= var_19[var_1]\n var_16 -= var_19[var_10]\n var_16 += var_19[var_3]\n var_16 += var_19[var_4]\n var_16 += var_19[var_8]\n var_16 += var_19[var_9]\n var_16 -= 1\n var_15 += var_16\nvar_15 %= var_5\nprint(var_15)\n", "slow_time": 123554763668, "fast_time": 110527029, "speedup": 1117.8692, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_4"} -{"pair_id": "python_13690", "problem_id": "p03774", "language": "python", "slow_code": "from scipy.spatial.distance import cdist\nimport numpy as np\n\nvar_6, var_5 = list(map(int, input().split()))\nvar_7 = [list(map(int, input().split())) for _ in range(var_6)]\nvar_2 = [list(map(int, input().split())) for _ in range(var_5)]\n\n\nvar_1 = cdist(var_7, var_2, \"cityblock\")\nvar_4 = np.argmin(var_1, axis=1)\nfor var_3 in var_4:\n print((var_3 + 1))\n", "fast_code": "import numpy as np\n\nvar_10, var_9 = map(int, input().split())\nvar_2 = []\nfor _ in range(var_10):\n var_1, var_3 = map(int, input().split())\n var_2.append((var_1, var_3))\nvar_11 = np.zeros([var_9, var_10], dtype=np.int64)\nvar_5 = []\nfor var_7 in range(var_9):\n var_4, var_6 = map(int, input().split())\n for var_8, (var_1, var_3) in enumerate(var_2):\n var_11[var_7, var_8] = abs(var_1 - var_4) + abs(var_3 - var_6)\nprint(*var_11.argmin(axis=0) + 1, sep=\"\\n\")\n", "slow_time": 29997139149, "fast_time": 50967546, "speedup": 588.5537, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_9"} -{"pair_id": "python_16193", "problem_id": "p03721", "language": "python", "slow_code": "import sys\n\nvar_8 = [0] * 100000\nvar_7, var_6 = [int(var_9) for var_9 in sys.stdin.readline().split()]\nfor var_4 in range(var_7):\n var_1, var_2 = [int(var_9) for var_9 in sys.stdin.readline().split()]\n var_8[var_1 - 1] += var_2\nvar_3 = 0\nfor var_4, var_5 in enumerate(var_8):\n var_3 += var_5\n if var_3 >= var_6:\n print((var_4 + 1))\n break\n", "fast_code": "var_5, var_3 = list(map(int, input().split()))\nvar_4 = []\nfor _ in range(var_5):\n var_1, var_2 = list(map(int, input().split()))\n var_4.append([var_1, var_2])\nvar_4.sort()\nfor var_1, var_2 in var_4:\n var_3 -= var_2\n if var_3 <= 0:\n print(var_1)\n break\n", "slow_time": 225902069, "fast_time": 28481628, "speedup": 7.9315, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_25"} -{"pair_id": "python_6335", "problem_id": "p03719", "language": "python", "slow_code": "import functools\nimport os\nimport sys\n\nsys.setrecursionlimit(10000)\nvar_1 = float(\"inf\")\n\n\ndef func_9():\n return int(eval(input()))\n\n\ndef func_10():\n return float(eval(input()))\n\n\ndef func_13():\n return eval(input())\n\n\ndef func_3():\n return list(map(int, input().split()))\n\n\ndef func_4():\n return list(map(float, input().split()))\n\n\ndef func_7():\n return input().split()\n\n\ndef func_12(var_6):\n return [func_9() for _ in range(var_6)]\n\n\ndef func_11(var_6):\n return [func_10() for _ in range(var_6)]\n\n\ndef func_14(var_6):\n return [func_13() for _ in range(var_6)]\n\n\ndef func_6(var_6):\n return [func_3() for _ in range(var_6)]\n\n\ndef func_5(var_6):\n return [func_4() for _ in range(var_6)]\n\n\ndef func_8(var_6):\n return [func_7() for _ in range(var_6)]\n\n\ndef func_2(var_5):\n print((\"Yes\" if var_5 else \"No\"))\n\n\ndef func_1(var_5):\n print((\"YES\" if var_5 else \"NO\"))\n\n\ndef func_15(var_5):\n print((\"yes\" if var_5 else \"no\"))\n\n\nvar_2, var_3, var_4 = func_3()\nfunc_2(var_2 <= var_4 <= var_3)\n", "fast_code": "import sys\n\n\ndef func_1():\n var_1, var_2, var_3 = list(map(int, input().split()))\n print((\"Yes\" if var_1 <= var_3 <= var_2 else \"No\"))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 117754251, "fast_time": 18961634, "speedup": 6.2101, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_3"} -{"pair_id": "python_6382", "problem_id": "p02551", "language": "python", "slow_code": "class Class_1:\n def __init__(self, var_11, func_4, var_9):\n var_14 = len(var_11)\n self.segfunc = func_4\n self.ide_ele = var_9\n self.num = 1 << (var_14 - 1).bit_length()\n self.data = [var_9] * 2 * self.num\n self.lazy = [None] * 2 * self.num\n for var_8 in range(var_14):\n self.data[self.num + var_8] = var_11[var_8]\n for var_8 in range(self.num - 1, 0, -1):\n self.data[var_8] = self.segfunc(\n self.data[2 * var_8], self.data[2 * var_8 + 1]\n )\n\n def func_1(self, var_12, var_15):\n var_12 += self.num\n var_15 += self.num\n var_13 = var_12 >> (var_12 & -var_12).bit_length()\n var_17 = var_15 >> (var_15 & -var_15).bit_length()\n while var_15 > var_12:\n if var_12 <= var_13:\n yield var_12\n if var_15 <= var_17:\n yield var_15\n var_15 >>= 1\n var_12 >>= 1\n while var_12:\n yield var_12\n var_12 >>= 1\n\n def func_2(self, *var_10):\n for var_8 in reversed(var_10):\n var_21 = self.lazy[var_8]\n if var_21 is None:\n continue\n self.lazy[2 * var_8] = var_21\n self.lazy[2 * var_8 + 1] = var_21\n self.data[2 * var_8] = var_21\n self.data[2 * var_8 + 1] = var_21\n self.lazy[var_8] = None\n\n def func_5(self, var_12, var_15, var_22):\n (*var_10,) = self.gindex(var_12, var_15)\n self.propagates(*var_10)\n var_12 += self.num\n var_15 += self.num\n while var_12 < var_15:\n if var_12 & 1:\n self.lazy[var_12] = var_22\n self.data[var_12] = var_22\n var_12 += 1\n if var_15 & 1:\n self.lazy[var_15 - 1] = var_22\n self.data[var_15 - 1] = var_22\n var_15 >>= 1\n var_12 >>= 1\n for var_8 in var_10:\n self.data[var_8] = self.segfunc(\n self.data[2 * var_8], self.data[2 * var_8 + 1]\n )\n\n def func_3(self, var_12, var_15):\n (*var_10,) = self.gindex(var_12, var_15)\n self.propagates(*var_10)\n var_16 = self.ide_ele\n var_12 += self.num\n var_15 += self.num\n while var_12 < var_15:\n if var_12 & 1:\n var_16 = self.segfunc(var_16, self.data[var_12])\n var_12 += 1\n if var_15 & 1:\n var_16 = self.segfunc(var_16, self.data[var_15 - 1])\n var_12 >>= 1\n var_15 >>= 1\n return var_16\n\n\ndef func_4(var_22, var_23):\n return min(var_22, var_23)\n\n\nvar_9 = 10**9\nvar_1, var_2 = list(map(int, input().split()))\nvar_6 = (var_1 - 2) * (var_1 - 2)\nvar_3 = [var_1] * (var_1 + 1)\nvar_4 = [var_1] * (var_1 + 1)\nvar_18 = Class_1(var_3, func_4, var_9)\nvar_19 = Class_1(var_4, func_4, var_9)\nfor var_8 in range(var_2):\n var_5, var_7 = list(map(int, input().split()))\n if var_5 == 1:\n var_20 = var_18.query(var_7, var_7 + 1)\n var_6 -= max(0, var_20 - 2)\n if var_7 <= var_19.query(1, 2):\n var_19.update(1, var_20 + 1, var_7)\n else:\n var_20 = var_19.query(var_7, var_7 + 1)\n var_6 -= max(0, var_20 - 2)\n if var_7 <= var_18.query(1, 2):\n var_18.update(1, var_20 + 1, var_7)\nprint(var_6)\n", "fast_code": "var_2, var_3 = list(map(int, input().split()))\nvar_2 -= 2\n\nvar_1 = [[0 for var_5 in range(var_2 + 1)] for _ in range(2)]\n\n\nvar_8 = var_2\n\n\ndef func_1(var_6, var_1):\n var_10 = 0\n while var_6 > 0:\n var_10 += var_1[var_6]\n var_6 -= var_6 & (-var_6)\n return var_10\n\n\ndef func_2(var_6, var_12, var_1):\n while var_6 <= var_8:\n var_1[var_6] += var_12\n var_6 += var_6 & (-var_6)\n return\n\n\nvar_9 = var_2 * var_2\nvar_7 = [\n 0,\n 0,\n]\nfor _ in range(var_3):\n\n var_11, var_12 = list(map(int, input().split()))\n\n var_11 -= 1\n\n var_12 -= 1\n\n var_12 = var_2 + 1 - var_12\n\n var_4 = var_2 + func_1(var_12, var_1[var_11])\n var_9 -= var_4\n if var_12 > var_7[var_11]:\n func_2(var_2 - var_4 + 1, var_7[var_11] - var_12, var_1[1 - var_11])\n\n var_7[var_11] = var_12\nprint(var_9)\n", "slow_time": 32691482933, "fast_time": 2484231945, "speedup": 13.1596, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_1"} -{"pair_id": "python_10153", "problem_id": "p03222", "language": "python", "slow_code": "from itertools import product\n\nvar_1, var_4, var_2 = list(map(int, input().split()))\nvar_3 = 10**9 + 7\nvar_5 = [[0] * var_4 for var_7 in range(var_1 + 1)]\nvar_5[0][0] = 1\n\n\ndef func_1(var_10):\n if var_10 <= 0:\n return 1\n var_9 = 0\n for var_8 in product([0, 1], repeat=var_10):\n var_8 = \"\".join(list(map(str, var_8)))\n if \"11\" not in var_8:\n var_9 += 1\n return var_9\n\n\nfor var_6 in range(var_1):\n for var_10 in range(var_4):\n var_5[var_6 + 1][var_10] = (\n var_5[var_6 + 1][var_10]\n + var_5[var_6][var_10] * func_1(var_10 - 1) * func_1(var_4 - var_10 - 2)\n ) % var_3\n if var_10 + 1 < var_4:\n var_5[var_6 + 1][var_10 + 1] = (\n var_5[var_6 + 1][var_10 + 1]\n + var_5[var_6][var_10]\n * func_1(var_10 - 1)\n * func_1(var_4 - var_10 - 3)\n % var_3\n )\n if var_10 - 1 >= 0:\n var_5[var_6 + 1][var_10 - 1] = (\n var_5[var_6 + 1][var_10 - 1]\n + var_5[var_6][var_10]\n * func_1(var_10 - 2)\n * func_1(var_4 - var_10 - 2)\n % var_3\n )\nprint((var_5[var_1][var_2 - 1] % var_3))\n", "fast_code": "var_1 = [1, 2, 3, 5, 8, 13, 21]\nvar_4 = 10**9 + 7\nvar_2, var_5, var_3 = list(map(int, input().split()))\nif var_5 == 0:\n print((1))\n exit()\nvar_6 = [[0] * var_5 for _ in range(var_2 + 1)]\nvar_6[0][0] = 1\nfor var_7 in range(1, var_2 + 1):\n for var_8 in range(var_7 + 1):\n for var_9 in [-1, 0, 1]:\n if not 0 <= var_8 + var_9 < var_5:\n continue\n if not 0 <= var_8 < var_5:\n continue\n if var_9 == -1:\n var_10 = max(0, var_8 - 1 - 1)\n var_11 = max(0, var_5 - var_8 - 2)\n elif var_9 == 0:\n var_10 = max(0, var_8 - 1)\n var_11 = max(0, var_5 - var_8 - 2)\n elif var_9 == 1:\n var_10 = max(0, var_8 - 1)\n var_11 = max(0, var_5 - var_8 - 2 - 1)\n var_6[var_7][var_8] += (\n var_6[var_7 - 1][var_8 + var_9] * var_1[var_10] * var_1[var_11]\n )\n var_6[var_7][var_8] %= var_4\nprint((var_6[var_2][var_3 - 1]))\n", "slow_time": 638943847, "fast_time": 97266259, "speedup": 6.569, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_14"} -{"pair_id": "python_14299", "problem_id": "p03737", "language": "python", "slow_code": "def func_1(var_3: list) -> str:\n var_1 = \"\"\n for var_2, var_5 in enumerate(var_3):\n\n var_1 += var_5[0].upper()\n return var_1\n\n\nvar_4 = list(map(str, input().split()))\nprint((func_1(var_4)))\n", "fast_code": "var_1, *_ = zip(*input().upper().split())\nprint(*var_1, sep=\"\")\n", "slow_time": 21557236, "fast_time": 9275400, "speedup": 2.3241, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_15"} -{"pair_id": "python_11129", "problem_id": "p03816", "language": "python", "slow_code": "import sys\nfrom collections import Counter\n\n\ndef func_9():\n return sys.stdin.readline().strip()\n\n\ndef func_10(var_6, var_8, var_9):\n return [[var_9] * var_8 for var_13 in range(var_6)]\n\n\ndef func_11(var_6, var_8, var_9, var_11):\n return [[[var_11] * var_9 for var_14 in range(var_8)] for var_13 in range(var_6)]\n\n\ndef func_12(var_6, var_8, var_9, var_11, var_12):\n return [\n [[[var_12] * var_11 for var_14 in range(var_9)] for var_14 in range(var_8)]\n for var_13 in range(var_6)\n ]\n\n\ndef func_8(var_16, var_17=1):\n return int(-(-var_16 // var_17))\n\n\ndef func_1():\n return int(eval(func_9()))\n\n\ndef func_3():\n return list(map(int, func_9().split()))\n\n\ndef func_2(var_5=None):\n return list(func_3()) if var_5 is None else [func_1() for var_13 in range(var_5)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_3 = 10**18\nvar_4 = 10**9 + 7\nvar_5 = func_1()\nvar_1 = func_2()\nvar_2 = Counter(var_1)\nfor var_15 in list(var_2.keys()):\n var_2[var_15] -= 1\nvar_10 = func_8(sum(var_2.values()), 2)\nvar_7 = var_5 - var_10 * 2\nprint(var_7)\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = len(set(list(map(int, input().split()))))\nprint((var_1 - 1 if (var_2 - var_1) % 2 else var_1))\n", "slow_time": 126232290, "fast_time": 18449968, "speedup": 6.8419, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_26"} -{"pair_id": "python_4286", "problem_id": "p03264", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_1 = 0\nfor var_2 in range(var_4):\n for var_3 in range(var_2 + 1, var_4):\n if (var_2 % 2 == 0 and var_3 % 2 == 1) or (var_2 % 2 == 1 and var_3 % 2 == 0):\n var_1 += 1\nprint(var_1)\n", "fast_code": "var_1 = int(eval(input())) / 2\nprint((int(var_1**2)))\n", "slow_time": 62556705, "fast_time": 9573211, "speedup": 6.5346, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_24"} -{"pair_id": "python_9425", "problem_id": "p02675", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nimport bisect\n\nvar_2 = 10**13\nvar_4 = 10**9 + 7\n\n\ndef func_12():\n return sys.stdin.readline().strip()\n\n\ndef func_11(var_7, var_8):\n return var_7 if var_8 == 0 else func_11(var_8, var_7 % var_8)\n\n\ndef func_13(var_7, var_8):\n return (var_7 * var_8) // func_11(var_7, var_8)\n\n\ndef func_1():\n return int(func_12())\n\n\ndef func_2():\n return [int(var_7) for var_7 in func_12().split()]\n\n\ndef func_7(var_5):\n return [int(func_12()) for _ in range(var_5)]\n\n\ndef func_3(var_5):\n return [[int(var_7) for var_7 in func_12().split()] for _ in range(var_5)]\n\n\ndef func_5():\n return func_12().split()\n\n\ndef func_8(var_5):\n return [func_12() for _ in range(var_5)]\n\n\ndef func_4(var_5):\n return [func_12().split() for _ in range(var_5)]\n\n\ndef func_6(var_3):\n print(*var_3, sep=\"\\n\")\n\n\ndef func_10(var_1):\n print(\"Yes\" if var_1 else \"No\")\n\n\ndef func_9(var_1):\n print(\"YES\" if var_1 else \"NO\")\n\n\nvar_5 = func_12()\nvar_6 = int(var_5[-1])\nif var_6 in [2, 4, 5, 7, 9]:\n print(\"hon\")\nelif var_6 in [0, 1, 6, 8]:\n print(\"pon\")\nelse:\n print(\"bon\")\n", "fast_code": "import sys\n\nvar_5 = lambda: sys.stdin.readline().rstrip()\nvar_3 = lambda: int(var_5())\nvar_4 = lambda: list(map(int, var_5().split()))\nvar_1 = var_5()[-1]\nif var_1 == \"3\":\n var_2 = \"bon\"\nelif var_1 in \"0168\":\n var_2 = \"pon\"\nelse:\n var_2 = \"hon\"\nprint(var_2)\n", "slow_time": 116219356, "fast_time": 27500661, "speedup": 4.2261, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_26"} -{"pair_id": "python_3314", "problem_id": "p03695", "language": "python", "slow_code": "var_5 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_3 = 0\nvar_2 = []\nfor var_4 in range(var_5):\n if 1 <= var_1[var_4] <= 399:\n var_2.append(0)\n elif 400 <= var_1[var_4] <= 799:\n var_2.append(1)\n elif 800 <= var_1[var_4] <= 1199:\n var_2.append(2)\n elif 1200 <= var_1[var_4] <= 1599:\n var_2.append(3)\n elif 1600 <= var_1[var_4] <= 1999:\n var_2.append(4)\n elif 2000 <= var_1[var_4] <= 2399:\n var_2.append(5)\n elif 2400 <= var_1[var_4] <= 2799:\n var_2.append(6)\n elif 2800 <= var_1[var_4] <= 3199:\n var_2.append(7)\n else:\n\n var_3 += 1\n\nif len(var_2) == 0 and var_3 != 0:\n print((1, var_3))\nelse:\n print((len(set(var_2)), len(set(var_2)) + var_3))\n", "fast_code": "eval(input())\nvar_3 = 0\nvar_1 = set()\nfor var_2 in map(int, input().split()):\n if var_2 >= 3200:\n var_3 += 1\n else:\n var_1.add(var_2 // 400)\nprint((max(1, len(var_1)), len(var_1) + var_3))\n", "slow_time": 70446936, "fast_time": 25553878, "speedup": 2.7568, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_2"} -{"pair_id": "python_12512", "problem_id": "p03674", "language": "python", "slow_code": "var_1 = 10**9 + 7\n\n\ndef func_2(var_13, var_10):\n if var_13 == 0:\n return 1\n var_12 = 1\n while var_10 > 0:\n if var_10 & 1:\n var_12 = (var_12 * var_13) % var_1\n var_13 = (var_13 * var_13) % var_1\n var_10 >>= 1\n return var_12\n\n\nvar_5, var_7 = [0] * (10**5 + 2), [0] * (10**5 + 2)\nvar_5[0], var_7[0] = 1, 1\nfor var_6 in range(1, 10**5 + 2):\n var_5[var_6] = (var_5[var_6 - 1] * var_6) % var_1\n var_7[var_6] = func_2(var_5[var_6], var_1 - 2) % var_1\n\n\ndef func_1(var_10, var_11):\n if var_10 < var_11 or var_10 == 0 or var_11 == 0:\n return 0\n return (((var_5[var_10] * var_7[var_11]) % var_1) * var_7[var_10 - var_11]) % var_1\n\n\nfrom collections import defaultdict\n\nvar_10 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nvar_3 = defaultdict(int)\nfor var_6, var_4 in enumerate(var_2):\n if var_3[var_4] == 0:\n var_3[var_4] = var_6 + 1\n else:\n var_9 = var_3[var_4]\n var_11 = var_6 + 1\nprint(var_10)\nfor var_8 in range(2, var_10 + 2):\n print(\n (\n (\n func_1(var_10 + 1, var_8)\n - func_1(var_9 - 1 + var_10 - var_11 + 1, var_8 - 1)\n )\n % var_1\n )\n )\n", "fast_code": "class Class_1:\n def __init__(self, var_2, var_13=10**9 + 7):\n var_5 = [1, 1]\n var_6 = [1, 1]\n var_8 = [0, 1]\n for var_7 in range(2, var_2):\n var_5.append(var_5[var_7 - 1] * var_7 % var_13)\n var_8.append(var_13 - var_8[var_13 % var_7] * (var_13 // var_7) % var_13)\n var_6.append(var_6[var_7 - 1] * var_8[var_7] % var_13)\n self.fac, self.finv, self.mod = var_5, var_6, var_13\n\n def func_1(self, var_14, var_9):\n if var_14 < var_9 or var_14 < 0 or var_9 < 0:\n return 0\n var_5, var_6, var_13 = self.fac, self.finv, self.mod\n return var_5[var_14] * (var_6[var_9] * var_6[var_14 - var_9] % var_13) % var_13\n\n\nvar_13 = 10**9 + 7\nvar_3, *var_1 = list(map(int, open(0).read().split()))\nvar_12 = Class_1(210000, mod=var_13)\nvar_16 = {}\nvar_10, var_15 = 0, 0\nfor var_7, var_4 in enumerate(var_1):\n if var_4 in var_16:\n var_15 = var_7\n var_10 = var_16[var_4]\n break\n var_16[var_4] = var_7\nvar_11 = var_10 + var_3 - var_15\nfor var_9 in range(1, var_3 + 2):\n print(((var_12.nCk(var_3 + 1, var_9) - var_12.nCk(var_11, var_9 - 1)) % var_13))\n", "slow_time": 142154156092, "fast_time": 20922270310, "speedup": 6.7944, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_20"} -{"pair_id": "python_6656", "problem_id": "p04014", "language": "python", "slow_code": "import sys\n\nvar_4 = int(eval(input()))\nvar_5 = int(eval(input()))\n\n\ndef func_1(var_2, var_4):\n if var_4 < var_2:\n return var_4\n else:\n return func_1(var_2, var_4 // var_2) + var_4 % var_2\n\n\nif var_5 == var_4:\n print((var_4 + 1))\n sys.exit(0)\nif var_4 < var_5:\n print((-1))\n sys.exit(0)\nvar_1 = None\nfor var_3 in range(2, var_4):\n if var_3 * var_3 > var_4:\n break\n if func_1(var_3, var_4) == var_5:\n var_1 = var_3\n break\nfor var_3 in range(1, var_4):\n if var_3 * var_3 > var_4:\n break\n if (var_4 - var_5) % var_3 == 0:\n var_2 = (var_4 - var_5) // var_3 + 1\n if func_1(var_2, var_4) == var_5:\n if var_1 is None:\n var_1 = (var_4 - var_5) // var_3 + 1\n else:\n var_1 = min((var_1, (var_4 - var_5) // var_3 + 1))\nif var_1 is None:\n print((-1))\nelse:\n print(var_1)\n", "fast_code": "def func_3(var_1):\n var_5, var_7, var_12, var_4, var_14 = 2, var_1, {}, 2, 99\n while var_5 <= var_14:\n var_6 = 0\n while var_7 % var_5 == 0:\n var_7, var_6, var_12[var_5] = var_7 // var_5, var_6 + 1, var_6 + 1\n if var_6 > 0 or var_5 == 97:\n var_14 = int(var_7 ** (1 / 2) + 0.5)\n if var_5 < 4:\n var_5 = var_5 * 2 - 1\n else:\n var_5, var_4 = var_5 + var_4, var_4 ^ 6\n if var_7 > 1:\n var_12[var_7] = 1\n return var_12\n\n\ndef func_1(var_1):\n var_9 = func_3(var_1)\n var_12 = [1]\n for var_8 in var_9:\n var_13 = var_12\n var_12 = []\n for var_5 in range(var_9[var_8] + 1):\n for var_10 in var_13:\n var_12.append(var_10 * (var_8**var_5))\n return sorted(var_12)\n\n\ndef func_2(var_3, var_7):\n var_11 = 0\n while var_7:\n var_11 += var_7 % var_3\n var_7 //= var_3\n return var_11\n\n\nvar_1 = int(eval(input()))\nvar_2 = int(eval(input()))\nif var_1 < var_2:\n print((-1))\nelif var_1 == var_2:\n print((var_1 + 1))\nelse:\n for var_3 in func_1(var_1 - var_2):\n var_3 += 1\n if func_2(var_3, var_1) == var_2:\n print(var_3)\n break\n else:\n print((-1))\n", "slow_time": 2618861164, "fast_time": 96826499, "speedup": 27.0469, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_4"} -{"pair_id": "python_8902", "problem_id": "p02571", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nfunc_7 = func_5()\nvar_1 = func_5()\nvar_6 = len(func_7)\nvar_7 = len(var_1)\nvar_2 = 10**5\nfor var_4 in range(var_6 - var_7 + 1):\n var_3 = 0\n for var_5 in range(var_7):\n if var_1[var_5] != func_7[var_4 + var_5]:\n var_3 += 1\n var_2 = min(var_2, var_3)\nprint(var_2)\n", "fast_code": "var_1 = input().strip()\nvar_2 = input().strip()\nvar_7 = len(var_2)\nvar_4 = len(var_1)\nfor var_5 in range(len(var_1) - var_7 + 1):\n var_3 = 0\n for var_6 in range(var_7):\n if var_1[var_5 + var_6] != var_2[var_6]:\n var_3 += 1\n var_4 = min(var_4, var_3)\nprint(var_4)\n", "slow_time": 72337825, "fast_time": 27555234, "speedup": 2.6252, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_28"} -{"pair_id": "python_18463", "problem_id": "p02676", "language": "python", "slow_code": "def func_4():\n return int(input())\n\n\ndef func_5():\n return map(int, input().split())\n\n\ndef func_1():\n return list(func_5())\n\n\ndef func_3(var_3):\n return [func_4() for var_1 in range(var_3)]\n\n\ndef func_2(var_3):\n return [func_1() for var_1 in range(var_3)]\n\n\ndef func_6(var_5):\n print(\"Yes\") if var_5 == True else print(\"No\")\n\n\nvar_2 = func_4()\nvar_4 = input()\nif len(var_4) <= var_2:\n print(var_4)\nelse:\n print(var_4[:var_2] + \"...\")\n", "fast_code": "import sys\n\nvar_1 = int(input())\nvar_2 = input()\nprint(var_2) if len(var_2) <= var_1 else print(var_2[:var_1] + \"...\")\n", "slow_time": 49635108, "fast_time": 13052300, "speedup": 3.8028, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_9"} -{"pair_id": "python_14615", "problem_id": "p01314", "language": "python", "slow_code": "if __name__ == \"__main__\":\n while True:\n var_4 = int(eval(input()))\n if var_4 == 0:\n break\n var_5 = [var_2 for var_2 in range(1, var_4 + 1)]\n var_1 = 0\n for var_2 in range(var_4):\n for var_3 in range(var_2 + 1, var_4):\n if sum(var_5[var_2:var_3]) > var_4:\n break\n if sum(var_5[var_2:var_3]) == var_4:\n var_1 += 1\n print(var_1)\n", "fast_code": "import sys\n\nif sys.version_info[0] >= 3:\n var_4 = input\ntry:\n while True:\n var_2 = int(input())\n if var_2 == 0:\n break\n var_3 = 0\n var_1 = 1\n while 1:\n var_2 -= var_1\n if var_2 < var_1:\n break\n var_1 += 1\n if var_2 % var_1 == 0:\n var_3 += 1\n print(var_3)\nexcept EOFError:\n pass\n", "slow_time": 246187152, "fast_time": 28743098, "speedup": 8.5651, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_5"} -{"pair_id": "python_14349", "problem_id": "p03185", "language": "python", "slow_code": "class Class_1:\n\n def __init__(self, var_7):\n self.N = len(var_7)\n self.N0 = 2 ** (self.N - 1).bit_length()\n self.comp = {var_23: var_13 for var_13, var_23 in enumerate(var_7)}\n self.inf = 10**12\n self.X = var_7 + [self.inf] * (self.N0 - self.N)\n self.data = [None] * (2 * self.N0)\n self.size = [0] * self.N0 + [1] * self.N0\n for var_12 in range(self.N0 - 1, 0, -1):\n self.size[var_12] = 2 * self.size[2 * var_12]\n self.start = [0] * (2 * self.N0)\n for var_12 in range(1, 2 * self.N0):\n if var_12 == var_12 & (-var_12):\n continue\n self.start[var_12] = self.start[var_12 - 1] + self.size[var_12]\n\n def func_3(self, var_15, var_24):\n return var_15[0] * var_24 + var_15[1]\n\n def _update(self, var_13, var_15):\n if self.data[var_13] is None:\n self.data[var_13] = var_15\n return\n var_14 = self.start[var_13]\n var_20 = var_14 + self.size[var_13]\n while True:\n if self.data[var_13] is None:\n self.data[var_13] = var_15\n return\n var_17 = (var_14 + var_20) // 2\n var_16 = self.X[var_14]\n var_19 = self.X[var_17]\n var_21 = self.X[var_20 - 1]\n var_9 = self.f(self.data[var_13], var_16) > self.f(var_15, var_16)\n var_10 = self.f(self.data[var_13], var_19) > self.f(var_15, var_19)\n var_11 = self.f(self.data[var_13], var_21) > self.f(var_15, var_21)\n if var_9 and var_11:\n self.data[var_13] = var_15\n return\n if not var_9 and not var_11:\n return\n if var_10:\n self.data[var_13], var_15 = var_15, self.data[var_13]\n var_9 = not var_9\n if var_9:\n var_20 = var_17\n var_13 = 2 * var_13\n else:\n var_14 = var_17\n var_13 = 2 * var_13 + 1\n\n def func_4(self, var_24):\n var_13 = self.comp[var_24] + self.N0\n var_22 = self.inf\n while var_13 > 0:\n if self.data[var_13]:\n var_22 = min(var_22, self.f(self.data[var_13], var_24))\n var_13 = var_13 >> 1\n return var_22\n\n def func_1(self, var_15):\n self._update(1, var_15)\n\n def func_2(self, var_14, var_20, var_15):\n\n var_3 = var_14 + self.N0\n var_5 = var_20 + self.N0\n while var_3 < var_5:\n if var_5 & 1:\n var_5 -= 1\n self._update(var_5, var_15)\n if var_3 & 1:\n self._update(var_3, var_15)\n var_3 += 1\n var_3 >>= 1\n var_5 >>= 1\n\n\nvar_4, var_1 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_6 = Class_1(var_2)\nvar_8 = [10**19] * var_4\nvar_8[0] = 0\nvar_6.addline((-2 * var_2[0], var_2[0] ** 2))\nfor var_12 in range(1, var_4):\n var_18 = var_6.query(var_2[var_12])\n var_8[var_12] = var_18 + var_1 + var_2[var_12] ** 2\n var_6.addline((-2 * var_2[var_12], var_2[var_12] ** 2 + var_8[var_12]))\nprint((var_8[-1]))\n", "fast_code": "def func_2(var_10, var_16):\n var_3, var_4 = var_12[var_10]\n return var_3 * var_16 + var_4\n\n\ndef func_3(var_16):\n def func_1(var_10):\n return func_2(var_10 + 1, var_16) > func_2(var_10, var_16)\n\n var_13, var_14 = -1, len(var_12) - 1\n var_11 = (var_13 + var_14) // 2\n while var_14 - var_13 > 1:\n if func_1(var_11):\n var_14, var_11 = var_11, (var_13 + var_11) // 2\n continue\n var_13, var_11 = var_11, (var_14 + var_11) // 2\n return func_2(var_11 + 1, var_16)\n\n\ndef func_4(var_3, var_4):\n var_7, func_1 = var_12[-1]\n while len(var_12) - 1:\n (var_5, var_6), (var_7, func_1) = (var_7, func_1), var_12[-2]\n if (var_5 - var_7) * (var_4 - var_6) < (var_6 - func_1) * (var_3 - var_5):\n break\n var_12.pop()\n var_12.append((var_3, var_4))\n\n\nvar_2, var_1 = list(map(int, input().split()))\nvar_9 = list(map(int, input().split()))\nvar_12 = [(-2 * var_9[0], var_9[0] ** 2)]\nfor var_8 in var_9[1:]:\n var_15 = func_3(var_8) + var_8**2 + var_1\n func_4(-2 * var_8, var_15 + var_8**2)\nprint(var_15)\n", "slow_time": 204801603, "fast_time": 85742731, "speedup": 2.3886, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_4"} -{"pair_id": "python_14567", "problem_id": "p00150", "language": "python", "slow_code": "var_4 = 10001\nvar_5 = int(var_4**0.5)\nvar_3 = [1] * var_4\nvar_6 = [0] * var_4\nvar_3[0] = 0\nvar_3[1::2] = [0 for var_7 in range(1, var_4, 2)]\nfor var_1 in range(2, var_4, 2):\n if var_3[var_1]:\n var_3[2 * var_1 + 1 :: var_1 + 1] = [\n 0 for var_7 in range(2 * var_1 + 1, var_4, var_1 + 1)\n ]\n if var_3[var_1 - 2]:\n var_6[var_1 : var_1 + 300] = [\n var_1 + 1 for var_7 in range(var_1, var_1 + 300)\n ]\nwhile True:\n var_2 = int(input())\n if var_2 == 0:\n break\n print(var_6[var_2 - 1] - 2, var_6[var_2 - 1])\n", "fast_code": "var_1 = 10000\nvar_2 = 100\nvar_6 = [True for var_3 in range(var_1)]\n\n\ndef func_1():\n for var_3 in range(4, var_1, 2):\n var_6[var_3] = False\n for var_3 in range(3, var_2, 2):\n if var_6[var_3] is True:\n for var_4 in range(var_3 * var_3, var_1, var_3):\n var_6[var_4] = False\n\n\nfunc_1()\nwhile True:\n var_5 = int(eval(input()))\n if var_5 == 0:\n break\n if (var_5 & 1) == 0:\n var_5 -= 1\n while not var_6[var_5] or not var_6[var_5 - 2]:\n var_5 -= 2\n print((var_5 - 2, var_5))\n", "slow_time": 1637634757, "fast_time": 265822159, "speedup": 6.1606, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_0"} -{"pair_id": "python_4896", "problem_id": "p03598", "language": "python", "slow_code": "import sys\n\nvar_19 = sys.stdin\nvar_3 = 1 << 60\nvar_5 = 1000000007\nvar_15 = lambda: int(var_17())\nvar_16 = lambda var_21: [var_15() for _ in range(var_21)]\nvar_7 = lambda: list(map(int, var_19.readline().split()))\nvar_8 = lambda var_21: [var_7() for _ in range(var_21)]\nvar_11 = lambda: float(var_17())\nvar_14 = lambda var_21: [var_11() for _ in range(var_21)]\nvar_12 = lambda: list(map(float, var_19.readline().split()))\nvar_13 = lambda var_21: [var_12() for _ in range(var_21)]\nvar_17 = lambda: var_19.readline().rstrip()\nvar_18 = lambda var_21: [var_17() for _ in range(var_21)]\nvar_10 = lambda var_21: [list(var_17()) for _ in range(var_21)]\nvar_9 = lambda: var_19.readline().split()\nvar_6, var_4 = var_16(2)\nvar_20 = var_7()\nvar_1 = 0\nfor var_2 in range(var_6):\n var_1 += min(abs(var_20[var_2] - var_4) * 2, abs(var_20[var_2]) * 2)\nprint(var_1)\n", "fast_code": "var_3 = int(eval(input()))\nvar_2 = int(eval(input()))\nvar_4 = list(map(int, input().split()))\nvar_1 = 0\nfor var_5 in var_4:\n var_1 += min(var_5, var_2 - var_5) * 2\nprint(var_1)\n", "slow_time": 100447964, "fast_time": 24528117, "speedup": 4.0952, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_16"} -{"pair_id": "python_10048", "problem_id": "p03222", "language": "python", "slow_code": "var_1, var_4, var_2 = list(map(int, input().split()))\nvar_3 = 10**9 + 7\nif var_4 == 1:\n print((1))\n exit()\nvar_11 = []\nfor var_8 in range(1 << (var_4 - 1)):\n var_6 = bin(var_8)[2:]\n var_7 = 1\n for var_9 in range(len(var_6) - 1):\n if var_6[var_9] == var_6[var_9 + 1] == \"1\":\n var_7 = 0\n if var_7:\n var_11.append(int(var_6, 2))\n\n\ndef func_1(var_6):\n var_12 = [var_8 for var_8 in range(var_4)]\n for var_8 in range(var_4 - 1):\n if var_6 >> var_8 & 1:\n var_12[var_8], var_12[var_8 + 1] = var_12[var_8 + 1], var_12[var_8]\n return var_12\n\n\nvar_5 = [0 for var_8 in range(var_4)]\nvar_5[0] = 1\nfor _ in range(var_1):\n var_10 = [0 for var_8 in range(var_4)]\n for var_6 in var_11:\n for var_8 in range(var_4):\n var_10[var_8] = (var_10[var_8] + var_5[func_1(var_6)[var_8]]) % var_3\n var_5 = var_10\nprint((var_5[var_2 - 1]))\n", "fast_code": "var_3 = 10**9 + 7\nvar_1, var_4, var_2 = list(map(int, input().split()))\nvar_6 = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n\n\ndef func_1(var_7):\n return var_6[var_7 + 2]\n\n\nvar_10, var_9, var_11 = [0] * var_4, [0] * var_4, [0] * var_4\nfor var_8 in range(var_4):\n var_9[var_8] = func_1(var_8 - 1) * func_1(var_4 - 1 - var_8 - 1)\n var_10[var_8] = func_1(var_8 - 2) * func_1(var_4 - 1 - var_8 - 1)\n var_11[var_8] = func_1(var_8 - 1) * func_1(var_4 - 1 - var_8 - 2)\nvar_5 = [[0] * var_4 for _ in range(var_1 + 1)]\nvar_5[0][0] = 1\nfor var_7 in range(var_1):\n for var_8 in range(var_4):\n var_5[var_7 + 1][var_8] += var_5[var_7][var_8] * var_9[var_8]\n if var_8 > 0:\n var_5[var_7 + 1][var_8 - 1] += var_5[var_7][var_8] * var_10[var_8]\n if var_8 < var_4 - 1:\n var_5[var_7 + 1][var_8 + 1] += var_5[var_7][var_8] * var_11[var_8]\n for var_8 in range(var_4):\n var_5[var_7 + 1][var_8] %= var_3\nprint((var_5[var_1][var_2 - 1]))\n", "slow_time": 593484533, "fast_time": 79770414, "speedup": 7.4399, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_6"} -{"pair_id": "python_18247", "problem_id": "p02831", "language": "python", "slow_code": "var_1, var_2 = list(map(int, input().split()))\nvar_3 = 0\nfor var_4 in range(max(var_1, var_2), 0, -1):\n if var_1 % var_4 == 0 and var_2 % var_4 == 0:\n var_3 = var_4\n break\nprint((var_1 * var_2 // var_3))\n", "fast_code": "import math\n\n\ndef func_1(var_3, var_4):\n return (var_3 * var_4) // math.gcd(var_3, var_4)\n\n\nvar_1, var_2 = list(map(int, input().split()))\nprint((func_1(var_1, var_2)))\n", "slow_time": 1631239856, "fast_time": 16639944, "speedup": 98.0316, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_4"} -{"pair_id": "python_6151", "problem_id": "p00033", "language": "python", "slow_code": "var_2 = int(eval(input()))\nfor var_6 in range(var_2):\n var_1 = list(map(int, input().split()))\n var_5 = False\n for var_3 in range(2**10):\n var_7 = []\n var_8 = []\n for var_4 in range(10):\n if var_3 & (1 << var_4):\n var_7.append(var_1[var_4])\n else:\n var_8.append(var_1[var_4])\n if var_7 == sorted(var_7) and var_8 == sorted(var_8):\n var_5 = True\n if var_5:\n print(\"YES\")\n else:\n print(\"NO\")\n", "fast_code": "var_1 = eval(input())\nfor var_4 in range(var_1):\n var_2, var_3 = 0, 0\n for var_5 in map(int, input().split()):\n if var_2 < var_5:\n var_2 = var_5\n elif var_3 < var_5:\n var_3 = var_5\n else:\n break\n else:\n print(\"YES\")\n continue\n print(\"NO\")\n", "slow_time": 2055994527, "fast_time": 25938345, "speedup": 79.2647, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_7"} -{"pair_id": "python_2905", "problem_id": "p02582", "language": "python", "slow_code": "import sys\n\nvar_2 = sys.stdin.readline\n\n\ndef func_1():\n var_1 = var_2().rstrip()\n if var_1 == \"RRR\":\n print((3))\n elif var_1 == \"RRS\":\n print((2))\n elif var_1 == \"SRR\":\n print((2))\n elif var_1 == \"SSS\":\n print((0))\n else:\n print((1))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "print((max(list(map(len, input().split(\"S\"))))))\n", "slow_time": 28799282, "fast_time": 8797320, "speedup": 3.2736, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_24"} -{"pair_id": "python_1627", "problem_id": "p02990", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_9 = 10**9 + 7\nvar_5 = [pow(var_4, var_9 - 2, var_9) for var_4 in range(1, var_2 + 1)]\nvar_11 = []\nvar_6 = []\nvar_12 = 1\nvar_7 = 1\nfor var_4 in range(var_2):\n var_12 *= var_4 + 1\n var_12 %= var_9\n var_11.append(var_12)\n var_7 *= var_5[var_4]\n var_7 %= var_9\n var_6.append(var_7)\n\n\ndef func_1(var_10, var_8):\n if var_10 == 0:\n return 1\n if var_8 == 0:\n return 1\n if var_10 == var_8:\n return 1\n var_3 = var_11[var_10 - 1]\n var_3 *= var_6[var_8 - 1]\n var_3 *= var_6[var_10 - var_8 - 1]\n return var_3 % var_9\n\n\nfor var_4 in range(1, var_1 + 1):\n var_3 = 0\n var_12 = func_1(var_1 - 1, var_4 - 1)\n if var_2 - var_1 < var_4 - 1:\n print(var_3)\n continue\n else:\n var_13 = var_2 - var_1 - (var_4 - 1)\n if var_13 > 0:\n var_3 += func_1(var_13 + var_4, var_4) * var_12\n else:\n var_3 += var_12\n print((var_3 % var_9))\n", "fast_code": "import math\n\nvar_2, var_1 = list(map(int, input().split()))\nvar_3 = var_2 - var_1\nif var_3 == 0:\n print((1))\n for _ in range(1, var_1):\n print((0))\n exit()\nif var_1 == 1:\n print((var_3 + 1))\n exit()\n\n\nfor var_6 in range(1, var_1 + 1):\n if var_6 > var_3 + 1:\n print((0))\n continue\n if var_6 == 1:\n print((var_3 + 1))\n continue\n\n if var_6 >= 2:\n var_7 = var_4 = math.factorial(var_3 + 1) // (\n math.factorial(var_6) * math.factorial(var_3 + 1 - var_6)\n )\n var_5 = math.factorial(var_1 - 1) // (\n math.factorial(var_6 - 1) * math.factorial(var_1 - var_6)\n )\n print(((var_7 * var_5) % (7 + 10**9)))\n", "slow_time": 319829547, "fast_time": 63154173, "speedup": 5.0643, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_16"} -{"pair_id": "python_13621", "problem_id": "p02362", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nfrom sys import stdin\n\n\nclass Class_1:\n def __init__(self, var_11):\n self.fa = {}\n for var_10 in var_11:\n self.fa[var_10] = var_10\n\n def func_3(self, var_18):\n if self.fa[var_18] == var_18:\n return var_18\n else:\n self.fa[var_18] = self.find(self.fa[var_18])\n return self.fa[var_18]\n\n def func_5(self, var_18, var_19):\n var_5 = self.find(var_18)\n var_6 = self.find(var_19)\n if var_5 == var_6:\n return var_5\n else:\n self.fa[var_5] = var_6\n return var_6\n\n\n\"\"\"\"\"\"\n\n\ndef func_4(var_7):\n \"kruscal minimum spanning tree algorithm\"\n var_15 = Class_1(var_7[\"nodes\"])\n var_13 = 0\n for var_18, var_19, var_17 in sorted(var_7[\"edges\"], key=lambda var_18: var_18[-1]):\n var_5 = var_15.find(var_18)\n var_6 = var_15.find(var_19)\n if var_5 != var_6:\n var_13 += var_17\n var_15.union(var_5, var_6)\n else:\n pass\n return var_13\n\n\ndef func_2(var_7, var_14):\n \"dijkstra algorithm for single source shortest algorithm\"\n var_4, var_16 = {}, {}\n for var_10 in var_7[\"nodes\"]:\n var_4[var_10] = 10**9\n var_16[var_10] = False\n var_8 = []\n var_4[var_14] = 0\n heappush(var_8, (0, var_14))\n while var_8:\n _, var_10 = heappop(var_8)\n var_16[var_10] = True\n for var_19, var_17 in var_7[\"adj\"][var_10]:\n if not var_16[var_19] and var_4[var_10] + var_17 < var_4[var_19]:\n var_4[var_19] = var_4[var_10] + var_17\n heappush(var_8, (var_4[var_19], var_19))\n return var_4\n\n\ndef func_1(var_7, var_14):\n var_4 = {}\n for var_10 in var_7[\"nodes\"]:\n var_4[var_10] = 10**9\n var_4[var_14] = 0\n\n for _ in range(len(var_7[\"nodes\"]) - 1):\n for var_18, var_19, var_17 in var_7[\"edges\"]:\n if var_4[var_18] + var_17 < var_4[var_19]:\n var_4[var_19] = var_4[var_18] + var_17\n var_3 = set([var_14])\n var_12 = deque([var_14])\n while var_12:\n var_10 = var_12.popleft()\n for var_19, _ in var_7[\"adj\"][var_10]:\n if not var_19 in var_3:\n var_3.add(var_19)\n var_12.append(var_19)\n var_4[\"negcicle\"] = False\n for var_18, var_19, var_17 in var_7[\"edges\"]:\n if var_4[var_18] + var_17 < var_4[var_19] and var_18 in var_3:\n var_4[\"negcicle\"] = True\n var_4[\"con\"] = var_3\n return var_4\n\n\nif __name__ == \"__main__\":\n var_2, var_1, var_14 = list(map(int, stdin.readline().strip().split()))\n var_7 = {}\n var_7[\"nodes\"] = [var_9 for var_9 in range(var_2)]\n var_7[\"edges\"] = []\n var_7[\"adj\"] = defaultdict(list)\n for _ in range(var_1):\n var_18, var_19, var_17 = list(map(int, stdin.readline().strip().split()))\n var_7[\"edges\"].append((var_18, var_19, var_17))\n var_7[\"adj\"][var_18].append((var_19, var_17))\n var_4 = func_1(var_7, var_14)\n if var_4[\"negcicle\"]:\n print(\"NEGATIVE CYCLE\")\n else:\n for var_10 in var_7[\"nodes\"]:\n print(\n var_4[var_10]\n if var_4[var_10] < 10**9 and var_10 in var_4[\"con\"]\n else \"INF\"\n )\n", "fast_code": "import math\n\n\ndef func_1():\n var_5, var_4, var_6 = list(map(int, input().split()))\n var_1 = []\n for var_3 in range(var_4):\n var_7, var_8, var_9 = list(map(int, input().split()))\n var_1.append((var_7, var_8, var_9))\n var_2 = float(\"inf\")\n var_10 = [var_2] * var_5\n var_10[var_6] = 0\n for var_3 in range(var_5 - 1):\n for var_7, var_8, var_9 in var_1:\n if var_10[var_8] > var_10[var_7] + var_9:\n var_10[var_8] = var_10[var_7] + var_9\n for var_7, var_8, var_9 in var_1:\n if var_10[var_8] > var_10[var_7] + var_9:\n print(\"NEGATIVE CYCLE\")\n return\n for var_9 in var_10:\n if math.isinf(var_9):\n print(\"INF\")\n else:\n print(var_9)\n\n\nfunc_1()\n", "slow_time": 189538126, "fast_time": 49104636, "speedup": 3.8599, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_2"} -{"pair_id": "python_860", "problem_id": "p03556", "language": "python", "slow_code": "import functools\nimport itertools\nimport numpy as np\nimport sys\n\nvar_1 = int(10e10)\nvar_2 = -var_1\nvar_6 = 1000000007\nsys.setrecursionlimit(1000000)\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_4():\n return input().split()\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_3():\n return eval(input())\n\n\nvar_3 = func_1()\nvar_4 = [pow(var_5, 2) for var_5 in range(100000) if pow(var_5, 2) <= var_3]\nprint((var_4[-1]))\n", "fast_code": "var_2 = int(eval(input()))\nfor var_1 in range(var_2, 0, -1):\n if float(var_1**0.5).is_integer():\n print(var_1)\n break\n", "slow_time": 7046061345, "fast_time": 868435773, "speedup": 8.1135, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_26"} -{"pair_id": "python_3445", "problem_id": "p02955", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(100000)\nvar_13 = sys.stdin.readline\n\n\ndef func_7():\n return int(var_13())\n\n\ndef func_8():\n return list(map(int, var_13().split()))\n\n\ndef func_5():\n return float(var_13())\n\n\ndef func_6():\n return list(map(float, var_13().split()))\n\n\ndef func_9():\n return var_13().strip()\n\n\ndef func_10():\n return list(map(str, var_13().split()))\n\n\ndef func_2(*var_8):\n print(*var_8, file=sys.stderr)\n\n\ndef func_4(var_11):\n import time\n\n def func_12(*var_8, **var_14):\n var_19 = time.time()\n var_17 = var_11(*var_8, **var_14)\n var_10 = time.time()\n func_2(var_10 - var_19, \"sec\")\n return var_17\n\n return func_12\n\n\ndef func_1(var_15):\n for var_12 in range(1, int(var_15**0.5) + 1):\n if var_15 % var_12 == 0:\n yield var_12\n if var_12 != var_15 // var_12:\n yield var_15 // var_12\n\n\n@func_4\ndef func_11(var_4, var_3, var_1):\n var_5 = sum(var_1)\n var_2 = [var_15 for var_15 in func_1(var_5)]\n var_2.sort()\n var_7 = 0\n for var_9 in var_2:\n var_16 = []\n for var_6 in var_1:\n var_16.append(var_6 % var_9)\n var_16.sort()\n var_18 = [var_9 - var_15 for var_15 in var_16]\n var_20 = [0]\n var_21 = [0]\n for var_12 in range(var_4):\n var_20.append(var_20[-1] + var_16[var_12])\n var_21.append(var_21[-1] + var_18[var_12])\n for var_12 in range(var_4):\n var_10 = var_20[var_12 + 1] - var_20[0]\n var_11 = var_21[var_4] - var_21[var_12 + 1]\n if var_10 == var_11 and var_10 <= var_3:\n var_7 = max(var_7, var_9)\n break\n return var_7\n\n\ndef func_3():\n var_4, var_3 = func_8()\n var_1 = func_8()\n print(func_11(var_4, var_3, var_1))\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_9, var_8 = list(map(int, input().split()))\nvar_1 = [int(var_12) for var_12 in input().split()]\nvar_11 = sum(var_1)\nvar_3 = set()\nfor var_6 in range(1, int(var_11**0.5) + 1):\n if var_11 % var_6 == 0:\n var_3.add(var_6)\n var_3.add(var_11 // var_6)\nvar_2 = 0\nfor var_4 in var_3:\n var_5 = [0] * var_9\n for var_6 in range(var_9):\n var_5[var_6] = var_1[var_6] % var_4\n var_5 = sorted(var_5)\n\n var_7 = var_9 - sum(var_5) // var_4\n var_10 = 0\n for var_6 in range(var_7):\n var_10 += var_5[var_6]\n var_2 = max(var_2, var_4) if var_10 <= var_8 else var_2\nprint(var_2)\n", "slow_time": 163270483, "fast_time": 58661726, "speedup": 2.7833, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_18"} -{"pair_id": "python_14501", "problem_id": "p02669", "language": "python", "slow_code": "from collections import defaultdict\n\n\ndef func_1(*var_4: str) -> str:\n var_17 = int(var_4[0])\n var_2 = [tuple(map(int, var_13.split())) for var_13 in var_4[1:]]\n var_15 = []\n for var_12, var_3, var_5, var_6, var_8 in var_2:\n var_1 = ((2, var_3), (3, var_5), (5, var_6))\n var_9 = defaultdict(lambda: var_12 * var_8)\n var_16 = [(var_12, 0)]\n while var_16:\n var_14, var_7 = var_16.pop()\n if min(var_9[0], var_9[var_14]) <= var_7:\n continue\n var_9[var_14] = var_7\n var_9[0] = min(var_9[0], var_7 + var_14 * var_8)\n if 0 < var_14:\n for var_18, var_19 in var_1:\n var_11, var_10 = var_14 // var_18, -(-var_14 // var_18)\n var_16.append(\n (\n var_11,\n var_8 * abs(var_11 * var_18 - var_14)\n + var_7\n + var_19 * (0 < var_11),\n )\n )\n var_16.append(\n (var_10, var_8 * abs(var_10 * var_18 - var_14) + var_7 + var_19)\n )\n var_15.append(str(var_9[0]))\n return \"\\n\".join(var_15)\n\n\nif __name__ == \"__main__\":\n print((func_1(*(open(0).read().splitlines()))))\n", "fast_code": "from heapq import heappop, heappush\n\nvar_8 = int(input())\nvar_10 = []\nfor _ in range(var_8):\n var_5, var_1, var_2, var_3, var_4 = map(int, input().split())\n var_6 = [(0, var_5)]\n\n var_7 = set()\n var_9 = var_4 * var_5\n while var_6:\n var_11, var_12 = heappop(var_6)\n if var_12 in var_7:\n continue\n var_9 = min(var_9, var_11 + var_12 * var_4)\n if var_12 == 1:\n break\n var_7.add(var_12)\n var_13, var_14 = divmod(var_12, 2)\n if var_14 < 2:\n heappush(var_6, (var_11 + var_1 + var_14 * var_4, var_13))\n if var_14 > 0:\n heappush(var_6, (var_11 + var_1 + (2 - var_14) * var_4, var_13 + 1))\n var_13, var_14 = divmod(var_12, 3)\n if var_14 < 2:\n heappush(var_6, (var_11 + var_2 + var_14 * var_4, var_13))\n if var_14 > 1:\n heappush(var_6, (var_11 + var_2 + (3 - var_14) * var_4, var_13 + 1))\n var_13, var_14 = divmod(var_12, 5)\n if var_14 < 3:\n heappush(var_6, (var_11 + var_3 + var_14 * var_4, var_13))\n if var_14 > 2:\n heappush(var_6, (var_11 + var_3 + (5 - var_14) * var_4, var_13 + 1))\n var_10.append(var_9)\nprint(*var_10, sep=\"\\n\")\n", "slow_time": 156062328242, "fast_time": 21687309533, "speedup": 7.196, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_10"} -{"pair_id": "python_4864", "problem_id": "p04015", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_9 = [int(var_5) for var_5 in input().split()]\nvar_3 = 0\nvar_4 = [\n [[0] * (50 * var_2 + 1) for var_6 in range(var_2 + 1)] for var_7 in range(var_2 + 1)\n]\nvar_4[0][0][0] = 1\nfor var_6 in range(1, var_2 + 1):\n for var_7 in range(var_2 + 1):\n for var_8 in range(50 * var_2 + 1):\n var_4[var_6][var_7][var_8] = var_4[var_6 - 1][var_7][var_8]\n if var_8 >= var_9[var_6 - 1]:\n var_4[var_6][var_7][var_8] += var_4[var_6 - 1][var_7 - 1][\n var_8 - var_9[var_6 - 1]\n ]\nfor var_7 in range(1, var_2 + 1):\n var_3 += var_4[var_2][var_7][var_7 * var_1]\nprint(var_3)\n", "fast_code": "\"\"\"\"\"\"\n\nvar_2, var_1 = list(map(int, input().split()))\nvar_3 = list(map(int, input().split()))\nvar_9 = sum(var_3)\nvar_5 = [[[0] * (var_9 + 1) for _ in range(var_2 + 1)] for _ in range(var_2 + 1)]\nfor var_7 in range(var_2 + 1):\n var_5[0][var_7][0] = 1\nfor var_6 in range(1, var_2 + 1):\n for var_7 in range(1, var_2 + 1):\n var_11 = var_3[var_7 - 1]\n for var_8 in range(1, var_9 + 1):\n var_5[var_6][var_7][var_8] += var_5[var_6][var_7 - 1][var_8]\n if var_8 - var_11 >= 0:\n var_5[var_6][var_7][var_8] += var_5[var_6 - 1][var_7 - 1][\n var_8 - var_11\n ]\nvar_4 = 0\nfor var_6 in range(1, var_2 + 1):\n var_10 = var_1 * var_6\n if var_10 <= var_9:\n var_4 += var_5[var_6][-1][var_10]\nprint(var_4)\n", "slow_time": 89724549521, "fast_time": 4789553056, "speedup": 18.7334, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_9"} -{"pair_id": "python_13702", "problem_id": "p03774", "language": "python", "slow_code": "from scipy.spatial.distance import cdist\nimport numpy as np\n\nvar_6, var_5 = list(map(int, input().split()))\nvar_7 = [list(map(int, input().split())) for _ in range(var_6)]\nvar_2 = [list(map(int, input().split())) for _ in range(var_5)]\n\n\nvar_1 = cdist(var_7, var_2, \"cityblock\")\nvar_4 = np.argmin(var_1, axis=1)\nfor var_3 in var_4:\n print((var_3 + 1))\n", "fast_code": "var_12, var_10 = list(map(int, input().split()))\nvar_2 = []\nfor _ in range(var_12):\n var_1, var_5 = (int(var_13) for var_13 in input().split())\n var_2.append([var_1, var_5])\nvar_7 = []\nfor _ in range(var_10):\n var_6, var_8 = (int(var_13) for var_13 in input().split())\n var_7.append([var_6, var_8])\nfor var_1, var_5 in var_2:\n var_3 = 10000000000000000000000\n for var_9, var_6 in enumerate(var_7):\n var_11 = abs(var_1 - var_6[0]) + abs(var_5 - var_6[1])\n if var_11 < var_3:\n var_3 = var_11\n var_4 = var_9\n print((var_4 + 1))\n", "slow_time": 29997139149, "fast_time": 59510865, "speedup": 504.0616, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_6"} -{"pair_id": "python_18078", "problem_id": "p03476", "language": "python", "slow_code": "import math\n\n\ndef func_1(var_7):\n if var_7 == 1:\n return False\n for var_5 in range(2, int(math.sqrt(var_7)) + 1):\n if var_7 % var_5 == 0:\n return False\n return True\n\n\nvar_1 = int(eval(input()))\nvar_2 = [0] * (10**5 + 1)\nvar_8 = [0] * (10**5 + 1)\nfor var_4 in range(1, 10**5 + 1):\n if func_1(var_4):\n var_8[var_4] = 1\n if var_8[(var_4 + 1) // 2] == 1:\n var_2[var_4] = var_2[var_4 - 1] + 1\n continue\n var_2[var_4] = var_2[var_4 - 1]\nvar_3 = 0\nfor var_4 in range(var_1):\n var_6, var_9 = list(map(int, input().split()))\n print((var_2[var_9] - var_2[var_6 - 1]))\n", "fast_code": "import sys\nimport heapq\nimport bisect\n\nvar_10 = 10**9 + 7\nvar_6 = ((-1, 0), (1, 0), (0, -1), (0, 1))\n\n\ndef func_3():\n return int(sys.stdin.readline())\n\n\ndef func_6():\n return [int(var_16) for var_16 in sys.stdin.readline().split()]\n\n\ndef func_7():\n return sys.stdin.readline()[:-1]\n\n\ndef func_4(var_11):\n return [func_3() for _ in range(var_11)]\n\n\ndef func_2(var_3, var_4):\n while var_4 != 0:\n var_3, var_4 = var_4, var_3 % var_4\n return var_3\n\n\ndef func_5(var_3, var_4):\n return var_3 * var_4 // func_2(var_3, var_4)\n\n\ndef func_1(var_1):\n var_15 = [True] * (var_1 + 1)\n var_15[0] = False\n var_15[1] = False\n var_7 = 2\n while var_7 * var_7 <= var_1:\n if var_15[var_7]:\n var_8 = var_7\n while var_7 * var_8 <= var_1:\n var_15[var_7 * var_8] = False\n var_8 += 1\n var_7 += 1\n return var_15\n\n\ndef func_8():\n var_13 = func_1(10**5)\n var_14 = [False] * (10**5 + 1)\n for var_7 in range(3, 10**5 + 1, 2):\n if var_13[var_7]:\n var_14[var_7] = var_13[(var_7 + 1) // 2]\n var_5 = [0] * (10**5 + 1)\n var_12 = 0\n for var_7 in range(1, 10**5 + 1):\n if var_14[var_7]:\n var_12 += 1\n var_5[var_7] = var_12\n var_2 = func_3()\n for _ in range(var_2):\n var_9, var_15 = func_6()\n print((var_5[var_15] - var_5[var_9 - 1]))\n\n\nif __name__ == \"__main__\":\n func_8()\n", "slow_time": 64444325168, "fast_time": 11018403136, "speedup": 5.8488, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_23"} -{"pair_id": "python_11089", "problem_id": "p03816", "language": "python", "slow_code": "from collections import defaultdict\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return list(map(list, sys.stdin.readline().split()))\n\n\ndef func_7():\n return list(sys.stdin.readline())[:-1]\n\n\ndef func_2(var_8):\n var_6 = [None for var_4 in range(var_8)]\n for var_4 in range(var_8):\n var_6[var_4] = func_1()\n return var_6\n\n\ndef func_4(var_8):\n var_6 = [None for var_4 in range(var_8)]\n for var_4 in range(var_8):\n var_6[var_4] = func_3()\n return var_6\n\n\ndef func_8(var_8):\n var_6 = [None for var_4 in range(var_8)]\n for var_4 in range(var_8):\n var_6[var_4] = func_7()\n return var_6\n\n\ndef func_6(var_8):\n var_6 = [None for var_4 in range(var_8)]\n for var_4 in range(var_8):\n var_6[var_4] = func_8()\n return var_6\n\n\nvar_7 = 1000000007\n\n\n\"\"\"\"\"\"\n\nvar_8 = func_1()\nvar_1 = func_3()\nvar_3 = defaultdict(int)\nfor var_4 in var_1:\n var_3[var_4] += 1\nvar_6 = list(var_3.keys())\nvar_5 = 0\nfor var_4 in var_6:\n var_5 ^= ~(var_3[var_4] % 2)\n var_3[var_4] = 1\nvar_2 = sum(list(var_3.values()))\nvar_2 -= 1 if var_5 % 2 else 0\nprint(var_2)\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = len(set(input().split()))\nprint((var_1 + var_1 % 2 - 1))\n", "slow_time": 111635076, "fast_time": 14126027, "speedup": 7.9028, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_3"} -{"pair_id": "python_878", "problem_id": "p03329", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_3 = []\nvar_4 = 0\nwhile 6**var_4 <= var_1:\n var_3.append(6**var_4)\n var_4 += 1\nvar_5 = 0\nwhile 9**var_5 <= var_1:\n var_3.append(9**var_5)\n var_5 += 1\nvar_2 = sorted(list(set(var_3)))\n\nvar_6 = [var_7 for var_7 in range(var_1 + 1)]\n\nvar_8 = 6\nfor var_8 in var_2:\n for var_7 in range(var_1 + 1):\n if var_7 + var_8 <= var_1:\n var_6[var_7 + var_8] = min(var_6[var_7] + 1, var_6[var_7 + var_8])\nprint((var_6[var_1]))\n", "fast_code": "import bisect as bi\n\nvar_2 = [6**var_1 for var_1 in range(7)]\nvar_3 = [9**var_1 for var_1 in range(6)]\n\n\ndef func_1(var_4):\n if var_4 < 6:\n return var_4\n else:\n var_5 = var_2[bi.bisect(var_2, var_4) - 1]\n var_6 = var_3[bi.bisect(var_3, var_4) - 1]\n return min(var_4 // var_5 + func_1(var_4 % var_5), 1 + func_1(var_4 - var_6))\n\n\nprint((func_1(int(eval(input())))))\n", "slow_time": 469811420, "fast_time": 30328375, "speedup": 15.4908, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_13"} -{"pair_id": "python_7610", "problem_id": "p03835", "language": "python", "slow_code": "import sys\nfrom io import StringIO\nimport unittest\n\n\nclass Class_1(unittest.TestCase):\n def func_1(self, input, var_7):\n var_9, var_8 = sys.stdout, sys.stdin\n sys.stdout, sys.stdin = StringIO(), StringIO(input)\n func_2()\n sys.stdout.seek(0)\n var_6 = sys.stdout.read()[:-1]\n sys.stdout, sys.stdin = var_9, var_8\n self.assertEqual(var_6, var_7)\n\n def func_3(self):\n input = \"\"\"\"\"\"\n var_7 = \"\"\"\"\"\"\n self.assertIO(input, var_7)\n\n def func_4(self):\n input = \"\"\"\"\"\"\n var_7 = \"\"\"\"\"\"\n self.assertIO(input, var_7)\n\n\ndef func_2():\n var_1, var_2 = list(map(int, input().split()))\n var_3 = 0\n for var_4 in range(var_1 + 1):\n for var_5 in range(var_1 + 1):\n if 0 <= var_2 - var_4 - var_5 <= var_1:\n var_3 += 1\n print(var_3)\n\n\nif __name__ == \"__main__\":\n\n func_2()\n", "fast_code": "var_2, var_3 = list(map(int, input().split()))\nvar_1 = 0\nfor var_4 in range(min(var_3 + 1, var_2 + 1)):\n for var_5 in range(min(var_3 + 1 - var_4, var_2 + 1)):\n if 0 <= var_3 - var_4 - var_5 <= var_2:\n var_1 += 1\nprint(var_1)\n", "slow_time": 255881830, "fast_time": 49581919, "speedup": 5.1608, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_8"} -{"pair_id": "python_13931", "problem_id": "p03762", "language": "python", "slow_code": "import sys\n\n\ndef func_9():\n return sys.stdin.readline().strip()\n\n\ndef func_10(var_7, var_9, var_10):\n return [[var_10] * var_9 for var_14 in range(var_7)]\n\n\ndef func_11(var_7, var_9, var_10, var_11):\n return [[[var_11] * var_10 for var_15 in range(var_9)] for var_14 in range(var_7)]\n\n\ndef func_12(var_7, var_9, var_10, var_11, var_12):\n return [\n [[[var_12] * var_11 for var_15 in range(var_10)] for var_15 in range(var_9)]\n for var_14 in range(var_7)\n ]\n\n\ndef func_8(var_19, var_20=1):\n return int(-(-var_19 // var_20))\n\n\ndef func_1():\n return int(eval(func_9()))\n\n\ndef func_3():\n return list(map(int, func_9().split()))\n\n\ndef func_2(var_6=None):\n return list(func_3()) if var_6 is None else [func_1() for var_14 in range(var_6)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_3 = 10**18\nvar_5 = 10**9 + 7\nvar_6, var_4 = func_3()\nvar_1 = func_2()\nvar_2 = func_2()\n\nvar_16 = var_17 = 0\nfor var_14 in range(var_6):\n var_16 += var_1[var_14] * (var_6 - var_14 - 1)\n var_17 += var_1[var_14] * var_14\n var_16 %= var_5\n var_17 %= var_5\nvar_13 = var_17 - var_16\nvar_16 = var_17 = 0\nfor var_14 in range(var_4):\n var_16 += var_2[var_14] * (var_4 - var_14 - 1)\n var_17 += var_2[var_14] * var_14\n var_16 %= var_5\n var_17 %= var_5\nvar_18 = var_17 - var_16\nvar_8 = var_13 * var_18 % var_5\nprint(var_8)\n", "fast_code": "var_6, var_4 = list(map(int, input().split()))\nvar_7 = [0] + list(map(int, input().split()))\nvar_8 = [0] + list(map(int, input().split()))\nvar_5 = 10**9 + 7\nvar_1, var_2 = 0, 0\nfor var_3 in range(1, var_6 + 1):\n var_1 += (var_3 * 2 - var_6 - 1) * var_7[var_3]\nfor var_3 in range(1, var_4 + 1):\n var_2 += (var_3 * 2 - var_4 - 1) * var_8[var_3]\nprint(((var_1 * var_2) % var_5))\n", "slow_time": 134610848, "fast_time": 37649327, "speedup": 3.5754, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_8"} -{"pair_id": "python_389", "problem_id": "p03160", "language": "python", "slow_code": "import string\nimport sys\nfrom itertools import chain, dropwhile, takewhile\n\n\ndef func_4(\n var_3, *var_12, var_7=chain.from_iterable(sys.stdin), var_15=set(string.whitespace)\n):\n def func_5():\n var_14 = lambda var_1: var_1 in var_15\n var_11 = lambda var_1: var_1 not in var_15\n return var_3(\"\".join(takewhile(var_11, dropwhile(var_14, var_7))))\n\n if not var_12:\n return func_5()\n elif len(var_12) == 1:\n return [func_5() for _ in range(var_12[0])]\n elif len(var_12) == 2:\n return [[func_5() for _ in range(var_12[1])] for _ in range(var_12[0])]\n\n\ndef func_1(*var_12, var_4=0):\n if len(var_12) == 1:\n return [var_4] * var_12[var_4]\n elif len(var_12) == 2:\n return [[var_4] * var_12[1] for _ in range(var_12[0])]\n\n\ndef func_2(**var_9):\n print(\n \", \".join(\n \"{} = {}\".format(var_8, repr(var_13)) for var_8, var_13 in var_9.items()\n ),\n file=sys.stderr,\n )\n\n\ndef func_3():\n var_10 = func_4(int)\n var_5 = func_4(int, var_10)\n var_2 = func_1(var_10)\n var_2[1] = abs(var_5[1] - var_5[0])\n for var_6 in range(2, var_10):\n var_2[var_6] = min(\n var_2[var_6 - 1] + abs(var_5[var_6] - var_5[var_6 - 1]),\n var_2[var_6 - 2] + abs(var_5[var_6] - var_5[var_6 - 2]),\n )\n print(var_2[-1])\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_1 = int(eval(input()))\nvar_3 = list(map(int, input().split()))\nvar_2 = [100010] * var_1\nvar_2[0] = 0\nfor var_4 in range(1, var_1):\n var_2[var_4] = min(\n var_2[var_4 - 1] + abs(var_3[var_4] - var_3[var_4 - 1]),\n var_2[var_4 - 2] + abs(var_3[var_4] - var_3[var_4 - 2]),\n )\nprint((var_2[var_1 - 1]))\n", "slow_time": 121786768, "fast_time": 31505269, "speedup": 3.8656, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_6"} -{"pair_id": "python_18388", "problem_id": "p02612", "language": "python", "slow_code": "import sys\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_3():\n return list(map(int, sys.stdin.buffer.readline().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.buffer.readline().split()))\n\n\nvar_2 = func_1()\nvar_1 = var_2 % 1000\nif var_1 == 0:\n print((0))\nelse:\n print((1000 - var_1))\n", "fast_code": "print((-int(eval(input())) % 1000))\n", "slow_time": 30368641, "fast_time": 8372547, "speedup": 3.6272, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_1"} -{"pair_id": "python_18394", "problem_id": "p02612", "language": "python", "slow_code": "var_2 = int(eval(input()))\nvar_1 = var_2 // 1000\nif var_2 <= 1000:\n print((1000 - var_2))\nelif var_2 % 1000 == 0:\n print((0))\nelif var_2 > 1000:\n print((((var_1 + 1) * 1000) - var_2))\n", "fast_code": "var_1 = int(eval(input()))\nprint((-(-var_1 // 1000) * 1000 - var_1))\n", "slow_time": 21022932, "fast_time": 10342155, "speedup": 2.0327, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_5"} -{"pair_id": "python_4317", "problem_id": "p03264", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_1 = 0\nfor var_2 in range(var_4):\n for var_3 in range(var_2 + 1, var_4):\n if (var_2 % 2 == 0 and var_3 % 2 == 1) or (var_2 % 2 == 1 and var_3 % 2 == 0):\n var_1 += 1\nprint(var_1)\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = var_2 // 2\nvar_3 = var_2 - var_1\nprint((var_1 * var_3))\n", "slow_time": 62556705, "fast_time": 11380501, "speedup": 5.4968, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_29"} -{"pair_id": "python_3474", "problem_id": "p02922", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\nvar_7 = 10**20\nvar_8 = 10**9 + 7\nvar_5 = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nvar_6 = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef func_2():\n return [int(var_9) for var_9 in sys.stdin.readline().split()]\n\n\ndef func_3():\n return [int(var_9) - 1 for var_9 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_4():\n return sys.stdin.readline().split()\n\n\ndef func_5():\n return eval(input())\n\n\ndef func_6():\n var_1, var_3 = func_2()\n var_4 = 1\n var_2 = 0\n while True:\n if var_4 >= var_3:\n return var_2\n var_2 += 1\n var_4 -= 1\n var_4 += var_1\n\n\nprint((func_6()))\n", "fast_code": "import math\n\nvar_1, var_2 = list(map(int, input().split()))\nprint((math.ceil((var_2 - 1) / (var_1 - 1))))\n", "slow_time": 80117443, "fast_time": 12551538, "speedup": 6.3831, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_17"} -{"pair_id": "python_5511", "problem_id": "p03251", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(10000)\n\n\ndef func_6():\n return int(input())\n\n\ndef func_7():\n return list(map(int, input().split()))\n\n\ndef func_4():\n return float(input())\n\n\ndef func_5():\n return list(map(float, input().split()))\n\n\ndef func_8():\n return input().strip()\n\n\ndef func_9():\n return list(map(str, input().split()))\n\n\ndef func_1(*var_5):\n print(*var_5, file=sys.stderr)\n\n\ndef func_3(var_7):\n import time\n\n def func_11(*var_5, **var_8):\n var_12 = time.time()\n var_11 = var_7(*var_5, **var_8)\n var_6 = time.time()\n func_1(var_6 - var_12, \"sec\")\n return var_11\n\n return func_11\n\n\n@func_3\ndef func_10(var_2, var_1, var_3, var_4, var_13, var_14):\n var_9 = max(var_13)\n var_10 = min(var_14)\n func_1(var_9, var_10)\n if var_9 < var_10 and (var_10 > var_3 and var_9 < var_4):\n return \"No War\"\n return \"War\"\n\n\ndef func_2():\n var_2, var_1, var_3, var_4 = func_7()\n var_13 = func_7()\n var_14 = func_7()\n print(func_10(var_2, var_1, var_3, var_4, var_13, var_14))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_1 = lambda: list(map(int, input().split()))\nvar_3, var_2, var_4, var_5 = var_1()\nprint((\"No \" * (max(list(var_1()) + [var_4]) < min(list(var_1()) + [var_5])) + \"War\"))\n", "slow_time": 87179202, "fast_time": 16240764, "speedup": 5.3679, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_11"} -{"pair_id": "python_8064", "problem_id": "p03078", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(100000)\n\n\ndef func_6():\n return int(input())\n\n\ndef func_7():\n return list(map(int, input().split()))\n\n\ndef func_4():\n return float(input())\n\n\ndef func_5():\n return list(map(float, input().split()))\n\n\ndef func_8():\n return input().strip()\n\n\ndef func_9():\n return list(map(str, input().split()))\n\n\ndef func_1(*var_8):\n print(*var_8, file=sys.stderr)\n\n\ndef func_3(var_11):\n import time\n\n def func_12(*var_8, **var_15):\n func_10 = time.time()\n var_16 = var_11(*var_8, **var_15)\n var_10 = time.time()\n func_1(var_10 - func_10, \"sec\")\n return var_16\n\n return func_12\n\n\n@func_3\ndef func_11(var_1, var_2, var_3, var_4):\n var_1.sort(reverse=True)\n var_2.sort(reverse=True)\n var_3.sort(reverse=True)\n\n def func_10(var_12, var_13, var_14):\n return var_1[var_12] + var_2[var_13] + var_3[var_14]\n\n var_18 = set()\n var_9 = []\n if 1 < len(var_1):\n heapq.heappush(var_9, (-func_10(1, 0, 0), (1, 0, 0)))\n var_18.add((1, 0, 0))\n if 1 < len(var_2):\n heapq.heappush(var_9, (-func_10(0, 1, 0), (0, 1, 0)))\n var_18.add((0, 1, 0))\n if 1 < len(var_3):\n heapq.heappush(var_9, (-func_10(0, 0, 1), (0, 0, 1)))\n var_18.add((0, 0, 1))\n print(func_10(0, 0, 0))\n for _ in range(var_4 - 1):\n var_19, var_12 = heapq.heappop(var_9)\n print(-var_19)\n var_17 = (var_12[0] + 1, var_12[1], var_12[2])\n if var_17[0] < len(var_1) and var_17 not in var_18:\n heapq.heappush(var_9, (-func_10(*var_17), var_17))\n var_18.add(var_17)\n var_17 = (var_12[0], var_12[1] + 1, var_12[2])\n if var_17[1] < len(var_2) and var_17 not in var_18:\n heapq.heappush(var_9, (-func_10(*var_17), var_17))\n var_18.add(var_17)\n var_17 = (var_12[0], var_12[1], var_12[2] + 1)\n if var_17[2] < len(var_3) and var_17 not in var_18:\n heapq.heappush(var_9, (-func_10(*var_17), var_17))\n var_18.add(var_17)\n\n\ndef func_2():\n\n var_5, var_6, var_7, var_4 = func_7()\n var_1 = func_7()\n var_2 = func_7()\n var_3 = func_7()\n (func_11(var_1, var_2, var_3, var_4))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_5, var_6, var_7, var_4 = map(int, input().split())\nvar_1 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_3 = list(map(int, input().split()))\nvar_1.sort(reverse=True)\nvar_2.sort(reverse=True)\nvar_3.sort(reverse=True)\nvar_8 = []\nfor var_9 in range(var_5):\n for var_10 in range(var_6):\n if (var_9 + 1) * (var_10 + 1) > var_4:\n break\n for var_11 in range(var_7):\n if (var_9 + 1) * (var_10 + 1) * (var_11 + 1) <= var_4:\n var_8.append(var_1[var_9] + var_2[var_10] + var_3[var_11])\n else:\n break\nprint(*sorted(var_8, reverse=True)[:var_4], sep=\"\\n\")\n", "slow_time": 223697403, "fast_time": 88065762, "speedup": 2.5401, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_10"} -{"pair_id": "python_6447", "problem_id": "p03332", "language": "python", "slow_code": "class Class_1:\n \"\"\"\"\"\"\n\n def __init__(self, var_10, var_1):\n self.fact = [1]\n for var_8 in range(1, var_10 + 1):\n self.fact.append(self.fact[-1] * var_8 % var_1)\n self.inv_fact = [\n pow(self.fact[var_8], var_1 - 2, var_1) for var_8 in range(var_10 + 1)\n ]\n self.MOD = var_1\n\n def func_2(self, var_9):\n \"\"\"\"\"\"\n return self.fact[var_9]\n\n def func_3(self, var_9):\n \"\"\"\"\"\"\n return self.inv_fact[var_9]\n\n def func_1(self, var_9, var_11):\n \"\"\"\"\"\"\n return (\n self.fact[var_9] * self.inv_fact[var_9 - var_11] * self.inv_fact[var_11]\n ) % self.MOD\n\n\nvar_10, var_2, var_5, var_9 = list(map(int, input().split()))\nvar_1 = 998244353\nvar_7 = Class_1(var_10, var_1)\nvar_4 = 0\nfor var_8 in range(var_10 + 1):\n if not (\n var_9 - var_2 * var_8 >= 0\n and (var_9 - var_2 * var_8) % var_5 == 0\n and (var_9 - var_2 * var_8) // var_5 <= var_10\n ):\n continue\n else:\n var_3 = var_8\n var_6 = (var_9 - var_2 * var_8) // var_5\n var_4 += var_7.combination(var_10, var_3) * var_7.combination(var_10, var_6)\n var_4 %= var_1\nprint(var_4)\n", "fast_code": "import numpy as np\n\nvar_4 = 998244353\n\n\nclass Class_1:\n def __init__(self, var_15, var_14):\n self.f = [1]\n self.mod = var_14\n for var_11 in range(1, var_15 + 1):\n self.f.append(self.f[-1] * var_11 % var_14)\n self.i = [pow(self.f[-1], var_14 - 2, var_14)]\n for var_11 in range(var_15, 0, -1):\n self.i.append(self.i[-1] * var_11 % var_14)\n self.i.reverse()\n\n def func_4(self, var_11):\n return self.f[var_11]\n\n def func_6(self, var_11):\n return self.i[var_11]\n\n def func_2(self, var_15, var_12):\n return (\n self.f[var_15]\n * self.i[var_15 - var_12]\n % self.mod\n * self.i[var_12]\n % self.mod\n if var_15 >= var_12\n else 0\n )\n\n\ndef func_5(var_6, var_8):\n if var_6 > var_8:\n var_6, var_8 = var_8, var_6\n if var_8 % var_6 == 0:\n return var_6\n return func_5(var_8 % var_6, var_6)\n\n\nvar_5, var_1, var_2, var_3 = list(map(int, input().split()))\nif var_1 < var_2:\n var_1, var_2 = var_2, var_1\n\nvar_15 = min((var_3 + var_1 - 1) // var_1, var_5) + 1\nvar_13 = var_1 * var_2 // func_5(var_1, var_2)\nvar_17 = var_13 // var_1\nvar_9 = Class_1(var_5 + 1, var_4).comb\n\n\ndef func_1(var_6, var_8):\n if var_6 > var_8:\n var_6, var_8 = var_8, var_6\n return (var_9(var_5, var_6) * var_9(var_5, var_8)) % var_4\n\n\ndef func_3(var_6, var_8):\n if var_6 <= var_5 and var_8 <= var_5:\n return func_1(var_6, var_8)\n return 0\n\n\ndef func_7(var_17):\n for var_10 in range(var_17):\n if (var_3 - var_1 * var_10) % var_2 == 0:\n return var_10\n\n\nvar_16 = func_7(var_17)\n\nvar_7 = 0\nfor var_6 in range(var_16, var_15, var_17):\n if var_1 * var_6 > var_3:\n break\n\n var_8 = (var_3 - var_1 * var_6) // var_2\n\n var_7 += func_3(var_6, var_8)\n var_7 %= var_4\nprint(var_7)\n", "slow_time": 33876778491, "fast_time": 2955702274, "speedup": 11.4615, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_4"} -{"pair_id": "python_222", "problem_id": "p03240", "language": "python", "slow_code": "var_9 = int(eval(input()))\nvar_1 = []\nfor var_4 in range(var_9):\n var_10, var_11, var_3 = list(map(int, input().split()))\n var_1.append([var_10, var_11, var_3])\nfor var_4 in range(101):\n for var_5 in range(101):\n for var_6 in range(var_9):\n if var_1[var_6][2] > 0:\n var_7 = abs(var_1[var_6][0] - var_4) + abs(var_1[var_6][1] - var_5)\n var_2 = var_7 + var_1[var_6][2]\n break\n else:\n continue\n for var_6 in range(var_9):\n var_8 = abs(var_1[var_6][0] - var_4) + abs(var_1[var_6][1] - var_5)\n if max(var_2 - var_8, 0) == var_1[var_6][2]:\n if var_6 == var_9 - 1:\n print((\"{} {} {}\".format(var_4, var_5, var_2)))\n else:\n continue\n else:\n break\n", "fast_code": "var_1 = int(eval(input()))\nvar_12 = [list(map(int, input().split())) for var_10 in range(var_1)]\n\nvar_9 = None\nvar_7 = False\nfor var_3 in range(0, 101):\n for var_4 in range(0, 101):\n var_2 = 0\n for var_11, var_13, var_8 in var_12:\n if var_8 == 0:\n continue\n var_5 = abs(var_11 - var_3)\n var_6 = abs(var_13 - var_4)\n var_2 = var_5 + var_6 + var_8\n break\n var_7 = True\n for var_11, var_13, var_8 in var_12:\n _h = max(var_2 - abs(var_11 - var_3) - abs(var_13 - var_4), 0)\n if var_8 != _h:\n var_7 = False\n break\n if var_7 is True:\n break\n if var_7 is True:\n break\nvar_9 = var_2 if var_2 is not None else 0\nprint((var_3, var_4, var_9))\n", "slow_time": 8014549402, "fast_time": 1191604347, "speedup": 6.7258, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_8"} -{"pair_id": "python_15641", "problem_id": "p02712", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_3 = 0\nfor var_2 in range(1, var_1 + 1):\n if var_2 % 3 == 0:\n continue\n elif var_2 % 5 == 0:\n continue\n else:\n var_3 += var_2\nprint(var_3)\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = 0.5 * var_4 * (1 + var_4)\n\nvar_3 = 0.5 * (\n int(var_4 / 3) * (3 + 3 * int(var_4 / 3))\n + int(var_4 / 5) * (5 + 5 * int(var_4 / 5))\n)\nvar_2 = 0.5 * (int(var_4 / 15) * (15 + int(var_4 / 15) * 15))\n\nprint((int(var_1 - var_3 + var_2)))\n", "slow_time": 29113501804, "fast_time": 26924401, "speedup": 1081.3055, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_11"} -{"pair_id": "python_7410", "problem_id": "p02912", "language": "python", "slow_code": "import heapq\nimport math\n\n\ndef _heappush_max(var_4, var_6):\n var_4.append(var_6)\n heapq._siftdown_max(var_4, 0, len(var_4) - 1)\n\n\ndef _heappop_max(var_4):\n \"\"\"\"\"\"\n var_8 = var_4.pop()\n if var_4:\n var_9 = var_4[0]\n var_4[0] = var_8\n heapq._siftup_max(var_4, 0)\n return var_9\n return var_8\n\n\n\"\"\"\"\"\"\nvar_2, var_1 = list(map(int, input().split()))\nvar_3 = [int(var_5) for var_5 in input().split()]\nheapq._heapify_max(var_3)\nfor var_7 in range(var_1):\n _heappush_max(var_3, _heappop_max(var_3) // 2)\nprint((sum(var_3)))\n", "fast_code": "def func_1(var_4, var_3, var_1):\n if var_4 == 1:\n return var_1[0] // (2**var_3)\n var_1.sort(key=lambda var_5: -var_5)\n var_2 = [var_1]\n for _ in range(var_3):\n var_7 = 0\n var_9 = var_2[0][0] if var_2[0] else -1\n for var_8 in range(1, len(var_2)):\n if var_2[var_8] and var_2[var_8][0] > var_9:\n var_7 = var_8\n var_9 = var_2[var_8][0]\n var_10 = var_2[var_7].pop(0) // 2\n if len(var_2) == var_7 + 1:\n var_2 += [[]]\n var_2[var_7 + 1] += [var_10]\n if not (var_2[0]):\n var_2.pop(0)\n return sum([sum(var_6) for var_6 in var_2])\n\n\nvar_4, var_3 = tuple([int(var_11) for var_11 in input().split(\" \")])\nvar_1 = [int(var_11) for var_11 in input().split()]\nprint((func_1(var_4, var_3, var_1)))\n", "slow_time": 374983248, "fast_time": 75792722, "speedup": 4.9475, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_12"} -{"pair_id": "python_16049", "problem_id": "p03599", "language": "python", "slow_code": "var_1, var_2, var_3, var_4, var_5, var_6 = list(map(int, input().split()))\nvar_12 = []\nfor var_7 in range(31):\n for var_8 in range(31):\n if var_1 * var_7 + var_2 * var_8 <= var_6 // 100:\n var_12.append(var_1 * var_7 + var_2 * var_8)\nvar_12.pop(var_12.index(0))\nvar_12 = list(set(var_12))\nvar_9 = [[0, 0, 0]]\nfor var_11 in var_12:\n for var_7 in range(301):\n for var_8 in range(301):\n var_10 = var_3 * var_7 + var_4 * var_8\n if var_10 <= var_11 * var_5 and var_10 + var_11 * 100 <= var_6:\n var_9.append(\n [\n 100 * var_10 / (var_10 + var_11 * 100),\n (var_10 + var_11 * 100),\n var_10,\n ]\n )\nvar_9.sort(reverse=True)\nprint((var_9[0][1], var_9[0][2]))\n", "fast_code": "var_1, var_2, var_3, var_4, var_5, var_6 = list(map(int, input().split()))\nvar_16 = set()\nfor var_7 in range(var_6 + 1):\n if var_7 * 100 * var_1 > var_6:\n break\n for var_8 in range(var_6 + 1):\n if var_7 * 100 * var_1 + var_8 * 100 * var_2 > var_6:\n break\n var_16.add(var_7 * 100 * var_1 + var_8 * 100 * var_2)\nvar_14 = set()\nfor var_9 in range(var_6 + 1):\n if var_9 * var_3 > var_6:\n break\n for var_10 in range(var_6 + 1):\n if var_9 * var_3 + var_10 * var_4 > var_6:\n break\n var_14.add(var_9 * var_3 + var_10 * var_4)\nvar_11 = -1\nvar_12 = 999\nfor var_15 in var_16:\n if var_15 == 0:\n continue\n for var_13 in var_14:\n if var_13 + var_15 > var_6:\n continue\n if var_15 * var_5 < var_13 * 100:\n continue\n if var_11 * (var_13 + var_15) < var_13 * (var_11 + var_12):\n var_11, var_12 = var_13, var_15\nprint((var_11 + var_12, var_11))\n", "slow_time": 20317356372, "fast_time": 3949896717, "speedup": 5.1438, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_11"} -{"pair_id": "python_2874", "problem_id": "p02264", "language": "python", "slow_code": "import time as ti\n\n\nclass Class_1(object):\n \"\"\"\"\"\"\n\n def __init__(self):\n \"\"\"\"\"\"\n self.length = 50010\n self.queue = [0] * self.length\n\n self.head = 0\n self.tail = 0\n\n def func_2(self, var_7):\n \"\"\"\"\"\"\n self.queue[self.tail] = var_7\n\n self.tail = (self.tail + 1) % self.length\n\n def func_1(self):\n \"\"\"\"\"\"\n\n self.queue[self.head] = 0\n self.head = (self.head + 1) % self.length\n\n def func_4(self):\n \"\"\"\"\"\"\n if self.head == self.tail:\n return True\n else:\n return False\n\n def func_5(self):\n \"\"\"\"\"\"\n if self.tail - self.head >= len(self.queue):\n return True\n else:\n return False\n\n\nclass Class_2(object):\n \"\"\"\"\"\"\n\n def __init__(self, var_6=\"\", var_9=0):\n \"\"\"\"\"\"\n self.name = var_6\n self.time = var_9\n\n def func_3(self, var_9):\n \"\"\"\"\"\"\n self.time -= var_9\n return self.time\n\n\ndef func_6(\n var_4,\n var_3,\n var_2,\n):\n \"\"\"\"\"\"\n var_10 = var_4.queue[var_4.head].forward_time(var_3)\n if var_10 <= 0:\n var_2 += var_3 + var_10\n print(var_4.queue[var_4.head].name, var_2)\n var_4.dequeue()\n elif var_10 > 0:\n var_2 += var_3\n\n var_4.enqueue(var_4.queue[var_4.head])\n var_4.dequeue()\n return var_2\n\n\nvar_4 = Class_1()\nvar_5, var_8 = [int(var_11) for var_11 in input().split()]\nvar_1 = 0\nwhile var_1 < var_5:\n var_6, var_9 = input().split()\n var_4.enqueue(Class_2(var_6, int(var_9)))\n var_1 += 1\n\nvar_2 = 0\nwhile not var_4.is_empty():\n var_2 = func_6(var_4, var_8, var_2)\n", "fast_code": "import sys\nfrom collections import deque\n\nvar_7 = sys.stdin.readlines()\nvar_6 = int(var_7[0].split()[1])\nvar_4 = lambda var_10, var_11: (var_10, int(var_11))\nvar_2 = deque(var_4(*var_3.split()) for var_3 in var_7[1:])\nvar_8, var_1 = 0, []\nwhile var_2:\n var_5, var_9 = var_2.popleft()\n if var_9 > var_6:\n var_9 -= var_6\n var_8 += var_6\n var_2.append([var_5, var_9])\n else:\n var_8 += var_9\n var_1 += [f\"{var_5} {var_8}\"]\nprint(*var_1, sep=\"\\n\")\n", "slow_time": 138359857, "fast_time": 43578246, "speedup": 3.175, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_1"} -{"pair_id": "python_14131", "problem_id": "p02741", "language": "python", "slow_code": "def func_1():\n var_1 = [\n 1,\n 1,\n 1,\n 2,\n 1,\n 2,\n 1,\n 5,\n 2,\n 2,\n 1,\n 5,\n 1,\n 2,\n 1,\n 14,\n 1,\n 5,\n 1,\n 5,\n 2,\n 2,\n 1,\n 15,\n 2,\n 2,\n 5,\n 4,\n 1,\n 4,\n 1,\n 51,\n ]\n var_2 = int(eval(input()))\n print((var_1[var_2 - 1]))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "print((ord(\"\u0004\u0001\u000e 3\u0001\u0002 \u0005 \u000f \u0005\"[int(eval(input())) % 14])))\n", "slow_time": 18739211, "fast_time": 5922161, "speedup": 3.1643, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_6"} -{"pair_id": "python_17231", "problem_id": "p02555", "language": "python", "slow_code": "from itertools import accumulate\n\nvar_1 = int(eval(input()))\nvar_7 = 10**9 + 7\nif var_1 == 1 or var_1 == 2:\n print((0))\n exit()\nvar_4 = [0] * (var_1 + 1)\nvar_4[0] = 1\nvar_2 = 0\nfor var_5 in range(var_1):\n var_3 = list(accumulate(var_4))\n for var_6 in range(var_1, 2, -1):\n var_4[var_6] = var_3[var_6 - 3] % var_7\n var_4[0] = var_4[1] = var_4[2] = 0\n var_2 = (var_2 + var_4[var_1]) % var_7\nprint(var_2)\n", "fast_code": "var_1 = 10**9 + 7\n\n\ndef func_1():\n var_2 = int(eval(input()))\n if var_2 < 3:\n print((0))\n return\n var_3 = [0] * (var_2 + 1)\n var_3[3] = 1\n for var_4 in range(4, var_2 + 1):\n var_3[var_4] = var_3[var_4 - 1] + var_3[var_4 - 3]\n var_3[var_4] %= var_1\n print((var_3[var_2]))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 2797213779, "fast_time": 36820384, "speedup": 75.9692, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_7"} -{"pair_id": "python_1600", "problem_id": "p02990", "language": "python", "slow_code": "from math import factorial\n\nvar_3, var_1 = [int(_) for _ in input().split()]\n\nvar_2 = 10**9 + 7\nvar_7 = [0] * (var_3 + 1)\nvar_7[0] = var_7[1] = 1\nfor var_5 in range(2, var_3 + 1):\n var_7[var_5] = (var_7[var_5 - 1] * var_5) % var_2\nvar_4 = [0] * (var_3 + 1)\nvar_4[0] = var_4[1] = 1\nfor var_5 in range(2, var_3 + 1):\n\n var_4[var_5] = pow(var_7[var_5], var_2 - 2, var_2)\n\n\ndef func_1(var_8, var_6):\n\n return factorial(var_8) // (factorial(var_8 - var_6) * factorial(var_6))\n\n\ndef func_2():\n for var_5 in range(1, var_1 + 1):\n var_8 = var_3 - var_1 + 1\n var_6 = var_5\n if var_6 <= var_8:\n print(((func_1(var_8, var_6) * func_1(var_1 - 1, var_5 - 1)) % var_2))\n else:\n print((0))\n\n\nfunc_2()\n", "fast_code": "import sys\n\nvar_9 = sys.stdin.readline\nfrom math import factorial\n\nvar_2 = 10**9 + 7\n\n\ndef func_1():\n var_3, var_1 = list(map(int, var_9().rstrip().split()))\n var_5 = factorial(var_3 - var_1 + 1)\n var_6 = factorial(var_1 - 1)\n var_7 = 1\n for var_8 in range(1, var_1 + 1):\n if var_3 - var_1 + 1 - var_8 < 0:\n print((0))\n continue\n var_4 = var_6 // (var_7 * factorial(var_1 - var_8))\n var_7 *= var_8\n var_4 *= var_5 // (var_7 * factorial(var_3 - var_1 + 1 - var_8))\n print((var_4 % var_2))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 317255639, "fast_time": 53921245, "speedup": 5.8837, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_5"} -{"pair_id": "python_6688", "problem_id": "p03275", "language": "python", "slow_code": "import sys\nfrom itertools import accumulate\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\nclass Class_1:\n def __init__(self, var_8):\n self.n = len(var_8)\n self.tree = [0] * (self.n + 1)\n for var_7 in range(1, self.n + 1):\n var_13 = var_8[var_7 - 1]\n while var_7 <= self.n:\n self.tree[var_7] += var_13\n var_7 += var_7 & (-var_7)\n\n def func_5(self, var_7, var_13):\n while var_7 <= self.n:\n self.tree[var_7] += var_13\n var_7 += var_7 & (-var_7)\n return\n\n def func_4(self, var_7):\n var_12 = 0\n while var_7 > 0:\n var_12 += self.tree[var_7]\n var_7 -= var_7 & (-var_7)\n return var_12\n\n\nvar_3 = func_1()\nvar_1 = func_2()\n\n\ndef func_3(var_13):\n var_2 = [0] + [1 if var_1[var_7] >= var_13 else -1 for var_7 in range(var_3)]\n var_2 = list(accumulate(var_2))\n var_2 = [var_4 + var_3 + 1 for var_4 in var_2]\n\n var_5 = Class_1([0] * (2 * var_3 + 2))\n var_6 = 0\n for var_7 in range(var_3 + 1):\n var_4 = var_2[var_7]\n var_6 += var_5.query(var_4)\n var_5.update(var_4, 1)\n if var_6 >= (var_3 * (var_3 + 1) + 3) // 4:\n return True\n return False\n\n\nvar_11 = 1\nvar_10 = 10**9 + 1\nwhile var_11 + 1 < var_10:\n var_9 = (var_11 + var_10) // 2\n if func_3(var_9):\n var_11 = var_9\n else:\n var_10 = var_9\nprint(var_11)\n", "fast_code": "var_3 = int(eval(input()))\nvar_1 = [int(_) for _ in input().split()]\n\n\ndef func_1(var_15):\n var_4 = [0] * (var_3 + 1)\n for var_8 in range(var_3):\n var_4[var_8 + 1] = (\n var_4[var_8] + 1 if var_1[var_8] >= var_15 else var_4[var_8] - 1\n )\n var_7 = abs(min(var_4)) + 1\n for var_8 in range(var_3 + 1):\n var_4[var_8] += var_7\n var_6 = 0\n var_12 = max(var_4)\n var_5 = [0] * (var_12 + 1)\n for var_11 in var_4:\n var_8 = var_11\n while var_8 > 0:\n var_6 += var_5[var_8]\n var_8 -= var_8 & -var_8\n var_8 = var_11\n while var_8 <= var_12:\n var_5[var_8] += 1\n var_8 += var_8 & -var_8\n return var_6 >= (var_2 + 1) // 2\n\n\nvar_2 = var_3 * (var_3 + 1) // 2\nvar_13 = sorted(var_1)\nvar_9 = 0\nvar_14 = var_3\nwhile var_14 - var_9 > 1:\n var_10 = (var_14 + var_9) // 2\n var_15 = var_13[var_10]\n if func_1(var_15):\n var_9 = var_10\n else:\n var_14 = var_10\nprint((var_13[var_9]))\n", "slow_time": 119661320, "fast_time": 40472668, "speedup": 2.9566, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_3"} -{"pair_id": "python_15540", "problem_id": "p02695", "language": "python", "slow_code": "from copy import deepcopy\n\nvar_3, var_2, var_4 = list(map(int, input().split()))\nvar_5, var_7, var_8, var_9 = [], [], [], []\nfor var_10 in range(var_4):\n var_12 = list(map(int, input().split()))\n var_5.append(var_12[0])\n var_7.append(var_12[1])\n var_8.append(var_12[2])\n var_9.append(var_12[3])\nvar_6 = 0\n\n\ndef func_1(var_1):\n global ans\n if len(var_1) == var_3 + 1:\n var_11 = 0\n for var_10 in range(var_4):\n if var_1[var_7[var_10]] - var_1[var_5[var_10]] == var_8[var_10]:\n var_11 += var_9[var_10]\n var_6 = max(var_6, var_11)\n return\n var_1.append(var_1[-1])\n while var_1[-1] <= var_2:\n func_1(deepcopy(var_1))\n var_1[-1] += 1\n\n\nfunc_1([1])\nprint(var_6)\n", "fast_code": "from collections import deque\n\n\ndef func_1(var_9):\n var_13 = 0\n for var_1, var_3, var_4, var_5 in var_12:\n if var_9[var_3 - 1] - var_9[var_1 - 1] == var_4:\n var_13 += var_5\n return var_13\n\n\nvar_8, var_7, var_10 = list(map(int, input().split()))\nvar_12 = [list(map(int, input().split())) for _ in range(var_10)]\nvar_2 = 0\nvar_11 = deque()\n\nfor var_6 in range(1, var_7 + 1):\n var_11.append([var_6])\nwhile var_11:\n var_15 = var_11.pop()\n if len(var_15) == var_8:\n var_14 = func_1(var_15)\n var_2 = max(var_2, var_14)\n else:\n for var_6 in range(var_15[-1], var_7 + 1):\n var_16 = var_15 + [var_6]\n var_11.append(var_16)\nprint(var_2)\n", "slow_time": 6825521871, "fast_time": 1245298365, "speedup": 5.481, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_15"} -{"pair_id": "python_12702", "problem_id": "p02703", "language": "python", "slow_code": "def func_2():\n import heapq\n\n def func_1(var_8, var_18, var_5, var_4):\n var_7 = [[float(\"inf\")] * 2505 for _ in range(var_12)]\n var_17 = []\n var_7[var_18][var_4] = 0\n heapq.heappush(var_17, (0, var_18, var_4))\n while var_17:\n var_6, var_16, var_4 = heapq.heappop(var_17)\n if var_7[var_16][var_4] < var_6:\n continue\n for var_14, var_13, var_15 in var_8[var_16]:\n if var_4 >= var_13 and var_7[var_14][var_4 - var_13] > var_6 + var_15:\n var_7[var_14][var_4 - var_13] = var_6 + var_15\n heapq.heappush(var_17, (var_6 + var_15, var_14, var_4 - var_13))\n if var_4 + var_5[var_16][0] < 2500:\n if var_7[var_16][var_4 + var_5[var_16][0]] > var_6 + var_5[var_16][1]:\n var_7[var_16][var_4 + var_5[var_16][0]] = var_6 + var_5[var_16][1]\n heapq.heappush(\n var_17,\n (var_6 + var_5[var_16][1], var_16, var_4 + var_5[var_16][0]),\n )\n else:\n if var_7[var_16][2500] > var_6 + var_5[var_16][1]:\n var_7[var_16][2500] = var_6 + var_5[var_16][1]\n heapq.heappush(var_17, (var_6 + var_5[var_16][1], var_16, 2500))\n for var_9 in var_7[1:]:\n print((min(var_9)))\n\n var_12, var_11, var_18 = list(map(int, input().split()))\n var_1 = [[] for var_9 in range(var_12)]\n var_10 = []\n for var_9 in range(var_11):\n var_19, var_20, var_2, var_3 = list(map(int, input().split()))\n var_19 -= 1\n var_20 -= 1\n var_10.append(var_2)\n var_1[var_19].append((var_20, var_2, var_3))\n var_1[var_20].append((var_19, var_2, var_3))\n var_5 = [list(map(int, input().split())) for var_9 in range(var_12)]\n func_1(var_1, 0, var_5, min(var_18, 2500))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "import sys\n\nvar_9 = lambda: sys.stdin.readline().rstrip()\nsys.setrecursionlimit(max(1000, 10**9))\nvar_24 = lambda var_25: sys.stdout.write(var_25 + \"\\n\")\nvar_13, var_11, var_16 = list(map(int, var_9().split()))\nvar_5 = [None] * var_13\nfrom collections import defaultdict\n\nvar_15 = defaultdict(set)\nvar_14 = defaultdict(set)\nvar_20 = [None] * var_11\nfor var_8 in range(var_11):\n var_19, var_21, var_1, var_3 = list(map(int, var_9().split()))\n var_19 -= 1\n var_21 -= 1\n var_20[var_8] = (var_19, var_21, var_1, var_3)\n var_15[var_19].add((var_1, var_3, var_21))\n var_15[var_21].add((var_1, var_3, var_19))\nfor var_8 in range(var_13):\n var_5[var_8] = list(map(int, var_9().split()))\nvar_12 = max(var_10[2] for var_10 in var_20) * (var_13 - 1)\nfor var_19 in range(var_13):\n for var_17 in range(var_12 + 1):\n for var_1, var_3, var_21 in var_15[var_19]:\n if var_17 >= var_1:\n var_14[var_19, var_17].add((var_3, (var_21, var_17 - var_1)))\n var_4, var_6 = var_5[var_19]\n if var_17 + var_4 <= var_12:\n var_14[var_19, var_17].add((var_6, (var_19, var_17 + var_4)))\nvar_15 = var_14\n\n\ndef func_1(var_18):\n import heapq\n\n var_23 = {}\n var_7 = [(0, var_18)]\n var_23[var_18] = 0\n while var_7:\n var_22, var_19 = heapq.heappop(var_7)\n for var_6, var_21 in var_15[var_19]:\n if var_21 not in var_23 or var_23[var_21] > var_22 + var_6:\n var_23[var_21] = var_22 + var_6\n heapq.heappush(var_7, (var_23[var_21], var_21))\n return var_23\n\n\nvar_16 = min(var_16, var_12)\nvar_23 = func_1((0, var_16))\nvar_2 = [None] * (var_13 - 1)\nfor var_19 in range(1, var_13):\n var_2[var_19 - 1] = min(var_23[var_19, var_16] for var_16 in range(var_12 + 1))\nvar_24(\"\\n\".join(map(str, var_2)))\n", "slow_time": 4949677909, "fast_time": 955969372, "speedup": 5.1777, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_12"} -{"pair_id": "python_14322", "problem_id": "p03025", "language": "python", "slow_code": "var_10, var_1, var_4, var_6 = list(map(int, input().split()))\nvar_14 = 10**9 + 7\n\n\nvar_7 = [1]\nfor var_13 in range(1, 2 * 10**5 + 1):\n var_7.append(var_7[-1] * var_13 % var_14)\nvar_8 = [pow(var_7[-1], var_14 - 2, var_14)]\nfor var_13 in range(2 * 10**5, 0, -1):\n var_8.append(var_8[-1] * var_13 % var_14)\nvar_8 = var_8[::-1]\n\n\ndef func_1(var_10, var_9):\n return var_7[var_10] * var_8[var_10 - var_9] * var_8[var_9] % var_14\n\n\nvar_2 = 0\nvar_11 = var_1 + var_4\nvar_3 = (\n pow(var_1, var_10, var_14)\n * pow(pow(var_11, var_14 - 2, var_14), var_10, var_14)\n % var_14\n)\nvar_5 = (\n pow(var_4, var_10, var_14)\n * pow(pow(var_11, var_14 - 2, var_14), var_10, var_14)\n % var_14\n)\nvar_12 = pow(var_11, var_14 - 2, var_14)\nfor var_13 in range(var_10):\n var_2 = (\n var_2\n + (var_3 * pow(var_4, var_13, var_14) + var_5 * pow(var_1, var_13, var_14))\n * func_1(var_10 - 1 + var_13, var_13)\n * pow(var_12, var_13, var_14)\n * (var_10 + var_13)\n ) % var_14\nprint((var_2 * 100 * pow(100 - var_6, var_14 - 2, var_14) % var_14))\n", "fast_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_3():\n return [int(var_16) for var_16 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return [list(var_16) for var_16 in sys.stdin.readline().split()]\n\n\ndef func_7():\n var_15 = list(sys.stdin.readline())\n if var_15[-1] == \"\\n\":\n return var_15[:-1]\n return var_15\n\n\ndef func_2(var_14):\n return [func_1() for var_10 in range(var_14)]\n\n\ndef func_4(var_14):\n return [func_3() for var_10 in range(var_14)]\n\n\ndef func_8(var_14):\n return [func_7() for var_10 in range(var_14)]\n\n\ndef func_6(var_14):\n return [func_5() for var_10 in range(var_14)]\n\n\nsys.setrecursionlimit(1000000)\nvar_13 = 1000000007\n\n\ndef func_9():\n var_14, var_2, var_4, var_5 = func_3()\n var_12 = pow(100, var_13 - 2, var_13)\n var_2 = var_2 * var_12 % var_13\n var_4 = var_4 * var_12 % var_13\n var_5 = (1 - var_5 * var_12) % var_13\n var_5 = pow(var_5, var_13 - 2, var_13)\n var_7 = [1]\n var_1 = 2 * var_14\n for var_10 in range(1, var_1 + 1):\n var_7.append(var_7[-1] * var_10 % var_13)\n var_11 = [None] * (var_1 + 1)\n var_11[var_1] = pow(var_7[var_1], var_13 - 2, var_13)\n for var_10 in range(var_1)[::-1]:\n var_11[var_10] = var_11[var_10 + 1] * (var_10 + 1) % var_13\n var_3 = 0\n var_6, var_8, var_9 = (\n pow(var_4, var_14, var_13),\n pow(var_2, var_14, var_13),\n pow(var_5, var_14 + 1, var_13),\n )\n for var_10 in range(var_14):\n var_3 += (\n var_11[var_10] * var_7[var_14 + var_10] * var_9 * (var_8 + var_6) % var_13\n )\n var_3 %= var_13\n var_6 *= var_2\n var_8 *= var_4\n var_9 *= var_5\n if var_6 >= var_13:\n var_6 %= var_13\n if var_8 >= var_13:\n var_8 %= var_13\n if var_9 >= var_13:\n var_9 %= var_13\n print((var_3 * var_11[var_14 - 1] % var_13))\n return\n\n\nif __name__ == \"__main__\":\n func_9()\n", "slow_time": 32980310839, "fast_time": 251518847, "speedup": 131.1246, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_7"} -{"pair_id": "python_16070", "problem_id": "p03599", "language": "python", "slow_code": "import sys\n\n\ndef func_9():\n return sys.stdin.readline().strip()\n\n\ndef func_10(var_10, var_13, var_14):\n return [[var_14] * var_13 for var_18 in range(var_10)]\n\n\ndef func_11(var_10, var_13, var_14, var_15):\n return [[[var_15] * var_14 for var_19 in range(var_13)] for var_18 in range(var_10)]\n\n\ndef func_12(var_10, var_13, var_14, var_15, var_17):\n return [\n [[[var_17] * var_15 for var_19 in range(var_14)] for var_19 in range(var_13)]\n for var_18 in range(var_10)\n ]\n\n\ndef func_8(var_22, var_23=1):\n return int(-(-var_22 // var_23))\n\n\ndef func_1():\n return int(eval(func_9()))\n\n\ndef func_3():\n return list(map(int, func_9().split()))\n\n\ndef func_2(var_9=None):\n return list(func_3()) if var_9 is None else [func_1() for var_18 in range(var_9)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_7 = 10**18\nvar_8 = 10**9 + 7\nvar_1, var_2, var_3, var_4, var_5, var_6 = func_3()\nvar_1 *= 100\nvar_2 *= 100\n\nvar_20 = var_5 / (100 + var_5)\n\nvar_16 = func_10(var_6 + 1, var_6 + 1, 0)\nvar_16[0][0] = 1\nfor var_18 in range(var_6 + 1):\n for var_19 in range(var_6 + 1):\n\n if var_18 + var_19 > var_6:\n break\n\n if var_16[var_18][var_19]:\n if var_18 + var_1 <= var_6:\n var_16[var_18 + var_1][var_19] = 1\n if var_18 + var_2 <= var_6:\n var_16[var_18 + var_2][var_19] = 1\n if var_19 + var_3 <= var_6:\n var_16[var_18][var_19 + var_3] = 1\n if var_19 + var_4 <= var_6:\n var_16[var_18][var_19 + var_4] = 1\nvar_11 = var_12 = 0\nvar_21 = -1\nfor var_10 in range(var_6 + 1):\n for var_13 in range(var_6 + 1):\n if var_10 == var_13 == 0:\n continue\n if var_10 + var_13 > var_6:\n break\n if var_16[var_10][var_13]:\n var_22 = var_13 / (var_10 + var_13)\n\n if var_22 > var_20:\n continue\n\n if var_21 < var_22:\n var_21 = var_22\n var_11 = var_10 + var_13\n var_12 = var_13\nprint((var_11, var_12))\n", "fast_code": "def func_1():\n var_1, var_2, var_3, var_4, var_5, var_6 = list(map(int, input().split()))\n var_14 = {}\n for var_7 in range(31):\n for var_8 in range(31):\n for var_9 in range(101):\n for var_10 in range(101):\n var_17 = (100 * var_1) * var_7 + (100 * var_2) * var_8\n var_15 = var_3 * var_9 + var_4 * var_10\n if var_17 == 0:\n break\n if var_17 + var_15 > var_6:\n break\n else:\n if var_17 / 100 * var_5 >= var_15:\n var_11 = 100 * var_15 / (var_17 + var_15)\n var_14[var_7, var_8, var_9, var_10] = var_11\n var_13 = max(var_14.values())\n for var_12, var_16 in list(var_14.items()):\n if var_16 == var_13:\n print(\n (\n (100 * var_1) * var_12[0]\n + (100 * var_2) * var_12[1]\n + var_3 * var_12[2]\n + var_4 * var_12[3],\n var_3 * var_12[2] + var_4 * var_12[3],\n )\n )\n break\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 470367340297, "fast_time": 12808802269, "speedup": 36.7222, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_19"} -{"pair_id": "python_11524", "problem_id": "p02621", "language": "python", "slow_code": "var_1 = 10**7\n\n\nfor var_3 in range(var_1):\n pass\n\nvar_2 = int(eval(input()))\nprint((var_2 + var_2**2 + var_2**3))\n", "fast_code": "var_1 = input()\nvar_1 = int(var_1)\nprint(var_1 + var_1**2 + var_1**3)\n", "slow_time": 202512920251, "fast_time": 8069517, "speedup": 25096.0399, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_20"} -{"pair_id": "python_8721", "problem_id": "p03371", "language": "python", "slow_code": "import sys\n\nvar_11 = sys.stdin.read\nvar_12 = sys.stdin.readline\nvar_13 = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nvar_4 = 1 << 60\n\n\ndef func_1():\n var_1, var_2, var_3, var_5, var_6 = list(map(int, var_12().split()))\n var_7 = var_4\n for var_10 in range(0, 2 * max(var_5, var_6) + 1, 2):\n var_8 = max(0, var_5 - var_10 // 2)\n var_9 = max(0, var_6 - var_10 // 2)\n if var_7 > var_1 * var_8 + var_2 * var_9 + var_3 * var_10:\n var_7 = var_1 * var_8 + var_2 * var_9 + var_3 * var_10\n print(var_7)\n return\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "\"\"\"\"\"\"\n\n\"\"\"\"\"\"\nvar_1, var_2, var_3, var_4, var_5 = list(map(int, input().split()))\nif var_1 + var_2 > 2 * var_3:\n var_6 = max(var_4, var_5) * var_3 * 2\n if var_4 > var_5:\n var_7 = var_5 * var_3 * 2 + abs(var_4 - var_5) * var_1\n else:\n var_7 = var_4 * var_3 * 2 + abs(var_4 - var_5) * var_2\n print((min(var_6, var_7)))\nelse:\n var_6 = var_4 * var_1 + var_5 * var_2\n print(var_6)\n", "slow_time": 798774011, "fast_time": 32104618, "speedup": 24.8803, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_2"} -{"pair_id": "python_3536", "problem_id": "p02922", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\nvar_7 = 10**20\nvar_8 = 10**9 + 7\nvar_5 = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nvar_6 = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef func_2():\n return [int(var_9) for var_9 in sys.stdin.readline().split()]\n\n\ndef func_3():\n return [int(var_9) - 1 for var_9 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_4():\n return sys.stdin.readline().split()\n\n\ndef func_5():\n return eval(input())\n\n\ndef func_6():\n var_1, var_3 = func_2()\n var_4 = 1\n var_2 = 0\n while True:\n if var_4 >= var_3:\n return var_2\n var_2 += 1\n var_4 -= 1\n var_4 += var_1\n\n\nprint((func_6()))\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nvar_3 = \"必要な電源タップ数は\"\nvar_5 = \"個です。\"\nvar_4 = 0\nvar_6 = 1\nwhile True:\n\n if var_6 >= var_2:\n break\n var_6 += var_1 - 1\n var_4 += 1\nprint(var_4)\n", "slow_time": 80117443, "fast_time": 20130768, "speedup": 3.9799, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_26"} -{"pair_id": "python_13743", "problem_id": "p02385", "language": "python", "slow_code": "import itertools\n\n\ndef func_1(var_6, var_5):\n for var_4 in var_5:\n if var_4 == \"N\":\n var_6[0], var_6[1], var_6[5], var_6[4] = (\n var_6[1],\n var_6[5],\n var_6[4],\n var_6[0],\n )\n elif var_4 == \"W\":\n var_6[0], var_6[3], var_6[5], var_6[2] = (\n var_6[2],\n var_6[0],\n var_6[3],\n var_6[5],\n )\n\n\ndef func_2():\n var_1 = list(map(int, input().split()))\n var_2 = list(map(int, input().split()))\n for var_7 in range(4):\n for var_8 in range(4):\n for var_5 in itertools.permutations(\"N\" * var_7 + \"W\" * var_8):\n var_3 = var_1[::]\n func_1(var_3, var_5)\n if var_2 == var_3:\n return True\n return False\n\n\nif __name__ == \"__main__\":\n print((\"Yes\" if func_2() else \"No\"))\n", "fast_code": "var_4 = list(map(int, input().split()))\nvar_5 = list(map(int, input().split()))\nvar_6 = [0, 1, 2]\nfor var_1 in range(6):\n var_3 = [0, 0, 0]\n for var_2 in range(3):\n if {var_4[var_2], var_4[-var_2 - 1]} != {\n var_5[var_6[var_2]],\n var_5[-var_6[var_2] - 1],\n }:\n break\n if var_4[var_2] == var_5[var_6[var_2]]:\n var_3[var_2] = 1\n if var_4[var_2] == var_4[-var_2 - 1]:\n var_3[var_2] = 2\n else:\n if 2 in var_3 or (var_1 < 3) == sum(var_3) % 2:\n print(\"Yes\")\n break\n var_6 = [var_6[2], var_6[0], var_6[1]]\n if var_1 == 2:\n var_6 = [var_6[0], var_6[2], var_6[1]]\nelse:\n print(\"No\")\n", "slow_time": 474595466, "fast_time": 59631250, "speedup": 7.9588, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_17"} -{"pair_id": "python_2328", "problem_id": "p03486", "language": "python", "slow_code": "import sys\n\n\ndef func_1():\n var_5, var_6 = sys.stdin.read().split()\n var_4, var_3 = len(var_5), len(var_6)\n var_5 = sorted(var_5)\n var_6 = list(reversed(sorted(var_6)))\n if var_4 < var_3:\n for var_2 in range(var_4):\n if var_5[var_2] < var_6[var_2]:\n var_1 = \"Yes\"\n break\n elif var_5[var_2] > var_6[var_2]:\n var_1 = \"No\"\n break\n else:\n var_1 = \"Yes\"\n else:\n for var_2 in range(var_3):\n if var_5[var_2] < var_6[var_2]:\n var_1 = \"Yes\"\n break\n elif var_5[var_2] > var_6[var_2]:\n var_1 = \"No\"\n break\n else:\n var_1 = \"No\"\n print(var_1)\n\n\nif __name__ == \"__main__\":\n\n func_1()\n", "fast_code": "var_1 = sorted(list(input().strip()))\nvar_2 = sorted(list(input().strip()), reverse=True)\nif var_1 < var_2:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 48030642, "fast_time": 16226644, "speedup": 2.96, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_18"} -{"pair_id": "python_13947", "problem_id": "p03762", "language": "python", "slow_code": "import sys\nfrom itertools import accumulate\n\n\ndef func_9():\n return sys.stdin.readline().strip()\n\n\ndef func_10(var_9, var_11, var_12):\n return [[var_12] * var_11 for var_16 in range(var_9)]\n\n\ndef func_11(var_9, var_11, var_12, var_13):\n return [[[var_13] * var_12 for var_17 in range(var_11)] for var_16 in range(var_9)]\n\n\ndef func_12(var_9, var_11, var_12, var_13, var_14):\n return [\n [[[var_14] * var_13 for var_17 in range(var_12)] for var_17 in range(var_11)]\n for var_16 in range(var_9)\n ]\n\n\ndef func_8(var_21, var_22=1):\n return int(-(-var_21 // var_22))\n\n\ndef func_1():\n return int(eval(func_9()))\n\n\ndef func_3():\n return list(map(int, func_9().split()))\n\n\ndef func_2(var_8=None):\n return list(func_3()) if var_8 is None else [func_1() for var_16 in range(var_8)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_5 = 10**18\nvar_7 = 10**9 + 7\nvar_8, var_6 = func_3()\nvar_1 = func_2()\nvar_3 = func_2()\n\nvar_2 = []\nfor var_16 in range(var_8 - 1):\n var_2.append(var_1[var_16 + 1] - var_1[var_16])\nvar_4 = []\nfor var_16 in range(var_6 - 1):\n var_4.append(var_3[var_16 + 1] - var_3[var_16])\nvar_2 = [0] + list(accumulate(var_2))\nvar_4 = [0] + list(accumulate(var_4))\n\nvar_18 = var_19 = 0\nfor var_16 in range(var_8):\n var_18 += var_2[var_16] * (var_8 - var_16 - 1)\n var_19 += var_2[var_16] * var_16\n var_18 %= var_7\n var_19 %= var_7\nvar_15 = var_19 - var_18\nvar_18 = var_19 = 0\nfor var_16 in range(var_6):\n var_18 += var_4[var_16] * (var_6 - var_16 - 1)\n var_19 += var_4[var_16] * var_16\n var_18 %= var_7\n var_19 %= var_7\nvar_20 = var_19 - var_18\nvar_10 = var_15 * var_20 % var_7\nprint(var_10)\n", "fast_code": "var_1 = 10**9 + 7\nvar_6, var_5 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_3 = list(map(int, input().split()))\nvar_2.sort()\nvar_3.sort()\nvar_7, var_8 = 0, 0\nfor var_4 in range(var_6):\n var_7 += var_2[var_4] * var_4\n var_7 -= var_2[var_4] * (var_6 - var_4 - 1)\nfor var_4 in range(var_5):\n var_8 += var_3[var_4] * var_4\n var_8 -= var_3[var_4] * (var_5 - var_4 - 1)\nprint((var_7 * var_8 % var_1))\n", "slow_time": 159803774, "fast_time": 40431050, "speedup": 3.9525, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_22"} -{"pair_id": "python_15100", "problem_id": "p03038", "language": "python", "slow_code": "import sys\n\nvar_19 = lambda var_18: [int(var_6) for var_6 in var_18.split(\" \")]\nvar_21 = lambda var_20: [int(var_18) for var_18 in var_20]\nvar_22 = lambda var_20: [var_19(var_18) for var_18 in var_20]\nvar_10 = lambda: sys.stdin.readline().rstrip()\nvar_8 = lambda: int(var_10())\nvar_9 = lambda: var_19(var_10())\nvar_13 = lambda var_17: [sys.stdin.readline().rstrip() for _ in range(var_17)]\nvar_14 = lambda var_17: [list(sys.stdin.readline().rstrip()) for _ in range(var_17)]\nvar_11 = lambda var_17: var_21(var_13(var_17))\nvar_12 = lambda var_17: var_22(var_13(var_17))\n\n\ndef func_1():\n var_4, var_3 = var_9()\n var_1 = var_9()\n var_2 = var_12(var_3)\n\n var_1.sort()\n\n var_2.sort(key=lambda var_23: var_23[1])\n var_2.reverse()\n\n var_7 = 0\n var_15 = 0\n var_16 = 0\n while var_7 < var_4 and var_15 < var_3:\n var_5, var_6 = var_2[var_15]\n while var_7 < var_4 and var_16 < var_5:\n var_1[var_7] = max(var_1[var_7], var_6)\n var_7 += 1\n var_16 += 1\n var_15 += 1\n var_16 = 0\n var_17 = sum(var_1)\n print(var_17)\n\n\nfunc_1()\n", "fast_code": "var_6, var_5 = list(map(int, input().split()))\nvar_1 = sorted(list(map(int, input().split())))\nvar_7 = [list(map(int, input().split())) for var_2 in range(var_5)]\nvar_7.sort(key=lambda var_8: var_8[1], reverse=True)\nvar_2, var_3, var_4 = 0, 0, 0\nwhile var_2 < var_6 and var_3 < var_5 and var_1[var_2] < var_7[var_3][1]:\n var_1[var_2] = var_7[var_3][1]\n var_2 += 1\n var_4 += 1\n if var_4 >= var_7[var_3][0]:\n var_3 += 1\n var_4 = 0\nprint((sum(var_1)))\n", "slow_time": 74366880, "fast_time": 35306915, "speedup": 2.1063, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_2"} -{"pair_id": "python_4242", "problem_id": "p03264", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_1 = 0\nfor var_2 in range(var_4):\n for var_3 in range(var_2 + 1, var_4):\n if (var_2 % 2 == 0 and var_3 % 2 == 1) or (var_2 % 2 == 1 and var_3 % 2 == 0):\n var_1 += 1\nprint(var_1)\n", "fast_code": "print((int(eval(input())) ** 2 >> 2))\n", "slow_time": 62556705, "fast_time": 8078783, "speedup": 7.7433, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_7"} -{"pair_id": "python_14864", "problem_id": "p02623", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**9)\n\n\ndef func_10(var_14):\n return int(var_14) - 1\n\n\ndef func_1():\n return int(eval(input()))\n\n\ndef func_7():\n return list(map(int, input().split()))\n\n\ndef func_8():\n return list(map(func_10, input().split()))\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_3():\n return list(map(func_10, input().split()))\n\n\ndef func_4(var_13):\n return [func_2() for _ in range(var_13)]\n\n\ndef func_9():\n return input().split()\n\n\ndef func_6():\n return list(eval(input()))\n\n\ndef func_5(var_13):\n return [func_6() for _ in range(var_13)]\n\n\ndef func_11(var_12, var_11=\" \"):\n print((var_11.join(list(map(str, var_12)))))\n\n\nvar_3 = float(\"inf\")\n\n\nfrom itertools import (\n combinations as comb,\n combinations_with_replacement as comb_w,\n accumulate,\n product,\n permutations,\n)\n\n\nfrom bisect import bisect_right, bisect_left\n\n\ndef func_12():\n var_6, var_5, var_4 = func_7()\n var_1 = func_2()\n var_2 = func_2()\n var_1 = [0] + list(accumulate(var_1))\n var_2 = [0] + list(accumulate(var_2))\n var_8 = 0\n for var_9, var_7 in enumerate(var_1):\n if var_7 > var_4:\n break\n var_10 = bisect_right(var_2, var_4 - var_7) - 1\n var_8 = max(var_8, var_9 + var_10)\n print(var_8)\n\n\nif __name__ == \"__main__\":\n func_12()\n", "fast_code": "import itertools as it, bisect as bs\n\nvar_4 = lambda: list(map(int, input().split()))\nvar_5 = lambda: [0] + [*it.accumulate(var_4())]\nvar_10, var_9, var_8 = var_4()\nvar_1, var_2 = var_5(), var_5()\nvar_3, var_7 = 0, var_9\nfor var_6 in range(var_10 + 1):\n var_11 = bs.bisect(var_2, var_8 - var_1[var_6])\n if var_11:\n var_3 = max(var_3, var_6 + var_11 - 1)\nprint(var_3)\n", "slow_time": 100466791, "fast_time": 30403476, "speedup": 3.3045, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_18"} -{"pair_id": "python_2891", "problem_id": "p02559", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom fractions import Fraction\nfrom functools import lru_cache, reduce\nfrom itertools import (\n combinations,\n combinations_with_replacement,\n product,\n permutations,\n accumulate,\n)\nfrom operator import add, mul, sub, itemgetter, attrgetter\nimport sys\n\nvar_19 = sys.stdin.readline\nvar_2 = 2**62 - 1\n\n\ndef func_7():\n return int(var_19())\n\n\ndef func_8():\n return list(map(int, var_19().split()))\n\n\ndef func_5():\n return float(var_19())\n\n\ndef func_6():\n return list(map(float, var_19().split()))\n\n\ndef func_9():\n return var_19().strip()\n\n\ndef func_10():\n return var_19().strip().split()\n\n\ndef func_1(*var_6):\n print(*var_6, file=sys.stderr)\n\n\ndef func_3(var_9):\n import time\n\n def func_13(*var_6, **var_13):\n var_21 = time.perf_counter()\n var_20 = var_9(*var_6, **var_13)\n var_8 = time.perf_counter()\n func_1(var_8 - var_21, \"sec\")\n return var_20\n\n return func_13\n\n\nclass Class_1:\n def __init__(self, var_7, var_15, var_11):\n _len = len(var_7)\n self.__op = var_15\n self.__size = 1 << (_len - 1).bit_length()\n self.__tree = [var_11] * self.__size + var_7 + [var_11] * (self.__size - _len)\n self.__ie = var_11\n for var_10 in range(self.__size - 1, 0, -1):\n self.__tree[var_10] = var_15(\n self.__tree[var_10 * 2], self.__tree[var_10 * 2 + 1]\n )\n\n def func_12(self, var_10, var_23):\n var_10 += self.__size\n self.__tree[var_10] = var_23\n while var_10:\n var_10 //= 2\n self.__tree[var_10] = self.__op(\n self.__tree[var_10 * 2], self.__tree[var_10 * 2 + 1]\n )\n\n def func_4(self, var_14, var_18):\n \"\"\"\"\"\"\n var_14 += self.__size\n var_18 += self.__size\n var_20 = self.__ie\n while var_14 < var_18:\n if var_14 & 1:\n var_20 = self.__op(var_20, self.__tree[var_14])\n var_14 += 1\n if var_18 & 1:\n var_18 -= 1\n var_20 = self.__op(var_20, self.__tree[var_18])\n var_14 //= 2\n var_18 //= 2\n return var_20\n\n def __getitem__(self, var_12):\n return self.__tree[var_12 + self.__size]\n\n\n@func_3\ndef func_11(var_3, var_1, var_4):\n var_22 = Class_1(var_1, add, 0)\n var_5 = []\n for var_17 in var_4:\n if var_17[0] == 0:\n _, var_16, var_24 = var_17\n var_22.update(var_16, var_22[var_16] + var_24)\n else:\n _, var_14, var_18 = var_17\n var_5.append(var_22.query(var_14, var_18))\n return var_5\n\n\ndef func_2():\n var_3, var_4 = func_8()\n var_1 = func_8()\n var_4 = [func_8() for _ in range(var_4)]\n print(*func_11(var_3, var_1, var_4), sep=\"\\n\")\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "import sys\n\nvar_6 = sys.stdin.readline\nvar_8, var_9 = list(map(int, var_6().split()))\nvar_1 = [0] * var_8\n\n\ndef func_1(var_12, var_13):\n while var_12 <= var_8:\n var_1[var_12 - 1] += var_13\n var_12 += var_12 & (-var_12)\n\n\ndef func_2(var_7):\n var_10 = 0\n while var_7 >= 1:\n var_10 += var_1[var_7 - 1]\n var_7 -= var_7 & (-var_7)\n return var_10\n\n\nvar_2 = list(map(int, var_6().split()))\nfor var_5 in range(var_8):\n func_1(var_5 + 1, var_2[var_5])\nfor var_5 in range(var_9):\n var_11, var_3, var_4 = list(map(int, var_6().split()))\n if var_11 == 0:\n func_1(var_3 + 1, var_4)\n else:\n print((func_2(var_4) - func_2(var_3)))\n", "slow_time": 205458585, "fast_time": 58638171, "speedup": 3.5038, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_25"} -{"pair_id": "python_1975", "problem_id": "p02821", "language": "python", "slow_code": "import numpy\n\nvar_11, var_10 = [int(var_9) for var_9 in input().split()]\nvar_1 = [int(var_9) for var_9 in input().split()]\nvar_12 = 10**5\nvar_2 = [0] * (1 << 18)\nfor var_5 in var_1:\n var_2[var_5] += 1\nvar_3 = numpy.fft.fft(var_2)\nvar_4 = numpy.fft.ifft(var_3 * var_3)\nvar_6 = 0\nvar_7 = 0\nfor var_9 in range(2 * var_12, -1, -1):\n var_8 = int(var_4[var_9].real + 0.5)\n if var_7 + var_8 >= var_10:\n var_6 += (var_10 - var_7) * var_9\n break\n var_7 += var_8\n var_6 += var_9 * var_8\nprint(var_6)\n", "fast_code": "from bisect import bisect_left\nfrom bisect import bisect_right\n\nvar_11, var_10 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_1 = sorted(var_1)\nvar_2 = [0] * 100010\nvar_3 = [0] * 100010\nfor var_7 in range(var_11):\n var_2[var_1[var_7]] += 1\n var_3[var_1[var_7]] += var_1[var_7]\nfor var_7 in range(100005, -1, -1):\n var_2[var_7] += var_2[var_7 + 1]\n var_3[var_7] += var_3[var_7 + 1]\n\n\ndef func_1(var_15):\n var_5 = 0\n for var_7 in range(var_11):\n if 0 <= var_15 - var_1[var_7] <= 10**5 + 5:\n var_5 += var_2[var_15 - var_1[var_7]]\n elif var_15 - var_1[var_7] < 0:\n var_5 += var_11\n if var_5 >= var_10:\n var_6 = True\n else:\n var_6 = False\n return var_6\n\n\nvar_9 = 2 * var_1[-1] + 1\nvar_13 = 1\nwhile abs(var_13 - var_9) > 1:\n var_8 = (var_13 + var_9) // 2\n if func_1(var_8):\n var_13 = var_8\n else:\n var_9 = var_8\nvar_4 = 0\nvar_14 = sum(var_1)\nvar_9 = var_13\nvar_5 = 0\nfor var_7 in range(var_11):\n var_12 = var_11 - bisect_right(var_1, var_9 - var_1[var_7] - 1)\n var_5 += var_12\n var_4 += var_12 * var_1[var_7] * 2\nvar_4 -= (var_5 - var_10) * var_9\nprint(var_4)\n", "slow_time": 48440866844, "fast_time": 8899954914, "speedup": 5.4428, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_29"} -{"pair_id": "python_13424", "problem_id": "p03298", "language": "python", "slow_code": "import sys\n\nvar_8 = sys.stdin.readline\nfrom collections import *\n\nvar_1 = int(eval(var_8()))\nvar_10 = var_8()[:-1]\nvar_5 = var_6(int)\nfor var_2 in range(1 << var_1):\n var_9, var_4 = [], []\n for var_7 in range(var_1):\n if (var_2 >> var_7) & 1:\n var_9.append(var_10[var_7])\n else:\n var_4.append(var_10[var_7])\n var_5[(\"\".join(var_9), \"\".join(var_4))] += 1\nvar_10 = var_10[::-1]\nvar_3 = 0\nfor var_2 in range(1 << var_1):\n var_9, var_4 = [], []\n for var_7 in range(var_1):\n if (var_2 >> var_7) & 1:\n var_9.append(var_10[var_7])\n else:\n var_4.append(var_10[var_7])\n var_3 += var_5[(\"\".join(var_4), \"\".join(var_9))]\nprint(var_3)\n", "fast_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_9():\n return [int(var_13) for var_13 in sys.stdin.readline().split()]\n\n\ndef func_7():\n return int(sys.stdin.readline())\n\n\ndef func_11():\n return [list(var_13) for var_13 in sys.stdin.readline().split()]\n\n\ndef func_13():\n var_11 = list(sys.stdin.readline())\n if var_11[-1] == \"\\n\":\n return var_11[:-1]\n return var_11\n\n\ndef func_8(var_9):\n return [func_7() for var_3 in range(var_9)]\n\n\ndef func_10(var_9):\n return [func_9() for var_3 in range(var_9)]\n\n\ndef func_14(var_9):\n return [func_13() for var_3 in range(var_9)]\n\n\ndef func_12(var_9):\n return [func_11() for var_3 in range(var_9)]\n\n\nsys.setrecursionlimit(1000000)\nvar_8 = 1000000007\n\n\ndef func_1():\n return\n\n\ndef func_2():\n return\n\n\ndef func_3():\n var_9 = func_7()\n var_12 = func_13()\n for var_3 in range(2 * var_9):\n var_12[var_3] = ord(var_12[var_3]) - 96\n var_5 = 27\n var_7 = 1 << var_9\n var_10 = [1 << var_4 for var_4 in range(var_9)]\n var_2 = defaultdict(lambda: 0)\n var_6 = [(0, 0)]\n for var_3 in var_12[:var_9][::-1]:\n var_6 = [(var_13[0] * var_5 + var_3, var_13[1]) for var_13 in var_6] + [\n (var_13[0], var_13[1] * var_5 + var_3) for var_13 in var_6\n ]\n for var_3 in var_6:\n var_2[var_3] += 1\n var_1 = 0\n var_6 = [(0, 0)]\n for var_3 in var_12[var_9:]:\n var_6 = [(var_13[0] * var_5 + var_3, var_13[1]) for var_13 in var_6] + [\n (var_13[0], var_13[1] * var_5 + var_3) for var_13 in var_6\n ]\n for var_3 in var_6:\n var_1 += var_2[var_3]\n print(var_1)\n return\n\n\ndef func_4():\n return\n\n\ndef func_5():\n return\n\n\ndef func_6():\n return\n\n\nif __name__ == \"__main__\":\n func_3()\n", "slow_time": 1235050271, "fast_time": 377172094, "speedup": 3.2745, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_16"} -{"pair_id": "python_17117", "problem_id": "p02555", "language": "python", "slow_code": "from itertools import accumulate\n\nvar_1 = int(eval(input()))\nvar_7 = 10**9 + 7\nif var_1 == 1 or var_1 == 2:\n print((0))\n exit()\nvar_4 = [0] * (var_1 + 1)\nvar_4[0] = 1\nvar_2 = 0\nfor var_5 in range(var_1):\n var_3 = list(accumulate(var_4))\n for var_6 in range(var_1, 2, -1):\n var_4[var_6] = var_3[var_6 - 3] % var_7\n var_4[0] = var_4[1] = var_4[2] = 0\n var_2 = (var_2 + var_4[var_1]) % var_7\nprint(var_2)\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = [0] * 2001\nvar_1[3] = 1\nfor var_2 in range(4, var_4 + 1):\n var_1[var_2] = var_1[var_2 - 3] + var_1[var_2 - 1]\nvar_3 = 10**9 + 7\nprint((var_1[var_4] % var_3))\n", "slow_time": 2797213779, "fast_time": 26198895, "speedup": 106.7684, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_9"} -{"pair_id": "python_1943", "problem_id": "p02821", "language": "python", "slow_code": "import sys\nimport math\nfrom collections import defaultdict\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_6():\n return sys.stdin.readline()[:-1]\n\n\nvar_16 = 10**9 + 7\n\n\ndef func_2():\n return int(eval(func_6()))\n\n\ndef func_3():\n return list(map(int, func_6().split()))\n\n\ndef func_4():\n return list(map(int, func_6().split()))\n\n\ndef func_5(var_4, var_17):\n if var_4 <= 0:\n return [[] for _ in range(var_17)]\n elif var_17 == 1:\n return [func_2() for _ in range(var_4)]\n else:\n var_18 = [tuple(func_3()) for _ in range(var_4)]\n return list(map(list, list(zip(*var_18))))\n\n\nimport numpy as np\n\n\ndef func_1(var_5, var_7):\n var_8 = (len(var_5) + len(var_7)).bit_length() + 1\n var_2 = 2**var_8\n var_12, var_13 = np.fft.rfft(var_5, var_2), np.fft.rfft(var_7, var_2)\n var_9 = np.rint(np.fft.irfft(var_12 * var_13, var_2)).astype(np.int64)\n return var_9[: len(var_5) + len(var_7) - 1]\n\n\nvar_4, var_3 = func_3()\nvar_1 = func_4()\nvar_14 = [0] * (max(var_1))\nfor var_5 in var_1:\n var_14[var_5 - 1] += 1\nvar_10 = np.append([0, 0], func_1(var_14, var_14))\nvar_6 = 0\nvar_11 = 0\nfor var_15 in range(2, 2 * max(var_1) + 1)[::-1]:\n if var_10[var_15]:\n var_17 = min(var_3 - var_11, var_10[var_15])\n var_11 += var_17\n var_6 += var_15 * var_17\n if var_11 == var_3:\n break\nprint(var_6)\n", "fast_code": "from itertools import accumulate\n\nvar_8, var_6 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_1.sort(reverse=True)\nvar_3 = [0] * (2 * var_1[0] + 1)\nfor var_5 in range(var_8):\n var_3[var_1[var_5]] += 1\nvar_3 = list(accumulate(var_3[::-1]))[::-1]\nvar_11 = list(accumulate([0] + var_1))\nvar_10 = 0\nvar_9 = 2 * var_1[0] + 1\nwhile var_9 - var_10 > 1:\n var_7 = (var_9 + var_10) // 2\n var_4 = 0\n for var_5 in range(var_8):\n var_4 += var_3[max(0, var_7 - var_1[var_5])]\n if var_4 >= var_6:\n var_10 = var_7\n else:\n var_9 = var_7\nvar_4 = 0\nvar_2 = 0\nfor var_5 in range(var_8):\n var_12 = min(var_3[max(0, var_9 - var_1[var_5])], var_6 - var_4)\n var_2 += var_11[var_12] + var_1[var_5] * var_12\n var_4 += var_12\nvar_2 += (var_6 - var_4) * var_10\nprint(var_2)\n", "slow_time": 694693232, "fast_time": 88054756, "speedup": 7.8893, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_0"} -{"pair_id": "python_6461", "problem_id": "p03332", "language": "python", "slow_code": "var_8 = 998244353\nvar_7 = int(3e5 + 1)\n\n\ndef func_1(var_10, var_12):\n return var_10 * pow(var_12, var_8 - 2, var_8) % var_8\n\n\nvar_4 = [1] * (var_7 + 1)\nfor var_13 in range(1, var_7 + 1):\n var_4[var_13] = (var_13 * var_4[var_13 - 1]) % var_8\nvar_5 = [1] * (var_7 + 1)\nvar_5[var_7] = func_1(1, var_4[var_7])\nfor var_13 in range(var_7, 0, -1):\n var_5[var_13 - 1] = (var_5[var_13] * var_13) % var_8\n\n\ndef func_2():\n var_9, var_1, var_2, var_6 = list(map(int, input().split()))\n var_11 = 0\n\n for var_16 in range(var_9 + 1):\n var_3 = var_6 - var_16 * var_1\n if var_3 >= 0 and var_3 % var_2 == 0 and var_3 <= var_2 * var_9:\n var_17 = var_3 // var_2\n var_14 = var_4[var_9] * var_5[var_16] * var_5[var_9 - var_16] % var_8\n var_15 = var_4[var_9] * var_5[var_17] * var_5[var_9 - var_17] % var_8\n var_11 = (var_11 + var_14 * var_15) % var_8\n print(var_11)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "def func_4():\n class Class_1:\n def __init__(self, var_13, var_12):\n self.f = [1]\n self.mod = var_12\n for var_10 in range(1, var_13 + 1):\n self.f.append(self.f[-1] * var_10 % var_12)\n self.i = [pow(self.f[-1], var_12 - 2, var_12)]\n for var_10 in range(var_13, 0, -1):\n self.i.append(self.i[-1] * var_10 % var_12)\n self.i.reverse()\n\n def func_2(self, var_10):\n return self.f[var_10]\n\n def func_3(self, var_10):\n return self.i[var_10]\n\n def func_1(self, var_13, var_11):\n return (\n self.f[var_13]\n * self.i[var_13 - var_11]\n % self.mod\n * self.i[var_11]\n % self.mod\n if var_13 >= var_11\n else 0\n )\n\n var_5, var_1, var_2, var_3 = list(map(int, input().split()))\n var_4 = 998244353\n var_9 = Class_1(var_5 + 1, var_4).comb\n var_7 = 0\n for var_6 in range(var_5 + 1):\n var_8 = (var_3 - (var_1 * var_6)) // var_2\n if var_1 * var_6 + var_2 * var_8 == var_3 and 0 <= var_8 <= var_5:\n var_7 += (var_9(var_5, var_6) * var_9(var_5, var_8)) % var_4\n var_7 %= var_4\n print(var_7)\n\n\nif __name__ == \"__main__\":\n func_4()\n", "slow_time": 37432130329, "fast_time": 5123412031, "speedup": 7.3061, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_18"} -{"pair_id": "python_6639", "problem_id": "p03803", "language": "python", "slow_code": "import sys, math\nfrom functools import lru_cache\nfrom itertools import accumulate\n\nsys.setrecursionlimit(10**9)\nvar_3 = 10**9 + 7\n\n\ndef func_3():\n return sys.stdin.readline()[:-1]\n\n\ndef func_4():\n return list(map(int, func_3().split()))\n\n\ndef func_2():\n return int(eval(func_3()))\n\n\ndef func_1(var_5):\n var_6 = [list(func_4()) for var_4 in range(var_5)]\n return [list(var_4) for var_4 in zip(*var_6)]\n\n\nvar_1, var_2 = func_4()\nif var_1 == var_2:\n print(\"Draw\")\nelif var_1 == 1:\n print(\"Alice\")\nelif var_2 == 1:\n print(\"Bob\")\nelse:\n if var_1 > var_2:\n print(\"Alice\")\n else:\n print(\"Bob\")\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nprint(([\"Draw\", [\"Bob\", \"Alice\"][(var_1 - 2) % 13 > (var_2 - 2) % 13]][var_1 != var_2]))\n", "slow_time": 58300100, "fast_time": 14930108, "speedup": 3.9049, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_6"} -{"pair_id": "python_376", "problem_id": "p03164", "language": "python", "slow_code": "def func_1():\n var_1, var_2 = list(map(int, input().split()))\n\n var_4 = [10**9 + 1 for _ in range(10**5 + 1)]\n for _ in range(var_1):\n var_7, var_5 = list(map(int, input().split()))\n for var_6 in range(10**5, 1, -1):\n if var_6 - var_5 < 1:\n break\n var_4[var_6] = min(var_4[var_6], var_4[var_6 - var_5] + var_7)\n if var_4[var_5] > var_7:\n var_4[var_5] = var_7\n var_3 = 0\n for var_5, var_7 in enumerate(var_4):\n if var_7 <= var_2:\n var_3 = max(var_3, var_5)\n print(var_3)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "import sys\n\n\ndef func_1():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\nvar_1, var_3 = func_1()\nvar_9 = [func_1() for _ in range(var_1)]\nvar_2 = var_1 * 10**3\nvar_4 = [[float(\"INF\")] * (var_2 + 1) for _ in range(var_1 + 1)]\nvar_4[0][0] = 0\nfor var_5 in range(1, var_1 + 1):\n var_8, var_7 = var_9[var_5 - 1]\n for var_6 in range(var_2 + 1):\n if var_6 - var_7 >= 0:\n var_4[var_5][var_6] = min(\n var_4[var_5][var_6], var_4[var_5 - 1][var_6 - var_7] + var_8\n )\n var_4[var_5][var_6] = min(var_4[var_5][var_6], var_4[var_5 - 1][var_6])\nprint((max([var_5 for var_5 in range(var_2 + 1) if var_4[-1][var_5] <= var_3])))\n", "slow_time": 28625540407, "fast_time": 5389440474, "speedup": 5.3114, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_17"} -{"pair_id": "python_3191", "problem_id": "p02724", "language": "python", "slow_code": "var_3 = int(eval(input()))\nvar_1 = -1\nvar_2 = -1\nwhile var_3 >= 0:\n var_3 = var_3 - 500\n var_1 = var_1 + 1\nvar_3 = var_3 + 500\nif var_3 == 0:\n var_4 = var_1 * 1000\n print(var_4)\nelse:\n while var_3 >= 0:\n var_3 = var_3 - 5\n var_2 = var_2 + 1\n var_4 = var_1 * 1000 + var_2 * 5\n print(var_4)\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = 1000 * (var_1 // 500)\nvar_1 -= 500 * (var_1 // 500)\nvar_2 += 5 * (var_1 // 5)\nprint(var_2)\n", "slow_time": 2799708692, "fast_time": 13230338, "speedup": 211.6128, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_22"} -{"pair_id": "python_12423", "problem_id": "p03674", "language": "python", "slow_code": "class Class_1:\n def __init__(self, var_2, var_13=10**9 + 7):\n var_5 = [1, 1]\n var_6 = [1, 1]\n var_8 = [0, 1]\n for var_7 in range(2, var_2):\n var_5.append(var_5[var_7 - 1] * var_7 % var_13)\n var_8.append(var_13 - var_8[var_13 % var_7] * (var_13 // var_7) % var_13)\n var_6.append(var_6[var_7 - 1] * var_8[var_7] % var_13)\n self.fac, self.finv, self.mod = var_5, var_6, var_13\n\n def func_1(self, var_14, var_9):\n if var_14 < var_9 or var_14 < 0 or var_9 < 0:\n return 0\n var_5, var_6, var_13 = self.fac, self.finv, self.mod\n return var_5[var_14] * (var_6[var_9] * var_6[var_14 - var_9] % var_13) % var_13\n\n\nvar_13 = 10**9 + 7\nvar_3, *var_1 = list(map(int, open(0).read().split()))\nvar_12 = Class_1(210000, mod=var_13)\nvar_16 = {}\nvar_10, var_15 = 0, 0\nfor var_7, var_4 in enumerate(var_1):\n if var_4 in var_16:\n var_15 = var_7\n var_10 = var_16[var_4]\n break\n var_16[var_4] = var_7\nvar_11 = var_10 + var_3 - var_15\nfor var_9 in range(1, var_3 + 2):\n print(((var_12.nCk(var_3 + 1, var_9) - var_12.nCk(var_11, var_9 - 1)) % var_13))\n", "fast_code": "var_3 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = 10**9 + 7\nvar_6 = None\nvar_5 = set()\nfor var_4 in var_1:\n if var_4 in var_5:\n var_6 = var_4\n var_5.add(var_4)\nvar_14 = var_1.index(var_6)\nvar_15 = var_3 + 1 - var_1[::-1].index(var_6) - 1\n\nvar_7 = [1, 1]\nvar_10 = [1, 1]\nvar_9 = [0, 1]\nfor var_8 in range(2, var_3 + 2):\n var_7.append((var_7[-1] * var_8) % var_2)\n var_9.append((-var_9[var_2 % var_8] * (var_2 // var_8)) % var_2)\n var_10.append((var_10[-1] * var_9[-1]) % var_2)\n\n\ndef func_1(var_12, var_13):\n if not 0 <= var_13 <= var_12:\n return 0\n return var_7[var_12] * var_10[var_13] * var_10[var_12 - var_13] % var_2\n\n\nfor var_11 in range(1, var_3 + 1 + 1):\n print(\n (\n (\n func_1(var_3 + 1, var_11)\n - func_1(max(0, var_14) + max(var_3 + 1 - var_15 - 1, 0), var_11 - 1)\n )\n % var_2\n )\n )\n", "slow_time": 20922270310, "fast_time": 42689339, "speedup": 490.1053, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_23"} -{"pair_id": "python_14292", "problem_id": "p03609", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_1, var_2 = func_6()\nprint((max(0, var_1 - var_2)))\n", "fast_code": "var_3, var_2 = list(map(int, input().split()))\nvar_1 = var_3 - var_2\nif var_1 >= 0:\n print(var_1)\nelse:\n print((0))\n", "slow_time": 52898444, "fast_time": 13844568, "speedup": 3.8209, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_14"} -{"pair_id": "python_7738", "problem_id": "p02707", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**6)\n\nvar_6 = lambda var_9: int(var_9) - 1\n\n\ndef func_1():\n return int(eval(input()))\n\n\ndef func_5():\n return list(map(int, input().split()))\n\n\ndef func_6():\n return list(map(var_6, input().split()))\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_3():\n return list(map(var_6, input().split()))\n\n\ndef func_4(var_8):\n return [func_2() for _ in range(var_8)]\n\n\nvar_2 = float(\"inf\")\n\n\ndef func_7():\n var_7 = func_1()\n var_1 = func_2()\n var_4 = [0] * var_7\n for var_5, var_3 in enumerate(var_1):\n var_4[var_3 - 1] += 1\n for var_3 in var_4:\n print(var_3)\n\n\nif __name__ == \"__main__\":\n func_7()\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = [0] * var_1\nfor var_3 in map(int, input().split()):\n var_2[var_3 - 1] = var_2[var_3 - 1] + 1\nprint((\"\\n\".join(map(str, var_2))))\n", "slow_time": 73219551, "fast_time": 21048204, "speedup": 3.4787, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_15"} -{"pair_id": "python_536", "problem_id": "p03221", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = []\nvar_4 = []\nvar_5 = [[] for var_7 in range(10**5 + 1)]\nfor var_6 in range(var_1):\n var_10 = list(map(int, input().split()))\n var_3.append(var_10[0])\n var_4.append(var_10[1])\n var_5[var_10[0]].append(var_10[1])\nfor var_6 in range(var_2 + 1):\n var_5[var_6].sort()\nfor var_6 in range(var_1):\n\n var_9 = 0\n var_12 = len(var_5[var_3[var_6]]) - 1\n while var_9 <= var_12:\n var_11 = (var_9 + var_12) // 2\n if var_5[var_3[var_6]][var_11] == var_4[var_6]:\n var_8 = var_11\n break\n elif var_5[var_3[var_6]][var_11] > var_4[var_6]:\n var_12 = var_11 - 1\n else:\n var_9 = var_11 + 1\n print((str(var_3[var_6]).rjust(6, \"0\") + str(var_8 + 1).rjust(6, \"0\")))\n", "fast_code": "def func_1():\n from collections import defaultdict\n\n var_2 = defaultdict(str)\n var_14, var_13 = list(map(int, input().split()))\n var_12 = []\n var_1 = [[] for _ in range(var_14)]\n for var_3 in range(var_13):\n var_15, var_16 = list(map(int, input().split()))\n var_10 = str(var_15).zfill(6)\n var_11 = str(var_16).zfill(10)\n var_12.append(var_10 + var_11)\n var_15 -= 1\n var_1[var_15].append(var_16)\n for var_3 in range(var_14):\n var_1[var_3].sort()\n var_7 = str(var_3 + 1).zfill(6)\n for var_4, var_5 in enumerate(var_1[var_3]):\n var_8 = str(var_4 + 1).zfill(6)\n var_9 = str(var_5).zfill(10)\n var_2[var_7 + var_9] = var_7 + var_8\n for var_6 in var_12:\n print((var_2[var_6]))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 2260230442, "fast_time": 50472956, "speedup": 44.781, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_25"} -{"pair_id": "python_14824", "problem_id": "p03575", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nfrom itertools import permutations, accumulate\nimport sys\nimport math\nimport bisect\n\n\ndef func_3():\n return [int(var_14) for var_14 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return [list(var_14) for var_14 in sys.stdin.readline().split()]\n\n\ndef func_7():\n var_11 = list(sys.stdin.readline())\n if var_11[-1] == \"\\n\":\n return var_11[:-1]\n return var_11\n\n\ndef func_2(var_8):\n return [func_1() for var_4 in range(var_8)]\n\n\ndef func_4(var_8):\n return [func_3() for var_4 in range(var_8)]\n\n\ndef func_8(var_8):\n return [func_7() for var_4 in range(var_8)]\n\n\ndef func_6(var_8):\n return [func_5() for var_4 in range(var_8)]\n\n\nsys.setrecursionlimit(1000000)\nvar_7 = 1000000007\n\n\ndef func_10():\n def func_9(var_14):\n if var_9[var_14] == var_14:\n return var_14\n var_9[var_14] = func_9(var_9[var_14])\n return var_9[var_14]\n\n def func_11(var_14, var_15):\n var_14 = func_9(var_14)\n var_15 = func_9(var_15)\n if var_10[var_14] < var_10[var_15]:\n var_9[var_14] = var_15\n else:\n var_9[var_15] = var_14\n if var_10[var_14] == var_10[var_15]:\n var_10[var_14] += 1\n\n var_8, var_6 = func_3()\n var_13 = func_4(var_6)\n for var_4 in range(var_6):\n var_13[var_4][0] -= 1\n var_13[var_4][1] -= 1\n var_2 = 0\n for var_4 in range(var_6):\n var_9 = [var_4 for var_4 in range(var_8)]\n var_10 = [0] * var_8\n var_12 = 1\n for var_5 in range(var_6):\n if var_4 == var_5:\n continue\n var_1, var_3 = var_13[var_5]\n if func_9(var_1) != func_9(var_3):\n var_12 += 1\n if var_12 >= var_8:\n break\n func_11(var_1, var_3)\n else:\n var_2 += 1\n print(var_2)\n return\n\n\nif __name__ == \"__main__\":\n func_10()\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_4 = [list(map(int, input().split())) for var_5 in range(var_1)]\nvar_3 = 0\nfor var_7 in var_4:\n var_6 = list(range(var_2))\n for var_8 in var_4:\n if var_8 != var_7:\n var_6 = [\n (\n var_6[var_8[0] - 1]\n if var_6[var_5] == var_6[var_8[1] - 1]\n else var_6[var_5]\n )\n for var_5 in range(var_2)\n ]\n if len(set(var_6)) != 1:\n var_3 += 1\nprint(var_3)\n", "slow_time": 157135134, "fast_time": 43890459, "speedup": 3.5802, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_13"} -{"pair_id": "python_7069", "problem_id": "p02732", "language": "python", "slow_code": "var_2 = [0] * 8**6\n_, var_1 = open(0)\n(*var_1,) = list(map(int, var_1.split()))\nfor var_3 in var_1:\n var_2[var_3] += 1\nvar_4 = sum(var_3 * ~-var_3 // 2 for var_3 in var_2)\nprint((\" \".join(str(var_4 - var_2[var_3] + 1) for var_3 in var_1)))\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = {}\nfor var_5 in range(var_4):\n if var_1[var_5] not in var_2:\n var_2[var_1[var_5]] = 0\n var_2[var_1[var_5]] += 1\nvar_3 = 0\nfor var_6 in var_2:\n var_3 += (var_2[var_6] * (var_2[var_6] - 1)) // 2\nfor var_7 in range(var_4):\n var_6 = var_1[var_7]\n print((var_3 - var_2[var_6] + 1))\n", "slow_time": 8948614458, "fast_time": 37354088, "speedup": 239.5619, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_3"} -{"pair_id": "python_15608", "problem_id": "p02712", "language": "python", "slow_code": "import sys\nimport math\nimport os\nimport itertools\nimport string\nimport heapq\nimport _collections\nfrom collections import Counter\nfrom collections import defaultdict\nfrom functools import lru_cache\nimport bisect\nimport re\nimport queue\nfrom decimal import *\n\n\nclass Class_2:\n @staticmethod\n def int():\n return int(sys.stdin.readline().rstrip())\n\n @staticmethod\n def string():\n return sys.stdin.readline().rstrip()\n\n @staticmethod\n def func_8():\n return [int(var_11) for var_11 in Class_2.string().split()]\n\n @staticmethod\n def func_12(var_9):\n return [eval(input()) for var_8 in range(var_9)]\n\n @staticmethod\n def func_4(var_9):\n return [Class_2.map_int() for var_8 in range(var_9)]\n\n @staticmethod\n def func_3(var_9):\n return [int(eval(input())) for var_8 in range(var_9)]\n\n\nclass Class_1:\n @staticmethod\n def func_2(var_4, var_6):\n if var_6 == 0:\n return var_4\n return Class_1.gcd(var_6, var_4 % var_6)\n\n @staticmethod\n def func_6(var_4, var_6):\n return (var_4 * var_6) // Class_1.gcd(var_4, var_6)\n\n @staticmethod\n def func_1(var_9):\n var_10 = []\n var_8 = 1\n for var_8 in range(1, int(var_9**0.5) + 1):\n if var_9 % var_8 == 0:\n var_10.append(var_8)\n if var_8 != var_9 // var_8:\n var_10.append(var_9 // var_8)\n return var_10\n\n @staticmethod\n def func_10(var_4, var_6):\n return -(-var_4 // var_6)\n\n @staticmethod\n def func_5(var_9):\n if var_9 < 2:\n return False\n if var_9 == 2:\n return True\n if var_9 % 2 == 0:\n return False\n var_7 = int(var_9**0.5) + 1\n for var_8 in range(3, var_7 + 1, 2):\n if var_9 % var_8 == 0:\n return False\n return True\n\n\ndef func_9(var_11):\n var_11 = var_11 - ((var_11 >> 1) & 0x5555555555555555)\n var_11 = (var_11 & 0x3333333333333333) + ((var_11 >> 2) & 0x3333333333333333)\n var_11 = (var_11 + (var_11 >> 4)) & 0x0F0F0F0F0F0F0F0F\n var_11 = var_11 + (var_11 >> 8)\n var_11 = var_11 + (var_11 >> 16)\n var_11 = var_11 + (var_11 >> 32)\n return var_11 & 0x0000007F\n\n\nvar_2 = int(1e09) + 7\nvar_1 = int(1e15)\n\n\ndef func_11():\n var_3 = Class_2.int()\n var_5 = 0\n for var_8 in range(1, var_3 + 1):\n if var_8 % 3 == 0 or var_8 % 5 == 0:\n continue\n var_5 += var_8\n print(var_5)\n\n\ndef func_7():\n\n func_11()\n\n\nif __name__ == \"__main__\":\n func_7()\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = int(1 / 2 * var_1 * (var_1 + 1))\nvar_4 = (var_1 // 3 * (var_1 // 3 + 1)) // 2 * 3\nvar_5 = (var_1 // 5 * (var_1 // 5 + 1)) // 2 * 5\nvar_3 = (var_1 // 15 * (var_1 // 15 + 1)) // 2 * 15\nprint((var_2 - var_4 - var_5 + var_3))\n", "slow_time": 16198743553, "fast_time": 24507251, "speedup": 660.9776, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_20"} -{"pair_id": "python_6340", "problem_id": "p03563", "language": "python", "slow_code": "var_2 = int(eval(input()))\nvar_1 = int(eval(input()))\nprint((var_2 + (var_1 - var_2) * 2))\n", "fast_code": "print(-int(input()) + (int(input()) << 1))\n", "slow_time": 15362331, "fast_time": 7622600, "speedup": 2.0154, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_1"} -{"pair_id": "python_18580", "problem_id": "p03409", "language": "python", "slow_code": "var_9 = 201\n\n\ndef func_1(var_2):\n global vis\n global EE\n var_14[var_2] = 1\n if var_2 == var_9:\n return 1\n for var_4 in range(var_9 + 1):\n if var_14[var_4] == 0 and var_1[var_2][var_4] > 0 and func_1(var_4) > 0:\n var_1[var_2][var_4] -= 1\n var_1[var_4][var_2] += 1\n return 1\n return 0\n\n\nvar_6 = int(eval(input()))\nvar_12 = []\nvar_13 = []\nfor var_4 in range(var_6):\n var_12.append([int(var_4) for var_4 in input().split()])\nfor var_4 in range(var_6):\n var_13.append([int(var_4) for var_4 in input().split()])\nvar_12.sort(key=lambda var_15: (var_15[0], var_15[1]))\nvar_13.sort(key=lambda var_15: (var_15[0], var_15[1]))\nvar_10 = []\nfor var_4 in range(len(var_12)):\n var_11 = []\n for var_5 in range(var_6):\n if var_12[var_5][0] < var_13[var_4][0] and var_12[var_5][1] < var_13[var_4][1]:\n var_11.append(var_5)\n var_10.append(var_11)\nvar_10.sort(key=lambda var_15: len(var_15))\n\n\nvar_1 = [[0 for var_15 in range(var_9 + 1)] for var_16 in range(var_9 + 11)]\nvar_14 = [0] * (var_9 + 1)\nfor var_4 in range(len(var_10)):\n var_1[0][var_4 + 1] = 1\n var_1[var_4 + 1][0] = 1\nfor var_4 in range(var_6):\n var_1[var_4 + 101][var_9] = 1\nfor var_4 in range(len(var_10)):\n for var_5 in range(len(var_10[var_4])):\n var_7, var_8 = var_4 + 1, var_10[var_4][var_5] + 101\n\n var_1[var_7][var_8] = 1\n\nvar_3 = 0\nwhile 1:\n for var_4 in range(0, var_9 + 1):\n var_14[var_4] = 0\n if func_1(0) == 0:\n break\n var_3 += 1\nprint(var_3)\n", "fast_code": "import heapq\n\nvar_1 = int(eval(input()))\nvar_9 = []\nfor var_7 in range(var_1):\n var_12, var_13 = list(map(int, input().split()))\n heapq.heappush(var_9, (-var_13, var_12))\nvar_3 = []\nfor var_7 in range(var_1):\n var_12, var_13 = list(map(int, input().split()))\n heapq.heappush(var_3, (var_12, var_13))\nvar_2 = 0\nfor var_7 in range(var_1):\n var_11 = []\n var_4, var_5 = heapq.heappop(var_3)\n var_6 = True\n while var_6:\n var_8, var_10 = heapq.heappop(var_9)\n if var_4 > var_10 and var_5 > -var_8:\n var_2 += 1\n var_6 = False\n if len(var_11) > 0:\n for var_8, var_10 in var_11:\n heapq.heappush(var_9, (var_8, var_10))\n else:\n var_11.append((var_8, var_10))\n if len(var_9) == 0:\n if len(var_11) > 0:\n for var_8, var_10 in var_11:\n heapq.heappush(var_9, (var_8, var_10))\n break\nprint(var_2)\n", "slow_time": 579236453, "fast_time": 78392535, "speedup": 7.3889, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_3"} -{"pair_id": "python_10599", "problem_id": "p02982", "language": "python", "slow_code": "var_6, var_3 = list(map(int, input().split()))\nvar_1 = [list(map(int, input().split())) for _ in range(var_6)]\n\n\ndef func_1(var_8, var_9):\n var_3 = 0\n for var_4, var_5 in zip(var_8, var_9):\n var_3 += (var_4 - var_5) ** 2\n return var_3\n\n\nvar_7 = set([var_4 * var_4 for var_4 in range(10000)])\n\n\ndef func_2(var_8):\n return var_8 in var_7\n\n\nfrom itertools import combinations\n\nvar_2 = 0\nfor var_8, var_9 in combinations(var_1, 2):\n if func_2(func_1(var_8, var_9)):\n var_2 += 1\nprint(var_2)\n", "fast_code": "var_7, var_3 = list(map(int, input().split()))\nvar_1 = []\nfor _ in range(var_7):\n var_1.append([int(var_9) for var_9 in input().split()])\nvar_2 = 0\nfor var_4 in range(var_7 - 1):\n for var_5 in range(var_4 + 1, var_7):\n var_8 = sum(\n (var_1[var_4][var_3] - var_1[var_5][var_3]) ** 2 for var_3 in range(var_3)\n )\n if any(var_6**2 == var_8 for var_6 in range(1000)):\n var_2 += 1\nprint(var_2)\n", "slow_time": 242815463, "fast_time": 46598768, "speedup": 5.2108, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_22"} -{"pair_id": "python_14317", "problem_id": "p03972", "language": "python", "slow_code": "import itertools\nimport os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\nsys.setrecursionlimit(2147483647)\nvar_3 = float(\"inf\")\nvar_2 = 10**18\nvar_4 = 10**9 + 7\n\n\nclass Class_1:\n def __init__(self, func_2=None, var_15=None):\n \"\"\"\"\"\"\n assert func_2 is not None or var_15 is not None\n if func_2 is not None:\n self._parents = [var_13 for var_13 in range(func_2)]\n self._ranks = [0 for _ in range(func_2)]\n self._sizes = [1 for _ in range(func_2)]\n else:\n self._parents = {var_14: var_14 for var_14 in var_15}\n self._ranks = {var_14: 0 for var_14 in var_15}\n self._sizes = {var_14: 1 for var_14 in var_15}\n\n def func_4(self, var_24, var_25):\n \"\"\"\"\"\"\n var_24 = self.root(var_24)\n var_25 = self.root(var_25)\n if var_24 == var_25:\n return\n\n if self._ranks[var_24] > self._ranks[var_25]:\n\n self._parents[var_25] = var_24\n self._sizes[var_24] += self._sizes[var_25]\n else:\n\n self._parents[var_24] = var_25\n self._sizes[var_25] += self._sizes[var_24]\n if self._ranks[var_24] == self._ranks[var_25]:\n self._ranks[var_25] += 1\n\n def func_1(self, var_24):\n \"\"\"\"\"\"\n if self._parents[var_24] == var_24:\n return var_24\n self._parents[var_24] = self.root(self._parents[var_24])\n return self._parents[var_24]\n\n def func_2(self, var_24):\n \"\"\"\"\"\"\n return self._sizes[self.root(var_24)]\n\n\nvar_7, var_1 = list(map(int, sys.stdin.readline().split()))\nvar_5 = [int(sys.stdin.readline()) for _ in range(var_7)]\nvar_6 = [int(sys.stdin.readline()) for _ in range(var_1)]\n\n\ndef func_3():\n var_9 = []\n var_22 = []\n for var_10, var_23 in itertools.product(\n list(range(var_1 + 1)), list(range(var_7 + 1))\n ):\n if var_23 < var_7:\n var_9.append((var_5[var_23], (var_23, var_10), (var_23 + 1, var_10)))\n if var_10 < var_1:\n var_9.append((var_6[var_10], (var_23, var_10), (var_23, var_10 + 1)))\n for var_10, var_23 in itertools.product(\n list(range(var_1 + 1)), list(range(var_7 + 1))\n ):\n var_22.append((var_23, var_10))\n var_9.sort()\n\n var_19 = Class_1(nodes=var_22)\n var_16 = 0\n for var_17, var_20, var_18 in var_9:\n if var_19.root(var_20) != var_19.root(var_18):\n var_19.unite(var_20, var_18)\n var_16 += var_17\n return var_16\n\n\nvar_12 = var_5.copy()\n\nvar_22 = var_6.copy()\nvar_12.sort(reverse=True)\nvar_22.sort(reverse=True)\nvar_8 = 0\nvar_21 = var_7 + 1\nvar_11 = var_1 + 1\nwhile var_12 or var_22:\n if not var_22 or (var_12 and var_12[-1] < var_22[-1]):\n\n var_8 += var_12.pop() * var_11\n var_21 -= 1\n else:\n\n var_8 += var_22.pop() * var_21\n var_11 -= 1\nprint(var_8)\n", "fast_code": "import sys\n\nvar_6 = sys.stdin.readline\nvar_4, var_1 = list(map(int, var_6().split()))\nvar_2 = [int(eval(var_6())) for _ in range(var_4)] + [float(\"inf\")]\nvar_3 = [int(eval(var_6())) for _ in range(var_1)] + [float(\"inf\")]\nvar_2.sort(reverse=True)\nvar_3.sort(reverse=True)\nvar_5 = 0\nvar_4 += 1\nvar_1 += 1\nwhile True:\n if var_4 == var_1 == 1:\n break\n elif var_3[-1] < var_2[-1] or (var_3[-1] == var_2[-1] and var_4 <= var_1):\n var_5 += var_4 * var_3[-1]\n var_1 -= 1\n var_3.pop()\n elif var_3[-1] > var_2[-1] or (var_3[-1] == var_2[-1] and var_4 > var_1):\n var_5 += var_1 * var_2[-1]\n var_4 -= 1\n var_2.pop()\nprint(var_5)\n", "slow_time": 217485236, "fast_time": 70538556, "speedup": 3.0832, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_1"} -{"pair_id": "python_9287", "problem_id": "p02792", "language": "python", "slow_code": "var_9 = int(eval(input()))\nvar_2 = 0\nfor var_5 in range(1, var_9 + 1):\n var_1 = str(var_5)[0]\n var_3 = str(var_5)[-1]\n for var_4 in range(1, 7):\n if var_4 == 1:\n if var_1 == var_3:\n var_2 += 1\n elif var_3 != \"0\":\n var_7 = int(var_3 + \"0\" * (var_4 - 2) + var_1)\n var_8 = int(var_3 + \"9\" * (var_4 - 2) + var_1)\n if var_7 > var_9:\n break\n if var_8 <= var_9:\n var_2 += 10 ** (var_4 - 2)\n else:\n var_10 = str(var_9)\n for var_6 in range(1, len(var_10) - 1):\n var_2 += int(var_10[var_6]) * 10 ** (max(var_4 - 2 - var_6, 0))\n if var_10[-1] >= var_1:\n var_2 += 1\n break\nprint(var_2)\n", "fast_code": "from itertools import product\n\n\ndef func_1(var_7):\n var_1 = len(var_7)\n if var_1 == 1:\n return var_7\n var_4, var_6, var_5 = int(var_7[0]), int(var_7[1:-1] or 0), int(var_7[-1])\n var_8 = [[0] * 10] + [[int(\"1\" * (var_1 - 2) or 0)] * 10 for _ in range(9)]\n for var_2 in range(1, 10):\n var_8[var_2][var_2] += 1\n for var_2, var_3 in product(list(range(1, var_4)), list(range(10))):\n var_8[var_2][var_3] += 10 ** (var_1 - 2)\n for var_3 in range(var_5 + 1):\n var_8[var_4][var_3] += var_6 + 1\n for var_3 in range(var_5 + 1, 10):\n var_8[var_4][var_3] += var_6\n return str(\n sum(\n var_8[var_2][var_3] * var_8[var_3][var_2]\n for var_2, var_3 in product(list(range(1, 10)), repeat=2)\n )\n )\n\n\nif __name__ == \"__main__\":\n import sys\n\n print((func_1(sys.stdin.read().strip())))\n", "slow_time": 516156800, "fast_time": 78728098, "speedup": 6.5562, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_26"} -{"pair_id": "python_5219", "problem_id": "p02729", "language": "python", "slow_code": "var_6, var_5 = list(map(int, input().split()))\nvar_1 = []\nfor var_3 in range(1, var_6 + 1):\n var_1.append(2 * var_3)\nfor var_4 in range(1, var_5 + 1):\n var_1.append(2 * var_4 - 1)\nvar_2 = 0\nfor var_3 in range(len(var_1) - 1):\n for var_4 in range(var_3 + 1, len(var_1)):\n if (var_1[var_3] + var_1[var_4]) % 2 == 0:\n var_2 += 1\nprint(var_2)\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = var_2 * (var_2 - 1) // 2 + var_1 * (var_1 - 1) // 2\nprint(var_3)\n", "slow_time": 809200323, "fast_time": 12713743, "speedup": 63.6477, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_11"} -{"pair_id": "python_11452", "problem_id": "p03504", "language": "python", "slow_code": "var_8, var_1 = list(map(int, input().split()))\nvar_2 = [tuple(map(int, input().split())) for _ in range(var_8)]\nvar_7 = 2 * 10**5 + 2\nvar_3 = [0] * var_7\nfor var_11 in range(1, var_1 + 1):\n var_4 = [0] * var_7\n for var_9, var_10, var_5 in var_2:\n if var_5 == var_11:\n\n var_4[2 * var_9 - 1] += 1\n var_4[2 * var_10] -= 1\n for var_6 in range(1, var_7):\n var_4[var_6] += var_4[var_6 - 1]\n for var_6 in range(var_7):\n if var_4[var_6] > 0:\n var_3[var_6] += 1\nprint((max(var_3)))\n", "fast_code": "import functools\n\nvar_2, var_1 = list(map(int, input().split()))\nvar_3 = [[0 for var_6 in range(var_1)] for var_7 in range(10**5 + 1)]\nvar_4 = 0\nfor var_7 in range(var_2):\n var_10, var_11, var_6 = list(map(int, input().split()))\n var_4 = max(var_11, var_4)\n for var_8 in range(var_10 - 1, var_11):\n var_3[var_8][var_6 - 1] = 1\nvar_5 = 0\nfor var_9 in var_3[: var_4 + 1]:\n var_5 = max(sum(var_9), var_5)\nprint(var_5)\n", "slow_time": 88725171847, "fast_time": 12772200429, "speedup": 6.9467, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_27"} -{"pair_id": "python_3259", "problem_id": "p03354", "language": "python", "slow_code": "import sys\n\n\ndef func_11():\n return sys.stdin.readline().strip()\n\n\ndef func_13(var_6, var_7, var_8):\n return [[var_8] * var_7 for var_12 in range(var_6)]\n\n\ndef func_14(var_6, var_7, var_8, var_10):\n return [[[var_10] * var_8 for var_13 in range(var_7)] for var_12 in range(var_6)]\n\n\ndef func_15(var_6, var_7, var_8, var_10, var_11):\n return [\n [[[var_11] * var_10 for var_13 in range(var_8)] for var_13 in range(var_7)]\n for var_12 in range(var_6)\n ]\n\n\ndef func_8(var_18, var_19=1):\n return int(-(-var_18 // var_19))\n\n\ndef func_1():\n return int(eval(func_11()))\n\n\ndef func_3():\n return list(map(int, func_11().split()))\n\n\ndef func_2(var_4=None):\n return list(func_3()) if var_4 is None else [func_1() for var_12 in range(var_4)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_1 = float(\"inf\")\nvar_3 = 10**9 + 7\n\n\nclass Class_1:\n \"\"\"\"\"\"\n\n def __init__(self, var_14):\n self.n = var_14\n\n self.par = [var_12 for var_12 in range(var_14 + 1)]\n\n self.rank = [0] * (var_14 + 1)\n\n self.size = [1] * (var_14 + 1)\n\n self.tree = [True] * (var_14 + 1)\n\n def func_9(self, var_18):\n \"\"\"\"\"\"\n\n if self.par[var_18] == var_18:\n return var_18\n else:\n\n self.par[var_18] = self.find(self.par[var_18])\n return self.par[var_18]\n\n def func_17(self, var_18, var_19):\n \"\"\"\"\"\"\n\n var_18 = self.find(var_18)\n var_19 = self.find(var_19)\n\n if var_18 == var_19:\n self.tree[var_18] = False\n return\n if not self.tree[var_18] or not self.tree[var_19]:\n self.tree[var_18] = self.tree[var_19] = False\n\n if self.rank[var_18] < self.rank[var_19]:\n self.par[var_18] = var_19\n self.size[var_19] += self.size[var_18]\n else:\n self.par[var_19] = var_18\n self.size[var_18] += self.size[var_19]\n\n if self.rank[var_18] == self.rank[var_19]:\n self.rank[var_18] += 1\n\n def func_16(self, var_18, var_19):\n \"\"\"\"\"\"\n return self.find(var_18) == self.find(var_19)\n\n def func_10(self, var_18):\n \"\"\"\"\"\"\n return self.size[self.find(var_18)]\n\n def func_12(self, var_18):\n \"\"\"\"\"\"\n return self.tree[self.find(var_18)]\n\n def len(self):\n \"\"\"\"\"\"\n var_16 = set()\n for var_12 in range(self.n + 1):\n var_16.add(self.find(var_12))\n\n return len(var_16) - 1\n\n\nvar_4, var_2 = func_3()\nvar_5 = [var_15 - 1 for var_15 in func_2()]\nvar_17 = Class_1(var_4)\nfor var_12 in range(var_2):\n var_6, var_7 = func_3()\n var_6 -= 1\n var_7 -= 1\n var_17.union(var_5[var_6], var_5[var_7])\nvar_9 = 0\nfor var_12 in range(var_4):\n var_15 = var_5[var_12]\n if var_17.same(var_15, var_12):\n var_9 += 1\nprint(var_9)\n", "fast_code": "def func_2():\n var_5, var_4 = list(map(int, input().split()))\n var_8 = list(map(int, input().split()))\n var_7 = [var_3 for var_3 in range(var_5)]\n\n def func_1(var_11):\n var_6 = var_7[var_11]\n if var_6 == var_11:\n return var_11\n var_1 = func_1(var_6)\n var_7[var_11] = var_1\n return var_1\n\n for var_3 in range(var_4):\n var_11, var_12 = list(map(int, input().split()))\n var_11, var_12 = var_11 - 1, var_12 - 1\n var_9, var_10 = func_1(var_11), func_1(var_12)\n var_7[var_12] = var_9\n var_7[var_10] = var_9\n var_2 = 0\n for var_3 in range(var_5):\n if func_1(var_3) == func_1(var_8[var_3] - 1):\n var_2 += 1\n print(var_2)\n\n\nfunc_2()\n", "slow_time": 247598194, "fast_time": 62879954, "speedup": 3.9376, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_1"} -{"pair_id": "python_841", "problem_id": "p02642", "language": "python", "slow_code": "var_8 = int(eval(input()))\nvar_1 = sorted(map(int, input().split()))\nvar_2 = 10**6\nvar_7 = [1] * (var_2 + 1)\nvar_4 = set()\nvar_6 = set()\nvar_5 = [0] * (var_2 + 1)\nfor var_3 in var_1:\n var_5[var_3] += 1\n if var_5[var_3] == 2 and var_7[var_3]:\n var_6.add(var_3)\n continue\n if 2 < var_5[var_3]:\n continue\n if var_7[var_3]:\n var_4.add(var_3)\n for var_9 in range(2 * var_3, var_2 + 1, var_3):\n var_7[var_9] = 0\nprint((len(var_4 - var_6)))\n", "fast_code": "from math import *\nfrom copy import *\nfrom heapq import *\nfrom string import *\nfrom random import *\nfrom bisect import *\nfrom sys import (\n stdin,\n)\nfrom sys import maxsize\nfrom operator import *\nfrom itertools import *\nfrom decimal import Decimal\nfrom collections import Counter\nfrom collections import defaultdict\n\n\"\"\"\"\"\"\n\n\ndef func_1(var_6):\n var_8 = len(var_6)\n var_2, var_7 = 0, max(var_6)\n var_4 = [0] * (var_7 + 1)\n var_6.sort()\n var_2 = 0\n var_3 = dict(Counter(var_6))\n for var_5 in var_6:\n var_9 = 2\n while var_5 * var_9 <= var_7:\n var_4[var_5 * var_9] = 1\n var_9 += 1\n for var_5 in var_6:\n if not var_4[var_5] and var_3[var_5] == 1:\n var_2 += 1\n return var_2\n\n\nvar_1 = int(stdin.readline())\nvar_6 = list(map(int, stdin.readline().rstrip().split()))\nvar_2 = func_1(var_6)\nprint(var_2)\n", "slow_time": 24452317730, "fast_time": 75729886, "speedup": 322.8886, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_27"} -{"pair_id": "python_10968", "problem_id": "p02640", "language": "python", "slow_code": "var_3, var_4 = list(map(int, input().split()))\nfor var_1 in range(0, 101):\n for var_2 in range(0, 101):\n if var_1 + var_2 == var_3 and var_1 * 2 + var_2 * 4 == var_4:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nprint((\"NYoe s\"[(2 * var_1 <= var_2 <= 4 * var_1) > var_2 % 2 :: 2]))\n", "slow_time": 502995557, "fast_time": 12951138, "speedup": 38.8379, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_16"} -{"pair_id": "python_1644", "problem_id": "p02990", "language": "python", "slow_code": "var_2 = 3000\nvar_3 = 1000000007\nvar_5 = [0] * var_2\nvar_8 = [0] * var_2\nvar_6 = [0] * var_2\n\n\ndef func_2():\n global factrial, inverse, factrial_inverse\n var_5[0] = 1\n var_5[1] = 1\n var_8[1] = 1\n var_6[0] = 1\n var_6[1] = 1\n for var_7 in range(2, var_2):\n var_5[var_7] = var_5[var_7 - 1] * var_7 % var_3\n var_8[var_7] = var_3 - var_8[var_3 % var_7] * (var_3 // var_7) % var_3\n var_6[var_7] = var_6[var_7 - 1] * var_8[var_7] % var_3\n\n\ndef func_1(var_10, var_9):\n global factrial, inverse, factrial_inverse\n if var_10 < var_9:\n return 0\n if var_10 < 0 or var_9 < 0:\n return 0\n return var_5[var_10] * (var_6[var_9] * var_6[var_10 - var_9] % var_3) % var_3\n\n\nfunc_2()\nvar_4, var_1 = list(map(int, input().split()))\nfor var_7 in range(1, var_1 + 1):\n print((func_1(var_4 - var_1 + 1, var_7) * func_1(var_1 - 1, var_7 - 1) % var_3))\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_6 = max(var_1, var_2 - var_1 + 1)\nvar_3 = [0] * (var_6 + 1)\nvar_3[0] = 1\nfor var_4 in range(var_6):\n var_3[var_4 + 1] = var_3[var_4] * (var_4 + 1) % 1000000007\n\n\ndef func_1(var_6, var_5):\n if var_6 == 0 and var_5 == 0:\n return 1\n if var_6 < var_5 or var_5 < 0:\n return 0\n return (\n var_3[var_6]\n * pow(var_3[var_6 - var_5], 1000000005, 1000000007)\n * pow(var_3[var_5], 1000000005, 1000000007)\n % 1000000007\n )\n\n\nvar_7 = []\nfor var_4 in range(1, var_1 + 1):\n var_7.append(\n func_1(var_1 - 1, var_4 - 1) * func_1(var_2 - var_1 + 1, var_4) % 1000000007\n )\nprint((\"\\n\".join(str(var_4) for var_4 in var_7)))\n", "slow_time": 540743413, "fast_time": 79708021, "speedup": 6.7841, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_20"} -{"pair_id": "python_2986", "problem_id": "p02994", "language": "python", "slow_code": "import copy\n\nvar_2, var_1 = list(map(int, input().split()))\nvar_4 = []\nfor var_6 in range(1, var_2 + 1):\n var_4.append(var_1 + var_6 - 1)\nvar_5 = sum(var_4)\nfor var_6 in range(len(var_4)):\n var_3 = copy.deepcopy(var_4)\n del var_3[var_6]\n if var_6 == 0:\n var_8 = abs(var_5 - sum(var_3))\n var_7 = var_6\n if abs(var_5 - sum(var_3)) < var_8:\n var_8 = abs(var_5 - sum(var_3))\n var_7 = var_6\ndel var_4[var_7]\nprint((sum(var_4)))\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = list([var_1 + var_4 - 1 for var_4 in range(1, var_2 + 1)])\nprint((sum(var_3) - min(var_3, key=abs)))\n", "slow_time": 61092239, "fast_time": 20562455, "speedup": 2.9711, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_15"} -{"pair_id": "python_7456", "problem_id": "p03545", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_1 = list(map(int, sys.stdin.readline().rstrip()))\nfrom itertools import product\n\nvar_2 = [\"+\", \"-\"]\nfor var_3 in product(var_2, repeat=3):\n var_4 = var_1[0]\n for var_5 in range(3):\n if var_3[var_5] == \"+\":\n var_4 += var_1[var_5 + 1]\n else:\n var_4 -= var_1[var_5 + 1]\n if var_4 == 7:\n print(\n (\n str(var_1[0])\n + var_3[0]\n + str(var_1[1])\n + var_3[1]\n + str(var_1[2])\n + var_3[2]\n + str(var_1[3])\n + \"=7\"\n )\n )\n break\n", "fast_code": "import sys\n\nvar_1 = list(map(int, sys.stdin.readline().rstrip()))\nfrom itertools import product\n\nvar_2 = [\"+\", \"-\"]\nfor var_3 in product(var_2, repeat=3):\n var_4 = var_1[0]\n for var_5 in range(3):\n if var_3[var_5] == \"+\":\n var_4 += var_1[var_5 + 1]\n else:\n var_4 -= var_1[var_5 + 1]\n if var_4 == 7:\n print(\n (\n str(var_1[0])\n + var_3[0]\n + str(var_1[1])\n + var_3[1]\n + str(var_1[2])\n + var_3[2]\n + str(var_1[3])\n + \"=7\"\n )\n )\n break\n", "slow_time": 83854575, "fast_time": 39250104, "speedup": 2.1364, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_26"} -{"pair_id": "python_14070", "problem_id": "p02244", "language": "python", "slow_code": "from sys import stdin\n\nvar_2 = 8\nvar_1 = -1\nvar_3 = 1\nvar_13 = [var_1] * var_2\nvar_6 = [var_1] * var_2\nvar_8 = [var_1] * (2 * var_2 - 1)\nvar_7 = [var_1] * (2 * var_2 - 1)\nvar_4 = [[False] * var_2 for _ in range(var_2)]\nvar_11 = int(stdin.readline())\nfor _ in range(0, var_11):\n var_12, var_5 = list(map(int, stdin.readline().split()))\n var_4[var_12][var_5] = True\n\n\ndef func_1():\n for var_9 in range(0, var_2):\n for var_10 in range(0, var_2):\n if var_4[var_9][var_10] != 0 and var_13[var_9] != var_10:\n return\n for var_9 in range(0, var_2):\n print((\".\" * var_13[var_9] + \"Q\" + \".\" * (8 - var_13[var_9] - 1)))\n\n\ndef func_2(var_9):\n if var_9 == var_2:\n func_1()\n return\n for var_10 in range(0, var_2):\n if (\n var_3 == var_6[var_10]\n or var_3 == var_8[var_9 + var_10]\n or var_3 == var_7[var_9 - var_10 + var_2 - 1]\n ):\n continue\n var_13[var_9] = var_10\n var_6[var_10] = var_8[var_9 + var_10] = var_7[var_9 - var_10 + var_2 - 1] = (\n var_3\n )\n func_2(var_9 + 1)\n var_13[var_9] = var_6[var_10] = var_8[var_9 + var_10] = var_7[\n var_9 - var_10 + var_2 - 1\n ] = var_1\n\n\nfunc_2(0)\n", "fast_code": "var_12 = [True] * 8\nvar_3 = [True] * 8\nvar_5 = [True] * 15\nvar_4 = [True] * 15\nvar_1 = [[\".\", \".\", \".\", \".\", \".\", \".\", \".\", \".\"] for var_7 in range(8)]\nimport sys\n\nvar_6 = sys.stdin\nvar_9 = int(var_6.readline())\nfor var_10 in var_6:\n var_11, var_2 = map(int, var_10.split())\n var_12[var_11] = \"INIT\"\n var_3[var_2] = \"INIT\"\n var_5[var_11 + var_2] = False\n var_4[var_11 + (7 - var_2)] = False\n var_1[var_11][var_2] = \"Q\"\n\n\ndef func_1(var_7=0):\n if var_7 == 8:\n for var_10 in var_1:\n print(*var_10, sep=\"\")\n return\n if var_12[var_7] == \"INIT\":\n func_1(var_7 + 1)\n elif var_12[var_7]:\n for var_8 in range(8):\n if var_3[var_8] == \"INIT\":\n pass\n elif var_3[var_8] and var_5[var_7 + var_8] and var_4[var_7 + (7 - var_8)]:\n var_12[var_7] = False\n var_3[var_8] = False\n var_5[var_7 + var_8] = False\n var_4[var_7 + (7 - var_8)] = False\n var_1[var_7][var_8] = \"Q\"\n func_1(var_7 + 1)\n var_12[var_7] = True\n var_3[var_8] = True\n var_5[var_7 + var_8] = True\n var_4[var_7 + (7 - var_8)] = True\n var_1[var_7][var_8] = \".\"\n\n\nfunc_1()\n", "slow_time": 803032199, "fast_time": 113884500, "speedup": 7.0513, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_8"} -{"pair_id": "python_7809", "problem_id": "p03108", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nfrom itertools import permutations, accumulate\nimport sys\nimport math\nimport bisect\n\n\ndef func_3():\n return [int(var_17) for var_17 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return [list(var_17) for var_17 in sys.stdin.readline().split()]\n\n\ndef func_7():\n var_11 = list(sys.stdin.readline())\n if var_11[-1] == \"\\n\":\n return var_11[:-1]\n return var_11\n\n\ndef func_2(var_8):\n return [func_1() for var_4 in range(var_8)]\n\n\ndef func_4(var_8):\n return [func_3() for var_4 in range(var_8)]\n\n\ndef func_8(var_8):\n return [func_7() for var_4 in range(var_8)]\n\n\ndef func_6(var_8):\n return [func_5() for var_4 in range(var_8)]\n\n\nsys.setrecursionlimit(1000000)\nvar_7 = 1000000007\n\n\ndef func_10():\n def func_9(var_17):\n if var_9[var_17] == var_17:\n return var_9[var_17]\n var_14[var_9[var_17]] += var_14[var_17]\n var_14[var_17] = 0\n var_9[var_17] = func_9(var_9[var_17])\n return var_9[var_17]\n\n def func_11(var_17, var_18):\n var_17 = func_9(var_17)\n var_18 = func_9(var_18)\n if var_10[var_17] < var_10[var_18]:\n var_9[var_17] = var_18\n var_14[var_18] += var_14[var_17]\n var_14[var_17] = 0\n else:\n var_9[var_18] = var_17\n var_14[var_17] += var_14[var_18]\n var_14[var_18] = 0\n if var_10[var_17] == var_10[var_18]:\n var_10[var_17] += 1\n\n var_8, var_6 = func_3()\n var_16 = []\n for var_4 in range(var_6):\n var_1, var_3 = func_3()\n var_1 -= 1\n var_3 -= 1\n var_16.append((var_1, var_3))\n var_9 = [var_4 for var_4 in range(var_8)]\n var_10 = [0] * var_8\n var_14 = [1] * var_8\n var_15 = var_8 * (var_8 - 1) >> 1\n var_2 = [var_15]\n for var_4, var_5 in var_16[1:][::-1]:\n var_12 = func_9(var_4)\n var_13 = func_9(var_5)\n if var_12 != var_13:\n var_15 -= var_14[var_12] * var_14[var_13]\n func_11(var_4, var_5)\n var_2.append(var_15)\n for var_4 in var_2[::-1]:\n print(var_4)\n return\n\n\nif __name__ == \"__main__\":\n func_10()\n", "fast_code": "var_5 = lambda var_8: var_8 if var_7[var_8] < 0 else var_5(var_7[var_8])\n(var_4, var_3), _, *var_2 = [map(int, var_6.split()) for var_6 in open(0).readlines()]\nvar_7 = [-1] * -~var_4\nvar_6 = var_4 * ~-var_4 // 2\nvar_1 = [var_6]\nfor var_8, var_9 in var_2[::-1]:\n var_8, var_9 = sorted((var_5(var_8), var_5(var_9)))\n if var_8 != var_9:\n var_6 -= var_7[var_8] * var_7[var_9]\n var_7[var_8] += var_7[var_9]\n var_7[var_9] = var_8\n var_1 += [var_6]\nprint(*var_1[::-1], sep=\"\\n\")\n", "slow_time": 140164952, "fast_time": 46457023, "speedup": 3.0171, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_2"} -{"pair_id": "python_6569", "problem_id": "p03332", "language": "python", "slow_code": "def func_1(var_13, var_14, var_12):\n if var_14 < 0 or var_14 > var_13:\n return 0\n var_14 = min(var_14, var_13 - var_14)\n return var_6[var_13] * var_7[var_14] * var_7[var_13 - var_14] % var_12\n\n\nvar_12 = 998244353\nvar_4 = 10**6\nvar_6 = [1, 1]\nvar_7 = [1, 1]\nvar_9 = [0, 1]\nfor var_8 in range(2, var_4 + 1):\n var_6.append((var_6[-1] * var_8) % var_12)\n var_9.append((-var_9[var_12 % var_8] * (var_12 // var_8)) % var_12)\n var_7.append((var_7[-1] * var_9[-1]) % var_12)\nvar_4, var_1, var_2, var_3 = list(map(int, input().split()))\nvar_5 = 0\nfor var_8 in range(var_4 + 1):\n if (var_3 - var_1 * var_8) % var_2 != 0:\n continue\n var_10 = (var_3 - var_1 * var_8) // var_2\n var_11 = func_1(var_4, var_8, var_12) * func_1(var_4, var_10, var_12) % var_12\n var_5 += var_11\n var_5 %= var_12\nprint(var_5)\n", "fast_code": "class Class_1:\n \"\"\"\"\"\"\n\n def __init__(self, var_10, var_1):\n self.fact = [1]\n for var_8 in range(1, var_10 + 1):\n self.fact.append(self.fact[-1] * var_8 % var_1)\n self.inv_fact = [\n pow(self.fact[var_8], var_1 - 2, var_1) for var_8 in range(var_10 + 1)\n ]\n self.MOD = var_1\n\n def func_2(self, var_9):\n \"\"\"\"\"\"\n return self.fact[var_9]\n\n def func_3(self, var_9):\n \"\"\"\"\"\"\n return self.inv_fact[var_9]\n\n def func_1(self, var_9, var_11):\n \"\"\"\"\"\"\n return (\n self.fact[var_9] * self.inv_fact[var_9 - var_11] * self.inv_fact[var_11]\n ) % self.MOD\n\n\nvar_10, var_2, var_5, var_9 = list(map(int, input().split()))\nvar_1 = 998244353\nvar_7 = Class_1(var_10, var_1)\nvar_4 = 0\nfor var_8 in range(var_10 + 1):\n if not (\n var_9 - var_2 * var_8 >= 0\n and (var_9 - var_2 * var_8) % var_5 == 0\n and (var_9 - var_2 * var_8) // var_5 <= var_10\n ):\n continue\n else:\n var_3 = var_8\n var_6 = (var_9 - var_2 * var_8) // var_5\n var_4 += var_7.combination(var_10, var_3) * var_7.combination(var_10, var_6)\n var_4 %= var_1\nprint(var_4)\n", "slow_time": 161389270959, "fast_time": 33876778491, "speedup": 4.764, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_19"} -{"pair_id": "python_11657", "problem_id": "p02760", "language": "python", "slow_code": "var_1 = [input().split() for _ in range(3)]\nvar_5 = int(eval(input()))\nfor _ in range(var_5):\n var_2 = eval(input())\n for var_3 in range(3):\n for var_4 in range(3):\n if var_1[var_3][var_4] == var_2:\n var_1[var_3][var_4] = \"0\"\nif var_1[0][0] == \"0\" and var_1[0][1] == \"0\" and var_1[0][2] == \"0\":\n print(\"Yes\")\nelif var_1[1][0] == \"0\" and var_1[1][1] == \"0\" and var_1[1][2] == \"0\":\n print(\"Yes\")\nelif var_1[2][0] == \"0\" and var_1[2][1] == \"0\" and var_1[2][2] == \"0\":\n print(\"Yes\")\nelif var_1[0][0] == \"0\" and var_1[1][0] == \"0\" and var_1[2][0] == \"0\":\n print(\"Yes\")\nelif var_1[0][1] == \"0\" and var_1[1][1] == \"0\" and var_1[2][1] == \"0\":\n print(\"Yes\")\nelif var_1[0][2] == \"0\" and var_1[1][2] == \"0\" and var_1[2][2] == \"0\":\n print(\"Yes\")\nelif var_1[0][0] == \"0\" and var_1[1][1] == \"0\" and var_1[2][2] == \"0\":\n print(\"Yes\")\nelif var_1[0][2] == \"0\" and var_1[1][1] == \"0\" and var_1[2][0] == \"0\":\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "var_1 = open(0).read().split()\nprint(\n (\n \"YNeos\"[\n all(\n var_2 - set(map(var_1.index, var_1[9:]))\n for var_2 in (\n {0, 3, 6},\n {0, 4, 8},\n {2, 4, 6},\n {2, 5, 8},\n {3, 4, 5},\n {6, 7, 8},\n )\n ) :: 2\n ]\n )\n)\n", "slow_time": 98929853, "fast_time": 40880572, "speedup": 2.42, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_4"} -{"pair_id": "python_13395", "problem_id": "p02790", "language": "python", "slow_code": "var_1, var_4 = list(map(str, input().split()))\nvar_2 = int(var_1)\nvar_5 = int(var_4)\nvar_3 = []\nvar_6 = \"\"\nvar_7 = \"\"\nfor _ in range(var_5):\n var_6 += var_1\nfor _ in range(var_2):\n var_7 += var_4\nvar_3.append(var_6)\nvar_3.append(var_7)\nvar_3.sort()\nprint((var_3[0]))\n", "fast_code": "var_1, var_2 = input().split()\nprint((min(var_1 * int(var_2), var_2 * int(var_1))))\n", "slow_time": 29614079, "fast_time": 10102751, "speedup": 2.9313, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_1"} -{"pair_id": "python_5389", "problem_id": "p02417", "language": "python", "slow_code": "import sys\n\nvar_1 = [\n \"a\",\n \"b\",\n \"c\",\n \"d\",\n \"e\",\n \"f\",\n \"g\",\n \"h\",\n \"i\",\n \"j\",\n \"k\",\n \"l\",\n \"m\",\n \"n\",\n \"o\",\n \"p\",\n \"q\",\n \"r\",\n \"s\",\n \"t\",\n \"u\",\n \"v\",\n \"w\",\n \"x\",\n \"y\",\n \"z\",\n]\nvar_4 = [0 for var_5 in range(26)]\nfor var_5 in sys.stdin.read().lower():\n for var_2 in range(26):\n for var_3 in range(len(var_5)):\n if var_5[var_3] == var_1[var_2]:\n var_4[var_2] += 1\nfor var_2 in range(26):\n print((\"%s : %d\" % (var_1[var_2], var_4[var_2])))\n", "fast_code": "from collections import Counter\nimport string\n\nvar_3 = Counter()\nwhile True:\n try:\n var_4 = input().lower()\n var_3 += Counter(var_4)\n except EOFError:\n break\nfor var_1 in string.ascii_lowercase:\n var_2 = var_3[var_1]\n print(f\"{var_1} : {var_2}\")\n", "slow_time": 102357861, "fast_time": 36536303, "speedup": 2.8015, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_13"} -{"pair_id": "python_10538", "problem_id": "p02657", "language": "python", "slow_code": "import numpy as np\nimport scipy as sp\nimport math\n\nvar_1, var_3 = list(map(str, input().split()))\nvar_1 = int(var_1)\nvar_3 = int(float(var_3) * 100.001)\nvar_2 = int(var_1 * var_3 // 100)\nprint(var_2)\n", "fast_code": "import math\n\nvar_1, var_2 = [float(var_3) for var_3 in input().split()]\nvar_1 = int(var_1)\nvar_2 = int(var_2 * 100)\nprint((int(math.floor(var_1 * var_2) // 100)))\n", "slow_time": 601968667, "fast_time": 13252273, "speedup": 45.4238, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_8"} -{"pair_id": "python_3435", "problem_id": "p02556", "language": "python", "slow_code": "var_6 = __import__(\"sys\").stdin.readline\n\n\ndef func_3(var_1, var_3):\n return abs(var_1[0] - var_3[0]) + abs(var_1[1] - var_3[1])\n\n\nvar_7 = int(eval(var_6()))\nvar_8 = []\nfor _ in range(var_7):\n var_8.append([*list(map(int, var_6().split()))])\nvar_2 = 0\nvar_9 = sorted(var_8)\nvar_10 = sorted(var_8, key=lambda var_11: var_11[1])\nvar_2 = max(var_2, func_3(var_9[-1], var_9[-2]))\nvar_2 = max(var_2, func_3(var_9[0], var_9[1]))\nvar_2 = max(var_2, func_3(var_10[-1], var_10[-2]))\nvar_2 = max(var_2, func_3(var_10[0], var_10[1]))\n\n\ndef func_1(var_11):\n return var_11[0] + var_11[1]\n\n\ndef func_2(var_11):\n return var_11[0] - var_11[1]\n\n\nvar_4 = sorted(var_8, key=func_1)\nvar_5 = sorted(var_8, key=func_2)\nvar_2 = max(var_2, func_3(var_4[0], var_4[-1]))\nvar_2 = max(var_2, func_3(var_4[0], var_4[1]))\nvar_2 = max(var_2, func_3(var_4[-1], var_4[-2]))\nvar_2 = max(var_2, func_3(var_5[0], var_5[-1]))\nvar_2 = max(var_2, func_3(var_5[0], var_5[1]))\nvar_2 = max(var_2, func_3(var_5[-1], var_5[-2]))\n\n\ndef func_1(var_11):\n return abs(var_11[0] + var_11[1])\n\n\ndef func_2(var_11):\n return abs(var_11[0] - var_11[1])\n\n\nvar_4 = sorted(var_8, key=func_1)\nvar_5 = sorted(var_8, key=func_2)\nvar_2 = max(var_2, func_3(var_4[0], var_4[-1]))\nvar_2 = max(var_2, func_3(var_4[0], var_4[1]))\nvar_2 = max(var_2, func_3(var_4[-1], var_4[-2]))\nvar_2 = max(var_2, func_3(var_5[0], var_5[-1]))\nvar_2 = max(var_2, func_3(var_5[0], var_5[1]))\nvar_2 = max(var_2, func_3(var_5[-1], var_5[-2]))\nprint(var_2)\n", "fast_code": "import sys\n\nvar_1 = int(eval(input()))\nvar_9, var_11 = [], []\nfor var_3 in range(var_1):\n var_10, var_12 = list(map(int, input().split()))\n var_9.append(var_10)\n var_11.append(var_12)\n\nvar_5 = -sys.maxsize\nvar_7 = sys.maxsize\nvar_4 = -sys.maxsize\nvar_6 = sys.maxsize\nfor var_10, var_12 in zip(var_9, var_11):\n var_13 = var_10 + var_12\n var_5 = max(var_5, var_13)\n var_7 = min(var_7, var_13)\n var_8 = var_10 - var_12\n var_4 = max(var_4, var_8)\n var_6 = min(var_6, var_8)\nvar_2 = max(var_5 - var_7, var_4 - var_6)\n\nprint(var_2)\n", "slow_time": 146157102, "fast_time": 49946737, "speedup": 2.9263, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_22"} -{"pair_id": "python_8606", "problem_id": "p02848", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nfrom inspect import currentframe\n\nvar_1 = 10**10\nvar_2 = 10**9 + 7\n\n\ndef func_8():\n return sys.stdin.readline().strip()\n\n\ndef func_7(var_12, var_13):\n return var_13 if var_12 % var_13 == 0 else func_7(var_13, var_12 % var_13)\n\n\ndef func_9(var_12, var_13):\n return (var_12 * var_13) // func_7(var_12, var_13)\n\n\ndef func_1():\n return int(func_8())\n\n\ndef func_4():\n return map(int, func_8().split())\n\n\ndef func_2():\n return [int(var_12) for var_12 in func_8().split()]\n\n\ndef func_5(var_3):\n return [int(func_8()) for _ in range(var_3)]\n\n\ndef func_3(var_3):\n return [[int(var_12) for var_12 in func_8().split()] for _ in range(var_3)]\n\n\ndef func_6(*var_7):\n var_9 = {\n id(var_11): var_8 for var_8, var_11 in currentframe().f_back.f_locals.items()\n }\n print(\n \", \".join(var_9.get(id(var_6), \"???\") + \" = \" + repr(var_6) for var_6 in var_7)\n )\n\n\nvar_3 = func_1()\nvar_4 = func_8()\nvar_5 = [\n \"A\",\n \"B\",\n \"C\",\n \"D\",\n \"E\",\n \"F\",\n \"G\",\n \"H\",\n \"I\",\n \"J\",\n \"K\",\n \"L\",\n \"M\",\n \"N\",\n \"O\",\n \"P\",\n \"Q\",\n \"R\",\n \"S\",\n \"T\",\n \"U\",\n \"V\",\n \"W\",\n \"X\",\n \"Y\",\n \"Z\",\n]\nfor var_10 in var_4:\n print(var_5[(var_5.index(var_10) + var_3) % 26], end=\"\")\n", "fast_code": "var_1 = int(input())\nvar_2 = input()\nvar_3 = \"ZABCDEFGHIJKLMNOPQRSTUVWXY\"\nvar_5 = {var_8: var_6 for var_6, var_8 in enumerate(var_3)}\nvar_4 = [var_8 for var_8 in var_3]\nfor var_7 in var_2:\n var_6 = (var_5[var_7] + var_1) % 26\n print(var_4[var_6], end=\"\")\n", "slow_time": 118302228, "fast_time": 32472930, "speedup": 3.6431, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_18"} -{"pair_id": "python_5061", "problem_id": "p03292", "language": "python", "slow_code": "var_2, var_3, var_4 = list(map(int, input().split()))\nvar_1 = [var_2, var_3, var_4]\nvar_1.append(var_2)\n\n\ndef func_1(var_7):\n if var_1[var_7] - var_1[var_7 + 1] >= 0:\n return var_1[var_7] - var_1[var_7 + 1]\n else:\n return var_1[var_7 + 1] - var_1[var_7]\n\n\nvar_5 = [func_1(var_7) for var_7 in range(3)]\nvar_5.append(func_1(0))\nvar_5.append(func_1(1))\n\n\ndef func_2(var_8):\n return var_5[var_8] + var_5[var_8 + 1]\n\n\nvar_6 = [func_2(var_8) for var_8 in range(3)]\nprint((min(var_6)))\n", "fast_code": "var_1, _, var_2 = sorted(map(int, input().split()))\nprint((var_2 - var_1))\n", "slow_time": 50363139, "fast_time": 9736665, "speedup": 5.1725, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_14"} -{"pair_id": "python_4015", "problem_id": "p02361", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nfrom enum import Enum\nfrom heapq import heappush, heappop\n\n\nclass Class_1(object):\n \"\"\"\"\"\"\n\n class Class_2(Enum):\n \"\"\"\"\"\"\n\n var_23 = 1\n var_14 = 2\n var_7 = 3\n\n def __init__(self, var_4, var_12):\n var_16 = var_4\n self.color = [Class_1.Status.white] * var_16\n self.d = [float(\"inf\")] * var_16\n self.p = [-1] * var_16\n self.adj = [[] for _ in range(var_16)]\n self.make_adj(var_12)\n\n def func_2(self, var_12):\n\n for var_13, var_20, var_8 in var_12:\n self.adj[var_13].insert(0, (var_20, var_8))\n\n def func_1(self, var_19):\n self.d[var_19] = 0\n var_17 = []\n heappush(var_17, (0, var_19))\n while var_17:\n var_10, var_21 = heappop(var_17)\n self.color[var_21] = Class_1.Status.black\n if self.d[var_21] < var_10:\n continue\n for var_22, var_10 in self.adj[var_21]:\n if self.color[var_22] == Class_1.Status.black:\n continue\n if self.d[var_22] > self.d[var_21] + var_10:\n self.d[var_22] = self.d[var_21] + var_10\n heappush(var_17, (self.d[var_22], var_22))\n self.color[var_22] = Class_1.Status.gray\n\n\ndef func_3(var_4, var_18, var_12):\n var_5 = 0\n var_3 = 1\n var_1 = 2\n var_16 = var_4\n var_9 = [var_5] * var_16\n var_11 = [float(\"inf\")] * var_16\n var_6 = [[] for _ in range(var_16)]\n for var_13, var_20, var_8 in var_12:\n var_6[var_13].insert(0, (var_20, var_8))\n\n var_11[var_18] = 0\n var_17 = []\n heappush(var_17, (0, var_18))\n while var_17:\n var_10, var_21 = heappop(var_17)\n var_9[var_21] = var_1\n if var_11[var_21] < var_10:\n continue\n for var_22, var_10 in var_6[var_21]:\n if var_9[var_22] == var_1:\n continue\n if var_11[var_22] > var_11[var_21] + var_10:\n var_11[var_22] = var_11[var_21] + var_10\n heappush(var_17, (var_11[var_22], var_22))\n var_9[var_22] = var_3\n\n for var_15 in range(var_4):\n if var_11[var_15] == float(\"inf\"):\n print(\"INF\")\n else:\n print((\"{}\".format(var_11[var_15])))\n\n\nif __name__ == \"__main__\":\n\n var_4, var_2, var_18 = [int(var_24) for var_24 in input().split(\" \")]\n var_12 = []\n for var_15 in range(var_2):\n var_12.append(list(map(int, input().split(\" \"))))\n\n func_3(var_4, var_18, var_12)\n", "fast_code": "var_10, var_4, var_7 = list(map(int, input().split()))\nvar_3 = [float(\"INF\")] * var_10\nvar_3[var_7] = 0\nvar_5 = []\nfor var_6 in range(var_4):\n var_8, var_9, var_1 = list(map(int, input().split()))\n var_5.append([var_8, var_9, var_1])\nfor var_6 in range(var_10):\n var_2 = 0\n for var_8, var_10, var_1 in var_5:\n if var_3[var_10] > var_3[var_8] + var_1:\n var_2 += 1\n var_3[var_10] = var_3[var_8] + var_1\n if var_2 == 0:\n break\nfor var_6 in var_3:\n if var_6 == float(\"inf\"):\n print(\"INF\")\n else:\n print(var_6)\n", "slow_time": 206184223, "fast_time": 49326907, "speedup": 4.18, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_29"} -{"pair_id": "python_7462", "problem_id": "p03835", "language": "python", "slow_code": "var_4, var_5 = list(map(int, input().split()))\nvar_1 = 0\nfor var_2 in range(var_4 + 1):\n for var_3 in range(var_4 + 1):\n if var_5 >= var_2 + var_3 >= var_5 - var_4:\n var_1 += 1\nprint(var_1)\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nvar_3 = 0\nfor var_4 in range(var_1 + 1):\n var_5 = var_2 - var_4\n if var_5 < 0:\n break\n elif var_5 <= var_1:\n var_3 += var_5 + 1\n elif var_5 <= 2 * var_1:\n var_3 += var_1 - (var_5 - var_1) + 1\nprint(var_3)\n", "slow_time": 301802361, "fast_time": 25092343, "speedup": 12.0277, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_26"} -{"pair_id": "python_4096", "problem_id": "p03170", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = list(map(int, input().split()))\nvar_5 = [False] * (var_1 + 1)\nfor var_6 in range(var_1 + 1):\n for var_4 in var_3:\n if var_6 - var_4 >= 0:\n var_5[var_6] |= not var_5[var_6 - var_4]\nif var_5[var_1]:\n print(\"First\")\nelse:\n print(\"Second\")\n", "fast_code": "def func_1():\n var_3, var_2, *var_1 = list(map(int, open(0).read().split()))\n var_5 = [False] * (var_2 + 1)\n for var_6 in range(var_2):\n if var_5[var_6]:\n continue\n for var_4 in var_1:\n if var_6 + var_4 > var_2:\n break\n var_5[var_6 + var_4] = True\n print((\"First\" if var_5[-1] else \"Second\"))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 1163946391, "fast_time": 334630587, "speedup": 3.4783, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_17"} -{"pair_id": "python_15785", "problem_id": "p03331", "language": "python", "slow_code": "var_1 = int(eval(input()))\nimport numpy as np\n\nvar_2 = np.arange(var_1)\nvar_2 = np.delete(var_2, 0)\nvar_3 = var_1 - var_2\nvar_7 = []\nfor var_6 in range(len(var_2)):\n var_4 = [int(var_8) for var_8 in list(str(var_2[var_6]))]\n var_5 = [int(var_8) for var_8 in list(str(var_3[var_6]))]\n var_7.append(sum(var_4) + sum(var_5))\nprint((min(var_7)))\n", "fast_code": "var_1 = int(eval(input()))\nif var_1 % 10 == 0:\n print((10))\nelse:\n print((sum(map(int, list(str(var_1))))))\n", "slow_time": 171375954, "fast_time": 17095953, "speedup": 10.0244, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_7"} -{"pair_id": "python_6071", "problem_id": "p02890", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(2147483647)\nvar_3 = float(\"inf\")\nvar_4 = 10**9 + 7\nvar_9 = lambda: sys.stdin.readline().rstrip()\n\n\ndef func_1(var_1, var_13=None, var_12=None):\n if var_13 is None:\n var_13 = min(var_1)\n if var_12 is None:\n var_12 = max(var_1)\n var_7 = [0] * (var_12 - var_13 + 1)\n for var_6 in var_1:\n var_7[var_6 - var_13] += 1\n var_2 = []\n for var_8 in range(var_13, var_12 + 1):\n var_2 += [var_8] * var_7[var_8 - var_13]\n return var_2\n\n\ndef func_2():\n var_11 = int(eval(var_9()))\n var_1 = [0] * var_11\n for var_6 in map(int, var_9().split()):\n var_1[var_6 - 1] += 1\n var_1 = func_1(var_1, 0, var_11)\n var_5 = [0] * (var_11 + 1)\n for var_8 in range(var_11):\n var_5[var_8 + 1] = var_5[var_8] + var_1[var_8]\n\n var_14 = var_11\n var_8 = var_11\n for var_10 in range(1, var_11 + 1):\n while 1:\n while 1:\n if var_8 <= 0 or var_1[var_8 - 1] < var_14:\n break\n var_8 -= 1\n if var_5[var_8] + var_14 * (var_11 - var_8) >= var_10 * var_14:\n break\n var_14 -= 1\n print(var_14)\n\n\nfunc_2()\n", "fast_code": "from collections import Counter\n\nvar_3 = int(eval(input()))\nvar_1 = sorted(list(Counter(list(map(int, input().split()))).values()))\nvar_6 = var_3\nvar_5 = 0\nfor var_2 in range(1, var_3 + 1):\n var_4 = var_2 - var_5\n while var_1 and var_1[-1] > var_6 // var_4:\n var_6 -= var_1[-1]\n var_1.pop()\n var_5 += 1\n var_4 -= 1\n print((var_6 // var_4))\n", "slow_time": 86475726, "fast_time": 40356203, "speedup": 2.1428, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_1"} -{"pair_id": "python_14052", "problem_id": "p02261", "language": "python", "slow_code": "class Class_1:\n def __init__(self, var_2):\n self.card = var_2\n self.mark = var_2[0]\n self.number = var_2[1]\n\n def __lt__(self, var_11):\n if not isinstance(var_11, Class_1):\n return NotImplemented\n return self.number < var_11.number\n\n def __eq__(self, var_11):\n if not isinstance(var_11, Class_1):\n return NotImplemented\n return self.mark == var_11.mark and self.number == var_11.number\n\n def __repr__(self):\n return \"{}{}\".format(self.mark, self.number)\n\n\ndef func_1(var_14):\n var_8 = var_14.copy()\n var_3 = 1\n while var_3:\n var_3 = 0\n for var_4 in range(len(var_8) - 1, 0, -1):\n if var_8[var_4] < var_8[var_4 - 1]:\n var_8[var_4], var_8[var_4 - 1] = var_8[var_4 - 1], var_8[var_4]\n var_3 = 1\n print((\" \".join(map(str, var_8))))\n return sorted(var_8)\n\n\ndef func_2(var_14):\n var_8 = var_14.copy()\n for var_4 in range(len(var_8)):\n var_9 = var_4\n for var_5 in range(var_4 + 1, len(var_8)):\n if var_8[var_5] < var_8[var_9]:\n var_9 = var_5\n if var_8[var_4] != var_8[var_9]:\n var_8[var_4], var_8[var_9] = var_8[var_9], var_8[var_4]\n print((\" \".join(map(str, var_8))))\n return sorted(var_8)\n\n\ndef func_3(var_10, var_13):\n if var_10 == var_13:\n print(\"Stable\")\n else:\n print(\"Not stable\")\n\n\n_ = int(eval(input()))\nvar_6 = [Class_1(var_4) for var_4 in input().split()]\nvar_7 = sorted(var_6)\nvar_1 = func_1(var_6)\nfunc_3(var_7, var_1)\nvar_12 = func_2(var_6)\nfunc_3(var_7, var_12)\n", "fast_code": "def func_1(var_1, var_6):\n for var_3 in range(var_6):\n for var_4 in range(var_6 - 1, var_3, -1):\n if var_1[var_4][1] < var_1[var_4 - 1][1]:\n var_1[var_4], var_1[var_4 - 1] = var_1[var_4 - 1], var_1[var_4]\n print((\" \".join(var_1)))\n\n\ndef func_2(var_1, var_6):\n for var_3 in range(var_6):\n var_5 = var_3\n for var_4 in range(var_3, var_6):\n if var_1[var_4][1] < var_1[var_5][1]:\n var_5 = var_4\n if var_3 != var_5:\n var_1[var_3], var_1[var_5] = var_1[var_5], var_1[var_3]\n print((\" \".join(var_1)))\n\n\nif __name__ == \"__main__\":\n var_6 = int(eval(input()))\n var_1 = list(input().split())\n var_2 = var_1[:]\n func_1(var_1, var_6)\n print(\"Stable\")\n func_2(var_2, var_6)\n print((\"Stable\" if var_1 == var_2 else \"Not stable\"))\n", "slow_time": 139371990, "fast_time": 69149926, "speedup": 2.0155, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_17"} -{"pair_id": "python_16973", "problem_id": "p02804", "language": "python", "slow_code": "var_2 = 10**6\nvar_1 = 10**9 + 7\nvar_7, var_8, var_10 = [0] * var_2, [0] * var_2, [0] * var_2\n\n\ndef func_2():\n var_7[0], var_7[1] = 1, 1\n var_8[0], var_8[1] = 1, 1\n var_10[1] = 1\n for var_9 in range(2, var_2):\n var_7[var_9] = var_7[var_9 - 1] * var_9 % var_1\n var_10[var_9] = var_1 - var_10[var_1 % var_9] * (var_1 // var_9) % var_1\n var_8[var_9] = var_8[var_9 - 1] * var_10[var_9] % var_1\n\n\ndef func_1(var_12, var_11):\n if var_12 < var_11:\n return 0\n if var_12 < 0 or var_11 < 0:\n return 0\n return var_7[var_12] * (var_8[var_11] * var_8[var_12 - var_11] % var_1) % var_1\n\n\nvar_12, var_11 = list(map(int, input().split()))\nvar_4 = list(map(int, input().split()))\nfunc_2()\nvar_4.sort()\nvar_5 = 0\nvar_6 = 0\nfor var_9, var_3 in enumerate(var_4):\n var_5 += var_3 * func_1(var_9, var_11 - 1)\n var_5 %= var_1\n var_6 += var_3 * func_1(var_12 - 1 - var_9, var_11 - 1)\n var_6 %= var_1\nprint(((var_5 - var_6) % var_1))\n", "fast_code": "var_2 = 10**9 + 7\nvar_1 = 100001\nvar_9 = [0] + [1]\nvar_7 = [1] + [1]\nvar_6 = [1] + [1]\nfor var_8 in range(2, var_1):\n var_9 += [var_9[var_2 % var_8] * (var_2 - int(var_2 / var_8)) % var_2]\n var_6 += [(var_6[var_8 - 1] * var_8) % var_2]\n var_7 += [(var_7[var_8 - 1] * var_9[var_8]) % var_2]\n\n\ndef func_1(var_3, var_5):\n if var_3 < var_5:\n return -1\n return (var_6[var_3] * ((var_7[var_5] * var_7[var_3 - var_5]) % var_2)) % var_2\n\n\nvar_11, var_10 = list(map(int, input().split()))\nvar_3 = list(map(int, input().split()))\nvar_3 = sorted(var_3, key=lambda var_13: var_13, reverse=False)\nvar_4 = 0\n\nfor var_8 in range(len(var_3)):\n var_12 = func_1(var_11 - 1 - var_8, var_10 - 1)\n if var_12 < 0:\n continue\n if var_3[var_8] < 0:\n var_4 = (var_4 + (abs(var_3[var_8]) * var_12) % var_2) % var_2\n else:\n var_4 = (var_4 - (abs(var_3[var_8]) * var_12) % var_2 + var_2) % var_2\n\nfor var_8 in range(len(var_3)):\n var_12 = func_1(var_11 - 1 - var_8, var_10 - 1)\n if var_12 < 0:\n continue\n if var_3[var_11 - 1 - var_8] < 0:\n var_4 = (\n var_4 - (abs(var_3[var_11 - 1 - var_8]) * var_12) % var_2 + var_2\n ) % var_2\n else:\n var_4 = (var_4 + (abs(var_3[var_11 - 1 - var_8]) * var_12) % var_2) % var_2\nprint(var_4)\n", "slow_time": 181158031493, "fast_time": 44280687267, "speedup": 4.0911, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_25"} -{"pair_id": "python_4675", "problem_id": "p04015", "language": "python", "slow_code": "from collections import defaultdict, deque, Counter, OrderedDict\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce, lru_cache\nfrom heapq import heappush, heappop, heapify\nimport itertools\nimport math, fractions\nimport sys, copy\n\n\ndef func_3():\n return sys.stdin.readline().split()\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_12():\n return list(sys.stdin.readline().rstrip())\n\n\ndef func_4():\n return [int(var_18) for var_18 in sys.stdin.readline().split()]\n\n\ndef func_5():\n return [int(var_18) - 1 for var_18 in sys.stdin.readline().split()]\n\n\ndef func_9():\n return [list(var_18) for var_18 in sys.stdin.readline().split()]\n\n\ndef func_11(var_15):\n return [sys.stdin.readline().strip() for _ in range(var_15)]\n\n\ndef func_8(var_15):\n return [func_3() for _ in range(var_15)]\n\n\ndef func_2(var_15):\n return [func_1() for _ in range(var_15)]\n\n\ndef func_6(var_15):\n return [func_4() for _ in range(var_15)]\n\n\ndef func_7(var_15):\n return [func_5() for _ in range(var_15)]\n\n\ndef func_13(var_15):\n return [func_12() for _ in range(var_15)]\n\n\ndef func_10(var_15):\n return [func_9() for _ in range(var_15)]\n\n\ndef func_17(var_15, var_16):\n return math.factorial(var_15) // math.factorial(var_16)\n\n\ndef func_14(var_15, var_16):\n return math.factorial(var_15) // (\n math.factorial(var_16) * math.factorial(var_15 - var_16)\n )\n\n\ndef func_16(var_15, *var_9, var_10=0):\n return (\n [func_16(*var_9, default=var_10) for _ in range(var_15)]\n if var_9\n else [var_10 for _ in range(var_15)]\n )\n\n\nvar_11 = [[1, 0], [0, 1], [-1, 0], [0, -1]]\nvar_12 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]\nvar_8 = \"abcdefghijklmnopqrstuvwxyz\"\nvar_2 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nvar_4 = 1000000007\nvar_3 = float(\"inf\")\nsys.setrecursionlimit(1000000)\n\n\ndef func_15():\n var_5, var_1 = func_4()\n var_6 = func_4()\n var_7 = [var_19 - var_1 for var_19 in var_6]\n var_20 = max(var_1, max(var_6))\n var_13 = func_16(var_5 + 1, 2 * var_20 * var_5 + 1)\n var_13[0][var_20 * var_5] = 1\n for var_14 in range(1, var_5 + 1):\n for var_17 in range(2 * var_20 * var_5 + 1):\n if 0 <= var_17 - var_7[var_14 - 1] <= 2 * var_20 * var_5:\n var_13[var_14][var_17] = (\n var_13[var_14 - 1][var_17]\n + var_13[var_14 - 1][var_17 - var_7[var_14 - 1]]\n )\n else:\n var_13[var_14][var_17] = var_13[var_14 - 1][var_17]\n print((var_13[-1][var_20 * var_5] - 1))\n\n\nif __name__ == \"__main__\":\n func_15()\n", "fast_code": "import sys\nfrom collections import defaultdict\n\n\ndef func_1():\n var_2, var_1, *var_11 = list(map(int, sys.stdin.read().split()))\n var_8 = []\n var_6 = []\n var_10 = 0\n var_11.sort()\n for var_3 in var_11:\n if var_1 < var_3:\n var_8.append(var_3 - var_1)\n elif var_3 < var_1:\n var_6.append(var_1 - var_3)\n else:\n var_10 += 1\n var_9 = defaultdict(int, {0: 1})\n var_7 = defaultdict(int, {0: 1})\n for var_3 in range(len(var_8)):\n for var_4 in sorted(var_9, reverse=1):\n var_9[var_4 + var_8[var_3]] += var_9[var_4]\n for var_3 in range(len(var_6)):\n for var_4 in sorted(var_7, reverse=1):\n var_7[var_4 + var_6[var_3]] += var_7[var_4]\n var_5 = 0\n for var_3 in var_7:\n if var_3 in var_9:\n var_5 += var_7[var_3] * var_9[var_3]\n var_5 *= 1 << var_10\n var_5 -= 1\n print(var_5)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 488085549, "fast_time": 65300721, "speedup": 7.4744, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_29"} -{"pair_id": "python_2591", "problem_id": "p02660", "language": "python", "slow_code": "import sys\nfrom functools import reduce\nimport math\nfrom collections import defaultdict\nfrom math import sqrt\n\n\ndef func_1(var_8):\n for var_4 in range(2, int(sqrt(var_8))):\n if var_8 % var_4 == 0:\n return False\n return True\n\n\ndef func_4(var_8):\n var_9 = defaultdict(int)\n var_4 = 2\n var_7 = sqrt(var_8)\n while var_8 != 1:\n if var_8 % var_4 == 0:\n var_8 = var_8 // var_4\n var_9[var_4] += 1\n elif var_4 >= var_7:\n if len(var_9) == 0:\n var_9[var_4] += 1\n elif func_1(var_8):\n var_9[var_4] += 1\n break\n else:\n var_4 += 1\n return var_9\n\n\ndef func_6(var_14):\n return (-1 + sqrt(1 + 4 * 2 * var_14)) / 2\n\n\ndef func_5(var_1: int):\n var_3 = func_4(var_1)\n var_2 = 0\n for var_5, var_12 in list(var_3.items()):\n var_11 = func_6(var_12)\n var_2 += math.floor(var_11)\n print(var_2)\n return\n\n\ndef func_3():\n def func_2():\n for var_6 in sys.stdin:\n for var_13 in var_6.split():\n yield var_13\n\n var_10 = func_2()\n var_1 = int(next(var_10))\n func_5(var_1)\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "import numpy as np\nimport sys\n\n\ndef func_4(var_6=0):\n \"\"\"\"\"\"\n if var_6 == 0:\n var_10 = list(map(int, input().split()))\n if len(var_10) == 1:\n return var_10[0]\n elif len(var_10) > 1:\n return var_10\n else:\n var_10 = [list(map(int, input().split())) for _ in range(var_6)]\n return var_10\n\n\ndef func_2(var_6=0):\n \"\"\"\"\"\"\n if var_6 == 0:\n return [int(var_5) for var_5 in func_5()]\n else:\n return [[int(var_5) for var_5 in func_5()] for _ in range(var_6)]\n\n\ndef func_5(var_6=0):\n \"\"\"\"\"\"\n if var_6 == 0:\n var_10 = list(input().split())\n if len(var_10) == 1:\n return var_10[0]\n elif len(var_10) > 1:\n return var_10\n else:\n return [list(input().split()) for _ in range(var_6)]\n\n\ndef func_3(var_6=0):\n \"\"\"\"\"\"\n if var_6 == 0:\n return [var_9 for var_9 in func_5()]\n else:\n return [[var_9 for var_9 in func_5()] for _ in range(var_6)]\n\n\ndef func_1(var_1):\n if var_1 == 1:\n return [[var_1, 1]]\n else:\n var_11 = 2\n var_2 = []\n while var_11 < np.sqrt(var_1) + 1:\n var_6 = 0\n var_8 = [var_11]\n while var_1 % var_11 == 0:\n var_1 = int(var_1 / var_11)\n\n var_6 += 1\n var_3 = 1\n if var_6 != 0:\n var_8.append(var_6)\n var_2.append(var_8)\n var_11 += 1\n var_3 = 0\n if var_3 == 0 and var_1 != 1:\n var_2.append([var_1, 1])\n return var_2\n\n\nvar_6 = func_4()\nif var_6 == 1:\n print((0))\n sys.exit()\nelse:\n var_1 = func_1(var_6)\n var_3 = 0\n for var_7 in var_1:\n var_4 = 1\n while var_7[1] - var_4 > -1:\n var_7[1] -= var_4\n var_4 += 1\n var_3 += 1\n print(var_3)\n", "slow_time": 4797853731, "fast_time": 791363973, "speedup": 6.0628, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_14"} -{"pair_id": "python_5880", "problem_id": "p03039", "language": "python", "slow_code": "from collections import defaultdict\n\nvar_8 = 10**9 + 7\nvar_7 = defaultdict(int)\n\n\ndef func_1(var_9, var_10):\n if (var_9, var_10) in var_7:\n return var_7[(var_9, var_10)]\n if var_9 < var_10 or var_10 < 0:\n return 0\n if var_10 > var_9 - var_10:\n return func_1(var_9, var_9 - var_10)\n var_11 = (\n var_3[var_9]\n * pow(var_3[var_9 - var_10], var_8 - 2, var_8)\n * pow(var_3[var_10], var_8 - 2, var_8)\n % var_8\n )\n var_7[(var_9, var_10)] = var_11\n return var_11\n\n\nvar_9, var_6, var_5 = list(map(int, input().split()))\nvar_3 = [1]\nfor var_4 in range(1, 2 * 10**5 + 1):\n var_3.append(var_3[-1] * var_4 % var_8)\nvar_1 = 0\nfor var_2 in range(1, var_6):\n var_1 += var_2 * (var_6 - var_2) * var_9**2\n var_1 %= var_8\nfor var_2 in range(1, var_9):\n var_1 += var_2 * (var_9 - var_2) * var_6**2\n var_1 %= var_8\nvar_1 *= func_1(var_9 * var_6 - 2, var_5 - 2)\nvar_1 %= var_8\nprint(var_1)\n", "fast_code": "import sys\n\nvar_8 = sys.stdin.readline\n\n\ndef func_1():\n return int(eval(var_8()))\n\n\ndef func_3():\n return list(map(int, var_8().split()))\n\n\ndef func_2():\n return list(map(int, var_8().split()))\n\n\ndef func_6():\n var_11 = 10**9 + 7\n var_3, var_2, var_1 = func_3()\n\n def func_7(var_16):\n return ((var_16 * (var_16 + 1)) // 2) % var_11\n\n def func_4(var_7, var_10):\n var_15 = 0\n var_15 = func_7(var_2 - var_10 - 1)\n var_15 = (\n var_15\n + ((func_7(var_2 - var_10 - 1) + func_7(var_10)) * (var_3 - var_7 - 1))\n ) % var_11\n var_15 = (var_15 + func_7(var_3 - var_7 - 1) * var_2) % var_11\n return var_15\n\n var_4 = 0\n for var_7 in range(var_3):\n for var_10 in range(var_2):\n var_4 = (var_4 + func_4(var_7, var_10)) % var_11\n var_14 = (var_3 * var_2) - 2\n\n def func_5(var_12, var_13, var_11):\n if (var_13 < 0) or (var_12 < var_13):\n return 0\n var_13 = min(var_13, var_12 - var_13)\n return (var_5[var_12] * var_6[var_13] * var_6[var_12 - var_13]) % var_11\n\n var_5 = [1, 1]\n var_6 = [1, 1]\n var_9 = [0, 1]\n for var_7 in range(2, var_14 + 1):\n var_5.append((var_5[-1] * var_7) % var_11)\n var_9.append((-var_9[var_11 % var_7] * (var_11 // var_7)) % var_11)\n var_6.append((var_6[-1] * var_9[-1]) % var_11)\n\n var_4 = (var_4 * func_5(var_14, var_1 - 2, var_11)) % var_11\n print(var_4)\n\n\nfunc_6()\n", "slow_time": 16316171922, "fast_time": 3886560076, "speedup": 4.1981, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_9"} -{"pair_id": "python_6758", "problem_id": "p02938", "language": "python", "slow_code": "var_1, var_4 = list(map(int, input().split()))\nvar_9 = 10**9 + 7\n\n\ndef func_1(var_1, var_4):\n if var_1 > var_4:\n return 0\n var_4 = bin(var_4)[2:]\n var_3 = len(var_4)\n var_11 = func_1(var_1, int(\"0\" + \"1\" * (var_3 - 1), 2))\n var_1 = bin(var_1)[2:]\n if len(var_1) != var_3:\n var_1 = \"1\" + \"0\" * (var_3 - 1)\n for var_6 in range(var_3):\n if var_4[var_6] == \"0\":\n continue\n var_5 = var_4[:var_6] + \"0\" + \"?\" * (var_3 - var_6 - 1)\n if var_6 == 0:\n var_5 = var_4\n for var_7 in range(var_3):\n if var_1[var_7] == \"1\" and var_7 != 0:\n continue\n var_2 = var_1[:var_7] + \"1\" + \"?\" * (var_3 - var_7 - 1)\n if var_7 == 0:\n var_2 = var_1\n if var_2[0] == \"0\":\n break\n var_12 = 1\n for var_10, var_8 in zip(var_5[1:], var_2[1:]):\n if var_10 == \"0\" and var_8 == \"1\":\n var_12 *= 0\n break\n if var_10 == \"?\" and var_8 == \"?\":\n var_12 = var_12 * 3 % var_9\n if var_10 == \"?\" and var_8 == \"0\":\n var_12 = var_12 * 2 % var_9\n if var_10 == \"1\" and var_8 == \"?\":\n var_12 = var_12 * 2 % var_9\n var_11 += var_12\n var_11 %= var_9\n return var_11\n\n\nprint((func_1(var_1, var_4)))\n", "fast_code": "var_1, var_3 = list(map(int, input().split()))\nvar_2 = 10**9 + 7\nvar_11 = \"{:060b}\".format(var_1)[::-1]\nvar_14 = \"{:060b}\".format(var_3)[::-1]\nvar_12 = [\n [[[-1 for var_11 in range(2)] for var_10 in range(2)] for var_9 in range(2)]\n for var_8 in range(60)\n]\n\n\ndef func_1(var_13, var_5, var_6, var_7):\n if var_13 == -1:\n return 1\n if var_12[var_13][var_5][var_6][var_7] != -1:\n return var_12[var_13][var_5][var_6][var_7]\n var_15 = 0\n\n if var_5 or var_11[var_13] == \"0\":\n var_15 += func_1(\n var_13 - 1, var_5, 1 if var_14[var_13] == \"1\" else var_6, var_7\n )\n\n if (var_5 or var_11[var_13] == \"0\") and (var_6 or var_14[var_13] == \"1\") and var_7:\n var_15 += func_1(var_13 - 1, var_5, var_6, var_7)\n\n if var_6 or var_14[var_13] == \"1\":\n var_15 += func_1(var_13 - 1, 1 if var_11[var_13] == \"0\" else var_5, var_6, 1)\n var_15 %= var_2\n var_12[var_13][var_5][var_6][var_7] = var_15\n return var_15\n\n\nvar_4 = func_1(59, 0, 0, 0)\nprint(var_4)\n", "slow_time": 23510247972, "fast_time": 136169383, "speedup": 172.6544, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_0"} -{"pair_id": "python_10936", "problem_id": "p02570", "language": "python", "slow_code": "def func_2():\n return list(map(int, input().split()))\n\n\ndef func_1():\n return int(input())\n\n\ndef func_10():\n return print(\"Yes\")\n\n\ndef func_6():\n return print(\"No\")\n\n\nvar_1 = float(\"inf\")\nfrom collections import deque, defaultdict, Counter\nfrom heapq import heappop, heappush\nfrom itertools import product, combinations\nfrom functools import reduce, lru_cache\nfrom math import pi, gcd\nfrom decimal import Decimal\n\n\nclass Class_1:\n \"\"\"\"\"\"\n\n def __init__(self, var_10, var_7=10**9 + 7):\n self.mod = var_7\n self.modinv = self.make_modinv_list(var_10)\n self.fac, self.facinv = self.make_factorial_list(var_10)\n\n def __call__(self, var_9, var_11):\n return (\n self.fac[var_9]\n * self.facinv[var_11]\n % self.mod\n * self.facinv[var_9 - var_11]\n % self.mod\n )\n\n def func_4(self, var_9):\n\n var_4 = [1]\n var_5 = [1]\n for var_6 in range(1, var_9 + 1):\n var_4.append(var_4[var_6 - 1] * var_6 % self.mod)\n var_5.append(var_5[var_6 - 1] * self.modinv[var_6] % self.mod)\n return var_4, var_5\n\n def func_5(self, var_9):\n\n var_8 = [0] * (var_9 + 1)\n var_8[1] = 1\n for var_6 in range(2, var_9 + 1):\n var_8[var_6] = (\n self.mod - self.mod // var_6 * var_8[self.mod % var_6] % self.mod\n )\n return var_8\n\n\nclass Class_2:\n def __init__(self, var_2):\n self.p = list(range(var_2))\n self.rank = [0] * var_2\n self.size = [1] * var_2\n\n def func_7(self, var_16):\n if self.p[var_16] != var_16:\n self.p[var_16] = self.root(self.p[var_16])\n return self.p[var_16]\n\n def func_8(self, var_16, var_17):\n return self.root(var_16) == self.root(var_17)\n\n def func_9(self, var_16, var_17):\n var_14 = self.root(var_16)\n var_15 = self.root(var_17)\n if var_14 == var_15:\n return\n if self.rank[var_14] < self.rank[var_15]:\n self.p[var_14] = var_15\n self.size[var_15] += self.size[var_14]\n self.size[var_14] = 0\n else:\n self.p[var_15] = var_14\n self.size[var_14] += self.size[var_15]\n self.size[var_15] = 0\n if self.rank[var_14] == self.rank[var_15]:\n self.rank[var_14] += 1\n\n def func_3(self, var_16):\n return self.size[self.root(var_16)]\n\n\nvar_3, var_13, var_12 = func_2()\nif var_3 <= var_13 * var_12:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "def func_1() -> tuple:\n \"\"\"\"\"\"\n var_1, var_3, var_2 = list(map(int, input().split()))\n return var_1, var_3, var_2\n\n\ndef func_2(var_1: int, var_3: int, var_2: int) -> None:\n \"\"\"\"\"\"\n\n var_4 = str()\n if var_1 <= var_2 * var_3:\n var_4 = \"Yes\"\n else:\n var_4 = \"No\"\n\n print(var_4)\n\n\nif __name__ == \"__main__\":\n\n var_1, var_3, var_2 = func_1()\n\n func_2(var_1, var_3, var_2)\n", "slow_time": 146040359, "fast_time": 31880727, "speedup": 4.5808, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_9"} -{"pair_id": "python_14650", "problem_id": "p03649", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\n\n\ndef func_1(var_2):\n var_8 = 0\n for var_9 in var_1:\n if var_9 + var_2 - var_4 >= 0:\n var_8 += (var_9 + var_2 - var_4) // (var_4 + 1) + 1\n\n return int(var_8 <= var_2)\n\n\nvar_6 = 0\nvar_7 = 10**30\nfunc_1(1234567894848)\nwhile var_7 - var_6 > 1:\n var_3 = (var_6 + var_7) // 2\n if func_1(var_3) > 0:\n var_7 = var_3\n else:\n var_6 = var_3\nfor var_5 in range(10**5, -1, -1):\n if func_1(var_7 - var_5):\n print((var_7 - var_5))\n break\n", "fast_code": "var_6 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_4 = 0\nvar_2 = 0\nwhile max(var_1) >= var_6:\n if var_1[var_4] >= var_6:\n var_3 = var_1[var_4] // var_6\n var_2 += var_3\n var_1[var_4] -= var_6 * var_3\n for var_5 in range(var_6):\n if var_5 == var_4:\n continue\n var_1[var_5] += var_3\n var_4 = (var_4 + 1) % var_6\nprint(var_2)\n", "slow_time": 100457990677, "fast_time": 834262859, "speedup": 120.4153, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_4"} -{"pair_id": "python_16455", "problem_id": "p03796", "language": "python", "slow_code": "var_1 = int(eval(input()))\nfrom math import factorial\n\nvar_3 = int(1e9 + 7)\nvar_2 = factorial(var_1) % var_3\nprint(var_2)\n", "fast_code": "var_2 = int(1e9 + 7)\nvar_3 = int(eval(input()))\nvar_4 = 1\nfor var_1 in range(1, var_3 + 1):\n var_4 = var_4 * var_1 % var_2\nprint(var_4)\n", "slow_time": 27008058263, "fast_time": 2833968541, "speedup": 9.5301, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_28"} -{"pair_id": "python_5515", "problem_id": "p03251", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(10000)\n\n\ndef func_6():\n return int(input())\n\n\ndef func_7():\n return list(map(int, input().split()))\n\n\ndef func_4():\n return float(input())\n\n\ndef func_5():\n return list(map(float, input().split()))\n\n\ndef func_8():\n return input().strip()\n\n\ndef func_9():\n return list(map(str, input().split()))\n\n\ndef func_1(*var_5):\n print(*var_5, file=sys.stderr)\n\n\ndef func_3(var_7):\n import time\n\n def func_11(*var_5, **var_8):\n var_12 = time.time()\n var_11 = var_7(*var_5, **var_8)\n var_6 = time.time()\n func_1(var_6 - var_12, \"sec\")\n return var_11\n\n return func_11\n\n\n@func_3\ndef func_10(var_2, var_1, var_3, var_4, var_13, var_14):\n var_9 = max(var_13)\n var_10 = min(var_14)\n func_1(var_9, var_10)\n if var_9 < var_10 and (var_10 > var_3 and var_9 < var_4):\n return \"No War\"\n return \"War\"\n\n\ndef func_2():\n var_2, var_1, var_3, var_4 = func_7()\n var_13 = func_7()\n var_14 = func_7()\n print(func_10(var_2, var_1, var_3, var_4, var_13, var_14))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "(*_, var_1, var_2), var_3, var_4 = eval(\"map(int,input().split()),\" * 3)\nprint((\"No\" * (max(var_1, *var_3) < min(var_2, *var_4)), \"War\"))\n", "slow_time": 87179202, "fast_time": 18836950, "speedup": 4.6281, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_1"} -{"pair_id": "python_14857", "problem_id": "p02900", "language": "python", "slow_code": "def func_1(var_9, var_10):\n if var_9 < var_10:\n var_9, var_10 = var_10, var_9\n while var_10 > 0:\n var_9, var_10 = var_10, var_9 % var_10\n return var_9\n\n\nvar_3 = 10**6\nvar_4 = [1 for var_7 in range(var_3 + 1)]\nvar_4[0] = 0\nvar_4[1] = 0\nfor var_7 in range(2, int((var_3 + 1) ** 0.5) + 1):\n for var_8 in range(var_7 * var_7, var_3 + 1, var_7):\n var_4[var_8] = 0\nvar_5 = []\nfor var_7 in range(var_3):\n if var_4[var_7] == 1:\n var_5.append(var_7)\nvar_1, var_2 = list(map(int, input().split()))\nvar_9 = func_1(var_1, var_2)\nvar_6 = 1\nfor var_10 in var_5:\n if var_9 % var_10 == 0:\n var_6 += 1\n while var_9 % var_10 == 0:\n var_9 = var_9 // var_10\nif var_9 > 1:\n var_6 += 1\nprint(var_6)\n", "fast_code": "import sys\n\nvar_11 = lambda: sys.stdin.readline().rstrip()\nvar_6 = lambda: int(var_11())\nvar_7 = lambda: list(map(int, var_11().split()))\nvar_1, var_2 = var_7()\n\n\ndef func_1(var_8):\n var_3 = []\n while var_8 % 2 == 0:\n var_3.append(2)\n var_8 //= 2\n var_5 = 3\n while var_5 * var_5 <= var_8:\n if var_8 % var_5 == 0:\n var_3.append(var_5)\n var_8 //= var_5\n else:\n var_5 += 2\n if var_8 != 1:\n var_3.append(var_8)\n return var_3\n\n\nvar_10 = func_1(min(var_1, var_2))\nvar_4 = set()\nfor var_9 in var_10:\n if var_1 % var_9 == 0 and var_2 % var_9 == 0:\n var_4.add(var_9)\nprint((len(var_4) + 1))\n", "slow_time": 293177338513, "fast_time": 55456862, "speedup": 5286.5836, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_17"} -{"pair_id": "python_16989", "problem_id": "p03700", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom fractions import Fraction\nfrom functools import lru_cache, reduce\nfrom itertools import (\n combinations,\n combinations_with_replacement,\n product,\n permutations,\n accumulate,\n)\nfrom operator import add, mul, sub, itemgetter, attrgetter\nimport sys\n\nvar_17 = sys.stdin.readline\nvar_4 = 2**62 - 1\n\n\ndef func_9():\n return int(var_17())\n\n\ndef func_10():\n return list(map(int, var_17().split()))\n\n\ndef func_7():\n return float(var_17())\n\n\ndef func_8():\n return list(map(float, var_17().split()))\n\n\ndef func_11():\n return var_17().strip()\n\n\ndef func_12():\n return var_17().strip().split()\n\n\ndef func_3(*var_6):\n print(*var_6, file=sys.stderr)\n\n\ndef func_6(func_4):\n import time\n\n def func_14(*var_6, **var_12):\n var_19 = time.perf_counter()\n var_18 = func_4(*var_6, **var_12)\n var_8 = time.perf_counter()\n func_3(var_8 - var_19, \"sec\")\n return var_18\n\n return func_14\n\n\nclass Class_1:\n def __init__(self, var_9):\n self.__func = var_9\n\n def func_1(self, var_20, var_13, var_11):\n while var_13 < var_11:\n var_15 = (var_13 + var_11) // 2\n if self.__func(var_15) < var_20:\n var_13 = var_15 + 1\n else:\n var_11 = var_15\n return var_13\n\n def func_2(self, var_20, var_13, var_11):\n while var_13 < var_11:\n var_15 = (var_13 + var_11) // 2\n if var_20 < self.__func(var_15):\n var_11 = var_15\n else:\n var_13 = var_15 + 1\n return var_13\n\n\n@func_6\ndef func_13(var_5, var_1, var_2, var_3):\n var_7 = var_1 - var_2\n\n def func_4(var_16):\n var_14 = var_16\n for var_10 in var_3:\n var_10 -= var_16 * var_2\n if var_10 > 0:\n var_14 -= -(-var_10 // var_7)\n return 1 if var_14 >= 0 else 0\n\n return Class_1(func_4).bisect_left(1, 0, 10**9)\n\n\ndef func_5():\n var_5, var_1, var_2 = func_10()\n var_3 = [func_9() for _ in range(var_5)]\n print(func_13(var_5, var_1, var_2, var_3))\n\n\nif __name__ == \"__main__\":\n func_5()\n", "fast_code": "_, var_2, var_3, *var_1 = list(map(int, open(0).read().split()))\nvar_5, var_7 = 0, 10**9\nwhile var_7 - var_5 > 1:\n var_6 = (var_5 + var_7) // 2\n if (\n -sum(min(0, (var_4 - var_6 * var_3) // (var_3 - var_2)) for var_4 in var_1)\n > var_6\n ):\n var_5 = var_6\n else:\n var_7 = var_6\nprint(var_7)\n", "slow_time": 170369562, "fast_time": 56893284, "speedup": 2.9945, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_2"} -{"pair_id": "python_13120", "problem_id": "p02783", "language": "python", "slow_code": "import sys\nimport socket\n\nvar_3 = socket.gethostname()\nif var_3 == \"F451C\":\n sys.stdin = open(\"a1.in\")\n\n\ndef func_5():\n return list(map(int, input().split()))\n\n\ndef func_7():\n return input().split()\n\n\ndef func_4():\n return int(eval(input()))\n\n\ndef func_6():\n return eval(input())\n\n\ndef func_2():\n var_2, var_1 = func_5()\n var_5 = 0\n for var_4 in range(10001):\n var_2 = var_2 - var_1\n var_5 += 1\n if var_2 <= 0:\n break\n print(var_5)\n\n\ndef func_3():\n var_2, var_1 = func_5()\n var_5 = var_2 // var_1\n if var_2 % var_1 != 0:\n var_5 += 1\n print(var_5)\n\n\ndef func_1():\n var_2, var_1 = func_5()\n var_5 = 0\n while var_2 > 0:\n var_2 -= var_1\n var_5 += 1\n print(var_5)\n\n\nfunc_1()\n", "fast_code": "def func_1():\n return [int(var_3) for var_3 in input().split()]\n\n\nvar_2, var_1 = func_1()\nif var_2 % var_1 == 0:\n print((var_2 // var_1))\nelse:\n print(((var_2 // var_1) + 1))\n", "slow_time": 135296255, "fast_time": 18042889, "speedup": 7.4986, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_9"} -{"pair_id": "python_2215", "problem_id": "p02585", "language": "python", "slow_code": "import sys\n\nvar_21 = sys.stdin.readline\nvar_20 = sys.stdin.read\nvar_14 = lambda: var_21().rstrip()\nvar_11 = lambda: int(var_21().rstrip())\nvar_13 = lambda: map(int, var_21().split())\nvar_12 = lambda: list(map(int, var_21().split()))\nvar_18 = lambda var_24: print(*var_24, sep=\"\\n\")\n\n\ndef func_1():\n var_10, var_8 = var_13()\n var_16 = var_12()\n _c = var_12()\n var_5 = [0] * var_10\n for var_7 in range(var_10):\n var_16[var_7] -= 1\n var_5[var_7] = _c[var_16[var_7]]\n var_9 = 31\n var_1 = -(1 << 63)\n var_23 = list()\n var_22 = list()\n var_23.append(var_16)\n var_22.append(var_5)\n for var_2 in range(1, var_9 + 1):\n var_17 = [0] * var_10\n var_6 = [0] * var_10\n for var_7 in range(var_10):\n var_17[var_7] = var_23[var_2 - 1][var_23[var_2 - 1][var_7]]\n var_6[var_7] = (\n var_22[var_2 - 1][var_7] + var_22[var_2 - 1][var_23[var_2 - 1][var_7]]\n )\n var_23.append(var_17)\n var_22.append(var_6)\n var_19 = [[var_1, 0] for _ in range(var_10)]\n var_15 = [[var_1, var_1] for _ in range(var_10)]\n for var_4 in range(var_9, -1, -1):\n for var_7 in range(var_10):\n if (var_8 >> var_4) & 1:\n var_15[var_23[var_4][var_7]][0] = max(\n var_15[var_23[var_4][var_7]][0],\n var_19[var_7][0] + var_22[var_4][var_7],\n )\n var_15[var_23[var_4][var_7]][1] = max(\n var_15[var_23[var_4][var_7]][1],\n var_19[var_7][1] + var_22[var_4][var_7],\n )\n var_15[var_7][0] = max(\n var_15[var_7][0], var_19[var_7][0], var_19[var_7][1]\n )\n else:\n var_15[var_23[var_4][var_7]][0] = max(\n var_15[var_23[var_4][var_7]][0],\n var_19[var_7][0] + var_22[var_4][var_7],\n )\n var_15[var_7][0] = max(var_15[var_7][0], var_19[var_7][0])\n var_15[var_7][1] = max(var_15[var_7][1], var_19[var_7][1])\n var_19, var_15 = var_15, var_19\n var_3 = max(max(var_24) for var_24 in var_19)\n if var_3 == 0:\n var_3 = max(var_5)\n print(var_3)\n return\n\n\nfunc_1()\n", "fast_code": "var_3, var_2 = list(map(int, input().split()))\nvar_4 = list([int(var_13) - 1 for var_13 in input().split()])\nvar_1 = list(map(int, input().split()))\nvar_5 = -float(\"inf\")\nfor var_12 in range(var_3):\n var_6 = var_4[var_12]\n var_11 = [var_1[var_6]]\n for _ in range(var_2):\n if var_6 == var_12:\n break\n var_6 = var_4[var_6]\n var_11.append(var_1[var_6] + var_11[-1])\n for var_7 in range(len(var_11)):\n var_9 = var_11[var_7]\n var_10 = var_2 - var_7 - 1\n if var_11[-1] > 0:\n var_8 = var_10 // len(var_11)\n else:\n var_8 = 0\n var_5 = max(var_5, var_9 + var_11[-1] * var_8)\nprint(var_5)\n", "slow_time": 231578340, "fast_time": 71739336, "speedup": 3.2281, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_8"} -{"pair_id": "python_9318", "problem_id": "p02792", "language": "python", "slow_code": "var_1 = int(eval(input()))\n\n\ndef func_1(var_3, var_4):\n var_6 = 0\n var_7 = str(var_3)\n for var_5 in range(1, var_1 + 1):\n if var_5 % 10 != var_4:\n continue\n if str(var_5)[0] != var_7:\n continue\n var_6 += 1\n return var_6\n\n\nvar_2 = 0\nfor var_3 in range(10):\n for var_4 in range(10):\n var_2 += func_1(var_3, var_4) * func_1(var_4, var_3)\nprint(var_2)\n", "fast_code": "from collections import defaultdict\n\n\ndef func_1():\n var_1 = int(eval(input()))\n var_4 = [(var_2[0], var_2[-1]) for var_2 in map(str, list(range(1, var_1 + 1)))]\n var_5 = defaultdict(int)\n for var_7, var_8 in var_4:\n var_5[(var_7, var_8)] += 1\n var_5[(var_8, var_7)]\n var_3 = 0\n for var_6, var_9 in list(var_5.items()):\n var_7, var_8 = var_6\n var_3 += var_9 * var_5[(var_8, var_7)]\n print(var_3)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 1958045613, "fast_time": 131778554, "speedup": 14.8586, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_22"} -{"pair_id": "python_5286", "problem_id": "p02729", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = [2 * var_5 for var_5 in range(var_2)]\nvar_3.extend([2 * var_5 + 1 for var_5 in range(var_1)])\nvar_4 = 0\nfor var_5, var_7 in enumerate(var_3):\n for var_6, var_8 in enumerate(var_3):\n if var_5 == var_6:\n continue\n if (var_7 + var_8) % 2 == 0:\n var_4 += 1\nprint((var_4 // 2))\n", "fast_code": "var_1, var_3 = list(map(int, input().split()))\nimport itertools\n\nvar_2 = len(list(itertools.combinations(list(range(var_1)), 2)))\nvar_4 = len(list(itertools.combinations(list(range(var_3)), 2)))\nprint((var_2 + var_4))\n", "slow_time": 1766878550, "fast_time": 272958752, "speedup": 6.4731, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_18"} -{"pair_id": "python_13694", "problem_id": "p03774", "language": "python", "slow_code": "from scipy.spatial.distance import cdist\nimport numpy as np\n\nvar_6, var_5 = list(map(int, input().split()))\nvar_7 = [list(map(int, input().split())) for _ in range(var_6)]\nvar_2 = [list(map(int, input().split())) for _ in range(var_5)]\n\n\nvar_1 = cdist(var_7, var_2, \"cityblock\")\nvar_4 = np.argmin(var_1, axis=1)\nfor var_3 in var_4:\n print((var_3 + 1))\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_6 = [list(map(int, input().split())) for _ in range(var_2)]\nvar_5 = [list(map(int, input().split())) for _ in range(var_1)]\nvar_7 = []\nfor var_3 in range(len(var_6)):\n var_7 = []\n for var_4 in range(len(var_5)):\n var_7.append(\n abs(var_6[var_3][0] - var_5[var_4][0])\n + abs(var_6[var_3][1] - var_5[var_4][1])\n )\n print((var_7.index(min(var_7)) + 1))\n", "slow_time": 29997139149, "fast_time": 53884023, "speedup": 556.6982, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_21"} -{"pair_id": "python_4214", "problem_id": "p02709", "language": "python", "slow_code": "import sys\nimport numpy as np\n\n\ndef func_1(var_9, var_2):\n var_1 = []\n for var_5, var_3 in enumerate(var_2):\n var_1.append([1 + var_5, var_3])\n var_1.sort(key=lambda var_11: var_11[1], reverse=True)\n var_4 = np.zeros((var_9 + 1, var_9 + 1), np.int64)\n var_4[1, 1] = var_1[0][1] * (var_9 - var_1[0][0])\n var_4[1, 0] = var_1[0][1] * (var_1[0][0] - 1)\n for var_5 in range(2, var_9 + 1):\n var_4[var_5, 0] = var_4[var_5 - 1, 0] + var_1[var_5 - 1][1] * abs(\n (var_1[var_5 - 1][0] - 1 - (var_5 - 1))\n )\n var_4[var_5, var_5] = var_4[var_5 - 1, var_5 - 1] + var_1[var_5 - 1][1] * abs(\n (var_9 - var_1[var_5 - 1][0] - (var_5 - 1))\n )\n\n var_8 = var_4[var_5 - 1, 1:var_5] + [\n var_1[var_5 - 1][1] * abs((var_1[var_5 - 1][0] - 1 - var_7))\n for var_7 in range(var_5 - 2, -1, -1)\n ]\n\n var_10 = var_4[var_5 - 1, : var_5 - 1] + [\n var_1[var_5 - 1][1] * abs((var_9 - var_1[var_5 - 1][0] - var_7))\n for var_7 in range(var_5 - 1)\n ]\n var_4[var_5, 1:var_5] = np.maximum(var_8, var_10)\n return max(var_4[var_9])\n\n\nif __name__ == \"__main__\":\n var_6 = sys.stdin.readline\n var_9 = int(eval(var_6()))\n var_2 = list(map(int, var_6().split()))\n print((func_1(var_9, var_2)))\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = []\nfor var_6, var_3 in enumerate(map(int, input().split())):\n var_1.append((var_3 << 11) + var_6)\nvar_1.sort(reverse=True)\nvar_5 = [0] * (var_2 + 1)\nfor var_6, var_4 in enumerate(var_1, start=1):\n var_8, var_3 = var_4 % (1 << 11), var_4 >> 11\n for var_7 in reversed(list(range(0, var_6 + 1))):\n var_5[var_7] = max(\n (var_5[var_7 - 1] + var_3 * (var_8 - (var_7 - 1))) * (var_7 - 1 >= 0),\n (var_5[var_7] + var_3 * (var_2 - (var_6 - var_7) - var_8))\n * (var_7 <= var_6 - 1),\n )\nprint((max(var_5)))\n", "slow_time": 120871673, "fast_time": 56490914, "speedup": 2.1397, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_21"} -{"pair_id": "python_15412", "problem_id": "p02695", "language": "python", "slow_code": "var_3, var_2, var_4 = list(map(int, input().split()))\nvar_7 = [list(map(int, input().split())) for _ in range(var_4)]\nvar_12 = var_2 - 1\n\n\ndef func_1(var_15):\n if len(var_15) == var_3:\n return [var_15]\n var_14 = []\n if var_15 == \"\":\n var_13 = 0\n else:\n var_13 = int(var_15[-1])\n for var_11 in range(var_13, var_12 + 1):\n var_14.extend(func_1(var_15 + str(var_11)))\n return var_14\n\n\nvar_14 = 0\nvar_5 = func_1(\"\")\nfor var_15 in var_5:\n var_1 = [int(var_9) + 1 for var_9 in var_15]\n var_16 = 0\n for var_6, var_8, var_9, var_10 in var_7:\n if var_1[var_8 - 1] - var_1[var_6 - 1] == var_9:\n var_16 += var_10\n var_14 = max(var_14, var_16)\nprint(var_14)\n", "fast_code": "var_11 = []\n\n\ndef func_1(var_1):\n if len(var_1) == var_3:\n var_12 = 0\n for var_5, var_7, var_8, var_9 in var_6:\n if var_1[var_7 - 1] - var_1[var_5 - 1] == var_8:\n var_12 += var_9\n var_11.append(var_12)\n return\n var_10 = 1\n if len(var_1) != 0:\n var_10 = var_1[-1]\n for var_13 in range(var_10, var_2 + 1):\n var_1.append(var_13)\n func_1(var_1)\n var_1.pop()\n\n\nvar_3, var_2, var_4 = list(map(int, input().split()))\nvar_6 = [list(map(int, input().split())) for _ in range(var_4)]\nfunc_1([])\nprint((max(var_11)))\n", "slow_time": 2405983235, "fast_time": 549239550, "speedup": 4.3806, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_17"} -{"pair_id": "python_6745", "problem_id": "p02289", "language": "python", "slow_code": "import sys\n\n\ndef func_3(var_1, var_4):\n var_6 = var_4 * 2 + 1\n var_10 = var_4 * 2 + 2\n if var_6 < var_8:\n var_7 = var_6\n if var_10 < var_8 and var_1[var_10] > var_1[var_6]:\n var_7 = var_10\n if var_1[var_7] > var_1[var_4]:\n var_1[var_4], var_1[var_7] = var_1[var_7], var_1[var_4]\n func_3(var_1, var_7)\n\n\ndef func_2(var_2, var_5):\n global n\n var_2[var_8] = var_5\n var_8 += 1\n var_4 = var_8 - 1\n var_9 = (var_4 - 1) // 2\n while var_4 > 0 and var_2[var_4] > var_2[var_9]:\n var_2[var_4], var_2[var_9] = var_2[var_9], var_2[var_4]\n var_4 = var_9\n var_9 = (var_4 - 1) // 2\n\n\ndef func_1(var_2):\n global n\n if var_8 == 1:\n var_8 -= 1\n return var_2[0]\n var_3 = var_2[0]\n var_8 -= 1\n var_2[0] = var_2[var_8]\n var_4 = 0\n while True:\n var_6 = var_4 * 2 + 1\n var_10 = var_4 * 2 + 2\n if var_6 >= var_8:\n break\n var_7 = var_6\n if var_10 < var_8 and var_1[var_10] > var_1[var_6]:\n var_7 = var_10\n if var_1[var_7] > var_1[var_4]:\n var_1[var_4], var_1[var_7] = var_1[var_7], var_1[var_4]\n var_4 = var_7\n else:\n break\n return var_3\n\n\nvar_1 = [0] * 2000000\nvar_2 = []\nvar_8 = 0\nfor var_11 in sys.stdin:\n if var_11[2] == \"s\":\n func_2(var_1, int(var_11[7:]))\n elif var_11[2] == \"t\":\n var_2.append(func_1(var_1))\n else:\n break\nprint((\"\\n\".join(map(str, var_2))))\n", "fast_code": "import sys\nfrom heapq import heappush, heappop\n\nvar_1 = []\nvar_2 = []\nfor var_3 in sys.stdin:\n if \"i\" == var_3[0]:\n heappush(var_1, -int(var_3[7:]))\n elif \"t\" == var_3[2]:\n var_2 += [-heappop(var_1)]\n else:\n print((\"\\n\".join(map(str, var_2))))\n", "slow_time": 170032903, "fast_time": 24530562, "speedup": 6.9315, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_4"} -{"pair_id": "python_1451", "problem_id": "p03612", "language": "python", "slow_code": "import sys\nfrom collections import deque\n\n\ndef func_1():\n return sys.stdin.readline().strip()\n\n\ndef func_2():\n var_1 = int(eval(func_1()))\n var_2 = [0] + list(map(int, func_1().split()))\n var_5 = deque()\n for var_4 in range(1, var_1 + 1):\n if var_4 == var_2[var_4]:\n var_5.append(var_4)\n if not var_5:\n print((0))\n return\n var_3 = 0\n var_6 = var_5.popleft()\n if not var_5:\n print((1))\n return\n while var_5:\n if var_5[0] - var_6 == 1:\n var_5.popleft()\n var_3 += 1\n if var_5:\n var_6 = var_5.popleft()\n if not var_5:\n var_3 += 1\n break\n else:\n var_3 += 1\n var_6 = var_5.popleft()\n if not var_5:\n var_3 += 1\n break\n print(var_3)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = 0\nfor var_3 in range(var_4 - 1):\n if var_1[var_3] == var_3 + 1:\n var_1[var_3], var_1[var_3 + 1] = var_1[var_3 + 1], var_1[var_3]\n var_2 += 1\nif var_1[-1] == var_4:\n var_2 += 1\nprint(var_2)\n", "slow_time": 64178025, "fast_time": 28554657, "speedup": 2.2476, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_14"} -{"pair_id": "python_17124", "problem_id": "p02555", "language": "python", "slow_code": "import sys\n\n\ndef func_2():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4(var_7, var_8, var_6=10**9 + 7):\n func_4 = 1\n for var_4 in range(var_8):\n func_4 = func_4 * (var_7 - var_4) % var_6\n return func_4\n\n\ndef func_1(var_7, var_8, var_6=10**9 + 7):\n var_3 = func_4(var_7, var_8, var_6)\n var_2 = 1\n for var_4 in range(1, var_8 + 1):\n var_2 = var_2 * var_4 % var_6\n return var_3 * pow(var_2, -1, var_6) % var_6\n\n\ndef func_3():\n var_9 = int(eval(func_2()))\n var_1 = 0\n for var_4 in range(1, (var_9 // 3) + 1):\n var_5 = var_9 - 3 * var_4\n var_1 += func_1(var_5 + var_4 - 1, var_4 - 1)\n\n print((var_1 % (10**9 + 7)))\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_4 = int(eval(input()))\nvar_2 = 10**9 + 7\nvar_1 = [0] * (var_4 + 1)\nvar_1[0] = 1\nfor var_3 in range(3, var_4 + 1):\n var_1[var_3] = (var_1[var_3 - 1] + var_1[var_3 - 3]) % var_2\nprint((var_1[var_4]))\n", "slow_time": 205270561, "fast_time": 27847693, "speedup": 7.3712, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_18"} -{"pair_id": "python_10767", "problem_id": "p03767", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_9():\n return [int(var_15) for var_15 in sys.stdin.readline().split()]\n\n\ndef func_7():\n return int(sys.stdin.readline())\n\n\ndef func_11():\n return [list(var_15) for var_15 in sys.stdin.readline().split()]\n\n\ndef func_13():\n return list(sys.stdin.readline())[:-1]\n\n\ndef func_8(var_12):\n return [func_7() for var_8 in range(var_12)]\n\n\ndef func_10(var_12):\n return [func_9() for var_8 in range(var_12)]\n\n\ndef func_14(var_12):\n return [func_13() for var_8 in range(var_12)]\n\n\ndef func_12(var_12):\n return [func_11() for var_8 in range(var_12)]\n\n\nsys.setrecursionlimit(1000000)\nvar_11 = 1000000007\n\n\ndef func_1():\n var_12 = func_7()\n var_1 = func_9()\n var_1.sort(key=lambda var_15: -var_15)\n var_2 = 0\n for var_8 in range(var_12):\n var_2 += var_1[2 * var_8 + 1]\n print(var_2)\n return\n\n\ndef func_2():\n def func_15(var_5, var_15, var_4):\n if var_5 <= var_6[var_15]:\n return\n var_6[var_15] = var_5\n if not var_7[var_15]:\n var_7[var_15] = var_4\n for var_16 in var_14[var_15]:\n func_15(var_5 - 1, var_16, var_4)\n\n var_12, var_10 = func_9()\n var_7 = [0] * var_12\n var_14 = [[] for var_8 in range(var_12)]\n for var_8 in range(var_10):\n var_1, var_3 = func_9()\n var_1 -= 1\n var_3 -= 1\n var_14[var_1].append(var_3)\n var_14[var_3].append(var_1)\n var_6 = defaultdict(lambda: -1)\n var_13 = func_7()\n var_9 = func_10(var_13)\n var_9 = var_9[::-1]\n for var_15, var_5, var_4 in var_9:\n var_15 -= 1\n func_15(var_5, var_15, var_4)\n for var_8 in var_7:\n print(var_8)\n return\n\n\ndef func_3():\n var_12 = func_7()\n return\n\n\ndef func_4():\n var_12 = func_7()\n return\n\n\ndef func_5():\n var_12 = func_7()\n return\n\n\ndef func_6():\n var_12 = func_7()\n return\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "def func_1():\n import sys\n\n var_2 = sys.stdin.readline\n var_3 = int(var_2().rstrip(\"\\n\"))\n var_1 = list(map(int, var_2().rstrip(\"\\n\").split()))\n var_1.sort(reverse=True)\n print((sum(var_1[1 : var_3 * 2 : 2])))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 173061558, "fast_time": 28066028, "speedup": 6.1662, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_27"} -{"pair_id": "python_14406", "problem_id": "p02669", "language": "python", "slow_code": "var_4 = dict()\nvar_1, var_13, var_5 = 0, [], 0\n\n\ndef func_2(var_8, var_10, var_3):\n global check, d\n\n var_4[0] = min(var_4[var_8] + var_8 * var_5, var_4[0])\n\n var_11, var_12 = var_8 // var_10, var_8 % var_10\n if var_11 in var_4:\n if var_4[var_11] > var_4[var_8] + var_12 * var_5 + var_3:\n var_4[var_11] = var_4[var_8] + var_12 * var_5 + var_3\n func_1(var_11)\n else:\n var_4[var_11] = var_4[var_8] + var_12 * var_5 + var_3\n func_1(var_11)\n\n var_11, var_12 = var_8 // var_10 + 1, var_10 - var_8 % var_10\n if var_11 in var_4:\n if var_4[var_11] > var_4[var_8] + var_12 * var_5 + var_3:\n var_4[var_11] = var_4[var_8] + var_12 * var_5 + var_3\n func_1(var_11)\n else:\n var_4[var_11] = var_4[var_8] + var_12 * var_5 + var_3\n func_1(var_11)\n\n\ndef func_1(var_8):\n global b\n for var_6, var_7 in zip([2, 3, 5], var_2):\n func_2(var_8, var_6, var_7)\n\n\nvar_9 = int(eval(input()))\nfor var_6 in range(var_9):\n var_1, *var_2, var_5 = list(map(int, input().split()))\n var_13 = list(zip([2, 3, 5], var_2))\n var_4 = {var_1: 0, 0: var_1 * var_5}\n func_1(var_1)\n print((var_4[0]))\n", "fast_code": "var_6 = int(eval(input()))\nwhile var_6 > 0:\n var_5, var_1, var_2, var_3, var_4 = list(map(int, input().split()))\n var_7 = {}\n\n def func_1(var_8):\n if var_8 == 0:\n return 0\n if var_8 == 1:\n return var_4\n if var_8 in var_7:\n return var_7[var_8]\n var_9 = var_8 * var_4\n if var_8 % 2 == 0:\n var_9 = min(var_9, var_1 + func_1(var_8 // 2))\n else:\n var_9 = min(\n var_9,\n (var_8 % 2) * var_4 + var_1 + func_1(var_8 // 2),\n (2 - var_8 % 2) * var_4\n + var_1\n + func_1((var_8 + (2 - var_8 % 2)) // 2),\n )\n if var_8 % 3 == 0:\n var_9 = min(var_9, var_2 + func_1(var_8 // 3))\n else:\n var_9 = min(\n var_9,\n (var_8 % 3) * var_4 + var_2 + func_1(var_8 // 3),\n (3 - var_8 % 3) * var_4\n + var_2\n + func_1((var_8 + (3 - var_8 % 3)) // 3),\n )\n if var_8 % 5 == 0:\n var_9 = min(var_9, var_3 + func_1(var_8 // 5))\n else:\n var_9 = min(\n var_9,\n (var_8 % 5) * var_4 + var_3 + func_1(var_8 // 5),\n (5 - var_8 % 5) * var_4\n + var_3\n + func_1((var_8 + (5 - var_8 % 5)) // 5),\n )\n var_7[var_8] = var_9\n return var_9\n\n print((func_1(var_5)))\n var_6 -= 1\n", "slow_time": 402246833030, "fast_time": 14346083168, "speedup": 28.0388, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_23"} -{"pair_id": "python_2637", "problem_id": "p02660", "language": "python", "slow_code": "var_3 = int(eval(input()))\nvar_1 = var_4 = 1\nwhile var_4 < 6**8:\n var_2 = var_5 = 0\n var_4 += 1\n while var_3 % var_4 < 1:\n var_3 //= var_4\n var_6 = var_2 == var_5\n var_5 += var_6\n var_2 += 1 - var_5 * var_6\n var_1 += var_6\nprint((var_1 - (var_3 < 2)))\n", "fast_code": "import sys\n\nvar_1 = int(sys.stdin.readline().rstrip())\n\n\ndef func_1(var_8):\n var_5 = []\n for var_7 in range(1, int(var_8**0.5) + 1):\n if var_8 % var_7 == 0:\n var_5.append(var_7)\n if var_7 != var_8 // var_7:\n var_5.append(var_8 // var_7)\n var_5.sort()\n return var_5\n\n\ndef func_2(var_8):\n var_2 = []\n while var_8 % 2 == 0:\n var_2.append(2)\n var_8 //= 2\n var_6 = 3\n while var_6 * var_6 <= var_8:\n if var_8 % var_6 == 0:\n var_2.append(var_6)\n var_8 //= var_6\n else:\n var_6 += 2\n if var_8 != 1:\n var_2.append(var_8)\n var_2 = set(var_2)\n if len(var_2) == 1:\n return True\n else:\n return False\n\n\nvar_5 = func_1(var_1)\nvar_3 = 0\nfor var_4 in var_5:\n if func_2(var_4) and var_1 % var_4 == 0:\n var_1 //= var_4\n var_3 += 1\nprint(var_3)\n", "slow_time": 119229729407, "fast_time": 4531388536, "speedup": 26.312, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_24"} -{"pair_id": "python_5920", "problem_id": "p03693", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_3():\n return [int(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return [list(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_7():\n return list(sys.stdin.readline())[:-1]\n\n\ndef func_2(var_5):\n return [func_1() for var_3 in range(var_5)]\n\n\ndef func_4(var_5):\n return [func_3() for var_3 in range(var_5)]\n\n\ndef func_8(var_5):\n return [func_7() for var_3 in range(var_5)]\n\n\ndef func_6(var_5):\n return [func_5() for var_3 in range(var_5)]\n\n\nsys.setrecursionlimit(1000000)\nvar_4 = 1000000007\n\n\ndef func_9():\n var_6, var_2, var_1 = func_3()\n var_7 = var_6 * 100 + var_2 * 10 + var_1\n if var_7 % 4 == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n return\n\n\nif __name__ == \"__main__\":\n func_9()\n", "fast_code": "var_3, var_2, var_1 = list(map(int, input().split()))\nvar_4 = 100 * var_3 + 10 * var_2 + var_1\nprint((\"YES\" if var_4 % 4 == 0 else \"NO\"))\n", "slow_time": 90554878, "fast_time": 13947746, "speedup": 6.4924, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_18"} -{"pair_id": "python_3318", "problem_id": "p03695", "language": "python", "slow_code": "var_5 = int(eval(input()))\nvar_4 = list(map(int, input().split()))\nvar_2 = {}\nfor var_3 in range(var_5):\n if 1 <= var_4[var_3] <= 399:\n var_1 = 0\n elif 400 <= var_4[var_3] <= 799:\n var_1 = 1\n elif 800 <= var_4[var_3] <= 1199:\n var_1 = 2\n elif 1200 <= var_4[var_3] <= 1599:\n var_1 = 3\n elif 1600 <= var_4[var_3] <= 1999:\n var_1 = 4\n elif 2000 <= var_4[var_3] <= 2399:\n var_1 = 5\n elif 2400 <= var_4[var_3] <= 2799:\n var_1 = 6\n elif 2800 <= var_4[var_3] <= 3199:\n var_1 = 7\n else:\n var_1 = 8\n if var_1 in var_2:\n var_2[var_1] += 1\n else:\n var_2[var_1] = 1\nif not (8 in var_2):\n print((len(list(var_2.keys())), len(list(var_2.keys()))))\nelse:\n if len(list(var_2.keys())) == 1:\n print((len(list(var_2.keys())), len(list(var_2.keys())) - 1 + var_2[8]))\n else:\n print((len(list(var_2.keys())) - 1, len(list(var_2.keys())) - 1 + var_2[8]))\n", "fast_code": "eval(input())\nvar_3 = 0\nvar_1 = set()\nfor var_2 in map(int, input().split()):\n if var_2 >= 3200:\n var_3 += 1\n else:\n var_1.add(var_2 // 400)\nprint((max(1, len(var_1)), len(var_1) + var_3))\n", "slow_time": 84169651, "fast_time": 25553878, "speedup": 3.2938, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_2"} -{"pair_id": "python_11443", "problem_id": "p03504", "language": "python", "slow_code": "from itertools import accumulate\n\nvar_3, var_1 = list(map(int, input().split()))\nvar_2 = [[0] * (10**5 + 1) for var_6 in range(var_1)]\nfor var_6 in range(var_3):\n var_7, var_8, var_5 = list(map(int, input().split()))\n var_5 = var_5 - 1\n var_2[var_5][var_7 - 1] += 1\n var_2[var_5][var_8] -= 1\nfor var_6 in range(var_1):\n var_2[var_6] = list(accumulate(var_2[var_6]))\nvar_4 = 0\nfor var_6 in range(10**5 + 1):\n var_9 = 0\n for var_5 in range(var_1):\n var_9 += min(1, var_2[var_5][var_6])\n var_4 = max(var_4, var_9)\nprint(var_4)\n", "fast_code": "def func_1():\n var_2, var_1 = list(map(int, input().split()))\n\n var_3 = [[0] * (10**5) for _ in range(var_1)]\n for _ in range(var_2):\n var_6, var_7, var_5 = list(map(int, input().split()))\n\n var_3[var_5 - 1][var_6 - 1 : var_7] = [1] * (var_7 - (var_6 - 1))\n var_4 = max(list(map(sum, list(zip(*var_3)))))\n \"\"\"\"\"\"\n print(var_4)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 52568666211, "fast_time": 9027760146, "speedup": 5.823, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_8"} -{"pair_id": "python_10363", "problem_id": "p02706", "language": "python", "slow_code": "var_2 = lambda var_7: int(var_7) - 1\n\n\ndef func_1():\n return int(eval(input()))\n\n\ndef func_4():\n return list(map(int, input().split()))\n\n\ndef func_5():\n return list(map(var_2, input().split()))\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_3(var_5):\n return [func_2() for _ in range(var_5)]\n\n\ndef func_6():\n var_4, var_3 = func_4()\n var_1 = func_2()\n var_6 = sum(var_1)\n if var_4 - var_6 >= 0:\n print((var_4 - var_6))\n else:\n print((-1))\n\n\nif __name__ == \"__main__\":\n func_6()\n", "fast_code": "var_4, var_3 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_2 = sum(var_1)\nprint((max(-1, var_4 - var_2)))\n", "slow_time": 45502445, "fast_time": 13378902, "speedup": 3.4011, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_5"} -{"pair_id": "python_15912", "problem_id": "p03112", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import sqrt, hypot, factorial, pi, sin, cos, radians, log10\n\nif sys.version_info.minor >= 5:\n from math import gcd\nelse:\n from fractions import gcd\nfrom heapq import heappop, heappush, heapify, heappushpop\nfrom bisect import bisect_left, bisect_right\nfrom itertools import permutations, combinations, product, accumulate\nfrom operator import itemgetter, mul, xor\nfrom copy import copy, deepcopy\nfrom functools import reduce, partial\nfrom fractions import Fraction\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom datetime import date\n\n\ndef func_11():\n return sys.stdin.readline().strip()\n\n\ndef func_14(var_8, var_9, var_10):\n return [[var_10] * var_9 for var_16 in range(var_8)]\n\n\ndef func_15(var_8, var_9, var_10, var_11):\n return [[[var_11] * var_10 for var_21 in range(var_9)] for var_16 in range(var_8)]\n\n\ndef func_8(var_23, var_24=1):\n return int(-(-var_23 // var_24))\n\n\ndef func_16(var_23):\n return int((var_23 * 2 + 1) // 2)\n\n\ndef func_9(var_23, var_24, var_4):\n return var_23 * pow(var_24, var_4 - 2, var_4) % var_4\n\n\ndef func_12(var_23, var_24):\n return (var_23 * var_24) // gcd(var_23, var_24)\n\n\ndef func_13(var_22):\n return reduce(func_12, var_22, 1)\n\n\ndef func_10(var_22):\n return reduce(gcd, var_22, var_22[0])\n\n\ndef func_1():\n return int(eval(func_11()))\n\n\ndef func_3():\n return list(map(int, func_11().split()))\n\n\ndef func_2():\n return list(map(int, func_11().split()))\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_3 = float(\"inf\")\nvar_4 = 10**9 + 7\nvar_1, var_2, var_5 = func_3()\nvar_6 = [-var_3] * (var_1 + 2)\nfor var_16 in range(var_1):\n var_6[var_16 + 1] = func_1()\nvar_7 = [-var_3] * (var_2 + 2)\nfor var_16 in range(var_2):\n var_7[var_16 + 1] = func_1()\nvar_6[-1] = var_7[-1] = var_3\nfor var_16 in range(var_5):\n var_12 = var_13 = var_14 = var_15 = var_3\n var_23 = func_1()\n\n var_17 = bisect_right(var_6, var_23) - 1\n\n var_18 = bisect_left(var_6, var_23)\n var_19 = bisect_right(var_7, var_23) - 1\n var_20 = bisect_left(var_7, var_23)\n\n var_12 = var_23 - var_6[var_17]\n\n if var_12 != var_3:\n var_12 += min(\n abs(var_6[var_17] - var_7[var_19]), abs(var_6[var_17] - var_7[var_20])\n )\n var_13 = var_6[var_18] - var_23\n if var_13 != var_3:\n var_13 += min(\n abs(var_6[var_18] - var_7[var_19]), abs(var_6[var_18] - var_7[var_20])\n )\n var_14 = var_23 - var_7[var_19]\n if var_14 != var_3:\n var_14 += min(\n abs(var_7[var_19] - var_6[var_17]), abs(var_7[var_19] - var_6[var_18])\n )\n var_15 = var_7[var_20] - var_23\n if var_15 != var_3:\n var_15 += min(\n abs(var_7[var_20] - var_6[var_17]), abs(var_7[var_20] - var_6[var_18])\n )\n print((min(var_12, var_13, var_14, var_15)))\n", "fast_code": "import sys\nimport bisect\n\nvar_5 = sys.stdin.readline\nvar_1, var_3, var_8 = list(map(int, var_5().split()))\nvar_2 = 10**100\nvar_9 = [-var_2] + [int(eval(var_5())) for var_4 in range(var_1)] + [var_2]\nvar_11 = [-var_2] + [int(eval(var_5())) for var_4 in range(var_3)] + [var_2]\nvar_13 = [int(eval(var_5())) for var_4 in range(var_8)]\nvar_2 = 10**100\nfor var_4 in range(var_8):\n var_2 = 10**100\n var_10 = bisect.bisect_left(var_9, var_13[var_4])\n var_12 = bisect.bisect_left(var_11, var_13[var_4])\n var_10 -= 1\n var_12 -= 1\n\n for var_6 in var_9[var_10 + 0], var_9[var_10 + 1]:\n for var_7 in var_11[var_12 + 0], var_11[var_12 + 1]:\n var_2 = min(\n var_2,\n abs(var_13[var_4] - var_6) + abs(var_6 - var_7),\n abs(var_13[var_4] - var_7) + abs(var_6 - var_7),\n )\n print(var_2)\n", "slow_time": 209429987, "fast_time": 81283677, "speedup": 2.5765, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_17"} -{"pair_id": "python_11253", "problem_id": "p03504", "language": "python", "slow_code": "var_3, var_1 = list(map(int, input().split()))\nfrom collections import defaultdict\n\nvar_2 = defaultdict(int)\nvar_11 = defaultdict(int)\nvar_4 = [tuple(map(int, input().split())) for var_7 in range(var_3)]\nvar_4.sort(key=lambda var_12: var_12[0])\nfor var_9, var_10, var_6 in var_4:\n if var_2[var_6] == var_9:\n var_11[var_9] += 1\n var_11[var_10] -= 1\n var_2[var_6] = var_10\n else:\n var_11[var_9 - 1] += 1\n var_11[var_10] -= 1\n var_2[var_6] = var_10\nvar_5 = 0\nvar_8 = var_11[0]\nvar_5 = var_8\nfor var_7 in range(1, 10**5 + 1):\n var_8 += var_11[var_7]\n var_5 = max(var_5, var_8)\nprint(var_5)\n", "fast_code": "def func_1():\n var_10 = []\n for var_4 in range(var_8):\n var_10.append((-1, -1))\n for var_4 in range(len(var_2)):\n var_7 = var_2[var_4][0]\n var_3 = var_2[var_4][2]\n\n for var_5, var_9 in enumerate(var_10):\n if (\n var_9[1] == -1\n or (var_9[1] == var_3 and var_9[0] <= var_7)\n or var_9[0] <= var_7 - 1\n ):\n del var_10[var_5]\n var_10.append((var_2[var_4][1], var_3))\n break\n else:\n return False\n return True\n\n\nvar_6, var_1 = list(map(int, input().split()))\nvar_2 = []\nfor var_4 in range(var_6):\n var_2.append(tuple(map(int, input().split())))\nvar_2.sort(key=lambda var_11: var_11[0])\nfor var_8 in range(1, 1024):\n if func_1():\n print(var_8)\n break\n", "slow_time": 15465425866, "fast_time": 67308564, "speedup": 229.7691, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_21"} -{"pair_id": "python_14566", "problem_id": "p00150", "language": "python", "slow_code": "var_4 = 10001\nvar_5 = int(var_4**0.5)\nvar_3 = [1] * var_4\nvar_6 = [0] * var_4\nvar_3[0] = 0\nvar_3[1::2] = [0 for var_7 in range(1, var_4, 2)]\nfor var_1 in range(2, var_4, 2):\n if var_3[var_1]:\n var_3[2 * var_1 + 1 :: var_1 + 1] = [\n 0 for var_7 in range(2 * var_1 + 1, var_4, var_1 + 1)\n ]\n if var_3[var_1 - 2]:\n var_6[var_1 : var_1 + 300] = [\n var_1 + 1 for var_7 in range(var_1, var_1 + 300)\n ]\nwhile True:\n var_2 = int(input())\n if var_2 == 0:\n break\n print(var_6[var_2 - 1] - 2, var_6[var_2 - 1])\n", "fast_code": "import bisect as bs\n\n\ndef func_1(var_5):\n var_1 = list(range(1, var_5 + 1, 2))\n var_1[0] = 2\n for var_4 in range(1, int(var_5**0.5) + 1):\n var_7 = var_1[var_4]\n if var_7:\n var_1[var_4 + var_7 :: var_7] = [0] * len(var_1[var_4 + var_7 :: var_7])\n return [_f for _f in var_1 if _f]\n\n\nvar_2 = func_1(10000)\nvar_7 = [\n var_2[var_4]\n for var_4 in range(1, len(var_2))\n if var_2[var_4] - var_2[var_4 - 1] == 2\n]\nwhile 1:\n var_6 = eval(input())\n if var_6 == 0:\n break\n var_3 = var_7[bs.bisect_right(var_7, var_6) - 1]\n print(var_3 - 2, var_3)\n", "slow_time": 1637634757, "fast_time": 128294719, "speedup": 12.7646, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_3"} -{"pair_id": "python_13356", "problem_id": "p03636", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_6():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_1 = func_5()\nprint((var_1[0] + str(len(var_1) - 2) + var_1[-1]))\n", "fast_code": "var_1, *var_2, var_3 = input()\nprint(var_1, len(var_2), var_3, sep=\"\")\n", "slow_time": 47248268, "fast_time": 9042859, "speedup": 5.2249, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_15"} -{"pair_id": "python_206", "problem_id": "p03240", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_6 = [list(map(int, input().split())) for var_10 in range(var_4)]\nvar_6.sort(key=lambda var_11: var_11[2], reverse=1)\nfor var_1 in range(101):\n for var_2 in range(101):\n var_3 = var_6[0][2] + abs(var_6[0][0] - var_1) + abs(var_6[0][1] - var_2)\n var_8 = 0\n for var_5, var_7, var_9 in var_6:\n if var_9 == max(var_3 - abs(var_5 - var_1) - abs(var_7 - var_2), 0):\n var_8 += 1\n if var_8 == var_4:\n print((var_1, var_2, var_3))\n break\n", "fast_code": "var_7 = int(input())\nvar_1 = []\nfor _ in range(var_7):\n var_9, var_10, var_4 = map(int, input().split())\n if var_4 != 0:\n var_1.append([var_9, var_10, var_4])\nvar_3 = False\nvar_2 = var_1[0]\nfor var_5 in range(101):\n for var_6 in range(101):\n var_8 = abs(var_1[0][0] - var_5) + abs(var_1[0][1] - var_6) + var_1[0][2]\n for var_9, var_10, var_4 in var_1[1:]:\n if abs(var_9 - var_5) + abs(var_10 - var_6) + var_4 != var_8:\n var_3 = False\n break\n else:\n var_3 = True\n if var_3:\n var_2 = [var_5, var_6, var_8]\n break\n if var_3:\n break\nprint(*var_2, sep=\" \")\n", "slow_time": 9772291562, "fast_time": 633486853, "speedup": 15.4262, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_26"} -{"pair_id": "python_6988", "problem_id": "p03713", "language": "python", "slow_code": "var_1, var_5 = list(map(int, input().split()))\nif var_1 % 3 == 0 or var_5 % 3 == 0:\n print((0))\nelse:\n var_6 = []\n for var_2 in range(1, var_5):\n var_4 = []\n var_4.append(\n [\n var_1 * var_2,\n var_1 * ((var_5 - var_2) // 2),\n var_1 * (var_5 - var_2) - var_1 * ((var_5 - var_2) // 2),\n ]\n )\n var_4.append(\n [\n var_1 * var_2,\n var_1 * ((var_5 - var_2) // 2 + 1),\n var_1 * (var_5 - var_2) - var_1 * ((var_5 - var_2) // 2 + 1),\n ]\n )\n var_4.append(\n [\n var_1 * var_2,\n (var_5 - var_2) * (var_1 // 2),\n var_1 * (var_5 - var_2) - (var_5 - var_2) * (var_1 // 2),\n ]\n )\n var_4.append(\n [\n var_1 * var_2,\n (var_5 - var_2) * (var_1 // 2 + 1),\n var_1 * (var_5 - var_2) - (var_5 - var_2) * (var_1 // 2 + 1),\n ]\n )\n for var_3 in var_4:\n var_6.append(max(var_3) - min(var_3))\n for var_2 in range(1, var_1):\n var_4 = []\n var_4.append(\n [\n var_5 * var_2,\n var_5 * ((var_1 - var_2) // 2),\n var_5 * (var_1 - var_2) - var_5 * ((var_1 - var_2) // 2),\n ]\n )\n var_4.append(\n [\n var_5 * var_2,\n var_5 * ((var_1 - var_2) // 2 + 1),\n var_5 * (var_1 - var_2) - var_5 * ((var_1 - var_2) // 2 + 1),\n ]\n )\n var_4.append(\n [\n var_5 * var_2,\n (var_1 - var_2) * (var_5 // 2),\n var_5 * (var_1 - var_2) - (var_1 - var_2) * (var_5 // 2),\n ]\n )\n var_4.append(\n [\n var_5 * var_2,\n (var_1 - var_2) * (var_5 // 2 + 1),\n var_5 * (var_1 - var_2) - (var_1 - var_2) * (var_5 // 2 + 1),\n ]\n )\n for var_3 in var_4:\n var_6.append(max(var_3) - min(var_3))\n print((min(var_6)))\n", "fast_code": "def func_1(var_1, var_4, var_5):\n global ans_list\n for var_8 in range(1, var_4):\n var_9 = var_1 // 2\n var_2 = [\n var_1 * var_8,\n (var_4 - var_8) * var_9,\n (var_4 - var_8) * (var_1 - var_9),\n ]\n var_6.append(max(var_2) - min(var_2))\n var_10 = (var_4 - var_8) // 2\n var_3 = [var_1 * var_8, var_1 * var_10, var_1 * (var_4 - var_8 - var_10)]\n var_6.append(max(var_3) - min(var_3))\n\n\nif __name__ == \"__main__\":\n var_1, var_4 = [int(var_7) for var_7 in input().split()]\n var_6 = []\n func_1(var_1, var_4, var_6)\n func_1(var_4, var_1, var_6)\n print((min(var_6)))\n", "slow_time": 214288553809, "fast_time": 52133236023, "speedup": 4.1104, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_1"} -{"pair_id": "python_16294", "problem_id": "p03721", "language": "python", "slow_code": "var_8, var_7 = list(map(int, input().split()))\nvar_3 = [0 for var_5 in range(100010)]\nfor var_5 in range(var_8):\n var_1, var_2 = list(map(int, input().split()))\n var_3[var_1] += var_2\nfor var_6, var_4 in enumerate(var_3):\n var_7 -= var_4\n if var_7 <= 0:\n print(var_6)\n break\n", "fast_code": "var_10, var_9 = list(map(int, input().split()))\nvar_3 = []\nfor var_7 in range(var_10):\n var_2, var_5 = list(map(int, input().split()))\n var_3.append([var_2, var_5])\nvar_3.sort(key=lambda var_11: var_11[0])\nvar_1, var_4 = [], []\nfor var_2, var_5 in var_3:\n var_1.append(var_2)\n var_4.append(var_5)\nfrom itertools import accumulate\n\nvar_6 = list(accumulate(var_4))\nvar_8 = -1\nfor var_7 in range(var_10):\n if var_7 == 0:\n if 0 <= var_9 <= var_6[var_7]:\n var_8 = var_7\n break\n continue\n if var_6[var_7 - 1] < var_9 <= var_6[var_7]:\n var_8 = var_7\n break\nprint((var_1[var_8]))\n", "slow_time": 1372992318, "fast_time": 55349935, "speedup": 24.8057, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_11"} -{"pair_id": "python_13810", "problem_id": "p02401", "language": "python", "slow_code": "import sys\nimport operator\nfrom math import floor\n\n\ndef func_2():\n var_2 = [var_1 for var_1 in sys.stdin.readline().split()]\n return var_2\n\n\ndef func_1():\n var_3 = {\n \"+\": operator.add,\n \"-\": operator.sub,\n \"*\": operator.mul,\n \"/\": operator.truediv,\n }\n\n while True:\n var_2 = func_2()\n if var_2[1] == \"?\":\n break\n elif var_2[1] == \"+\":\n print((var_3[var_2[1]](int(var_2[0]), int(var_2[2]))))\n elif var_2[1] == \"-\":\n print((var_3[var_2[1]](int(var_2[0]), int(var_2[2]))))\n elif var_2[1] == \"*\":\n print((var_3[var_2[1]](int(var_2[0]), int(var_2[2]))))\n elif var_2[1] == \"/\":\n print((floor(var_3[var_2[1]](int(var_2[0]), int(var_2[2])))))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "while 1:\n var_2 = input()\n var_1 = var_2.split()\n if var_1[1] == \"?\":\n break\n print(eval(var_2))\n", "slow_time": 73681624, "fast_time": 24064415, "speedup": 3.0618, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_19"} -{"pair_id": "python_5472", "problem_id": "p02951", "language": "python", "slow_code": "def func_1():\n var_1, var_2, var_3 = (int(var_5) for var_5 in input().split())\n var_4 = var_1 - var_2\n print((max(0, var_3 - var_4)))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "print((max(0, eval(\"-\" + input().replace(\" \", \"+\")))))\n", "slow_time": 21612627, "fast_time": 10452475, "speedup": 2.0677, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_0"} -{"pair_id": "python_6619", "problem_id": "p02770", "language": "python", "slow_code": "import sys, collections as cl, bisect as bs\n\nsys.setrecursionlimit(100000)\nvar_10 = sys.stdin.readline\nvar_15 = 10**9 + 7\nvar_1 = sys.maxsize\n\n\ndef func_6():\n return list(map(int, var_10().split()))\n\n\ndef func_10():\n return list(map(int, var_10().split()))\n\n\ndef func_12():\n return int(eval(var_10()))\n\n\ndef func_14(var_23):\n var_3 = []\n var_4 = var_23[0]\n var_22 = 1\n for var_9 in range(len(var_23) - 1):\n if var_4 != var_23[var_9 + 1]:\n var_3.append([var_4, var_22])\n var_4 = var_23[var_9 + 1]\n var_22 = 1\n else:\n var_22 += 1\n var_3.append([var_4, var_22])\n return var_3\n\n\ndef func_5(var_23):\n return \" \".join(map(str, var_23))\n\n\ndef func_11(var_23):\n return max(list(map(max, var_23)))\n\n\ndef func_1(var_23, var_3):\n var_13 = bs.bisect_left(var_3, var_23)\n if var_13 != len(var_3) and var_3[var_13] == var_23:\n return True\n else:\n return False\n\n\n\"\"\"\"\"\"\nvar_15 = 10**9 + 7\nvar_2 = 10**5 * 2\n\n\ndef func_2(var_16, var_21):\n if var_21 < 0 or var_21 > var_16:\n return 0\n var_21 = min(var_21, var_16 - var_21)\n return var_7[var_16] * var_8[var_21] * var_8[var_16 - var_21] % var_15\n\n\ndef func_13(var_16, var_21):\n if var_21 < 0 or var_21 > var_16:\n return 0\n return var_7[var_16] * var_8[var_16 - var_21] % var_15\n\n\nvar_7 = [1, 1]\nvar_8 = [1, 1]\nvar_11 = [0, 1]\nfor var_9 in range(2, var_2 + 1):\n var_7.append((var_7[-1] * var_9) % var_15)\n var_11.append((-var_11[var_15 % var_9] * (var_15 // var_9)) % var_15)\n var_8.append((var_8[-1] * var_11[-1]) % var_15)\n\nimport fractions\nfrom functools import reduce\n\n\ndef func_3(*var_17):\n return reduce(fractions.gcd, var_17)\n\n\ndef func_4(var_17):\n return reduce(fractions.gcd, var_17)\n\n\ndef func_8(var_23, var_24):\n return (var_23 * var_24) // fractions.gcd(var_23, var_24)\n\n\ndef func_7(*var_17):\n return reduce(func_8, var_17, 1)\n\n\ndef func_9(var_17):\n return reduce(func_8, var_17, 1)\n\n\nvar_13, var_20 = func_10()\nvar_6 = func_6()\nfor var_9 in range(var_20):\n var_16, var_23, var_14 = func_10()\n var_5 = 0\n var_18 = []\n for var_12 in range(var_13):\n var_18.append(var_6[var_12] % var_14 if var_6[var_12] % var_14 > 0 else var_14)\n \"\"\"\"\"\"\n var_19 = sum(var_18) * ((var_16 - 1) // var_13)\n var_19 += var_23\n for var_12 in range((var_16 - 1) % var_13):\n var_19 += var_18[var_12]\n var_5 += (var_19 // var_14) - (var_23 // var_14)\n print((var_16 - var_5 - 1))\n", "fast_code": "import numpy as np\n\nvar_3, var_6 = list(map(int, input().split()))\nvar_1 = np.array(list(map(int, input().split()))).astype(np.int64)\nvar_7 = [tuple(map(int, input().split())) for _ in range(var_6)]\nfor var_5, var_11, var_4 in var_7:\n var_2 = var_1 % var_4\n var_8, var_9 = divmod(var_5 - 1, var_3)\n var_10 = var_2[:var_9]\n print(\n (\n var_5\n - 1\n - (var_11 % var_4 + var_8 * np.sum(var_2) + np.sum(var_10)) // var_4\n - var_8 * np.count_nonzero(var_2 == 0)\n - np.count_nonzero(var_10 == 0)\n )\n )\n", "slow_time": 57561469129, "fast_time": 56145435, "speedup": 1025.2208, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_5"} -{"pair_id": "python_5319", "problem_id": "p03997", "language": "python", "slow_code": "from collections import deque\nfrom heapq import heapify, heappop, heappush, heappushpop\nfrom copy import copy, deepcopy\nfrom itertools import product, permutations, combinations, combinations_with_replacement\nfrom collections import defaultdict, Counter\nfrom bisect import bisect_left, bisect_right\n\n\nfrom functools import reduce\nfrom pprint import pprint\n\nvar_1 = float(\"inf\")\n\n\ndef func_3():\n return list(map(int, input().split()))\n\n\ndef func_4(var_13):\n return [list(func_3()) for _ in range(var_13)]\n\n\ndef func_1(var_7, var_6):\n return [var_16[var_6] for var_16 in var_7]\n\n\ndef func_8(var_7, var_6, var_15):\n var_7.sort(key=lambda var_18: var_18[var_6], reverse=var_15)\n return var_7\n\n\ndef func_5(var_7):\n var_2 = -1 * float(\"inf\")\n for var_9 in range(len(var_7)):\n var_12 = max(var_7[var_9])\n var_2 = max(var_2, var_12)\n return var_2\n\n\ndef func_6(var_7):\n var_12 = float(\"inf\")\n for var_9 in range(len(var_7)):\n var_2 = min(var_7[var_9])\n var_12 = min(var_12, var_2)\n return var_12\n\n\ndef func_2(var_11, var_18):\n\n var_10 = bisect_left(var_11, var_18)\n var_14 = bisect_right(var_11, var_18)\n return var_14 - var_10\n\n\ndef func_7(var_11, var_17=True):\n if var_17:\n if len(var_11) == 0:\n print(\" \")\n elif type(var_11[0]) == str:\n print((\" \".join(var_11)))\n elif type(var_11[0]) == int:\n print((\" \".join(map(str, var_11))))\n else:\n print(\"Output Error\")\n else:\n if len(var_11) == 0:\n print(\"\")\n elif type(var_11[0]) == str:\n print((\"\".join(var_11)))\n elif type(var_11[0]) == int:\n print((\"\".join(map(str, var_11))))\n else:\n print(\"Output Error\")\n\n\nvar_3 = int(eval(input()))\nvar_5 = int(eval(input()))\nvar_8 = int(eval(input()))\nvar_4 = (var_3 + var_5) * var_8 / 2\nprint((int(var_4)))\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = int(eval(input()))\nvar_3 = int(eval(input()))\nvar_4 = int((var_1 + var_2) * var_3 / 2)\nprint(var_4)\n", "slow_time": 157783046, "fast_time": 21435157, "speedup": 7.3609, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_3"} -{"pair_id": "python_2207", "problem_id": "p02989", "language": "python", "slow_code": "from collections import Counter\n\nvar_2 = int(eval(input()))\nvar_4 = Counter(list(map(int, input().split())))\nvar_3 = 0\nvar_5, var_6 = 0, var_2\nfor var_1 in range(10**5 + 1):\n if var_5 == var_6:\n var_3 += 1\n var_5 += var_4[var_1]\n var_6 -= var_4[var_1]\nprint(var_3)\n", "fast_code": "from bisect import bisect_left\n\nvar_1 = int(eval(input()))\nvar_3 = list(map(int, input().split()))\nvar_3.sort()\nvar_5 = var_1 // 2\nvar_2 = 0\nfor var_6 in range(var_3[0], var_3[-1] + 1):\n var_4 = bisect_left(var_3, var_6)\n\n if var_4 == var_5:\n var_2 += 1\nprint(var_2)\n", "slow_time": 22724424392, "fast_time": 4404972353, "speedup": 5.1588, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_23"} -{"pair_id": "python_8950", "problem_id": "p02641", "language": "python", "slow_code": "import sys\n\nvar_2, var_1 = list(map(int, input().split()))\nvar_6 = list(map(int, input().split()))\nvar_4 = 10000\nvar_5 = 10000\nfor var_3 in range(10000):\n if (5000 - var_3 in var_6) == False:\n if abs(var_2 - (5000 - var_3)) <= var_4:\n var_4 = abs(var_2 - (5000 - var_3))\n var_5 = 5000 - var_3\nprint(var_5)\n", "fast_code": "var_2, var_1 = list(map(int, input().split(\" \")))\nif var_1 == 0:\n print(var_2)\nelse:\n var_5 = list(map(int, input().split(\" \")))\n var_3, var_6 = -1, 0\n for var_4 in range(101, -1, -1):\n if var_4 not in var_5:\n if var_3 == -1:\n var_3 = abs(var_2 - var_4)\n var_6 = var_4\n else:\n var_3 = min(var_3, abs(var_2 - var_4))\n if var_3 == abs(var_2 - var_4):\n var_6 = var_4\n print(var_6)\n", "slow_time": 1753973423, "fast_time": 53096639, "speedup": 33.0336, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_14"} -{"pair_id": "python_7506", "problem_id": "p03835", "language": "python", "slow_code": "var_4, var_5 = list(map(int, input().split()))\nvar_1 = 0\nfor var_2 in range(var_4 + 1):\n for var_3 in range(var_4 + 1):\n if var_5 >= var_2 + var_3 >= var_5 - var_4:\n var_1 += 1\nprint(var_1)\n", "fast_code": "var_2, var_6 = list(map(int, input().split()))\nvar_1 = 0\nvar_4 = max(var_6 - 2 * var_2, 0)\nvar_3 = min(var_6, var_2)\nfor var_7 in range(var_4, var_3 + 1):\n var_5 = var_6 - var_7\n if var_2 >= var_5:\n var_1 += var_5 + 1\n else:\n var_1 += 2 * var_2 - var_5 + 1\nprint(var_1)\n", "slow_time": 301802361, "fast_time": 26629185, "speedup": 11.3335, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_18"} -{"pair_id": "python_233", "problem_id": "p03061", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools\nimport random\n\nsys.setrecursionlimit(10**7)\nvar_9 = 10**20\nvar_7 = 1.0 / 10**10\nvar_13 = 10**9 + 7\nvar_5 = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nvar_6 = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef func_4():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_5():\n return [int(var_21) - 1 for var_21 in sys.stdin.readline().split()]\n\n\ndef func_3():\n return [float(var_21) for var_21 in sys.stdin.readline().split()]\n\n\ndef func_6():\n return sys.stdin.readline().split()\n\n\ndef func_2():\n return int(sys.stdin.readline())\n\n\ndef func_1():\n return float(sys.stdin.readline())\n\n\ndef func_7():\n return input()\n\n\ndef func_11(var_18):\n return print(var_18, flush=True)\n\n\nclass Class_1:\n def __init__(self, var_14):\n self.M = var_12 = int(math.sqrt(var_14)) + 10\n self.A = var_1 = [True] * var_12\n var_1[0] = var_1[1] = False\n self.T = var_19 = []\n for var_8 in range(2, int(math.sqrt(var_12)) + 1):\n if not var_1[var_8]:\n continue\n var_19.append(var_8)\n for var_10 in range(var_8 * var_8, var_12, var_8):\n var_1[var_10] = False\n\n def func_9(self, var_14):\n return self.A[var_14]\n\n def func_8(self, var_14):\n var_4 = collections.defaultdict(int)\n for var_3 in self.T:\n while var_14 % var_3 == 0:\n var_4[var_3] += 1\n var_14 //= var_3\n if var_14 < 2:\n break\n if var_14 > 1:\n var_4[var_14] += 1\n return var_4.items()\n\n def func_12(self, var_14):\n var_17 = 1\n for var_11, var_20 in self.division(var_14):\n var_19 = 1\n for var_8 in range(1, var_20 + 1):\n var_19 += math.pow(var_11, var_8)\n var_17 *= var_19\n return var_17\n\n\ndef func_10():\n var_14 = func_2()\n var_1 = sorted(func_4())\n var_16 = Class_1(10**9)\n var_15 = collections.defaultdict(int)\n for var_2 in var_1:\n var_17 = [1]\n for var_11, var_20 in var_16.division(var_2):\n for var_3 in var_17[:]:\n for var_8 in range(1, var_20 + 1):\n var_17.append(var_3 * (var_11**var_8))\n for var_11 in var_17:\n var_15[var_11] += 1\n var_17 = 1\n for var_11, var_20 in var_15.items():\n if var_20 >= var_14 - 1 and var_17 < var_11:\n var_17 = var_11\n return var_17\n\n\nprint(func_10())\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_1.sort()\nvar_6 = var_1[1]\nfor var_5 in range(var_6, 0, -1):\n var_4 = 0\n for var_3 in var_1:\n if var_3 % var_5 != 0:\n var_4 += 1\n if var_4 > 1:\n break\n if var_4 < 2:\n print(var_5)\n break\n", "slow_time": 1034266124, "fast_time": 29880947, "speedup": 34.6129, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_1"} -{"pair_id": "python_17865", "problem_id": "p02628", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = list(map(int, input().split()))\n\n\ndef func_1(var_6):\n for var_5 in range(len(var_6) - 1, 0, -1):\n for var_7 in range(var_5):\n if var_6[var_7] > var_6[var_7 + 1]:\n var_9 = var_6[var_7 + 1]\n var_6[var_7 + 1] = var_6[var_7]\n var_6[var_7] = var_9\n return var_6\n\n\nfunc_1(var_3)\nvar_8 = 0\nfor var_4 in range(var_1):\n var_8 = var_8 + var_3[var_4]\nprint(var_8)\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = sorted(map(int, input().split()))\nprint((sum(var_3[0:var_1])))\n", "slow_time": 41282946, "fast_time": 15650862, "speedup": 2.6377, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_4"} -{"pair_id": "python_16923", "problem_id": "p02804", "language": "python", "slow_code": "var_2 = 10**9 + 7\nvar_1 = 100001\nvar_9 = [0] + [1]\nvar_7 = [1] + [1]\nvar_6 = [1] + [1]\nfor var_8 in range(2, var_1):\n var_9 += [var_9[var_2 % var_8] * (var_2 - int(var_2 / var_8)) % var_2]\n var_6 += [(var_6[var_8 - 1] * var_8) % var_2]\n var_7 += [(var_7[var_8 - 1] * var_9[var_8]) % var_2]\n\n\ndef func_1(var_3, var_5):\n if var_3 < var_5:\n return -1\n return (var_6[var_3] * ((var_7[var_5] * var_7[var_3 - var_5]) % var_2)) % var_2\n\n\nvar_11, var_10 = list(map(int, input().split()))\nvar_3 = list(map(int, input().split()))\nvar_3 = sorted(var_3, key=lambda var_13: var_13, reverse=False)\nvar_4 = 0\n\nfor var_8 in range(len(var_3)):\n var_12 = func_1(var_11 - 1 - var_8, var_10 - 1)\n if var_12 < 0:\n continue\n if var_3[var_8] < 0:\n var_4 = (var_4 + (abs(var_3[var_8]) * var_12) % var_2) % var_2\n else:\n var_4 = (var_4 - (abs(var_3[var_8]) * var_12) % var_2 + var_2) % var_2\n\nfor var_8 in range(len(var_3)):\n var_12 = func_1(var_11 - 1 - var_8, var_10 - 1)\n if var_12 < 0:\n continue\n if var_3[var_11 - 1 - var_8] < 0:\n var_4 = (\n var_4 - (abs(var_3[var_11 - 1 - var_8]) * var_12) % var_2 + var_2\n ) % var_2\n else:\n var_4 = (var_4 + (abs(var_3[var_11 - 1 - var_8]) * var_12) % var_2) % var_2\nprint(var_4)\n", "fast_code": "class Class_1:\n \"\"\"\"\"\"\n\n def __init__(self, var_6, var_5=10**9 + 7):\n self.MOD = var_5\n self.fact, self.inv = self._make_factorial_list(var_6)\n\n def __call__(self, var_14, var_12):\n if var_12 < 0 or var_12 > var_14 or var_14 <= 0:\n return 0\n var_15 = self.fact[var_14] * self.inv[var_12] % self.MOD\n var_15 = var_15 * self.inv[var_14 - var_12] % self.MOD\n return var_15\n\n def _make_factorial_list(self, var_6):\n var_9 = [1] * (var_6 + 1)\n var_11 = [1] * (var_6 + 1)\n var_5 = self.MOD\n for var_10 in range(1, var_6 + 1):\n var_9[var_10] = (var_9[var_10 - 1] * var_10) % var_5\n var_11[var_6] = pow(var_9[var_6], var_5 - 2, var_5)\n for var_10 in range(var_6, 0, -1):\n var_11[var_10 - 1] = (var_11[var_10] * var_10) % var_5\n return var_9, var_11\n\n\nif __name__ == \"__main__\":\n var_6, var_4 = list(map(int, input().split()))\n var_1 = list(map(int, input().split()))\n var_13 = 10**9 + 7\n var_8 = Class_1(var_6, var_13)\n var_7 = 0\n var_1.sort()\n for var_10 in range(var_6 - var_4 + 1):\n var_2 = var_1[-var_10 - 1]\n var_3 = var_1[var_10]\n var_7 += (var_2 - var_3) * var_8(var_6 - var_10 - 1, var_4 - 1)\n var_7 %= var_13\n print(var_7)\n", "slow_time": 44280687267, "fast_time": 98115412, "speedup": 451.3122, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_5"} -{"pair_id": "python_9268", "problem_id": "p02558", "language": "python", "slow_code": "from networkx.utils import UnionFind\n\nvar_1, var_2 = list(map(int, input().split()))\nvar_6 = UnionFind()\nfor var_3 in range(var_2):\n var_4, var_5, var_7 = list(map(int, input().split()))\n if var_4:\n print((1 if var_6[var_5] == var_6[var_7] else 0))\n else:\n var_6.union(var_5, var_7)\n", "fast_code": "class Class_1:\n __slots__ = [\"N\", \"root\", \"rank\"]\n\n def __init__(self, var_1):\n \"\"\"\"\"\"\n self.N = var_1\n self.root = [-1] * var_1\n\n def __repr__(self):\n return \"\\n\".join(\n \"{}: {}\".format(var_6, self.members(var_6)) for var_6 in self.roots()\n )\n\n def func_3(self, var_12):\n \"\"\"\"\"\"\n while self.root[var_12] >= 0:\n var_12 = self.root[var_12]\n return var_12\n\n def func_8(self, var_12, var_13):\n \"\"\"\"\"\"\n\n var_12 = self.find(var_12)\n var_13 = self.find(var_13)\n if var_12 == var_13:\n return\n elif self.root[var_13] < self.root[var_12]:\n var_12, var_13 = var_13, var_12\n self.root[var_12] += self.root[var_13]\n self.root[var_13] = var_12\n\n def func_7(self, var_12, var_13):\n \"\"\"\"\"\"\n return self.find(var_12) == self.find(var_13)\n\n def func_2(self, var_12):\n \"\"\"\"\"\"\n return -self.root[self.find(var_12)]\n\n def func_5(self, var_12):\n \"\"\"\"\"\"\n _root = self.find(var_12)\n return [var_2 for var_2 in range(self.N) if self.find == _root]\n\n def func_6(self):\n \"\"\"\"\"\"\n return [var_2 for var_2, var_12 in enumerate(self.root) if var_12 < 0]\n\n def func_4(self):\n \"\"\"\"\"\"\n return len(self.roots())\n\n def func_1(self):\n \"\"\"\"\"\"\n return {var_6: self.members(var_6) for var_6 in self.roots()}\n\n\nimport sys\n\nvar_3 = sys.stdin.readline\nvar_4, var_5 = list(map(int, var_3().split()))\nvar_10 = Class_1(var_4)\nvar_7 = []\nfor var_2 in range(var_5):\n var_8, var_9, var_11 = list(map(int, var_3().split()))\n if var_8:\n var_7.append(int(var_10.same(var_9, var_11)))\n else:\n var_10.union(var_9, var_11)\nprint((\"\\n\".join(map(str, var_7))))\n", "slow_time": 18058265902, "fast_time": 151800405, "speedup": 118.9606, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_17"} -{"pair_id": "python_3552", "problem_id": "p03077", "language": "python", "slow_code": "import math\n\nvar_7 = int(eval(input()))\nvar_1 = int(eval(input()))\nvar_2 = int(eval(input()))\nvar_3 = int(eval(input()))\nvar_4 = int(eval(input()))\nvar_5 = int(eval(input()))\nvar_6 = min(var_1, min(var_2, min(var_3, min(var_4, var_5))))\nvar_8 = math.ceil(var_7 / var_6)\nwhile var_8 * var_6 < var_7:\n var_8 += 1\nprint((5 + var_8 - 1))\n", "fast_code": "var_2, *var_1 = eval(\"int(input()),\" * 6)\nprint((4 - -var_2 // min(var_1)))\n", "slow_time": 46839472, "fast_time": 20357921, "speedup": 2.3008, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_24"} -{"pair_id": "python_5687", "problem_id": "p03039", "language": "python", "slow_code": "var_3 = 2 * 10**5 + 100\nvar_4 = 10**9 + 7\nvar_8 = [0] * var_3\nvar_11 = [0] * var_3\nvar_9 = [0] * var_3\nvar_8[0] = 1\nvar_8[1] = 1\nvar_9[0] = 1\nvar_9[1] = 1\nvar_11[1] = 1\nfor var_10 in range(2, var_3):\n var_8[var_10] = var_8[var_10 - 1] * var_10 % var_4\n var_11[var_10] = var_4 - var_11[var_4 % var_10] * (var_4 // var_10) % var_4\n var_9[var_10] = var_9[var_10 - 1] * var_11[var_10] % var_4\n\n\ndef func_1(var_12, var_13):\n if var_12 < var_13:\n return 0\n if var_12 < 0 or var_13 < 0:\n return 0\n return var_8[var_12] * (var_9[var_13] * var_9[var_12 - var_13] % var_4) % var_4\n\n\nvar_5, var_2, var_1 = list(map(int, input().split()))\nvar_6 = 0\nfor var_7 in range(1, var_5):\n var_6 += var_7 * (var_5 - var_7) * var_2**2\n var_6 %= var_4\nfor var_7 in range(1, var_2):\n var_6 += var_7 * (var_2 - var_7) * var_5**2\n var_6 %= var_4\nvar_6 *= func_1(var_5 * var_2 - 2, var_1 - 2)\nvar_6 %= var_4\nprint(var_6)\n", "fast_code": "def func_1(var_13, var_10):\n var_15, var_16 = 1, 1\n var_10 = min(var_10, var_13 - var_10)\n for var_8 in range(var_10):\n var_15 *= var_13 - var_8\n var_15 %= var_3\n var_16 *= var_8 + 1\n var_16 %= var_3\n return var_15 * pow(var_16, var_3 - 2, var_3) % var_3\n\n\ndef func_2(var_5):\n var_7 = var_3\n var_15, var_11 = (0, 1)\n var_16, var_12 = (1, 0)\n while var_7 != 0:\n var_14 = var_5 // var_7\n var_5, var_7 = (var_7, var_5 % var_7)\n var_15, var_11 = (var_11 - var_14 * var_15, var_15)\n var_16, var_12 = (var_12 - var_14 * var_16, var_16)\n return var_11 % var_3\n\n\nvar_3 = 10**9 + 7\nvar_4, var_2, var_1 = list(map(int, input().split()))\nvar_15 = 0\nfor var_8 in range(1, var_4):\n var_15 = var_15 + var_8 * (var_4 - var_8)\nvar_15 = (var_15 * var_2 * var_2) % var_3\nvar_16 = 0\nfor var_9 in range(1, var_2):\n var_16 = var_16 + var_9 * (var_2 - var_9)\nvar_16 = (var_16 * var_4 * var_4) % var_3\nvar_6 = func_1(var_4 * var_2 - 2, var_1 - 2) * (var_15 + var_16) % var_3\nprint(var_6)\n", "slow_time": 56558753131, "fast_time": 156817854, "speedup": 360.6653, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_24"} -{"pair_id": "python_7277", "problem_id": "p02881", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_1 = [1, var_4]\nfor var_2 in range(1, int(var_4**0.5) + 1):\n var_3 = var_4 // var_2\n if var_4 % var_2 == 0 and var_1[0] + var_1[1] > var_2 + var_3:\n var_1 = [var_2, var_3]\nprint((var_1[0] - 1 + var_1[1] - 1))\n", "fast_code": "var_2 = int(eval(input()))\nprint(\n (\n min(\n var_1 + (var_2 // var_1) - 2\n for var_1 in range(1, int(var_2**0.5) + 1)\n if var_2 % var_1 == 0\n )\n )\n)\n", "slow_time": 606509772, "fast_time": 191385250, "speedup": 3.1691, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_6"} -{"pair_id": "python_17493", "problem_id": "p02615", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(1 << 25)\nvar_15 = sys.stdin.readline\nvar_14 = range\nvar_11 = enumerate\n\n\ndef func_2(*var_8, **var_13):\n print(*var_8, **var_13)\n sys.exit()\n\n\ndef func_5(*var_8, var_17=1):\n return list(map(lambda var_18: var_18 - var_17, var_8))\n\n\n \ndef func_1():\n return int(var_15())\n\n\ndef func_3():\n return list(map(int, var_15().split()))\n\n\ndef func_6(var_2):\n\\\n\\\n \n var_16 = []\n for _ in range(var_2):\n var_16.append(list(map(int, var_15().split())))\n return tuple(map(list, zip(*var_16)))\n\n\ndef func_8(var_2):\n \n var_16 = []\n for _ in range(var_2):\n var_16.append(tuple(map(int, var_15().split())))\n return var_16\n\n\ndef func_7(var_2):\n \n var_16 = []\n for _ in range(var_2):\n var_16.append(list(map(int, var_15().split())))\n return var_16\n \n\n\nvar_4 = 10**9 + 7\nvar_3 = 2**31 \n \nfrom collections import defaultdict, Counter, deque\nfrom operator import itemgetter, xor, add\nfrom itertools import product, permutations, combinations\nfrom bisect import bisect_left, bisect_right \nfrom functools import reduce\nfrom math import gcd\n\n\ndef func_4(var_6, var_9):\n \n var_12 = gcd(var_6, var_9)\n return var_6 // var_12 * var_9\n\n\n \n \nvar_5 = func_1()\nvar_1 = func_3()\nvar_1.sort(reverse=True)\nvar_7 = var_1[0]\nvar_10 = 1\nfor var_6 in var_1[1:]:\n if var_10 == var_5 - 1:\n break\n var_7 += var_6\n var_10 += 1\n if var_10 == var_5 - 1:\n break\n var_7 += var_6\n var_10 += 1\nprint(var_7)\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_1.sort(reverse=True)\n \nvar_3 = var_1[0]\nfor var_4 in range(2, var_2):\n var_3 += var_1[var_4 // 2]\nprint(var_3)\n", "slow_time": 122798898, "fast_time": 22740635, "speedup": 5.4, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_17"} -{"pair_id": "python_2893", "problem_id": "p02559", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom fractions import Fraction\nfrom functools import lru_cache, reduce\nfrom itertools import (\n combinations,\n combinations_with_replacement,\n product,\n permutations,\n accumulate,\n)\nfrom operator import add, mul, sub, itemgetter, attrgetter\nimport sys\n\nvar_19 = sys.stdin.readline\nvar_2 = 2**62 - 1\n\n\ndef func_7():\n return int(var_19())\n\n\ndef func_8():\n return list(map(int, var_19().split()))\n\n\ndef func_5():\n return float(var_19())\n\n\ndef func_6():\n return list(map(float, var_19().split()))\n\n\ndef func_9():\n return var_19().strip()\n\n\ndef func_10():\n return var_19().strip().split()\n\n\ndef func_1(*var_6):\n print(*var_6, file=sys.stderr)\n\n\ndef func_3(var_9):\n import time\n\n def func_13(*var_6, **var_13):\n var_21 = time.perf_counter()\n var_20 = var_9(*var_6, **var_13)\n var_8 = time.perf_counter()\n func_1(var_8 - var_21, \"sec\")\n return var_20\n\n return func_13\n\n\nclass Class_1:\n def __init__(self, var_7, var_15, var_11):\n _len = len(var_7)\n self.__op = var_15\n self.__size = 1 << (_len - 1).bit_length()\n self.__tree = [var_11] * self.__size + var_7 + [var_11] * (self.__size - _len)\n self.__ie = var_11\n for var_10 in range(self.__size - 1, 0, -1):\n self.__tree[var_10] = var_15(\n self.__tree[var_10 * 2], self.__tree[var_10 * 2 + 1]\n )\n\n def func_12(self, var_10, var_23):\n var_10 += self.__size\n self.__tree[var_10] = var_23\n while var_10:\n var_10 //= 2\n self.__tree[var_10] = self.__op(\n self.__tree[var_10 * 2], self.__tree[var_10 * 2 + 1]\n )\n\n def func_4(self, var_14, var_18):\n \"\"\"\"\"\"\n var_14 += self.__size\n var_18 += self.__size\n var_20 = self.__ie\n while var_14 < var_18:\n if var_14 & 1:\n var_20 = self.__op(var_20, self.__tree[var_14])\n var_14 += 1\n if var_18 & 1:\n var_18 -= 1\n var_20 = self.__op(var_20, self.__tree[var_18])\n var_14 //= 2\n var_18 //= 2\n return var_20\n\n def __getitem__(self, var_12):\n return self.__tree[var_12 + self.__size]\n\n\n@func_3\ndef func_11(var_3, var_1, var_4):\n var_22 = Class_1(var_1, add, 0)\n var_5 = []\n for var_17 in var_4:\n if var_17[0] == 0:\n _, var_16, var_24 = var_17\n var_22.update(var_16, var_22[var_16] + var_24)\n else:\n _, var_14, var_18 = var_17\n var_5.append(var_22.query(var_14, var_18))\n return var_5\n\n\ndef func_2():\n var_3, var_4 = func_8()\n var_1 = func_8()\n var_4 = [func_8() for _ in range(var_4)]\n print(*func_11(var_3, var_1, var_4), sep=\"\\n\")\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "def func_3():\n def func_1(var_3, var_11):\n while var_3 <= var_5:\n var_2[var_3] += var_11\n var_3 += var_3 & -var_3\n\n def func_2(var_3):\n var_8 = 0\n while var_3:\n var_8 += var_2[var_3]\n var_3 -= var_3 & -var_3\n return var_8\n\n (var_5, var_6, *var_10), var_1, *var_9 = [\n list(map(int, var_9.split())) for var_9 in open(0)\n ]\n var_2 = [0] * -~var_5\n *list(map(func_1, list(range(1, var_5 + 1)), var_1)),\n for var_6, var_4, var_7 in var_9:\n if var_6:\n var_10 += (func_2(var_7) - func_2(var_4),)\n else:\n func_1(var_4 + 1, var_7)\n print((\" \".join(map(str, var_10))))\n\n\nfunc_3()\n", "slow_time": 205458585, "fast_time": 69937380, "speedup": 2.9378, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_26"} -{"pair_id": "python_349", "problem_id": "p03164", "language": "python", "slow_code": "def func_1():\n import sys, copy\n\n var_2, var_3 = list(map(int, sys.stdin.readline().split()))\n var_1 = tuple([tuple(map(int, sys.stdin.readline().split())) for _ in range(var_2)])\n\n var_5 = [[10**11 + 1 for _ in range(10**5 + 1)] for _ in range(var_2)]\n var_5[0][var_1[0][1]] = var_1[0][0]\n\n for var_6 in range(1, var_2):\n\n var_5[var_6] = copy.copy(var_5[var_6 - 1])\n var_10, var_8 = var_1[var_6][0], var_1[var_6][1]\n\n var_5[var_6][var_8] = min(var_10, var_5[var_6][var_8])\n\n for var_7 in range(10**5 + 1 - var_8):\n if var_5[var_6 - 1][var_7] != 0:\n var_5[var_6][var_8 + var_7] = min(\n var_5[var_6][var_8 + var_7], var_10 + var_5[var_6 - 1][var_7]\n )\n var_4 = 0\n for var_9, var_11 in enumerate(var_5[-1]):\n if var_11 <= var_3:\n if var_4 < var_9:\n var_4 = var_9\n\n print(var_4)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "\"\"\"\"\"\"\n\nvar_1 = 2000000000\nvar_8, var_3 = list(map(int, input().split()))\nvar_10 = [0] * var_8\nvar_9 = [0] * var_8\nfor var_6 in range(var_8):\n var_10[var_6], var_9[var_6] = list(map(int, input().split()))\nvar_2 = sum(var_9)\nvar_5 = [[var_1 for var_6 in range(var_2 + 1)] for var_7 in range(var_8 + 1)]\n\nvar_5[0][0] = 0\nfor var_6 in range(var_8):\n for var_7 in range(var_2 + 1):\n if var_7 < var_9[var_6]:\n var_5[var_6 + 1][var_7] = var_5[var_6][var_7]\n else:\n var_5[var_6 + 1][var_7] = min(\n var_5[var_6][var_7], var_5[var_6][var_7 - var_9[var_6]] + var_10[var_6]\n )\nvar_4 = 0\nfor var_6 in range(var_2 + 1):\n if var_5[var_8][var_6] <= var_3:\n var_4 = var_6\nprint(var_4)\n", "slow_time": 34612782525, "fast_time": 109898705, "speedup": 314.9517, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_24"} -{"pair_id": "python_13853", "problem_id": "p02929", "language": "python", "slow_code": "import sys\nfrom collections import defaultdict, deque, Counter\nimport math\n\n\nfrom bisect import bisect_left, bisect_right\nimport heapq\n\nvar_12 = sys.stdin.readline\nvar_9 = lambda: var_12().strip()\nvar_8 = lambda: int(eval(var_12()))\nvar_7 = lambda: list(map(int, var_12().split()))\nvar_10 = lambda: [int(var_17) - 1 for var_17 in var_12().split()]\nvar_1 = 10**20\nvar_2 = 10**9 + 7\nvar_6 = lambda var_17: pow(var_17, var_2 - 2, var_2)\n\n\ndef func_3(var_14, var_13, func_1):\n return (func_4(var_14, var_13, func_1) * var_6(func_1[var_13])) % var_2\n\n\ndef func_4(var_14, var_13, func_1):\n if var_13 == 0 or var_13 == var_14:\n return var_14 % var_2\n return (func_1[var_14] * var_6(func_1[var_14 - var_13])) % var_2\n\n\ndef func_1(var_14):\n var_15 = [1]\n for var_11 in range(1, var_14 + 1):\n var_15.append((var_15[-1] * var_11) % var_2)\n return var_15\n\n\ndef func_5():\n var_14 = var_8()\n var_3 = var_9()\n var_16 = 0\n var_4 = 1\n for var_5 in var_3:\n if var_5 == \"W\":\n if var_16 == 0:\n print((0))\n return\n if var_16 % 2 == 0:\n var_4 *= var_16\n var_4 %= var_2\n var_16 -= 1\n else:\n var_16 += 1\n else:\n if var_16 % 2 == 1:\n var_4 *= var_16\n var_4 %= var_2\n var_16 -= 1\n else:\n var_16 += 1\n\n if var_16 == 0:\n print(((var_4 * func_1(var_14)[-1]) % var_2))\n else:\n print((0))\n\n\ndef func_2():\n var_14 = var_8()\n for _ in range(var_14):\n func_5()\n\n\nif __name__ == \"__main__\":\n\n func_5()\n", "fast_code": "var_6, var_8 = open(0)\nvar_6 = int(var_6)\nvar_1 = var_5 = var_8[0] < \"W\" > var_8[-2]\nvar_7 = var_4 = 0\nfor var_2, var_3 in zip(var_8, var_8[1:-1]):\n var_4 ^= var_2 == var_3\n var_1 = var_1 * (max(1, var_6)) * (var_5 - var_7) ** var_4 % (10**9 + 7)\n var_6 -= 1\n var_7 += var_4\n var_5 += var_4 ^ 1\nprint((var_1 * (var_5 == var_7)))\n", "slow_time": 124307619, "fast_time": 40082015, "speedup": 3.1013, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_6"} -{"pair_id": "python_6211", "problem_id": "p00040", "language": "python", "slow_code": "var_6 = [\n \"a\",\n \"b\",\n \"c\",\n \"d\",\n \"e\",\n \"f\",\n \"g\",\n \"h\",\n \"i\",\n \"j\",\n \"k\",\n \"l\",\n \"m\",\n \"n\",\n \"o\",\n \"p\",\n \"q\",\n \"r\",\n \"s\",\n \"t\",\n \"u\",\n \"v\",\n \"w\",\n \"x\",\n \"y\",\n \"z\",\n]\nvar_10 = [1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25]\n\n\ndef func_1(var_1, var_2, var_4):\n var_11 = \"\"\n for var_3 in var_4:\n if var_3 != \" \":\n var_7 = var_6.index(var_3)\n for var_9 in range(26):\n if (var_1 * var_9 + var_2) % 26 == var_7:\n var_5 = var_6[var_9]\n break\n var_11 += var_5\n else:\n var_11 += \" \"\n return var_11\n\n\nvar_12 = int(input())\nfor var_13 in range(var_12):\n var_4 = input()\n for var_1 in var_10:\n var_8 = 0\n for var_2 in range(26):\n var_11 = func_1(var_1, var_2, var_4)\n if var_11.count(\"that\") > 0 or var_11.count(\"this\") > 0:\n var_8 = 1\n break\n if var_8 == 1:\n break\n print(var_11)\n", "fast_code": "var_1 = \"abcdefghijklmnopqrstuvwxyz\"\n\n\ndef func_1(var_8, var_3, var_4):\n var_10 = \"\"\n for var_5 in var_8:\n var_10 += (\n var_1[(var_1.index(var_5) * var_3 + var_4) % 26]\n if \"a\" <= var_5 <= \"z\"\n else var_5\n )\n return var_10\n\n\ndef func_3(var_8, var_3):\n var_3 = var_3 % 26\n var_2 = var_1[var_3:] + var_1[:var_3]\n var_10 = \"\"\n for var_5 in var_8:\n var_10 += var_2[var_1.index(var_5)] if \"a\" <= var_5 <= \"z\" else var_5\n return var_10\n\n\ndef func_2(var_10):\n var_6 = \"t\"\n for var_7 in range(26):\n var_3 = 0\n var_12 = func_1(var_10, var_7, 0)\n var_5 = var_1.index(var_12[0])\n if var_5 != 19:\n var_3 = (19 - var_5) % 26\n var_12 = func_3(var_12, var_3)\n if var_12 in [\"this\", \"that\"]:\n return var_7, var_3\n return -1, -1\n\n\nvar_9 = eval(input())\nwhile var_9:\n var_9 -= 1\n var_10 = input()\n for var_11 in var_10.split():\n if len(var_11) == 4:\n var_3, var_4 = func_2(var_11)\n if var_3 != -1:\n break\n print(func_1(var_10, var_3, var_4))\n", "slow_time": 2828867283, "fast_time": 96575987, "speedup": 29.2916, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_1"} -{"pair_id": "python_6586", "problem_id": "p02364", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys\nfrom operator import attrgetter\n\n\nclass Class_1(object):\n __slots__ = (\"source\", \"target\", \"weight\")\n\n def __init__(self):\n self.weight = float(\"inf\")\n self.source, self.target = None, None\n\n\nclass Class_2(object):\n __slots__ = (\"size\", \"tree_height_rank_list\", \"ancestor_list\")\n\n def __init__(self, var_8):\n self.size = int(var_8)\n self.tree_height_rank_list = [0] * self.size\n self.ancestor_list = [var_5 for var_5 in range(self.size)]\n\n def _find(self, var_17):\n if var_17 != self.ancestor_list[var_17]:\n self.ancestor_list[var_17] = self._find(self.ancestor_list[var_17])\n return self.ancestor_list[var_17]\n\n def func_3(self, var_17, var_18):\n return self._find(var_17) == self._find(var_18)\n\n def _link(self, var_17, var_18):\n if self.tree_height_rank_list[var_17] > self.tree_height_rank_list[var_18]:\n self.ancestor_list[var_18] = var_17\n else:\n self.ancestor_list[var_17] = var_18\n if self.tree_height_rank_list[var_17] == self.tree_height_rank_list[var_18]:\n self.tree_height_rank_list[var_18] += 1\n\n def func_4(self, var_17, var_18):\n self._link(self._find(var_17), self._find(var_18))\n\n\ndef func_1(var_14):\n for var_6, var_1 in enumerate(var_14):\n var_9, var_10, var_16 = list(map(int, var_1))\n var_7[var_6].source = var_9\n var_7[var_6].target = var_10\n var_7[var_6].weight = var_16\n return var_7\n\n\ndef func_2():\n var_11 = 0\n var_3.sort(key=attrgetter(\"weight\"))\n\n var_12 = Class_2(size=var_15 + 1)\n for var_2 in var_3:\n if not var_12.same(var_2.source, var_2.target):\n var_11 += var_2.weight\n var_12.union(var_2.source, var_2.target)\n return var_11\n\n\nif __name__ == \"__main__\":\n _input = sys.stdin.readlines()\n var_15, var_4 = list(map(int, _input[0].split()))\n var_13 = [var_17.split() for var_17 in _input[1:]]\n var_7 = [Class_1() for _ in range(var_4)]\n var_3 = func_1(var_13)\n print((func_2()))\n", "fast_code": "import heapq\nfrom collections import defaultdict\n\nvar_3 = float(\"inf\")\nvar_4, var_2 = list(map(int, input().split()))\nvar_1 = defaultdict(set)\nfor var_8 in range(var_2):\n var_10, var_11, var_14 = list(map(int, input().split()))\n var_1[var_10].add((var_11, var_14))\n var_1[var_11].add((var_10, var_14))\n\n\ndef func_1(var_15):\n var_6 = [var_3] * var_15\n var_6[0] = 0\n var_9 = [False] * var_15\n var_7 = [(0, 0)]\n while var_7:\n var_12 = heapq.heappop(var_7)[1]\n var_9[var_12] = True\n for var_13, var_5 in var_1[var_12]:\n if not var_9[var_13] and var_6[var_13] > var_5:\n var_6[var_13] = var_5\n heapq.heappush(var_7, (var_5, var_13))\n return sum(var_6)\n\n\nprint((func_1(var_4)))\n", "slow_time": 114703884, "fast_time": 47581029, "speedup": 2.4107, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_5"} -{"pair_id": "python_5935", "problem_id": "p03693", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_3():\n return [int(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return [list(var_8) for var_8 in sys.stdin.readline().split()]\n\n\ndef func_7():\n return list(sys.stdin.readline())[:-1]\n\n\ndef func_2(var_6):\n return [func_1() for var_4 in range(var_6)]\n\n\ndef func_4(var_6):\n return [func_3() for var_4 in range(var_6)]\n\n\ndef func_8(var_6):\n return [func_7() for var_4 in range(var_6)]\n\n\ndef func_6(var_6):\n return [func_5() for var_4 in range(var_6)]\n\n\nsys.setrecursionlimit(1000000)\nvar_5 = 1000000007\n\n\ndef func_9():\n var_7, var_3, var_2 = func_3()\n var_1 = [\"YES\", \"NO\"]\n print((var_1[((var_3 << 1) + var_2) & 3 > 0]))\n return\n\n\nif __name__ == \"__main__\":\n func_9()\n", "fast_code": "import sys\n\nvar_4, var_3, var_2 = sys.stdin.readline().split()\n\n\ndef func_1():\n return \"NO\" if int(var_3 + var_2) % 4 else \"YES\"\n\n\nif __name__ == \"__main__\":\n var_1 = func_1()\n print(var_1)\n", "slow_time": 89960780, "fast_time": 18071941, "speedup": 4.9779, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_20"} -{"pair_id": "python_4450", "problem_id": "p03136", "language": "python", "slow_code": "import sys\n\nvar_14 = lambda var_13: [int(var_3) for var_3 in var_13.split(\" \")]\nvar_16 = lambda var_15: [int(var_13) for var_13 in var_15]\nvar_17 = lambda var_15: [var_14(var_13) for var_13 in var_15]\nvar_6 = lambda: sys.stdin.readline().rstrip()\nvar_4 = lambda: int(var_6())\nvar_5 = lambda: var_14(var_6())\nvar_9 = lambda var_12: [sys.stdin.readline().rstrip() for _ in range(var_12)]\nvar_7 = lambda var_12: var_16(var_9(var_12))\nvar_8 = lambda var_12: var_17(var_9(var_12))\n\n\ndef func_1():\n var_2 = var_4()\n var_1 = var_5()\n var_1.sort()\n var_10 = sum(var_1[:-1])\n var_11 = var_1[-1]\n if var_10 > var_11:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nfunc_1()\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = [int(var_3) for var_3 in input().split()]\nif 2 * max(var_1) - sum(var_1) < 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 75579739, "fast_time": 22097682, "speedup": 3.4203, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_23"} -{"pair_id": "python_8596", "problem_id": "p03338", "language": "python", "slow_code": "import collections, sys\n\n\ndef func_2():\n return sys.stdin.readline().rstrip()\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\nvar_1 = func_1()\nfunc_2 = func_2()\nvar_2 = 0\nfor var_3 in range(var_1):\n var_6 = set()\n var_5 = set()\n for var_4 in collections.Counter(func_2[:var_3]):\n var_6.add(var_4)\n for var_4 in collections.Counter(func_2[var_3:]):\n var_5.add(var_4)\n var_2 = max(var_2, len(var_6 & var_5))\nprint(var_2)\n", "fast_code": "import sys\n\n\ndef func_2():\n return sys.stdin.readline().rstrip()\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\nvar_1 = func_1()\nfunc_2 = func_2()\nvar_2 = 0\nfor var_3 in range(var_1):\n var_2 = max(var_2, len(set(func_2[:var_3]) & set(func_2[var_3:])))\nprint(var_2)\n", "slow_time": 101999671, "fast_time": 38919019, "speedup": 2.6208, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_20"} -{"pair_id": "python_14646", "problem_id": "p03649", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\n\n\ndef func_1(var_2):\n var_8 = 0\n for var_9 in var_1:\n if var_9 + var_2 - var_4 >= 0:\n var_8 += (var_9 + var_2 - var_4) // (var_4 + 1) + 1\n\n return int(var_8 <= var_2)\n\n\nvar_6 = 0\nvar_7 = 10**30\nfunc_1(1234567894848)\nwhile var_7 - var_6 > 1:\n var_3 = (var_6 + var_7) // 2\n if func_1(var_3) > 0:\n var_7 = var_3\n else:\n var_6 = var_3\nfor var_5 in range(10**5, -1, -1):\n if func_1(var_7 - var_5):\n print((var_7 - var_5))\n break\n", "fast_code": "var_5 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_1.sort()\nvar_2 = 0\nwhile var_1[-1] >= var_5:\n var_4 = -(-(var_1[-1] + 1) // var_5) - 1\n var_2 += var_4\n for var_3 in range(var_5 - 1):\n var_1[var_3] += var_4\n var_1[-1] -= var_5 * var_4\n var_1.sort()\nprint(var_2)\n", "slow_time": 100457990677, "fast_time": 631870484, "speedup": 158.9851, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_2"} -{"pair_id": "python_18047", "problem_id": "p03476", "language": "python", "slow_code": "import math\n\n\ndef func_1(var_6):\n if var_6 == 1:\n return False\n for var_4 in range(2, int(math.sqrt(var_6)) + 1):\n if var_6 % var_4 == 0:\n return False\n return True\n\n\nvar_1 = int(eval(input()))\nvar_2 = [0] * (10**5 + 1)\nfor var_3 in range(1, 10**5 + 1):\n if var_3 % 2 == 0:\n var_2[var_3] = var_2[var_3 - 1]\n continue\n if func_1(var_3) and func_1((var_3 + 1) // 2):\n var_2[var_3] = var_2[var_3 - 1] + 1\n else:\n var_2[var_3] = var_2[var_3 - 1]\nfor _ in range(var_1):\n var_5, var_7 = list(map(int, input().split()))\n print((var_2[var_7] - var_2[var_5 - 1]))\n", "fast_code": "import sys\nfrom itertools import accumulate\n\nvar_10 = sys.stdin.readline\nvar_9 = sys.stdin.read\n\n\ndef func_1():\n var_7, *var_5 = list(map(int, var_9().split()))\n var_6 = 10**5\n var_2 = []\n var_11 = [1] * (var_6 + 1)\n var_11[0], var_11[1] = 0, 0\n for var_3 in range(2, var_6):\n if var_11[var_3]:\n var_11[2 * var_3 :: var_3] = [0 for _ in range(2 * var_3, var_6 + 1, var_3)]\n var_1 = [0] * (var_6 + 1)\n for var_3 in range(3, var_6):\n if var_11[var_3] == 1 and var_11[(var_3 + 1) // 2] == 1:\n\n var_1[var_3] = var_1[var_3 - 1] + 1\n else:\n var_1[var_3] = var_1[var_3 - 1]\n\n for var_4, var_8 in zip(*[iter(var_5)] * 2):\n print((var_1[var_8] - var_1[var_4 - 1]))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 64142625764, "fast_time": 9979165437, "speedup": 6.4277, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_22"} -{"pair_id": "python_7112", "problem_id": "p02689", "language": "python", "slow_code": "import sys\n\n\ndef func_3(\n var_5: int, var_4: int, var_3: \"List[int]\", var_1: \"List[int]\", var_2: \"List[int]\"\n):\n var_10 = [[] for var_8 in range(var_5)]\n for var_8 in range(var_4):\n var_10[var_1[var_8] - 1].append(var_2[var_8])\n var_10[var_2[var_8] - 1].append(var_1[var_8])\n var_12 = [list(set(var_16)) for var_16 in var_10]\n var_6 = 0\n for var_8, var_14 in enumerate(var_12):\n var_7 = [var_3[var_9 - 1] for var_9 in var_14]\n if not var_7 or var_3[var_8] > max(var_7):\n var_6 += 1\n print(var_6)\n return\n\n\ndef func_2():\n def func_1():\n for var_11 in sys.stdin:\n for var_15 in var_11.split():\n yield var_15\n\n var_13 = func_1()\n var_5 = int(next(var_13))\n var_4 = int(next(var_13))\n var_3 = [int(next(var_13)) for _ in range(var_5)]\n var_1 = [int()] * (var_4)\n var_2 = [int()] * (var_4)\n for var_8 in range(var_4):\n var_1[var_8] = int(next(var_13))\n var_2[var_8] = int(next(var_13))\n func_3(var_5, var_4, var_3, var_1, var_2)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_6, var_5 = list(map(int, input().split()))\nvar_3 = list(map(int, input().split()))\nvar_7 = []\nvar_8 = [\"W\"] * var_6\nfor var_4 in range(var_5):\n var_1, var_2 = list(map(int, input().split()))\n if var_3[var_1 - 1] >= var_3[var_2 - 1]:\n var_8[var_2 - 1] = \"L\"\n if var_3[var_1 - 1] <= var_3[var_2 - 1]:\n var_8[var_1 - 1] = \"L\"\nprint((var_8.count(\"W\")))\n", "slow_time": 92480184, "fast_time": 33800587, "speedup": 2.7361, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_9"} -{"pair_id": "python_1781", "problem_id": "p03608", "language": "python", "slow_code": "var_3, var_2, var_4 = list(map(int, input().split()))\nvar_5 = list([int(var_11) - 1 for var_11 in input().split()])\nimport numpy as np\nfrom scipy.sparse.csgraph import floyd_warshall\n\nvar_1 = np.zeros((var_3, var_3))\nfor _ in range(var_2):\n var_6, var_7, var_8 = list(map(int, input().split()))\n var_1[var_6 - 1, var_7 - 1] = var_8\nfloyd_warshall(var_1, directed=False, overwrite=True)\n\n\ndef func_1():\n from itertools import permutations\n\n for var_9 in permutations(var_5):\n var_10 = iter(var_9)\n next(var_10)\n yield sum(var_1[var_6, var_7] for var_6, var_7 in zip(var_9, var_10))\n\n\nprint((int(min(func_1()))))\n", "fast_code": "from heapq import heapify, heappop, heappush\nfrom itertools import permutations\n\n\ndef func_1(var_2: \"Array[Array[int]]\", var_14: int, var_15: int) -> list:\n var_10 = [float(\"inf\")] * var_14\n var_13 = [(0, var_15)]\n var_17 = var_14 - 1\n heapify(var_13)\n while var_13:\n var_8, var_18 = heappop(var_13)\n if var_8 > var_10[var_18]:\n continue\n var_10[var_18] = var_8\n for var_11, var_16 in var_2[var_18]:\n if var_8 + var_11 < var_10[var_16]:\n heappush(var_13, (var_8 + var_11, var_16))\n var_17 -= 1\n if not var_17:\n break\n return var_10\n\n\ndef func_2():\n global G, N\n var_4, var_3, var_5, *var_6 = list(map(int, open(0).read().split()))\n var_19, var_1 = var_6[:var_5], var_6[var_5:]\n var_2 = [[] for _ in range(var_4 + 1)]\n for var_18, var_16, var_8 in zip(*[iter(var_1)] * 3):\n var_2[var_18].append((var_8, var_16)), var_2[var_16].append((var_8, var_18))\n var_10 = {var_18: func_1(var_2, var_4 + 1, var_18) for var_18 in var_19}\n var_7 = float(\"inf\")\n for var_12 in permutations(var_19):\n var_9 = sum(\n var_10[var_18][var_16] for var_18, var_16 in zip(var_12, var_12[1:])\n )\n var_7 = min(var_7, var_9)\n print(var_7)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "slow_time": 16546352342, "fast_time": 79257828, "speedup": 208.7662, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_4"} -{"pair_id": "python_14132", "problem_id": "p02741", "language": "python", "slow_code": "def func_1():\n print(\n (\n [\n 1,\n 1,\n 1,\n 2,\n 1,\n 2,\n 1,\n 5,\n 2,\n 2,\n 1,\n 5,\n 1,\n 2,\n 1,\n 14,\n 1,\n 5,\n 1,\n 5,\n 2,\n 2,\n 1,\n 15,\n 2,\n 2,\n 5,\n 4,\n 1,\n 4,\n 1,\n 51,\n ][int(eval(input())) - 1]\n )\n )\n return 0\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_1 = int(eval(input()))\nvar_3 = \"1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51\"\nvar_2 = var_3.split(\",\")\nprint((int(var_2[var_1 - 1])))\n", "slow_time": 18088788, "fast_time": 8476631, "speedup": 2.134, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_12"} -{"pair_id": "python_6716", "problem_id": "p00053", "language": "python", "slow_code": "var_7 = [0]\nvar_1 = 10**6\nvar_6 = [1] * var_1\nvar_2 = 0\nfor var_3 in range(2, var_1):\n if var_6[var_3]:\n for var_4 in range(var_3 * var_3, var_1, var_3):\n var_6[var_4] = 0\n var_2 += var_3\n var_7.append(var_2)\nwhile 1:\n var_5 = eval(input())\n if var_5 == 0:\n break\n print(var_7[var_5])\n", "fast_code": "import math\n\nvar_6 = 105000\nvar_7 = int(math.sqrt(var_6))\nvar_4 = [1] * var_6\nvar_4[0] = 0\nfor var_1 in range(1, var_7):\n if var_4[var_1]:\n for var_2 in range(2 * var_1 + 1, var_6, var_1 + 1):\n var_4[var_2] = 0\nvar_5 = [0 for var_1 in range(11000)]\nvar_2 = 0\nfor var_1 in range(len(var_4)):\n if var_4[var_1]:\n var_5[var_2] = var_1 + 1\n var_2 += 1\nwhile True:\n var_3 = int(input())\n if not var_3:\n break\n print(sum(var_5[:var_3]))\n", "slow_time": 126327816139, "fast_time": 12853613312, "speedup": 9.8282, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_3"} -{"pair_id": "python_8599", "problem_id": "p02848", "language": "python", "slow_code": "import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import (\n ceil,\n sqrt,\n hypot,\n factorial,\n pi,\n sin,\n cos,\n tan,\n asin,\n acos,\n atan,\n radians,\n degrees,\n log2,\n)\nfrom itertools import (\n accumulate,\n permutations,\n combinations,\n combinations_with_replacement,\n product,\n groupby,\n)\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom bisect import bisect, bisect_left\nfrom heapq import heappush, heappop\nfrom functools import reduce\n\n\ndef func_5():\n return sys.stdin.readline().strip()\n\n\ndef func_1():\n return int(func_5())\n\n\ndef func_3():\n return map(int, func_5().split())\n\n\ndef func_2():\n return list(map(int, func_5().split()))\n\n\ndef func_4(var_7):\n return zip(*(func_3() for _ in range(var_7)))\n\n\nimport numpy as np\n\nsys.setrecursionlimit(10**9)\nvar_2 = float(\"inf\")\nvar_6 = 10**9 + 7\nvar_3 = func_1()\nvar_4 = func_5()\nvar_1 = [chr(65 + (ord(var_4[var_5]) - 65 + var_3) % 26) for var_5 in range(len(var_4))]\nprint(*var_1, sep=\"\")\n", "fast_code": "var_4 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nvar_3 = int(input())\nvar_5 = input()\nvar_1 = ord(\"A\")\nprint(\"\".join([var_4[(ord(var_2) - var_1 + var_3) % 26] for var_2 in var_5]))\n", "slow_time": 87110553, "fast_time": 19283145, "speedup": 4.5174, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_2"} -{"pair_id": "python_2248", "problem_id": "p03281", "language": "python", "slow_code": "var_5 = int(eval(input()))\nvar_4 = []\nvar_1 = 0\nfor var_2 in range(var_5):\n for var_3 in range(var_2 + 1):\n if (var_2 + 1) % (var_3 + 1) == 0 and (var_2 + 1) % 2 != 0:\n var_4.append(var_2 + 1)\n if len(var_4) == 8:\n var_1 += 1\n if len(var_4) != 8:\n var_4.clear()\nprint(var_1)\n", "fast_code": "var_5 = int(eval(input()))\nvar_1 = 0\nfor var_3 in range(1, var_5 + 1, 2):\n var_2 = 0\n for var_4 in range(1, var_5 + 1, 2):\n if var_4 > var_3:\n break\n if var_3 % var_4 == 0:\n var_2 += 1\n if var_2 == 8:\n var_1 += 1\nprint(var_1)\n", "slow_time": 118569525, "fast_time": 50752450, "speedup": 2.3362, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_15"} -{"pair_id": "python_15009", "problem_id": "p03212", "language": "python", "slow_code": "def func_1(var_4):\n if len(var_4) >= 3 and len(set(list(var_4)) & {\"3\", \"5\", \"7\"}) == 3:\n var_1.append(int(var_4))\n if len(var_4) < 10:\n for var_3 in (\"3\", \"5\", \"7\"):\n func_1(var_4 + var_3)\n\n\nvar_4 = int(eval(input()))\nvar_1 = []\nfor var_3 in (\"3\", \"5\", \"7\"):\n func_1(var_3)\nvar_1.sort()\nvar_2 = 0\nwhile 1:\n if var_1[var_2] <= var_4:\n var_2 += 1\n else:\n break\nprint(var_2)\n", "fast_code": "var_3 = int(eval(input()))\n\n\ndef func_1(var_5, var_1):\n if var_5 > var_3:\n return\n var_1.append(var_5)\n func_1(10 * var_5 + 3, var_1)\n func_1(10 * var_5 + 5, var_1)\n func_1(10 * var_5 + 7, var_1)\n\n\nvar_1 = []\nfunc_1(3, var_1)\nfunc_1(5, var_1)\nfunc_1(7, var_1)\nvar_2 = 0\nfor var_4 in var_1:\n if len(set(list(str(var_4)))) == 3:\n var_2 += 1\nprint(var_2)\n", "slow_time": 31175985341, "fast_time": 2090473783, "speedup": 14.9134, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_1"} -{"pair_id": "python_1803", "problem_id": "p02821", "language": "python", "slow_code": "var_4, var_3 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_1.sort(reverse=True)\nvar_2 = var_1[-1] * 2\nvar_5 = var_1[0] * 2\n\nvar_7 = [0] * (var_5 + 1)\nfor var_6 in var_1:\n var_7[var_6] += 1\nfor var_9 in range(var_5, 0, -1):\n var_7[var_9 - 1] += var_7[var_9]\n\n\ndef func_1(var_11):\n var_10 = 0\n for var_6 in var_1:\n var_10 += var_7[max(var_11 - var_6, 0)]\n return var_10 >= var_3\n\n\nvar_13 = var_2\nvar_12 = var_5 + 1\nwhile var_12 - var_13 > 1:\n var_10 = (var_13 + var_12) // 2\n if func_1(var_10):\n var_13 = var_10\n else:\n var_12 = var_10\n\nvar_8 = var_1[:]\nfor var_9 in range(1, var_4):\n var_8[var_9] += var_8[var_9 - 1]\nvar_14 = 0\nfor var_6 in var_1:\n var_15 = var_7[max(var_13 - var_6, 0)]\n if var_15 != 0:\n var_14 += var_6 * var_15 + var_8[var_15 - 1]\n var_3 -= var_15\nvar_14 += var_13 * var_3\nprint(var_14)\n", "fast_code": "import numpy as np\nimport sys\n\nvar_9 = sys.stdin.readline\n\n\ndef func_1():\n var_3, var_2 = list(map(int, var_9().split()))\n var_1 = np.array(sorted([int(var_8) for var_8 in var_9().split()]))\n var_10 = 0\n var_11 = var_1[-1] * 2 + 5\n while var_11 - var_10 > 1:\n var_12 = (var_10 + var_11) // 2\n var_6 = var_3**2 - np.searchsorted(var_1, var_12 - var_1).sum()\n if var_6 >= var_2:\n var_10 = var_12\n else:\n var_11 = var_12\n var_5 = np.searchsorted(var_1, var_10 - var_1)\n var_6 = var_3**2 - var_5.sum()\n var_7 = var_6 - var_2\n var_4 = ((var_3 - var_5) * var_1 * 2).sum() - var_7 * var_10\n print(var_4)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 295175780, "fast_time": 50593692, "speedup": 5.8342, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_14"} -{"pair_id": "python_16355", "problem_id": "p03309", "language": "python", "slow_code": "import sys\n\n\ndef func_10():\n return sys.stdin.readline().strip()\n\n\ndef func_11(var_5, var_6, var_7):\n return [[var_7] * var_6 for var_11 in range(var_5)]\n\n\ndef func_12(var_5, var_6, var_7, var_8):\n return [[[var_8] * var_7 for var_12 in range(var_6)] for var_11 in range(var_5)]\n\n\ndef func_13(var_5, var_6, var_7, var_8, var_9):\n return [\n [[[var_9] * var_8 for var_12 in range(var_7)] for var_12 in range(var_6)]\n for var_11 in range(var_5)\n ]\n\n\ndef func_8(var_20, var_21=1):\n return int(-(-var_20 // var_21))\n\n\ndef func_1():\n return int(eval(func_10()))\n\n\ndef func_3():\n return list(map(int, func_10().split()))\n\n\ndef func_2(var_4=None):\n return list(func_3()) if var_4 is None else [func_1() for var_11 in range(var_4)]\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_2 = 10**18\nvar_3 = 10**9 + 7\nvar_4 = func_1()\nvar_1 = func_2()\n\n\ndef func_9(var_14):\n var_19 = 0\n for var_11, var_5 in enumerate(var_1):\n var_19 += abs(var_5 - (var_14 + var_11 + 1))\n return var_19\n\n\nvar_13 = -(10**9)\nvar_10 = 10**9\nwhile var_13 + 2 < var_10:\n var_15 = (var_13 * 2 + var_10) // 3\n var_16 = (var_13 + var_10 * 2) // 3\n var_17 = func_9(var_15)\n var_18 = func_9(var_16)\n\n if var_17 <= var_18:\n var_10 = var_16\n else:\n var_13 = var_15\nprint((min(func_9(var_15), func_9(var_16))))\n", "fast_code": "def func_1(var_5):\n var_4 = 0\n for var_3 in var_1:\n var_4 += abs(var_3 - var_5)\n return var_4\n\n\nvar_2 = int(eval(input()))\nvar_1 = []\nfor var_6, var_3 in enumerate(map(int, input().split())):\n var_1.append(var_3 - var_6 - 1)\nvar_1.sort()\nif var_2 % 2 == 0:\n var_5 = [var_1[var_2 // 2]]\nelse:\n var_5 = [var_1[var_2 // 2 - 1], var_1[var_2 // 2]]\nprint((min(list(map(func_1, var_5)))))\n", "slow_time": 198949924, "fast_time": 40546462, "speedup": 4.9067, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_5"} -{"pair_id": "python_3065", "problem_id": "p02724", "language": "python", "slow_code": "var_3 = int(eval(input()))\nvar_1 = -1\nvar_2 = -1\nwhile var_3 >= 0:\n var_3 = var_3 - 500\n var_1 = var_1 + 1\nvar_3 = var_3 + 500\nif var_3 == 0:\n var_4 = var_1 * 1000\n print(var_4)\nelse:\n while var_3 >= 0:\n var_3 = var_3 - 5\n var_2 = var_2 + 1\n var_4 = var_1 * 1000 + var_2 * 5\n print(var_4)\n", "fast_code": "var_1 = int(eval(input()))\nprint(((var_1 // 500) * 1000 + (var_1 % 500) // 5 * 5))\n", "slow_time": 2799708692, "fast_time": 10495253, "speedup": 266.7595, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_13"} -{"pair_id": "python_1029", "problem_id": "p03329", "language": "python", "slow_code": "from bisect import bisect_right\n\nvar_5 = int(eval(input()))\nvar_1 = 100010\nvar_2 = [float(\"inf\") for _ in range(var_1)]\nvar_2[0] = 0\nvar_6, var_7 = [6], [9]\nwhile True:\n var_3 = False\n if var_6[-1] * 6 <= var_1:\n var_6.append(var_6[-1] * 6)\n var_3 = True\n if var_7[-1] * 9 <= var_1:\n var_7.append(var_7[-1] * 9)\n var_3 = True\n if var_3 == False:\n break\nfor var_4 in range(1, var_1):\n var_9 = [1]\n if var_4 >= 6:\n var_10 = bisect_right(var_6, var_4)\n var_9.append(var_6[var_10 - 1])\n if var_4 >= 9:\n var_11 = bisect_right(var_7, var_4)\n var_9.append(var_7[var_11 - 1])\n for var_8 in var_9:\n var_2[var_4] = min(var_2[var_4], var_2[var_4 - var_8] + 1)\nprint((var_2[var_5]))\n", "fast_code": "def func_1():\n var_1 = int(eval(input()))\n var_3 = [1]\n var_5 = [float(\"inf\")] * (var_1 + 5)\n var_7 = 6\n var_4 = 1\n while var_7**var_4 <= var_1:\n var_3.append(var_7**var_4)\n var_4 += 1\n var_7 = 9\n var_4 = 1\n while var_7**var_4 <= var_1:\n var_3.append(var_7**var_4)\n var_4 += 1\n var_3.sort()\n var_5[0] = 0\n for var_6 in range(var_1 + 1):\n for var_2 in var_3:\n if var_6 + var_2 <= var_1:\n var_5[var_6 + var_2] = min(var_5[var_6 + var_2], var_5[var_6] + 1)\n print((var_5[var_1]))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 45292776361, "fast_time": 181974205, "speedup": 248.8967, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_26"} -{"pair_id": "python_16609", "problem_id": "p03147", "language": "python", "slow_code": "import numpy as np\n\nvar_2 = int(eval(input()))\nvar_1 = np.array([0] + list(map(int, input().split())))\nvar_3 = 0\nwhile np.any(var_1 > 0):\n var_3 += np.sum(np.logical_and(var_1[1:] > 0, var_1[:-1] <= 0))\n var_1 -= 1\nprint(var_3)\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nvar_4 = var_2[0]\nfor var_3 in range(1, var_1):\n var_4 += max(0, var_2[var_3] - var_2[var_3 - 1])\nprint(var_4)\n", "slow_time": 360471067, "fast_time": 22446470, "speedup": 16.0591, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_18"} -{"pair_id": "python_14564", "problem_id": "p00150", "language": "python", "slow_code": "var_1 = 10001\nvar_2 = 100\nvar_7 = [True for var_4 in range(var_1)]\n\n\ndef func_1():\n for var_4 in range(4, var_1, 2):\n var_7[var_4] = False\n for var_4 in range(3, var_2, 2):\n if var_7[var_4] is True:\n for var_5 in range(var_4 * var_4, var_1, var_4):\n var_7[var_5] = False\n\n\nfunc_1()\nvar_8 = [0] * var_1\nvar_3 = 0\nfor var_4 in range(5, var_1, 2):\n if var_7[var_4] and var_7[var_4 - 2]:\n var_3 = var_4\n var_8[var_4] = var_3\nwhile True:\n var_6 = int(eval(input()))\n if var_6 == 0:\n break\n if (var_6 & 1) == 0:\n var_6 -= 1\n print((var_8[var_6] - 2, var_8[var_6]))\n", "fast_code": "import bisect as bs\n\n\ndef func_1(var_5):\n var_1 = list(range(1, var_5 + 1, 2))\n var_1[0] = 2\n for var_4 in range(1, int(var_5**0.5) + 1):\n var_7 = var_1[var_4]\n if var_7:\n var_1[var_4 + var_7 :: var_7] = [0] * len(var_1[var_4 + var_7 :: var_7])\n return [_f for _f in var_1 if _f]\n\n\nvar_2 = func_1(10000)\nvar_7 = [\n var_2[var_4]\n for var_4 in range(1, len(var_2))\n if var_2[var_4] - var_2[var_4 - 1] == 2\n]\nwhile 1:\n var_6 = eval(input())\n if var_6 == 0:\n break\n var_3 = var_7[bs.bisect_right(var_7, var_6) - 1]\n print(var_3 - 2, var_3)\n", "slow_time": 475453396, "fast_time": 128294719, "speedup": 3.7059, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_3"} -{"pair_id": "python_9025", "problem_id": "p03837", "language": "python", "slow_code": "import os\nimport sys\nimport numpy as np\nfrom scipy.sparse.csgraph import csgraph_from_dense, dijkstra\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\nsys.setrecursionlimit(2147483647)\nvar_4 = float(\"inf\")\nvar_3 = 10**18\nvar_6, var_5 = list(map(int, sys.stdin.readline().split()))\nvar_1 = [list(map(int, sys.stdin.readline().split())) for _ in range(var_5)]\nvar_2 = np.zeros((var_6, var_6))\nfor var_7, var_8, var_9 in var_1:\n var_2[var_7 - 1][var_8 - 1] = var_9\nvar_10 = dijkstra(csgraph_from_dense(var_2), directed=False)\nprint(((var_10 < var_2).sum()))\n", "fast_code": "var_2 = 10**5 + 10\nvar_5, var_4 = list(map(int, input().split()))\nvar_3 = [list(map(int, input().split())) for _ in range(var_4)]\nvar_1 = {var_11: [] for var_11 in range(1, var_5 + 1)}\nvar_10 = [[var_2 for _ in range(var_5 + 1)] for _ in range(var_5 + 1)]\nfor var_12 in range(var_4):\n var_6, var_7, var_8 = var_3[var_12]\n var_1[var_6].append(var_7)\n var_1[var_7].append(var_6)\n var_10[var_6][var_7] = var_8\n var_10[var_7][var_6] = var_8\nfor var_13 in range(1, var_5 + 1):\n for var_11 in range(1, var_5 + 1):\n for var_12 in range(1, var_5 + 1):\n var_10[var_11][var_12] = min(\n var_10[var_11][var_12], var_10[var_11][var_13] + var_10[var_13][var_12]\n )\nvar_9 = 0\nfor var_12 in range(var_4):\n var_6, var_7, var_8 = var_3[var_12]\n if var_10[var_6][var_7] < var_8:\n var_9 += 1\nprint(var_9)\n", "slow_time": 14555060473, "fast_time": 49666937, "speedup": 293.0533, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_8"} -{"pair_id": "python_10580", "problem_id": "p02982", "language": "python", "slow_code": "from numpy import *\n\nvar_5, *var_7 = [var_2(var_6.split()) for var_6 in open(0)]\nprint(\n (\n sum(\n var_3 == int(var_3)\n for var_1 in var_7\n for var_3 in map(var_4.norm, var_1 - var_7)\n )\n - var_5[0]\n >> 1\n )\n)\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = [list(map(int, input().split())) for _ in range(var_2)]\n\n\ndef func_1(var_8, var_9):\n var_7 = 0\n for var_5 in range(var_1):\n var_7 += (var_3[var_8][var_5] - var_3[var_9][var_5]) ** 2\n var_7 **= 1 / 2\n if var_7 == int(var_7):\n return 1\n else:\n return 0\n\n\nvar_4 = 0\nfor var_5 in range(var_2 - 1):\n for var_6 in range(var_5 + 1, var_2):\n var_4 += func_1(var_5, var_6)\nprint(var_4)\n", "slow_time": 7103541835, "fast_time": 32469045, "speedup": 218.7789, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_4"} -{"pair_id": "python_6253", "problem_id": "p00022", "language": "python", "slow_code": "var_5 = eval(input())\nwhile var_5:\n var_1 = [eval(input()) for var_4 in range(var_5)]\n var_7 = var_1\n var_6 = max(var_7)\n while var_5 - 1:\n var_1 = var_1[1:]\n var_7 = [var_2 + var_3 for var_2, var_3 in zip(var_7[:-1], var_1)]\n var_6 = max(var_6, max(var_7))\n var_5 -= 1\n print(var_6)\n var_5 = eval(input())\n", "fast_code": "while 1:\n var_2 = eval(input())\n if var_2 == 0:\n break\n var_3 = [int(input()) for var_1 in range(var_2)]\n for var_1 in range(1, var_2):\n var_3[var_1] = max(var_3[var_1 - 1] + var_3[var_1], var_3[var_1])\n print(max(var_3))\n", "slow_time": 95884060, "fast_time": 40663914, "speedup": 2.358, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_7"} -{"pair_id": "python_10956", "problem_id": "p02389", "language": "python", "slow_code": "import sys\nfrom functools import reduce\n\nfor var_1 in sys.stdin:\n var_3 = list([int(var_5) for var_5 in var_1.split()])\n var_2 = reduce(lambda var_5, var_6: var_5 * var_6, var_3)\n var_4 = reduce(lambda var_5, var_6: var_5 + var_6, var_3) * 2\n print((str(var_2) + \" \" + str(var_4)))\n", "fast_code": "var_1, var_3 = list(map(int, input().split()))\nvar_2 = var_1 * var_3\nvar_4 = 2 * (var_1 + var_3)\nprint((var_2, var_4))\n", "slow_time": 28665851, "fast_time": 13169340, "speedup": 2.1767, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_14"} -{"pair_id": "python_14087", "problem_id": "p02244", "language": "python", "slow_code": "from functools import lru_cache\n\nvar_4 = [[\".\" for var_6 in range(8)] for var_7 in range(8)]\n\n\ndef func_1(var_4, var_1, var_3):\n var_12 = list(zip(*var_4))\n if \"Q\" in var_4[var_1]:\n return False\n if \"Q\" in var_12[var_3]:\n return False\n var_5 = []\n for var_6 in range(8):\n for var_7 in range(8):\n try:\n if var_7 + (var_1 - var_6) == var_3:\n var_5.append(var_4[var_6][var_7])\n if var_7 - (var_1 - var_6) == var_3:\n var_5.append(var_4[var_6][var_7])\n if var_7 + (var_6 - var_1) == var_3:\n var_5.append(var_4[var_6][var_7])\n if var_7 - (var_6 - var_1) == var_3:\n var_5.append(var_4[var_6][var_7])\n except IndexError:\n continue\n if \"Q\" in var_5:\n return False\n return True\n\n\ndef func_2(var_10, var_9):\n if var_9 == 8:\n return var_10\n for var_6 in range(8):\n for var_7 in range(8):\n if func_1(var_10, var_6, var_7):\n var_11 = var_10\n var_11[var_6][var_7] = \"Q\"\n if func_2(var_11, var_9 + 1) != [[]]:\n return var_11\n else:\n var_11[var_6][var_7] = \".\"\n return [[]]\n\n\nvar_8 = int(eval(input()))\nfor var_6 in range(var_8):\n var_1, var_3 = input().split()\n var_4[int(var_1)][int(var_3)] = \"Q\"\nvar_2 = func_2(var_4, var_8)\nprint((\"\\n\".join(list([\"\".join(var_13) for var_13 in var_2]))))\n", "fast_code": "from sys import stdin\nfrom itertools import permutations as per\n\n\ndef func_1(var_12):\n for var_14, var_4 in var_12:\n if not all(\n (var_14 == var_15 and var_4 == var_5)\n or (var_14 + var_4 != var_15 + var_5 and var_14 - var_4 != var_15 - var_5)\n for var_15, var_5 in var_12\n ):\n return False\n return True\n\n\nvar_8 = int(stdin.readline())\nvar_2, var_1 = [[var_6 for var_6 in range(8)] for _ in range(2)]\nvar_10 = []\nfor _ in range(var_8):\n var_13, var_3 = list(map(int, stdin.readline().split()))\n var_10.append((var_13, var_3))\n var_2.remove(var_13)\n var_1.remove(var_3)\nfor var_9 in per(var_1):\n var_11 = var_10[:] + [(var_13, var_3) for var_13, var_3 in zip(var_2, var_9)]\n if func_1(var_11):\n for var_6, var_7 in sorted(var_11):\n print((\".\" * var_7 + \"Q\" + \".\" * (8 - var_7 - 1)))\n break\n", "slow_time": 35812672713, "fast_time": 419773437, "speedup": 85.3143, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_1"} -{"pair_id": "python_5435", "problem_id": "p03288", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**9)\nvar_1 = 10**18\nvar_2 = 10**9 + 7\nvar_7 = lambda: sys.stdin.readline().rstrip()\nvar_5 = lambda var_6: bool([print(\"Yes\")] if var_6 else print(\"No\"))\nvar_4 = lambda var_6: bool([print(\"YES\")] if var_6 else print(\"NO\"))\nvar_8 = lambda var_9: int(var_9) - 1\nvar_3 = int(var_7())\nif var_3 >= 2800:\n print(\"AGC\")\nelif var_3 >= 1200:\n print(\"ARC\")\nelse:\n print(\"ABC\")\n", "fast_code": "print((\"A\" + \"BRG\"[(int(eval(input())) + 400) // 1600] + \"C\"))\n", "slow_time": 41475856, "fast_time": 10479567, "speedup": 3.9578, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_5"} -{"pair_id": "python_17968", "problem_id": "p03476", "language": "python", "slow_code": "import bisect\n\nvar_1 = [True] * 100001\nvar_1[0] = False\nvar_1[1] = False\nvar_5 = []\nfor var_2 in range(2, 100001):\n if var_1[var_2]:\n for var_3 in range(var_2 * 2, 100001, var_2):\n var_1[var_3] = False\n if var_2 % 2 != 0 and var_1[(var_2 + 1) // 2]:\n var_5.append(var_2)\nvar_6 = int(eval(input()))\nfor var_2 in range(var_6):\n var_4, var_7 = list(map(int, input().split()))\n print((bisect.bisect_right(var_5, var_7) - bisect.bisect_left(var_5, var_4)))\n", "fast_code": "import math\nfrom itertools import accumulate\n\n\ndef func_1(var_10):\n if var_10 == 1:\n return 0\n for var_7 in range(2, int(math.sqrt(var_10)) + 1):\n if var_10 % var_7 == 0:\n return 0\n return 1\n\n\nvar_2 = int(eval(input()))\nvar_1 = [0] * var_2\nvar_3 = [0] * var_2\nfor var_6 in range(var_2):\n var_1[var_6], var_3[var_6] = list(map(int, input().split()))\nvar_9 = min(var_1)\nvar_8 = max(var_3)\nvar_4 = []\nfor var_6 in range(var_9, var_8 + 1):\n if var_6 % 2 == 1:\n var_5 = func_1(var_6) and func_1((var_6 + 1) / 2)\n else:\n var_5 = 0\n var_4.append(var_5)\n\nvar_4 = [0] + var_4\nvar_4 = list(accumulate(var_4))\nfor var_6 in range(var_2):\n print((var_4[var_3[var_6] - var_9 + 1] - var_4[var_1[var_6] - var_9]))\n", "slow_time": 15667270276, "fast_time": 333117450, "speedup": 47.0323, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_18"} -{"pair_id": "python_4827", "problem_id": "p04015", "language": "python", "slow_code": "def func_1():\n var_2, var_1 = tuple(map(int, input().split()))\n var_3 = tuple(map(int, input().split()))\n\n var_5 = [\n [[0] * (var_2 * 50 + 1) for _ in range(var_2 + 1)] for _ in range(var_2 + 1)\n ]\n var_5[0][0][0] = 1\n for var_6 in range(var_2):\n for var_7 in range(var_2):\n for var_8 in range(var_2 * 50 + 1):\n if var_5[var_6][var_7][var_8]:\n var_5[var_6 + 1][var_7][var_8] += var_5[var_6][var_7][var_8]\n var_5[var_6 + 1][var_7 + 1][var_8 + var_3[var_6]] += var_5[var_6][\n var_7\n ][var_8]\n var_4 = sum(var_5[var_2][var_6][var_6 * var_1] for var_6 in range(1, var_2 + 1))\n print(var_4)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "def func_1():\n var_2, var_1 = list(map(int, input().split()))\n var_8 = list(map(int, input().split()))\n var_8.insert(0, 0)\n var_4 = [\n [[0 for _ in range(var_2 * var_1 + 1)] for _ in range(var_2 + 1)]\n for _ in range(var_2 + 1)\n ]\n for var_5 in range(var_2 + 1):\n var_4[var_5][0][0] = 1\n for var_5 in range(1, var_2 + 1):\n for var_6 in range(1, var_5 + 1):\n for var_7 in range(1, var_2 * var_1 + 1):\n var_4[var_5][var_6][var_7] = var_4[var_5 - 1][var_6][var_7]\n if var_7 >= var_8[var_5]:\n var_4[var_5][var_6][var_7] += var_4[var_5 - 1][var_6 - 1][\n var_7 - var_8[var_5]\n ]\n var_3 = 0\n for var_6 in range(1, var_2 + 1):\n var_3 += var_4[var_2][var_6][var_1 * var_6]\n print(var_3)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 8149055426, "fast_time": 1196690512, "speedup": 6.8097, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_8"} -{"pair_id": "python_16583", "problem_id": "p02845", "language": "python", "slow_code": "_, var_1 = open(0)\nvar_2 = 1\nvar_3 = [3] + [0] * 10**6\nfor var_1 in map(int, var_1.split()):\n var_2 = var_2 * var_3[var_1] % (10**9 + 7)\n var_3[var_1] -= 1\n var_3[var_1 + 1] += 1\nprint(var_2)\n", "fast_code": "import itertools\nimport sys\nfrom collections import Counter\n\nsys.setrecursionlimit(10**9)\nvar_1 = 1000000007\nvar_2 = int(sys.stdin.readline())\nvar_9 = list(map(int, sys.stdin.read().split()))\nvar_4 = Counter(var_9)\n\n\ndef func_1(var_16, var_13):\n var_3 = var_16.get(var_13)\n if var_3 is not None:\n return var_3\n var_14 = sum(var_13)\n assert var_14 > 0\n var_8 = var_9[var_14 - 1] + 1\n var_10, var_11, var_12 = var_13\n var_15 = 0\n if var_8 == var_10:\n var_15 += func_1(var_16, tuple(sorted([var_10 - 1, var_11, var_12])))\n var_15 %= var_1\n if var_8 == var_11:\n var_15 += func_1(var_16, tuple(sorted([var_10, var_11 - 1, var_12])))\n var_15 %= var_1\n if var_8 == var_12:\n var_15 += func_1(var_16, tuple(sorted([var_10, var_11, var_12 - 1])))\n var_15 %= var_1\n\n var_16[var_13] = var_15\n return var_15\n\n\ndef func_2():\n var_5 = [0, 0, 0]\n for var_6 in range(var_2):\n var_7 = var_4[var_6]\n if var_7 == 3:\n var_5[0] = var_5[1] = var_5[2] = var_6 + 1\n elif var_7 == 2:\n var_5[0] = var_5[1] = var_6 + 1\n elif var_7 == 1:\n var_5[0] = var_6 + 1\n else:\n break\n if sum(var_5) != var_2:\n return 0\n var_16 = dict()\n var_16[0, 0, 0] = 1\n var_15 = func_1(var_16, tuple(sorted(var_5)))\n return (var_15 * len(set(itertools.permutations(var_5)))) % var_1\n\n\nprint((func_2()))\n", "slow_time": 815333677, "fast_time": 102769915, "speedup": 7.9336, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_21"} -{"pair_id": "python_6296", "problem_id": "p03419", "language": "python", "slow_code": "def func_2(var_2, var_1):\n var_3 = [[0 for var_4 in range(var_1)] for var_5 in range(var_2)]\n for var_4 in range(var_1):\n for var_5 in range(var_2):\n for var_9 in range(-1, 2):\n for var_7 in range(-1, 2):\n var_8 = var_4 + var_7\n var_10 = var_5 + var_9\n if 0 <= var_8 < var_1 and 0 <= var_10 < var_2:\n var_3[var_10][var_8] ^= 1\n var_6 = 0\n for var_4 in range(var_1):\n for var_5 in range(var_2):\n if var_3[var_5][var_4]:\n var_6 += 1\n return var_6\n\n\ndef func_1(var_2, var_1):\n if var_2 == 1 and var_1 == 1:\n return 1\n if var_2 >= 2 and var_1 >= 2:\n return (var_2 - 2) * (var_1 - 2)\n if var_2 == 1:\n return var_1 - 2\n return var_2 - 2\n\n\nvar_2, var_1 = [int(_) for _ in input().split()]\nprint((func_1(var_2, var_1)))\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nif 2 <= var_2:\n var_2 -= 2\nif 2 <= var_1:\n var_1 -= 2\nprint((var_2 * var_1))\n", "slow_time": 72088785, "fast_time": 13981662, "speedup": 5.156, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_10"} -{"pair_id": "python_13640", "problem_id": "p02362", "language": "python", "slow_code": "import array\nimport collections\n\nvar_1 = 2**31\n\n\nclass Class_1(Exception):\n pass\n\n\nclass Class_2(Class_1):\n def __init__(self, var_12):\n self.reason = var_12\n\n def __str__(self):\n return str(var_12)\n\n\nclass Class_3(object):\n def __init__(self, var_10, var_2, var_3, var_16):\n self.max_v = var_10\n self.adj = var_2\n self.costs = var_3\n self.start = var_16\n self.dist = None\n self.visits = None\n\n def func_1(self):\n self.dist = collections.defaultdict(lambda: var_1)\n self.dist[self.start] = 0\n self.visits = collections.defaultdict(int)\n\n def func_3(self):\n self.initialize()\n var_11 = collections.deque()\n var_11.append(self.start)\n while var_11:\n var_18 = var_11.popleft()\n self.visits[var_18] += 1\n if self.visits[var_18] >= self.max_v:\n if self.max_v == 1:\n return [0]\n raise Class_2(\"A negative cycle was detected.\")\n for var_19 in self.adj[var_18]:\n var_9 = self.dist[var_18] + self.costs[(var_18, var_19)]\n if var_9 < self.dist[var_19]:\n self.dist[var_19] = var_9\n if var_19 not in var_11:\n var_11.append(var_19)\n return self.dist\n\n\ndef func_2():\n var_8, var_7, var_16 = list(map(int, input().split()))\n var_2 = collections.defaultdict(lambda: array.array(\"L\"))\n var_3 = collections.defaultdict(lambda: var_1)\n for _ in range(var_7):\n var_14, var_17, var_4 = list(map(int, input().split()))\n var_2[var_14].append(var_17)\n var_3[(var_14, var_17)] = var_4\n var_15 = Class_3(var_8, var_2, var_3, var_16)\n try:\n var_5 = var_15.single_source_shortest_path()\n for var_19 in range(var_8):\n var_13 = var_5[var_19]\n if var_13 < var_1:\n print(var_13)\n else:\n print(\"INF\")\n except Class_2 as var_6:\n print(\"NEGATIVE CYCLE\")\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "import sys\n\nvar_5 = sys.stdin\nvar_2, var_1, var_10 = map(int, var_5.readline().split())\nvar_4 = []\nfor var_8 in var_5:\n var_4.append(tuple(map(int, var_8.split())))\n\nvar_3 = [float(\"inf\")] * var_2\nvar_3[var_10] = 0\nvar_9 = True\nfor var_7 in range(var_2 - 1):\n var_9 = True\n for var_11, var_12, var_14 in var_4:\n var_13 = var_3[var_11] + var_14\n if var_13 < var_3[var_12]:\n var_3[var_12] = var_13\n var_9 = False\n if var_9:\n break\n\nif var_9:\n print(*map(lambda var_15: str(var_15).upper(), var_3), sep=\"\\n\")\nelse:\n var_6 = True\n for var_11, var_12, var_14 in var_4:\n var_13 = var_3[var_11] + var_14\n if var_13 < var_3[var_12]:\n print(\"NEGATIVE CYCLE\")\n var_6 = False\n break\n if var_6:\n print(*map(lambda var_15: str(var_15).upper(), var_3), sep=\"\\n\")\n", "slow_time": 134643964, "fast_time": 59115609, "speedup": 2.2776, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_10"} -{"pair_id": "python_6761", "problem_id": "p00444", "language": "python", "slow_code": "import sys\n\nvar_3 = [1, 5, 10, 50, 100, 500]\nfor var_4 in sys.stdin:\n if int(var_4) == 0:\n break\n var_6 = 1000 - int(var_4)\n var_1 = [var_4 for var_4 in range(var_6 + 1)]\n for var_4 in range(len(var_3)):\n var_2 = var_3[var_4]\n if var_2 <= var_6:\n var_1[var_2] = 1\n var_3.append(var_2)\n for var_2 in var_3:\n for var_7 in range(var_2 + 1, var_6 + 1):\n var_5 = var_1[var_7]\n if var_5 == 1:\n continue\n var_1[var_7] = (\n var_1[var_7 - var_2] + 1 if var_5 > var_1[var_7 - var_2] + 1 else var_5\n )\n print((var_1[var_6]))\n", "fast_code": "import sys\n\nvar_2 = [500, 100, 50, 10, 5, 1]\nfor var_3 in sys.stdin:\n if int(var_3) == 0:\n break\n var_4 = 1000 - int(var_3)\n var_1 = 0\n while var_4 != 0:\n for var_3 in range(len(var_2)):\n if var_4 >= var_2[var_3]:\n var_4 = var_4 - var_2[var_3]\n break\n var_1 += 1\n print(var_1)\n", "slow_time": 2345161326, "fast_time": 29209863, "speedup": 80.2866, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_1"} -{"pair_id": "python_5626", "problem_id": "p03039", "language": "python", "slow_code": "from collections import defaultdict\n\nvar_8 = 10**9 + 7\nvar_7 = defaultdict(int)\n\n\ndef func_1(var_9, var_10):\n if (var_9, var_10) in var_7:\n return var_7[(var_9, var_10)]\n if var_9 < var_10 or var_10 < 0:\n return 0\n if var_10 > var_9 - var_10:\n return func_1(var_9, var_9 - var_10)\n var_11 = (\n var_3[var_9]\n * pow(var_3[var_9 - var_10], var_8 - 2, var_8)\n * pow(var_3[var_10], var_8 - 2, var_8)\n % var_8\n )\n var_7[(var_9, var_10)] = var_11\n return var_11\n\n\nvar_9, var_6, var_5 = list(map(int, input().split()))\nvar_3 = [1]\nfor var_4 in range(1, 2 * 10**5 + 1):\n var_3.append(var_3[-1] * var_4 % var_8)\nvar_1 = 0\nfor var_2 in range(1, var_6):\n var_1 += var_2 * (var_6 - var_2) * var_9**2\n var_1 %= var_8\nfor var_2 in range(1, var_9):\n var_1 += var_2 * (var_9 - var_2) * var_6**2\n var_1 %= var_8\nvar_1 *= func_1(var_9 * var_6 - 2, var_5 - 2)\nvar_1 %= var_8\nprint(var_1)\n", "fast_code": "\"\"\"\"\"\"\n\n\ndef func_2(var_13):\n return pow(var_13, var_3 - 2, var_3)\n\n\ndef func_1(var_10, var_12):\n var_12 = min(var_12, var_10 - var_12)\n if var_12 == 0:\n return 1\n if var_12 == 1:\n return var_10\n var_7 = 1\n for var_9 in range(var_10, var_10 - var_12, -1):\n var_7 = (var_7 * var_9) % var_3\n\n var_6 = 1\n for var_9 in range(2, var_12 + 1):\n var_6 = (var_6 * var_9) % var_3\n\n return (var_7 * func_2(var_6)) % var_3\n\n\nvar_3 = 10**9 + 7\nvar_4, var_2, var_1 = list(map(int, input().split()))\nvar_5 = 0\nfor var_8 in range(var_2):\n var_5 += var_8 * (var_2 - var_8) * var_4**2\nfor var_8 in range(var_4):\n var_5 += var_8 * (var_4 - var_8) * var_2**2\nvar_11 = func_1(var_4 * var_2 - 2, var_1 - 2)\nvar_5 = (var_5 * var_11) % var_3\nprint(var_5)\n", "slow_time": 16316171922, "fast_time": 136678666, "speedup": 119.3761, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_1"} -{"pair_id": "python_6067", "problem_id": "p03008", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(100000)\nvar_9 = sys.stdin.readline\n\n\ndef func_7():\n return int(var_9())\n\n\ndef func_8():\n return list(map(int, var_9().split()))\n\n\ndef func_5():\n return float(var_9())\n\n\ndef func_6():\n return list(map(float, var_9().split()))\n\n\ndef func_9():\n return var_9().strip()\n\n\ndef func_10():\n return list(map(str, var_9().split()))\n\n\ndef func_1(*var_4):\n print(*var_4, file=sys.stderr)\n\n\ndef func_4(func_2):\n import time\n\n def func_12(*var_4, **var_10):\n var_12 = time.time()\n var_11 = func_2(*var_4, **var_10)\n var_6 = time.time()\n func_1(var_6 - var_12, \"sec\")\n return var_11\n\n return func_12\n\n\n@func_4\ndef func_11(var_2, var_1):\n def func_2(var_2, var_7):\n var_5 = [[0] * (var_2 + 1) for _ in range(4)]\n for var_8 in range(3):\n var_14 = var_7[1][var_8] - var_7[0][var_8]\n var_3 = var_7[0][var_8]\n if var_14 > 0:\n for var_15 in range(var_2 + 1):\n var_5[var_8 + 1][var_15] = var_5[var_8][var_15]\n if var_15 >= var_3:\n var_5[var_8 + 1][var_15] = max(\n var_5[var_8][var_15],\n var_5[var_8 + 1][var_15 - var_3] + var_14,\n )\n else:\n var_5[var_8 + 1] = var_5[var_8]\n return var_5[3][var_2] + var_2\n\n var_13 = func_2(var_2, var_1)\n\n var_1[0], var_1[1] = var_1[1], var_1[0]\n return func_2(var_13, var_1)\n\n\ndef func_3():\n var_2 = func_7()\n var_1 = [func_8() for _ in range(2)]\n print(func_11(var_2, var_1))\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "import sys\n\nvar_8 = sys.stdin.readline\nvar_10 = int(eval(var_8()))\nvar_1 = tuple(map(int, var_8().split()))\nvar_2 = tuple(map(int, var_8().split()))\n\n\ndef func_1(var_10):\n var_6 = list(range(var_10 + 1))\n for var_3, var_5 in zip(var_1, var_2):\n if var_5 <= var_3:\n continue\n for var_7 in range(var_10 + 1):\n if var_7 - var_3 >= 0:\n var_6[var_7] = max(var_6[var_7], var_6[var_7 - var_3] + var_5)\n return max(var_6)\n\n\nvar_9 = func_1(var_10)\nvar_1, var_2 = var_2, var_1\nvar_4 = func_1(var_9)\nprint(var_4)\n", "slow_time": 158385503, "fast_time": 52459115, "speedup": 3.0192, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_19"} -{"pair_id": "python_7186", "problem_id": "p02683", "language": "python", "slow_code": "import numpy as np\n\nvar_5, var_4, var_7 = list(map(int, input().split()))\nvar_2 = []\nvar_1 = []\nfor var_11 in range(var_5):\n var_10 = 0\n var_8 = []\n var_10, *var_8 = list(map(int, input().split()))\n var_2.append(var_10)\n var_1.append(var_8)\nvar_1 = np.array(var_1)\nvar_12 = float(\"inf\")\nvar_13 = var_12\nfor var_9 in range(1 << var_5):\n var_3 = 0\n var_6 = np.zeros(var_4)\n for var_11 in range(var_5):\n if (var_9 >> var_11) & 1:\n var_3 += var_2[var_11]\n var_6 += var_1[var_11]\n var_6 = var_6.tolist()\n\n if min(var_6) >= var_7 and var_3 <= var_13:\n var_13 = var_3\nif var_13 == var_12:\n print(\"-1\")\nelse:\n print(var_13)\n\"\"\"\"\"\"\n", "fast_code": "import sys\nimport math\nimport decimal\nimport itertools\nfrom itertools import product\nfrom functools import reduce\n\n\ndef func_1():\n return sys.stdin.readline()[:-1]\n\n\ndef func_2():\n var_3, var_2, var_4 = list(map(int, func_1().split()))\n var_1 = [list(map(int, func_1().split())) for _ in range(var_3)]\n var_7 = 10**18\n\n var_5 = var_7\n for var_6 in product([0, 1], repeat=var_3):\n var_11 = True\n for var_8 in range(1, var_2 + 1):\n var_12 = 0\n for var_10 in range(var_3):\n if var_6[var_10] == 1:\n var_12 += var_1[var_10][var_8]\n if var_12 < var_4:\n var_11 = False\n break\n if var_11:\n var_9 = 0\n for var_10 in range(var_3):\n if var_6[var_10] == 1:\n var_9 += var_1[var_10][0]\n var_5 = min(var_5, var_9)\n if var_5 == var_7:\n print((-1))\n else:\n print(var_5)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "slow_time": 854153208, "fast_time": 171032725, "speedup": 4.9941, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_24"} -{"pair_id": "python_11966", "problem_id": "p02716", "language": "python", "slow_code": "var_7 = int(eval(input()))\nvar_5 = list(map(int, input().split()))\nvar_1 = [0]\nvar_2 = [0]\nfor var_6 in range(var_7):\n if var_6 % 2 == 0:\n var_1.append(var_1[-1] + var_5[var_6])\n var_2.append(var_2[-1] + 0)\n else:\n var_1.append(var_1[-1] + 0)\n var_2.append(var_2[-1] + var_5[var_6])\nif var_7 % 2 == 0:\n var_4 = max(var_1[var_7 - 1] - var_1[0], var_2[var_7] - var_2[1])\n for var_6 in range(1, var_7 + 1, 2):\n if var_6 + 3 > var_7:\n continue\n var_8 = (var_1[var_6] - var_1[0]) + (var_2[var_7] - var_2[var_6 + 2])\n var_4 = max(var_4, var_8)\nelse:\n var_4 = max(\n var_1[var_7 - 2] - var_1[0],\n var_2[var_7 - 1] - var_2[1],\n var_1[var_7] - var_1[2],\n )\n for var_6 in range(1, var_7 + 1, 2):\n if var_6 + 3 > var_7 - 1:\n continue\n var_8 = (var_1[var_6] - var_1[0]) + (var_2[var_7 - 1] - var_2[var_6 + 2])\n var_4 = max(var_4, var_8)\n for var_6 in range(2, var_7 + 1, 2):\n if var_6 + 3 > var_7:\n continue\n var_8 = (var_2[var_6] - var_2[1]) + (var_1[var_7] - var_1[var_6 + 2])\n var_4 = max(var_4, var_8)\n for var_6 in range(1, var_7 + 1, 2):\n if var_6 + 4 > var_7:\n continue\n var_8 = (var_1[var_6] - var_1[0]) + (var_1[var_7] - var_1[var_6 + 3])\n var_4 = max(var_4, var_8)\n var_3 = [-(10**18)]\n for var_6 in range(1, var_7 + 1):\n if var_6 + 2 > var_7:\n var_3.append(-(10**18))\n else:\n if var_6 % 2 == 0:\n var_3.append(var_2[var_6] + var_1[var_7] - var_1[var_6 + 2])\n else:\n var_3.append(-(10**18))\n for var_6 in range(var_7 - 1, -1, -1):\n var_3[var_6] = max(var_3[var_6], var_3[var_6 + 1])\n for var_6 in range(1, var_7 + 1, 2):\n if var_6 + 6 > var_7:\n continue\n var_8 = (var_1[var_6] - var_1[0] - var_2[var_6 + 2]) + var_3[var_6 + 3]\n var_4 = max(var_4, var_8)\nprint(var_4)\n", "fast_code": "var_3 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = 10**18\nvar_5 = 0\nvar_6 = -var_2\nvar_7 = -var_2\nfor var_8, var_4 in enumerate(var_1):\n if var_8 % 2 == 0:\n var_6 = max(var_6, var_5)\n var_5 += var_4\n var_7 += var_4\n else:\n var_7 = max(var_7, var_6)\n var_6 += var_4\nif var_3 % 2 == 1:\n print((max(var_6, var_7)))\nelse:\n print((max(var_5, var_6)))\n", "slow_time": 152776680, "fast_time": 41511520, "speedup": 3.6803, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_1"} -{"pair_id": "python_17350", "problem_id": "p02555", "language": "python", "slow_code": "def func_1():\n var_1 = 10**9 + 7\n var_2 = int(eval(input()))\n var_3 = [0] * (var_2 + 1)\n var_3[0] = 1\n for var_5 in range(var_2 + 1):\n for var_4 in range(3, var_2 + 1):\n var_3[var_5] += var_3[var_5 - var_4]\n var_3[var_5] %= var_1\n print((var_3[var_2]))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_15 = int(eval(input()))\nvar_16 = var_15 // 3\n\n\ndef func_1(var_8, var_13):\n if var_8 - var_13 < var_13:\n var_13 = var_8 - var_13\n if var_13 == 0:\n return 1\n if var_13 == 1:\n return var_8\n var_9 = [var_8 - var_13 + var_7 + 1 for var_7 in range(var_13)]\n var_5 = [var_7 + 1 for var_7 in range(var_13)]\n for var_11 in range(2, var_13 + 1):\n var_12 = var_5[var_11 - 1]\n if var_12 > 1:\n var_10 = (var_8 - var_13) % var_11\n for var_7 in range(var_11 - 1, var_13, var_11):\n var_9[var_7 - var_10] /= var_12\n var_5[var_7] /= var_12\n var_14 = 1\n for var_7 in range(var_13):\n if var_9[var_7] > 1:\n var_14 *= int(var_9[var_7])\n return var_14\n\n\nvar_3 = 0\nfor var_6 in range(var_16):\n var_1 = var_6 + 1\n var_2 = var_15 - 3 * var_1\n var_4 = func_1(var_2 + var_1 - 1, var_1 - 1)\n var_3 += var_4\nprint((var_3 % (10**9 + 7)))\n", "slow_time": 2132701628, "fast_time": 405576047, "speedup": 5.2585, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_8"} -{"pair_id": "python_12764", "problem_id": "p02703", "language": "python", "slow_code": "from scipy.sparse import *\n\n(var_13, var_12, var_14, *var_2), *var_15 = [\n list(map(int, var_15.split())) for var_15 in open(0)\n]\nvar_3, var_1 = [], []\nfor var_16, var_17, var_4, var_5 in var_15[:var_12]:\n for var_10 in range(2501 - var_4):\n var_3 += (var_10 + var_4) * 51 + var_16, (var_10 + var_4) * 51 + var_17\n var_1 += var_10 * 51 + var_17, var_10 * 51 + var_16\n var_2 += var_5, var_5\nfor var_10, (var_6, var_9) in enumerate(var_15[var_12:], 1):\n for var_11 in range(2501 - var_6):\n var_3 += (var_11 * 51 + var_10,)\n var_1 += ((var_11 + var_6) * 51 + var_10,)\n var_2 += (var_9,)\nvar_9 = var_7.dijkstra(\n var_8((var_2, (var_3, var_1)), [8**6] * 2), 1, min(2500, var_14) * 51 + 1\n)\nfor var_10 in range(2, var_13 + 1):\n print((int(min(var_9[var_10::51]))))\n", "fast_code": "def func_2():\n import heapq\n\n var_14, var_13, var_17 = list(map(int, input().split()))\n if var_17 >= 2500:\n var_17 = 2499\n var_10 = [[] for _ in range(var_14)]\n for _ in range(var_13):\n var_11, var_19, var_7, var_18 = list(map(int, input().split()))\n var_10[var_11 - 1].append((var_19 - 1, var_7, var_18))\n var_10[var_19 - 1].append((var_11 - 1, var_7, var_18))\n var_5 = []\n for var_12 in range(var_14):\n var_6, var_18 = list(map(int, input().split()))\n var_5.append((var_6, var_18))\n var_2 = float(\"INF\")\n var_1 = [[var_2] * 2500 for _ in range(var_14)]\n var_1[0][var_17] = 0\n var_4 = [var_2] * var_14\n\n def func_3(var_16, var_6, var_18):\n if var_6 < 0:\n return\n if var_18 >= var_1[var_16][var_6]:\n return\n heapq.heappush(var_20, (var_18, var_16, var_6))\n var_1[var_16][var_6] = var_18\n\n def func_1(var_16, var_8, var_9):\n var_6, var_18 = var_5[var_16]\n var_15 = var_8 + var_6\n if var_15 >= 2500:\n var_15 = 2499\n func_3(var_16, var_15, var_9 + var_18)\n\n var_20 = [(0, 0, var_17)]\n while var_20:\n var_9, var_16, var_8 = heapq.heappop(var_20)\n if var_9 > var_1[var_16][var_8]:\n continue\n if var_9 < var_4[var_16]:\n var_4[var_16] = var_9\n func_1(var_16, var_8, var_9)\n for var_19, var_7, var_18 in var_10[var_16]:\n func_3(var_19, var_8 - var_7, var_9 + var_18)\n for var_3 in var_4[1:]:\n print(var_3)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "slow_time": 28226146294, "fast_time": 5170756056, "speedup": 5.4588, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_7"} -{"pair_id": "python_14296", "problem_id": "p03609", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_1, var_2 = func_6()\nprint((max(0, var_1 - var_2)))\n", "fast_code": "def func_1():\n var_2, var_1 = list(map(int, input().split()))\n print((max(0, var_2 - var_1)))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 52898444, "fast_time": 16647787, "speedup": 3.1775, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_5"} -{"pair_id": "python_14338", "problem_id": "p03025", "language": "python", "slow_code": "class Class_1:\n \"\"\"\"\"\"\n\n def __init__(self, var_11, var_1):\n self.fact = [1]\n for var_9 in range(1, var_11 + 1):\n self.fact.append(self.fact[-1] * var_9 % var_1)\n self.inv_fact = [0] * (var_11 + 1)\n self.inv_fact[var_11] = pow(self.fact[var_11], var_1 - 2, var_1)\n for var_9 in reversed(list(range(var_11))):\n self.inv_fact[var_9] = self.inv_fact[var_9 + 1] * (var_9 + 1) % var_1\n self.MOD = var_1\n\n def func_2(self, var_10):\n \"\"\"\"\"\"\n return self.fact[var_10]\n\n def func_3(self, var_10):\n \"\"\"\"\"\"\n return self.inv_fact[var_10]\n\n def func_4(self, var_10, var_14):\n \"\"\"\"\"\"\n if var_10 < var_14:\n return 0\n return (self.fact[var_10] * self.inv_fact[var_10 - var_14]) % self.MOD\n\n def func_1(self, var_10, var_14):\n \"\"\"\"\"\"\n if var_10 < var_14:\n return 0\n return (\n self.fact[var_10] * self.inv_fact[var_10 - var_14] * self.inv_fact[var_14]\n ) % self.MOD\n\n\nvar_11, var_2, var_5, var_6 = list(map(int, input().split()))\nvar_1 = 10**9 + 7\nvar_7 = Class_1(10**6, var_1)\nvar_12 = var_2 * pow(var_2 + var_5, var_1 - 2, var_1) % var_1\nvar_13 = var_5 * pow(var_2 + var_5, var_1 - 2, var_1) % var_1\nvar_8 = 100 * pow(100 - var_6, var_1 - 2, var_1) % var_1\nvar_3 = 0\nvar_15 = pow(var_12, var_11, var_1)\nfor var_9 in range(var_11):\n var_3 += (\n var_15\n * pow(var_13, var_9, var_1)\n * var_7.combination(var_11 - 1 + var_9, var_9)\n * (var_11 + var_9)\n * var_8\n )\n var_3 %= var_1\nvar_4 = 0\nvar_15 = pow(var_13, var_11, var_1)\nfor var_9 in range(var_11):\n var_4 += (\n var_15\n * pow(var_12, var_9, var_1)\n * var_7.combination(var_11 - 1 + var_9, var_9)\n * (var_11 + var_9)\n * var_8\n )\n var_4 %= var_1\nprint(((var_3 + var_4) % var_1))\n", "fast_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_3():\n return [int(var_15) for var_15 in sys.stdin.readline().split()]\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_5():\n return [list(var_15) for var_15 in sys.stdin.readline().split()]\n\n\ndef func_7():\n var_14 = list(sys.stdin.readline())\n if var_14[-1] == \"\\n\":\n return var_14[:-1]\n return var_14\n\n\ndef func_2(var_11):\n return [func_1() for var_7 in range(var_11)]\n\n\ndef func_4(var_11):\n return [func_3() for var_7 in range(var_11)]\n\n\ndef func_8(var_11):\n return [func_7() for var_7 in range(var_11)]\n\n\ndef func_6(var_11):\n return [func_5() for var_7 in range(var_11)]\n\n\nsys.setrecursionlimit(1000000)\nvar_10 = 1000000007\n\n\ndef func_10():\n def func_9(var_2, var_4):\n return var_6[var_2] * var_6[var_2 - var_4] * var_8[var_4] % var_10\n\n var_11, var_2, var_4, var_5 = func_3()\n var_9 = pow(100, var_10 - 2, var_10)\n var_2 = var_2 * var_9 % var_10\n var_4 = var_4 * var_9 % var_10\n var_5 = (1 - var_5 * var_9) % var_10\n var_5 = pow(var_5, var_10 - 2, var_10)\n var_6 = [1]\n var_1 = 200000\n for var_7 in range(1, var_1 + 1):\n var_6.append(var_6[-1] * var_7 % var_10)\n var_8 = [None] * (var_1 + 1)\n var_8[var_1] = pow(var_6[var_1], var_10 - 2, var_10)\n for var_7 in range(var_1)[::-1]:\n var_8[var_7] = var_8[var_7 + 1] * (var_7 + 1) % var_10\n var_3 = 0\n var_12 = pow(var_2, var_11, var_10)\n var_13 = pow(var_4, var_11, var_10)\n for var_7 in range(var_11):\n var_3 += (\n var_8[var_11 - 1]\n * var_8[var_7]\n * var_6[var_11 + var_7]\n * pow(var_5, var_11 + var_7 + 1, var_10)\n * (var_12 * pow(var_4, var_7, var_10) + var_13 * pow(var_2, var_7, var_10))\n % var_10\n )\n var_3 %= var_10\n print(var_3)\n return\n\n\nif __name__ == \"__main__\":\n func_10()\n", "slow_time": 113802903802, "fast_time": 23352294045, "speedup": 4.8733, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_6"} -{"pair_id": "python_6747", "problem_id": "p02289", "language": "python", "slow_code": "import sys\n\n\ndef func_3(var_1, var_4):\n var_6 = var_4 * 2 + 1\n var_10 = var_4 * 2 + 2\n if var_6 < var_8:\n var_7 = var_6\n if var_10 < var_8 and var_1[var_10] > var_1[var_6]:\n var_7 = var_10\n if var_1[var_7] > var_1[var_4]:\n var_1[var_4], var_1[var_7] = var_1[var_7], var_1[var_4]\n func_3(var_1, var_7)\n\n\ndef func_2(var_2, var_5):\n global n\n var_2[var_8] = var_5\n var_8 += 1\n var_4 = var_8 - 1\n var_9 = (var_4 - 1) // 2\n while var_4 > 0 and var_2[var_4] > var_2[var_9]:\n var_2[var_4], var_2[var_9] = var_2[var_9], var_2[var_4]\n var_4 = var_9\n var_9 = (var_4 - 1) // 2\n\n\ndef func_1(var_2):\n global n\n if var_8 == 1:\n var_8 -= 1\n return var_2[0]\n var_3 = var_2[0]\n var_8 -= 1\n var_2[0] = var_2[var_8]\n var_4 = 0\n while True:\n var_6 = var_4 * 2 + 1\n var_10 = var_4 * 2 + 2\n if var_6 >= var_8:\n break\n var_7 = var_6\n if var_10 < var_8 and var_1[var_10] > var_1[var_6]:\n var_7 = var_10\n if var_1[var_7] > var_1[var_4]:\n var_1[var_4], var_1[var_7] = var_1[var_7], var_1[var_4]\n var_4 = var_7\n else:\n break\n return var_3\n\n\nvar_1 = [0] * 2000000\nvar_2 = []\nvar_8 = 0\nfor var_11 in sys.stdin:\n if var_11[2] == \"s\":\n func_2(var_1, int(var_11[7:]))\n elif var_11[2] == \"t\":\n var_2.append(func_1(var_1))\n else:\n break\nprint((\"\\n\".join(map(str, var_2))))\n", "fast_code": "from sys import stdin\n\nvar_4 = stdin.readline\nimport heapq\n\n\ndef func_1():\n var_1 = []\n while True:\n var_2 = var_4()\n if var_2[2] == \"t\":\n print((heapq.heappop(var_1)[1]))\n elif var_2[2] == \"s\":\n var_3 = int(var_2.split()[1])\n heapq.heappush(var_1, (-var_3, var_3))\n else:\n break\n\n\nfunc_1()\n", "slow_time": 170032903, "fast_time": 30127926, "speedup": 5.6437, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_0"} -{"pair_id": "python_10051", "problem_id": "p03222", "language": "python", "slow_code": "def func_1(var_9):\n for var_7 in range(var_3 - 2):\n var_8 = 0b11 << var_7\n if var_9 & var_8 == var_8:\n return False\n return True\n\n\ndef func_2(var_4, var_9):\n if var_4 != var_3 - 1 and var_9 & 1 << var_4 != 0:\n return var_4 + 1\n elif var_4 != 0 and var_9 & 1 << var_4 - 1 != 0:\n return var_4 - 1\n else:\n return var_4\n\n\nvar_1, var_3, var_2 = list(map(int, input().split()))\nvar_5 = [[0] * var_3 for var_6 in range(var_1 + 1)]\nvar_5[0][0] = 1\nfor var_6 in range(1, var_1 + 1):\n for var_9 in range(2 ** (var_3 - 1)):\n for var_10 in range(var_3):\n if func_1(var_9):\n var_5[var_6][func_2(var_10, var_9)] += var_5[var_6 - 1][var_10]\n var_5[var_6][func_2(var_10, var_9)] %= 1000000007\nprint((var_5[var_1][var_2 - 1]))\n", "fast_code": "var_3 = 10**9 + 7\nvar_1, var_4, var_2 = list(map(int, input().split()))\nvar_6 = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n\n\ndef func_1(var_7):\n return var_6[var_7 + 2]\n\n\nvar_10, var_9, var_11 = [0] * var_4, [0] * var_4, [0] * var_4\nfor var_8 in range(var_4):\n var_9[var_8] = func_1(var_8 - 1) * func_1(var_4 - 1 - var_8 - 1)\n var_10[var_8] = func_1(var_8 - 2) * func_1(var_4 - 1 - var_8 - 1)\n var_11[var_8] = func_1(var_8 - 1) * func_1(var_4 - 1 - var_8 - 2)\nvar_5 = [[0] * var_4 for _ in range(var_1 + 1)]\nvar_5[0][0] = 1\nfor var_7 in range(var_1):\n for var_8 in range(var_4):\n var_5[var_7 + 1][var_8] += var_5[var_7][var_8] * var_9[var_8]\n if var_8 > 0:\n var_5[var_7 + 1][var_8 - 1] += var_5[var_7][var_8] * var_10[var_8]\n if var_8 < var_4 - 1:\n var_5[var_7 + 1][var_8 + 1] += var_5[var_7][var_8] * var_11[var_8]\n for var_8 in range(var_4):\n var_5[var_7 + 1][var_8] %= var_3\nprint((var_5[var_1][var_2 - 1]))\n", "slow_time": 1071172743, "fast_time": 79770414, "speedup": 13.4282, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_6"} -{"pair_id": "python_1151", "problem_id": "p02889", "language": "python", "slow_code": "import sys\n\nvar_11 = sys.stdin.readline\nvar_3, var_2, var_1 = (int(var_10) for var_10 in var_11().split())\nimport numpy as np\nfrom scipy.sparse.csgraph import floyd_warshall\nfrom scipy.sparse import csr_matrix\n\nvar_9 = [[0] * var_3 for var_10 in range(var_3)]\nfor var_10 in range(var_2):\n var_5, var_6, var_7 = (int(var_10) for var_10 in var_11().split())\n var_9[var_5 - 1][var_6 - 1] = var_7\n var_9[var_6 - 1][var_5 - 1] = var_7\nvar_9 = csr_matrix(var_9)\nvar_8 = floyd_warshall(csgraph=var_9, directed=False)\nvar_13 = [[0] * var_3 for var_10 in range(var_3)]\nfor var_10 in range(var_3):\n for var_12 in range(var_3):\n if var_8[var_10][var_12] <= var_1:\n var_13[var_10][var_12] = 1\n var_13[var_12][var_10] = 1\nvar_9 = csr_matrix(var_13)\nvar_8 = floyd_warshall(csgraph=var_9, directed=False)\nvar_4 = int(eval(var_11()))\nfor var_10 in range(var_4):\n var_14, var_15 = (int(var_10) for var_10 in var_11().split())\n if var_8[var_14 - 1][var_15 - 1] == float(\"inf\"):\n print(\"-1\")\n else:\n print((int(var_8[var_14 - 1][var_15 - 1] - 1)))\n", "fast_code": "def func_2(var_7, var_12):\n for var_4 in range(var_12):\n for var_5 in range(var_12):\n for var_6 in range(var_12):\n var_7[var_5][var_6] = min(\n var_7[var_5][var_6], var_7[var_5][var_4] + var_7[var_4][var_6]\n )\n return var_7\n\n\ndef func_1():\n var_12, var_11, var_7 = list(map(int, input().split()))\n var_8 = [[10**15 for var_4 in range(var_12)] for var_4 in range(var_12)]\n for _ in range(var_11):\n var_1, var_2, var_3 = list(map(int, input().split()))\n var_8[var_1 - 1][var_2 - 1] = var_3\n var_8[var_2 - 1][var_1 - 1] = var_3\n var_8 = func_2(var_8, var_12)\n var_9 = [[10**4 for var_4 in range(var_12)] for var_4 in range(var_12)]\n for var_4 in range(var_12):\n for var_5 in range(var_12):\n if var_8[var_4][var_5] <= var_7:\n var_9[var_4][var_5] = 1\n var_9 = func_2(var_9, var_12)\n var_13 = int(eval(input()))\n var_10 = []\n for _ in range(var_13):\n var_10.append(list(map(int, input().split())))\n for var_15 in var_10:\n var_14 = var_9[var_15[0] - 1][var_15[1] - 1]\n if var_14 == 10**4:\n print((-1))\n else:\n print((var_14 - 1))\n\n\nfunc_1()\n", "slow_time": 25162650789, "fast_time": 131266833, "speedup": 191.6908, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_4"} -{"pair_id": "python_14104", "problem_id": "p02244", "language": "python", "slow_code": "from itertools import product\nfrom copy import deepcopy, copy\n\n\nclass Class_1:\n def __init__(self):\n self.yoko = set()\n self.tate = set()\n self.naname1 = set()\n self.naname2 = set()\n self.MAP = [[\".\"] * 8 for _ in range(8)]\n\n def func_2(self, var_23, var_22):\n self.MAP[var_23][var_22] = \"Q\"\n self.yoko.add(var_23)\n self.tate.add(var_22)\n self.naname1.add(var_23 - var_22)\n self.naname2.add(var_22 + var_23)\n\n def func_4(self, var_23, var_22):\n if (\n var_23 in self.yoko\n or var_22 in self.tate\n or (var_23 - var_22) in self.naname1\n or (var_22 + var_23) in self.naname2\n ):\n return False\n return True\n\n def func_3(self):\n for var_13 in range(8):\n if not \"Q\" in self.MAP[var_13]:\n return False\n return True\n\n\ndef func_5(var_16, var_7, var_8):\n for var_13 in range(8):\n var_16[var_7][var_13] = \"1\"\n var_16[var_13][var_8] = \"1\"\n if var_7 + var_8 < 8:\n var_23 = var_7 + var_8\n var_22 = 0\n var_15 = var_7 + var_8 + 1\n else:\n var_23 = 7\n var_22 = var_7 + var_8 - 7\n var_15 = 15 - var_7 - var_8\n for var_13 in range(var_15):\n var_16[var_23 - var_13][var_22 + var_13] = \"1\"\n if var_7 <= var_8:\n var_20 = 0\n var_19 = var_8 - var_7\n var_15 = 8 - (var_8 + var_7)\n else:\n var_20 = var_7 - var_8\n var_19 = 0\n var_15 = 8 - (var_7 - var_8)\n for var_13 in range(var_15):\n var_16[var_20 + var_13][var_19 + var_13] = \"1\"\n return var_16\n\n\ndef func_6(var_4, var_3, var_18):\n var_10 = [(deepcopy(var_4), deepcopy(var_3), var_18)]\n while var_10:\n var_17, var_16, var_9 = var_10.pop()\n if var_9 == 8:\n var_12 = True\n for var_21 in range(8):\n if \"\".join(map(str, var_17[var_21])).find(\"0\"):\n var_12 = False\n break\n if var_12:\n return var_16\n for var_13 in range(8):\n for var_14 in range(8):\n if var_17[var_13][var_14] == \"0\":\n var_10.append(\n (\n func_5(deepcopy(var_17), var_13, var_14),\n deepcopy(var_16),\n var_9 + 1,\n )\n )\n return var_16\n\n\ndef func_1():\n var_11 = lambda var_2: \"\\n\".join(\"\".join(map(str, var_16)) for var_16 in var_2)\n var_6 = Class_1()\n var_18 = int(eval(input()))\n for _ in range(var_18):\n var_7, var_8 = list(map(int, input().split()))\n var_6.add(var_7, var_8)\n var_10 = [(deepcopy(var_6), var_18)]\n while var_10:\n var_5, var_9 = var_10.pop()\n if var_9 == 8:\n if var_5.allcheck():\n print((var_11(var_5.MAP)))\n break\n continue\n var_9 += 1\n for var_13 in range(8):\n for var_14 in range(8):\n if var_5.check(var_13, var_14):\n var_1 = deepcopy(var_5)\n var_1.add(var_13, var_14)\n var_10.append((var_1, var_9))\n\n\nfunc_1()\n", "fast_code": "from sys import stdin\n\nvar_2 = 8\nvar_1 = -1\nvar_3 = 1\nvar_13 = [var_1] * var_2\nvar_6 = [var_1] * var_2\nvar_8 = [var_1] * (2 * var_2 - 1)\nvar_7 = [var_1] * (2 * var_2 - 1)\nvar_4 = [[False] * var_2 for _ in range(var_2)]\nvar_11 = int(stdin.readline())\nfor _ in range(0, var_11):\n var_12, var_5 = list(map(int, stdin.readline().split()))\n var_4[var_12][var_5] = True\n\n\ndef func_1():\n for var_9 in range(0, var_2):\n for var_10 in range(0, var_2):\n if var_4[var_9][var_10] != 0 and var_13[var_9] != var_10:\n return\n for var_9 in range(0, var_2):\n print((\".\" * var_13[var_9] + \"Q\" + \".\" * (8 - var_13[var_9] - 1)))\n\n\ndef func_2(var_9):\n if var_9 == var_2:\n func_1()\n return\n for var_10 in range(0, var_2):\n if (\n var_3 == var_6[var_10]\n or var_3 == var_8[var_9 + var_10]\n or var_3 == var_7[var_9 - var_10 + var_2 - 1]\n ):\n continue\n var_13[var_9] = var_10\n var_6[var_10] = var_8[var_9 + var_10] = var_7[var_9 - var_10 + var_2 - 1] = (\n var_3\n )\n func_2(var_9 + 1)\n var_13[var_9] = var_6[var_10] = var_8[var_9 + var_10] = var_7[\n var_9 - var_10 + var_2 - 1\n ] = var_1\n\n\nfunc_2(0)\n", "slow_time": 22183403059, "fast_time": 803032199, "speedup": 27.6245, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_0"} -{"pair_id": "python_12513", "problem_id": "p03674", "language": "python", "slow_code": "var_12 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_11 = 10**9 + 7\nvar_4 = {}\nfor var_7 in range(var_12 + 1):\n if var_1[var_7] not in var_4:\n var_4[var_1[var_7]] = var_7\n else:\n var_10 = var_4[var_1[var_7]]\n var_13 = var_7\n break\n\n\ndef func_1(var_12, var_13, var_11):\n if var_13 < 0 or var_13 > var_12:\n return 0\n var_13 = min(var_13, var_12 - var_13)\n return var_5[var_12] * var_6[var_13] * var_6[var_12 - var_13] % var_11\n\n\nvar_11 = 10**9 + 7\nvar_2 = 10**6\nvar_5 = [1, 1]\nvar_6 = [1, 1]\nvar_8 = [0, 1]\nfor var_7 in range(2, var_2 + 1):\n var_5.append((var_5[-1] * var_7) % var_11)\n var_8.append((-var_8[var_11 % var_7] * (var_11 // var_7)) % var_11)\n var_6.append((var_6[-1] * var_8[-1]) % var_11)\nfor var_9 in range(1, var_12 + 2):\n var_3 = func_1(var_12 + 1, var_9, var_11) - func_1(\n var_10 + var_12 - var_13, var_9 - 1, var_11\n )\n print((var_3 % var_11))\n", "fast_code": "class Class_1:\n def __init__(self, var_2, var_13=10**9 + 7):\n var_5 = [1, 1]\n var_6 = [1, 1]\n var_8 = [0, 1]\n for var_7 in range(2, var_2):\n var_5.append(var_5[var_7 - 1] * var_7 % var_13)\n var_8.append(var_13 - var_8[var_13 % var_7] * (var_13 // var_7) % var_13)\n var_6.append(var_6[var_7 - 1] * var_8[var_7] % var_13)\n self.fac, self.finv, self.mod = var_5, var_6, var_13\n\n def func_1(self, var_14, var_9):\n if var_14 < var_9 or var_14 < 0 or var_9 < 0:\n return 0\n var_5, var_6, var_13 = self.fac, self.finv, self.mod\n return var_5[var_14] * (var_6[var_9] * var_6[var_14 - var_9] % var_13) % var_13\n\n\nvar_13 = 10**9 + 7\nvar_3, *var_1 = list(map(int, open(0).read().split()))\nvar_12 = Class_1(210000, mod=var_13)\nvar_16 = {}\nvar_10, var_15 = 0, 0\nfor var_7, var_4 in enumerate(var_1):\n if var_4 in var_16:\n var_15 = var_7\n var_10 = var_16[var_4]\n break\n var_16[var_4] = var_7\nvar_11 = var_10 + var_3 - var_15\nfor var_9 in range(1, var_3 + 2):\n print(((var_12.nCk(var_3 + 1, var_9) - var_12.nCk(var_11, var_9 - 1)) % var_13))\n", "slow_time": 157681417612, "fast_time": 20922270310, "speedup": 7.5365, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_20"} -{"pair_id": "python_2588", "problem_id": "p02660", "language": "python", "slow_code": "def func_1(var_8):\n var_3 = []\n var_10 = var_8\n for var_6 in range(2, int(-(-(var_8**0.5) // 1)) + 1):\n if var_10 % var_6 == 0:\n var_4 = 0\n while var_10 % var_6 == 0:\n var_4 += 1\n var_10 //= var_6\n var_3.append([var_6, var_4])\n if var_10 != 1:\n var_3.append([var_10, 1])\n if var_3 == []:\n var_3.append([var_8, 1])\n return var_3\n\n\ndef func_4():\n var_8 = int(eval(input()))\n return var_8\n\n\ndef func_3(var_8):\n var_4 = 0\n var_9 = var_8\n for var_6 in range(1, var_8 + 1):\n if var_9 >= var_6:\n var_4 += 1\n var_9 -= var_6\n\n return var_4\n\n\ndef func_2(var_8):\n var_2 = func_1(var_8)\n\n var_5 = 0\n for var_7 in var_2:\n if var_7[0] != 1:\n var_5 += func_3(var_7[1])\n return var_5\n\n\nif __name__ == \"__main__\":\n var_8 = func_4()\n var_1 = func_2(var_8)\n print(var_1)\n", "fast_code": "import numpy as np\nimport sys\n\n\ndef func_4(var_6=0):\n \"\"\"\"\"\"\n if var_6 == 0:\n var_10 = list(map(int, input().split()))\n if len(var_10) == 1:\n return var_10[0]\n elif len(var_10) > 1:\n return var_10\n else:\n var_10 = [list(map(int, input().split())) for _ in range(var_6)]\n return var_10\n\n\ndef func_2(var_6=0):\n \"\"\"\"\"\"\n if var_6 == 0:\n return [int(var_5) for var_5 in func_5()]\n else:\n return [[int(var_5) for var_5 in func_5()] for _ in range(var_6)]\n\n\ndef func_5(var_6=0):\n \"\"\"\"\"\"\n if var_6 == 0:\n var_10 = list(input().split())\n if len(var_10) == 1:\n return var_10[0]\n elif len(var_10) > 1:\n return var_10\n else:\n return [list(input().split()) for _ in range(var_6)]\n\n\ndef func_3(var_6=0):\n \"\"\"\"\"\"\n if var_6 == 0:\n return [var_9 for var_9 in func_5()]\n else:\n return [[var_9 for var_9 in func_5()] for _ in range(var_6)]\n\n\ndef func_1(var_1):\n if var_1 == 1:\n return [[var_1, 1]]\n else:\n var_11 = 2\n var_2 = []\n while var_11 < np.sqrt(var_1) + 1:\n var_6 = 0\n var_8 = [var_11]\n while var_1 % var_11 == 0:\n var_1 = int(var_1 / var_11)\n\n var_6 += 1\n var_3 = 1\n if var_6 != 0:\n var_8.append(var_6)\n var_2.append(var_8)\n var_11 += 1\n var_3 = 0\n if var_3 == 0 and var_1 != 1:\n var_2.append([var_1, 1])\n return var_2\n\n\nvar_6 = func_4()\nif var_6 == 1:\n print((0))\n sys.exit()\nelse:\n var_1 = func_1(var_6)\n var_3 = 0\n for var_7 in var_1:\n var_4 = 1\n while var_7[1] - var_4 > -1:\n var_7[1] -= var_4\n var_4 += 1\n var_3 += 1\n print(var_3)\n", "slow_time": 3527132862, "fast_time": 791363973, "speedup": 4.457, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_14"} -{"pair_id": "python_16976", "problem_id": "p03291", "language": "python", "slow_code": "import sys\n\nvar_9 = sys.stdin\nsys.setrecursionlimit(10**7)\n\n\ndef func_3():\n return list(map(int, var_9.readline().split()))\n\n\ndef func_4():\n return [int(var_11) - 1 for var_11 in var_9.readline().split()]\n\n\ndef func_2():\n return list(map(float, var_9.readline().split()))\n\n\ndef func_5():\n return var_9.readline().split()\n\n\ndef func_8():\n return var_9.readline().rstrip()\n\n\ndef func_1():\n return list(func_8())\n\n\ndef func_7():\n return int(var_9.readline())\n\n\ndef func_6():\n return float(var_9.readline())\n\n\nvar_7 = func_8()\nvar_10 = len(var_7)\nvar_2 = [0] * (var_10 + 1)\nvar_3 = [0] * (var_10 + 1)\nvar_4 = [0] * (var_10 + 1)\nvar_1 = 10**9 + 7\nvar_6 = 0\nfor var_5, var_8 in enumerate(var_7):\n if var_8 == \"A\":\n var_2[var_5 + 1] = var_2[var_5] + pow(3, var_6, var_1)\n var_3[var_5 + 1] = var_3[var_5]\n var_4[var_5 + 1] = var_4[var_5]\n elif var_8 == \"B\":\n var_2[var_5 + 1] = var_2[var_5]\n var_3[var_5 + 1] = var_3[var_5] + var_2[var_5]\n var_4[var_5 + 1] = var_4[var_5]\n elif var_8 == \"C\":\n var_2[var_5 + 1] = var_2[var_5]\n var_3[var_5 + 1] = var_3[var_5]\n var_4[var_5 + 1] = var_4[var_5] + var_3[var_5]\n elif var_8 == \"?\":\n var_2[var_5 + 1] = 3 * var_2[var_5] + pow(3, var_6, var_1)\n var_3[var_5 + 1] = 3 * var_3[var_5] + var_2[var_5]\n var_4[var_5 + 1] = 3 * var_4[var_5] + var_3[var_5]\n var_6 += 1\n var_2[var_5 + 1] %= var_1\n var_3[var_5 + 1] %= var_1\n var_4[var_5 + 1] %= var_1\nprint((var_4[var_10]))\n", "fast_code": "var_3 = 10**9 + 7\nvar_1 = [0, 0, 0, 1]\nfor var_4 in input()[::-1]:\n var_5 = var_1[:]\n var_1[3] = var_5[3] * 3 if var_4 == \"?\" else var_5[3]\n var_1[3] %= var_3\n for var_2 in range(2, -1, -1):\n var_1[var_2] = (\n var_5[var_2] * 3 + var_5[var_2 + 1]\n if var_4 == \"?\"\n else (\n var_5[var_2] + var_5[var_2 + 1]\n if var_4 == \"ABC\"[var_2]\n else var_5[var_2]\n )\n )\n var_1[var_2] %= var_3\nprint(var_1[0] % (10**9 + 7))\n", "slow_time": 131275853, "fast_time": 50114864, "speedup": 2.6195, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_20"} -{"pair_id": "python_6750", "problem_id": "p03801", "language": "python", "slow_code": "from collections import defaultdict\nimport sys\n\n\nclass Class_1:\n def __init__(self, var_15):\n self.n = var_15\n self.list = [0] * (var_15 + 1)\n\n def func_1(self, var_10, var_19):\n while var_10 <= self.n:\n self.list[var_10] += var_19\n var_10 += var_10 & -var_10\n\n def func_2(self, var_10):\n var_16 = 0\n while var_10 > 0:\n var_16 += self.list[var_10]\n var_10 -= var_10 & -var_10\n return var_16\n\n def func_3(self, var_10, var_11):\n return self.search(var_11) - self.search(var_10 - 1)\n\n\nvar_6 = int(eval(input()))\nvar_1 = [int(var_10) for var_10 in input().split()]\nvar_4 = sorted(set(var_1))\nvar_13 = defaultdict(int)\nfor var_10 in range(len(var_4)):\n var_13[var_10 + 1] = var_4[var_10]\nvar_9 = defaultdict(int)\nfor var_10 in range(len(var_4)):\n var_9[var_4[var_10]] = var_10 + 1\n\nvar_18 = [0] * var_6\nvar_18[0] = 1\nvar_16 = var_1[0]\nvar_5 = []\nvar_5.append(var_16)\nfor var_10 in range(1, var_6):\n if var_16 < var_1[var_10]:\n var_16 = var_1[var_10]\n var_5.append(var_16)\n var_18[var_10] = 1\nvar_2 = Class_1(var_6 + 1)\nvar_3 = Class_1(var_6 + 1)\nvar_11 = len(var_5) - 1\nvar_12 = var_9[var_5[var_11]]\nvar_14 = sum(var_1)\nvar_7 = [0] * var_6\nvar_8 = 0\nfor var_10 in range(var_6 - 1, -1, -1):\n if var_12 == var_9[var_1[0]]:\n break\n var_2.add(var_9[var_1[var_10]], var_1[var_10])\n var_3.add(var_9[var_1[var_10]], 1)\n if var_9[var_1[var_10]] == var_12 and var_18[var_10] == 1:\n var_7[var_10] = (\n var_2.suma(var_9[var_5[var_11 - 1]], var_6 + 1)\n - var_3.suma(var_9[var_5[var_11 - 1]], var_6 + 1) * var_5[var_11 - 1]\n - var_8\n )\n var_8 += var_7[var_10]\n\n var_11 -= 1\n var_12 = var_9[var_5[var_11]]\nvar_19 = var_14 - sum(var_7)\nvar_7[0] = var_19\n\nfor var_17 in var_7:\n print(var_17)\n", "fast_code": "import os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\nsys.setrecursionlimit(2147483647)\nvar_3 = float(\"inf\")\nvar_2 = 10**18\nvar_4 = 10**9 + 7\nvar_5 = int(sys.stdin.readline())\nvar_1 = list(map(int, sys.stdin.readline().split()))\nvar_6 = [(var_7, var_9) for var_9, var_7 in enumerate(var_1)]\nvar_6.sort(reverse=True)\n\nvar_8 = [0] * var_5\nvar_10 = var_2\nfor var_9, (var_11, var_13) in enumerate(var_6):\n var_10 = min(var_10, var_13)\n var_12 = var_6[var_9 + 1][0] if var_9 + 1 < var_5 else 0\n var_8[var_10] += (var_11 - var_12) * (var_9 + 1)\nprint(*var_8, sep=\"\\n\")\n", "slow_time": 155042231, "fast_time": 57634411, "speedup": 2.6901, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_1"} -{"pair_id": "python_15351", "problem_id": "p02780", "language": "python", "slow_code": "var_6, var_4 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_7 = {}\nvar_1 = 0\nfor var_3 in range(1, 1000 + 1):\n var_7[var_3] = (var_3 + 1) * 0.5\nif var_6 == 1:\n print((var_7[var_2[0]]))\n exit()\nvar_5 = [0 for _ in range(var_6)]\nvar_5[0] = var_7[var_2[0]]\nfor var_3 in range(var_6 - 1):\n if var_3 + 1 < var_4:\n var_5[var_3 + 1] = var_5[var_3] + var_7[var_2[var_3 + 1]]\n else:\n var_5[var_3 + 1] = (\n var_5[var_3] + var_7[var_2[var_3 + 1]] - var_7[var_2[var_3 - var_4 + 1]]\n )\n var_1 = max(var_1, var_5[var_3 + 1])\nprint(var_1)\n", "fast_code": "from collections import deque\n\nvar_3, var_2 = list(map(int, input().split()))\nvar_4 = list(map(int, input().split()))\nvar_1 = deque([])\nvar_5, var_9, var_6 = 0, 0, 0\nvar_8 = 0\nfor var_7 in range(var_3):\n var_6 += 1\n var_8 = (var_4[var_7] + 1) / 2\n var_1.append(var_8)\n var_9 += var_8\n if var_6 < var_2:\n continue\n if var_5 < var_9:\n var_5 = var_9\n var_9 -= var_1.popleft()\nprint(var_5)\n", "slow_time": 91479968, "fast_time": 25175494, "speedup": 3.6337, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_3"} -{"pair_id": "python_9031", "problem_id": "p03837", "language": "python", "slow_code": "var_6, var_5 = list(map(int, input().split()))\nvar_3 = [[float(\"inf\") for var_4 in range(var_6)] for var_4 in range(var_6)]\nvar_7 = [list(map(int, input().split())) for var_4 in range(var_5)]\nfrom scipy.sparse.csgraph import floyd_warshall\n\nfor var_8, var_9, var_1 in var_7:\n var_8, var_9 = var_8 - 1, var_9 - 1\n var_3[var_8][var_9] = var_3[var_9][var_8] = var_1\nvar_3 = floyd_warshall(var_3).tolist()\nvar_2 = 0\nfor var_8, var_9, var_1 in var_7:\n var_8, var_9 = var_8 - 1, var_9 - 1\n if var_3[var_8][var_9] != var_1:\n var_2 += 1\nprint(var_2)\n", "fast_code": "import heapq\n\nvar_12, var_11 = list(map(int, input().split()))\nvar_8 = [set() for _ in range(var_12)]\nvar_13 = dict()\nvar_3 = [0 for _ in range(var_11 + 1)]\nfor var_9 in range(var_11):\n var_2, var_4, var_5 = list(map(int, input().split()))\n var_14 = (var_2 - 1, var_4 - 1, var_5)\n var_13[var_9] = var_14\n var_8[var_2 - 1].add(var_9)\n var_8[var_4 - 1].add(var_9)\nfor var_10 in range(var_12):\n var_1 = [\n (0, 0, var_10, var_11),\n ]\n heapq.heapify(var_1)\n var_7 = [True for _ in range(var_12)]\n while var_1:\n var_6 = heapq.heappop(var_1)\n if var_7[var_6[2]]:\n var_7[var_6[2]] = False\n var_3[var_6[3]] = 1\n for var_9 in var_8[var_6[2]]:\n var_2, var_4, var_5 = var_13[var_9]\n if var_4 == var_6[2]:\n var_2, var_4 = var_4, var_2\n if var_7[var_4]:\n heapq.heappush(\n var_1, (var_6[0] + var_5, var_3[var_9], var_4, var_9)\n )\nprint((var_11 - (sum(var_3) - 1)))\n", "slow_time": 14535365898, "fast_time": 50189083, "speedup": 289.6121, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_28"} -{"pair_id": "python_9264", "problem_id": "p02558", "language": "python", "slow_code": "from networkx.utils import UnionFind\n\nvar_1, var_2 = list(map(int, input().split()))\nvar_6 = UnionFind()\nfor var_3 in range(var_2):\n var_4, var_5, var_7 = list(map(int, input().split()))\n if var_4:\n print((1 if var_6[var_5] == var_6[var_7] else 0))\n else:\n var_6.union(var_5, var_7)\n", "fast_code": "class Class_1:\n \"\"\"\"\"\"\n\n __slots__ = [\"_data_size\", \"_first_idx\", \"_parents\"]\n\n def __init__(self, var_4: int, var_5: bool = True) -> None:\n self._data_size = var_4\n self._first_idx = 0 if var_5 else 1\n self._parents = [-1] * (var_4 + self._first_idx)\n\n def _find(self, var_11: int) -> int:\n if self._parents[var_11] < 0:\n return var_11\n self._parents[var_11] = self._find(self._parents[var_11])\n return self._parents[var_11]\n\n def func_1(self, var_11: int, var_12: int) -> bool:\n \"\"\"\"\"\"\n return self._find(var_11) == self._find(var_12)\n\n def func_3(self, var_11: int, var_12: int) -> None:\n \"\"\"\"\"\"\n var_11, var_12 = self._find(var_11), self._find(var_12)\n if var_11 == var_12:\n return\n if self._parents[var_11] > self._parents[var_12]:\n var_11, var_12 = var_12, var_11\n self._parents[var_11] += self._parents[var_12]\n self._parents[var_12] = var_11\n\n\ndef func_2():\n\n var_1, var_2, *var_3 = list(map(int, open(0).read().split()))\n var_8 = Class_1(var_1)\n var_6 = []\n for var_7, var_9, var_10 in zip(*[iter(var_3)] * 3):\n if var_7:\n var_6.append(int(var_8.is_connected(var_9, var_10)))\n else:\n var_8.unite(var_9, var_10)\n print((\"\\n\".join(map(str, var_6))))\n\n\nif __name__ == \"__main__\":\n func_2()\n", "slow_time": 18058265902, "fast_time": 116057229, "speedup": 155.5979, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_9"} -{"pair_id": "python_5217", "problem_id": "p02729", "language": "python", "slow_code": "var_1, var_3 = list(map(int, input().split()))\nimport itertools\n\nvar_2 = len(list(itertools.combinations(list(range(var_1)), 2)))\nvar_4 = len(list(itertools.combinations(list(range(var_3)), 2)))\nprint((var_2 + var_4))\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = var_2 * (var_2 - 1) // 2 + var_1 * (var_1 - 1) // 2\nprint(var_3)\n", "slow_time": 272958752, "fast_time": 12713743, "speedup": 21.4696, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_11"} -{"pair_id": "python_8493", "problem_id": "p03448", "language": "python", "slow_code": "var_1 = int(eval(input()))\nvar_2 = int(eval(input()))\nvar_3 = int(eval(input()))\nvar_4 = int(eval(input()))\n_500 = 500\n_100 = 100\n_50 = 50\nvar_8 = 0\nfor var_5 in range(var_1 + 1):\n for var_6 in range(var_2 + 1):\n for var_7 in range(var_3 + 1):\n if var_4 - (var_5 * _500 + var_6 * _100 + var_7 * _50) == 0:\n var_8 = var_8 + 1\nprint(var_8)\n", "fast_code": "def func_1():\n var_4 = int(eval(input()))\n var_6 = int(eval(input()))\n var_7 = int(eval(input()))\n var_11 = int(eval(input()))\n var_5 = 0\n for var_8 in range(var_4 + 1):\n var_1 = var_8 * 500\n if var_1 > var_11:\n break\n for var_9 in range(var_6 + 1):\n var_2 = var_9 * 100\n if var_1 + var_2 > var_11:\n break\n for var_10 in range(var_7 + 1):\n var_3 = var_10 * 50\n if var_1 + var_2 + var_3 == var_11:\n var_5 += 1\n print(var_5)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "slow_time": 7957260660, "fast_time": 1402096297, "speedup": 5.6753, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_24"} -{"pair_id": "python_3417", "problem_id": "p02556", "language": "python", "slow_code": "var_6 = __import__(\"sys\").stdin.readline\n\n\ndef func_3(var_1, var_3):\n return abs(var_1[0] - var_3[0]) + abs(var_1[1] - var_3[1])\n\n\nvar_7 = int(eval(var_6()))\nvar_8 = []\nfor _ in range(var_7):\n var_8.append([*list(map(int, var_6().split()))])\nvar_2 = 0\nvar_9 = sorted(var_8)\nvar_10 = sorted(var_8, key=lambda var_11: var_11[1])\nvar_2 = max(var_2, func_3(var_9[-1], var_9[-2]))\nvar_2 = max(var_2, func_3(var_9[0], var_9[1]))\nvar_2 = max(var_2, func_3(var_10[-1], var_10[-2]))\nvar_2 = max(var_2, func_3(var_10[0], var_10[1]))\n\n\ndef func_1(var_11):\n return var_11[0] + var_11[1]\n\n\ndef func_2(var_11):\n return var_11[0] - var_11[1]\n\n\nvar_4 = sorted(var_8, key=func_1)\nvar_5 = sorted(var_8, key=func_2)\nvar_2 = max(var_2, func_3(var_4[0], var_4[-1]))\nvar_2 = max(var_2, func_3(var_4[0], var_4[1]))\nvar_2 = max(var_2, func_3(var_4[-1], var_4[-2]))\nvar_2 = max(var_2, func_3(var_5[0], var_5[-1]))\nvar_2 = max(var_2, func_3(var_5[0], var_5[1]))\nvar_2 = max(var_2, func_3(var_5[-1], var_5[-2]))\n\n\ndef func_1(var_11):\n return abs(var_11[0] + var_11[1])\n\n\ndef func_2(var_11):\n return abs(var_11[0] - var_11[1])\n\n\nvar_4 = sorted(var_8, key=func_1)\nvar_5 = sorted(var_8, key=func_2)\nvar_2 = max(var_2, func_3(var_4[0], var_4[-1]))\nvar_2 = max(var_2, func_3(var_4[0], var_4[1]))\nvar_2 = max(var_2, func_3(var_4[-1], var_4[-2]))\nvar_2 = max(var_2, func_3(var_5[0], var_5[-1]))\nvar_2 = max(var_2, func_3(var_5[0], var_5[1]))\nvar_2 = max(var_2, func_3(var_5[-1], var_5[-2]))\nprint(var_2)\n", "fast_code": "import sys\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\nvar_3 = func_1()\nvar_1, var_2 = [], []\nfor var_4 in range(var_3):\n var_5, var_6 = func_2()\n var_1.append(var_5 + var_6)\n var_2.append(var_5 - var_6)\nprint((max(max(var_1) - min(var_1), max(var_2) - min(var_2))))\n", "slow_time": 146157102, "fast_time": 34955603, "speedup": 4.1812, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_12"} -{"pair_id": "python_2274", "problem_id": "p02700", "language": "python", "slow_code": "from math import floor, ceil, sqrt, factorial, log\nfrom collections import Counter, deque\nfrom functools import reduce\n\n\ndef func_11():\n return eval(input())\n\n\ndef func_2():\n return int(eval(input()))\n\n\ndef func_10():\n return list(map(str, input().split()))\n\n\ndef func_9():\n return list(map(int, input().split()))\n\n\ndef func_1():\n return [int(var_5) for var_5 in input().split()]\n\n\ndef func_8():\n return list(func_10())\n\n\ndef func_3():\n return list(func_9())\n\n\ndef func_6():\n return [list(map(str, var_6.split())) for var_6 in eval(input())]\n\n\ndef func_4():\n return [list(map(int, var_6.split())) for var_6 in eval(input())]\n\n\ndef func_7(var_7: int):\n return [func_8() for _ in range(var_7)]\n\n\ndef func_5(var_7: int):\n return [func_3() for _ in range(var_7)]\n\n\nvar_1, var_2, var_3, var_4 = func_9()\nvar_8 = -(-var_1 // var_4)\nvar_9 = -(-var_3 // var_2)\nif var_8 >= var_9:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "var_1, var_2, var_3, var_4 = list(map(int, input().split()))\nprint((\"No\" if -var_1 // var_4 > -var_3 // var_2 else \"Yes\"))\n", "slow_time": 100220167, "fast_time": 12330251, "speedup": 8.128, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_1"} -{"pair_id": "python_4308", "problem_id": "p03264", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_1 = func_1()\nvar_2 = var_1 // 2\nvar_3 = var_1 - var_2\nprint((var_2 * var_3))\n", "fast_code": "var_1 = int(eval(input()))\nprint(((var_1 // 2) * ((var_1 + 1) // 2)))\n", "slow_time": 49070072, "fast_time": 10503148, "speedup": 4.6719, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_25"} -{"pair_id": "python_244", "problem_id": "p03061", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools\nimport random\n\nsys.setrecursionlimit(10**7)\nvar_9 = 10**20\nvar_7 = 1.0 / 10**10\nvar_13 = 10**9 + 7\nvar_5 = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nvar_6 = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef func_4():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_5():\n return [int(var_21) - 1 for var_21 in sys.stdin.readline().split()]\n\n\ndef func_3():\n return [float(var_21) for var_21 in sys.stdin.readline().split()]\n\n\ndef func_6():\n return sys.stdin.readline().split()\n\n\ndef func_2():\n return int(sys.stdin.readline())\n\n\ndef func_1():\n return float(sys.stdin.readline())\n\n\ndef func_7():\n return input()\n\n\ndef func_11(var_18):\n return print(var_18, flush=True)\n\n\nclass Class_1:\n def __init__(self, var_14):\n self.M = var_12 = int(math.sqrt(var_14)) + 10\n self.A = var_1 = [True] * var_12\n var_1[0] = var_1[1] = False\n self.T = var_19 = []\n for var_8 in range(2, int(math.sqrt(var_12)) + 1):\n if not var_1[var_8]:\n continue\n var_19.append(var_8)\n for var_10 in range(var_8 * var_8, var_12, var_8):\n var_1[var_10] = False\n\n def func_9(self, var_14):\n return self.A[var_14]\n\n def func_8(self, var_14):\n var_4 = collections.defaultdict(int)\n for var_3 in self.T:\n while var_14 % var_3 == 0:\n var_4[var_3] += 1\n var_14 //= var_3\n if var_14 < 2:\n break\n if var_14 > 1:\n var_4[var_14] += 1\n return var_4.items()\n\n def func_12(self, var_14):\n var_17 = 1\n for var_11, var_20 in self.division(var_14):\n var_19 = 1\n for var_8 in range(1, var_20 + 1):\n var_19 += math.pow(var_11, var_8)\n var_17 *= var_19\n return var_17\n\n\ndef func_10():\n var_14 = func_2()\n var_1 = sorted(func_4())\n var_16 = Class_1(10**9)\n var_15 = collections.defaultdict(int)\n for var_2 in var_1:\n var_17 = [1]\n for var_11, var_20 in var_16.division(var_2):\n for var_3 in var_17[:]:\n for var_8 in range(1, var_20 + 1):\n var_17.append(var_3 * (var_11**var_8))\n for var_11 in var_17:\n var_15[var_11] += 1\n var_17 = 1\n for var_11, var_20 in var_15.items():\n if var_20 >= var_14 - 1 and var_17 < var_11:\n var_17 = var_11\n return var_17\n\n\nprint(func_10())\n", "fast_code": "var_4 = int(eval(input()))\nvar_1 = [int(var_6) for var_6 in input().split()]\n\n\ndef func_1(var_7, var_8):\n if var_7 < var_8:\n var_7, var_8 = var_8, var_7\n if var_8 == 0:\n return var_7\n return func_1(var_7 % var_8, var_8)\n\n\nvar_2 = [0]\nvar_5 = [0]\nfor var_6 in range(var_4):\n var_2.append(func_1(var_1[var_6], var_2[var_6]))\n var_5.append(func_1(var_1[-var_6 - 1], var_5[var_6]))\nvar_5.reverse()\nvar_3 = []\nfor var_6 in range(0, var_4):\n var_3.append(func_1(var_2[var_6], var_5[var_6 + 1]))\nprint((max(var_3)))\n", "slow_time": 1034266124, "fast_time": 51394366, "speedup": 20.1241, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_27"} -{"pair_id": "python_595", "problem_id": "p02793", "language": "python", "slow_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nvar_11 = 10**9 + 7\nvar_6 = float(\"inf\")\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef func_3(var_12):\n var_3 = []\n var_14 = var_12\n for var_5 in range(2, int(-(-(var_12**0.5) // 1)) + 1):\n if var_14 % var_5 == 0:\n var_4 = 0\n while var_14 % var_5 == 0:\n var_4 += 1\n var_14 //= var_5\n var_3.append((var_5, var_4))\n if var_14 != 1:\n var_3.append((var_14, 1))\n if var_3 == []:\n var_3.append((var_12, 1))\n return var_3\n\n\nvar_12 = func_1()\nvar_1 = func_2()\nvar_10 = [0] * (10**6 + 1)\nfor var_5 in var_1:\n var_9 = func_3(var_5)\n for var_7, var_8 in var_9:\n var_10[var_7] = max(var_10[var_7], var_8)\nvar_13 = 1\nfor var_5 in range(1, 10**6 + 1):\n if var_10[var_5] != 0:\n var_13 = var_13 * (var_5 ** var_10[var_5]) % var_11\nvar_2 = 0\nfor var_5 in var_1:\n var_2 += var_13 * pow(var_5, var_11 - 2, var_11) % var_11\n var_2 %= var_11\nprint(var_2)\n", "fast_code": "from functools import reduce\n\nvar_1 = 10**9 + 7\n\n\ndef func_1(var_2, var_4):\n while var_4:\n var_2, var_4 = var_4, var_2 % var_4\n return var_2\n\n\ndef func_3(var_9, var_10):\n return (var_9 * var_10) // func_1(var_9, var_10)\n\n\ndef func_2(var_8):\n return reduce(func_1, var_8)\n\n\ndef func_4(var_8):\n return reduce(func_3, var_8)\n\n\nvar_7 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nvar_6 = func_4(var_2)\nvar_4 = list([var_6 // var_9 for var_9 in var_2])\nvar_3 = 0\nfor var_5 in range(len(var_4)):\n var_3 += var_4[var_5]\nprint((var_3 % var_1))\n", "slow_time": 23832997042, "fast_time": 32080020, "speedup": 742.9234, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_21"} -{"pair_id": "python_10523", "problem_id": "p02657", "language": "python", "slow_code": "import numpy as np\nimport scipy as sp\nimport math\n\nvar_1, var_3 = list(map(str, input().split()))\nvar_1 = int(var_1)\nvar_3 = int(float(var_3) * 100.001)\nvar_2 = int(var_1 * var_3 // 100)\nprint(var_2)\n", "fast_code": "var_1, var_2 = list(map(float, input().split()))\nprint((int(var_1 * var_2 // 1)))\n", "slow_time": 601968667, "fast_time": 7679828, "speedup": 78.3831, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_15"} -{"pair_id": "python_6675", "problem_id": "p00100", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys\n\n\ndef func_2(var_2):\n var_7 = []\n var_8 = [0 for _ in range(4000 + 1)]\n for var_4, var_9, var_6 in var_2:\n var_8[var_4] += var_9 * var_6\n if var_8[var_4] >= 1000000:\n if var_4 not in var_7:\n var_7.append(var_4)\n\n return var_7\n\n\ndef func_1(var_1):\n\n while True:\n var_5 = int(eval(input()))\n if var_5 == 0:\n break\n var_2 = []\n for _ in range(var_5):\n var_2.append([int(var_10) for var_10 in input().split(\" \")])\n var_7 = func_2(var_2)\n if var_7:\n for var_3 in var_7:\n print(var_3)\n else:\n print(\"NA\")\n\n\nif __name__ == \"__main__\":\n func_1(sys.argv[1:])\n", "fast_code": "while True:\n var_3 = int(eval(input()))\n if var_3 == 0:\n break\n var_1 = dict()\n var_7 = []\n for _ in range(var_3):\n var_2, var_4, var_5 = list(map(int, input().split()))\n if var_2 in var_1:\n var_1[var_2] += var_4 * var_5\n else:\n var_1[var_2] = var_4 * var_5\n var_7.append(var_2)\n var_9 = list([var_10 for var_10 in list(var_1.items()) if var_10[1] >= 1000000])\n if len(var_9):\n var_9 = {var_8[0]: var_8[1] for var_8 in var_9}\n for var_6 in var_7:\n if var_6 in var_9:\n print(var_6)\n else:\n print(\"NA\")\n", "slow_time": 212744608, "fast_time": 64682813, "speedup": 3.289, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_3"} -{"pair_id": "python_3661", "problem_id": "p02786", "language": "python", "slow_code": "import sys\nimport math\nimport os\nimport itertools\nimport string\nimport heapq\nimport _collections\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nfrom functools import lru_cache\nimport bisect\nimport re\nimport queue\nimport copy\nimport decimal\n\n\nclass Class_1:\n @staticmethod\n def int():\n return int(sys.stdin.readline().rstrip())\n\n @staticmethod\n def string():\n return sys.stdin.readline().rstrip()\n\n @staticmethod\n def func_4():\n return [int(var_6) for var_6 in Class_1.string().split()]\n\n @staticmethod\n def func_6(var_4):\n return [Class_1.string() for var_3 in range(var_4)]\n\n @staticmethod\n def func_2(var_4):\n return [Class_1.map_int() for var_3 in range(var_4)]\n\n @staticmethod\n def func_1(var_4):\n return [Class_1.int() for var_3 in range(var_4)]\n\n\ndef func_5():\n var_1 = Class_1.int()\n var_2 = 0\n var_5 = 1\n while var_1 > 1:\n var_2 += var_5\n var_5 *= 2\n var_1 //= 2\n var_2 += var_5\n print(var_2)\n\n\ndef func_3():\n\n func_5()\n\n\nif __name__ == \"__main__\":\n func_3()\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = 0\nwhile var_2 > 0:\n if var_2 == 1:\n var_1 += 1\n break\n else:\n var_2 //= 2\n var_1 += 1\nprint((2**var_1 - 1))\n", "slow_time": 97773077, "fast_time": 19218319, "speedup": 5.0875, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_8"} -{"pair_id": "python_15027", "problem_id": "p03212", "language": "python", "slow_code": "var_4 = int(eval(input()))\nvar_3 = len(str(var_4))\nvar_6 = \"7530\"\nvar_1 = 0\n\n\ndef func_1(var_3, var_5):\n global cnt\n if var_3 == 0:\n if \"7\" in var_5 and \"5\" in var_5 and \"3\" in var_5:\n if \"0\" in str(int(var_5)):\n return\n if var_4 >= int(var_5):\n var_1 += 1\n return\n for var_2 in var_6:\n func_1(var_3 - 1, var_5 + var_2)\n\n\nfunc_1(var_3, \"\")\nprint(var_1)\n", "fast_code": "var_1 = int(eval(input()))\n\n\ndef func_1(var_4):\n if int(var_4) > var_1:\n return 0\n var_2 = 1 if all(var_4.count(var_3) > 0 for var_3 in \"753\") else 0\n for var_3 in \"753\":\n var_2 += func_1(var_4 + var_3)\n return var_2\n\n\nprint((func_1(\"0\")))\n", "slow_time": 16700374702, "fast_time": 2507015389, "speedup": 6.6615, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_4"} -{"pair_id": "python_11845", "problem_id": "p03150", "language": "python", "slow_code": "import re\nfrom sys import stdin\n\nvar_1 = stdin.readline().rstrip()\nfor var_3 in range(7):\n var_4 = \"keyence\"[0 : var_3 + 1]\n var_2 = \"keyence\"[var_3 + 1 : 8]\n if re.search(\".*keyencekeyence\", var_1):\n if (re.sub(\".*keyencekeyence\", \"\", var_1) == \"\") == True:\n print(\"YES\")\n break\n if re.search(\"keyencekeyence.*\", var_1):\n if (re.sub(\"keyencekeyence.*\", \"\", var_1) == \"\") == True:\n print(\"YES\")\n break\n if (re.sub(\".*keyence\", \"\", var_1) == \"\") == True:\n print(\"YES\")\n break\n if (re.sub(\"keyence.*\", \"\", var_1) == \"\") == True:\n print(\"YES\")\n break\n if re.match(\"%s.*%s\" % (var_4, var_2), var_1):\n if (re.sub(\"%s.*%s\" % (var_4, var_2), \"\", var_1) == \"\") == True:\n print(\"YES\")\n break\nif var_3 == 6:\n print(\"NO\")\n", "fast_code": "var_2 = input().strip()\nvar_1 = len(var_2)\nvar_7 = \"keyence\"\nvar_6 = len(var_7)\nif var_1 < var_6:\n var_3 = 0\nelse:\n var_3 = 0\n for var_4 in range(7):\n for var_5 in range(1, 8):\n if var_2[:var_4] + var_2[-var_5:] == var_7:\n var_3 = 1\n break\n if var_3 == 1:\n break\nif var_3 == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "slow_time": 137922673, "fast_time": 36687895, "speedup": 3.7594, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_21"} -{"pair_id": "python_11512", "problem_id": "p02621", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_6():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_1 = func_1()\nprint((var_1 + var_1**2 + var_1**3))\n", "fast_code": "var_1 = int(input())\nprint(var_1 + var_1**2 + var_1**3)\n", "slow_time": 44676795, "fast_time": 7277371, "speedup": 6.1391, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_29"} -{"pair_id": "python_13583", "problem_id": "p03260", "language": "python", "slow_code": "from collections import defaultdict, deque\nimport sys, heapq, bisect, math, itertools, string, queue, datetime\n\nsys.setrecursionlimit(10**8)\nvar_3 = float(\"inf\")\nvar_5 = 10**9 + 7\nvar_4 = 10**-7\n\n\ndef func_1():\n return list(map(int, input().split()))\n\n\ndef func_2():\n return list(input().split())\n\n\nvar_1, var_2 = func_1()\nif (var_1 * var_2) % 2 == 0:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\nif var_1 * var_2 % 2:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 21432741, "fast_time": 7530657, "speedup": 2.8461, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_16"} -{"pair_id": "python_3799", "problem_id": "p03564", "language": "python", "slow_code": "var_2 = int(eval(input()))\nvar_1 = int(eval(input()))\nvar_5 = 10**10\nfor var_3 in range(2**var_2):\n var_4 = 1\n for var_6 in range(var_2):\n if var_3 & (1 << var_6):\n var_4 *= 2\n else:\n var_4 += var_1\n var_5 = min(var_5, var_4)\nprint(var_5)\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = int(eval(input()))\nvar_3 = 1\nfor _ in [0] * var_2:\n var_3 += min(var_3, var_1)\nprint(var_3)\n", "slow_time": 620758240, "fast_time": 19514063, "speedup": 31.8108, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_18"} -{"pair_id": "python_12061", "problem_id": "p00008", "language": "python", "slow_code": "while True:\n try:\n var_6 = int(eval(input()))\n except:\n break\n var_2 = 0\n for var_1 in range(10):\n for var_3 in range(10):\n for var_4 in range(10):\n var_5 = var_6 - (var_1 + var_3 + var_4)\n var_2 += 0 <= var_5 <= 9\n print(var_2)\n", "fast_code": "import sys\n\nvar_1 = [0] * 51\nfor var_3 in range(19):\n var_1[var_3] = var_1[36 - var_3] = (var_3 + 3) * (var_3 + 2) * (\n var_3 + 1\n ) // 6 - max(2 * (var_3 - 9) * (var_3 - 8) * (var_3 - 7) // 3, 0)\nfor var_2 in sys.stdin:\n print((var_1[int(var_2)]))\n", "slow_time": 251710823, "fast_time": 26712620, "speedup": 9.4229, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_3"} -{"pair_id": "python_9810", "problem_id": "p03806", "language": "python", "slow_code": "import fractions\n\nvar_11, var_9, var_10 = list(map(int, input().split()))\nvar_1 = [0] * (var_11 + 1)\nvar_3 = [0] * (var_11 + 1)\nvar_4 = [0] * (var_11 + 1)\nfor var_6 in range(1, var_11 + 1):\n var_1[var_6], var_3[var_6], var_4[var_6] = list(map(int, input().split()))\n\nvar_5 = [\n [[10**15 for var_6 in range(var_11 + 1)] for var_7 in range(401)]\n for var_8 in range(401)\n]\nvar_5[0][0][0] = 0\nvar_12 = [0] * (var_11 + 1)\nvar_13 = [0] * (var_11 + 1)\nfor var_6 in range(1, var_11 + 1):\n for var_7 in range(401):\n for var_8 in range(401):\n if var_7 < var_1[var_6] or var_8 < var_3[var_6]:\n var_5[var_8][var_7][var_6] = var_5[var_8][var_7][var_6 - 1]\n else:\n var_5[var_8][var_7][var_6] = min(\n var_5[var_8][var_7][var_6 - 1],\n var_5[var_8 - var_3[var_6]][var_7 - var_1[var_6]][var_6 - 1]\n + var_4[var_6],\n )\nvar_6 = 1\nvar_2 = 10**15\nwhile True:\n if var_6 * var_9 > 400 or var_6 * var_10 > 400:\n break\n var_2 = min(var_2, var_5[var_6 * var_10][var_6 * var_9][var_11])\n var_6 += 1\nif var_2 == 10**15:\n var_2 = -1\nprint(var_2)\n\"\"\"\"\"\"\n", "fast_code": "import sys\n\nvar_1 = float(\"inf\")\nvar_14, var_12, var_13 = list(map(int, sys.stdin.readline().split()))\nvar_2, var_5, var_7 = [], [], []\nfor _ in range(var_14):\n var_3, var_6, var_8 = list(map(int, sys.stdin.readline().split()))\n var_2.append(var_3)\n var_5.append(var_6)\n var_7.append(var_8)\n\n\ndef func_1():\n var_16 = sum(var_2)\n var_17 = sum(var_5)\n var_15 = [\n [[var_1] * (var_17 + 1) for _ in range(var_16 + 1)] for _ in range(var_14 + 1)\n ]\n var_15[0][0][0] = 0\n for var_9 in range(var_14):\n for var_10 in range(var_16 + 1):\n for var_11 in range(var_17 + 1):\n if var_10 >= var_2[var_9] and var_11 >= var_5[var_9]:\n var_15[var_9 + 1][var_10][var_11] = min(\n var_15[var_9][var_10 - var_2[var_9]][var_11 - var_5[var_9]]\n + var_7[var_9],\n var_15[var_9][var_10][var_11],\n )\n else:\n var_15[var_9 + 1][var_10][var_11] = var_15[var_9][var_10][var_11]\n var_4 = var_1\n for var_9 in range(1, min(var_16 // var_12, var_17 // var_13) + 1):\n var_4 = min(var_4, var_15[var_14][var_12 * var_9][var_13 * var_9])\n if var_4 == var_1:\n return -1\n else:\n return var_4\n\n\nif __name__ == \"__main__\":\n var_4 = func_1()\n print(var_4)\n", "slow_time": 77612704184, "fast_time": 63742024, "speedup": 1217.6065, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_22"} -{"pair_id": "python_16545", "problem_id": "p03274", "language": "python", "slow_code": "import sys\nimport math\nimport bisect\nimport queue\n\n\ndef func_1():\n return sys.stdin.readline().rstrip()\n\n\ndef func_2(var_3, var_1):\n var_2 = len(var_3)\n var_4 = [0 for _ in range(var_2)]\n for var_5 in range(1, var_2):\n var_4[var_5] = abs(var_3[var_5] - var_3[var_5 - 1]) + var_4[var_5 - 1]\n var_6 = bisect.bisect_left(var_3, 0)\n var_9 = 1000000005\n for var_5 in range(0, var_2):\n if var_3[var_5] >= 0:\n break\n var_8 = -var_3[var_5]\n var_7 = var_6 - var_5\n if (var_7 < var_1) and (var_6 + var_1 - var_7 - 1 < var_2):\n var_8 += var_4[var_6 + var_1 - var_7 - 1] - var_4[var_5]\n var_9 = min(var_9, var_8)\n return var_9\n\n\nif __name__ == \"__main__\":\n var_2, var_1 = list(map(int, func_1().split()))\n var_3 = list(map(int, func_1().split()))\n var_8 = 1000000005\n if min(var_3) >= 0:\n print((var_3[var_1 - 1]))\n elif max(var_3) <= 0:\n var_3 = var_3[::-1]\n print((-var_3[var_1 - 1]))\n else:\n var_8 = min(var_8, func_2(var_3, var_1))\n var_3 = [-var_10 for var_10 in var_3]\n var_8 = min(var_8, func_2(var_3[::-1], var_1))\n print(var_8)\n", "fast_code": "var_4, var_3 = list(map(int, input().split()))\nvar_5 = list(map(int, input().split()))\nvar_1 = []\nfor var_2 in range(var_4 - var_3 + 1):\n var_1.append(\n min(\n (abs(var_5[var_2]) + abs(var_5[var_2] - var_5[var_2 + var_3 - 1])),\n abs(var_5[var_2 + var_3 - 1])\n + abs(var_5[var_2] - var_5[var_2 + var_3 - 1]),\n )\n )\nprint((min(var_1)))\n", "slow_time": 92211709, "fast_time": 32423230, "speedup": 2.844, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_1"} -{"pair_id": "python_5982", "problem_id": "p03566", "language": "python", "slow_code": "var_8 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = list(map(int, input().split()))\nvar_5 = [[-1] * 102 for _ in range(sum(var_1) + 1)]\nvar_5[0][0] = 0\nvar_10 = 0\nvar_11 = var_1[0]\n\nvar_4 = [-1, 0, 1]\nfor var_6 in range(sum(var_1)):\n if var_11 == var_6:\n var_10 += 1\n var_11 += var_1[var_10]\n for var_7 in range(101):\n if var_7 > var_2[var_10] or var_5[var_6][var_7] == -1:\n break\n for var_3 in var_4:\n var_9 = var_7 + var_3\n if 0 <= var_9 <= var_2[var_10]:\n if var_3 != 0 or var_7 == var_2[var_10]:\n var_5[var_6 + 1][var_9] = max(\n var_5[var_6 + 1][var_9],\n var_5[var_6][var_7] + (var_7 + var_9) / 2,\n )\n else:\n var_5[var_6 + 1][var_9] = max(\n var_5[var_6 + 1][var_9], var_5[var_6][var_7] + var_7 + 0.25\n )\nprint((var_5[-1][0]))\n", "fast_code": "from sys import stdin\n\n\ndef func_1(var_7, var_9):\n if len(var_7) == 0:\n return 0.0\n var_6 = sum(var_7)\n var_4 = min(var_9)\n if var_6 / 2.0 <= var_4:\n return (var_6 / 2.0) ** 2\n\n if var_4 == 0:\n\n var_10 = [var_3 for var_3 in range(len(var_9)) if var_9[var_3] == 0][0]\n return func_1(var_7[:var_10], var_9[:var_10]) + func_1(\n var_7[var_10 + 1 :], var_9[var_10 + 1 :]\n )\n\n var_7[0] -= 1\n var_7[-1] -= 1\n\n if var_7[-1] == 0:\n var_7 = var_7[:-1]\n var_9 = var_9[:-1]\n if var_7[0] == 0:\n var_7 = var_7[1:]\n var_9 = var_9[1:]\n\n var_9 = [var_8 - 1 for var_8 in var_9]\n\n var_2 = var_6 - 2 + 1\n return var_2 + func_1(var_7, var_9)\n\n\ndef func_2(var_5):\n var_12 = var_5.strip().split()\n return [int(var_11) for var_11 in var_12]\n\n\nvar_1 = int(stdin.readline())\nvar_7 = func_2(stdin.readline())\nvar_9 = func_2(stdin.readline())\nif len(var_7) != var_1 or len(var_9) != var_1:\n raise\nprint(func_1(var_7, var_9))\n", "slow_time": 4557267717, "fast_time": 97227414, "speedup": 46.8723, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_5"} -{"pair_id": "python_16042", "problem_id": "p03599", "language": "python", "slow_code": "var_1, var_2, var_3, var_4, var_5, var_6 = list(map(int, input().split()))\nvar_12 = []\nfor var_7 in range(31):\n for var_8 in range(31):\n if var_1 * var_7 + var_2 * var_8 <= var_6 // 100:\n var_12.append(var_1 * var_7 + var_2 * var_8)\nvar_12.pop(var_12.index(0))\nvar_12 = list(set(var_12))\nvar_9 = [[0, 0, 0]]\nfor var_11 in var_12:\n for var_7 in range(301):\n for var_8 in range(301):\n var_10 = var_3 * var_7 + var_4 * var_8\n if var_10 <= var_11 * var_5 and var_10 + var_11 * 100 <= var_6:\n var_9.append(\n [\n 100 * var_10 / (var_10 + var_11 * 100),\n (var_10 + var_11 * 100),\n var_10,\n ]\n )\nvar_9.sort(reverse=True)\nprint((var_9[0][1], var_9[0][2]))\n", "fast_code": "var_1, var_2, var_3, var_4, var_5, var_6 = list(map(int, input().split()))\nvar_17 = set()\nvar_7 = var_8 = 0\nwhile True:\n var_8 = 0\n if var_2 * var_7 > var_6 // 100:\n break\n while True:\n var_15 = var_2 * var_7 + var_1 * var_8\n if var_15 > var_6 // 100:\n break\n var_17.add(var_15)\n var_8 += 1\n var_7 += 1\nvar_17 = list(var_17)\nvar_17.sort()\nvar_13 = set()\nvar_7 = var_8 = 0\nwhile True:\n var_8 = 0\n if var_4 * var_7 > var_6:\n break\n while True:\n var_12 = var_4 * var_7 + var_3 * var_8\n if var_12 > var_6:\n break\n var_13.add(var_12)\n var_8 += 1\n var_7 += 1\nvar_13 = list(var_13)\nvar_13.sort()\nvar_9 = var_5 / (100 + var_5)\nvar_16 = var_1 * 100\nvar_14 = var_11 = 0\nfor var_15 in var_17:\n var_15 = var_15 * 100\n if var_15 == 0:\n continue\n if var_15 > var_6:\n break\n for var_12 in var_13:\n if var_15 + var_12 > var_6:\n break\n var_10 = var_12 / (var_15 + var_12)\n if var_10 > var_9:\n break\n if var_10 > var_11:\n var_11 = var_10\n var_16 = var_15\n var_14 = var_12\nprint((var_16 + var_14, var_14))\n", "slow_time": 20317356372, "fast_time": 3182487779, "speedup": 6.3841, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_22"} -{"pair_id": "python_12206", "problem_id": "p00008", "language": "python", "slow_code": "import sys\n\nfor var_5 in sys.stdin:\n var_5 = int(var_5)\n var_6 = list(range(10))\n print(\n (\n sum(\n [\n 1\n for var_1 in var_6\n for var_2 in var_6\n for var_3 in var_6\n for var_4 in var_6\n if var_1 + var_2 + var_3 + var_4 == var_5\n ]\n )\n )\n )\n", "fast_code": "import sys\n\nvar_6 = {}\n\n\ndef func_3(var_4):\n global table\n\n def func_2(*var_2):\n if not var_2 in var_6:\n var_6[var_2] = var_4(*var_2)\n return var_6[var_2]\n\n return func_2\n\n\n@func_3\ndef func_1(var_1, var_3):\n if var_1 == 0:\n return 1\n elif var_3 == 0 or var_1 < 0:\n return 0\n return sum([func_1(var_1 - var_5, var_3 - 1) for var_5 in range(10)])\n\n\nfor var_5 in sys.stdin.readlines():\n print(func_1(int(var_5.strip()), 4))\n", "slow_time": 607385976, "fast_time": 124200677, "speedup": 4.8904, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_1"} -{"pair_id": "python_14121", "problem_id": "p02741", "language": "python", "slow_code": "def func_1():\n var_1 = [\n 1,\n 1,\n 1,\n 2,\n 1,\n 2,\n 1,\n 5,\n 2,\n 2,\n 1,\n 5,\n 1,\n 2,\n 1,\n 14,\n 1,\n 5,\n 1,\n 5,\n 2,\n 2,\n 1,\n 15,\n 2,\n 2,\n 5,\n 4,\n 1,\n 4,\n 1,\n 51,\n ]\n var_2 = int(eval(input()))\n print((var_1[var_2 - 1]))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "print((b\"\u0004\u0001\u000e 3\u0001\u0002 \u0005 \u000f \u0005\"[int(eval(input())) % 14]))\n", "slow_time": 18736070, "fast_time": 5394967, "speedup": 3.4729, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_7"} -{"pair_id": "python_565", "problem_id": "p02793", "language": "python", "slow_code": "import sys\nfrom collections import defaultdict, Counter\n\nvar_16 = sys.stdin.read\nvar_17 = sys.stdin.readline\nvar_18 = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nvar_2 = 1 << 60\nvar_3 = 1000000007\n\n\ndef func_1():\n var_4, *var_1 = list(map(int, var_16().split()))\n var_5 = 10**6\n var_13 = list(range(var_5 + 1))\n var_13[2::2] = [2] * (var_5 // 2)\n for var_9 in range(3, int(var_5**0.5) + 2, 2):\n if var_13[var_9] != var_9:\n continue\n for var_10 in range(var_9 * var_9, var_5 + 1, 2 * var_9):\n if var_13[var_10] > var_9:\n var_13[var_10] = var_9\n\n def func_2(var_14):\n var_6 = Counter()\n while var_14 != 1:\n var_8 = var_13[var_14]\n var_15 = 0\n while var_13[var_14] == var_8:\n var_15 += 1\n var_14 //= var_8\n var_6[var_8] = var_15\n return var_6\n\n var_12 = Counter()\n for var_6 in var_1:\n for var_15, var_14 in list(func_2(var_6).items()):\n if var_12[var_15] < var_14:\n var_12[var_15] = var_14\n var_11 = 1\n for var_15, var_14 in list(var_12.items()):\n var_11 = var_11 * pow(var_15, var_14, var_3) % var_3\n var_7 = 0\n for var_6 in var_1:\n var_7 = (var_7 + pow(var_6, var_3 - 2, var_3)) % var_3\n var_7 = var_7 * var_11 % var_3\n print(var_7)\n return\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "def func_1(var_1, var_3):\n while var_3:\n var_1, var_3 = var_3, var_1 % var_3\n return var_1\n\n\ndef func_2(var_1, var_3):\n return var_1 * var_3 // func_1(var_1, var_3)\n\n\nvar_7 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_2 = 0\nvar_6 = 10**9 + 7\nvar_5 = var_1[0]\nfor var_4 in range(1, var_7):\n var_5 = func_2(var_5, var_1[var_4])\nfor var_4 in var_1:\n var_2 += var_5 * pow(var_4, var_6 - 2, var_6) % var_6\n var_2 %= var_6\nprint(var_2)\n", "slow_time": 15406033946, "fast_time": 27034767, "speedup": 569.8601, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_19"} -{"pair_id": "python_12157", "problem_id": "p00008", "language": "python", "slow_code": "import sys\n\nvar_1 = [0] * 51\nvar_8 = list(range(10))\nfor var_3 in range(51):\n var_1[var_3] = sum(\n [\n 1\n for var_4 in var_8\n for var_5 in var_8\n for var_6 in var_8\n for var_7 in var_8\n if var_4 + var_5 + var_6 + var_7 == var_3\n ]\n )\nfor var_2 in sys.stdin:\n print((var_1[int(var_2)]))\n", "fast_code": "import sys\n\nvar_1 = list(range(10))\nfor var_7 in map(int, sys.stdin):\n var_8 = 0\n for var_2 in var_1:\n var_5 = var_7 - var_2\n if 0 > var_5 or var_5 > 27:\n continue\n for var_3 in var_1:\n var_6 = var_5 - var_3\n if 0 > var_6 or var_6 > 18:\n continue\n for var_4 in var_1:\n if (var_6 - var_4) in var_1:\n var_8 += 1\n print(var_8)\n", "slow_time": 14930700146, "fast_time": 76834423, "speedup": 194.3231, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_20"} -{"pair_id": "python_5299", "problem_id": "p03997", "language": "python", "slow_code": "from collections import deque\nfrom heapq import heapify, heappop, heappush, heappushpop\nfrom copy import copy, deepcopy\nfrom itertools import product, permutations, combinations, combinations_with_replacement\nfrom collections import defaultdict, Counter\nfrom bisect import bisect_left, bisect_right\n\n\nfrom functools import reduce\nfrom pprint import pprint\n\nvar_1 = float(\"inf\")\n\n\ndef func_3():\n return list(map(int, input().split()))\n\n\ndef func_4(var_13):\n return [list(func_3()) for _ in range(var_13)]\n\n\ndef func_1(var_7, var_6):\n return [var_16[var_6] for var_16 in var_7]\n\n\ndef func_8(var_7, var_6, var_15):\n var_7.sort(key=lambda var_18: var_18[var_6], reverse=var_15)\n return var_7\n\n\ndef func_5(var_7):\n var_2 = -1 * float(\"inf\")\n for var_9 in range(len(var_7)):\n var_12 = max(var_7[var_9])\n var_2 = max(var_2, var_12)\n return var_2\n\n\ndef func_6(var_7):\n var_12 = float(\"inf\")\n for var_9 in range(len(var_7)):\n var_2 = min(var_7[var_9])\n var_12 = min(var_12, var_2)\n return var_12\n\n\ndef func_2(var_11, var_18):\n\n var_10 = bisect_left(var_11, var_18)\n var_14 = bisect_right(var_11, var_18)\n return var_14 - var_10\n\n\ndef func_7(var_11, var_17=True):\n if var_17:\n if len(var_11) == 0:\n print(\" \")\n elif type(var_11[0]) == str:\n print((\" \".join(var_11)))\n elif type(var_11[0]) == int:\n print((\" \".join(map(str, var_11))))\n else:\n print(\"Output Error\")\n else:\n if len(var_11) == 0:\n print(\"\")\n elif type(var_11[0]) == str:\n print((\"\".join(var_11)))\n elif type(var_11[0]) == int:\n print((\"\".join(map(str, var_11))))\n else:\n print(\"Output Error\")\n\n\nvar_3 = int(eval(input()))\nvar_5 = int(eval(input()))\nvar_8 = int(eval(input()))\nvar_4 = (var_3 + var_5) * var_8 / 2\nprint((int(var_4)))\n", "fast_code": "var_1 = int(eval(input()))\nvar_2 = int(eval(input()))\nvar_3 = int(eval(input()))\nprint(((var_1 + var_2) * var_3 // 2))\n", "slow_time": 157783046, "fast_time": 20080806, "speedup": 7.8574, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_4"} -{"pair_id": "python_16085", "problem_id": "p03317", "language": "python", "slow_code": "from collections import Counter\nfrom math import *\n\nvar_3, var_2 = [int(var_8) for var_8 in input().strip().split()]\nvar_1 = [int(var_8) for var_8 in input().strip().split()]\nvar_1.sort()\nvar_4 = Counter(var_1)\nvar_6 = var_4[var_1[0]]\nvar_7 = len(var_1) - var_6\nprint((var_5(var_7 / (var_2 - 1))))\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nprint(((var_2 - 2) // (var_1 - 1) + 1))\n", "slow_time": 21694584, "fast_time": 5990806, "speedup": 3.6213, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_23"} -{"pair_id": "python_17499", "problem_id": "p02615", "language": "python", "slow_code": "import sys\nimport math\nfrom bisect import bisect_left\nfrom bisect import bisect_right\nfrom collections import defaultdict\nfrom heapq import heappop, heappush\nimport itertools\nimport random\nfrom collections import deque\nfrom decimal import *\nimport queue\n\nvar_9 = sys.stdin.readline\n\n\ndef func_1():\n return int(eval(var_9()))\n\n\ndef func_3():\n return list(map(int, var_9().split()))\n\n\ndef func_2():\n return list(map(int, var_9().split()))\n\n\ndef func_4():\n return var_9()[:-1]\n\n\nvar_8 = float(\"inf\")\nvar_11 = 1000000007\n\n\ndef func_5():\n var_2 = func_1()\n var_1 = func_2()\n var_1.sort()\n var_1 = var_1[::-1]\n var_3 = 0\n var_10 = 0\n var_5 = 0\n var_6 = True\n var_4 = []\n var_12 = queue.Queue()\n for var_7, var_14 in enumerate(var_1):\n if var_7 == 0:\n var_12.put(var_14)\n else:\n var_13 = var_12.get()\n var_4.append(var_13)\n var_12.put(var_14)\n if var_13 == var_14:\n var_12.put(var_14)\n else:\n var_12.put(var_14)\n\n print((sum(var_4)))\n\n\nif __name__ == \"__main__\":\n func_5()\n", "fast_code": "var_5 = int(eval(input()))\nvar_1 = sorted(map(int, input().split()), reverse=True)\nvar_2, var_6, var_3 = 0, [var_1[0]], 0\nfor var_4 in var_1[1:]:\n var_2 += var_6[var_3]\n var_6 += [var_4, var_4]\n var_3 += 1\nprint(var_2)\n", "slow_time": 95233537, "fast_time": 26493943, "speedup": 3.5945, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_2"} -{"pair_id": "python_16580", "problem_id": "p02845", "language": "python", "slow_code": "_, var_1 = open(0)\nvar_2 = 1\nvar_3 = [3] + [0] * 10**6\nfor var_1 in map(int, var_1.split()):\n var_2 = var_2 * var_3[var_1] % (10**9 + 7)\n var_3[var_1] -= 1\n var_3[var_1 + 1] += 1\nprint(var_2)\n", "fast_code": "var_2 = int(eval(input()))\nvar_1 = list(map(int, input().split()))\nvar_4 = [-1, -1, -1]\nvar_5 = 1\nvar_6 = 0\nfor var_3 in var_1:\n var_5 = var_5 * var_4.count(var_3 - 1) % 1000000007\n if var_3 - 1 == var_4[0]:\n var_4[0] += 1\n var_6 = var_4.count(var_4[0] - 1) + 1\n elif var_3 - 1 == var_4[1]:\n var_4[1] += 1\n var_6 = var_4.count(var_4[1] - 1) + 1\n elif var_3 - 1 == var_4[2]:\n var_4[2] += 1\n var_6 = var_4.count(var_4[2] - 1) + 1\nprint(var_5)\n", "slow_time": 815333677, "fast_time": 43777284, "speedup": 18.6246, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_25"} -{"pair_id": "python_580", "problem_id": "p02793", "language": "python", "slow_code": "var_5 = int(eval(input()))\n(*var_1,) = list(map(int, input().split()))\nvar_3 = 10**3\nvar_6 = []\nvar_12 = [True] * var_3\nfor var_15 in range(2, var_3):\n if var_12[var_15] == False:\n continue\n var_6.append(var_15)\n for var_14 in range(var_15 * var_15, var_3, var_15):\n var_12[var_14] = False\nfrom collections import defaultdict\n\nvar_2 = [defaultdict(int) for _ in range(var_5)]\nfor var_11 in range(var_5):\n var_7 = var_1[var_11]\n for var_18 in var_6:\n while var_7 > 1:\n if var_7 % var_18 == 0:\n var_2[var_11][var_18] += 1\n var_7 //= var_18\n else:\n break\n else:\n break\n if var_7 > 1:\n var_2[var_11][var_7] += 1\nvar_9 = defaultdict(int)\nfor var_11 in range(var_5):\n for var_13, var_21 in list(var_2[var_11].items()):\n var_9[var_13] = max(var_9[var_13], var_21)\nvar_4 = 10**9 + 7\n\n\nclass Class_1:\n def __init__(self, var_22=0):\n self.value = var_22 % var_4\n if self.value < 0:\n self.value += var_4\n\n @staticmethod\n def func_1(var_23):\n return var_23.value if isinstance(var_23, Class_1) else var_23\n\n def func_2(self):\n var_7, var_8 = self.value, var_4\n var_20, var_21 = 1, 0\n while var_8:\n var_19 = var_7 // var_8\n var_8, var_7 = var_7 - var_19 * var_8, var_8\n var_21, var_20 = var_20 - var_19 * var_21, var_21\n if var_20 < 0:\n var_20 += var_4\n return var_20\n\n def __repr__(self):\n return str(self.value)\n\n def __eq__(self, var_17):\n return self.value == var_17.value\n\n def __neg__(self):\n return Class_1(-self.value)\n\n def __hash__(self):\n return hash(self.value)\n\n def __bool__(self):\n return self.value != 0\n\n def __iadd__(self, var_17):\n self.value += Class_1.get_value(var_17)\n if self.value >= var_4:\n self.value -= var_4\n return self\n\n def __add__(self, var_17):\n var_16 = Class_1(self.value)\n var_16 += var_17\n return var_16\n\n __radd__ = __add__\n\n def __isub__(self, var_17):\n self.value -= Class_1.get_value(var_17)\n if self.value < 0:\n self.value += var_4\n return self\n\n def __sub__(self, var_17):\n var_16 = Class_1(self.value)\n var_16 -= var_17\n return var_16\n\n def __rsub__(self, var_17):\n var_16 = Class_1(Class_1.get_value(var_17))\n var_16 -= self\n return var_16\n\n def __imul__(self, var_17):\n self.value = self.value * Class_1.get_value(var_17) % var_4\n return self\n\n def __mul__(self, var_17):\n var_16 = Class_1(self.value)\n var_16 *= var_17\n return var_16\n\n __rmul__ = __mul__\n\n def __ifloordiv__(self, var_17):\n var_17 = var_17 if isinstance(var_17, Class_1) else Class_1(var_17)\n self *= var_17.inverse()\n return self\n\n def __floordiv__(self, var_17):\n var_16 = Class_1(self.value)\n var_16 //= var_17\n return var_16\n\n def __rfloordiv__(self, var_17):\n var_16 = Class_1(Class_1.get_value(var_17))\n var_16 //= self\n return var_16\n\n\nvar_10 = Class_1(1)\nfor var_13, var_21 in list(var_9.items()):\n var_10 *= pow(var_13, var_21, var_4)\nprint((sum([var_10 // var_7 for var_7 in var_1])))\n", "fast_code": "import sys\nfrom math import gcd\n\nsys.setrecursionlimit(10**7)\nvar_6 = sys.stdin.readline\nvar_5 = float(\"inf\")\nvar_7 = 10**9 + 7\n\n\ndef func_1(var_3, var_4):\n return var_3 * var_4 // gcd(var_3, var_4)\n\n\ndef func_2():\n var_8 = int(eval(var_6()))\n var_1 = list(map(int, var_6().split()))\n var_2 = 1\n for var_3 in var_1:\n var_2 = func_1(var_2, var_3)\n var_9 = 0\n for var_3 in var_1:\n var_9 += var_2 * pow(var_3, var_7 - 2, var_7)\n var_9 %= var_7\n print(var_9)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "slow_time": 211446927, "fast_time": 29358966, "speedup": 7.2021, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_0"} -{"pair_id": "python_2344", "problem_id": "p03807", "language": "python", "slow_code": "import sys\n\n\ndef func_1(var_10, var_8):\n for var_5, var_9 in var_8.items():\n if var_10 is var_9:\n print(\"DEBUG:{} -> {}\".format(var_5, var_9), file=sys.stderr)\n return None\n\n\ndef func_2():\n var_2 = int(input())\n var_1 = [int(var_4) for var_4 in input().split()]\n var_6 = 0\n var_7 = 0\n for var_3 in var_1:\n if var_3 % 2 == 0:\n var_6 += 1\n else:\n var_7 += 1\n if var_7 % 2 == 1:\n print(\"NO\")\n return None\n else:\n var_6 += var_7 // 2\n if var_6 >= 1:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n func_2()\n", "fast_code": "var_1 = int(eval(input()))\nprint((\"YES\" if sum(map(int, input().split())) % 2 == 0 else \"NO\"))\n", "slow_time": 51540011, "fast_time": 14852239, "speedup": 3.4702, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_0"} -{"pair_id": "python_14286", "problem_id": "p03609", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_1, var_2 = func_6()\nprint((max(0, var_1 - var_2)))\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nprint((0 if var_2 <= var_1 else var_2 - var_1))\n", "slow_time": 52898444, "fast_time": 11240715, "speedup": 4.706, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_3"} -{"pair_id": "python_15372", "problem_id": "p03325", "language": "python", "slow_code": "import sys\n\n\nimport math\n\n\ndef func_1():\n var_5, *var_1 = (int(var_7) for var_7 in sys.stdin.read().split())\n var_6 = 0\n for var_4 in range(var_5):\n var_3 = var_1[var_4]\n var_2 = 0\n for _ in range(math.floor(math.log(10**9, 2)) + 1):\n if var_3 % 2 == 0:\n var_3 //= 2\n var_2 += 1\n else:\n break\n var_6 += var_2\n print(var_6)\n\n\nif __name__ == \"__main__\":\n\n func_1()\n", "fast_code": "var_1 = int(eval(input()))\nvar_3 = 0\nfor var_2 in map(int, input().split()):\n while var_2 % 2 == 0:\n var_3 += 1\n var_2 //= 2\nprint(var_3)\n", "slow_time": 40888841, "fast_time": 19286645, "speedup": 2.1201, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_20"} -{"pair_id": "python_6730", "problem_id": "p00775", "language": "python", "slow_code": "while True:\n var_2, var_1 = list(map(int, input().split()))\n if not (var_2 | var_1):\n break\n var_5 = 20\n var_3 = [0] * (var_5 * 2)\n for _ in range(var_1):\n var_11, var_12, var_6 = list(map(int, input().split()))\n for var_7 in range(var_11 + var_5, var_12 + var_5):\n var_3[var_7] = max(var_3[var_7], var_6)\n var_8, var_10 = 0, 20\n for _ in range(100):\n var_9 = (var_8 + var_10) / 2\n var_4 = True\n for var_7 in range(-var_2 + var_5, var_2 + var_5):\n if var_7 < var_5:\n var_13 = pow(\n var_2 * var_2 - (var_7 - var_5 + 1) * (var_7 - var_5 + 1), 0.5\n )\n var_4 &= var_3[var_7] >= var_13 - var_2 + var_9\n else:\n var_13 = pow(var_2 * var_2 - (var_7 - var_5) * (var_7 - var_5), 0.5)\n var_4 &= var_3[var_7] >= var_13 - var_2 + var_9\n if var_4:\n var_8 = var_9\n else:\n var_10 = var_9\n print((\"{:.20f}\".format(var_8)))\n", "fast_code": "while True:\n var_2, var_1 = list(map(int, input().split()))\n if not (var_2 | var_1):\n break\n var_5 = 20\n var_4 = [0] * (var_5 * 2)\n for _ in range(var_1):\n var_8, var_9, var_6 = list(map(int, input().split()))\n for var_7 in range(var_8 + var_5, var_9 + var_5):\n var_4[var_7] = max(var_4[var_7], var_6)\n var_3 = 20\n for var_7 in range(-var_2 + var_5, var_2 + var_5):\n if var_7 < var_5:\n var_4[var_7] -= (\n pow(var_2 * var_2 - (var_7 - var_5 + 1) * (var_7 - var_5 + 1), 0.5)\n - var_2\n )\n else:\n var_4[var_7] -= (\n pow(var_2 * var_2 - (var_7 - var_5) * (var_7 - var_5), 0.5) - var_2\n )\n var_3 = min(var_3, var_4[var_7])\n print(var_3)\n", "slow_time": 536358030, "fast_time": 74753886, "speedup": 7.175, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_3"} -{"pair_id": "python_859", "problem_id": "p03556", "language": "python", "slow_code": "import functools\nimport itertools\nimport numpy as np\nimport sys\n\nvar_1 = int(10e10)\nvar_2 = -var_1\nvar_6 = 1000000007\nsys.setrecursionlimit(1000000)\n\n\ndef func_2():\n return list(map(int, input().split()))\n\n\ndef func_4():\n return input().split()\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_3():\n return eval(input())\n\n\nvar_3 = func_1()\nvar_4 = [pow(var_5, 2) for var_5 in range(100000) if pow(var_5, 2) <= var_3]\nprint((var_4[-1]))\n", "fast_code": "import math\n\nvar_1 = int(eval(input()))\nvar_3 = math.sqrt(var_1)\nvar_2 = int(var_3)\nprint((var_2 * var_2))\n", "slow_time": 7046061345, "fast_time": 14440448, "speedup": 487.9392, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_29"} -{"pair_id": "python_5376", "problem_id": "p02417", "language": "python", "slow_code": "var_1 = [0] * 26\nvar_4 = \"abcdefghijklmnopqrstuvwxyz\"\ntry:\n while True:\n var_3 = list(input().upper())\n for var_2 in var_3:\n if var_2 == \"A\":\n var_1[0] += 1\n elif var_2 == \"B\":\n var_1[1] += 1\n elif var_2 == \"C\":\n var_1[2] += 1\n elif var_2 == \"D\":\n var_1[3] += 1\n elif var_2 == \"E\":\n var_1[4] += 1\n elif var_2 == \"F\":\n var_1[5] += 1\n elif var_2 == \"G\":\n var_1[6] += 1\n elif var_2 == \"H\":\n var_1[7] += 1\n elif var_2 == \"I\":\n var_1[8] += 1\n elif var_2 == \"J\":\n var_1[9] += 1\n elif var_2 == \"K\":\n var_1[10] += 1\n elif var_2 == \"L\":\n var_1[11] += 1\n elif var_2 == \"M\":\n var_1[12] += 1\n elif var_2 == \"N\":\n var_1[13] += 1\n elif var_2 == \"O\":\n var_1[14] += 1\n elif var_2 == \"P\":\n var_1[15] += 1\n elif var_2 == \"Q\":\n var_1[16] += 1\n elif var_2 == \"R\":\n var_1[17] += 1\n elif var_2 == \"S\":\n var_1[18] += 1\n elif var_2 == \"T\":\n var_1[19] += 1\n elif var_2 == \"U\":\n var_1[20] += 1\n elif var_2 == \"V\":\n var_1[21] += 1\n elif var_2 == \"W\":\n var_1[22] += 1\n elif var_2 == \"X\":\n var_1[23] += 1\n elif var_2 == \"Y\":\n var_1[24] += 1\n elif var_2 == \"Z\":\n var_1[25] += 1\nexcept EOFError:\n pass\nfor var_2 in range(26):\n print(var_4[var_2 : var_2 + 1], \":\", str(var_1[var_2]))\n", "fast_code": "import sys\n\nvar_4 = sys.stdin.readlines()\nfor var_1 in range(ord(\"a\"), ord(\"z\") + 1):\n var_2 = 0\n for var_3 in var_4:\n var_2 += var_3.lower().count(chr(var_1))\n print((\"{0} : {1}\".format(chr(var_1), var_2)))\n", "slow_time": 119568489, "fast_time": 31227814, "speedup": 3.8289, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_0"} -{"pair_id": "python_6642", "problem_id": "p03803", "language": "python", "slow_code": "import sys, math\nfrom functools import lru_cache\nfrom itertools import accumulate\n\nsys.setrecursionlimit(10**9)\nvar_3 = 10**9 + 7\n\n\ndef func_3():\n return sys.stdin.readline()[:-1]\n\n\ndef func_4():\n return list(map(int, func_3().split()))\n\n\ndef func_2():\n return int(eval(func_3()))\n\n\ndef func_1(var_5):\n var_6 = [list(func_4()) for var_4 in range(var_5)]\n return [list(var_4) for var_4 in zip(*var_6)]\n\n\nvar_1, var_2 = func_4()\nif var_1 == var_2:\n print(\"Draw\")\nelif var_1 == 1:\n print(\"Alice\")\nelif var_2 == 1:\n print(\"Bob\")\nelse:\n if var_1 > var_2:\n print(\"Alice\")\n else:\n print(\"Bob\")\n", "fast_code": "var_1, var_2 = list(map(int, input().split()))\n\nif var_1 == var_2:\n print(\"Draw\")\n\nelif var_1 == 1 or var_2 != 1 and var_1 > var_2:\n print(\"Alice\")\n\nelse:\n print(\"Bob\")\n", "slow_time": 58300100, "fast_time": 18091113, "speedup": 3.2226, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_15"} -{"pair_id": "python_13061", "problem_id": "p02783", "language": "python", "slow_code": "var_2, var_1 = list(map(int, input().split()))\nvar_3 = 0\nwhile var_3 < 10**4:\n var_3 += 1\n var_2 = var_2 - var_1\n if var_2 <= 0:\n print(var_3)\n break\n", "fast_code": "import math\n\nvar_2, var_1 = list(map(int, input().split()))\n\n\nprint((math.ceil(var_2 / var_1)))\n", "slow_time": 231756707, "fast_time": 10475887, "speedup": 22.1229, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_20"} -{"pair_id": "python_306", "problem_id": "p02899", "language": "python", "slow_code": "import sys\n\nvar_6 = sys.stdin.readline\n\n\ndef func_1():\n return int(eval(var_6()))\n\n\ndef func_3():\n return list(map(int, var_6().split()))\n\n\ndef func_2():\n return list(map(int, var_6().split()))\n\n\ndef func_4():\n var_7 = 10**9 + 7\n var_3 = func_1()\n var_1 = func_2()\n var_2 = []\n for var_5 in range(var_3):\n var_2.append([var_1[var_5], var_5])\n var_2.sort()\n var_4 = []\n for var_5 in range(var_3):\n var_4.append(var_2[var_5][1] + 1)\n print((\" \".join(map(str, var_4))))\n\n\nfunc_4()\n", "fast_code": "var_4 = int(input())\nvar_1 = var_3(map(int, input().split()))\nvar_3 = [0] * var_4\nfor var_2 in range(var_4):\n var_3[var_1[var_2] - 1] = var_2 + 1\nfor var_2 in range(var_4):\n print(var_3[var_2], end=\" \")\n", "slow_time": 40415943, "fast_time": 17437364, "speedup": 2.3178, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_19"} -{"pair_id": "python_735", "problem_id": "p03945", "language": "python", "slow_code": "import sys\n\nvar_4 = sys.stdin.readline().rstrip()\n\n\ndef func_1():\n var_3 = \"$\"\n var_2 = -1\n for var_1 in var_4:\n var_2 += var_1 != var_3\n var_3 = var_1\n print(var_2)\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "print((sum(map(input().count, [\"WB\", \"BW\"]))))\n", "slow_time": 19210495, "fast_time": 8142059, "speedup": 2.3594, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_19"} -{"pair_id": "python_736", "problem_id": "p03436", "language": "python", "slow_code": "import sys\nimport queue\n\nsys.setrecursionlimit(1000000)\n\n\ndef func_1(var_6, var_9, var_7):\n if var_7.empty():\n return -1\n var_5, var_3, var_4 = var_7.get()\n if var_3 == len(var_6) - 1 and var_4 == len(var_6[var_3]) - 1:\n return var_5\n if var_3 > 0 and var_6[var_3 - 1][var_4] == \".\" and (var_3 - 1, var_4) not in var_9:\n var_7.put((var_5 + 1, var_3 - 1, var_4))\n var_9.add((var_3 - 1, var_4))\n if var_3 < len(var_6) - 1 and var_6[var_3 + 1][var_4] == \".\" and (var_3 + 1, var_4) not in var_9:\n var_7.put((var_5 + 1, var_3 + 1, var_4))\n var_9.add((var_3 + 1, var_4))\n if var_4 > 0 and var_6[var_3][var_4 - 1] == \".\" and (var_3, var_4 - 1) not in var_9:\n var_7.put((var_5 + 1, var_3, var_4 - 1))\n var_9.add((var_3, var_4 - 1))\n if var_4 < len(var_6[var_3]) - 1 and var_6[var_3][var_4 + 1] == \".\" and (var_3, var_4 + 1) not in var_9:\n var_7.put((var_5 + 1, var_3, var_4 + 1))\n var_9.add((var_3, var_4 + 1))\n return func_1(var_6, var_9, var_7)\n\n\nvar_2, var_10 = list(map(int, input().split()))\nvar_6 = [input() for _ in range(var_2)]\nvar_7 = queue.PriorityQueue()\nvar_7.put((1, 0, 0))\nvar_9 = set((0, 0))\nvar_1 = func_1(var_6, var_9, var_7)\nif var_1 == -1:\n print(-1)\nelse:\n print(var_2 * var_10 - var_1 - sum([var_8.count(\"#\") for var_8 in var_6]))\n", "fast_code": " \nimport sys\n\nvar_9 = sys.stdin.readline\nfrom collections import deque\n\n\ndef func_1() -> None:\n var_12 = [(0, 0)]\n while var_12:\n var_15, var_16 = var_12.pop(0)\n for var_6, var_8 in var_7:\n var_10, var_11 = var_15 + var_6, var_16 + var_8 \n if 0 <= var_10 < var_1 and 0 <= var_11 < var_3 and var_2[var_10][var_11] == \".\" and var_5[var_10][var_11] == 0:\n var_12.append((var_10, var_11))\n var_5[var_10][var_11] = var_5[var_15][var_16] + 1\n\n\ndef func_2():\n global H, W, S, dist, dxy\n var_1, var_3 = tuple(map(int, var_9().split()))\n var_2 = tuple(var_9().rstrip() for _ in range(var_1))\n var_5 = [[0] * var_3 for _ in range(var_1)] \n var_5[0][0] = 1\n var_7 = [(1, 0), (-1, 0), (0, 1), (0, -1)]\n func_1()\n var_14, var_15 = sum(var_13.count(\".\") for var_13 in var_2), var_5[-1][-1]\n var_4 = var_14 - var_15 if var_15 else -1\n print(var_4)\n\n\nif __name__ == \"__main__\":\n func_2()\n", "slow_time": 279149914, "fast_time": 138807605, "speedup": 2.0111, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_27"} -{"pair_id": "python_6759", "problem_id": "p02938", "language": "python", "slow_code": "var_1, var_4 = list(map(int, input().split()))\nvar_9 = 10**9 + 7\n\n\ndef func_1(var_1, var_4):\n if var_1 > var_4:\n return 0\n var_4 = bin(var_4)[2:]\n var_3 = len(var_4)\n var_11 = func_1(var_1, int(\"0\" + \"1\" * (var_3 - 1), 2))\n var_1 = bin(var_1)[2:]\n if len(var_1) != var_3:\n var_1 = \"1\" + \"0\" * (var_3 - 1)\n for var_6 in range(var_3):\n if var_4[var_6] == \"0\":\n continue\n var_5 = var_4[:var_6] + \"0\" + \"?\" * (var_3 - var_6 - 1)\n if var_6 == 0:\n var_5 = var_4\n for var_7 in range(var_3):\n if var_1[var_7] == \"1\" and var_7 != 0:\n continue\n var_2 = var_1[:var_7] + \"1\" + \"?\" * (var_3 - var_7 - 1)\n if var_7 == 0:\n var_2 = var_1\n var_12 = 1\n for var_10, var_8 in zip(var_5, var_2):\n if var_10 == \"0\" and var_8 == \"1\":\n var_12 *= 0\n break\n elif var_10 == \"?\" and var_8 == \"?\":\n var_12 = var_12 * 3 % var_9\n elif var_10 == \"?\" and var_8 == \"0\":\n var_12 = var_12 * 2 % var_9\n elif var_10 == \"1\" and var_8 == \"?\":\n var_12 = var_12 * 2 % var_9\n var_11 += var_12\n var_11 %= var_9\n return var_11\n\n\nprint((func_1(var_1, var_4)))\n", "fast_code": "var_1, var_3 = list(map(int, input().split()))\nvar_2 = 10**9 + 7\nvar_11 = \"{:060b}\".format(var_1)[::-1]\nvar_14 = \"{:060b}\".format(var_3)[::-1]\nvar_12 = [\n [[[-1 for var_11 in range(2)] for var_10 in range(2)] for var_9 in range(2)]\n for var_8 in range(60)\n]\n\n\ndef func_1(var_13, var_5, var_6, var_7):\n if var_13 == -1:\n return 1\n if var_12[var_13][var_5][var_6][var_7] != -1:\n return var_12[var_13][var_5][var_6][var_7]\n var_15 = 0\n\n if var_11[var_13] == \"0\" or var_5:\n var_15 += func_1(\n var_13 - 1, var_5, 1 if var_6 or var_14[var_13] == \"1\" else 0, var_7\n )\n\n if (var_11[var_13] == \"0\" or var_5) and (var_14[var_13] == \"1\" or var_6) and var_7:\n var_15 += func_1(var_13 - 1, var_5, var_6, var_7)\n\n if var_14[var_13] == \"1\" or var_6:\n var_15 += func_1(\n var_13 - 1, 1 if var_11[var_13] == \"0\" or var_5 else 0, var_6, 1\n )\n var_15 %= var_2\n var_12[var_13][var_5][var_6][var_7] = var_15\n return var_15\n\n\nvar_4 = func_1(59, 0, 0, 0)\nprint(var_4)\n", "slow_time": 21118709522, "fast_time": 137450137, "speedup": 153.6463, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_1"} -{"pair_id": "python_2252", "problem_id": "p03862", "language": "python", "slow_code": "var_2, var_3 = (int(var_8) for var_8 in input().split())\nvar_1 = [int(var_8) for var_8 in input().split()]\nvar_4 = []\nfor var_5 in range(var_2 - 1):\n var_4.append(var_1[var_5] + var_1[var_5 + 1] - var_3)\nvar_6 = 0\nfor var_5 in range(var_2 - 1):\n var_7 = min(var_4[var_5], var_1[var_5 + 1])\n var_6 += var_7\n var_4[var_5] -= var_7\n if var_5 + 1 < len(var_4):\n var_4[var_5 + 1] -= min(var_7, var_4[var_5 + 1])\n var_6 += var_4[var_5]\nprint((max(0, var_6)))\n", "fast_code": "var_2, var_7 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nvar_6 = 0\nvar_4 = 0\nfor var_3 in var_1:\n var_5 = max(0, var_6 + var_3 - var_7)\n var_6 = var_3 - var_5\n var_4 += var_5\nprint(var_4)\n", "slow_time": 48021229, "fast_time": 23000113, "speedup": 2.0879, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_14"} -{"pair_id": "python_14584", "problem_id": "p00687", "language": "python", "slow_code": "while 1:\n var_6, var_1, var_2 = list(map(int, input().split()))\n if var_6 == var_1 == var_2 == 0:\n break\n var_3 = 0\n var_4 = [1] + [0] * 2000000\n for var_5 in range(0, var_6 + 1):\n if var_4[var_5]:\n var_4[var_5 + var_1] = var_4[var_5 + var_2] = 1\n else:\n var_3 += 1\n print(var_3)\n", "fast_code": "while 1:\n var_5, var_1, var_2 = list(map(int, input().split()))\n if var_5 == 0:\n break\n var_3 = [0] * (var_5 + max(var_1, var_2) + 1)\n var_3[var_1] = var_3[var_2] = 1\n for var_4 in range(var_5 + 1):\n if var_3[var_4]:\n var_3[var_4 + var_1] = var_3[var_4 + var_2] = 1\n print(var_5 - sum(var_3[: var_5 + 1]))\n", "slow_time": 6644536519, "fast_time": 38149502, "speedup": 174.171, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_1"} -{"pair_id": "python_2262", "problem_id": "p02898", "language": "python", "slow_code": "from collections import Counter, defaultdict, deque\nfrom heapq import heappop, heappush, heapify\nimport sys, bisect, math, itertools, fractions, pprint\n\nsys.setrecursionlimit(10**8)\nvar_4 = 10**9 + 7\nvar_1 = float(\"inf\")\n\n\ndef func_1():\n return int(sys.stdin.readline())\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().split()))\n\n\nvar_5, var_3 = func_2()\nvar_2 = func_2()\nvar_6 = 0\nfor var_7 in var_2:\n if var_7 >= var_3:\n var_6 += 1\nprint(var_6)\n", "fast_code": "var_4, var_3 = list(map(int, input().split()))\nvar_1 = list(map(int, input().split()))\nprint((sum(var_2 >= var_3 for var_2 in var_1)))\n", "slow_time": 38674270, "fast_time": 18629817, "speedup": 2.0759, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_19"} -{"pair_id": "python_732", "problem_id": "p03244", "language": "python", "slow_code": "def func_1():\n var_4, *var_6 = list(map(int, open(0).read().split()))\n var_1 = [0] * int(1e5)\n var_2 = [0] * int(1e5)\n for var_3, var_5 in zip(*[iter(var_6)] * 2):\n var_1[var_3 - 1] += 1\n var_2[var_5 - 1] += 1\n if var_1.index(max(var_1)) == var_2.index(max(var_2)):\n var_7 = max(var_1)\n var_8 = max(var_2)\n var_1[var_1.index(var_7)] = 0\n var_2[var_2.index(var_8)] = 0\n print((min(var_4 - var_7 - max(var_2), var_4 - var_8 - max(var_1))))\n else:\n print((var_4 - max(var_1) - max(var_2)))\n return\n\n\nfunc_1()\n", "fast_code": "def func_2(var_14):\n\n var_13 = {}\n for var_1 in var_14:\n if var_1 in var_13:\n var_13[var_1] += 1\n else:\n var_13[var_1] = 1\n return var_13\n\n\ndef func_1(var_14):\n \"\"\"\"\"\"\n var_6 = func_2(var_14)\n var_13 = {}\n for var_1, var_2 in list(var_6.items()):\n if var_2 in var_13:\n var_13[var_2].append(var_1)\n else:\n var_13[var_2] = [var_1]\n return var_13\n\n\ndef func_3():\n _ = eval(input())\n var_14 = list(map(int, input().split()))\n var_12 = var_14[::2]\n var_3 = var_14[1::2]\n if len(set(var_14)) == 1:\n print((len(var_3)))\n return\n var_11 = func_1(var_12)\n var_5 = sorted(list(var_11.items()), reverse=True)\n var_10 = func_1(var_3)\n var_4 = sorted(list(var_10.items()), reverse=True)\n if len(var_5[0][1]) == 1 and len(var_4[0][1]) == 1 and var_5[0][1] == var_4[0][1]:\n var_8 = len(var_14)\n if len(var_4) != 1:\n var_8 = (len(var_12) - var_5[0][0]) + (len(var_3) - var_4[1][0])\n var_9 = len(var_14)\n if len(var_5) != 1:\n var_9 = (len(var_12) - var_5[1][0]) + (len(var_3) - var_4[0][0])\n print((min(var_8, var_9)))\n return\n else:\n var_7 = (len(var_12) - var_5[0][0]) + (len(var_3) - var_4[0][0])\n print(var_7)\n return\n\n\nfunc_3()\n", "slow_time": 2695635546, "fast_time": 116755726, "speedup": 23.0878, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_20"} -{"pair_id": "python_6742", "problem_id": "p03395", "language": "python", "slow_code": "from scipy.sparse.csgraph import dijkstra\n\n\ndef func_1(var_6, var_11):\n var_7 = [[0] * (var_6 + 1) for _ in range(var_6 + 1)]\n for var_5 in var_11:\n for var_9 in range(var_5, var_6 + 1):\n var_7[var_9][var_9 % var_5] = 1\n return dijkstra(var_7)\n\n\ndef func_2(var_8, var_2, var_4):\n for var_1, var_3 in zip(var_2, var_4):\n if var_1 < var_3:\n return -1\n var_6 = max(var_2)\n var_11 = set(range(1, var_6 + 1))\n var_10 = func_1(var_6, var_11)\n if any(var_10[var_1, var_3] > 50 for var_1, var_3 in zip(var_2, var_4)):\n return -1\n for var_5 in range(var_6, 0, -1):\n var_11.remove(var_5)\n var_10 = func_1(var_6, var_11)\n if any(var_10[var_1, var_3] > 50 for var_1, var_3 in zip(var_2, var_4)):\n var_11.add(var_5)\n return sum(1 << var_5 for var_5 in var_11)\n\n\nvar_8 = int(eval(input()))\nvar_2 = list(map(int, input().split()))\nvar_4 = list(map(int, input().split()))\nprint((func_2(var_8, var_2, var_4)))\n", "fast_code": "from collections import deque\n\n\ndef func_1(var_19, var_5, var_16=0):\n var_10 = deque([var_16])\n var_3 = [-1] * var_19\n var_3[var_16] = 0\n while var_10:\n var_20 = var_10.popleft()\n for var_14 in var_5[var_20]:\n if var_3[var_14] == -1:\n var_3[var_14] = var_3[var_20] + 1\n var_10.append(var_14)\n return var_3\n\n\nvar_9 = int(eval(input()))\nvar_1 = [int(var_13) for var_13 in input().split()]\nvar_2 = [int(var_13) for var_13 in input().split()]\nvar_8 = 51\nvar_12 = [[] for _ in range(var_8)]\nfor var_15 in range(1, var_8):\n for var_17 in range(1, var_15 + 1):\n var_12[var_15].append([var_15 % var_17, 2**var_17])\n\n\ndef func_2(var_11):\n var_8 = 51\n var_12 = [[] for _ in range(var_8)]\n for var_17 in var_11:\n for var_15 in range(var_17, var_8):\n var_12[var_15].append(var_15 % var_17)\n var_4 = []\n for var_15 in range(var_8):\n var_4.append(func_1(var_8, var_12, var_15))\n for var_15 in range(var_9):\n if var_4[var_1[var_15]][var_2[var_15]] < 0:\n return 0\n return 1\n\n\nvar_6 = [var_15 for var_15 in range(1, 51)]\nvar_7 = []\nif func_2(var_6) == 0:\n print((-1))\nelse:\n while var_6:\n while True:\n if func_2(var_6 + var_7):\n if len(var_6) == 0:\n break\n var_6.pop()\n else:\n var_7.append(var_6[-1] + 1 if var_6 else 1)\n var_6 = [var_15 for var_15 in range(1, var_7[-1])]\n break\n if len(var_6) == 0:\n break\n print((sum([1 << var_18 for var_18 in var_7])))\n", "slow_time": 26289887743, "fast_time": 5434327839, "speedup": 4.8377, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_5"} -{"pair_id": "python_2326", "problem_id": "p04000", "language": "python", "slow_code": "var_3, var_5, var_4 = list(map(int, input().split()))\nvar_1 = set([])\nfor var_10 in range(var_4):\n var_6, var_8 = list(map(int, input().split()))\n var_6 -= 1\n var_8 -= 1\n var_1.add((var_6, var_8))\n\nvar_2 = list(var_1)\nvar_7 = [0 for _ in range(10)]\nfor var_10 in range(var_4):\n var_9 = 0\n var_16 = 0\n var_17, var_18 = var_2[var_10]\n\n for var_13 in range(max(0, var_17 - 2), min(var_17, var_3 - 3) + 1):\n for var_14 in range(max(0, var_18 - 2), min(var_18, var_5 - 3) + 1):\n var_16 = 0\n for var_11 in range(3):\n for var_12 in range(3):\n if (var_13 + var_11, var_14 + var_12) in var_1:\n var_16 += 1\n\n var_7[var_16] += 1\nfor var_10 in range(1, 10):\n var_7[var_10] = var_7[var_10] // var_10\nvar_7[0] = (var_3 - 2) * (var_5 - 2) - sum(var_7[1:])\nfor var_15 in var_7:\n print(var_15)\n", "fast_code": "var_4, var_10, var_8 = map(int, input().split())\nfrom itertools import product as pr\nfrom collections import Counter as co\n\nvar_2 = [(var_4 - 2) * (var_10 - 2)] + [0] * 9\nvar_6 = [tuple(map(int, input().split())) for var_5 in range(var_8)]\nfor var_7, var_9 in co(\n co(\n [\n (var_1 - var_11) * var_10 + var_3 - var_12\n for var_11, var_12 in pr(range(3), repeat=2)\n for var_1, var_3 in var_6\n if var_4 - 1 > var_1 - var_11 > 0 < var_3 - var_12 < var_10 - 1\n ]\n ).values()\n).items():\n var_2[var_7] = var_9\n var_2[0] -= var_9\nprint(*var_2, sep=\"\\n\")\n", "slow_time": 154443997, "fast_time": 77073047, "speedup": 2.0039, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_9"} -{"pair_id": "python_1154", "problem_id": "p02889", "language": "python", "slow_code": "from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall\n\nvar_4 = 1001001001\nvar_7, var_6, var_5 = list(map(int, input().split()))\nvar_10 = [[var_4] * var_7 for _ in range(var_7)]\nfor var_11 in range(var_6):\n var_1, var_2, var_3 = list(map(int, input().split()))\n var_1 -= 1\n var_2 -= 1\n var_10[var_1][var_2] = var_3\n var_10[var_2][var_1] = var_3\nfor var_11 in range(var_7):\n var_10[var_11][var_11] = 0\nvar_10 = floyd_warshall(csgraph_from_dense(var_10))\n\n\nvar_9 = [[var_4] * var_7 for _ in range(var_7)]\nfor var_11 in range(var_7):\n for var_12 in range(var_7):\n if var_11 == var_12:\n var_9[var_11][var_12] = 0\n elif var_10[var_11][var_12] <= var_5:\n var_9[var_11][var_12] = 1\nvar_9 = floyd_warshall(csgraph_from_dense(var_9))\n\n\nvar_8 = int(eval(input()))\nfor var_11 in range(var_8):\n var_13, var_14 = list(map(int, input().split()))\n var_13 -= 1\n var_14 -= 1\n if var_9[var_13][var_14] == var_4:\n print((-1))\n else:\n print((int(var_9[var_13][var_14]) - 1))\n", "fast_code": "def func_2(var_7, var_12):\n for var_4 in range(var_12):\n for var_5 in range(var_12):\n for var_6 in range(var_12):\n var_7[var_5][var_6] = min(\n var_7[var_5][var_6], var_7[var_5][var_4] + var_7[var_4][var_6]\n )\n return var_7\n\n\ndef func_1():\n var_12, var_11, var_7 = list(map(int, input().split()))\n var_8 = [[10**15 for var_4 in range(var_12)] for var_4 in range(var_12)]\n for _ in range(var_11):\n var_1, var_2, var_3 = list(map(int, input().split()))\n var_8[var_1 - 1][var_2 - 1] = var_3\n var_8[var_2 - 1][var_1 - 1] = var_3\n var_8 = func_2(var_8, var_12)\n var_9 = [[10**4 for var_4 in range(var_12)] for var_4 in range(var_12)]\n for var_4 in range(var_12):\n for var_5 in range(var_12):\n if var_8[var_4][var_5] <= var_7:\n var_9[var_4][var_5] = 1\n var_9 = func_2(var_9, var_12)\n var_13 = int(eval(input()))\n var_10 = []\n for _ in range(var_13):\n var_10.append(list(map(int, input().split())))\n for var_15 in var_10:\n var_14 = var_9[var_15[0] - 1][var_15[1] - 1]\n if var_14 == 10**4:\n print((-1))\n else:\n print((var_14 - 1))\n\n\nfunc_1()\n", "slow_time": 25172620361, "fast_time": 131266833, "speedup": 191.7668, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_4"} -{"pair_id": "python_13425", "problem_id": "p03298", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef func_1():\n return int(sys.stdin.readline().rstrip())\n\n\ndef func_6():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_2():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef func_3():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef func_7():\n return sys.stdin.readline().rstrip()\n\n\ndef func_4():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef func_5():\n return list(sys.stdin.readline().rstrip())\n\n\nvar_1 = func_1()\nfunc_7 = func_5()\nfrom collections import defaultdict\n\nvar_3 = defaultdict(int)\nvar_4 = defaultdict(int)\nfor var_5 in range(2**var_1):\n var_9 = \"\"\n var_8 = \"\"\n var_11 = \"\"\n var_10 = \"\"\n for var_6 in range(var_1):\n if (var_5 >> var_6) & 1:\n var_9 += func_7[var_6]\n else:\n var_8 += func_7[var_6]\n for var_6 in range(2 * var_1 - 1, var_1 - 1, -1):\n if (var_5 >> (var_6 - var_1)) & 1:\n var_11 += func_7[var_6]\n else:\n var_10 += func_7[var_6]\n var_3[(var_9, var_8)] += 1\n var_4[(var_11, var_10)] += 1\nvar_2 = 0\nfor var_7 in list(var_3.keys()):\n var_2 += var_3[var_7] * var_4[var_7]\nprint(var_2)\n", "fast_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef func_9():\n return [int(var_13) for var_13 in sys.stdin.readline().split()]\n\n\ndef func_7():\n return int(sys.stdin.readline())\n\n\ndef func_11():\n return [list(var_13) for var_13 in sys.stdin.readline().split()]\n\n\ndef func_13():\n var_11 = list(sys.stdin.readline())\n if var_11[-1] == \"\\n\":\n return var_11[:-1]\n return var_11\n\n\ndef func_8(var_9):\n return [func_7() for var_3 in range(var_9)]\n\n\ndef func_10(var_9):\n return [func_9() for var_3 in range(var_9)]\n\n\ndef func_14(var_9):\n return [func_13() for var_3 in range(var_9)]\n\n\ndef func_12(var_9):\n return [func_11() for var_3 in range(var_9)]\n\n\nsys.setrecursionlimit(1000000)\nvar_8 = 1000000007\n\n\ndef func_1():\n return\n\n\ndef func_2():\n return\n\n\ndef func_3():\n var_9 = func_7()\n var_12 = func_13()\n for var_3 in range(2 * var_9):\n var_12[var_3] = ord(var_12[var_3]) - 96\n var_5 = 27\n var_7 = 1 << var_9\n var_10 = [1 << var_4 for var_4 in range(var_9)]\n var_2 = defaultdict(lambda: 0)\n var_6 = [(0, 0)]\n for var_3 in var_12[:var_9][::-1]:\n var_6 = [(var_13[0] * var_5 + var_3, var_13[1]) for var_13 in var_6] + [\n (var_13[0], var_13[1] * var_5 + var_3) for var_13 in var_6\n ]\n for var_3 in var_6:\n var_2[var_3] += 1\n var_1 = 0\n var_6 = [(0, 0)]\n for var_3 in var_12[var_9:]:\n var_6 = [(var_13[0] * var_5 + var_3, var_13[1]) for var_13 in var_6] + [\n (var_13[0], var_13[1] * var_5 + var_3) for var_13 in var_6\n ]\n for var_3 in var_6:\n var_1 += var_2[var_3]\n print(var_1)\n return\n\n\ndef func_4():\n return\n\n\ndef func_5():\n return\n\n\ndef func_6():\n return\n\n\nif __name__ == \"__main__\":\n func_3()\n", "slow_time": 1531659787, "fast_time": 377172094, "speedup": 4.0609, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_16"} -{"pair_id": "python_2906", "problem_id": "p03761", "language": "python", "slow_code": "var_10 = int(eval(input()))\nvar_3 = []\nfor _ in range(var_10):\n var_4 = list(input().strip())\n var_2 = {}\n for var_8 in range(len(var_4)):\n var_11 = var_4[var_8]\n if var_11 not in var_2:\n var_2[var_11] = 0\n var_2[var_11] += 1\n var_3.append(var_2)\nvar_1 = {}\nfor var_8 in range(97, 123):\n var_7 = 0\n var_6 = 50\n for var_2 in var_3:\n if chr(var_8) not in var_2:\n var_7 = 1\n break\n var_6 = min(var_6, var_2[chr(var_8)])\n if var_7 == 0:\n var_1[chr(var_8)] = var_6\nvar_1 = sorted(list(var_1.items()), key=lambda var_11: var_11[0])\nvar_11 = \"\"\nfor var_12 in var_1:\n var_5, var_9 = var_12[0], var_12[1]\n var_11 += var_5 * var_9\nprint(var_11)\n", "fast_code": "_, *var_2 = open(0)\nprint(\n (\n \"\".join(\n sorted(\n var_1 * min(var_3.count(var_1) for var_3 in var_2)\n for var_1 in set(var_2[0])\n )\n )\n )\n)\n", "slow_time": 66372542, "fast_time": 30930805, "speedup": 2.1458, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_19"} -{"pair_id": "python_1321", "problem_id": "p03037", "language": "python", "slow_code": "def func_3(var_5, var_2, var_1, var_6) -> int:\n var_11 = 0\n var_3 = max(var_1)\n var_4 = min(var_6)\n for var_7 in range(1, var_5 + 1):\n if var_3 <= var_7 and var_4 >= var_7:\n var_11 += 1\n return var_11\n\n\ndef func_2():\n var_10 = 1\n\n\ndef func_1():\n var_5, var_2 = list(map(int, input().split()))\n var_1 = []\n var_6 = []\n for _ in range(var_2):\n var_8, var_9 = list(map(int, input().split()))\n var_1.append(var_8)\n var_6.append(var_9)\n print((func_3(var_5, var_2, var_1[:], var_6[:])))\n\n\nif __name__ == \"__main__\":\n func_1()\n", "fast_code": "var_2, var_1 = list(map(int, input().split()))\nvar_4 = -1\nvar_6 = 10**10\nfor _ in range(var_1):\n var_3, var_5 = list(map(int, input().split()))\n var_4 = max(var_4, var_3)\n var_6 = min(var_6, var_5)\nprint((max(var_6 - var_4 + 1, 0)))\n", "slow_time": 1129543532, "fast_time": 19304470, "speedup": 58.512, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_24"} -{"pair_id": "python_14167", "problem_id": "p03064", "language": "python", "slow_code": "var_1, var_7 = 998244353, 0\nvar_3 = [1] + [0] * 7**6\nvar_4 = var_3[:]\nvar_6 = eval(input())\nfor _ in \"_\" * var_6:\n var_2 = eval(input())\n var_7 += var_2\n var_5 = var_7\n while ~var_5:\n var_3[var_5] += var_3[var_5] + var_3[var_5 - var_2] % var_1\n var_4[var_5] += var_4[var_5 - var_2] % var_1\n var_5 -= 1\nprint(\n (3**var_6 + ~var_7 % 2 * var_4[var_7 // 2] * 3 - 3 * sum(var_3[-~var_7 // 2 :]))\n % var_1\n)\n", "fast_code": "import numpy as np\n\nvar_7 = 998244353\nvar_1 = int(eval(input()))\nvar_2 = np.array([int(eval(input())) for var_6 in range(var_1)])\nvar_9 = np.sum(var_2)\nvar_4 = np.zeros((var_1 + 1, var_9 + 1), dtype=np.int64)\nvar_4[0, 0] = 1\nfor var_6 in range(1, var_1 + 1):\n var_3 = var_2[var_6 - 1]\n var_4[var_6, var_3:] += var_4[var_6 - 1, :-var_3]\n var_4[var_6, :] += var_4[var_6 - 1, :] * 2\n var_4[var_6, :] %= var_7\nvar_5 = np.sum(var_4[var_1, (var_9 + 1) // 2 :]) % var_7\nvar_8 = 3**var_1 % var_7 - var_5 * 3\nif var_9 % 2 == 0:\n var_4 = np.zeros((var_1 + 1, var_9 + 1), dtype=np.int64)\n var_4[0, 0] = 1\n for var_6 in range(1, var_1 + 1):\n var_3 = var_2[var_6 - 1]\n var_4[var_6, var_3:] += var_4[var_6 - 1, :-var_3]\n var_4[var_6, :] += var_4[var_6 - 1, :]\n var_4[var_6, :] %= var_7\n var_8 += var_4[var_1, var_9 // 2] * 3\nprint((var_8 % var_7))\n", "slow_time": 418908517, "fast_time": 91997542, "speedup": 4.5535, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_13"} -{"pair_id": "python_3043", "problem_id": "p03305", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import sqrt, hypot, factorial, pi, sin, cos, radians, log10\n\nif sys.version_info.minor >= 5:\n from math import gcd\nelse:\n from fractions import gcd\nfrom heapq import heappop, heappush, heapify, heappushpop\nfrom bisect import bisect_left, bisect_right\nfrom itertools import permutations, combinations, product, accumulate\nfrom operator import itemgetter, mul, xor\nfrom copy import copy, deepcopy\nfrom functools import reduce, partial\nfrom fractions import Fraction\nfrom string import ascii_lowercase, ascii_uppercase, digits\n\n\ndef func_12():\n return sys.stdin.readline().strip()\n\n\ndef func_15(var_7, var_9, var_10):\n return [[var_10] * var_9 for var_15 in range(var_7)]\n\n\ndef func_16(var_7, var_9, var_10, var_13):\n return [[[var_13] * var_10 for var_16 in range(var_9)] for var_15 in range(var_7)]\n\n\ndef func_8(var_29, var_30=1):\n return int(-(-var_29 // var_30))\n\n\ndef func_17(var_29):\n return int((var_29 * 2 + 1) // 2)\n\n\ndef func_10(var_29, var_30, var_3):\n return var_29 * pow(var_30, var_3 - 2, var_3) % var_3\n\n\ndef func_13(var_29, var_30):\n return (var_29 * var_30) // gcd(var_29, var_30)\n\n\ndef func_14(var_21):\n return reduce(func_13, var_21, 1)\n\n\ndef func_11(var_21):\n return reduce(gcd, var_21, var_21[0])\n\n\ndef func_1():\n return int(eval(func_12()))\n\n\ndef func_3():\n return list(map(int, func_12().split()))\n\n\ndef func_2():\n return list(map(int, func_12().split()))\n\n\ndef func_7():\n print(\"Yes\")\n\n\ndef func_5():\n print(\"No\")\n\n\ndef func_6():\n print(\"YES\")\n\n\ndef func_4():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nvar_1 = float(\"inf\")\nvar_3 = 10**9 + 7\n\n\ndef func_9(var_4: int, var_18: list, var_26: int) -> list:\n\n var_24 = [float(\"inf\")] * var_4\n\n var_23 = [(0, var_26)]\n var_24[var_26] = 0\n\n while len(var_23) != 0:\n\n var_14, var_12 = heappop(var_23)\n\n for var_22, var_11 in var_18[var_12]:\n\n if var_24[var_12] + var_11 < var_24[var_22]:\n var_24[var_22] = var_24[var_12] + var_11\n\n heappush(var_23, (var_24[var_22], var_22))\n\n return var_24\n\n\nvar_4, var_2, var_5, var_6 = func_3()\nvar_19 = [[] for var_15 in range(var_4)]\nvar_20 = [[] for var_15 in range(var_4)]\nfor var_15 in range(var_2):\n var_27, var_28, var_7, var_9 = func_3()\n\n var_19[var_27 - 1].append((var_28 - 1, var_7))\n var_19[var_28 - 1].append((var_27 - 1, var_7))\n\n var_20[var_27 - 1].append((var_28 - 1, var_9))\n var_20[var_28 - 1].append((var_27 - 1, var_9))\nvar_31 = func_9(var_4, var_19, var_5 - 1)\nvar_25 = func_9(var_4, var_20, var_6 - 1)\nvar_8 = [0] * var_4\nvar_17 = var_1\n\nfor var_15 in range(var_4 - 1, -1, -1):\n var_8[var_15] = var_17 = min(var_17, var_31[var_15] + var_25[var_15])\n\nfor var_15 in range(var_4):\n print((1000000000000000 - var_8[var_15]))\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**7)\nimport numpy as np\nfrom heapq import *\n\nvar_3, var_2, var_4, var_5 = list(map(int, input().split()))\nvar_1 = 10**15\nvar_14 = [[] for _ in range(var_3 + 1)]\nfor var_17 in range(var_2):\n var_23, var_24, var_6, var_8 = list(map(int, input().split()))\n var_14[var_23].append((var_24, var_6, var_8))\n var_14[var_24].append((var_23, var_6, var_8))\n\n\ndef func_1(var_22, var_18):\n var_12 = [var_1] * (var_3 + 1)\n var_12[var_22] = 0\n var_21 = [(0, var_22)]\n while var_21:\n var_9, var_20 = var_15(var_21)\n\n if var_12[var_20] < var_9:\n continue\n for var_19, *var_13 in var_14[var_20]:\n var_10 = var_9 + var_13[var_18]\n if var_12[var_19] > var_10:\n var_12[var_19] = var_10\n var_16(var_21, (var_10, var_19))\n return var_12\n\n\nvar_10 = np.array(func_1(var_4, 0))\nvar_11 = np.array(func_1(var_5, 1))\nvar_10 += var_11\nvar_7 = 10**15 - np.minimum.accumulate(var_10[::-1])[::-1][1:]\nprint((\"\\n\".join(var_7.astype(str))))\n", "slow_time": 245141126, "fast_time": 100374729, "speedup": 2.4423, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_29"} -{"pair_id": "python_6713", "problem_id": "p00053", "language": "python", "slow_code": "var_7 = [0]\nvar_1 = 10**6\nvar_6 = [1] * var_1\nvar_2 = 0\nfor var_3 in range(2, var_1):\n if var_6[var_3]:\n for var_4 in range(var_3 * var_3, var_1, var_3):\n var_6[var_4] = 0\n var_2 += var_3\n var_7.append(var_2)\nwhile 1:\n var_5 = eval(input())\n if var_5 == 0:\n break\n print(var_7[var_5])\n", "fast_code": "import math\n\nvar_6 = 105000\nvar_7 = int(math.sqrt(var_6))\nvar_5 = [1] * var_6\nvar_5[0] = 0\nfor var_1 in range(1, var_7):\n if var_5[var_1]:\n for var_2 in range(2 * var_1 + 1, var_6, var_1 + 1):\n var_5[var_2] = 0\nwhile True:\n var_3 = int(input())\n if not var_3:\n break\n var_1, var_4, var_8 = 0, 0, 0\n while var_4 < var_3:\n if var_5[var_1] == 1:\n var_4 += 1\n var_8 += var_1 + 1\n var_1 += 1\n print(var_8)\n", "slow_time": 126327816139, "fast_time": 8006812925, "speedup": 15.7775, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_2"} +{"pair_id": "python_14212", "problem_id": "p00114", "language": "python", "slow_code": "from functools import reduce\n\n\ndef f(a, b):\n p, q = a, b\n while q != 0:\n p, q = q, p % q\n return a / p * b\n\n\nwhile 1:\n x = list(map(int, input().split()))\n if any(x) == 0:\n break\n A = []\n for i in range(0, 6, 2):\n c = 1\n while pow(x[i], c, x[i + 1]) != 1:\n c += 1\n A.append(c)\n x = reduce(lambda a, b: f(a, b), A)\n print(x)\n", "fast_code": "def gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a % b)\n\n\ndef lcm(a, b):\n return a * b / gcd(a, b)\n\n\ndef times(a, m):\n c = 1\n x = a * 1 % m\n while x != 1:\n x = a * x % m\n c += 1\n return c\n\n\nwhile True:\n try:\n x, y, z = 1, 1, 1\n c1, c2, c3 = 0, 0, 0\n a1, m1, a2, m2, a3, m3 = list(map(int, input().split()))\n if sum([a1, m1, a2, m2, a3, m3]) == 0:\n break\n c1 = times(a1, m1)\n c2 = times(a2, m2)\n c3 = times(a3, m3)\n print((int(lcm(c1, lcm(c2, c3)))))\n except EOFError:\n break\n", "slow_time": 1215695347, "fast_time": 213476013, "speedup": 5.6948, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_1"} +{"pair_id": "python_6266", "problem_id": "p02904", "language": "python", "slow_code": "from collections import defaultdict, deque, Counter\nfrom heapq import heappush, heappop, heapify\nimport math\nimport bisect\nimport random\nfrom itertools import permutations, accumulate, combinations, product\nimport sys\nimport string\nfrom bisect import bisect_left, bisect_right\nfrom math import factorial, ceil, floor\nfrom operator import mul\nfrom functools import reduce\n\nINF = float(\"inf\")\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef S():\n return sys.stdin.readline().strip()\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\ndef SRL(n):\n return [list(S()) for i in range(n)]\n\n\ndef MSRL(n):\n return [[int(j) for j in list(S())] for i in range(n)]\n\n\nmod = 1000000007\n\n\nclass SegmentTree:\n def __init__(self, init_val, ide_ele, op):\n n = len(init_val)\n self.num = 2 ** (n - 1).bit_length()\n self.seg = [ide_ele] * 2 * self.num\n self.ide_ele = ide_ele\n self.op = op\n for i in range(n):\n self.seg[i + self.num - 1] = init_val[i]\n\n for i in range(self.num - 2, -1, -1):\n self.seg[i] = self.op(self.seg[2 * i + 1], self.seg[2 * i + 2])\n\n def update(self, k, x):\n k += self.num - 1\n self.seg[k] = x\n while k + 1:\n k = (k - 1) // 2\n self.seg[k] = self.op(self.seg[k * 2 + 1], self.seg[k * 2 + 2])\n\n def query(self, p, q):\n if q <= p:\n return self.ide_ele\n p += self.num - 1\n q += self.num - 2\n res = self.ide_ele\n while q - p > 1:\n if p & 1 == 0:\n res = self.op(res, self.seg[p])\n if q & 1 == 1:\n res = self.op(res, self.seg[q])\n p = p // 2\n q = (q - 2) // 2\n if p == q:\n res = self.op(res, self.seg[p])\n else:\n res = self.op(self.seg[p], self.op(res, self.seg[q]))\n return res\n\n\nn, k = LI()\nL = LI()\nmin_ST = SegmentTree(L, INF, min)\nmax_ST = SegmentTree(L, -INF, max)\ncnt = 1\nfor i in range(n - k):\n if min_ST.query(i, i + k) == L[i] and max_ST.query(i + 1, i + k + 1) == L[i + k]:\n continue\n else:\n cnt += 1\nret = -INF\nincreasing_block_num = 0\nmax_len = 0\nfor j in range(n):\n if L[j] >= ret:\n max_len += 1\n else:\n if max_len >= k:\n increasing_block_num += 1\n max_len = 1\n ret = L[j]\nif max_len >= k:\n increasing_block_num += 1\nif increasing_block_num:\n print((cnt - (increasing_block_num - 1)))\nelse:\n print(cnt)\n", "fast_code": "from collections import deque\nfrom itertools import accumulate\n\n\ndef slide_min(A, K):\n res = []\n Q = deque()\n for i, a in enumerate(A):\n while Q and A[Q[-1]] > a:\n Q.pop()\n Q.append(i)\n if Q[0] == i - K:\n Q.popleft()\n res.append(Q[0])\n return res[K - 1 :]\n\n\nN, K, *P = list(map(int, open(0).read().split()))\nmi = slide_min(P, K)\nma = slide_min([-p for p in P], K)\nB = [mi != i or ma != i + K for i, (mi, ma) in enumerate(zip(mi, ma[1:]))]\nA = [0] + list(accumulate(x < y for x, y in zip(P, P[1:])))\nS = [y - x != K - 1 for x, y in zip(A, A[K - 1 :])]\nans = 1 + sum(b for b, s in zip(B, S[1:]) if s)\nif S[0] and not all(S):\n ans += 1\nprint(ans)\n", "slow_time": 188208834, "fast_time": 80734418, "speedup": 2.3312, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_9"} +{"pair_id": "python_15523", "problem_id": "p02695", "language": "python", "slow_code": "n, m, q = list(map(int, input().split()))\nl = []\nfor i in range(q):\n l1, l2, l3, l4 = list(map(int, input().split()))\n l.append([l1, l2, l3, l4])\nB = []\nfor a in range(1, m + 1):\n for b in range(a, m + 1):\n for c in range(b, m + 1):\n for d in range(c, m + 1):\n for e in range(d, m + 1):\n for f in range(e, m + 1):\n for g in range(f, m + 1):\n for h in range(g, m + 1):\n for i in range(h, m + 1):\n for j in range(i, m + 1):\n L = [a, b, c, d, e, f, g, h, i, j]\n A = []\n for I in range(n):\n A.append(L[I])\n C = 0\n for k in range(q):\n if (\n A[l[k][1] - 1] - A[l[k][0] - 1]\n == l[k][2]\n ):\n C += l[k][3]\n B.append(C)\nprint((max(B)))\n", "fast_code": "from collections import deque\n\nN, M, Q = list(map(int, input().split()))\nQUERY = [0] * Q\nfor i in range(Q):\n QUERY[i] = tuple(map(int, input().split()))\nans = 0\nD = deque()\nD.append((1, [1]))\ndlen = 1\nwhile dlen != 0:\n Alen, A = D.pop()\n dlen -= 1\n if Alen == N:\n e = 0\n for a, b, c, d in QUERY:\n a -= 1\n b -= 1\n if A[b] - A[a] == c:\n e += d\n ans = max(ans, e)\n else:\n for AA in range(A[-1], M + 1):\n D.append((Alen + 1, A + [AA]))\n dlen += 1\nprint(ans)\n", "slow_time": 6526662255, "fast_time": 901201428, "speedup": 7.2422, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_8"} +{"pair_id": "python_14601", "problem_id": "p03183", "language": "python", "slow_code": "from sys import stdin, stdout, setrecursionlimit\nfrom collections import deque, defaultdict, Counter\nfrom heapq import heappush, heappop\nfrom functools import lru_cache\nimport math\n\nsetrecursionlimit(10**6)\nrl = lambda: stdin.readline()\nrll = lambda: stdin.readline().split()\nrli = lambda: list(map(int, stdin.readline().split()))\nrlf = lambda: list(map(float, stdin.readline().split()))\nINF, NINF = float(\"inf\"), float(\"-inf\")\nMOD = 10**9 + 7\n\n\ndef main():\n n = int(rl())\n A = []\n for _ in range(n):\n w, s, v = rli()\n A.append((w, s, v))\n ans = 0\n A.sort(key=lambda I: (I[0] + I[1]))\n maxs = 2 * 10**4 + 100\n dp = [0 for _ in range(maxs + 1)]\n for w, s, v in A:\n for i in range(maxs, -1, -1):\n if i - w < 0:\n continue\n if i - w > s:\n continue\n dp[i] = max(dp[i], dp[i - w] + v)\n ans = max(ans, dp[i])\n print(ans)\n stdout.close()\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "def f(n):\n dp = [0] * (n * 10**4 + 1)\n bs = [list(map(int, input().split())) for _ in range(n)]\n bs.sort(key=lambda x: x[0] + x[1])\n for w, s, v in bs:\n for i in range(w + s, w - 1, -1):\n dpw = dp[i - w] + v\n if dpw > dp[i]:\n dp[i] = dpw\n print((max(dp)))\n\n\nn = int(eval(input()))\nf(n)\n", "slow_time": 5545721805, "fast_time": 1285261290, "speedup": 4.3149, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_2"} +{"pair_id": "python_16315", "problem_id": "p03309", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\nN = INT()\nA = LIST()\n\n\ndef check(m):\n sm = 0\n for i, a in enumerate(A):\n sm += abs(a - (m + i + 1))\n return sm\n\n\nlow = -(10**9)\nhi = 10**9\nwhile low + 2 < hi:\n m1 = (low * 2 + hi) // 3\n m2 = (low + hi * 2) // 3\n res1 = check(m1)\n res2 = check(m2)\n\n if res1 <= res2:\n hi = m2\n else:\n low = m1\nprint((min(check(m1), check(m2))))\n", "fast_code": "n = int(eval(input()))\na = list(map(int, input().split()))\nfor i in range(n):\n a[i] -= i\na.sort()\nx = a[n // 2]\nans = 0\nfor i in range(n):\n ans += abs(a[i] - x)\nprint(ans)\n", "slow_time": 198949924, "fast_time": 27933979, "speedup": 7.1221, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_26"} +{"pair_id": "python_6727", "problem_id": "p00775", "language": "python", "slow_code": "while True:\n R, N = list(map(int, input().split()))\n if not (R | N):\n break\n geta = 20\n buildings = [0] * (geta * 2)\n for _ in range(N):\n xl, xr, h = list(map(int, input().split()))\n for i in range(xl + geta, xr + geta):\n buildings[i] = max(buildings[i], h)\n left, right = 0, 20\n for _ in range(100):\n mid = (left + right) / 2\n flag = True\n for i in range(-R + geta, R + geta):\n if i < geta:\n y = pow(R * R - (i - geta + 1) * (i - geta + 1), 0.5)\n flag &= buildings[i] >= y - R + mid\n else:\n y = pow(R * R - (i - geta) * (i - geta), 0.5)\n flag &= buildings[i] >= y - R + mid\n if flag:\n left = mid\n else:\n right = mid\n print((\"{:.20f}\".format(left)))\n", "fast_code": "from math import sqrt\n\nwhile True:\n R, N = list(map(int, input().split()))\n if not (R | N):\n break\n geta = 20\n buildings = [0] * (geta * 2)\n for _ in range(N):\n xl, xr, h = list(map(int, input().split()))\n for i in range(xl + geta, xr + geta):\n buildings[i] = max(buildings[i], h)\n print(\n (\n min(\n buildings[i]\n - sqrt(R * R - (i - geta + (i < geta)) * (i - geta + (i < geta)))\n + R\n for i in range(-R + geta, R + geta)\n )\n )\n )\n", "slow_time": 536358030, "fast_time": 67271254, "speedup": 7.9731, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_5"} +{"pair_id": "python_17038", "problem_id": "p03475", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**6)\ninput = sys.stdin.readline\nfrom math import floor, ceil, sqrt, factorial, log\nfrom heapq import heappop, heappush, heappushpop\nfrom collections import Counter, defaultdict, deque\nfrom itertools import (\n accumulate,\n permutations,\n combinations,\n product,\n combinations_with_replacement,\n)\nfrom bisect import bisect_left, bisect_right\nfrom copy import deepcopy\n\ninf = float(\"inf\")\nmod = 10**9 + 7\n\n\ndef pprint(*A):\n for a in A:\n print(*a, sep=\"\\n\")\n\n\ndef INT_(n):\n return int(n) - 1\n\n\ndef MI():\n return map(int, input().split())\n\n\ndef MF():\n return map(float, input().split())\n\n\ndef MI_():\n return map(INT_, input().split())\n\n\ndef LI():\n return list(MI())\n\n\ndef LI_():\n return [int(x) - 1 for x in input().split()]\n\n\ndef LF():\n return list(MF())\n\n\ndef LIN(n: int):\n return [I() for _ in range(n)]\n\n\ndef LLIN(n: int):\n return [LI() for _ in range(n)]\n\n\ndef LLIN_(n: int):\n return [LI_() for _ in range(n)]\n\n\ndef LLI():\n return [list(map(int, l.split())) for l in input()]\n\n\ndef I():\n return int(input())\n\n\ndef F():\n return float(input())\n\n\ndef ST():\n return input().replace(\"\\n\", \"\")\n\n\ndef main():\n N = I()\n CSF = LLIN(N - 1)\n\n def solve(CSF):\n now = 0\n for i, (c, s, f) in enumerate(CSF):\n if now <= s:\n now = s + c\n continue\n else:\n if now % f != 0:\n now += f - now % f\n now += c\n print(now)\n\n for i in range(N):\n solve(CSF[i:])\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\nn, *csf = list(map(int, sys.stdin.read().split()))\ncsf = list(zip(*[iter(csf)] * 3))\n\n\ndef main():\n for i in range(n - 1):\n t = 0\n for c, s, f in csf[i:]:\n if t <= s:\n t = s + c\n else:\n t = s + ((t - s + f - 1) // f) * f + c\n print(t)\n print((0))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 159141389, "fast_time": 37355456, "speedup": 4.2602, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_13"} +{"pair_id": "python_1263", "problem_id": "p03294", "language": "python", "slow_code": "import sys\n\n\nimport functools\n\n\ndef gcd(a, b):\n while b != 0:\n a, b = b, a % b\n return a\n\n\ndef lcm(a, b):\n return a * b // gcd(a, b)\n\n\ndef main():\n n, *a = (int(x) for x in sys.stdin.read().split())\n m = functools.reduce(lcm, a)\n f = sum([(m - 1) % a[i] for i in range(n)])\n print(f)\n\n\nif __name__ == \"__main__\":\n\n main()\n", "fast_code": "N = eval(input())\nprint((sum(map(int, input().split())) - int(N)))\n", "slow_time": 41281928, "fast_time": 11843237, "speedup": 3.4857, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_3"} +{"pair_id": "python_15110", "problem_id": "p02948", "language": "python", "slow_code": "from heapq import *\n\n(n, m), *t = [list(map(int, s.split())) for s in open(0)]\nq = [0] * 7**6\nv = [[] for _ in q]\nz = 0\nfor a, b in t:\n v[a - 1] += [b]\nfor i in v[:m]:\n for j in i:\n heappush(q, -j)\n z -= heappop(q)\nprint(z)\n", "fast_code": "from heapq import *\n\nN, M, *t = list(map(int, open(0).read().split()))\nv = [[] for _ in \"_\" * M]\nz = i = 0\nfor _ in \"_\" * N:\n M < t[i] or v[t[i] - 1].append(t[i + 1])\n i += 2\nq = []\nfor i in v:\n for j in i:\n heappush(q, -j)\n z -= len(q) and heappop(q)\nprint(z)\n", "slow_time": 3004564549, "fast_time": 48917213, "speedup": 61.4214, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_29"} +{"pair_id": "python_14313", "problem_id": "p03972", "language": "python", "slow_code": "import itertools\nimport os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nIINF = 10**18\nMOD = 10**9 + 7\n\n\nclass UnionFind:\n def __init__(self, size=None, nodes=None):\n \"\"\"\"\"\"\n assert size is not None or nodes is not None\n if size is not None:\n self._parents = [i for i in range(size)]\n self._ranks = [0 for _ in range(size)]\n self._sizes = [1 for _ in range(size)]\n else:\n self._parents = {k: k for k in nodes}\n self._ranks = {k: 0 for k in nodes}\n self._sizes = {k: 1 for k in nodes}\n\n def unite(self, x, y):\n \"\"\"\"\"\"\n x = self.root(x)\n y = self.root(y)\n if x == y:\n return\n\n if self._ranks[x] > self._ranks[y]:\n\n self._parents[y] = x\n self._sizes[x] += self._sizes[y]\n else:\n\n self._parents[x] = y\n self._sizes[y] += self._sizes[x]\n if self._ranks[x] == self._ranks[y]:\n self._ranks[y] += 1\n\n def root(self, x):\n \"\"\"\"\"\"\n if self._parents[x] == x:\n return x\n self._parents[x] = self.root(self._parents[x])\n return self._parents[x]\n\n def size(self, x):\n \"\"\"\"\"\"\n return self._sizes[self.root(x)]\n\n\nW, H = list(map(int, sys.stdin.readline().split()))\nP = [int(sys.stdin.readline()) for _ in range(W)]\nQ = [int(sys.stdin.readline()) for _ in range(H)]\n\n\ndef test():\n edges = []\n vs = []\n for h, w in itertools.product(list(range(H + 1)), list(range(W + 1))):\n if w < W:\n edges.append((P[w], (w, h), (w + 1, h)))\n if h < H:\n edges.append((Q[h], (w, h), (w, h + 1)))\n for h, w in itertools.product(list(range(H + 1)), list(range(W + 1))):\n vs.append((w, h))\n edges.sort()\n\n uf = UnionFind(nodes=vs)\n ret = 0\n for s, v, u in edges:\n if uf.root(v) != uf.root(u):\n uf.unite(v, u)\n ret += s\n return ret\n\n\nhs = P.copy()\n\nvs = Q.copy()\nhs.sort(reverse=True)\nvs.sort(reverse=True)\nans = 0\nv_nodes = W + 1\nh_nodes = H + 1\nwhile hs or vs:\n if not vs or (hs and hs[-1] < vs[-1]):\n\n ans += hs.pop() * h_nodes\n v_nodes -= 1\n else:\n\n ans += vs.pop() * v_nodes\n h_nodes -= 1\nprint(ans)\n", "fast_code": "w, h = list(map(int, input().split()))\na = [10**18] + [int(eval(input())) for i in range(w)]\nb = [10**18] + [int(eval(input())) for i in range(h)]\na.sort(reverse=True)\nb.sort(reverse=True)\nans = 0\nwhile len(a) > 1 or len(b) > 1:\n if a[-1] < b[-1]:\n ans += a[-1] * len(b)\n a.pop()\n else:\n ans += b[-1] * len(a)\n b.pop()\nprint(ans)\n", "slow_time": 217485236, "fast_time": 56542537, "speedup": 3.8464, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_2"} +{"pair_id": "python_14637", "problem_id": "p00267", "language": "python", "slow_code": "def counting_sort(nmax, la):\n f = [0] * (nmax + 1)\n nmax = 0\n for a in la:\n f[a] += 1\n if a > nmax:\n nmax = a\n k, i = len(la), nmax\n la = []\n while k:\n if f[i]:\n la += [i] * f[i]\n k -= f[i]\n i -= 1\n return la\n\n\nwhile True:\n n = int(eval(input()))\n if n == 0:\n break\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n a = counting_sort(100000, a)\n b = counting_sort(100000, b)\n ans, i = n, -1\n for k in range(0, n, 2):\n i += 1\n if a[k] > b[i]:\n ans = k + 1\n break\n print((\"NA\" if ans == n else ans))\n", "fast_code": "while True:\n n = int(eval(input()))\n if n == 0:\n break\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n a.sort(reverse=True)\n b.sort(reverse=True)\n ans, i = n, -1\n for k in range(0, n, 2):\n i += 1\n if a[k] > b[i]:\n ans = k + 1\n break\n print((\"NA\" if ans == n else ans))\n", "slow_time": 204540895, "fast_time": 43812234, "speedup": 4.6686, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_0"} +{"pair_id": "python_13388", "problem_id": "p02790", "language": "python", "slow_code": "x, y = map(int, input().split())\nif x < y:\n for i in range(0, y):\n print(x, end=\"\")\nelse:\n for i in range(0, x):\n print(y, end=\"\")\n", "fast_code": "a, b = input().split()\nprint((min(a * int(b), b * int(a))))\n", "slow_time": 20608075, "fast_time": 10102751, "speedup": 2.0398, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_1"} +{"pair_id": "python_8934", "problem_id": "p02641", "language": "python", "slow_code": "import sys\n\nX, N = list(map(int, input().split()))\np = list(map(int, input().split()))\nmin_dif = 10000\noutput = 10000\nfor i in range(10000):\n if (5000 - i in p) == False:\n if abs(X - (5000 - i)) <= min_dif:\n min_dif = abs(X - (5000 - i))\n output = 5000 - i\nprint(output)\n", "fast_code": "X, N = list(map(int, input().split()))\np = list(map(int, input().split()))\ndiff = 100\nfor x in range(102):\n if x not in p and abs(X - x) < diff:\n diff = abs(X - x)\n ans = x\nprint(ans)\n", "slow_time": 1753973423, "fast_time": 31981456, "speedup": 54.8435, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_23"} +{"pair_id": "python_36", "problem_id": "p03805", "language": "python", "slow_code": "import itertools\n\nN, M = list(map(int, input().split()))\nedges = {tuple(sorted(map(int, input().split()))) for i in range(M)}\nans = 0\nfor i in itertools.permutations(list(range(2, N + 1)), N - 1):\n l = [1] + list(i)\n ans += sum(1 for edge in zip(l, l[1:]) if tuple(sorted(edge)) in edges) == N - 1\nprint(ans)\n", "fast_code": "def dfs(parent, connect, passed, N):\n cnt = 0\n passed.append(parent)\n if len(passed) == N:\n cnt = 1\n for next_ in connect[parent]:\n if next_ in passed:\n continue\n cnt += dfs(next_, connect, passed, N)\n passed.pop()\n return cnt\n\n\nN, M = list(map(int, input().split()))\nconnect = [[] for _ in range(N)]\nfor _ in range(M):\n a, b = list(map(int, input().split()))\n connect[a - 1].append(b - 1)\n connect[b - 1].append(a - 1)\nans = dfs(0, connect, [], N)\nprint(ans)\n", "slow_time": 4541785072, "fast_time": 53423132, "speedup": 85.0153, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_29"} +{"pair_id": "python_14341", "problem_id": "p03025", "language": "python", "slow_code": "N, A, B, C = list(map(int, input().split()))\nmod = 10**9 + 7\n\n\nFACT = [1, 1]\nFACT_INV = [1, 1]\nfor i in range(2, 2 * 10**5 + 1):\n FACT.append(FACT[-1] * i % mod)\n FACT_INV.append(FACT_INV[-1] * pow(i, mod - 2, mod) % mod)\n\n\ndef Combi(N, K):\n return FACT[N] * FACT_INV[N - K] * FACT_INV[K] % mod\n\n\nANS = 0\nSUM = A + B\nA_n = pow(A, N, mod) * pow(pow(SUM, mod - 2, mod), N, mod) % mod\nB_n = pow(B, N, mod) * pow(pow(SUM, mod - 2, mod), N, mod) % mod\nSUMINV = pow(SUM, mod - 2, mod)\nfor i in range(N):\n ANS = (\n ANS\n + (A_n * pow(B, i, mod) + B_n * pow(A, i, mod))\n * Combi(N - 1 + i, i)\n * pow(SUMINV, i, mod)\n * (N + i)\n ) % mod\nprint((ANS * 100 * pow(100 - C, mod - 2, mod) % mod))\n", "fast_code": "N, A, B, C = list(map(int, input().split()))\nmod = 10**9 + 7\n\n\nFACT = [1]\nfor i in range(1, 2 * 10**5 + 1):\n FACT.append(FACT[-1] * i % mod)\nFACT_INV = [pow(FACT[-1], mod - 2, mod)]\nfor i in range(2 * 10**5, 0, -1):\n FACT_INV.append(FACT_INV[-1] * i % mod)\nFACT_INV = FACT_INV[::-1]\n\n\ndef Combi(N, K):\n return FACT[N] * FACT_INV[N - K] * FACT_INV[K] % mod\n\n\nANS = 0\nSUM = A + B\nA_n = pow(A, N, mod) * pow(pow(SUM, mod - 2, mod), N, mod) % mod\nB_n = pow(B, N, mod) * pow(pow(SUM, mod - 2, mod), N, mod) % mod\nSUMINV = pow(SUM, mod - 2, mod)\nfor i in range(N):\n ANS = (\n ANS\n + (A_n * pow(B, i, mod) + B_n * pow(A, i, mod))\n * Combi(N - 1 + i, i)\n * pow(SUMINV, i, mod)\n * (N + i)\n ) % mod\nprint((ANS * 100 * pow(100 - C, mod - 2, mod) % mod))\n", "slow_time": 216768447925, "fast_time": 32980310839, "speedup": 6.5727, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_5"} +{"pair_id": "python_6130", "problem_id": "p03173", "language": "python", "slow_code": "from numpy import *\n\nn, a = open(0)\nn = int(n)\na = cumsum(int64([0] + a.split()))\ndp = zeros((n, n + 1), \"i8\")\nfor k in range(1, n):\n l = arange(n - k)\n r = arange(k + 1, n + 1)\n m = (arange(1, k + 1) + l[:, newaxis]).T\n dp[l, r] = amin(dp[l, m] + dp[m, r], 0) + a[r] - a[l]\nprint((dp[0, n]))\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**7)\nimport numpy as np\n\n\"\"\"\"\"\"\nN = int(eval(input()))\nA = np.array(input().split(), np.int64)\n\nAcum = np.zeros((N, N + 1), dtype=np.int64)\nfor L in range(N):\n Acum[L, L + 1 :] = A[L:].cumsum()\ndp = np.zeros((N, N + 1), dtype=np.int64)\nfor size in range(2, N + 1):\n for L in range(N - size + 1):\n R = L + size\n dp[L, R] = (dp[L, L + 1 : R] + dp[L + 1 : R, R]).min() + Acum[L, R]\nanswer = dp[0, N]\nprint(answer)\n", "slow_time": 9597255804, "fast_time": 66888095, "speedup": 143.4823, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_6"} +{"pair_id": "python_14316", "problem_id": "p03972", "language": "python", "slow_code": "import itertools\nimport os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nIINF = 10**18\nMOD = 10**9 + 7\n\n\nclass UnionFind:\n def __init__(self, size=None, nodes=None):\n \"\"\"\"\"\"\n assert size is not None or nodes is not None\n if size is not None:\n self._parents = [i for i in range(size)]\n self._ranks = [0 for _ in range(size)]\n self._sizes = [1 for _ in range(size)]\n else:\n self._parents = {k: k for k in nodes}\n self._ranks = {k: 0 for k in nodes}\n self._sizes = {k: 1 for k in nodes}\n\n def unite(self, x, y):\n \"\"\"\"\"\"\n x = self.root(x)\n y = self.root(y)\n if x == y:\n return\n\n if self._ranks[x] > self._ranks[y]:\n\n self._parents[y] = x\n self._sizes[x] += self._sizes[y]\n else:\n\n self._parents[x] = y\n self._sizes[y] += self._sizes[x]\n if self._ranks[x] == self._ranks[y]:\n self._ranks[y] += 1\n\n def root(self, x):\n \"\"\"\"\"\"\n if self._parents[x] == x:\n return x\n self._parents[x] = self.root(self._parents[x])\n return self._parents[x]\n\n def size(self, x):\n \"\"\"\"\"\"\n return self._sizes[self.root(x)]\n\n\nW, H = list(map(int, sys.stdin.readline().split()))\nP = [int(sys.stdin.readline()) for _ in range(W)]\nQ = [int(sys.stdin.readline()) for _ in range(H)]\n\n\ndef test():\n edges = []\n vs = []\n for h, w in itertools.product(list(range(H + 1)), list(range(W + 1))):\n if w < W:\n edges.append((P[w], (w, h), (w + 1, h)))\n if h < H:\n edges.append((Q[h], (w, h), (w, h + 1)))\n for h, w in itertools.product(list(range(H + 1)), list(range(W + 1))):\n vs.append((w, h))\n edges.sort()\n\n uf = UnionFind(nodes=vs)\n ret = 0\n for s, v, u in edges:\n if uf.root(v) != uf.root(u):\n uf.unite(v, u)\n ret += s\n return ret\n\n\nhs = P.copy()\n\nvs = Q.copy()\nhs.sort(reverse=True)\nvs.sort(reverse=True)\nans = 0\nv_nodes = W + 1\nh_nodes = H + 1\nwhile hs or vs:\n if not vs or (hs and hs[-1] < vs[-1]):\n\n ans += hs.pop() * h_nodes\n v_nodes -= 1\n else:\n\n ans += vs.pop() * v_nodes\n h_nodes -= 1\nprint(ans)\n", "fast_code": "import os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nIINF = 10**18\nMOD = 10**9 + 7\n\nW, H = list(map(int, sys.stdin.readline().split()))\nP = [int(sys.stdin.readline()) for _ in range(W)]\nQ = [int(sys.stdin.readline()) for _ in range(H)]\nedges = []\nfor p in P:\n edges.append((p, \"P\"))\nfor q in Q:\n edges.append((q, \"Q\"))\nedges.sort()\nans = 0\na = W + 1\nb = H + 1\nfor e, pq in edges:\n if pq == \"P\":\n ans += e * b\n a -= 1\n else:\n ans += e * a\n b -= 1\nprint(ans)\n", "slow_time": 217485236, "fast_time": 62064583, "speedup": 3.5042, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_12"} +{"pair_id": "python_10632", "problem_id": "p04006", "language": "python", "slow_code": "import sys, queue, math, copy, itertools, bisect, collections, heapq\n\n\ndef main():\n INF = float(\"inf\")\n LI = lambda: [int(x) for x in sys.stdin.readline().split()]\n N, x = LI()\n a = LI()\n N0 = 2 ** (N.bit_length())\n st = [INF] * (2 * N0)\n\n def update(i, x):\n i += N0 - 1\n st[i] = x\n while i > 0:\n i = (i - 1) // 2\n st[i] = min(st[i * 2 + 1], st[i * 2 + 2])\n\n def query(l, r):\n l += N0\n r += N0\n ret = INF\n while l < r:\n if l % 2:\n ret = min(ret, st[l - 1])\n l += 1\n if r % 2:\n r -= 1\n ret = min(ret, st[r - 1])\n l >>= 1\n r >>= 1\n return ret\n\n for i, j in enumerate(a):\n update(i, j)\n ans = INF\n for i in range(N):\n tmp = i * x\n for j in range(N):\n l = j - i\n if l < 0:\n l += N\n tmp += min(query(0, j + 1), query(l, N))\n else:\n tmp += query(l, j + 1)\n ans = min(ans, tmp)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N, x = list(map(int, input().split()))\nA = list(map(int, input().split()))\nA += A\nINF = 10**18\nans = INF\nB = [INF] * N\nfor cnt in range(N):\n for i in range(N):\n B[i] = min(B[i], A[N + i - cnt])\n ans = min(ans, cnt * x + sum(B))\nprint(ans)\n", "slow_time": 102366711, "fast_time": 33180849, "speedup": 3.0851, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_24"} +{"pair_id": "python_17556", "problem_id": "p03456", "language": "python", "slow_code": "x = int(input().replace(\" \", \"\"))\nprint((\"Yes\" if x in [i * i for i in range(1000)] else \"No\"))\n", "fast_code": "print((\"No\" if int(input().replace(\" \", \"\")) ** 0.5 % 1 else \"Yes\"))\n", "slow_time": 39909209, "fast_time": 8767277, "speedup": 4.5521, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_17"} +{"pair_id": "python_6209", "problem_id": "p00040", "language": "python", "slow_code": "import sys\nimport os\nimport math\n\nN = int(eval(input()))\nalphabet = \"abcdefghijklmnopqrstuvwxyz\"\n\n\ndef encode(s, alpha, beta):\n t = []\n for c in s:\n if c == \" \":\n t.append(c)\n else:\n gamma = ord(c) - 97\n v = (alpha * gamma + beta) % 26\n w = alphabet[v]\n t.append(w)\n return \"\".join(t)\n\n\nfor i in range(N):\n s = input().strip()\n for a in range(0, 26):\n for b in range(0, 26):\n encoded_this = encode(\"this\", a, b)\n encoded_that = encode(\"that\", a, b)\n if encoded_this in s or encoded_that in s:\n encoded_alphabet = encode(alphabet, a, b)\n table = str.maketrans(encoded_alphabet, alphabet)\n dst = s.translate(table)\n print(dst)\n", "fast_code": "A2Z = \"abcdefghijklmnopqrstuvwxyz\"\n\n\ndef affine(msg, a, b):\n s = \"\"\n for c in msg:\n s += A2Z[(A2Z.index(c) * a + b) % 26] if \"a\" <= c <= \"z\" else c\n return s\n\n\ndef rot(msg, a):\n a = a % 26\n L = A2Z[a:] + A2Z[:a]\n s = \"\"\n for c in msg:\n s += L[A2Z.index(c)] if \"a\" <= c <= \"z\" else c\n return s\n\n\ndef checkkey(s):\n c0 = \"t\"\n for i in range(26):\n a = 0\n x = affine(s, i, 0)\n c = A2Z.index(x[0])\n if c != 19:\n a = (19 - c) % 26\n x = rot(x, a)\n if x in [\"this\", \"that\"]:\n return i, a\n return -1, -1\n\n\nn = eval(input())\nwhile n:\n n -= 1\n s = input()\n for w in s.split():\n if len(w) == 4:\n a, b = checkkey(w)\n if a != -1:\n break\n print(affine(s, a, b))\n", "slow_time": 559587423, "fast_time": 96575987, "speedup": 5.7943, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_1"} +{"pair_id": "python_3544", "problem_id": "p03261", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\ninf = 1 << 60\nmod = 1000000007\nni = lambda: int(ns())\nnin = lambda y: [ni() for _ in range(y)]\nna = lambda: list(map(int, stdin.readline().split()))\nnan = lambda y: [na() for _ in range(y)]\nns = lambda: stdin.readline().rstrip()\nnsn = lambda y: [ns() for _ in range(y)]\nncl = lambda y: [list(ns()) for _ in range(y)]\nnas = lambda: stdin.readline().split()\nfrom collections import defaultdict\n\nN = ni()\nW = nsn(N)\nd = defaultdict(int)\nflag = True\nfor i in range(N):\n if i and W[i - 1][-1] != W[i][0]:\n flag = False\n if d[W[i]] >= 1:\n flag = False\n d[W[i]] += 1\nprint((\"Yes\" if flag else \"No\"))\n", "fast_code": "l = open(0).readlines()[1:]\nprint((\"YNeos\"[any(a[-2] != b[0] * l.count(a) for a, b in zip(l, l[1:])) :: 2]))\n", "slow_time": 84898550, "fast_time": 30391216, "speedup": 2.7935, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_6"} +{"pair_id": "python_14237", "problem_id": "p03558", "language": "python", "slow_code": "import sys\n\nINF = 1 << 60\nMOD = 10**9 + 7\nsys.setrecursionlimit(2147483647)\ninput = lambda: sys.stdin.readline().rstrip()\n\n\ndef resolve():\n k = int(eval(input()))\n dist = [INF] * k\n dist[1] = 1\n queue = [1]\n for v in queue:\n tmp = [v]\n for v in tmp:\n if dist[10 * v % k] > dist[v]:\n dist[10 * v % k] = dist[v]\n tmp.append(10 * v % k)\n if dist[(v + 1) % k] > dist[v] + 1:\n dist[(v + 1) % k] = dist[v] + 1\n queue.append((v + 1) % k)\n print((dist[0]))\n\n\nresolve()\n", "fast_code": "def solve(K):\n checked = [False] * K\n\n def calc(x):\n while not checked[x]:\n checked[x] = True\n yield x\n x = (x * 10) % K\n\n i = 0\n xs = [0]\n while 1:\n i += 1\n ys = []\n for x in xs:\n for z in calc((x + 1) % K):\n if z == 0:\n return i\n ys.append(z)\n xs = ys\n\n\nK = int(eval(input()))\nprint((solve(K)))\n", "slow_time": 1629125432, "fast_time": 341671713, "speedup": 4.7681, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_1"} +{"pair_id": "python_7793", "problem_id": "p03108", "language": "python", "slow_code": "class UnionFind:\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return \"\\n\".join(\"{}: {}\".format(r, self.members(r)) for r in self.roots())\n\n\ndef cmb(n, r):\n if r < 0 or r > n:\n return 0\n r = min(r, n - r)\n return g1[n] * g2[r] * g2[n - r] % mod\n\n\ndef comb(n):\n x = 1\n y = 1\n for i in range(2):\n x *= n - i\n y *= i + 1\n return x // y\n\n\nn, m = list(map(int, input().split()))\na = [list(map(int, input().split())) for i in range(m)]\nb = [[] for i in range(n)]\nuf = UnionFind(n)\nans = []\nx = comb(n)\nfor i in range(m):\n ans.append(x)\n if uf.same(a[m - i - 1][0] - 1, a[m - i - 1][1] - 1):\n uf.union(a[m - i - 1][0] - 1, a[m - i - 1][1] - 1)\n else:\n x -= uf.size(a[m - i - 1][0] - 1) * uf.size(a[m - i - 1][1] - 1)\n uf.union(a[m - i - 1][0] - 1, a[m - i - 1][1] - 1)\nfor i in range(m):\n print((ans[-1 - i]))\n", "fast_code": "r = lambda x: x if u[x] < 0 else r(u[x])\nn, m, *e = map(int, open(0).read().split())\nu = [-1] * -~n\nt = n * ~-n // 2\na = [t]\nfor x, y in zip(e[-2:1:-2], e[:1:-2]):\n x, y = sorted((r(x), r(y)))\n if x != y:\n t -= u[x] * u[y]\n u[x] += u[y]\n u[y] = x\n a += [t]\nprint(*a[::-1], sep=\"\\n\")\n", "slow_time": 157667192, "fast_time": 44240664, "speedup": 3.5639, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_13"} +{"pair_id": "python_18481", "problem_id": "p03409", "language": "python", "slow_code": "num = 201\n\n\ndef dfs(cur):\n global vis\n global EE\n vis[cur] = 1\n if cur == num:\n return 1\n for i in range(num + 1):\n if vis[i] == 0 and EE[cur][i] > 0 and dfs(i) > 0:\n EE[cur][i] -= 1\n EE[i][cur] += 1\n return 1\n return 0\n\n\nn = int(eval(input()))\ns = []\nss = []\nfor i in range(n):\n s.append([int(i) for i in input().split()])\nfor i in range(n):\n ss.append([int(i) for i in input().split()])\ns.sort(key=lambda x: (x[0], x[1]))\nss.sort(key=lambda x: (x[0], x[1]))\npair = []\nfor i in range(len(s)):\n right = []\n for j in range(n):\n if s[j][0] < ss[i][0] and s[j][1] < ss[i][1]:\n right.append(j)\n pair.append(right)\npair.sort(key=lambda x: len(x))\n\n\nEE = [[0 for x in range(num + 1)] for y in range(num + 11)]\nvis = [0] * (num + 1)\nfor i in range(len(pair)):\n EE[0][i + 1] = 1\n EE[i + 1][0] = 1\nfor i in range(n):\n EE[i + 101][num] = 1\nfor i in range(len(pair)):\n for j in range(len(pair[i])):\n node1, node2 = i + 1, pair[i][j] + 101\n\n EE[node1][node2] = 1\n\nflow = 0\nwhile 1:\n for i in range(0, num + 1):\n vis[i] = 0\n if dfs(0) == 0:\n break\n flow += 1\nprint(flow)\n", "fast_code": "N = int(eval(input()))\nr = []\nfor _ in range(N):\n x, y = list(map(int, input().split()))\n r.append((-y, x))\nb = []\nfor _ in range(N):\n x, y = list(map(int, input().split()))\n b.append((x, y))\nr.sort()\nb.sort()\nans = 0\nfor my, x in r:\n for j in range(len(b)):\n if -my < b[j][1] and x < b[j][0]:\n ans += 1\n b.pop(j)\n break\nprint(ans)\n", "slow_time": 579236453, "fast_time": 50314029, "speedup": 11.5124, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_25"} +{"pair_id": "python_6108", "problem_id": "p02789", "language": "python", "slow_code": "import math\nimport statistics\nimport numpy as np\nimport queue\n\n\ndef fact(n):\n if n == 1:\n return 1\n else:\n return n * fact(n - 1)\n\n\ndef gcd(a, b):\n if a == 0:\n return b\n elif b == 0:\n return a\n else:\n return gcd(b, a % b)\n\n\ndef lcm(a, b):\n return a * b / gcd(a, b)\n\n\ndef qsort(seq):\n if len(seq) < 2:\n return seq\n else:\n beg, end = 0, len(seq) - 1\n mid = (beg + end) // 2\n smaller = [c for c in seq if seq[mid] > c]\n equal = [c for c in seq if seq[mid] == c]\n larger = [c for c in seq if seq[mid] < c]\n return qsort(smaller) + equal + qsort(larger)\n\n\nn, m = list(map(int, input().split()))\nif n == m:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "from sys import stdin\n\n\ndef main():\n n, m = list(map(int, stdin.readline().split()))\n if n == m:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nmain()\n", "slow_time": 76445893, "fast_time": 17151007, "speedup": 4.4572, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_18"} +{"pair_id": "python_13903", "problem_id": "p03343", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\nN, K, Q = MAP()\nA = LIST()\nans = INF\n\nfor x in A:\n\n B = []\n tmp = []\n for i in range(N):\n if A[i] >= x:\n tmp.append(A[i])\n else:\n B.append(tmp)\n tmp = []\n B.append(tmp)\n\n C = []\n for li in B:\n m = len(li)\n if m - K + 1 >= 1:\n li.sort()\n C += li[: m - K + 1]\n\n C.sort()\n if len(C) < Q:\n continue\n y = C[Q - 1]\n ans = min(ans, y - x)\nprint(ans)\n", "fast_code": "N, K, Q = list(map(int, input().split()))\nA = list(map(int, input().split()))\nD = set()\nfor i in range(N):\n D.add(A[i])\nD = list(D)\nans = float(\"inf\")\nfor Y in D:\n T = []\n tmp = []\n for j in range(N):\n if A[j] >= Y:\n tmp.append(A[j])\n else:\n if len(tmp) >= K:\n tmp = sorted(tmp)\n T += tmp[: len(tmp) - K + 1]\n tmp = []\n if len(tmp) >= K:\n tmp = sorted(tmp)\n T += tmp[: len(tmp) - K + 1]\n if len(T) >= Q:\n T = sorted(T)\n T = T[:Q]\n ans = min(ans, T[-1] - T[0])\nprint(ans)\n", "slow_time": 160984385, "fast_time": 75160726, "speedup": 2.1419, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_22"} +{"pair_id": "python_7377", "problem_id": "p03044", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\ndef ii():\n return int(eval(input()))\n\n\ndef mi():\n return list(map(int, input().rstrip().split()))\n\n\ndef lmi():\n return list(map(int, input().rstrip().split()))\n\n\ndef li():\n return list(input().rstrip())\n\n\nfrom queue import Queue\n\n\ndef bfs(field, sy, sx, wall, dir):\n h = len(field)\n w = len(field[0])\n dp = [[-1 for _j in range(w)] for _i in range(h)]\n q = Queue()\n dp[sy][sx] = 0\n q.put((sy, sx))\n dy = [1, -1, 0, 0, 1, 1, -1, -1]\n dx = [0, 0, 1, -1, 1, -1, 1, -1]\n\n def isin(x, y):\n return 0 <= y and y < h and 0 <= x and x < w\n\n while not q.empty():\n y, x = q.get()\n for k in range(dir):\n ny, nx = y + dy[k], x + dx[k]\n if not isin(nx, ny) or field[ny][nx] == wall:\n continue\n elif dp[ny][nx] != -1:\n continue\n dp[ny][nx] = dp[y][x] + 1\n q.put((ny, nx))\n return dp\n\n\ndef ABC088_D():\n h, w = mi()\n s = [[\"\" for _j in range(w)] for _i in range(h)]\n for i in range(h):\n s[i] = li()\n dp = bfs(s, 0, 0, \"#\", 4)\n if dp[h - 1][w - 1] < 0:\n print((-1))\n else:\n cnt = 0\n for i in range(h):\n for j in range(w):\n cnt += s[i][j] == \".\"\n print((cnt - (dp[h - 1][w - 1] + 1)))\n\n\ndef ATC002_A():\n R, C = mi()\n sy, sx = mi()\n gy, gx = mi()\n s = [[\"\" for _j in range(C)] for _i in range(R)]\n for i in range(R):\n s[i] = li()\n dp = bfs(s, sy - 1, sx - 1, \"#\", 4)\n print((dp[gy - 1][gx - 1]))\n\n\ndef ABC126_D():\n N = ii()\n G = [[] for i in range(N)]\n for i in range(N - 1):\n a, b, w = mi()\n a -= 1\n b -= 1\n G[a].append((b, w))\n G[b].append((a, w))\n is_bipartite = True\n dist = [-1 for _ in range(N)]\n que = Queue()\n for v in range(N):\n if dist[v] != -1:\n\n continue\n dist[v] = 0\n que.put(v)\n while not que.empty():\n v = que.get()\n for nv, nw in G[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + nw\n que.put(nv)\n for i in dist:\n if i % 2 == 0:\n print((0))\n else:\n print((1))\n\n\nif __name__ == \"__main__\":\n\n ABC126_D()\n", "fast_code": "from sys import stdin\nfrom collections import deque\n\n\ndef main():\n\n readline = stdin.readline\n N = int(readline())\n g = [[] for _ in range(N)]\n for _ in range(N - 1):\n u, v, w = list(map(int, readline().split()))\n u -= 1\n v -= 1\n g[u].append((v, w))\n g[v].append((u, w))\n\n d = [0] * N\n is_searched = [False] * N\n is_searched[0] = True\n que = deque([0])\n while len(que) >= 1:\n now = que.popleft()\n for x in g[now]:\n if is_searched[x[0]] == False:\n is_searched[x[0]] = True\n d[x[0]] = d[now] + x[1]\n que.append(x[0])\n for x in d:\n if x % 2 == 0:\n print((0))\n else:\n print((1))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 204160464, "fast_time": 59263735, "speedup": 3.4449, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_11"} +{"pair_id": "python_16488", "problem_id": "p03796", "language": "python", "slow_code": "N = int(eval(input()))\nfrom math import factorial\n\ndiv = int(1e9 + 7)\nans = factorial(N) % div\nprint(ans)\n", "fast_code": "MOD = 10**9 + 7\nN = int(eval(input()))\nans = 1\nfor i in range(2, N + 1):\n ans *= i\n ans %= MOD\nprint(ans)\n", "slow_time": 27008058263, "fast_time": 3853034321, "speedup": 7.0096, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_23"} +{"pair_id": "python_3650", "problem_id": "p02786", "language": "python", "slow_code": "import sys\nimport math\nimport os\nimport itertools\nimport string\nimport heapq\nimport _collections\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nfrom functools import lru_cache\nimport bisect\nimport re\nimport queue\nimport copy\nimport decimal\n\n\nclass Scanner:\n @staticmethod\n def int():\n return int(sys.stdin.readline().rstrip())\n\n @staticmethod\n def string():\n return sys.stdin.readline().rstrip()\n\n @staticmethod\n def map_int():\n return [int(x) for x in Scanner.string().split()]\n\n @staticmethod\n def string_list(n):\n return [Scanner.string() for i in range(n)]\n\n @staticmethod\n def int_list_list(n):\n return [Scanner.map_int() for i in range(n)]\n\n @staticmethod\n def int_cols_list(n):\n return [Scanner.int() for i in range(n)]\n\n\ndef solve():\n N = Scanner.int()\n ans = 0\n tmp = 1\n while N > 1:\n ans += tmp\n tmp *= 2\n N //= 2\n ans += tmp\n print(ans)\n\n\ndef main():\n\n solve()\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import math\n\ni = int(eval(input()))\nc = 1\nwhile i > 1:\n i = i // 2\n c += 1\nprint((2**c - 1))\n", "slow_time": 97773077, "fast_time": 16487546, "speedup": 5.9301, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_20"} +{"pair_id": "python_15642", "problem_id": "p02712", "language": "python", "slow_code": "N = int(eval(input()))\nans = 0\nfor i in range(1, N + 1):\n if not (i % 3 == 0 or i % 5 == 0):\n ans += i\nprint(ans)\n", "fast_code": "n = int(eval(input()))\nSum = 0.5 * n * (1 + n)\n\nSum3_5 = 0.5 * (int(n / 3) * (3 + 3 * int(n / 3)) + int(n / 5) * (5 + 5 * int(n / 5)))\nSum15 = 0.5 * (int(n / 15) * (15 + int(n / 15) * 15))\n\nprint((int(Sum - Sum3_5 + Sum15)))\n", "slow_time": 30432877907, "fast_time": 26924401, "speedup": 1130.3084, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_11"} +{"pair_id": "python_5895", "problem_id": "p03693", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef solve():\n r, g, b = LI()\n s = r * 100 + g * 10 + b\n if s % 4 == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n return\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "print((\"YNEOS\"[int(input()[::2]) % 4 > 0 :: 2]))\n", "slow_time": 90554878, "fast_time": 8396599, "speedup": 10.7847, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_8"} +{"pair_id": "python_10937", "problem_id": "p03651", "language": "python", "slow_code": "import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import sqrt, hypot, factorial, pi, sin, cos, radians\n\nif sys.version_info.minor >= 5:\n from math import gcd\nelse:\n from fractions import gcd\nfrom heapq import heappop, heappush, heapify, heappushpop\nfrom bisect import bisect_left, bisect_right\nfrom itertools import permutations, combinations, product\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom functools import reduce, partial\nfrom fractions import Fraction\nfrom string import ascii_lowercase, ascii_uppercase, digits\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef ceil(a, b=1):\n return int(-(-a // b))\n\n\ndef round(x):\n return int((x * 2 + 1) // 2)\n\n\ndef fermat(x, y, MOD):\n return x * pow(y, MOD - 2, MOD) % MOD\n\n\ndef lcm(x, y):\n return (x * y) // gcd(x, y)\n\n\ndef lcm_list(nums):\n return reduce(lcm, nums, 1)\n\n\ndef gcd_list(nums):\n return reduce(gcd, nums, nums[0])\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST():\n return list(map(int, input().split()))\n\n\nsys.setrecursionlimit(10**9)\nINF = float(\"inf\")\nMOD = 10**9 + 7\nN, K = MAP()\naN = LIST()\n\nif max(aN) < K:\n print(\"IMPOSSIBLE\")\n exit()\n\nbase = gcd_list(aN)\nif K % base == 0:\n print(\"POSSIBLE\")\nelse:\n print(\"IMPOSSIBLE\")\n", "fast_code": "n, k = list(map(int, input().split()))\na = list(map(int, input().split()))\na.sort()\n\n\ndef f(l, s):\n return s if l % s == 0 else f(s, l % s)\n\n\nz = f(a[-1], a[0])\nfor i in a:\n z = f(i, z)\nif a[-1] >= k and k % z == 0:\n print(\"POSSIBLE\")\nelse:\n print(\"IMPOSSIBLE\")\n", "slow_time": 86526108, "fast_time": 26097008, "speedup": 3.3156, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_27"} +{"pair_id": "python_10616", "problem_id": "p03018", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\nri = lambda: int(rs())\nrl = lambda: list(map(int, stdin.readline().split()))\nrs = lambda: stdin.readline().rstrip()\nS = list(rs())\ncur = \"D\"\nanswer = 0\nA_cnt = 0\nfor s in S:\n if cur == \"A\":\n if s == \"A\":\n A_cnt += 1\n elif s == \"B\":\n cur = s\n else:\n cur = \"D\"\n A_cnt = 0\n elif cur == \"B\":\n if s == \"A\":\n A_cnt = 1\n cur = s\n elif s == \"B\":\n A_cnt = 0\n cur = \"D\"\n elif s == \"C\":\n answer += A_cnt\n cur = s\n else:\n cur = \"D\"\n A_cnt = 0\n elif cur == \"C\":\n if s == \"A\":\n A_cnt += 1\n cur = s\n elif s == \"B\":\n cur = s\n else:\n cur = \"D\"\n A_cnt = 0\n else:\n if s == \"A\":\n A_cnt += 1\n cur = s\n else:\n A_cnt = 0\n cur = \"D\"\nprint(answer)\n", "fast_code": "s = input().replace(\"BC\", \"D\")\ncnt = 0\nans = 0\nfor c in s:\n if c == \"A\":\n cnt += 1\n elif c == \"D\":\n ans += cnt\n else:\n cnt = 0\nprint(ans)\n", "slow_time": 67556438, "fast_time": 17574844, "speedup": 3.8439, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_3"} +{"pair_id": "python_2941", "problem_id": "p03146", "language": "python", "slow_code": "s = int(eval(input()))\na = [s]\ni = 0\nwhile True:\n if a[i] % 2 == 0:\n a.append(int(a[i] / 2))\n i += 1\n else:\n a.append(int(3 * a[i] + 1))\n i += 1\n if [j for j in set(a) if a.count(j) > 1]:\n a_duplicate = sorted([j for j in set(a) if a.count(j) > 1], key=a.index)\n break\na[a.index(a_duplicate[0])] = 0\nprint((a.index((a_duplicate[0])) + 1))\n", "fast_code": "from collections import defaultdict, deque\n\ns = int(eval(input()))\nd = defaultdict(int)\nd[s] = 1\nindex = 1\nwhile 1:\n if s % 2 == 0:\n s = s // 2\n else:\n s = 3 * s + 1\n index += 1\n if d[s] == 1:\n break\n d[s] = 1\nprint(index)\n", "slow_time": 983405746, "fast_time": 34072545, "speedup": 28.8621, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_3"} +{"pair_id": "python_3626", "problem_id": "p02786", "language": "python", "slow_code": "import sys\nimport math\nimport os\nimport itertools\nimport string\nimport heapq\nimport _collections\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nfrom functools import lru_cache\nimport bisect\nimport re\nimport queue\nimport copy\nimport decimal\n\n\nclass Scanner:\n @staticmethod\n def int():\n return int(sys.stdin.readline().rstrip())\n\n @staticmethod\n def string():\n return sys.stdin.readline().rstrip()\n\n @staticmethod\n def map_int():\n return [int(x) for x in Scanner.string().split()]\n\n @staticmethod\n def string_list(n):\n return [Scanner.string() for i in range(n)]\n\n @staticmethod\n def int_list_list(n):\n return [Scanner.map_int() for i in range(n)]\n\n @staticmethod\n def int_cols_list(n):\n return [Scanner.int() for i in range(n)]\n\n\ndef solve():\n N = Scanner.int()\n ans = 0\n tmp = 1\n while N > 1:\n ans += tmp\n tmp *= 2\n N //= 2\n ans += tmp\n print(ans)\n\n\ndef main():\n\n solve()\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "print(2 ** len(bin(eval(input()))) / 4 - 1)\n", "slow_time": 97773077, "fast_time": 9381200, "speedup": 10.4222, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_29"} +{"pair_id": "python_392", "problem_id": "p03160", "language": "python", "slow_code": "def chmin(a, b):\n return b if a > b else a\n\n\ndef chmax(a, b):\n return b if a < b else a\n\n\ndef main(N, h):\n INF = 10**9\n dp = [INF] * (10**5 + 10)\n dp[0] = 0\n dp[1] = abs(h[1] - h[0])\n for i in range(2, N):\n dp[i] = chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]))\n dp[i] = chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))\n return dp[N - 1]\n\n\nif __name__ == \"__main__\":\n N = int(eval(input()))\n h = list(map(int, input().split()))\n print((main(N, h)))\n", "fast_code": "n = int(eval(input()))\nhs = list(map(int, input().split()))\na, b = 0, abs(hs[1] - hs[0])\nfor i in range(2, n):\n d1 = a + abs(hs[i] - hs[i - 2])\n d2 = b + abs(hs[i] - hs[i - 1])\n a, b = b, d1 if d1 <= d2 else d2\nprint(b)\n", "slow_time": 117408668, "fast_time": 32060949, "speedup": 3.662, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_24"} +{"pair_id": "python_2327", "problem_id": "p03486", "language": "python", "slow_code": "import sys\n\n\ndef main():\n s, t = sys.stdin.read().split()\n n, m = len(s), len(t)\n s = sorted(s)\n t = list(reversed(sorted(t)))\n if n < m:\n for i in range(n):\n if s[i] < t[i]:\n ans = \"Yes\"\n break\n elif s[i] > t[i]:\n ans = \"No\"\n break\n else:\n ans = \"Yes\"\n else:\n for i in range(m):\n if s[i] < t[i]:\n ans = \"Yes\"\n break\n elif s[i] > t[i]:\n ans = \"No\"\n break\n else:\n ans = \"No\"\n print(ans)\n\n\nif __name__ == \"__main__\":\n\n main()\n", "fast_code": "(\n print(\"Yes\")\n if \"\".join(sorted(input())) < \"\".join(sorted(input(), reverse=True))\n else print(\"No\")\n)\n", "slow_time": 48030642, "fast_time": 12205272, "speedup": 3.9352, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_24"} +{"pair_id": "python_14239", "problem_id": "p03558", "language": "python", "slow_code": "from collections import deque\n\nk = int(eval(input()))\nv = list(range(k))\nstack = deque([1])\ninf = float(\"inf\")\nvisited = [0] * k\ndist = [inf] * k\ndist[1] = 0\nwhile stack:\n v = stack.pop()\n if not visited[v]:\n nv0 = 10 * v % k\n nv1 = (v + 1) % k\n if dist[nv0] > dist[v]:\n dist[nv0] = dist[v]\n stack.append(nv0)\n if dist[nv1] > 1 + dist[v]:\n stack.appendleft(nv1)\n dist[nv1] = dist[v] + 1\n visited[v] = 1\nprint((dist[0] + 1))\n", "fast_code": "def solve(K):\n checked = [False] * K\n\n def calc(x):\n while not checked[x]:\n checked[x] = True\n yield x\n x = (x * 10) % K\n\n i = 0\n xs = [0]\n while 1:\n i += 1\n ys = []\n for x in xs:\n for z in calc((x + 1) % K):\n if z == 0:\n return i\n ys.append(z)\n xs = ys\n\n\nK = int(eval(input()))\nprint((solve(K)))\n", "slow_time": 3101760057, "fast_time": 341671713, "speedup": 9.0782, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_1"} +{"pair_id": "python_13969", "problem_id": "p03762", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\nN, M = MAP()\nA = LIST()\nB = LIST()\n\nlsm = rsm = 0\nfor i in range(N):\n lsm += A[i] * (N - i - 1)\n rsm += A[i] * i\n lsm %= MOD\n rsm %= MOD\nh = rsm - lsm\nlsm = rsm = 0\nfor i in range(M):\n lsm += B[i] * (M - i - 1)\n rsm += B[i] * i\n lsm %= MOD\n rsm %= MOD\nw = rsm - lsm\nans = h * w % MOD\nprint(ans)\n", "fast_code": "n, m = list(map(int, input().split()))\nX = [int(i) for i in input().split()]\nY = [int(i) for i in input().split()]\nx_sum = 0\ny_sum = 0\nfor i in range(1, n + 1):\n x_sum += (X[i - 1] * (i - 1)) - (X[i - 1] * (n - i))\nfor i in range(1, m + 1):\n y_sum += (Y[i - 1] * (i - 1)) - (Y[i - 1] * (m - i))\nprint(((x_sum * y_sum) % 1000000007))\n", "slow_time": 134610848, "fast_time": 46246579, "speedup": 2.9107, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_4"} +{"pair_id": "python_15505", "problem_id": "p02695", "language": "python", "slow_code": "n, m, q = list(map(int, input().split()))\nl = []\nfor i in range(q):\n l1, l2, l3, l4 = list(map(int, input().split()))\n l.append([l1, l2, l3, l4])\nB = []\nfor a in range(1, m + 1):\n for b in range(a, m + 1):\n for c in range(b, m + 1):\n for d in range(c, m + 1):\n for e in range(d, m + 1):\n for f in range(e, m + 1):\n for g in range(f, m + 1):\n for h in range(g, m + 1):\n for i in range(h, m + 1):\n for j in range(i, m + 1):\n L = [a, b, c, d, e, f, g, h, i, j]\n A = []\n for I in range(n):\n A.append(L[I])\n C = 0\n for k in range(q):\n if (\n A[l[k][1] - 1] - A[l[k][0] - 1]\n == l[k][2]\n ):\n C += l[k][3]\n B.append(C)\nprint((max(B)))\n", "fast_code": "import sys\n\n\ndef IS():\n return sys.stdin.readline().rstrip()\n\n\ndef II():\n return int(IS())\n\n\ndef MII():\n return list(map(int, IS().split()))\n\n\ndef MIIZ():\n return list([x - 1 for x in MII()])\n\n\ndef DD2(d1, d2, init=0):\n return [[init] * d2 for _ in range(d1)]\n\n\ndef DD3(d1, d2, d3, init=0):\n return [DD2(d2, d3, init) for _ in range(d1)]\n\n\ndef to_bin(x: int) -> str:\n return format(x, \"b\")\n\n\ndef to_oct(x: int) -> str:\n return format(x, \"o\")\n\n\ndef to_hex(x: int) -> str:\n return format(x, \"x\")\n\n\nMOD = 10**9 + 7\n\n\ndef divc(x, y) -> int:\n return -(-x // y)\n\n\ndef divf(x, y) -> int:\n return x // y\n\n\ndef gcd(x, y):\n while y:\n x, y = y, x % y\n return x\n\n\ndef lcm(x, y):\n return x * y // gcd(x, y)\n\n\ndef enumerate_divs(n):\n \"\"\"\"\"\"\n return [(i, n // i) for i in range(1, int(n**0.5) + 1) if n % i == 0]\n\n\ndef get_primes(MAX_NUM=10**3):\n \"\"\"\"\"\"\n is_prime = [True] * (MAX_NUM + 1)\n is_prime[0] = is_prime[1] = False\n for i in range(2, int(MAX_NUM**0.5) + 1):\n if not is_prime[i]:\n continue\n for j in range(i * 2, MAX_NUM + 1, i):\n is_prime[j] = False\n return [i for i in range(MAX_NUM + 1) if is_prime[i]]\n\n\nfrom itertools import accumulate as acc\nfrom itertools import combinations_with_replacement as combi\nfrom collections import deque, Counter\nfrom heapq import heapify, heappop, heappush\nfrom bisect import bisect_left\n\n\ndef main():\n n, m, q = MII()\n query = [MII() for _ in range(q)]\n\n def score(A):\n res = 0\n for a, b, c, d in query:\n if A[b - 1] - A[a - 1] == c:\n res += d\n return res\n\n def dfs(A):\n if len(A) == n:\n return score(A)\n res = 0\n prev_last = A[-1] if len(A) > 0 else 0\n for v in range(prev_last, m):\n A.append(v)\n res = max(res, dfs(A))\n A.pop()\n return res\n\n print((dfs([])))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 6526662255, "fast_time": 762334970, "speedup": 8.5614, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_22"} +{"pair_id": "python_7020", "problem_id": "p03013", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\nMOD = 10**9 + 7\nMIN = 100\n\n\ndef org(N, M, dp):\n a = [0] * M\n dp[0] = 1\n dp[1] = 1\n dp[2] = 2\n for i in range(3, max(N + 1, MIN)):\n dp[i] = dp[i - 1] + dp[i - 2]\n ans = 1\n for i in range(M):\n a[i] = int(eval(input()))\n if i != 0 and abs(a[i] - a[i - 1]) == 1:\n print((0))\n return\n if a[i] == 1:\n ans *= 1\n elif i == 0:\n ans *= dp[a[i] - 1]\n ans %= MOD\n\n else:\n ans *= dp[a[i] - a[i - 1] - 2]\n ans %= MOD\n\n if M == 0:\n ans *= dp[N]\n ans %= MOD\n\n print(ans)\n else:\n ans *= dp[N - a[M - 1] - 1]\n ans %= MOD\n\n print(ans)\n\n\ndef good(N, M, dp):\n a = [0] * len(dp)\n for i in range(M):\n a[int(eval(input())) - 1] = True\n dp[0] = 0 if a[0] is True else 1\n dp[1] = 0 if a[1] is True else dp[0] + 1\n if N == 1:\n print((dp[0]))\n return\n elif N == 2:\n print((dp[1]))\n return\n for i in range(2, N):\n if a[i] is True:\n dp[i] = 0\n else:\n dp[i] = dp[i - 1] + dp[i - 2]\n dp[i] %= MOD\n print((dp[N - 1] % MOD))\n\n\ndef main():\n N, M = list(map(int, input().split()))\n dp = [0] * max((N + 1), MIN)\n good(N, M, dp)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\nN, M = list(map(int, input().split()))\nif M == 0:\n alist = set()\nelse:\n\n alist = set(map(int, sys.stdin))\ndp = [0] * (N + 1)\ndp[0] = 1\ndp[1] = 1 if 1 not in alist else 0\nMOD = 10**9 + 7\nfor i in range(2, N + 1):\n if i in alist:\n continue\n dp[i] = (dp[i - 1] + dp[i - 2]) % MOD\nprint((dp[N]))\n", "slow_time": 116137408, "fast_time": 36147437, "speedup": 3.2129, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_17"} +{"pair_id": "python_2830", "problem_id": "p02264", "language": "python", "slow_code": "class Process_Queue:\n class Process:\n def __init__(self, name, r_time, link=None):\n self.name = name\n self.r_time = r_time\n self.link = link\n\n def __init__(self, q):\n self.e_time = 0\n self.q = q\n self.front = None\n self.rear = None\n\n def enqueue(self, name, r_time):\n if self.front == self.rear == None:\n self.front = self.rear = Process_Queue.Process(name, r_time)\n else:\n new_process = Process_Queue.Process(name, r_time)\n self.rear.link = new_process\n self.rear = new_process\n\n def dequeue(self):\n if self.front == self.rear == None:\n raise Exception(\"queue underflow\")\n elif self.front.r_time > self.q:\n self.enqueue(self.front.name, self.front.r_time - self.q)\n self.front = self.front.link\n self.e_time += self.q\n else:\n p_name = self.front.name\n self.e_time += self.front.r_time\n print((p_name, self.e_time))\n self.front = self.front.link\n if self.front == None:\n self.rear = None\n\n\nn, q = list(map(int, input().split()))\np_queue = Process_Queue(q)\nfor i in range(n):\n p = input().split()\n p_queue.enqueue(p[0], int(p[1]))\nwhile not p_queue.front == p_queue.rear == None:\n p_queue.dequeue()\n", "fast_code": "from collections import deque\n\nn, q = list(map(int, input().split()))\ndq = deque()\nfor _ in range(n):\n name, time = input().split()\n dq.append([name, int(time)])\ncnt = 0\nwhile dq:\n qt = dq.popleft()\n if qt[1] <= q:\n cnt += qt[1]\n print((qt[0], cnt))\n else:\n cnt += q\n qt[1] -= q\n dq.append(qt)\n", "slow_time": 104738053, "fast_time": 39094869, "speedup": 2.6791, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_11"} +{"pair_id": "python_10497", "problem_id": "p03786", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\nsys.setrecursionlimit(10**5)\n\n\ndef li():\n return list(map(int, stdin.readline().split()))\n\n\ndef li_():\n return [int(x) - 1 for x in stdin.readline().split()]\n\n\ndef lf():\n return list(map(float, stdin.readline().split()))\n\n\ndef ls():\n return stdin.readline().split()\n\n\ndef ns():\n return stdin.readline().rstrip()\n\n\ndef lc():\n return list(ns())\n\n\ndef ni():\n return int(stdin.readline())\n\n\ndef nf():\n return float(stdin.readline())\n\n\nfrom itertools import accumulate\n\nn = ni()\na = list(li())\na.sort()\nacc = list(accumulate(a))\nans = 0\nfor ai, acci in zip(a[-1:0:-1], acc[-2::-1]):\n if 2 * acci >= ai:\n ans += 1\n else:\n break\nprint((ans + 1))\n", "fast_code": "import numpy as np\n\nN = int(eval(input()))\nA = list(map(int, input().split()))\nA = sorted(A)\nC = np.cumsum(A)\nans = 0\ncnt = 0\nfor i in range(N - 1):\n if C[i] * 2 >= A[i + 1]:\n cnt += 1\n else:\n cnt = 0\nans = cnt + 1\nprint(ans)\n", "slow_time": 65326840, "fast_time": 28456328, "speedup": 2.2957, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_20"} +{"pair_id": "python_10869", "problem_id": "p02570", "language": "python", "slow_code": "def LI():\n return list(map(int, input().split()))\n\n\ndef II():\n return int(input())\n\n\ndef yes():\n return print(\"Yes\")\n\n\ndef no():\n return print(\"No\")\n\n\nclass Combination:\n \"\"\"\"\"\"\n\n def __init__(self, n_max, mod=10**9 + 7):\n self.mod = mod\n self.modinv = self.make_modinv_list(n_max)\n self.fac, self.facinv = self.make_factorial_list(n_max)\n\n def __call__(self, n, r):\n return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n - r] % self.mod\n\n def make_factorial_list(self, n):\n\n fac = [1]\n facinv = [1]\n for i in range(1, n + 1):\n fac.append(fac[i - 1] * i % self.mod)\n facinv.append(facinv[i - 1] * self.modinv[i] % self.mod)\n return fac, facinv\n\n def make_modinv_list(self, n):\n\n modinv = [0] * (n + 1)\n modinv[1] = 1\n for i in range(2, n + 1):\n modinv[i] = self.mod - self.mod // i * modinv[self.mod % i] % self.mod\n return modinv\n\n\nclass Unionfind:\n def __init__(self, N):\n self.p = list(range(N))\n self.rank = [0] * N\n self.size = [1] * N\n\n def root(self, x):\n if self.p[x] != x:\n self.p[x] = self.root(self.p[x])\n return self.p[x]\n\n def same(self, x, y):\n return self.root(x) == self.root(y)\n\n def unite(self, x, y):\n u = self.root(x)\n v = self.root(y)\n if u == v:\n return\n if self.rank[u] < self.rank[v]:\n self.p[u] = v\n self.size[v] += self.size[u]\n self.size[u] = 0\n else:\n self.p[v] = u\n self.size[u] += self.size[v]\n self.size[v] = 0\n if self.rank[u] == self.rank[v]:\n self.rank[u] += 1\n\n def count(self, x):\n return self.size[self.root(x)]\n\n\nd, t, s = LI()\nif d <= t * s:\n yes()\nelse:\n no()\n", "fast_code": "D, T, S = list(map(int, input().split()))\nif D / S > T:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "slow_time": 135027021, "fast_time": 10707588, "speedup": 12.6104, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_14"} +{"pair_id": "python_17050", "problem_id": "p03475", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**6)\ninput = sys.stdin.readline\nfrom math import floor, ceil, sqrt, factorial, log\nfrom heapq import heappop, heappush, heappushpop\nfrom collections import Counter, defaultdict, deque\nfrom itertools import (\n accumulate,\n permutations,\n combinations,\n product,\n combinations_with_replacement,\n)\nfrom bisect import bisect_left, bisect_right\nfrom copy import deepcopy\n\ninf = float(\"inf\")\nmod = 10**9 + 7\n\n\ndef pprint(*A):\n for a in A:\n print(*a, sep=\"\\n\")\n\n\ndef INT_(n):\n return int(n) - 1\n\n\ndef MI():\n return map(int, input().split())\n\n\ndef MF():\n return map(float, input().split())\n\n\ndef MI_():\n return map(INT_, input().split())\n\n\ndef LI():\n return list(MI())\n\n\ndef LI_():\n return [int(x) - 1 for x in input().split()]\n\n\ndef LF():\n return list(MF())\n\n\ndef LIN(n: int):\n return [I() for _ in range(n)]\n\n\ndef LLIN(n: int):\n return [LI() for _ in range(n)]\n\n\ndef LLIN_(n: int):\n return [LI_() for _ in range(n)]\n\n\ndef LLI():\n return [list(map(int, l.split())) for l in input()]\n\n\ndef I():\n return int(input())\n\n\ndef F():\n return float(input())\n\n\ndef ST():\n return input().replace(\"\\n\", \"\")\n\n\ndef main():\n N = I()\n CSF = LLIN(N - 1)\n\n def solve(CSF):\n now = 0\n for i, (c, s, f) in enumerate(CSF):\n if now <= s:\n now = s + c\n continue\n else:\n if now % f != 0:\n now += f - now % f\n now += c\n print(now)\n\n for i in range(N):\n solve(CSF[i:])\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\n\n\ndef f():\n n = int(eval(input()))\n l = tuple(tuple(map(int, input().split())) for i in range(n - 1))\n for i in range(n):\n now = 0\n for a, s, d in l[i:]:\n now = a + s - (-max(0, now - s) // d) * d\n print(now)\n\n\nif __name__ == \"__main__\":\n f()\n", "slow_time": 159141389, "fast_time": 40361101, "speedup": 3.9429, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_4"} +{"pair_id": "python_5489", "problem_id": "p02392", "language": "python", "slow_code": "import sys\n\nif __name__ == \"__main__\":\n import doctest\n\n doctest.testmod()\n a, b, c = list(map(int, sys.stdin.read().split()))\n if a < b < c:\n print(\"Yes\")\n else:\n print(\"No\")\n", "fast_code": "a, b, c = [int(i) for i in input().split()]\nif a < b and b < c:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 3028838454, "fast_time": 16037360, "speedup": 188.8614, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_8"} +{"pair_id": "python_13762", "problem_id": "p02385", "language": "python", "slow_code": "import itertools\n\n\ndef roll(dice, commands):\n for command in commands:\n if command == \"N\":\n dice[0], dice[1], dice[5], dice[4] = dice[1], dice[5], dice[4], dice[0]\n elif command == \"S\":\n dice[0], dice[1], dice[5], dice[4] = dice[4], dice[0], dice[1], dice[5]\n elif command == \"W\":\n dice[0], dice[3], dice[5], dice[2] = dice[2], dice[0], dice[3], dice[5]\n elif command == \"E\":\n dice[0], dice[3], dice[5], dice[2] = dice[3], dice[5], dice[2], dice[0]\n\n\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nfor i in range(4):\n for j in range(4):\n for commands in itertools.permutations(\"S\" * i + \"W\" * j):\n a = A[::]\n roll(a, commands)\n if B == a:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "fast_code": "class Dice:\n def __init__(self, label):\n self.label = label\n\n def north(self):\n self.change([2, 6, 3, 4, 1, 5])\n\n def west(self):\n self.change([3, 2, 6, 1, 5, 4])\n\n def east(self):\n self.change([4, 2, 1, 6, 5, 3])\n\n def south(self):\n self.change([5, 1, 3, 4, 6, 2])\n\n def rotate(self):\n self.change([1, 4, 2, 5, 3, 6])\n\n def change(self, convert):\n num = []\n for i in range(6):\n num.append(self.label[convert[i] - 1])\n self.label = num\n\n def is_same_dice(self, another_dice):\n for i in range(6):\n if i % 2 == 0:\n self.north()\n else:\n self.west()\n for j in range(4):\n self.rotate()\n if self.label == another_dice:\n return True\n return False\n\n\ndef main():\n f = [int(x) for x in input().split()]\n s = [int(x) for x in input().split()]\n if Dice(f).is_same_dice(s):\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 586452876, "fast_time": 116482320, "speedup": 5.0347, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_1"} +{"pair_id": "python_6754", "problem_id": "p00729", "language": "python", "slow_code": "while 1:\n N, M = list(map(int, input().split()))\n if N == 0:\n break\n T = [[0] * 1261 for i in range(N)]\n for i in range(eval(input())):\n t, n, m, s = list(map(int, input().split()))\n for ti in range(t, 1261):\n T[n - 1][ti] = s * m\n for i in range(eval(input())):\n ts, te, m = list(map(int, input().split()))\n print(\n sum(1 if any(T[n][t] == m for n in range(N)) else 0 for t in range(ts, te))\n )\n", "fast_code": "while 1:\n N, M = list(map(int, input().split()))\n if N == 0:\n break\n T = [[0] * 1261 for i in range(M)]\n r = eval(input())\n tnms = sorted(\n [list(map(int, input().split())) for i in range(r)], key=lambda x: x[1]\n )\n for i in range(0, r, 2):\n t1, n, m, s = tnms[i]\n t2, n, m, s = tnms[i + 1]\n T[m - 1][t1:t2] = [1 for j in range(t1, t2)]\n for i in range(eval(input())):\n ts, te, m = list(map(int, input().split()))\n print(sum(T[m - 1][ts:te]))\n", "slow_time": 1410083054, "fast_time": 125684716, "speedup": 11.2192, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_2"} +{"pair_id": "python_1323", "problem_id": "p03037", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef S():\n return eval(input())\n\n\ndef main():\n n, k = LI()\n l = [0] * (n + 1)\n for _ in range(k):\n a, b = LI()\n l[a - 1] += 1\n l[b] -= 1\n for i in range(n - 1):\n l[i + 1] += l[i]\n ans = 0\n for x in l[:-1]:\n if x == k:\n ans += 1\n return ans\n\n\nprint((main()))\n", "fast_code": "N, M = list(map(int, input().split()))\nleft = -1\nright = 10**10\nfor _ in range(M):\n l, r = list(map(int, input().split()))\n left = max(left, l)\n right = min(right, r)\nprint((max(right - left + 1, 0)))\n", "slow_time": 2050306644, "fast_time": 19304470, "speedup": 106.2089, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_24"} +{"pair_id": "python_4339", "problem_id": "p03264", "language": "python", "slow_code": "K = int(eval(input()))\na = []\nfor i in range(1, K + 1):\n a.append(i)\ncounter = 0\nif K >= 2 and K <= 100:\n for x in range(len(a)):\n for j in range(x + 1, len(a)):\n if a[x] & 1 == 0 and a[j] & 1 == 1 or a[x] & 1 == 1 and a[j] & 1 == 0:\n a[x] * a[j] % 2 == 0\n if a[x] * a[j] % 2 == 0:\n counter += 1\n print(counter)\n", "fast_code": "import math\n\nn = int(eval(input()))\nprint((int(math.floor(n / 2) * math.ceil(n / 2))))\n", "slow_time": 113472482, "fast_time": 12622405, "speedup": 8.9898, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_9"} +{"pair_id": "python_13328", "problem_id": "p03860", "language": "python", "slow_code": "ls = input().split()\nLs = []\n\n\ndef fun():\n print(\"111\")\n print(\"222\")\n print(\"333\")\n print(\"ii\")\n\n\nfor i in ls:\n Ls.append(i[0])\nprint((\"\".join(Ls)))\n", "fast_code": "s = input()[8]\nprint((\"A%sC\" % s))\n", "slow_time": 21301645, "fast_time": 6479148, "speedup": 3.2877, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_12"} +{"pair_id": "python_4541", "problem_id": "p03738", "language": "python", "slow_code": "import math\n\nif __name__ == \"__main__\":\n a = input()\n b = input()\n if len(a) > len(b):\n print(\"GREATER\")\n elif len(a) < len(b):\n print(\"LESS\")\n elif len(a) == len(b):\n for i in range(len(a)):\n if a[i] > b[i]:\n print(\"GREATER\")\n break\n elif a[i] < b[i]:\n print(\"LESS\")\n break\n elif a[i] == b[i] and i == len(a) - 1:\n print(\"EQUAL\")\n", "fast_code": "a = int(eval(input())) - int(eval(input()))\nprint((\"GELRQEEUSAASTL E R\"[(a < 1) + (a < 0) :: 3]))\n", "slow_time": 39621379, "fast_time": 16660160, "speedup": 2.3782, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_20"} +{"pair_id": "python_11847", "problem_id": "p02394", "language": "python", "slow_code": "import math\n\n\ndef func():\n try:\n line = input().rstrip()\n numbers = line.split(\" \")\n width = float(numbers[0])\n height = float(numbers[1])\n x = float(numbers[2])\n y = float(numbers[3])\n r = abs(float(numbers[4]))\n except:\n print(\"input error\")\n return -1\n wsign = math.copysign(1, width)\n hsign = math.copysign(1, height)\n result = wsign * x + r <= wsign * width\n result = result and (wsign * x - r >= 0)\n result = result and (hsign * y + r <= hsign * height)\n result = result and (hsign * y - r >= 0)\n if result:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nfunc()\n", "fast_code": "W, H, x, y, r = list(map(int, input().split()))\nprint((\"Yes\" if 0 <= x - r and x + r <= W and 0 <= y - r and y + r <= H else \"No\"))\n", "slow_time": 53297244, "fast_time": 16231487, "speedup": 3.2836, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_6"} +{"pair_id": "python_5270", "problem_id": "p02729", "language": "python", "slow_code": "n, m = list(map(int, input().split()))\na = []\nfor i in range(1, n + 1):\n a.append(2 * i)\nfor j in range(1, m + 1):\n a.append(2 * j - 1)\ncounter = 0\nfor i in range(len(a) - 1):\n for j in range(i + 1, len(a)):\n if (a[i] + a[j]) % 2 == 0:\n counter += 1\nprint(counter)\n", "fast_code": "n, m = list(map(int, input().split()))\nif (n > 0) and (m > 0):\n print((int(n * (n - 1) / 2 + m * (m - 1) / 2)))\nelse:\n print((int(max(n, m) * (max(n, m) - 1) / 2)))\n", "slow_time": 809200323, "fast_time": 22959213, "speedup": 35.2451, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_23"} +{"pair_id": "python_11775", "problem_id": "p03579", "language": "python", "slow_code": "from networkx import *\n\nn, *t = list(map(str.split, open(0)))\nn, m = list(map(int, n))\ng = Graph()\ng.add_edges_from(t)\ntry:\n a, b = list(map(len, bipartite.sets(g)))\n a *= b\nexcept:\n a = n * ~-n // 2\nprint((a - m))\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**7)\nN, M = list(map(int, input().split()))\nedge = [[] for _ in range(N)]\nfor i in range(M):\n a, b = list(map(int, input().split()))\n a -= 1\n b -= 1\n edge[a].append(b)\n edge[b].append(a)\n\ncolors = [0 for i in range(N)]\n\n\ndef dfs(v, color):\n colors[v] = color\n for u in edge[v]:\n if colors[u] == color:\n return False\n if colors[u] == 0 and not dfs(u, -color):\n return False\n return True\n\n\nif dfs(0, 1):\n one = 0\n zero = 0\n for x in colors:\n if x == 1:\n one += 1\n else:\n zero += 1\n ans = one * zero - M\nelse:\n ans = N * (N - 1) // 2 - M\nprint(ans)\n", "slow_time": 18150154613, "fast_time": 72523037, "speedup": 250.2674, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_20"} +{"pair_id": "python_12895", "problem_id": "p03549", "language": "python", "slow_code": "from sys import stdin\n\nnii = lambda: list(map(int, stdin.readline().split()))\nlnii = lambda: list(map(int, stdin.readline().split()))\nn, m = nii()\nms = 1900 * m + 100 * (n - m)\nans = 0\nfor i in range(1, 10**6):\n p1 = 0.5**m\n p2 = (1 - 0.5**m) ** (i - 1)\n p = p1 * p2\n t_ms = ms * i\n ans += p * t_ms\nans = int(ans)\nq = ans % 10\nif q != 0:\n ans += 10 - q\nprint(ans)\n", "fast_code": "N, M = list(map(int, input().split()))\nans = 2**M * (1900 * M + 100 * (N - M))\nprint(ans)\n", "slow_time": 269290726221, "fast_time": 12533967, "speedup": 21484.876, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_8"} +{"pair_id": "python_4969", "problem_id": "p03606", "language": "python", "slow_code": "n = int(eval(input()))\nseat = [0] * 10**6\nfor i in range(n):\n l, r = list(map(int, input().split()))\n for j in range(l, r + 1):\n seat[j - 1] = 1\nres = 0\nfor i in range(10**6):\n if seat[i] == 1:\n res += 1\nprint(res)\n", "fast_code": "n = int(eval(input()))\nres = 0\nfor i in range(n):\n r, l = list(map(int, input().split()))\n res += l - r + 1\nprint(res)\n", "slow_time": 40113578180, "fast_time": 19178115, "speedup": 2091.633, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_5"} +{"pair_id": "python_8579", "problem_id": "p02959", "language": "python", "slow_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nans = 0\nfor i in range(N):\n if i % 2 == 0:\n if A[i // 2] >= B[i // 2]:\n A[i // 2] -= B[i // 2]\n ans += B[i // 2]\n B[i // 2] = 0\n else:\n B[i // 2] -= A[i // 2]\n ans += A[i // 2]\n A[i // 2] = 0\n if A[i // 2 + 1] >= B[i // 2]:\n A[i // 2 + 1] -= B[i // 2]\n ans += B[i // 2]\n B[i // 2] = 0\n else:\n B[i // 2] -= A[i // 2 + 1]\n ans += A[i // 2 + 1]\n A[i // 2 + 1] = 0\n else:\n if A[N - i // 2] >= B[N - i // 2 - 1]:\n A[N - i // 2] -= B[N - i // 2 - 1]\n ans += B[N - i // 2 - 1]\n B[N - i // 2 - 1] = 0\n else:\n B[N - i // 2 - 1] -= A[N - i // 2]\n ans += A[N - i // 2]\n A[N - i // 2] = 0\n if A[N - i // 2 - 1] >= B[N - i // 2 - 1]:\n A[N - i // 2 - 1] -= B[N - i // 2 - 1]\n ans += B[N - i // 2 - 1]\n B[N - i // 2 - 1] = 0\n else:\n B[N - i // 2 - 1] -= A[N - i // 2 - 1]\n ans += A[N - i // 2 - 1]\n A[N - i // 2 - 1] = 0\nprint(ans)\n", "fast_code": "n = int(eval(input()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nnum = 0\nfor i in range(n):\n if a[i] >= b[i]:\n\n a[i] -= b[i]\n num += b[i]\n b[i] = 0\n elif a[i] < b[i]:\n num += a[i]\n\n b[i] -= a[i]\n num += min(b[i], a[i + 1])\n a[i + 1] = max(a[i + 1] - b[i], 0)\nprint(num)\n", "slow_time": 99337511, "fast_time": 44337451, "speedup": 2.2405, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_27"} +{"pair_id": "python_10829", "problem_id": "p02935", "language": "python", "slow_code": "import math\nimport statistics\n\n\ndef fact(n):\n if n == 1:\n return 1\n else:\n return n * fact(n - 1)\n\n\ndef gcd(a, b):\n if a == 0:\n return b\n elif b == 0:\n return a\n else:\n return gcd(b, a % b)\n\n\ndef lcm(a, b):\n return a * b / gcd(a, b)\n\n\ndef qsort(seq):\n if len(seq) < 1:\n return seq\n pivot = seq[0]\n left = []\n right = []\n for x in range(1, len(seq)):\n if seq[x] <= pivot:\n left.append(seq[x])\n else:\n right.append(seq[x])\n left = qsort(left)\n right = qsort(right)\n foo = [pivot]\n return left + foo + right\n\n\nn = int(eval(input()))\n\nv = list(int(i) for i in input().split())\nlastguzai = 0.00\nfor i in range(n):\n vs = sorted(v)\n if len(v) == 2:\n lastguzai = (v[0] + v[1]) / 2.00\n break\n\n v = vs\n lastguzai = (v[0] + v[1]) / 2.00\n del v[0]\n del v[0]\n v.append(lastguzai)\n\nprint((\"{:.6f}\".format(lastguzai)))\n", "fast_code": "n = int(eval(input()))\nv = [int(i) for i in input().split()]\nv.sort()\nans = v[0]\nfor i in range(1, n):\n ans = (ans + v[i]) / 2\nprint(ans)\n", "slow_time": 92880138, "fast_time": 24973201, "speedup": 3.7192, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_17"} +{"pair_id": "python_6362", "problem_id": "p02551", "language": "python", "slow_code": "N, Q = list(map(int, input().split()))\n\n\nclass SegmentTree:\n def __init__(self, init_value: list, segfunc, ide_ele):\n n = len(init_value)\n self.N0 = 1 << (n - 1).bit_length()\n self.ide_ele = ide_ele\n self.data = [ide_ele] * (2 * self.N0)\n self.segfunc = segfunc\n for i, x in enumerate(init_value):\n self.data[i + self.N0 - 1] = x\n for i in range(self.N0 - 2, -1, -1):\n self.data[i] = self.segfunc(self.data[2 * i + 1], self.data[2 * i + 2])\n\n def update(self, k: int, x):\n k += self.N0 - 1\n\n self.data[k] = x\n\n while k:\n k = (k - 1) // 2\n self.data[k] = self.segfunc(self.data[k * 2 + 1], self.data[k * 2 + 2])\n\n def get(self, k):\n return self.query(k, k + 1)\n\n def query(self, left: int, right: int):\n L = left + self.N0\n R = right + self.N0\n res = self.ide_ele\n\n a, b = [], []\n while L < R:\n if L & 1:\n a.append(L - 1)\n L += 1\n if R & 1:\n R -= 1\n b.append(R - 1)\n L >>= 1\n R >>= 1\n for i in a + b[::-1]:\n res = self.segfunc(res, self.data[i])\n\n return res\n\n\n\"\"\"\"\"\"\n\nsegW = SegmentTree([N - 1] * N, min, float(\"INF\"))\nsegH = SegmentTree([N - 1] * N, min, float(\"INF\"))\nans = (N - 2) ** 2\nfor i in range(Q):\n q, x = list(map(int, input().split()))\n if q == 1:\n res = segW.query(x - 1, N)\n now = segH.get(res - 1)\n segH.update(res - 1, min(x - 1, now))\n ans -= max(res - 1, 0)\n else:\n res = segH.query(x - 1, N)\n now = segW.get(res - 1)\n segW.update(res - 1, min(x - 1, now))\n ans -= max(res - 1, 0)\n\nprint(ans)\n", "fast_code": "import sys\nimport math\nfrom collections import defaultdict, deque, Counter\nfrom copy import deepcopy\nfrom bisect import bisect, bisect_right, bisect_left\nfrom heapq import heapify, heappop, heappush\n\ninput = sys.stdin.readline\n\n\ndef RD():\n return input().rstrip()\n\n\ndef F():\n return float(input().rstrip())\n\n\ndef I():\n return int(input().rstrip())\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef MF():\n return list(map(float, input().split()))\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef TI():\n return tuple(map(int, input().split()))\n\n\ndef LF():\n return list(map(float, input().split()))\n\n\ndef Init(H, W, num):\n return [[num for i in range(W)] for j in range(H)]\n\n\nclass BIT:\n\n def __init__(self, n):\n self.n = n\n self.bit = [0] * (n + 1)\n\n def add(self, i, x):\n\n while i <= self.n:\n self.bit[i] += x\n i += i & -i\n\n def sum(self, i):\n s = 0\n\n while i > 0:\n s += self.bit[i]\n i -= i & -i\n return s\n\n def rangesum(self, i, k):\n return self.sum(k) - self.sum(i)\n\n def lower_bound(self, x):\n if x <= 0:\n return 0\n else:\n i = 0\n r = 1\n\n while r < self.n:\n r = r << 1\n len = r\n while len > 0:\n if i + len < self.n and self.bit[i + len] < x:\n x -= self.bit[i + len]\n i += len\n len = len >> 1\n return i + 1\n\n\ndef main():\n N, Q = MI()\n X, Y = BIT(N), BIT(N)\n xmin = N - 2\n ymin = N - 2\n X.add(1, N - 2)\n X.add(N - 1, -(N - 2))\n Y.add(1, N - 2)\n Y.add(N - 1, -(N - 2))\n res = (N - 2) ** 2\n for i in range(Q):\n a, b = MI()\n if a == 1:\n x = X.sum(b - 1)\n if ymin > b - 2:\n temp = Y.sum(1)\n Y.add(1, b - 2 - temp)\n Y.add(xmin + 1, -(b - 2 - temp))\n ymin = b - 2\n res -= x\n else:\n y = Y.sum(b - 1)\n if xmin > b - 2:\n temp = X.sum(1)\n X.add(1, b - 2 - temp)\n X.add(ymin + 1, -(b - 2 - temp))\n xmin = b - 2\n res -= y\n print(res)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 34125142256, "fast_time": 296777332, "speedup": 114.9857, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_5"} +{"pair_id": "python_3843", "problem_id": "p03564", "language": "python", "slow_code": "N, K = int(eval(input())), int(eval(input()))\nans = 10**10\nfor i in range(2**N):\n tmp = 1\n for j in range(N):\n if (i >> (N - j - 1) & 1) == 1:\n tmp *= 2\n else:\n tmp += K\n ans = min(ans, tmp)\nprint(ans)\n", "fast_code": "n = int(eval(input()))\nk = int(eval(input()))\nval = 1\nfor i in range(n):\n val = min(val + k, val * 2)\nprint(val)\n", "slow_time": 714989706, "fast_time": 20867073, "speedup": 34.264, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_6"} +{"pair_id": "python_16969", "problem_id": "p02804", "language": "python", "slow_code": "N_MAX = 10**6\nMOD = 10**9 + 7\nfac, finv, inv = [0] * N_MAX, [0] * N_MAX, [0] * N_MAX\n\n\ndef com_init():\n fac[0], fac[1] = 1, 1\n finv[0], finv[1] = 1, 1\n inv[1] = 1\n for i in range(2, N_MAX):\n fac[i] = fac[i - 1] * i % MOD\n inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD\n finv[i] = finv[i - 1] * inv[i] % MOD\n\n\ndef com(n, k):\n if n < k:\n return 0\n if n < 0 or k < 0:\n return 0\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD\n\n\nn, k = list(map(int, input().split()))\nal = list(map(int, input().split()))\ncom_init()\nal.sort()\nans_max = 0\nans_min = 0\nfor i, a in enumerate(al):\n ans_max += a * com(i, k - 1)\n ans_max %= MOD\n ans_min += a * com(n - 1 - i, k - 1)\n ans_min %= MOD\nprint(((ans_max - ans_min) % MOD))\n", "fast_code": "n, k = list(map(int, input().split()))\nA = list(map(int, input().split()))\nmod = 10**9 + 7\nN = 10**5 + 50\nfac = [1] * (N + 1)\nfinv = [1] * (N + 1)\nfor i in range(N):\n fac[i + 1] = fac[i] * (i + 1) % mod\nfinv[-1] = pow(fac[-1], mod - 2, mod)\nfor i in reversed(list(range(N))):\n finv[i] = finv[i + 1] * (i + 1) % mod\n\n\ndef cmb1(n, r, mod):\n if r < 0 or r > n:\n return 0\n r = min(r, n - r)\n return fac[n] * finv[r] * finv[n - r] % mod\n\n\nA.sort()\nans = 0\nfor i, a in enumerate(A):\n M = n - 1 - i\n m = i\n if m >= 0:\n ans += a * cmb1(m, k - 1, mod)\n if M >= 0:\n ans -= a * cmb1(M, k - 1, mod)\nans %= mod\nprint(ans)\n", "slow_time": 181158031493, "fast_time": 25067330596, "speedup": 7.2269, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_18"} +{"pair_id": "python_13511", "problem_id": "p02406", "language": "python", "slow_code": "n = int(input())\ni = 1\nSP = []\nwhile i <= n:\n x = i\n if x % 3 == 0:\n SP.append(str(i))\n else:\n while x:\n if x % 10 == 3:\n SP.append(str(i))\n break\n x /= 10\n i += 1\nprint(\"\", \" \".join(SP))\n", "fast_code": "n = int(input())\nfor i in range(3, n + 1):\n if i % 3 == 0 or i % 10 == 3 or \"3\" in str(i):\n print(\"\", \"{0}\".format(i), end=\"\")\nprint()\n", "slow_time": 1499193681, "fast_time": 35199578, "speedup": 42.5912, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_29"} +{"pair_id": "python_16977", "problem_id": "p03291", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(input())\n\n\ndef MAP():\n return map(int, input().split())\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\nS = input()\nN = len(S)\n\ndp = list2d(N + 1, 4, 0)\ndp[0][0] = 1\nfor i in range(N):\n s = S[i]\n for j in range(4):\n\n if s == \"?\":\n\n dp[i + 1][j] += dp[i][j] * 3\n dp[i + 1][j] %= MOD\n else:\n dp[i + 1][j] += dp[i][j]\n dp[i + 1][j] %= MOD\n\n if j < 3:\n\n if (\n s == \"?\"\n or s == \"A\"\n and j == 0\n or s == \"B\"\n and j == 1\n or s == \"C\"\n and j == 2\n ):\n dp[i + 1][j + 1] += dp[i][j]\n dp[i + 1][j + 1] %= MOD\n\nprint(dp[N][3])\n", "fast_code": "mod = 10**9 + 7\ndp = [0, 0, 0, 1]\nfor s in input()[::-1]:\n tmp = dp[:]\n dp[3] = tmp[3] * 3 if s == \"?\" else tmp[3]\n dp[3] %= mod\n for j in range(2, -1, -1):\n dp[j] = (\n tmp[j] * 3 + tmp[j + 1]\n if s == \"?\"\n else tmp[j] + tmp[j + 1] if s == \"ABC\"[j] else tmp[j]\n )\n dp[j] %= mod\nprint(dp[0] % (10**9 + 7))\n", "slow_time": 176285150, "fast_time": 50114864, "speedup": 3.5176, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_20"} +{"pair_id": "python_290", "problem_id": "p02714", "language": "python", "slow_code": "import sys\nimport fractions\n\n\ndef in_ctrl():\n _input = [_.rstrip() for _ in sys.stdin.readlines()]\n\n N = int(_input[0])\n S = _input[1]\n\n return N, S\n\n\ndef out_ctrl(s):\n print(s)\n\n\nif __name__ == \"__main__\":\n N, S = in_ctrl()\n\n cnt = 0\n R = list(\n map(\n bool,\n list(\n map(int, list(S.replace(\"R\", \"1\").replace(\"G\", \"0\").replace(\"B\", \"0\")))\n ),\n )\n )\n G = list(\n map(\n bool,\n list(\n map(int, list(S.replace(\"R\", \"0\").replace(\"G\", \"1\").replace(\"B\", \"0\")))\n ),\n )\n )\n B = list(\n map(\n bool,\n list(\n map(int, list(S.replace(\"R\", \"0\").replace(\"G\", \"0\").replace(\"B\", \"1\")))\n ),\n )\n )\n R_cum, G_cum, B_cum = {}, {}, {}\n for i, r in enumerate(R):\n if r:\n for j, g in enumerate(G[i + 1 :]):\n if g:\n if i + j + 2 not in B_cum:\n B_cum[i + j + 2] = sum(B[i + j + 2 :])\n if i + 2 * j + 2 < N:\n cnt += B_cum[i + j + 2] - B[i + 2 * j + 2]\n else:\n cnt += B_cum[i + j + 2]\n for j, g in enumerate(B[i + 1 :]):\n if g:\n if i + j + 2 not in G_cum:\n G_cum[i + j + 2] = sum(G[i + j + 2 :])\n if i + 2 * j + 2 < N:\n cnt += G_cum[i + j + 2] - G[i + 2 * j + 2]\n else:\n cnt += G_cum[i + j + 2]\n for i, r in enumerate(G):\n if r:\n for j, g in enumerate(R[i + 1 :]):\n if g:\n if i + j + 2 not in B_cum:\n B_cum[i + j + 2] = sum(B[i + j + 2 :])\n if i + 2 * j + 2 < N:\n cnt += B_cum[i + j + 2] - B[i + 2 * j + 2]\n else:\n cnt += B_cum[i + j + 2]\n for j, b in enumerate(B[i + 1 :]):\n if b:\n if i + j + 2 not in R_cum:\n R_cum[i + j + 2] = sum(R[i + j + 2 :])\n if i + 2 * j + 2 < N:\n cnt += R_cum[i + j + 2] - R[i + 2 * j + 2]\n else:\n cnt += R_cum[i + j + 2]\n for i, r in enumerate(B):\n if r:\n for j, g in enumerate(R[i + 1 :]):\n if g:\n if i + j + 2 not in G_cum:\n G_cum[i + j + 2] = sum(G[i + j + 2 :])\n if i + 2 * j + 2 < N:\n cnt += G_cum[i + j + 2] - G[i + 2 * j + 2]\n else:\n cnt += G_cum[i + j + 2]\n for j, b in enumerate(G[i + 1 :]):\n if b:\n if i + j + 2 not in R_cum:\n R_cum[i + j + 2] = sum(R[i + j + 2 :])\n if i + 2 * j + 2 < N:\n cnt += R_cum[i + j + 2] - R[i + 2 * j + 2]\n else:\n cnt += R_cum[i + j + 2]\n\n out_ctrl(cnt)\n", "fast_code": "from collections import defaultdict\n\n\ndef main():\n _ = int(eval(input()))\n S = input().rstrip()\n indices = defaultdict(set)\n for i, c in enumerate(S):\n indices[c].add(i)\n cnt = len(indices[\"R\"]) * len(indices[\"G\"]) * len(indices[\"B\"])\n for c1, c2, c3 in [\"RGB\", \"GBR\", \"BRG\"]:\n cnt -= sum(\n (i + j) % 2 == 0 and (i + j) // 2 in indices[c3]\n for i in indices[c1]\n for j in indices[c2]\n )\n print(cnt)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 331946011, "fast_time": 72545495, "speedup": 4.5757, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_14"} +{"pair_id": "python_378", "problem_id": "p03164", "language": "python", "slow_code": "def main():\n import sys, copy\n\n N, W = list(map(int, sys.stdin.readline().split()))\n L = tuple([tuple(map(int, sys.stdin.readline().split())) for _ in range(N)])\n\n dp = [[10**11 + 1 for _ in range(10**5 + 1)] for _ in range(N)]\n dp[0][L[0][1]] = L[0][0]\n\n for i in range(1, N):\n\n dp[i] = copy.copy(dp[i - 1])\n w, v = L[i][0], L[i][1]\n\n dp[i][v] = min(w, dp[i][v])\n\n for j in range(10**5 + 1 - v):\n if dp[i - 1][j] != 0:\n dp[i][v + j] = min(dp[i][v + j], w + dp[i - 1][j])\n ans = 0\n for v1, w1 in enumerate(dp[-1]):\n if w1 <= W:\n if ans < v1:\n ans = v1\n\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\nN, W = LI()\nwv = [LI() for _ in range(N)]\nV = N * 10**3\ndp = [[float(\"INF\")] * (V + 1) for _ in range(N + 1)]\ndp[0][0] = 0\nfor i in range(1, N + 1):\n w, v = wv[i - 1]\n for j in range(V + 1):\n if j - v >= 0:\n dp[i][j] = min(dp[i][j], dp[i - 1][j - v] + w)\n dp[i][j] = min(dp[i][j], dp[i - 1][j])\nprint((max([i for i in range(V + 1) if dp[-1][i] <= W])))\n", "slow_time": 34612782525, "fast_time": 5389440474, "speedup": 6.4223, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_17"} +{"pair_id": "python_16582", "problem_id": "p02845", "language": "python", "slow_code": "_, a = open(0)\nc = 1\nd = [3] + [0] * 10**6\nfor a in map(int, a.split()):\n c = c * d[a] % (10**9 + 7)\n d[a] -= 1\n d[a + 1] += 1\nprint(c)\n", "fast_code": "import sys\n\n\ndef getN():\n return int(eval(input()))\n\n\ndef getNM():\n return list(map(int, input().split()))\n\n\ndef getlist():\n return list(map(int, input().split()))\n\n\nimport heapq\nimport bisect\nimport copy\n\n\ndef warshall_floyd(d, N):\n for k in range(N):\n for i in range(N):\n for j in range(N):\n d[i * N + j] = min(d[i * N + j], d[i * N + k] + d[k * N + j])\n return d\n\n\nMOD = 10**9 + 7\n\n\ndef main():\n n = getN()\n nums = getlist()\n ans = 1\n bc, bv, bb = -1, -1, -1\n for num in nums:\n tmp = 0\n added = 0\n if num == bc + 1:\n tmp += 1\n if not added:\n bc += 1\n added = 1\n if num == bv + 1:\n tmp += 1\n if not added:\n bv += 1\n added = 1\n if num == bb + 1:\n tmp += 1\n if not added:\n bb += 1\n added = 1\n ans *= tmp\n ans %= MOD\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 815333677, "fast_time": 80804565, "speedup": 10.0902, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_28"} +{"pair_id": "python_237", "problem_id": "p03061", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools\nimport random\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 10**9 + 7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef LF():\n return [float(x) for x in sys.stdin.readline().split()]\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef F():\n return float(sys.stdin.readline())\n\n\ndef S():\n return input()\n\n\ndef pf(s):\n return print(s, flush=True)\n\n\nclass Prime:\n def __init__(self, n):\n self.M = m = int(math.sqrt(n)) + 10\n self.A = a = [True] * m\n a[0] = a[1] = False\n self.T = t = []\n for i in range(2, int(math.sqrt(m)) + 1):\n if not a[i]:\n continue\n t.append(i)\n for j in range(i * i, m, i):\n a[j] = False\n\n def is_prime(self, n):\n return self.A[n]\n\n def division(self, n):\n d = collections.defaultdict(int)\n for c in self.T:\n while n % c == 0:\n d[c] += 1\n n //= c\n if n < 2:\n break\n if n > 1:\n d[n] += 1\n return d.items()\n\n def sowa(self, n):\n r = 1\n for k, v in self.division(n):\n t = 1\n for i in range(1, v + 1):\n t += math.pow(k, i)\n r *= t\n return r\n\n\ndef main():\n n = I()\n a = sorted(LI())\n pr = Prime(10**9)\n p = collections.defaultdict(int)\n for b in a:\n r = [1]\n for k, v in pr.division(b):\n for c in r[:]:\n for i in range(1, v + 1):\n r.append(c * (k**i))\n for k in r:\n p[k] += 1\n r = 1\n for k, v in p.items():\n if v >= n - 1 and r < k:\n r = k\n return r\n\n\nprint(main())\n", "fast_code": "from math import gcd\n\nn = int(eval(input()))\nA = [0] + list(map(int, input().split())) + [0]\nn += 2\nL, R = [0] * n, [0] * n\ngl, gr = 0, 0\nfor i in range(n):\n gl = gcd(gl, A[i])\n gr = gcd(gr, A[n - i - 1])\n L[i] = gl\n R[n - i - 1] = gr\nans = L[-1]\nfor i in range(n - 2):\n ans = max(ans, gcd(L[i], R[i + 2]))\nprint(ans)\n", "slow_time": 1034266124, "fast_time": 44727019, "speedup": 23.124, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_7"} +{"pair_id": "python_10981", "problem_id": "p02640", "language": "python", "slow_code": "from typing import *\nimport itertools\nimport math\nimport sys\n\nINF = float(\"inf\")\nYES = \"Yes\"\nNO = \"No\"\n\n\ndef solve(X: int, Y: int):\n return [YES, NO][not (2 * X <= Y <= 4 * X and Y % 2 == 0)]\n\n\ndef main():\n sys.setrecursionlimit(10**6)\n\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n\n tokens = iterate_tokens()\n X = int(next(tokens))\n Y = int(next(tokens))\n print((solve(X, Y)))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "x, y = list(map(int, input().split()))\nprint((\"Yes\" if y % 2 == 0 and x <= y / 2 and y / 4 <= x else \"No\"))\n", "slow_time": 57748391, "fast_time": 13266921, "speedup": 4.3528, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_10"} +{"pair_id": "python_16228", "problem_id": "p03721", "language": "python", "slow_code": "import sys\n\nr = [0] * (100000 + 1)\nn, k = [int(x) for x in sys.stdin.readline().split()]\nfor i in range(n):\n a, b = [int(x) for x in sys.stdin.readline().split()]\n r[a] += b\nc = 0\nfor i, j in enumerate(r):\n c += j\n if c >= k:\n print(i)\n break\n", "fast_code": "n, k, *l = list(map(int, open(0).read().split()))\nc = 0\nfor a, b in sorted(zip(l[::2], l[1::2])):\n c += b\n if c >= k:\n print(a)\n break\n", "slow_time": 225541028, "fast_time": 33159756, "speedup": 6.8016, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_26"} +{"pair_id": "python_952", "problem_id": "p03329", "language": "python", "slow_code": "N = int(eval(input()))\ninf = 10**6\ndp = [inf] * (N + 1)\ndp[0] = 0\nfor i in range(N):\n if i + 1 <= N:\n dp[i + 1] = min(dp[i] + 1, dp[i + 1])\n for j in range(1, 8):\n if i + 6**j <= N:\n dp[i + 6**j] = min(dp[i] + 1, dp[i + 6**j])\n for j in range(1, 7):\n if i + 9**j <= N:\n dp[i + 9**j] = min(dp[i] + 1, dp[i + 9**j])\nprint((dp[N]))\n", "fast_code": "import sys\n\nn = int(sys.stdin.readline().rstrip())\n\n\ndef main():\n bit6 = [0] * 8\n bit9 = [0] * 7\n b = n\n for i in range(5, -1, -1):\n q, r = divmod(b, 9**i)\n bit9[i] = q\n b = r\n res = sum(bit6) + sum(bit9)\n for _ in range(n):\n i = 0\n while True:\n bit6[i] += 1\n if bit6[i] == 6:\n bit6[i] = 0\n i += 1\n else:\n break\n i = 0\n while True:\n bit9[i] -= 1\n if bit9[i] == -1:\n bit9[i] = 8\n i += 1\n else:\n break\n res = min(res, sum(bit6) + sum(bit9))\n return res\n\n\nif __name__ == \"__main__\":\n ans = main()\n print(ans)\n", "slow_time": 657010486, "fast_time": 97400199, "speedup": 6.7455, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_28"} +{"pair_id": "python_13848", "problem_id": "p02929", "language": "python", "slow_code": "from heapq import heappush, heappop, heapify\nfrom collections import deque, defaultdict, Counter\nimport itertools\nfrom itertools import permutations, combinations, groupby\nimport sys\nimport bisect\nimport string\nimport math\nimport time\nimport random\n\n\ndef I():\n return int(input())\n\n\ndef MI():\n return map(int, input().split())\n\n\ndef LI():\n return [int(i) for i in input().split()]\n\n\ndef LI_():\n return [int(i) - 1 for i in input().split()]\n\n\ndef StoI():\n return [ord(i) - 97 for i in input()]\n\n\ndef ItoS(nn):\n return chr(nn + 97)\n\n\ndef GI(V, E, Directed=False, index=0):\n org_inp = []\n g = [[] for i in range(n)]\n for i in range(E):\n inp = LI()\n org_inp.append(inp)\n if index == 0:\n inp[0] -= 1\n inp[1] -= 1\n if len(inp) == 2:\n a, b = inp\n g[a].append(b)\n if not Directed:\n g[b].append(a)\n elif len(inp) == 3:\n a, b, c = inp\n aa = (inp[0], inp[2])\n bb = (inp[1], inp[2])\n g[a].append(bb)\n if not Directed:\n g[b].append(aa)\n return g, org_inp\n\n\ndef bit_combination(k, n=2):\n rt = []\n for tb in range(n**k):\n s = [tb // (n**bt) % n for bt in range(k)]\n rt += [s]\n return rt\n\n\ndef show(*inp, end=\"\\n\"):\n if show_flg:\n print(*inp, end=end)\n\n\nYN = [\"Yes\", \"No\"]\nmo = 10**9 + 7\ninf = float(\"inf\")\nl_alp = string.ascii_lowercase\nu_alp = string.ascii_uppercase\nts = time.time()\n\ninput = lambda: sys.stdin.readline().rstrip()\n\n\ndef ran_input():\n import random\n\n n = random.randint(4, 16)\n rmin, rmax = 1, 10\n a = [random.randint(rmin, rmax) for _ in range(n)]\n return n, a\n\n\nshow_flg = False\nshow_flg = True\nans = 1\nn = I()\ns = input()\nl, r = 0, 0\nfor i in range(n * 2):\n t = 1 if s[i] == \"B\" else 0\n if (l - r + t) % 2 == 1:\n l += 1\n else:\n ans *= l - r\n ans %= mo\n r += 1\n if i >= n:\n ans *= i - n + 1\n ans %= mo\nif r - l != 0:\n print(0)\nelse:\n print(ans)\n", "fast_code": "n, s = open(0)\na = i = 1\nl = 0\nfor c in s:\n f = (c > \"B\") ^ i % 2\n l += f or -1\n a = a * l**f * (i > int(n) or i) % (10**9 + 7)\n i += 1\nprint((a * (l == 1)))\n", "slow_time": 196228736, "fast_time": 33601523, "speedup": 5.8399, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_3"} +{"pair_id": "python_18068", "problem_id": "p03476", "language": "python", "slow_code": "N = int(eval(input()))\nMAX = 110000\nS = [_ + 2 for _ in range(MAX)]\nold = S\ni = 0\nwhile True:\n new = set([])\n t = old[i]\n for j in range(len(old)):\n if old[j] == t or old[j] % t != 0:\n new.add(old[j])\n if len(old) == len(new):\n break\n old = list(new)\n old.sort()\n i += 1\n\nA = [0 for _ in range(MAX)]\nfor i in range(MAX):\n if i % 2 == 0:\n continue\n if i in new and (i + 1) // 2 in new:\n A[i] = 1\nSUM = [0 for _ in range(MAX)]\nfor i in range(1, MAX):\n SUM[i] += A[i] + SUM[i - 1]\n\nfor i in range(N):\n l, r = list(map(int, input().split()))\n ans = SUM[r] - SUM[l - 1]\n print(ans)\n", "fast_code": "from collections import defaultdict, deque, Counter\nfrom heapq import heappush, heappop, heapify\nimport math\nimport bisect\nimport random\nfrom itertools import permutations, accumulate, combinations, product\nimport sys\nimport string\nfrom bisect import bisect_left, bisect_right\nfrom math import factorial, ceil, floor, atan2, degrees\nfrom operator import mul\nfrom functools import reduce\n\nsys.setrecursionlimit(10**8)\nINF = float(\"inf\")\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef S():\n return sys.stdin.readline().strip()\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\ndef SRL(n):\n return [list(S()) for i in range(n)]\n\n\ndef MSRL(n):\n return [[int(j) for j in list(S())] for i in range(n)]\n\n\nmod = 1000000007\n\n\ndef primes(n):\n is_prime = [1] * (n + 1)\n is_prime[0] = 0\n is_prime[1] = 0\n for i in range(2, int(n**0.5) + 1):\n if not is_prime[i]:\n continue\n for j in range(i * 2, n + 1, i):\n is_prime[j] = 0\n return {i for i in range(n + 1) if is_prime[i]}\n\n\nn = 10**5\nprime_set = primes(n)\nq = I()\nC = [0] * (n + 1)\nfor i in range(n + 1):\n if i % 2 and i in prime_set and (i + 1) // 2 in prime_set:\n C[i] = 1\nacc = list(accumulate(C))\nfor i in range(q):\n l, r = LI()\n print((acc[r] - acc[l - 1]))\n", "slow_time": 161988006304, "fast_time": 10671408586, "speedup": 15.1796, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_25"} +{"pair_id": "python_6741", "problem_id": "p03395", "language": "python", "slow_code": "from scipy.sparse.csgraph import floyd_warshall\n\nn, *a = list(map(int, open(0).read().split()))\na, b = a[:n], a[n:]\nd = []\nM = max(a)\nfor k in range(M - 1, -1, -1):\n s = set(a)\n e = [[0] * (M + 1) for _ in range(M + 1)]\n for i in range(M + 1):\n e[i][i] = 1\n for i in d + list(range(k, 0, -1)):\n t = s.copy()\n for x in s:\n e[x][x % i] = 1\n t |= {x % i}\n s = t\n c = floyd_warshall(e)\n for x, y in zip(a, b):\n if c[x, y] == float(\"inf\"):\n d += (k + 1,)\n break\nprint((-(len(d) == M) or sum(2**k for k in d)))\n", "fast_code": "from collections import deque\n\n\ndef BFS_dist(n, E, i0=0):\n Q = deque([i0])\n D = [-1] * n\n D[i0] = 0\n while Q:\n x = Q.popleft()\n for c in E[x]:\n if D[c] == -1:\n D[c] = D[x] + 1\n Q.append(c)\n return D\n\n\nN = int(eval(input()))\nA = [int(a) for a in input().split()]\nB = [int(a) for a in input().split()]\nM = 51\nX = [[] for _ in range(M)]\nfor i in range(1, M):\n for j in range(1, i + 1):\n X[i].append([i % j, 2**j])\n\n\ndef chk(S):\n M = 51\n X = [[] for _ in range(M)]\n for j in S:\n for i in range(j, M):\n X[i].append(i % j)\n DI = []\n for i in range(M):\n DI.append(BFS_dist(M, X, i))\n for i in range(N):\n if DI[A[i]][B[i]] < 0:\n return 0\n return 1\n\n\nL1 = [i for i in range(1, 51)]\nL2 = []\nif chk(L1) == 0:\n print((-1))\nelse:\n while L1:\n while True:\n if chk(L1 + L2):\n if len(L1) == 0:\n break\n L1.pop()\n else:\n L2.append(L1[-1] + 1 if L1 else 1)\n L1 = [i for i in range(1, L2[-1])]\n break\n if len(L1) == 0:\n break\n print((sum([1 << l for l in L2])))\n", "slow_time": 25944056519, "fast_time": 5434327839, "speedup": 4.7741, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_5"} +{"pair_id": "python_8200", "problem_id": "p03352", "language": "python", "slow_code": "n = int(eval(input()))\nmax = 0\nif n == 1:\n print((1))\nelse:\n for i in range(n):\n for j in range(2, 10):\n if max <= i**j and i**j <= n:\n max = i**j\n print(max)\n", "fast_code": "def ans(n):\n pow_2 = int(n ** (0.5))\n pow_exeption = [32, 128, 243]\n\n ans = pow_2**2\n for i in pow_exeption:\n if i <= n:\n ans = max(i, ans)\n for i in range(1, 11):\n if i**3 <= n:\n ans = max((i**3), ans)\n return ans\n\n\nn = int(eval(input()))\nfor i in range(n, n + 1):\n print((ans(i)))\n", "slow_time": 530484539, "fast_time": 36416333, "speedup": 14.5672, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_9"} +{"pair_id": "python_944", "problem_id": "p03329", "language": "python", "slow_code": "import itertools, sys\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\nN = I()\ndp = [float(\"INF\")] * (N + 1)\ndp[0] = 0\nfor i in range(N + 1):\n if i + 1 <= N:\n dp[i + 1] = min(dp[i + 1], dp[i] + 1)\n num6, num9 = 6, 9\n while i + num6 <= N:\n dp[i + num6] = min(dp[i + num6], dp[i] + 1)\n num6 *= 6\n while i + num9 <= N:\n dp[i + num9] = min(dp[i + num9], dp[i] + 1)\n num9 *= 9\nprint((dp[-1]))\n", "fast_code": "import sys\n\nn = int(sys.stdin.readline().rstrip())\n\n\ndef main():\n bit6 = [0] * 8\n bit9 = [0] * 7\n b = n\n for i in range(5, -1, -1):\n q, r = divmod(b, 9**i)\n bit9[i] = q\n b = r\n res = sum(bit6) + sum(bit9)\n for _ in range(n):\n i = 0\n while True:\n bit6[i] += 1\n if bit6[i] == 6:\n bit6[i] = 0\n i += 1\n else:\n break\n i = 0\n while True:\n bit9[i] -= 1\n if bit9[i] == -1:\n bit9[i] = 8\n i += 1\n else:\n break\n res = min(res, sum(bit6) + sum(bit9))\n return res\n\n\nif __name__ == \"__main__\":\n ans = main()\n print(ans)\n", "slow_time": 429751870, "fast_time": 97400199, "speedup": 4.4122, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_28"} +{"pair_id": "python_13847", "problem_id": "p02929", "language": "python", "slow_code": "import sys\nfrom collections import defaultdict, deque, Counter\nimport math\n\n\nfrom bisect import bisect_left, bisect_right\nimport heapq\n\ninput = sys.stdin.readline\ngetS = lambda: input().strip()\ngetN = lambda: int(eval(input()))\ngetList = lambda: list(map(int, input().split()))\ngetZList = lambda: [int(x) - 1 for x in input().split()]\nINF = 10**20\nMOD = 10**9 + 7\ndivide = lambda x: pow(x, MOD - 2, MOD)\n\n\ndef nck(n, k, kaijyo):\n return (npk(n, k, kaijyo) * divide(kaijyo[k])) % MOD\n\n\ndef npk(n, k, kaijyo):\n if k == 0 or k == n:\n return n % MOD\n return (kaijyo[n] * divide(kaijyo[n - k])) % MOD\n\n\ndef kaijyo(n):\n ret = [1]\n for i in range(1, n + 1):\n ret.append((ret[-1] * i) % MOD)\n return ret\n\n\ndef solve():\n n = getN()\n S = getS()\n rev = 0\n ans = 1\n for c in S:\n if c == \"W\":\n if rev == 0:\n print((0))\n return\n if rev % 2 == 0:\n ans *= rev\n ans %= MOD\n rev -= 1\n else:\n rev += 1\n else:\n if rev % 2 == 1:\n ans *= rev\n ans %= MOD\n rev -= 1\n else:\n rev += 1\n\n if rev == 0:\n print(((ans * kaijyo(n)[-1]) % MOD))\n else:\n print((0))\n\n\ndef main():\n n = getN()\n for _ in range(n):\n solve()\n\n\nif __name__ == \"__main__\":\n\n solve()\n", "fast_code": "n, s = open(0)\na = i = 1\nl = 0\nfor c in s:\n f = (c > \"B\") ^ i % 2\n l += f or -1\n a = a * l**f * (i > int(n) or i) % (10**9 + 7)\n i += 1\nprint((a * (l == 1)))\n", "slow_time": 124307619, "fast_time": 33601523, "speedup": 3.6995, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_3"} +{"pair_id": "python_18500", "problem_id": "p03409", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\nfrom collections import deque\n\n\nclass MaxFlow:\n class Edge:\n def __init__(self, to, cap, rev):\n \"\"\"\"\"\"\n self.to, self.cap, self.rev = to, cap, rev\n\n def __init__(self, node_size, inf):\n self._node = node_size\n self._inf = inf\n self._level = [-1] * self._node\n self._iter = [0] * self._node\n self._graph = [[] for _ in range(self._node)]\n\n def add_edge(self, from_, to, cap):\n self._graph[from_].append(self.Edge(to, cap, len(self._graph[to])))\n self._graph[to].append(self.Edge(from_, 0, len(self._graph[from_]) - 1))\n\n def bfs(self, start):\n \"\"\"\"\"\"\n self._level = [-1] * self._node\n next_set = deque()\n self._level[start] = 0\n next_set.append(start)\n while next_set:\n cur_vertex = next_set.popleft()\n for edge in self._graph[cur_vertex]:\n if self._level[edge.to] < 0 < edge.cap:\n self._level[edge.to] = self._level[cur_vertex] + 1\n next_set.append(edge.to)\n\n def dfs(self, cur_vertex, end_vertex, flow):\n if cur_vertex == end_vertex:\n return flow\n while self._iter[cur_vertex] < len(self._graph[cur_vertex]):\n edge = self._graph[cur_vertex][self._iter[cur_vertex]]\n if edge.cap > 0 and self._level[cur_vertex] < self._level[edge.to]:\n flowed = self.dfs(edge.to, end_vertex, min(flow, edge.cap))\n if flowed > 0:\n edge.cap -= flowed\n self._graph[edge.to][edge.rev].cap += flowed\n return flowed\n self._iter[cur_vertex] += 1\n return 0\n\n def solve(self, source, sink):\n flow = 0\n while True:\n self.bfs(source)\n if self._level[sink] < 0:\n \"\"\"\"\"\"\n return flow\n self._iter = [0] * self._node\n while True:\n f = self.dfs(source, sink, self._inf)\n if f == 0:\n break\n flow += f\n\n\nclass Dinic:\n def __init__(self, len_X, len_Y):\n \"\"\"\"\"\"\n self.len_X, self.len_Y = len_X, len_Y\n self.mf = MaxFlow(self.len_X + self.len_Y + 2, min(self.len_X, self.len_Y))\n for i in range(self.len_X):\n \"\"\"\"\"\"\n self.mf.add_edge(0, i + 1, 1)\n for i in range(self.len_Y):\n \"\"\"\"\"\"\n self.mf.add_edge(self.len_X + i + 1, self.len_X + self.len_Y + 1, 1)\n\n def add_edge(self, from_, to):\n \"\"\"\"\"\"\n self.mf.add_edge(from_ + 1, to + self.len_X + 1, 1)\n\n def solve(self):\n return self.mf.solve(0, self.len_X + self.len_Y + 1)\n\n\nN = int(eval(input()))\nX = []\nY = []\nfor i in range(N):\n X.append([int(i) for i in input().split()])\nfor i in range(N):\n Y.append([int(i) for i in input().split()])\ndinic = Dinic(len(X), len(Y))\nfor i in range(len(X)):\n for j in range(N):\n if X[i][0] < Y[j][0] and X[i][1] < Y[j][1]:\n dinic.add_edge(i, j)\nprint((dinic.solve()))\n", "fast_code": "N = int(eval(input()))\nAB = sorted(\n [[int(_) for _ in input().split()] for _ in range(N)],\n key=lambda x: x[1],\n reverse=True,\n)\nCD = sorted([[int(_) for _ in input().split()] for _ in range(N)])\ncount = 0\nfor i in range(N):\n for j in range(len(AB)):\n if AB[j][0] < CD[i][0] and AB[j][1] < CD[i][1]:\n del AB[j]\n count += 1\n break\nprint(count)\n", "slow_time": 263510546, "fast_time": 57127153, "speedup": 4.6127, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_0"} +{"pair_id": "python_14321", "problem_id": "p03025", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n res = list(sys.stdin.readline())\n if res[-1] == \"\\n\":\n return res[:-1]\n return res\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef solve():\n def comb(a, b):\n return fact[a] * fact[a - b] * inv[b] % mod\n\n n, a, b, c = LI()\n inv_100 = pow(100, mod - 2, mod)\n a = a * inv_100 % mod\n b = b * inv_100 % mod\n c = (1 - c * inv_100) % mod\n c = pow(c, mod - 2, mod)\n fact = [1]\n N = 200000\n for i in range(1, N + 1):\n fact.append(fact[-1] * i % mod)\n inv = [None] * (N + 1)\n inv[N] = pow(fact[N], mod - 2, mod)\n for i in range(N)[::-1]:\n inv[i] = inv[i + 1] * (i + 1) % mod\n ans = 0\n pa = pow(a, n, mod)\n pb = pow(b, n, mod)\n for i in range(n):\n ans += (\n inv[n - 1]\n * inv[i]\n * fact[n + i]\n * pow(c, n + i + 1, mod)\n * (pa * pow(b, i, mod) + pb * pow(a, i, mod))\n % mod\n )\n ans %= mod\n print(ans)\n return\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n res = list(sys.stdin.readline())\n if res[-1] == \"\\n\":\n return res[:-1]\n return res\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef solve():\n n, a, b, c = LI()\n inv_100 = pow(100, mod - 2, mod)\n a = a * inv_100 % mod\n b = b * inv_100 % mod\n c = (1 - c * inv_100) % mod\n c = pow(c, mod - 2, mod)\n fact = [1]\n N = 2 * n\n for i in range(1, N + 1):\n fact.append(fact[-1] * i % mod)\n inv = [None] * (N + 1)\n inv[N] = pow(fact[N], mod - 2, mod)\n for i in range(N)[::-1]:\n inv[i] = inv[i + 1] * (i + 1) % mod\n ans = 0\n fa, fb, fc = pow(b, n, mod), pow(a, n, mod), pow(c, n + 1, mod)\n for i in range(n):\n ans += inv[i] * fact[n + i] * fc * (fb + fa) % mod\n ans %= mod\n fa *= a\n fb *= b\n fc *= c\n if fa >= mod:\n fa %= mod\n if fb >= mod:\n fb %= mod\n if fc >= mod:\n fc %= mod\n print((ans * inv[n - 1] % mod))\n return\n\n\nif __name__ == \"__main__\":\n solve()\n", "slow_time": 23352294045, "fast_time": 251518847, "speedup": 92.8451, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_7"} +{"pair_id": "python_9438", "problem_id": "p03030", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\ndef eprint(*args, **kwargs):\n print(*args, file=sys.stderr, **kwargs)\n\n\nfrom queue import PriorityQueue as pq\n\n\ndef main():\n n = int(eval(input()))\n dict = {}\n for i in range(1, n + 1):\n str_x, num = input().split()\n num = int(num)\n if str_x in dict:\n dict[str_x].put((-num, i))\n\n else:\n a = pq()\n dict[str_x] = a\n dict[str_x].put((-num, i))\n\n eprint(dict)\n ll = sorted(list(dict.items()))\n eprint(ll)\n\n for item in ll:\n while item[1].qsize():\n print((item[1].get())[1])\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N = int(eval(input()))\nl = []\nfor i in range(N):\n s, p = input().split(\" \")\n l.append([s, -int(p), i + 1])\nl.sort()\nfor s, p, i in l:\n print(i)\n", "slow_time": 85144218, "fast_time": 28007862, "speedup": 3.04, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_20"} +{"pair_id": "python_14746", "problem_id": "p02713", "language": "python", "slow_code": "import math\nfrom functools import reduce\n\nk = int(eval(input()))\nans = 0\nfor i in range(1, k + 1):\n for j in range(1, k + 1):\n for l in range(1, k + 1):\n ans += reduce(math.gcd, [i, j, l])\nprint(ans)\n", "fast_code": "import math\n\nK = int(eval(input()))\nprint(\n (\n sum(\n math.gcd(math.gcd(a, b), c)\n for a in range(1, K + 1)\n for b in range(1, K + 1)\n for c in range(1, K + 1)\n )\n )\n)\n", "slow_time": 42594352249, "fast_time": 10644114473, "speedup": 4.0017, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_0"} +{"pair_id": "python_15114", "problem_id": "p02948", "language": "python", "slow_code": "from heapq import *\n\n(n, m), *t = [list(map(int, s.split())) for s in open(0)]\nq = [0] * 7**6\nv = [[] for _ in q]\nz = 0\nfor a, b in t:\n v[a - 1] += [b]\nfor i in v[:m]:\n for j in i:\n heappush(q, -j)\n z -= heappop(q)\nprint(z)\n", "fast_code": "import heapq\n\n\nclass Heapq:\n def __init__(self, arr, desc=False):\n if desc:\n arr = [-a for a in arr]\n self.sign = -1 if desc else 1\n self.hq = arr\n heapq.heapify(self.hq)\n\n def pop(self):\n return heapq.heappop(self.hq) * self.sign\n\n def push(self, a):\n heapq.heappush(self.hq, a * self.sign)\n\n def top(self):\n return self.hq[0] * self.sign\n\n def size(self):\n return len(self.hq)\n\n\nN, M = list(map(int, input().split()))\nD = {i: [] for i in range(1, M + 1)}\nfor i in range(N):\n a, b = list(map(int, input().split()))\n if a > M:\n continue\n D[a].append(b)\nq = Heapq([], True)\nans = 0\nfor a in range(1, M + 1):\n for b in D[a]:\n q.push(b)\n if q.size() > 0:\n ans += q.pop()\nprint(ans)\n", "slow_time": 3004564549, "fast_time": 89085164, "speedup": 33.7269, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_28"} +{"pair_id": "python_13844", "problem_id": "p02956", "language": "python", "slow_code": "import sys\n\nreadline = sys.stdin.readline\n\n\nclass BIT:\n\n def __init__(self, n):\n self.size = n\n self.tree = [0] * (n + 1)\n self.p = 2 ** (n.bit_length() - 1)\n self.dep = n.bit_length()\n\n def get(self, i):\n s = 0\n while i > 0:\n s += self.tree[i]\n i -= i & -i\n return s\n\n def add(self, i, x):\n while i <= self.size:\n self.tree[i] += x\n i += i & -i\n\n def bl(self, v):\n if v <= 0:\n return -1\n s = 0\n k = self.p\n for _ in range(self.dep):\n if s + k <= self.size and self.tree[s + k] < v:\n s += k\n v -= self.tree[s + k]\n k //= 2\n return s + 1\n\n\ndef compress(L):\n L2 = list(set(L))\n L2.sort()\n C = {v: k for k, v in enumerate(L2)}\n return L2, C\n\n\nMOD = 998244353\nN = int(readline())\nXY = [list(map(int, readline().split())) for _ in range(N)]\nXY.sort()\nZ = [-(10**10)]\nfor x, y in XY:\n Z.append(y)\n_, CC = compress(Z)\nXY = [(x, CC[y]) for x, y in XY]\nSS, SB, BS, BB = [None] * N, [None] * N, [None] * N, [None] * N\nT = BIT(N)\nfor i in range(N):\n k = i\n y = XY[i][1]\n l = T.get(y)\n SS[i] = l\n SB[i] = k - l\n T.add(y, 1)\nT = BIT(N)\nfor i in range(N - 1, -1, -1):\n k = N - 1 - i\n y = XY[i][1]\n l = T.get(y)\n BS[i] = l\n BB[i] = k - l\n T.add(y, 1)\nP2 = [1] * 1341398\nfor i in range(1, len(P2)):\n P2[i] = P2[i - 1] * 2 % MOD\nans = 0\nfor i in range(N):\n ss = SS[i]\n sb = SB[i]\n bs = BS[i]\n bb = BB[i]\n ans = (ans + P2[N - 1]) % MOD\n ans = (ans + P2[N - 1 - ss - bb] * (P2[ss] - 1) * (P2[bb] - 1)) % MOD\n ans = (ans + P2[N - 1 - sb - bs] * (P2[sb] - 1) * (P2[bs] - 1)) % MOD\n ans = (ans - (P2[sb] - 1) * (P2[bs] - 1) * (P2[ss] - 1) * (P2[bb] - 1)) % MOD\nprint(ans)\n", "fast_code": "\"\"\"\"\"\"\n\n\nclass BIT:\n def __init__(self, n):\n self.tree = [0] * (n + 1)\n self.tree[0] = None\n\n def sum(self, i):\n s = 0\n i += 1\n while i > 0:\n s += self.tree[i]\n i -= i & -i\n return s\n\n def range(self, l, r):\n return sum(r) - sum(l - 1)\n\n def add(self, i, x):\n i += 1\n while i <= n:\n self.tree[i] += x\n i += i & -i\n\n\nimport sys\n\nsys.setrecursionlimit(10**6)\nreadline = sys.stdin.readline\nn = int(eval(input()))\nxyi = [[int(i) for i in readline().split()] + [j] for j in range(n)]\n\n\ndame_x = [0] * n\ndame_y = [0] * n\ndame_xy = [0] * n\nMOD = 998244353\nsxyi = sorted(xyi, key=lambda x: x[1])\nmodosu = [i for x, y, i in sxyi]\nzaatu = [0] * n\nfor j, zj in enumerate(modosu):\n zaatu[zj] = j\npow2 = [1] * (n + 1)\nfor i in range(n):\n pow2[i + 1] = pow2[i] * 2 % MOD\nfor j, (x, y, i) in enumerate(sxyi):\n dame_y[i] = pow2[j] - 1 + pow2[n - j - 1] - 1\nxyi.sort()\n\nbit = BIT(n)\nfor j, (x, y, i) in enumerate(xyi):\n dame_x[i] = pow2[j] - 1 + pow2[n - j - 1] - 1\n c = bit.sum(zaatu[i])\n dame_xy[i] += pow2[c] - 1 + pow2[j - c] - 1\n bit.add(zaatu[i], 1)\nbit = BIT(n)\nfor j, (x, y, i) in enumerate(reversed(xyi)):\n c = bit.sum(zaatu[i])\n dame_xy[i] += pow2[c] - 1 + pow2[j - c] - 1\n bit.add(zaatu[i], 1)\n\nans = n * (pow2[n] - 1) % MOD\nfor dx, dy, dxy in zip(dame_x, dame_y, dame_xy):\n ans += -dx - dy + dxy\nprint((ans % MOD))\n", "slow_time": 123554763668, "fast_time": 168618463, "speedup": 732.7475, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_0"} +{"pair_id": "python_279", "problem_id": "p02954", "language": "python", "slow_code": "from functools import reduce\nfrom operator import mul\nfrom collections import Counter\nfrom collections import deque\nfrom itertools import accumulate\nfrom queue import Queue\nfrom queue import PriorityQueue as pq\nfrom heapq import heapreplace\nfrom heapq import heapify\nfrom heapq import heappushpop\nfrom heapq import heappop\nfrom heapq import heappush\nimport heapq\nimport time\nimport random\nimport bisect\nimport itertools\nimport collections\nfrom fractions import Fraction\nimport fractions\nimport string\nimport math\nimport operator\nimport functools\nimport copy\nimport array\nimport re\nimport sys\n\nsys.setrecursionlimit(500000)\ninput = sys.stdin.readline\n\n\ndef eprint(*args, **kwargs):\n print(*args, file=sys.stderr, **kwargs)\n return\n\n\ndef combinations_count(n, r):\n r = min(r, n - r)\n numer = reduce(mul, list(range(n, n - r, -1)), 1)\n denom = reduce(mul, list(range(1, r + 1)), 1)\n return numer // denom\n\n\ndef main():\n\n S = input().strip()\n n = len(S)\n\n temp = 0\n cnt = 0\n for i in range(n):\n if S[i] == \"R\":\n temp += 1\n else:\n cnt = max(cnt, temp)\n temp = 0\n for i in range(n):\n if S[i] == \"L\":\n temp += 1\n else:\n cnt = max(cnt, temp)\n temp = 0\n\n T = [0 for _ in range(n)]\n\n stack = 0\n\n for i in range(0, n):\n if S[i] == \"L\":\n\n T[i - 1] += -(-stack // 2)\n T[i] += stack // 2\n stack = 0\n\n else:\n stack += 1\n eprint(T)\n\n stack = 0\n TT = [0 for _ in range(n)]\n for i in range(0, n)[::-1]:\n if S[i] == \"R\":\n\n TT[i] += stack // 2\n TT[i + 1] += -(-stack // 2)\n stack = 0\n\n else:\n stack += 1\n eprint(TT)\n for x in [(T[i] + TT[i]) for i in range(n)]:\n print(x, end=\" \")\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "s = input()\nn = len(s)\nans = [0 for i in range(n)]\ni = 0\nwhile i < n:\n le = i\n while i + 1 < n and s[i] == s[i + 1]:\n i += 1\n length = i - le + 1\n if s[i] == \"L\":\n ans[le] += (length + 1) // 2\n ans[le - 1] += length // 2\n else:\n ans[i] += (length + 1) // 2\n ans[i + 1] += length // 2\n i += 1\nfor i in range(n):\n print(ans[i], end=\" \")\nprint()\n", "slow_time": 155165694, "fast_time": 49909263, "speedup": 3.109, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_19"} +{"pair_id": "python_10598", "problem_id": "p02982", "language": "python", "slow_code": "from numpy import *\n\nn, *x = [int32(t.split()) for t in open(0)]\nprint((sum(j == int(j) for i in x for j in map(linalg.norm, i - x)) - n[0] >> 1))\n", "fast_code": "n, d = list(map(int, input().split()))\nx = [list(map(int, input().split())) for _ in range(n)]\n\n\ndef dist(a, b):\n sm = 0\n for ea, eb in zip(a, b):\n sm += (ea - eb) ** 2\n return sm**0.5\n\n\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n dst = dist(x[i], x[j])\n for k in range(int(16000**0.5) + 1):\n if k == dst:\n ans += 1\n break\nprint(ans)\n", "slow_time": 7103541835, "fast_time": 36405830, "speedup": 195.121, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_6"} +{"pair_id": "python_975", "problem_id": "p03329", "language": "python", "slow_code": "N = int(eval(input()))\nmoney = [1]\ni = 1\nwhile True:\n i *= 6\n if i <= 100000:\n money.append(i)\n else:\n break\ni = 1\nwhile True:\n i *= 9\n if i <= 100000:\n money.append(i)\n else:\n break\nM = len(money)\ndp = [[10**9 for _ in range(N + 1)] for _ in range(M + 1)]\nfor i in range(M + 1):\n dp[i][0] = 0\nfor i in range(1, M + 1):\n for j in range(N + 1):\n if j - money[i - 1] >= 0:\n dp[i][j] = min(dp[i][j - money[i - 1]] + 1, dp[i - 1][j])\n else:\n dp[i][j] = dp[i - 1][j]\nprint((dp[M][N]))\n", "fast_code": "six = [6**i for i in range(1, 7)][::-1]\nnine = [9**i for i in range(1, 6)][::-1]\nN = int(eval(input()))\nans = []\n\n\ndef find(n, a):\n if n < 6:\n ans.append(n + a)\n return\n for s in six:\n if s <= n:\n find(n - s, a + 1)\n break\n for s in nine:\n if s <= n:\n find(n - s, a + 1)\n break\n\n\nfind(N, 0)\nprint((min(ans)))\n", "slow_time": 753107630, "fast_time": 102135516, "speedup": 7.3736, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_25"} +{"pair_id": "python_12578", "problem_id": "p02703", "language": "python", "slow_code": "N, M, S = list(map(int, input().split()))\nfrom heapq import heappop, heappush\n\ninf = 10**18\ncost = [[] for _ in range(N)]\nexc = []\nfor _ in range(M):\n u, v, a, b = list(map(int, input().split()))\n u, v = u - 1, v - 1\n cost[u].append((v, a, b))\n cost[v].append((u, a, b))\nfor _ in range(N):\n c, d = list(map(int, input().split()))\n exc.append((c, d))\ndi = [inf] * 2451 * N\nif S > 2450:\n S = 2450\ndi[S] = 0\nhq = [(0, S)]\nwhile hq:\n t, v = heappop(hq)\n u = v // 2451\n s = v % 2451\n for x, a, b in cost[u]:\n if s >= a:\n v_new = x * 2451 + s - a\n t_new = t + b\n if t_new < di[v_new]:\n di[v_new] = t_new\n heappush(hq, (t_new, v_new))\n c, d = exc[u]\n if s + c > 2450:\n c = 2450 - s\n v_new = v + c\n t_new = t + d\n if t_new < di[v_new]:\n di[v_new] = t_new\n heappush(hq, (t_new, v_new))\nfor i in range(1, N):\n m = di[i * 2451]\n for j in range(1, 2451):\n m = min(m, di[i * 2451 + j])\n print(m)\n", "fast_code": "from heapq import heappop, heappush\nimport sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef main():\n N, M, S = list(map(int, input().split()))\n to = [{} for _ in range(N)]\n for _ in range(M):\n u, v, a, b = list(map(int, input().split()))\n u -= 1\n v -= 1\n to[u][v] = (a, b)\n to[v][u] = (a, b)\n info = tuple(tuple(map(int, input().split())) for _ in range(N))\n MAX_SILVER = 50 * (N - 1)\n INF = 10**18\n\n visited = [[False] * (MAX_SILVER + 1) for _ in range(N)]\n cost = [[INF] * (MAX_SILVER + 1) for _ in range(N)]\n q = []\n S = min(S, MAX_SILVER)\n heappush(q, (0, 0, S))\n while q:\n t, now, s = heappop(q)\n if visited[now][s]:\n continue\n visited[now][s] = True\n cost[now][s] = t\n\n for nv, (a, b) in list(to[now].items()):\n nt = t + b\n rest = s - a\n if rest >= 0:\n if cost[nv][rest] <= nt:\n continue\n heappush(q, (nt, nv, rest))\n\n rate, time = info[now]\n nt = t + time\n ns = min(s + rate, MAX_SILVER)\n heappush(q, (nt, now, ns))\n for i in range(1, N):\n print((min(cost[i])))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 10331630633, "fast_time": 530435775, "speedup": 19.4776, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_19"} +{"pair_id": "python_2754", "problem_id": "p02630", "language": "python", "slow_code": "n = int(eval(input())) + 1\na = list(map(int, input().split()))\ncnt = []\nfor i in range(100005):\n cnt.append(0)\nsum = 0\nfor i in a:\n cnt[i] += 1\nfor i in range(100005):\n sum += i * cnt[i]\nq = int(eval(input()))\nfor i in range(q):\n b, c = list(map(int, input().split()))\n sum += (c - b) * cnt[b]\n cnt[c] += cnt[b]\n cnt[b] = 0\n print(sum)\n", "fast_code": "import collections\n\nN = int(eval(input()))\nA = list(map(int, input().split()))\nlst = collections.Counter(A)\nQ = int(eval(input()))\n\nans_init = 0\nfor i in lst:\n ans_init += i * lst[i]\n\nans_pm = 0\nans = []\nfor i in range(Q):\n B, C = list(map(int, input().split()))\n if B in lst:\n\n Bnum = lst[B]\n\n if C in lst:\n lst[C] += lst[B]\n lst.pop(B)\n else:\n lst[C] = lst[B]\n lst.pop(B)\n\n ans_pm += Bnum * (C - B)\n ans.append(ans_init + ans_pm)\n else:\n ans.append(ans_init + ans_pm)\nfor i in ans:\n print(i)\n", "slow_time": 10432204049, "fast_time": 65322203, "speedup": 159.7038, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_3"} +{"pair_id": "python_317", "problem_id": "p03164", "language": "python", "slow_code": "import numpy as np\n\nN, W = list(map(int, input().split()))\ndp = np.full(N * 10**3 + 1, W + 1, dtype=np.int64)\ndp[0] = 0\nfor i in range(N):\n w, v = list(map(int, input().split()))\n np.minimum(dp[:-v] + w, dp[v:], out=dp[v:])\nfor i in range(N * 10**3 + 1):\n if dp[i] <= W:\n ans = i\nprint(ans)\n", "fast_code": "import sys\nimport numpy as np\n\nN, W = list(map(int, input().split()))\nit = iter(map(int, sys.stdin.read().split()))\ndp = np.full(N * 1000 + 1, 10**10, dtype=np.int64)\ndp[0] = 0\nfor w, v in zip(it, it):\n np.minimum(dp[:-v] + w, dp[v:], out=dp[v:])\nprint((((dp <= W) * np.arange(N * 1000 + 1)).max()))\n", "slow_time": 375298992, "fast_time": 47776051, "speedup": 7.8554, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_26"} +{"pair_id": "python_3750", "problem_id": "p02731", "language": "python", "slow_code": "import scipy.optimize\n\nL = int(eval(input()))\nfunc = lambda x: -1 * (x[0] * x[1] * (L - x[0] - x[1]))\nres = scipy.optimize.minimize(func, (0.1, 0.2), bounds=((0, None), (0, None)), tol=1e-6)\nprint((-1 * res.fun))\n", "fast_code": "from decimal import *\n\nL = int(eval(input()))\nprint(((Decimal(L) / Decimal(3)) ** Decimal(3)))\n", "slow_time": 38579398487, "fast_time": 15660887, "speedup": 2463.4236, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_23"} +{"pair_id": "python_14514", "problem_id": "p02669", "language": "python", "slow_code": "def main():\n from collections import defaultdict, deque\n\n inf = 10**27\n T = int(eval(input()))\n for _ in range(T):\n N, A, B, C, D = list(map(int, input().split()))\n dq = deque()\n dq.append((0, N))\n checked = defaultdict(lambda: inf)\n ans = N * D + 1\n while dq:\n cost, x = dq.popleft()\n if cost >= ans:\n continue\n if cost >= checked[x]:\n continue\n checked[x] = cost\n\n ans = min(ans, cost + x * D)\n for d, c in ((2, A), (3, B), (5, C)):\n\n nx, r = divmod(x, d)\n ncost = cost + r * D + c\n if checked[nx] > ncost:\n dq.append((ncost, nx))\n ncost = cost + (d - r) * D + c\n if (r > 0) and (checked[nx + 1] > ncost):\n dq.append((ncost, nx + 1))\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "def main():\n from heapq import heappush, heappop\n\n T = int(eval(input()))\n for _ in range(T):\n N, A, B, C, D = list(map(int, input().split()))\n h = [(0, N)]\n checked = set()\n ans = N * D + 1\n while h:\n cost, x = heappop(h)\n if cost >= ans:\n continue\n if x in checked:\n continue\n checked.add(x)\n\n if ans > cost + x * D:\n ans = cost + x * D\n for d, c in ((2, A), (3, B), (5, C)):\n\n nx, r = divmod(x, d)\n if nx not in checked:\n heappush(h, (cost + r * D + c, nx))\n if (nx + 1) not in checked:\n heappush(h, (cost + (d - r) * D + c, nx + 1))\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 115167925158, "fast_time": 26326923406, "speedup": 4.3745, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_5"} +{"pair_id": "python_6608", "problem_id": "p02243", "language": "python", "slow_code": "from sys import maxsize\nfrom heapq import heappop, heappush\n\n\nclass Node:\n WHITE = 0\n GRAY = 1\n BLACK = 2\n\n def __init__(self):\n self.adjs = []\n self.color = Node.WHITE\n self.dist = maxsize\n\n def __lt__(self, other):\n return self.dist < other.dist\n\n def __repr__(self):\n return \"Node({},{},{})\".format(self.adjs, self.color, self.dist)\n\n\ndef read_adj():\n n = int(eval(input()))\n nodes = [Node() for _ in range(n)]\n for i in range(n):\n u, _, *rest = [int(x) for x in input().split()]\n for i in range(0, len(rest) - 1, 2):\n nodes[u].adjs.append((rest[i], rest[i + 1]))\n return nodes\n\n\ndef shortest_path(nodes):\n h = []\n nodes[0].dist = 0\n nodes[0].color = Node.GRAY\n heappush(h, (0, 0))\n while len(h) > 0:\n min_dist, min_node = heappop(h)\n nodes[min_node].color = Node.BLACK\n if nodes[min_node].dist < min_dist:\n continue\n for adj, c in nodes[min_node].adjs:\n if nodes[adj].color == Node.BLACK:\n continue\n if nodes[min_node].dist + c < nodes[adj].dist:\n nodes[adj].dist = nodes[min_node].dist + c\n nodes[adj].color = Node.GRAY\n heappush(h, (nodes[adj].dist, adj))\n\n\ndef print_dist(nodes):\n for u, n in enumerate(nodes):\n print((u, n.dist))\n\n\ndef main():\n nodes = read_adj()\n shortest_path(nodes)\n print_dist(nodes)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "from heapq import *\n\nI = float(\"inf\")\n\n\ndef m():\n n = int(eval(input()))\n A = [[]] * n\n for _ in range(n):\n e = list(map(int, input().split()))\n A[e[0]] = list(zip(e[2::2], e[3::2]))\n d = [0] + [I] * n\n H = [(0, 0)]\n while H:\n u = heappop(H)[1]\n for v, c in A[u]:\n t = d[u] + c\n if d[v] > t:\n d[v] = t\n heappush(H, (t, v))\n for i in range(n):\n print((i, d[i]))\n\n\nm()\n", "slow_time": 136137364, "fast_time": 60476738, "speedup": 2.2511, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_17"} +{"pair_id": "python_6702", "problem_id": "p02817", "language": "python", "slow_code": "import sys\n\nS, T = input().split()\nif not (S.islower() and T.islower()):\n sys.exit()\nif not (1 <= len(S) <= 100 and 1 <= len(S) <= 100):\n sys.exit()\nprint(T, S, sep=\"\")\n", "fast_code": "b, c = list(map(str, input().split()))\nprint((c + b))\n", "slow_time": 21383088, "fast_time": 9247771, "speedup": 2.3122, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_2"} +{"pair_id": "python_2776", "problem_id": "p02577", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nN = LI2()\nprint((\"Yes\" if sum(N) % 9 == 0 else \"No\"))\n", "fast_code": "print((\"YNeos\"[int(eval(input())) % 9 != 0 :: 2]))\n", "slow_time": 55150974, "fast_time": 10267360, "speedup": 5.3715, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_23"} +{"pair_id": "python_10933", "problem_id": "p02570", "language": "python", "slow_code": "def LI():\n return list(map(int, input().split()))\n\n\ndef II():\n return int(input())\n\n\ndef yes():\n return print(\"Yes\")\n\n\ndef no():\n return print(\"No\")\n\n\nclass Combination:\n \"\"\"\"\"\"\n\n def __init__(self, n_max, mod=10**9 + 7):\n self.mod = mod\n self.modinv = self.make_modinv_list(n_max)\n self.fac, self.facinv = self.make_factorial_list(n_max)\n\n def __call__(self, n, r):\n return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n - r] % self.mod\n\n def make_factorial_list(self, n):\n\n fac = [1]\n facinv = [1]\n for i in range(1, n + 1):\n fac.append(fac[i - 1] * i % self.mod)\n facinv.append(facinv[i - 1] * self.modinv[i] % self.mod)\n return fac, facinv\n\n def make_modinv_list(self, n):\n\n modinv = [0] * (n + 1)\n modinv[1] = 1\n for i in range(2, n + 1):\n modinv[i] = self.mod - self.mod // i * modinv[self.mod % i] % self.mod\n return modinv\n\n\nclass Unionfind:\n def __init__(self, N):\n self.p = list(range(N))\n self.rank = [0] * N\n self.size = [1] * N\n\n def root(self, x):\n if self.p[x] != x:\n self.p[x] = self.root(self.p[x])\n return self.p[x]\n\n def same(self, x, y):\n return self.root(x) == self.root(y)\n\n def unite(self, x, y):\n u = self.root(x)\n v = self.root(y)\n if u == v:\n return\n if self.rank[u] < self.rank[v]:\n self.p[u] = v\n self.size[v] += self.size[u]\n self.size[u] = 0\n else:\n self.p[v] = u\n self.size[u] += self.size[v]\n self.size[v] = 0\n if self.rank[u] == self.rank[v]:\n self.rank[u] += 1\n\n def count(self, x):\n return self.size[self.root(x)]\n\n\nd, t, s = LI()\nif d <= t * s:\n yes()\nelse:\n no()\n", "fast_code": "import sys\n\nread = sys.stdin.read\nreadlines = sys.stdin.readlines\nfrom collections import Counter\n\n\ndef main():\n d, t, s = list(map(int, input().split()))\n dis = s * t\n if d > dis:\n print(\"No\")\n else:\n print(\"Yes\")\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 135027021, "fast_time": 21173017, "speedup": 6.3773, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_29"} +{"pair_id": "python_226", "problem_id": "p03240", "language": "python", "slow_code": "N = int(eval(input()))\nXYH = [list(map(int, input().split())) for i in range(N)]\nXYH.sort(key=lambda x: x[2], reverse=1)\nfor Cx in range(101):\n for Cy in range(101):\n H = XYH[0][2] + abs(XYH[0][0] - Cx) + abs(XYH[0][1] - Cy)\n cnt = 0\n for X, Y, h in XYH:\n if h == max(H - abs(X - Cx) - abs(Y - Cy), 0):\n cnt += 1\n if cnt == N:\n print((Cx, Cy, H))\n break\n", "fast_code": "import math\n\nn = int(eval(input()))\nx = [0 for i in range(n)]\ny = [0 for i in range(n)]\nh = [0 for i in range(n)]\njudge = False\nfor i in range(n):\n x[i], y[i], h[i] = list(map(int, input().split()))\nfor i in range(0, 101):\n for j in range(0, 101):\n for k in range(0, n):\n if h[k] != 0:\n true_h = h[k] + int(math.fabs(x[k] - i)) + int(math.fabs(y[k] - j))\n break\n judge = True\n for k in range(n):\n dum_h = max(true_h - int(math.fabs(x[k] - i)) - int(math.fabs(y[k] - j)), 0)\n if h[k] != dum_h:\n judge = False\n break\n\n if judge is True:\n break\n if judge is True:\n break\nprint((\"{} {} {}\".format(i, j, true_h)))\n", "slow_time": 9772291562, "fast_time": 1605296145, "speedup": 6.0875, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_19"} +{"pair_id": "python_11946", "problem_id": "p02716", "language": "python", "slow_code": "n = int(eval(input()))\narr = list(map(int, input().split()))\nacum1 = [0]\nacum2 = [0]\nfor i in range(n):\n if i % 2 == 0:\n acum1.append(acum1[-1] + arr[i])\n acum2.append(acum2[-1] + 0)\n else:\n acum1.append(acum1[-1] + 0)\n acum2.append(acum2[-1] + arr[i])\nif n % 2 == 0:\n ans = max(acum1[n - 1] - acum1[0], acum2[n] - acum2[1])\n for i in range(1, n + 1, 2):\n if i + 3 > n:\n continue\n tmp = (acum1[i] - acum1[0]) + (acum2[n] - acum2[i + 2])\n ans = max(ans, tmp)\nelse:\n ans = max(acum1[n - 2] - acum1[0], acum2[n - 1] - acum2[1], acum1[n] - acum1[2])\n for i in range(1, n + 1, 2):\n if i + 3 > n - 1:\n continue\n tmp = (acum1[i] - acum1[0]) + (acum2[n - 1] - acum2[i + 2])\n ans = max(ans, tmp)\n for i in range(2, n + 1, 2):\n if i + 3 > n:\n continue\n tmp = (acum2[i] - acum2[1]) + (acum1[n] - acum1[i + 2])\n ans = max(ans, tmp)\n for i in range(1, n + 1, 2):\n if i + 4 > n:\n continue\n tmp = (acum1[i] - acum1[0]) + (acum1[n] - acum1[i + 3])\n ans = max(ans, tmp)\n acummax = [-(10**18)]\n for i in range(1, n + 1):\n if i + 2 > n:\n acummax.append(-(10**18))\n else:\n if i % 2 == 0:\n acummax.append(acum2[i] + acum1[n] - acum1[i + 2])\n else:\n acummax.append(-(10**18))\n for i in range(n - 1, -1, -1):\n acummax[i] = max(acummax[i], acummax[i + 1])\n for i in range(1, n + 1, 2):\n if i + 6 > n:\n continue\n tmp = (acum1[i] - acum1[0] - acum2[i + 2]) + acummax[i + 3]\n ans = max(ans, tmp)\nprint(ans)\n", "fast_code": "n, *l = list(map(int, open(0).read().split()))\np = [0] * n\nd = p[:]\nfor i, l in enumerate(l):\n p[i] = l + p[i - 2]\n d[i] = max(l + d[i - 2], [d, p][i & 1][i - 1])\nprint((d[-1]))\n", "slow_time": 152776680, "fast_time": 39888181, "speedup": 3.8301, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_2"} +{"pair_id": "python_16676", "problem_id": "p03147", "language": "python", "slow_code": "n = int(eval(input()))\nh = list(map(int, input().split()))\na = [0] * n\nans = 0\nwhile True:\n flag = 0\n for i in range(n):\n if h[i] > a[i]:\n a[i] += 1\n flag = 1\n elif h[i] == a[i] and flag:\n break\n if flag:\n ans += 1\n else:\n break\nprint(ans)\n", "fast_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef resolve():\n n = int(eval(input()))\n l = list(map(int, input().split()))\n ans = l[0]\n\n for i in range(len(l) - 1):\n ans += max(l[i + 1] - l[i], 0)\n print(ans)\n\n\nresolve()\n", "slow_time": 181348086, "fast_time": 32372969, "speedup": 5.6018, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_27"} +{"pair_id": "python_12688", "problem_id": "p02703", "language": "python", "slow_code": "import sys\nfrom heapq import heapify, heappop, heappush\n\nsr = lambda: sys.stdin.readline().rstrip()\nir = lambda: int(sr())\nlr = lambda: list(map(int, sr().split()))\n\nN, M, S = lr()\nUVAB = [lr() for _ in range(M)]\nCD = [lr() for _ in range(N)]\nAmax = 0\nfor i in range(M):\n a = UVAB[i][2]\n if a > Amax:\n Amax = a\nlimit = Amax * (N - 1)\nS = min(S, limit)\ngraph = [[] for _ in range(N + 1)]\nfor u, v, a, b in UVAB:\n graph[u].append((v, a, b))\n graph[v].append((u, a, b))\n\n\ndef dijkstra(start):\n\n INF = 10**15\n dist = [[INF for _ in range(limit + 1)] for _ in range(N + 1)]\n dist[1][S] = 0\n que = [(0, S, 1)]\n while que:\n time, silver, prev = heappop(que)\n if dist[prev][silver] < time:\n continue\n for next, a, b in graph[prev]:\n t = time + b\n si = silver - a\n if si < 0:\n continue\n if dist[next][si] > t:\n dist[next][si] = t\n heappush(que, (t, si, next))\n c, d = CD[prev - 1]\n si = min(limit, silver + c)\n while dist[prev][si] > time + d:\n dist[prev][si] = time + d\n heappush(que, (time + d, si, prev))\n si += c\n si = min(limit, si)\n time += d\n return dist\n\n\ndist = dijkstra(1)\nfor i in range(2, N + 1):\n d = dist[i]\n answer = min(d)\n print(answer)\n", "fast_code": "import sys\n\ninput = lambda: sys.stdin.readline().rstrip()\nimport heapq\n\nh = []\nheapq.heapify(h)\nn, m, s = list(map(int, input().split()))\na, b = [[None] * m for _ in range(2)]\nc, d = [[None] * n for _ in range(2)]\nns = {u: [] for u in range(n)}\nuv2e = {}\nfor i in range(m):\n u, v, a[i], b[i] = list(map(int, input().split()))\n ns[u - 1].append(v - 1)\n ns[v - 1].append(u - 1)\n uv2e[u - 1, v - 1] = i\n uv2e[v - 1, u - 1] = i\nfor i in range(n):\n c[i], d[i] = list(map(int, input().split()))\nmaxs = max(a) * (n - 1)\ns = min(s, maxs)\nstate = (0, 0, s)\nans = [[None] * (maxs + 1) for _ in range(n)]\nans[0][s] = 0\ndone = [[None] * (maxs + 1) for _ in range(n)]\nheapq.heappush(h, state)\ncount = 0\nwhile h:\n count += 1\n dd, u, ss = heapq.heappop(h)\n\n if done[u][ss]:\n continue\n done[u][ss] = True\n\n for v in ns[u]:\n e = uv2e[u, v]\n if ss < a[e] or done[v][ss - a[e]]:\n continue\n ans[v][ss - a[e]] = (\n min(ans[v][ss - a[e]], dd + b[e])\n if ans[v][ss - a[e]] is not None\n else dd + b[e]\n )\n\n heapq.heappush(h, (dd + b[e], v, ss - a[e]))\n\n if ss + c[u] <= maxs:\n sss = ss + c[u]\n elif ss < maxs:\n sss = maxs\n else:\n continue\n heapq.heappush(h, (dd + d[u], u, sss))\n\n ans[u][sss] = min(ans[u][sss], dd + d[u]) if ans[u][sss] is not None else dd + d[u]\nfor item in ans[1:]:\n print((min(item)))\n", "slow_time": 6039274323, "fast_time": 868924146, "speedup": 6.9503, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_14"} +{"pair_id": "python_6679", "problem_id": "p03275", "language": "python", "slow_code": "import math\n\nn = int(input())\nlst = list(map(int, input().split()))\n\n\nclass Bit:\n def __init__(self, n):\n self.size = n\n self.tree = [0] * (n + 1)\n\n def sum(self, i):\n s = 0\n while i > 0:\n s += self.tree[i]\n i -= i & -i\n return s\n\n def add(self, i, x):\n while i <= self.size:\n self.tree[i] += x\n i += i & -i\n\n\ndef judge(x, lst, n):\n length = len(lst)\n all_pair = (length * (length - 1) // 2) + length\n lst_r = [-1 if i < x else 1 for i in lst]\n lst_accum = []\n a = 0\n for i in lst_r:\n a += i\n lst_accum.append(a)\n bit = Bit(n)\n lst_accum_sorted = {b: i for i, b in enumerate(sorted(lst_accum), start=1)}\n count = 0\n for j, b in enumerate(lst_accum):\n count += bit.sum(lst_accum_sorted[b]) + (b >= 0)\n bit.add(lst_accum_sorted[b], 1)\n if count >= math.ceil(all_pair / 2):\n return True\n else:\n return False\n\n\nsorted_lst = sorted(lst)\nlow = 0\nhigh = len(lst) - 1\nwhile high - low > 1:\n t = (low + high) // 2\n i = sorted_lst[t]\n if judge(i, lst, n):\n low = t\n else:\n high = t\nprint(sorted_lst[high]) if judge(sorted_lst[high], lst, n) else print(sorted_lst[low])\n", "fast_code": "def f(n, a):\n x = list(sorted(set(a)))\n n_sub_half = n * (n + 1) // 2 // 2\n n_plus_minus = n * 2 + 1\n Li = 0\n Ri = len(x)\n while Ri > Li + 1:\n i = (Li + Ri) // 2\n xi = x[i]\n cnt_sum = [0] * n_plus_minus\n cumsum = 0\n cnt_sum[cumsum] = 1\n judge = 0\n s = 0\n for ak in a:\n if ak >= xi:\n cumsum += 1\n s += cnt_sum[cumsum] + 1\n else:\n cumsum -= 1\n s -= cnt_sum[cumsum + 1] - 1\n cnt_sum[cumsum] += 1\n judge += s\n if judge >= n_sub_half:\n Li = i\n break\n else:\n Ri = i\n print((x[Li]))\n\n\nn = int(eval(input()))\na = list(map(int, input().split()))\nf(n, a)\n", "slow_time": 61689419, "fast_time": 30474431, "speedup": 2.0243, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_7"} +{"pair_id": "python_6669", "problem_id": "p00483", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys\nfrom sys import stdin\n\ninput = stdin.readline\n\n\ndef solve(M, N, K, field):\n dp_J = [[0] * (N + 1) for _ in range(M + 1)]\n dp_O = [[0] * (N + 1) for _ in range(M + 1)]\n dp_I = [[0] * (N + 1) for _ in range(M + 1)]\n for y in range(M):\n t_J = [0] * (N + 1)\n t_O = [0] * (N + 1)\n t_I = [0] * (N + 1)\n for x in range(N):\n land = field[y][x]\n if land == \"J\":\n t_J[x + 1] = t_J[x] + 1\n t_O[x + 1] = t_O[x]\n t_I[x + 1] = t_I[x]\n elif land == \"O\":\n t_J[x + 1] = t_J[x]\n t_O[x + 1] = t_O[x] + 1\n t_I[x + 1] = t_I[x]\n else:\n t_J[x + 1] = t_J[x]\n t_O[x + 1] = t_O[x]\n t_I[x + 1] = t_I[x] + 1\n for x in range(1, N + 1):\n dp_J[y + 1][x] = dp_J[y][x] + t_J[x]\n dp_O[y + 1][x] = dp_O[y][x] + t_O[x]\n dp_I[y + 1][x] = dp_I[y][x] + t_I[x]\n for _ in range(K):\n result = [0, 0, 0]\n y1, x1, y2, x2 = list(map(int, input().split()))\n result[0] = (\n dp_J[y2][x2] - dp_J[y1 - 1][x2] - dp_J[y2][x1 - 1] + dp_J[y1 - 1][x1 - 1]\n )\n result[1] = (\n dp_O[y2][x2] - dp_O[y1 - 1][x2] - dp_O[y2][x1 - 1] + dp_O[y1 - 1][x1 - 1]\n )\n result[2] = (\n dp_I[y2][x2] - dp_I[y1 - 1][x2] - dp_I[y2][x1 - 1] + dp_I[y1 - 1][x1 - 1]\n )\n print((\" \".join(map(str, result))))\n\n\ndef solve2(M, N, K, field):\n dp_J = [[0] * (N + 1) for _ in range(M + 1)]\n dp_O = [[0] * (N + 1) for _ in range(M + 1)]\n for y in range(M):\n t_J = [0] * (N + 1)\n t_O = [0] * (N + 1)\n for x in range(N):\n land = field[y][x]\n if land == \"J\":\n t_J[x + 1] = t_J[x] + 1\n t_O[x + 1] = t_O[x]\n elif land == \"O\":\n t_J[x + 1] = t_J[x]\n t_O[x + 1] = t_O[x] + 1\n else:\n t_J[x + 1] = t_J[x]\n t_O[x + 1] = t_O[x]\n for x in range(1, N + 1):\n dp_J[y + 1][x] = dp_J[y][x] + t_J[x]\n dp_O[y + 1][x] = dp_O[y][x] + t_O[x]\n for _ in range(K):\n result = [0, 0, 0]\n y1, x1, y2, x2 = list(map(int, input().split()))\n result[0] = (\n dp_J[y2][x2] - dp_J[y1 - 1][x2] - dp_J[y2][x1 - 1] + dp_J[y1 - 1][x1 - 1]\n )\n result[1] = (\n dp_O[y2][x2] - dp_O[y1 - 1][x2] - dp_O[y2][x1 - 1] + dp_O[y1 - 1][x1 - 1]\n )\n result[2] = (x2 - x1 + 1) * (y2 - y1 + 1) - result[0] - result[1]\n print((\" \".join(map(str, result))))\n\n\ndef main(args):\n M, N = list(map(int, input().split()))\n K = int(eval(input()))\n field = [input().strip() for _ in range(M)]\n solve2(M, N, K, field)\n\n\nif __name__ == \"__main__\":\n main(sys.argv[1:])\n", "fast_code": "from array import array\n\nM, N = list(map(int, input().split()))\nK = eval(input())\nD0 = [array(\"l\", [0]) * (N + 1) for _ in range(M + 1)]\nD1 = [array(\"l\", [0]) * (N + 1) for _ in range(M + 1)]\nfor i in range(1, M + 1):\n a = input()\n for j in range(1, N + 1):\n D0[i][j] = D0[i - 1][j] + D0[i][j - 1] - D0[i - 1][j - 1] + (a[j - 1] == \"J\")\n D1[i][j] = D1[i - 1][j] + D1[i][j - 1] - D1[i - 1][j - 1] + (a[j - 1] == \"O\")\nfor _ in range(K):\n b0, b1, b2, b3 = list(map(int, input().split()))\n nJ = D0[b2][b3] - D0[b0 - 1][b3] - D0[b2][b1 - 1] + D0[b0 - 1][b1 - 1]\n nO = D1[b2][b3] - D1[b0 - 1][b3] - D1[b2][b1 - 1] + D1[b0 - 1][b1 - 1]\n nI = (b2 - b0 + 1) * (b3 - b1 + 1) - nJ - nO\n print(nJ, nO, nI)\n", "slow_time": 278415435, "fast_time": 110847517, "speedup": 2.5117, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_4"} +{"pair_id": "python_6355", "problem_id": "p02551", "language": "python", "slow_code": "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n N, Q, *query = list(map(int, read().split()))\n N -= 2\n row = [N] * N\n col = [N] * N\n R = C = N\n ans = N * N\n for q, x in zip(*[iter(query)] * 2):\n x -= 2\n if q == 1:\n if x < C:\n ans -= R\n for i in range(x + 1, C):\n col[i] = R\n C = x\n else:\n ans -= col[x]\n else:\n if x < R:\n ans -= C\n for i in range(x + 1, R):\n row[i] = C\n R = x\n else:\n ans -= row[x]\n print(ans)\n return\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\nimport math\nfrom collections import defaultdict, deque, Counter\nfrom copy import deepcopy\nfrom bisect import bisect, bisect_right, bisect_left\nfrom heapq import heapify, heappop, heappush\n\ninput = sys.stdin.readline\n\n\ndef RD():\n return input().rstrip()\n\n\ndef F():\n return float(input().rstrip())\n\n\ndef I():\n return int(input().rstrip())\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef MF():\n return list(map(float, input().split()))\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef TI():\n return tuple(map(int, input().split()))\n\n\ndef LF():\n return list(map(float, input().split()))\n\n\ndef Init(H, W, num):\n return [[num for i in range(W)] for j in range(H)]\n\n\nclass BIT:\n\n def __init__(self, n):\n self.n = n\n self.bit = [0] * (n + 1)\n\n def add(self, i, x):\n\n while i <= self.n:\n self.bit[i] += x\n i += i & -i\n\n def sum(self, i):\n s = 0\n\n while i > 0:\n s += self.bit[i]\n i -= i & -i\n return s\n\n def rangesum(self, i, k):\n return self.sum(k) - self.sum(i)\n\n def lower_bound(self, x):\n if x <= 0:\n return 0\n else:\n i = 0\n r = 1\n\n while r < self.n:\n r = r << 1\n len = r\n while len > 0:\n if i + len < self.n and self.bit[i + len] < x:\n x -= self.bit[i + len]\n i += len\n len = len >> 1\n return i + 1\n\n\ndef main():\n N, Q = MI()\n X, Y = BIT(N), BIT(N)\n xmin = N - 2\n ymin = N - 2\n X.add(1, N - 2)\n X.add(N - 1, -(N - 2))\n Y.add(1, N - 2)\n Y.add(N - 1, -(N - 2))\n res = (N - 2) ** 2\n for i in range(Q):\n a, b = MI()\n if a == 1:\n x = X.sum(b - 1)\n if ymin > b - 2:\n temp = Y.sum(1)\n Y.add(1, b - 2 - temp)\n Y.add(xmin + 1, -(b - 2 - temp))\n ymin = b - 2\n res -= x\n else:\n y = Y.sum(b - 1)\n if xmin > b - 2:\n temp = X.sum(1)\n X.add(1, b - 2 - temp)\n X.add(ymin + 1, -(b - 2 - temp))\n xmin = b - 2\n res -= y\n print(res)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 1845501096, "fast_time": 296777332, "speedup": 6.2185, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_5"} +{"pair_id": "python_14627", "problem_id": "p02635", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\nS, K = input().split()\nK = int(K)\nmod = 998244353\nLEN = len(S)\nONES = []\nZ = 0\nfor s in S:\n if s == \"0\":\n Z += 1\n else:\n ONES.append(Z)\nif ONES == []:\n print((1))\n sys.exit()\nO = len(ONES)\nZ = ONES[-1]\nDP = [[0] * (O + 1) for i in range(min(O, K) + 1)]\nDP[0][0] = 1\n\nfrom collections import Counter\n\nC = Counter(ONES)\nfor numb in range(Z, -1, -1):\n\n c = C[numb]\n NDP = [[0] * (O + 1) for i in range(min(O, K) + 1)]\n for i in range(min(O, K) + 1):\n for j in range(O + 1):\n if DP[i][j] == 0:\n continue\n for oku in range(c + j + 1):\n if i + max(0, oku - c) <= min(O, K) and 0 <= c + j - oku <= O:\n NDP[i + max(0, oku - c)][c + j - oku] = (\n NDP[i + max(0, oku - c)][c + j - oku] + DP[i][j]\n ) % mod\n DP = NDP\nANS = 0\nfor i in range(min(O, K) + 1):\n ANS += DP[i][0]\nprint((ANS % mod))\n", "fast_code": "S, K = input().split()\nK = int(K)\nK = min(K, 300)\nmod = 998244353\na = []\nval = 0\nfor i in range(len(S)):\n if S[i] == \"0\":\n a.append(val)\n val = 0\n else:\n val += 1\nif val != 0:\n a.append(val)\nm = len(a)\nK = min(sum(a), K)\ndp = [[0 for i in range(K + 1)] for j in range(K + 1)]\nfor j in range(K + 1):\n dp[j][j] = 1\nb = [a[i] for i in range(m)]\nc = [a[i] for i in range(m)]\nfor i in range(1, m):\n b[i] += b[i - 1]\nb = [0] + b\nfor i in range(m - 2, -1, -1):\n c[i] += c[i + 1]\nfor i in range(m - 1, -1, -1):\n ndp = [[0 for j in range(K + 1)] for k in range(K + 1)]\n for k in range(min(b[i], K) + 1):\n for j in range(min(K, k + c[i]) + 1):\n M = max(k - j, -a[i])\n ndp[j][k] = sum(dp[j + l][k] for l in range(max(0, M), K - j + 1)) + sum(\n dp[j][k + l] for l in range(1, min(K - k, -M) + 1)\n )\n ndp[j][k] %= mod\n dp = ndp\nprint((dp[0][0]))\n", "slow_time": 17658717131, "fast_time": 4978090638, "speedup": 3.5473, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_3"} +{"pair_id": "python_15140", "problem_id": "p03775", "language": "python", "slow_code": "import math\n\nn = int(eval(input()))\nx = 1\nwhile x <= n**0.5:\n if n % x != 0:\n x += 1\n else:\n mins = int(math.log10(n // x))\n x += 1\nprint((mins + 1))\n", "fast_code": "n = int(eval(input()))\nif n == 6983776800:\n print((5))\n exit()\n\n\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f**2 <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n return a\n\n\nF = prime_factorize(n)\nA, B = 1, 1\nfor i in F[::-1]:\n if A <= B:\n A *= i\n else:\n B *= i\nprint((max(len(str(A)), len(str(B)))))\n", "slow_time": 3734128188, "fast_time": 111818841, "speedup": 33.3944, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_12"} +{"pair_id": "python_6121", "problem_id": "p03173", "language": "python", "slow_code": "from numpy import *\n\nn, a = open(0)\nn = int(n)\na = cumsum(int64([0] + a.split()))\ndp = zeros((n, n + 1), \"i8\")\nfor k in range(1, n):\n l = arange(n - k)\n r = arange(k + 1, n + 1)\n m = array([arange(i + 1, i + k + 1) for i in range(n - k)]).T\n dp[l, r] = amin(dp[l, m] + dp[m, r], 0) + a[r] - a[l]\nprint((dp[0, n]))\n", "fast_code": "inf = float(\"inf\")\nn = int(eval(input()))\na = tuple(int(x) for x in input().split())\nd = [[inf] * n for _ in range(n)]\nfor i in range(n):\n d[i][i] = 0\nc = [0]\nfor aa in a:\n c.append(c[-1] + aa)\nfor i in range(n - 1, -1, -1):\n for j in range(i + 1, n):\n for k in range(i, j):\n\n d[i][j] = min(d[i][j], d[i][k] + d[k + 1][j])\n d[i][j] += c[j + 1] - c[i]\n\n\nprint((d[0][n - 1]))\n", "slow_time": 9602766263, "fast_time": 62731469, "speedup": 153.0773, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_12"} +{"pair_id": "python_14092", "problem_id": "p02244", "language": "python", "slow_code": "from functools import lru_cache\n\ncc = [[\".\" for i in range(8)] for j in range(8)]\n\n\ndef check(cc, a, b):\n ss = list(zip(*cc))\n if \"Q\" in cc[a]:\n return False\n if \"Q\" in ss[b]:\n return False\n d = []\n for i in range(8):\n for j in range(8):\n try:\n if j + (a - i) == b:\n d.append(cc[i][j])\n if j - (a - i) == b:\n d.append(cc[i][j])\n if j + (i - a) == b:\n d.append(cc[i][j])\n if j - (i - a) == b:\n d.append(cc[i][j])\n except IndexError:\n continue\n if \"Q\" in d:\n return False\n return True\n\n\ndef chess(s, queen):\n if queen == 8:\n return s\n for i in range(8):\n for j in range(8):\n if check(s, i, j):\n sol = s\n sol[i][j] = \"Q\"\n if chess(sol, queen + 1) != [[]]:\n return sol\n else:\n sol[i][j] = \".\"\n return [[]]\n\n\nk = int(eval(input()))\nfor i in range(k):\n a, b = input().split()\n cc[int(a)][int(b)] = \"Q\"\nans = chess(cc, k)\nprint((\"\\n\".join(list([\"\".join(x) for x in ans]))))\n", "fast_code": "from itertools import permutations\n\n\ndef check(queen):\n for r1, c1 in queen:\n if any(\n (r1 != r2 or c1 != c2)\n and (r1 == r2 or c1 == c2 or r1 + c1 == r2 + c2 or r1 - c1 == r2 - c2)\n for r2, c2 in queen\n ):\n return False\n return True\n\n\nN = int(input())\nQ, row, col = [], list(range(8)), list(range(8))\nfor _ in range(N):\n r, c = map(int, input().split())\n Q.append((r, c))\n row.remove(r)\n col.remove(c)\nfor l in permutations(col):\n queen = Q[:] + list(zip(row, l))\n if check(queen):\n board = [\n \"\".join(\"Q\" if (r, c) in queen else \".\" for c in range(8)) for r in range(8)\n ]\n print(*board, sep=\"\\n\")\n break\n", "slow_time": 35812672713, "fast_time": 452805089, "speedup": 79.0907, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_12"} +{"pair_id": "python_13841", "problem_id": "p02956", "language": "python", "slow_code": "import sys\n\nreadline = sys.stdin.readline\n\n\nclass BIT:\n\n def __init__(self, n):\n self.size = n\n self.tree = [0] * (n + 1)\n self.p = 2 ** (n.bit_length() - 1)\n self.dep = n.bit_length()\n\n def get(self, i):\n s = 0\n while i > 0:\n s += self.tree[i]\n i -= i & -i\n return s\n\n def add(self, i, x):\n while i <= self.size:\n self.tree[i] += x\n i += i & -i\n\n def bl(self, v):\n if v <= 0:\n return -1\n s = 0\n k = self.p\n for _ in range(self.dep):\n if s + k <= self.size and self.tree[s + k] < v:\n s += k\n v -= self.tree[s + k]\n k //= 2\n return s + 1\n\n\ndef compress(L):\n L2 = list(set(L))\n L2.sort()\n C = {v: k for k, v in enumerate(L2)}\n return L2, C\n\n\nMOD = 998244353\nN = int(readline())\nXY = [list(map(int, readline().split())) for _ in range(N)]\nXY.sort()\nZ = [-(10**10)]\nfor x, y in XY:\n Z.append(y)\n_, CC = compress(Z)\nXY = [(x, CC[y]) for x, y in XY]\nSS, SB, BS, BB = [None] * N, [None] * N, [None] * N, [None] * N\nT = BIT(N)\nfor i in range(N):\n k = i\n y = XY[i][1]\n l = T.get(y)\n SS[i] = l\n SB[i] = k - l\n T.add(y, 1)\nT = BIT(N)\nfor i in range(N - 1, -1, -1):\n k = N - 1 - i\n y = XY[i][1]\n l = T.get(y)\n BS[i] = l\n BB[i] = k - l\n T.add(y, 1)\nP2 = [1] * 1341398\nfor i in range(1, len(P2)):\n P2[i] = P2[i - 1] * 2 % MOD\nans = 0\nfor i in range(N):\n ss = SS[i]\n sb = SB[i]\n bs = BS[i]\n bb = BB[i]\n ans = (ans + P2[N - 1]) % MOD\n ans = (ans + P2[N - 1 - ss - bb] * (P2[ss] - 1) * (P2[bb] - 1)) % MOD\n ans = (ans + P2[N - 1 - sb - bs] * (P2[sb] - 1) * (P2[bs] - 1)) % MOD\n ans = (ans - (P2[sb] - 1) * (P2[bs] - 1) * (P2[ss] - 1) * (P2[bb] - 1)) % MOD\nprint(ans)\n", "fast_code": "import sys, queue, math, copy, itertools, bisect, collections, heapq\n\n\ndef main():\n MOD = 998244353\n LI = lambda: [int(x) for x in sys.stdin.readline().split()]\n NI = lambda: int(sys.stdin.readline())\n N = NI()\n dat = [LI() for _ in range(N)]\n dat.sort()\n yo = [y for _, y in dat]\n yo.sort()\n up = [0] * N\n dw = [0] * N\n bit = [0] * (N + 1)\n\n def bit_add(i):\n while i <= N:\n bit[i] += 1\n i += i & -i\n\n def bit_sum(i):\n ret = 0\n while i > 0:\n ret += bit[i]\n i -= i & -i\n return ret\n\n for i in range(N):\n x, y = dat[i]\n y = bisect.bisect_left(yo, y) + 1\n up[i] = bit_sum(y)\n bit_add(y)\n bit = [0] * (N + 1)\n for i in range(N - 1, -1, -1):\n x, y = dat[i]\n y = bisect.bisect_left(yo, y) + 1\n dw[i] = bit_sum(y)\n bit_add(y)\n ans = N * pow(2, N - 1, MOD)\n for i in range(N):\n a = i - up[i]\n b = up[i]\n c = N - (i + 1) - dw[i]\n d = dw[i]\n p = (pow(2, a + d, MOD) - 1) - (pow(2, a, MOD) - 1) - (pow(2, d, MOD) - 1)\n q = (pow(2, b + c, MOD) - 1) - (pow(2, b, MOD) - 1) - (pow(2, c, MOD) - 1)\n x = p * (pow(2, b, MOD) + pow(2, c, MOD) - 1)\n y = q * (pow(2, a, MOD) + pow(2, d, MOD) - 1)\n z = p * q\n ans = (ans + x + y + z) % MOD\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 123554763668, "fast_time": 151801012, "speedup": 813.9258, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_10"} +{"pair_id": "python_16658", "problem_id": "p03147", "language": "python", "slow_code": "n = int(eval(input()))\nh = list(map(int, input().split()))\nc = 0\nwhile any(h):\n ans = 0\n for l in range(n):\n tmp = 0\n r = l\n while h[r]:\n tmp += 1\n r += 1\n if r == n:\n break\n if ans < tmp:\n x = l\n y = r\n ans = tmp\n for i in range(x, y):\n h[i] -= 1\n c += 1\nprint(c)\n", "fast_code": "n = int(eval(input()))\nh = list(map(int, input().split()))\nans = h[0]\nfor i in range(1, n):\n if h[i] > h[i - 1]:\n ans += h[i] - h[i - 1]\nprint(ans)\n", "slow_time": 277237338, "fast_time": 24546115, "speedup": 11.2946, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_5"} +{"pair_id": "python_278", "problem_id": "p02954", "language": "python", "slow_code": "from functools import reduce\nfrom operator import mul\nfrom collections import Counter\nfrom collections import deque\nfrom itertools import accumulate\nfrom queue import Queue\nfrom queue import PriorityQueue as pq\nfrom heapq import heapreplace\nfrom heapq import heapify\nfrom heapq import heappushpop\nfrom heapq import heappop\nfrom heapq import heappush\nimport heapq\nimport time\nimport random\nimport bisect\nimport itertools\nimport collections\nfrom fractions import Fraction\nimport fractions\nimport string\nimport math\nimport operator\nimport functools\nimport copy\nimport array\nimport re\nimport sys\n\nsys.setrecursionlimit(500000)\ninput = sys.stdin.readline\n\n\ndef eprint(*args, **kwargs):\n print(*args, file=sys.stderr, **kwargs)\n return\n\n\ndef combinations_count(n, r):\n r = min(r, n - r)\n numer = reduce(mul, list(range(n, n - r, -1)), 1)\n denom = reduce(mul, list(range(1, r + 1)), 1)\n return numer // denom\n\n\ndef main():\n\n S = input().strip()\n n = len(S)\n\n temp = 0\n cnt = 0\n for i in range(n):\n if S[i] == \"R\":\n temp += 1\n else:\n cnt = max(cnt, temp)\n temp = 0\n for i in range(n):\n if S[i] == \"L\":\n temp += 1\n else:\n cnt = max(cnt, temp)\n temp = 0\n\n T = [0 for _ in range(n)]\n\n stack = 0\n\n for i in range(0, n):\n if S[i] == \"L\":\n\n T[i - 1] += -(-stack // 2)\n T[i] += stack // 2\n stack = 0\n\n else:\n stack += 1\n eprint(T)\n\n stack = 0\n TT = [0 for _ in range(n)]\n for i in range(0, n)[::-1]:\n if S[i] == \"R\":\n\n TT[i] += stack // 2\n TT[i + 1] += -(-stack // 2)\n stack = 0\n\n else:\n stack += 1\n eprint(TT)\n for x in [(T[i] + TT[i]) for i in range(n)]:\n print(x, end=\" \")\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "S = input()\nN = len(S)\nans = [0] * N\ncnt = 0\nfor i, s in enumerate(S):\n if s == \"R\":\n cnt += 1\n else:\n ans[i] += cnt // 2\n ans[i - 1] += (cnt + 1) // 2\n cnt = 0\ncnt = 0\nans = ans[::-1]\nfor i, s in enumerate(S[::-1]):\n if s == \"L\":\n cnt += 1\n else:\n ans[i] += cnt // 2\n ans[i - 1] += (cnt + 1) // 2\n cnt = 0\nprint(*ans[::-1], sep=\" \")\n", "slow_time": 155165694, "fast_time": 44772387, "speedup": 3.4657, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_16"} +{"pair_id": "python_14570", "problem_id": "p03647", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\nfrom_1 = [False] * N\nto_N = [False] * N\nfor _ in range(M):\n a, b = list(map(int, input().split()))\n if a == 1:\n from_1[b - 1] = True\n elif b == N:\n to_N[a - 1] = True\nfor i in range(1, N):\n if from_1[i] and to_N[i]:\n print(\"POSSIBLE\")\n break\nelse:\n print(\"IMPOSSIBLE\")\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n n, m = list(map(int, input().split()))\n s, d = set(), set()\n for _ in range(m):\n a, b = list(map(int, input().split()))\n if a == 1:\n s.add(b)\n elif b == n:\n d.add(a)\n\n print((\"POSSIBLE\" if s & d else \"IMPOSSIBLE\"))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 1854976633, "fast_time": 36324321, "speedup": 51.0671, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_4"} +{"pair_id": "python_42", "problem_id": "p03805", "language": "python", "slow_code": "from collections import defaultdict\nfrom itertools import permutations\n\n\ndef main():\n N, M = list(map(int, input().split()))\n g = defaultdict(list)\n for _ in range(M):\n a, b = list(map(int, input().split()))\n g[a].append(b)\n g[b].append(a)\n ans = 0\n for route in permutations(list(range(2, N + 1)), N - 1):\n ok = True\n now = 1\n for r in route:\n if r in g[now]:\n now = r\n else:\n ok = False\n if ok:\n ans += 1\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import bisect\n\nn, m = list(map(int, input().split()))\ng = [[] for i in range(n + 1)]\nfor i in range(m):\n a, b = list(map(int, input().split()))\n g[a].append(b)\n g[b].append(a)\n\n\nans = 0\n\n\ndef dfs(x, check):\n\n ans = 0\n if not False in check:\n\n return 1\n\n for i in g[x]:\n if check[i] == True:\n continue\n\n check[i] = True\n ans += dfs(i, check)\n check[i] = False\n return ans\n\n\ncheck = [False] * (n + 1)\ncheck[0] = True\ncheck[1] = True\nprint((dfs(1, check)))\n", "slow_time": 1015280859, "fast_time": 54891761, "speedup": 18.4961, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_19"} +{"pair_id": "python_10756", "problem_id": "p03767", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef A():\n n = I()\n a = LI()\n a.sort(key=lambda x: -x)\n ans = 0\n for i in range(n):\n ans += a[2 * i + 1]\n print(ans)\n return\n\n\ndef B():\n def dfs(d, x, c):\n if d <= dp[x]:\n return\n dp[x] = d\n if not f[x]:\n f[x] = c\n for y in v[x]:\n dfs(d - 1, y, c)\n\n n, m = LI()\n f = [0] * n\n v = [[] for i in range(n)]\n for i in range(m):\n a, b = LI()\n a -= 1\n b -= 1\n v[a].append(b)\n v[b].append(a)\n dp = defaultdict(lambda: -1)\n q = I()\n l = LIR(q)\n l = l[::-1]\n for x, d, c in l:\n x -= 1\n dfs(d, x, c)\n for i in f:\n print(i)\n return\n\n\ndef C():\n n = I()\n return\n\n\ndef D():\n n = I()\n return\n\n\ndef E():\n n = I()\n return\n\n\ndef F():\n n = I()\n return\n\n\nif __name__ == \"__main__\":\n A()\n", "fast_code": "n = int(eval(input()))\na = sorted(list(map(int, input().split())), reverse=True)\nans = 0\nfor i in range(1, 2 * n, 2):\n ans += a[i]\nprint(ans)\n", "slow_time": 173061558, "fast_time": 24295016, "speedup": 7.1233, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_12"} +{"pair_id": "python_16276", "problem_id": "p03721", "language": "python", "slow_code": "n, k = list(map(int, input().split()))\nd = [0 for i in range(100010)]\nfor i in range(n):\n a, b = list(map(int, input().split()))\n d[a] += b\nfor j, e in enumerate(d):\n k -= e\n if k <= 0:\n print(j)\n break\n", "fast_code": "from sys import stdin\nfrom operator import itemgetter\n\n\ndef main():\n lines = stdin.readlines()\n N, K = list(map(int, lines[0].split()))\n abn = [[int(abi) for abi in line.split()] for line in lines[1:]]\n abn.sort(key=itemgetter(0))\n cnt = 0\n for ai, bi in abn:\n cnt += bi\n if K <= cnt:\n print(ai)\n break\n return\n\n\nmain()\n", "slow_time": 1372992318, "fast_time": 40236632, "speedup": 34.1229, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_3"} +{"pair_id": "python_14565", "problem_id": "p00150", "language": "python", "slow_code": "r = 10001\nsqrt = int(r**0.5)\np = [1] * r\ntwin = [0] * r\np[0] = 0\np[1::2] = [0 for x in range(1, r, 2)]\nfor i in range(2, r, 2):\n if p[i]:\n p[2 * i + 1 :: i + 1] = [0 for x in range(2 * i + 1, r, i + 1)]\n if p[i - 2]:\n twin[i] = 1\nwhile True:\n n = int(input())\n if n == 0:\n break\n i = n - twin[:n][::-1].index(1)\n print(i - 2, i)\n", "fast_code": "import bisect as bs\n\n\ndef prime(m):\n N = list(range(1, m + 1, 2))\n N[0] = 2\n for i in range(1, int(m**0.5) + 1):\n x = N[i]\n if x:\n N[i + x :: x] = [0] * len(N[i + x :: x])\n return [_f for _f in N if _f]\n\n\nP = prime(10000)\nx = [P[i] for i in range(1, len(P)) if P[i] - P[i - 1] == 2]\nwhile 1:\n n = eval(input())\n if n == 0:\n break\n a = x[bs.bisect_right(x, n) - 1]\n print(a - 2, a)\n", "slow_time": 503838219, "fast_time": 128294719, "speedup": 3.9272, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_3"} +{"pair_id": "python_9341", "problem_id": "p02792", "language": "python", "slow_code": "N = int(eval(input()))\ndigit = len(str(N))\nans = 0\nfor a in range(1, 10):\n for b in range(1, 10):\n x, y = 0, 0\n if a == b:\n if a <= N:\n x += 1\n y += 1\n if a * 10 + b <= N:\n x += 1\n if b * 10 + a <= N:\n y += 1\n if digit <= 2:\n ans += x * y\n continue\n d = 3\n while d < digit:\n x += 10 ** (d - 2)\n y += 10 ** (d - 2)\n d += 1\n for i in range(10 ** (digit - 2)):\n if int(str(a) + str(i).zfill(digit - 2) + str(b)) <= N:\n x += 1\n if int(str(b) + str(i).zfill(digit - 2) + str(a)) <= N:\n y += 1\n ans += x * y\nprint(ans)\n", "fast_code": "N = int(eval(input()))\nmat = list()\nfor i in range(10):\n mat.append([0] * 10)\nfor i in range(N):\n A = int(str(i + 1)[0])\n B = int(str(i + 1)[-1])\n mat[A][B] += 1\nans = 0\nfor i in range(10):\n for j in range(10):\n ans += mat[i][j] * mat[j][i]\nprint(ans)\n", "slow_time": 777891931, "fast_time": 156326668, "speedup": 4.9761, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_11"} +{"pair_id": "python_14574", "problem_id": "p03647", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\nfrom_1 = [False] * N\nto_N = [False] * N\nfor _ in range(M):\n a, b = list(map(int, input().split()))\n if a == 1:\n from_1[b - 1] = True\n elif b == N:\n to_N[a - 1] = True\nfor i in range(1, N):\n if from_1[i] and to_N[i]:\n print(\"POSSIBLE\")\n break\nelse:\n print(\"IMPOSSIBLE\")\n", "fast_code": "def main():\n N, M, *AB = list(map(int, open(0).read().split()))\n from_1, to_N = set(), set()\n for a, b in zip(*[iter(AB)] * 2):\n if a == 1:\n from_1.add(b)\n if b == N:\n to_N.add(a)\n flg = from_1 & to_N\n print((\"POSSIBLE\" if flg else \"IMPOSSIBLE\"))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 1854976633, "fast_time": 46032357, "speedup": 40.2972, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_5"} +{"pair_id": "python_2295", "problem_id": "p02700", "language": "python", "slow_code": "from math import floor, ceil, sqrt, factorial, log\nfrom collections import Counter, deque\nfrom functools import reduce\n\n\ndef S():\n return eval(input())\n\n\ndef I():\n return int(eval(input()))\n\n\ndef MS():\n return list(map(str, input().split()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef FLI():\n return [int(i) for i in input().split()]\n\n\ndef LS():\n return list(MS())\n\n\ndef LI():\n return list(MI())\n\n\ndef LLS():\n return [list(map(str, l.split())) for l in eval(input())]\n\n\ndef LLI():\n return [list(map(int, l.split())) for l in eval(input())]\n\n\ndef LLSN(n: int):\n return [LS() for _ in range(n)]\n\n\ndef LLIN(n: int):\n return [LI() for _ in range(n)]\n\n\nA, B, C, D = MI()\nx = -(-A // D)\ny = -(-C // B)\nif x >= y:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "a, b, c, d = list(map(int, input().split()))\nx = (a + d - 1) // d\ny = (c + b - 1) // b\nprint((\"Yes\" if x >= y else \"No\"))\n", "slow_time": 100220167, "fast_time": 16213673, "speedup": 6.1812, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_19"} +{"pair_id": "python_11968", "problem_id": "p02716", "language": "python", "slow_code": "n = int(eval(input()))\narr = list(map(int, input().split()))\nif n % 2 == 0:\n ans = -(10**18)\n dp = [[0] * 2 for _ in range(n + 10)]\n for i in range(n):\n dp[i + 1][0] = dp[i - 1][0] + arr[i]\n dp[i + 1][1] = max(dp[i - 1][1] + arr[i], dp[i - 2][0] + arr[i])\n ans = max(ans, dp[n - 1][0], dp[n][1])\n dp = [[0] * 2 for _ in range(n + 10)]\n for i in range(1, n):\n dp[i + 1][0] = dp[i - 1][0] + arr[i]\n dp[i + 1][1] = max(dp[i - 1][1] + arr[i], dp[i - 2][0] + arr[i])\n ans = max(ans, dp[n][0])\n print(ans)\nelse:\n ans = -(10**18)\n dp = [[0] * 3 for _ in range(n + 10)]\n for i in range(n):\n dp[i + 1][0] = dp[i - 1][0] + arr[i]\n dp[i + 1][1] = max(dp[i - 1][1] + arr[i], dp[i - 2][0] + arr[i])\n dp[i + 1][2] = max(\n dp[i - 1][2] + arr[i], dp[i - 2][1] + arr[i], dp[i - 3][0] + arr[i]\n )\n ans = max(ans, dp[n - 2][0], dp[n - 1][1], dp[n][2])\n dp = [[0] * 3 for _ in range(n + 10)]\n for i in range(1, n):\n dp[i + 1][0] = dp[i - 1][0] + arr[i]\n dp[i + 1][1] = max(dp[i - 1][1] + arr[i], dp[i - 2][0] + arr[i])\n dp[i + 1][2] = max(\n dp[i - 1][2] + arr[i], dp[i - 2][1] + arr[i], dp[i - 3][0] + arr[i]\n )\n ans = max(ans, dp[n - 1][0], dp[n][1])\n dp = [[0] * 3 for _ in range(n + 10)]\n for i in range(2, n):\n dp[i + 1][0] = dp[i - 1][0] + arr[i]\n dp[i + 1][1] = max(dp[i - 1][1] + arr[i], dp[i - 2][0] + arr[i])\n dp[i + 1][2] = max(\n dp[i - 1][2] + arr[i], dp[i - 2][1] + arr[i], dp[i - 3][0] + arr[i]\n )\n ans = max(ans, dp[n][0])\n print(ans)\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nINF = 10**18\ndp0 = 0\ndp1 = -INF\ndp2 = -INF\nfor i, a in enumerate(A):\n if i % 2 == 0:\n dp1 = max(dp1, dp0)\n dp0 += a\n dp2 += a\n else:\n dp2 = max(dp2, dp1)\n dp1 += a\nif N % 2 == 1:\n print((max(dp1, dp2)))\nelse:\n print((max(dp0, dp1)))\n", "slow_time": 202330134, "fast_time": 41511520, "speedup": 4.8741, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_1"} +{"pair_id": "python_7025", "problem_id": "p03013", "language": "python", "slow_code": "NM = list(map(int, input().split()))\nN = NM[0]\nM = NM[1]\nA = []\nwhile True:\n try:\n A.append(int(eval(input())))\n except:\n break\ncountlist = [1, 1, 2]\nif N > 3:\n for i in range(3, N + 1):\n a = countlist[i - 2] + countlist[i - 1]\n if a > 1000000007:\n a = a % 1000000007\n countlist.append(a)\nt = 0\ncount = 0\nout = []\nif N > 1:\n for i in range(1, N + 1):\n count += 1\n if (t < len(A)) and (i == A[t]):\n t += 1\n while (t < len(A)) and (i == A[t]):\n t += 1\n if count > 0:\n out.append(countlist[count - 1])\n else:\n out.append(0)\n break\n count = -1\nif count >= 0:\n out.append(countlist[count])\noutput = 1\nfor i in range(len(out)):\n output = output * out[i]\n if output > 1000000007:\n output = output % 1000000007\nprint(output)\n", "fast_code": "n, m = list(map(int, input().split()))\na = [1] * (n + 1)\nmod = 1e9 + 7\nfor i in range(m):\n a[int(eval(input()))] = 0\nb = [1] * (n + 1)\nif a[1] == 0:\n b[1] = 0\nfor i in range(2, n + 1):\n b[i] = int(a[i] * (b[i - 2] + b[i - 1]) % mod)\nprint((b[n]))\n", "slow_time": 82215920, "fast_time": 40079499, "speedup": 2.0513, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_16"} +{"pair_id": "python_11810", "problem_id": "p03579", "language": "python", "slow_code": "from networkx import *\n\nn, *t = list(map(str.split, open(0)))\nn, m = list(map(int, n))\ng = Graph()\ng.add_edges_from(t)\ntry:\n a, b = list(map(len, bipartite.sets(g)))\n a *= b\nexcept:\n a = n * ~-n // 2\nprint((a - m))\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**7)\nN, M = list(map(int, input().split()))\nAB = [[int(x) for x in input().split()] for _ in range(M)]\nG = [[] for _ in range(N + 1)]\nfor a, b in AB:\n G[a].append(b)\n G[b].append(a)\ncolor = [None] * (N + 1)\ncolor[1] = 0\nq = [1]\n\nwhile q:\n x = q.pop()\n for y in G[x]:\n if color[y] is None:\n color[y] = 1 - color[x]\n q.append(y)\nbl = all(color[a] != color[b] for a, b in AB)\n\nif bl:\n\n x = sum(color[1:])\n y = N - x\n print((x * y - M))\nelse:\n\n print((N * (N - 1) // 2 - M))\n", "slow_time": 18150154613, "fast_time": 74827214, "speedup": 242.5609, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_10"} +{"pair_id": "python_17888", "problem_id": "p02595", "language": "python", "slow_code": "def get_input() -> tuple:\n \"\"\"\"\"\"\n N, D = list(map(int, input().split()))\n X, Y = [], []\n for n in range(N):\n X_n, Y_n = list(map(int, input().split()))\n X.append(X_n)\n Y.append(Y_n)\n return N, D, X, Y\n\n\ndef main(N: int, D: int, X: list, Y: list) -> None:\n \"\"\"\"\"\"\n\n ans = 0\n for n in range(N):\n X_n = X[n]\n Y_n = Y[n]\n if X_n * X_n + Y_n * Y_n <= D * D:\n ans += 1\n\n print(ans)\n\n\nif __name__ == \"__main__\":\n\n N, D, X, Y = get_input()\n\n main(N, D, X, Y)\n", "fast_code": "N, D = list(map(int, input().split()))\ncount = 0\nfor i in range(N):\n a, b = list(map(int, input().split()))\n if (a * a + b * b) <= D * D:\n count += 1\nprint(count)\n", "slow_time": 63193822, "fast_time": 27297509, "speedup": 2.315, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_17"} +{"pair_id": "python_11642", "problem_id": "p02621", "language": "python", "slow_code": "N = 10**7\nM = 10**5\narr = list(range(M))\n\n\ndef f(x):\n return x\n\n\nfor i in range(N):\n b = arr[i % M]\n b = f(b)\na = int(eval(input()))\nprint((a + a**2 + a**3))\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\na = I()\nprint((a + a**2 + a**3))\n", "slow_time": 1019313983739, "fast_time": 44676795, "speedup": 22815.2889, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_7"} +{"pair_id": "python_14676", "problem_id": "p02713", "language": "python", "slow_code": "import math\nfrom functools import reduce\n\n\ndef gcd_list(numbers):\n return reduce(math.gcd, numbers)\n\n\nk = int(eval(input()))\ns = 0\nfor i in range(1, k + 1):\n for j in range(1, k + 1):\n for k in range(1, k + 1):\n s += gcd_list([i, j, k])\nprint(s)\n", "fast_code": "from sys import stdin\nimport numpy as np\n\n\ndef main():\n\n readline = stdin.readline\n k = int(readline())\n a = np.arange(1, k + 1, dtype=np.int64)\n b = np.gcd.outer(np.gcd.outer(a, a), a)\n print((b.sum()))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 43811077627, "fast_time": 489850399, "speedup": 89.4377, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_27"} +{"pair_id": "python_5902", "problem_id": "p03693", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef solve():\n r, g, b = LI()\n s = r * 100 + g * 10 + b\n if s % 4 == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n return\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "a = int(input().replace(\" \", \"\"))\nif a % 4 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "slow_time": 90554878, "fast_time": 11532274, "speedup": 7.8523, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_13"} +{"pair_id": "python_14345", "problem_id": "p03185", "language": "python", "slow_code": "class Lichaotree:\n\n def __init__(self, X):\n self.N = len(X)\n self.N0 = 2 ** (self.N - 1).bit_length()\n self.comp = {v: k for k, v in enumerate(X)}\n self.inf = 10**12\n self.X = X + [self.inf] * (self.N0 - self.N)\n self.data = [None] * (2 * self.N0)\n self.size = [0] * self.N0 + [1] * self.N0\n for i in range(self.N0 - 1, 0, -1):\n self.size[i] = 2 * self.size[2 * i]\n self.start = [0] * (2 * self.N0)\n for i in range(1, 2 * self.N0):\n if i == i & (-i):\n continue\n self.start[i] = self.start[i - 1] + self.size[i]\n\n def f(self, line, x):\n return line[0] * x + line[1]\n\n def _update(self, k, line):\n if self.data[k] is None:\n self.data[k] = line\n return\n l = self.start[k]\n r = l + self.size[k]\n while True:\n if self.data[k] is None:\n self.data[k] = line\n return\n m = (l + r) // 2\n lx = self.X[l]\n mx = self.X[m]\n rx = self.X[r - 1]\n gl = self.f(self.data[k], lx) > self.f(line, lx)\n gm = self.f(self.data[k], mx) > self.f(line, mx)\n gr = self.f(self.data[k], rx) > self.f(line, rx)\n if gl and gr:\n self.data[k] = line\n return\n if not gl and not gr:\n return\n if gm:\n self.data[k], line = line, self.data[k]\n gl = not gl\n if gl:\n r = m\n k = 2 * k\n else:\n l = m\n k = 2 * k + 1\n\n def query(self, x):\n k = self.comp[x] + self.N0\n s = self.inf\n while k > 0:\n if self.data[k]:\n s = min(s, self.f(self.data[k], x))\n k = k >> 1\n return s\n\n def addline(self, line):\n self._update(1, line)\n\n def addlineseg(self, l, r, line):\n\n L = l + self.N0\n R = r + self.N0\n while L < R:\n if R & 1:\n R -= 1\n self._update(R, line)\n if L & 1:\n self._update(L, line)\n L += 1\n L >>= 1\n R >>= 1\n\n\nN, C = list(map(int, input().split()))\nH = list(map(int, input().split()))\nT = Lichaotree(H)\ndp = [10**19] * N\ndp[0] = 0\nT.addline((-2 * H[0], H[0] ** 2))\nfor i in range(1, N):\n mi = T.query(H[i])\n dp[i] = mi + C + H[i] ** 2\n T.addline((-2 * H[i], H[i] ** 2 + dp[i]))\nprint((dp[-1]))\n", "fast_code": "n, C, *H = list(map(int, open(0).read().split()))\np = [0]\nP = [0]\nfor i in range(1, n):\n h = H[i]\n g = (\n lambda x, y: (p[P[y]] - p[P[x]]) / (H[P[x]] - H[P[y]])\n - H[P[y]]\n - H[P[x]]\n + 2 * h\n )\n while len(P) > 1 and g(1, 0) > 0:\n P.pop(0)\n p += [p[P[0]] + (H[P[0]] - h) ** 2 + C]\n P += [i]\n h = 0\n while len(P) > 2 and g(-1, -2) > g(-2, -3):\n P.pop(-2)\nprint((p[-1]))\n", "slow_time": 204801603, "fast_time": 65604469, "speedup": 3.1218, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_3"} +{"pair_id": "python_6155", "problem_id": "p00033", "language": "python", "slow_code": "def dfs(i, b, c):\n if i == 11:\n return b == sorted(b) and c == sorted(c)\n if dfs(i + 1, b + [balls[i - 1]], c):\n return True\n if dfs(i + 1, b, c + [balls[i - 1]]):\n return True\n return False\n\n\nif __name__ == \"__main__\":\n N = int(eval(input()))\n for i in range(N):\n balls = list(map(int, input().split()))\n if dfs(1, [], []):\n print(\"YES\")\n else:\n print(\"NO\")\n", "fast_code": "def s(a):\n b = c = 0\n for i in a:\n if i > b:\n b = i\n elif i > c:\n c = i\n else:\n return False\n return True\n\n\nfor n in range(int(input())):\n print(\"YES\" if s(list(map(int, input().split()))) else \"NO\")\n", "slow_time": 518446104, "fast_time": 26821677, "speedup": 19.3294, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_13"} +{"pair_id": "python_18369", "problem_id": "p02991", "language": "python", "slow_code": "import sys\nfrom collections import deque\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST():\n return list(map(int, input().split()))\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = float(\"inf\")\nMOD = 10**9 + 7\n\n\ndef bfs(N: int, nodes: list, src: int) -> list:\n \"\"\"\"\"\"\n\n res = [[INF] * N for i in range(3)]\n\n que = deque([(0, 0, src)])\n res[0][src] = 0\n\n while len(que) != 0:\n\n _, k, cur = que.popleft()\n\n for nxtk, nxt in nodes[k][cur]:\n\n if res[k][cur] + 1 < res[nxtk][nxt]:\n res[nxtk][nxt] = res[k][cur] + 1\n\n que.append((res[nxtk][nxt], nxtk, nxt))\n\n return res\n\n\nN, M = MAP()\nnodes = [[] for i in range(N)]\nfor i in range(M):\n u, v = MAP()\n nodes[u - 1].append(v - 1)\nS, T = MAP()\nS -= 1\nT -= 1\n\nnodes2 = [[[] for j in range(N)] for i in range(3)]\nfor i in range(3):\n for u, node in enumerate(nodes):\n for v in node:\n nodes2[i][u].append(((i + 1) % 3, v))\nres = bfs(N, nodes2, S)\nif res[0][T] == INF:\n print((-1))\nelse:\n\n print((res[0][T] // 3))\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\nN, M = list(map(int, input().split()))\n\ngraph = [[] for _ in range(N)]\nfor _ in range(M):\n a, b = list(map(int, input().split()))\n graph[a - 1].append(b - 1)\nS, T = [int(x) - 1 for x in input().split()]\nq = {S}\nchecked = [False] * N\nchecked[S] = True\nok = False\nc = 0\nwhile q:\n c += 1\n qq = set()\n if c % 3 == 0:\n for p in q:\n for np in graph[p]:\n if np == T:\n ok = True\n break\n if not checked[np]:\n qq.add(np)\n checked[np] = True\n else:\n for p in q:\n for np in graph[p]:\n qq.add(np)\n if ok:\n break\n q = qq\nif ok:\n print((c // 3))\nelse:\n print((-1))\n", "slow_time": 132832781, "fast_time": 55671167, "speedup": 2.386, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_15"} +{"pair_id": "python_10708", "problem_id": "p03767", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef A():\n n = I()\n a = LI()\n a.sort(key=lambda x: -x)\n ans = 0\n for i in range(n):\n ans += a[2 * i + 1]\n print(ans)\n return\n\n\ndef B():\n def dfs(d, x, c):\n if d <= dp[x]:\n return\n dp[x] = d\n if not f[x]:\n f[x] = c\n for y in v[x]:\n dfs(d - 1, y, c)\n\n n, m = LI()\n f = [0] * n\n v = [[] for i in range(n)]\n for i in range(m):\n a, b = LI()\n a -= 1\n b -= 1\n v[a].append(b)\n v[b].append(a)\n dp = defaultdict(lambda: -1)\n q = I()\n l = LIR(q)\n l = l[::-1]\n for x, d, c in l:\n x -= 1\n dfs(d, x, c)\n for i in f:\n print(i)\n return\n\n\ndef C():\n n = I()\n return\n\n\ndef D():\n n = I()\n return\n\n\ndef E():\n n = I()\n return\n\n\ndef F():\n n = I()\n return\n\n\nif __name__ == \"__main__\":\n A()\n", "fast_code": "n = int(eval(input()))\nprint((sum(sorted(map(int, input().split()))[::-1][1 : n * 2 : 2])))\n", "slow_time": 173061558, "fast_time": 18287126, "speedup": 9.4636, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_11"} +{"pair_id": "python_4903", "problem_id": "p03598", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\ninf = 1 << 60\nmod = 1000000007\nni = lambda: int(ns())\nnin = lambda y: [ni() for _ in range(y)]\nna = lambda: list(map(int, stdin.readline().split()))\nnan = lambda y: [na() for _ in range(y)]\nnf = lambda: float(ns())\nnfn = lambda y: [nf() for _ in range(y)]\nnfa = lambda: list(map(float, stdin.readline().split()))\nnfan = lambda y: [nfa() for _ in range(y)]\nns = lambda: stdin.readline().rstrip()\nnsn = lambda y: [ns() for _ in range(y)]\nncl = lambda y: [list(ns()) for _ in range(y)]\nnas = lambda: stdin.readline().split()\nn = ni()\nk = ni()\nx = na()\nans = 0\nfor i in range(n):\n ans += min(abs(x[i]) * 2, abs(x[i] - k) * 2)\nprint(ans)\n", "fast_code": "n = int(eval(input()))\nk = int(eval(input()))\nx = list(map(int, input().split()))\nans = 0\nfor i in x:\n ans += min(abs(i - 0), abs(i - k)) * 2\nprint(ans)\n", "slow_time": 101026872, "fast_time": 26259866, "speedup": 3.8472, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_4"} +{"pair_id": "python_17849", "problem_id": "p02586", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\nimport math\nfrom copy import copy, deepcopy\nfrom copy import deepcopy as dcp\nfrom operator import itemgetter\nfrom bisect import bisect_left, bisect, bisect_right\n\n\nfrom collections import deque, defaultdict\n\n\nfrom collections import Counter\n\n\nfrom itertools import accumulate, combinations, permutations, product\n\n\nfrom heapq import heapify, heappop, heappush\n\n\nfrom functools import reduce, lru_cache\n\n\nfrom decimal import Decimal\n\n\ndef input():\n x = sys.stdin.readline()\n return x[:-1] if x[-1] == \"\\n\" else x\n\n\ndef printe(*x):\n print(\"## \", *x, file=sys.stderr)\n\n\ndef printl(li):\n _ = print(*li, sep=\"\\n\") if li else None\n\n\ndef argsort(s, return_sorted=False):\n inds = sorted(range(len(s)), key=lambda k: s[k])\n if return_sorted:\n return inds, [s[i] for i in inds]\n return inds\n\n\ndef alp2num(c, cap=False):\n return ord(c) - 97 if not cap else ord(c) - 65\n\n\ndef num2alp(i, cap=False):\n return chr(i + 97) if not cap else chr(i + 65)\n\n\ndef matmat(A, B):\n K, N, M = len(B), len(A), len(B[0])\n return [\n [sum([(A[i][k] * B[k][j]) for k in range(K)]) for j in range(M)]\n for i in range(N)\n ]\n\n\ndef matvec(M, v):\n N, size = len(v), len(M)\n return [sum([M[i][j] * v[j] for j in range(N)]) for i in range(size)]\n\n\ndef T(M):\n n, m = len(M), len(M[0])\n return [[M[j][i] for j in range(n)] for i in range(m)]\n\n\ndef binr(x):\n return bin(x)[2:]\n\n\ndef bitcount(x):\n x = x - ((x >> 1) & 0x5555555555555555)\n x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)\n x = (x + (x >> 4)) & 0x0F0F0F0F0F0F0F0F\n x += x >> 8\n x += x >> 16\n x += x >> 32\n return x & 0x7F\n\n\ndef main():\n mod = 1000000007\n\n R, C, K = map(int, input().split())\n\n base = 5000\n S = []\n for i in range(K):\n r, c, v = map(int, input().split())\n r -= 1\n c -= 1\n S.append((r * base + c, v))\n S.sort(key=itemgetter(0))\n p = 0\n dp = [[0] * 4 for _ in range(C)]\n dpi = [[0] * 4 for _ in range(C)]\n for i in range(R):\n for j in range(C):\n cv = 0\n if p < K and i * base + j == S[p][0]:\n cv = S[p][1]\n p += 1\n if j > 0:\n dpi[j] = copy(dpi[j - 1])\n else:\n dpi[0] = [0] * 4\n if i > 0:\n dpi[j][0] = max(dp[j], dpi[j][0])\n if cv != 0:\n for k in range(2, -1, -1):\n dpi[j][k + 1] = max(dpi[j][k] + cv, dpi[j][k + 1])\n\n dp[j] = max(dpi[j])\n print(dp[-1])\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "f, g, h = range, max, input\nR, C, K = list(map(int, h().split()))\nG = [[0] * -~C for i in f(R + 1)]\nfor i in \"_\" * K:\n r, c, v = list(map(int, h().split()))\n G[r][c] = v\nF = [[[0] * -~C for i in f(R + 1)] for i in f(4)]\nfor r in f(1, R + 1):\n for x in f(1, 4):\n for c in f(1, C + 1):\n F[x][r][c] = g(\n F[x - 1][r][c],\n F[x - 1][r][c - 1] + G[r][c],\n F[x][r][c - 1],\n (x < 2) * (G[r][c] + g(F[1][r - 1][c], F[2][r - 1][c], F[3][r - 1][c])),\n )\nprint((F[3][R][C]))\n", "slow_time": 163255328, "fast_time": 59519739, "speedup": 2.7429, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_28"} +{"pair_id": "python_5180", "problem_id": "p03734", "language": "python", "slow_code": "N, W = list(map(int, input().split()))\nwvs = []\nfor i in range(N):\n w, v = list(map(int, input().split()))\n wvs.append((w, v))\n\nw0 = wvs[0][0]\ndp = [[[-1] * (330) for i in range(110)] for k in range(110)]\ndp[0][0][0] = 0\nfor i in range(N):\n w, v = wvs[i]\n dw = w - w0\n for j in range(i + 1):\n for k in range(310):\n\n if dp[i][j][j] == -1:\n continue\n dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k])\n dp[i + 1][j + 1][k + dw] = max(dp[i][j][k] + v, dp[i + 1][j + 1][k + dw])\nd = dp[N]\nans = 0\nfor j in range(N + 1):\n if W - j * w0 >= 0:\n a = max(d[j][: W - j * w0 + 1])\n ans = max(ans, a)\nprint(ans)\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\nfrom itertools import accumulate\n\nN, W = list(map(int, input().split()))\nWV = [[int(i) for i in input().split()] for _ in range(N)]\nMINW = WV[0][0]\n\nW0 = sorted([0] + [v for w, v in WV if w == MINW])\nW1 = sorted([0] + [v for w, v in WV if w == MINW + 1])\nW2 = sorted([0] + [v for w, v in WV if w == MINW + 2])\nW3 = sorted([0] + [v for w, v in WV if w == MINW + 3])\n\nW0 = tuple(accumulate(W0))\nW1 = tuple(accumulate(W1))\nW2 = tuple(accumulate(W2))\nW3 = tuple(accumulate(W3))\nans = 0\nfor w0 in range(len(W0)):\n for w1 in range(len(W1)):\n for w2 in range(len(W2)):\n for w3 in range(len(W3)):\n\n tmp = (len(W0) - (w0 + 1)) * MINW\n tmp += (len(W1) - (w1 + 1)) * (MINW + 1)\n tmp += (len(W2) - (w2 + 1)) * (MINW + 2)\n tmp += (len(W3) - (w3 + 1)) * (MINW + 3)\n\n if tmp <= W:\n\n tmp = W0[-1] - W0[w0]\n tmp += W1[-1] - W1[w1]\n tmp += W2[-1] - W2[w2]\n tmp += W3[-1] - W3[w3]\n ans = max(ans, tmp)\nprint(ans)\n", "slow_time": 7051948785, "fast_time": 127846253, "speedup": 55.1596, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_22"} +{"pair_id": "python_11192", "problem_id": "p03816", "language": "python", "slow_code": "import functools\n\nN = int(eval(input()))\nA = list(map(int, input().split()))\nd = [0 for i in range(10**5 + 1)]\nfor a in A:\n d[a] = 1\ns = sum(d)\nprint((s - (0 if s % 2 else 1)))\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nS = {}\nfor i in range(N):\n if A[i] in S:\n S[A[i]] += 1\n else:\n S[A[i]] = 1\nd = 0\nfor i in list(S.values()):\n d += i - 1\nprint((len(set(A)) - d % 2))\n", "slow_time": 1492903758, "fast_time": 32356430, "speedup": 46.1393, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_19"} +{"pair_id": "python_287", "problem_id": "p02714", "language": "python", "slow_code": "import sys\nimport fractions\n\n\ndef in_ctrl():\n _input = [_.rstrip() for _ in sys.stdin.readlines()]\n\n N = int(_input[0])\n S = _input[1]\n\n return N, S\n\n\ndef out_ctrl(s):\n print(s)\n\n\nif __name__ == \"__main__\":\n N, S = in_ctrl()\n\n cnt = 0\n R = list(\n map(\n bool,\n list(\n map(int, list(S.replace(\"R\", \"1\").replace(\"G\", \"0\").replace(\"B\", \"0\")))\n ),\n )\n )\n G = list(\n map(\n bool,\n list(\n map(int, list(S.replace(\"R\", \"0\").replace(\"G\", \"1\").replace(\"B\", \"0\")))\n ),\n )\n )\n B = list(\n map(\n bool,\n list(\n map(int, list(S.replace(\"R\", \"0\").replace(\"G\", \"0\").replace(\"B\", \"1\")))\n ),\n )\n )\n R_cum, G_cum, B_cum = {}, {}, {}\n for i, r in enumerate(R):\n if r:\n for j, g in enumerate(G[i + 1 :]):\n if g:\n if i + j + 2 not in B_cum:\n B_cum[i + j + 2] = sum(B[i + j + 2 :])\n if i + 2 * j + 2 < N:\n cnt += B_cum[i + j + 2] - B[i + 2 * j + 2]\n else:\n cnt += B_cum[i + j + 2]\n for j, g in enumerate(B[i + 1 :]):\n if g:\n if i + j + 2 not in G_cum:\n G_cum[i + j + 2] = sum(G[i + j + 2 :])\n if i + 2 * j + 2 < N:\n cnt += G_cum[i + j + 2] - G[i + 2 * j + 2]\n else:\n cnt += G_cum[i + j + 2]\n for i, r in enumerate(G):\n if r:\n for j, g in enumerate(R[i + 1 :]):\n if g:\n if i + j + 2 not in B_cum:\n B_cum[i + j + 2] = sum(B[i + j + 2 :])\n if i + 2 * j + 2 < N:\n cnt += B_cum[i + j + 2] - B[i + 2 * j + 2]\n else:\n cnt += B_cum[i + j + 2]\n for j, b in enumerate(B[i + 1 :]):\n if b:\n if i + j + 2 not in R_cum:\n R_cum[i + j + 2] = sum(R[i + j + 2 :])\n if i + 2 * j + 2 < N:\n cnt += R_cum[i + j + 2] - R[i + 2 * j + 2]\n else:\n cnt += R_cum[i + j + 2]\n for i, r in enumerate(B):\n if r:\n for j, g in enumerate(R[i + 1 :]):\n if g:\n if i + j + 2 not in G_cum:\n G_cum[i + j + 2] = sum(G[i + j + 2 :])\n if i + 2 * j + 2 < N:\n cnt += G_cum[i + j + 2] - G[i + 2 * j + 2]\n else:\n cnt += G_cum[i + j + 2]\n for j, b in enumerate(G[i + 1 :]):\n if b:\n if i + j + 2 not in R_cum:\n R_cum[i + j + 2] = sum(R[i + j + 2 :])\n if i + 2 * j + 2 < N:\n cnt += R_cum[i + j + 2] - R[i + 2 * j + 2]\n else:\n cnt += R_cum[i + j + 2]\n\n out_ctrl(cnt)\n", "fast_code": "n, s = open(0)\nn = int(n)\nc = s.count\nprint(\n (\n c(\"R\") * c(\"G\") * c(\"B\")\n - sum(\n s[i] != s[i + j >> 1] != s[j] != s[i]\n for i in range(n)\n for j in range(i + 2, n, 2)\n )\n )\n)\n", "slow_time": 331946011, "fast_time": 54655555, "speedup": 6.0734, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_29"} +{"pair_id": "python_6303", "problem_id": "p03419", "language": "python", "slow_code": "def calc0(N, M):\n cell = [[0 for i in range(M)] for j in range(N)]\n for i in range(M):\n for j in range(N):\n for y in range(-1, 2):\n for x in range(-1, 2):\n xx = i + x\n yy = j + y\n if 0 <= xx < M and 0 <= yy < N:\n cell[yy][xx] ^= 1\n r = 0\n for i in range(M):\n for j in range(N):\n if cell[j][i]:\n r += 1\n return r\n\n\ndef calc(N, M):\n if N == 1 and M == 1:\n return 1\n if N >= 2 and M >= 2:\n return (N - 2) * (M - 2)\n if N == 1:\n return M - 2\n return N - 2\n\n\nN, M = [int(_) for _ in input().split()]\nprint((calc(N, M)))\n", "fast_code": "n, m = list(map(int, input().split()))\nif n == 1 or m == 1:\n print((max(n, m) - 2 if n * m > 1 else 1))\nelse:\n print(((n - 2) * (m - 2)))\n", "slow_time": 72088785, "fast_time": 19287827, "speedup": 3.7375, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_2"} +{"pair_id": "python_3021", "problem_id": "p03455", "language": "python", "slow_code": "def ketanowa(p):\n ans = 0\n p = str(p)\n for i in p:\n ans += int(i)\n return ans\n\n\ndef main():\n temp = input().split(\" \")\n n = int(temp[0])\n a = int(temp[1])\n if n * a % 2 == 0:\n print(\"Even\")\n else:\n print(\"Odd\")\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "a, b = list(map(int, input().split()))\nprint((\"Even\" if a % 2 == 0 or b % 2 == 0 else \"Odd\"))\n", "slow_time": 31026185, "fast_time": 12589067, "speedup": 2.4645, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_22"} +{"pair_id": "python_15155", "problem_id": "p03775", "language": "python", "slow_code": "import math\n\nN = int(eval(input()))\nn = int(math.sqrt(N))\ndev = 0\nfor i in range(1, n + 1):\n if N % i == 0:\n dev = i\nprint((max(len(str(dev)), len(str(N // dev)))))\n", "fast_code": "def PrimeDecomp(N, ConcFlag):\n if ConcFlag:\n if N <= 1:\n return [1], 1\n else:\n I = 2\n PrimeDec = []\n DivCount = 1\n while I * I <= N:\n Cnt = 0\n while N % I == 0:\n N //= I\n PrimeDec.append(I)\n if Cnt >= 1:\n DivCount *= Cnt + 1\n I += 1\n if N >= 2:\n PrimeDec.append(N)\n DivCount *= 2\n return PrimeDec, DivCount\n else:\n if N <= 1:\n return [1], [1], 1\n else:\n I = 2\n PrimeDec = []\n PrimeCnt = []\n DivCount = 1\n while I * I <= N:\n Cnt = 0\n while N % I == 0:\n N //= I\n Cnt += 1\n if Cnt >= 1:\n PrimeDec.append(I)\n PrimeCnt.append(Cnt)\n DivCount *= Cnt + 1\n I += 1\n if N >= 2:\n PrimeDec.append(N)\n PrimeCnt.append(1)\n DivCount *= 2\n return PrimeDec, PrimeCnt, DivCount\n\n\nfrom itertools import combinations\nfrom operator import mul\nfrom functools import reduce\n\nN = int(eval(input()))\nPrimeDec, _ = PrimeDecomp(N, True)\nFABMax = len(str(N))\nfor TR in range(1, len(PrimeDec) + 1):\n for A in set(reduce(mul, T) for T in combinations(PrimeDec, TR)):\n B = N // A\n FABMax = min(FABMax, max(len(str(A)), len(str(B))))\nprint(FABMax)\n", "slow_time": 1769825882, "fast_time": 233216425, "speedup": 7.5888, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_7"} +{"pair_id": "python_3577", "problem_id": "p02934", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef S():\n return eval(input())\n\n\ndef main():\n n = I()\n l = LI()\n sm = 0\n for x in l:\n sm += 1 / x\n return 1 / sm\n\n\nprint((main()))\n", "fast_code": "n = eval(input())\nr = 0\nfor s in input().split():\n r += 1 / int(s)\nprint((1 / r))\n", "slow_time": 79645167, "fast_time": 14459457, "speedup": 5.5082, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_28"} +{"pair_id": "python_11705", "problem_id": "p02536", "language": "python", "slow_code": "from networkx.utils import UnionFind\nimport sys\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\ndef main():\n n, m = list(map(int, input().split()))\n uf = UnionFind()\n for i in range(1, n + 1):\n _ = uf[i]\n for _ in range(m):\n a, b = list(map(int, input().split()))\n uf.union(a, b)\n print((len(list(uf.to_sets())) - 1))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "def main():\n n, m = list(map(int, input().split()))\n\n uf = [-1] * (n + 1)\n\n def uf_leader(a):\n if uf[a] < 0:\n return a\n uf[a] = uf_leader(uf[a])\n return uf[a]\n\n def uf_unite(a, b):\n ua, ub = uf_leader(a), uf_leader(b)\n if ua == ub:\n return False\n if uf[ua] > uf[ub]:\n ua, ub = ub, ua\n uf[ua] += uf[ub]\n uf[ub] = ua\n return True\n\n def uf_leaders():\n return [v for v in range(1, n + 1) if uf[v] < 0]\n\n for _ in range(m):\n a, b = list(map(int, input().split()))\n uf_unite(a, b)\n\n ans = len(uf_leaders()) - 1\n print(ans)\n\n\nmain()\n", "slow_time": 18069444838, "fast_time": 70481401, "speedup": 256.3718, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_3"} +{"pair_id": "python_16057", "problem_id": "p03599", "language": "python", "slow_code": "a, b, c, d, e, f = list(map(int, input().split()))\nwater = []\nfor i in range(31):\n for j in range(31):\n if (a * i + b * j) * 100 <= f:\n water.append(a * i + b * j)\nwater = list(set(water))\nresult = [[0, a * 100, 0]]\nfor i in water:\n for x in range(301):\n for y in range(301):\n if (\n i > 0\n and c * x + d * y > 0\n and c * x + d * y <= i * e\n and (c * x + d * y + 100 * i) <= f\n ):\n result.append(\n [\n 100 * (c * x + d * y) / (c * x + d * y + 100 * i),\n c * x + d * y + 100 * i,\n c * x + d * y,\n ]\n )\nresult.sort(reverse=True)\nprint((result[0][1], result[0][2]))\n", "fast_code": "a, b, c, d, e, f = list(map(int, input().split()))\nwater = []\nfor i in range(31):\n for j in range(31):\n if a * i * 100 + b * j * 100 > f:\n break\n water.append(a * i * 100 + b * j * 100)\nwater = sorted(list(set(water)))\nsugar = []\nfor i in range(3001):\n for j in range(3001):\n if c * i + d * j > f:\n break\n sugar.append(c * i + d * j)\nsugar = sorted(list(set((sugar))))\nsugar_ratio = 0\nfor i in water:\n for j in sugar:\n if i != 0:\n sugar_water = i + j\n if sugar_water <= f:\n if j / i <= e / 100:\n if j / sugar_water >= sugar_ratio:\n sugar_ratio = j / sugar_water\n ans_sugar_water = sugar_water\n ans_sugar = j\nprint((ans_sugar_water, ans_sugar))\n", "slow_time": 31665142718, "fast_time": 4244468469, "speedup": 7.4603, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_12"} +{"pair_id": "python_5306", "problem_id": "p03997", "language": "python", "slow_code": "from collections import deque\nfrom heapq import heapify, heappop, heappush, heappushpop\nfrom copy import copy, deepcopy\nfrom itertools import product, permutations, combinations, combinations_with_replacement\nfrom collections import defaultdict, Counter\nfrom bisect import bisect_left, bisect_right\n\n\nfrom functools import reduce\nfrom pprint import pprint\n\nINF = float(\"inf\")\n\n\ndef myinput():\n return list(map(int, input().split()))\n\n\ndef mylistinput(n):\n return [list(myinput()) for _ in range(n)]\n\n\ndef mycol(data, col):\n return [row[col] for row in data]\n\n\ndef mysort(data, col, reverse_flag):\n data.sort(key=lambda x: x[col], reverse=reverse_flag)\n return data\n\n\ndef mymax(data):\n M = -1 * float(\"inf\")\n for i in range(len(data)):\n m = max(data[i])\n M = max(M, m)\n return M\n\n\ndef mymin(data):\n m = float(\"inf\")\n for i in range(len(data)):\n M = min(data[i])\n m = min(m, M)\n return m\n\n\ndef mycount(ls, x):\n\n l = bisect_left(ls, x)\n r = bisect_right(ls, x)\n return r - l\n\n\ndef myoutput(ls, space=True):\n if space:\n if len(ls) == 0:\n print(\" \")\n elif type(ls[0]) == str:\n print((\" \".join(ls)))\n elif type(ls[0]) == int:\n print((\" \".join(map(str, ls))))\n else:\n print(\"Output Error\")\n else:\n if len(ls) == 0:\n print(\"\")\n elif type(ls[0]) == str:\n print((\"\".join(ls)))\n elif type(ls[0]) == int:\n print((\"\".join(map(str, ls))))\n else:\n print(\"Output Error\")\n\n\ndef I():\n return int(eval(input()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef RI():\n return list(map(int, input().split()))\n\n\ndef CI(n):\n return [int(eval(input())) for _ in range(n)]\n\n\ndef LI(n):\n return [list(map(int, input().split())) for _ in range(n)]\n\n\ndef S():\n return eval(input())\n\n\ndef MS():\n return input().split()\n\n\ndef RS():\n return list(input().split())\n\n\ndef CS(n):\n return [eval(input()) for _ in range(n)]\n\n\ndef LS(n):\n return [list(input().split()) for _ in range(n)]\n\n\na = I()\nb = I()\nh = I()\nans = (a + b) * h // 2\nprint(ans)\n", "fast_code": "a, b, h = [int(eval(input())) for _ in range(3)]\nprint(((a + b) * h // 2))\n", "slow_time": 222419806, "fast_time": 20398064, "speedup": 10.904, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_7"} +{"pair_id": "python_5596", "problem_id": "p03039", "language": "python", "slow_code": "class combination:\n\n def __init__(self, n, mod):\n self.n = n\n self.fac = [1] * (n + 1)\n self.inv = [1] * (n + 1)\n for j in range(1, n + 1):\n self.fac[j] = self.fac[j - 1] * j % mod\n self.inv[n] = pow(self.fac[n], mod - 2, mod)\n for j in range(n - 1, -1, -1):\n self.inv[j] = self.inv[j + 1] * (j + 1) % mod\n\n def comb(self, n, r, mod):\n if r > n or n < 0 or r < 0:\n return 0\n return self.fac[n] * self.inv[n - r] * self.inv[r] % mod\n\n\nimport sys\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\nmod = 10**9 + 7\ninf = float(\"inf\")\nans = int(0)\nN, M, K = LI()\ncou = int(0)\n\nL = int(0)\n\n\nfor j in range(N):\n L += (N - j - 1) * (M**2) * (j + 1)\n L %= mod\nfor j in range(M):\n L += (M - j - 1) * (N**2) * (j + 1)\n L %= mod\n\n\nC = combination(N * M - 2, mod)\ncou = C.comb(N * M - 2, K - 2, mod) * L % mod\nprint(cou)\n", "fast_code": "MAX = 10**9 + 7\n\n\ndef mod_inv(i, mod):\n return pow(i, mod - 2, mod)\n\n\ndef combination(_N, _K):\n if _K > (_N / 2):\n _K = _N - _K\n up = 1\n low = 1\n for i in range(_K):\n up = up * (_N - i) % MAX\n low = low * (i + 1) % MAX\n ret = up * mod_inv(low, MAX) % MAX\n return ret\n\n\ndef solve():\n N, M, K = [int(_) for _ in input().split()]\n disSum = (\n M * N * ((M * (N + 1) * (N - 1)) % MAX + (N * (M + 1) * (M - 1)) % MAX)\n ) % MAX\n disSum *= mod_inv(6, MAX) % MAX\n ret = disSum * combination(M * N - 2, K - 2) % MAX\n print(ret)\n\n\nif __name__ == \"__main__\":\n solve()\n", "slow_time": 925506108, "fast_time": 132099004, "speedup": 7.0062, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_23"} +{"pair_id": "python_14693", "problem_id": "p02713", "language": "python", "slow_code": "import math\n\nK = int(eval(input()))\nans = 0\nfor i in range(1, K + 1):\n for j in range(1, K + 1):\n for k in range(1, K + 1):\n x = math.gcd(i, j)\n y = math.gcd(j, k)\n ans += math.gcd(x, y)\nprint(ans)\n", "fast_code": "from math import gcd\n\nk = int(eval(input()))\ndouble = [gcd(i, j) for i in range(1, k + 1) for j in range(1, k + 1)]\ntriple = [gcd(i, j) for i in range(1, k + 1) for j in double]\nprint((sum(triple)))\n", "slow_time": 40206630184, "fast_time": 5961110849, "speedup": 6.7448, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_14"} +{"pair_id": "python_6763", "problem_id": "p02360", "language": "python", "slow_code": "from itertools import accumulate\n\nim = [[0] * 1001 for i in range(1001)]\nfor x_1, y_1, x_2, y_2 in (\n list(map(int, input().split())) for _ in range(int(eval(input())))\n):\n im[x_1][y_1] += 1\n im[x_1][y_2] -= 1\n im[x_2][y_1] -= 1\n im[x_2][y_2] += 1\nprint(\n (max(list(map(max, list(map(accumulate, list(zip(*list(map(accumulate, im))))))))))\n)\n", "fast_code": "from itertools import accumulate\n\nN = int(eval(input()))\nxys = []\nm_x = 0\nm_y = 0\nfor i in range(N):\n xy = list(map(int, input().split()))\n xys += [xy]\n x_1, y_1, x_2, y_2 = xy\n m_x = max(x_2, m_x)\n m_y = max(y_2, m_y)\nim = [[0] * (m_x + 1) for i in range(m_y + 1)]\nfor xy in xys:\n x_1, y_1, x_2, y_2 = xy\n im[y_1][x_1] += 1\n im[y_1][x_2] -= 1\n im[y_2][x_1] -= 1\n im[y_2][x_2] += 1\nprint(\n (max(list(map(max, list(map(accumulate, list(zip(*list(map(accumulate, im))))))))))\n)\n", "slow_time": 21984568424, "fast_time": 61107603, "speedup": 359.7681, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_0"} +{"pair_id": "python_9232", "problem_id": "p02883", "language": "python", "slow_code": "import math\n\nN, K = list(map(int, input().split()))\nX = [\n (b, a * b)\n for a, b in zip(\n sorted(list(map(int, input().split()))),\n sorted(list(map(int, input().split())))[::-1],\n )\n]\nm, M, i = 0, 10**12, 1\nexec(\n \"i,M,m=((i+m)//2,i,m) if sum(math.ceil(max(0,c-i)/b)for b, c in X)<=K else((i+M)//2,M,i);\"\n * 50\n)\nprint(M)\n", "fast_code": "import numpy as np\nimport sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nN, K = list(map(int, input().split()))\nA = np.array(list(map(int, input().split())), dtype=np.int64)\nF = np.array(list(map(int, input().split())), dtype=np.int64)\nA.sort()\nF.sort()\nF = F[::-1]\nl = 0\nr = 10**12 + 100\n\n\ndef solve(num):\n B = num // F\n tmp = np.sum(np.maximum(0, A - B))\n if tmp <= K:\n return 1\n else:\n return 0\n\n\nwhile r - l > 1:\n mid = (l + r) // 2\n if solve(mid):\n r = mid\n else:\n l = mid\nif solve(l):\n print(l)\nelse:\n print(r)\n", "slow_time": 822717967, "fast_time": 137978922, "speedup": 5.9626, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_23"} +{"pair_id": "python_6177", "problem_id": "p00033", "language": "python", "slow_code": "import sys\nfrom itertools import compress\n\n\ndef is_right_order(B, C):\n max_val = 0\n for b in B:\n if b < max_val:\n return False\n max_val = b\n max_val = 0\n for c in C:\n if c < max_val:\n return False\n max_val = c\n return True\n\n\ndef solve_bf(d):\n \"\"\"\"\"\"\n for i in range(1024):\n bin_i = \"{0:010b}\".format(i)\n bin_i = [int(x) for x in bin_i]\n comp = compress(d, bin_i)\n B = list(comp)\n C = d[:]\n for b in B:\n C.remove(b)\n if is_right_order(B, C):\n return True\n return False\n\n\nif __name__ == \"__main__\":\n\n num = int(eval(input()))\n data = []\n for _ in range(num):\n data.append(list(map(int, input().split(\" \"))))\n\n for d in data:\n result = solve_bf(d)\n\n if result:\n print(\"YES\")\n else:\n print(\"NO\")\n", "fast_code": "def f(x):\n a, b = 0, 0\n for e in x:\n if e > a:\n a = e\n elif e > b:\n b = e\n else:\n return 0\n return 1\n\n\nn = eval(input())\nfor i in range(n):\n D = list(map(int, input().split()))\n s = [\"NO\", \"YES\"][f(D)]\n print(s)\n", "slow_time": 1982323392, "fast_time": 32363896, "speedup": 61.2511, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_11"} +{"pair_id": "python_8896", "problem_id": "p03371", "language": "python", "slow_code": "a, b, c, x, y = list(map(int, input().split()))\nans = float(\"inf\")\nfor i in range(10**5 + 1):\n price = i * 2 * c\n if x > i:\n price += a * (x - i)\n if y > i:\n price += b * (y - i)\n ans = min(ans, price)\nprint(ans)\n", "fast_code": "a, b, c, x, y = list(map(int, input().split()))\nans = float(\"inf\")\nfor k in range(2 * max(x, y) + 1):\n cost = c * k\n need_x = max(0, x - k // 2)\n need_y = max(0, y - k // 2)\n cost += a * need_x + b * need_y\n ans = min(ans, cost)\nprint(ans)\n", "slow_time": 16833960988, "fast_time": 2841928762, "speedup": 5.9234, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_27"} +{"pair_id": "python_8473", "problem_id": "p03448", "language": "python", "slow_code": "A = int(eval(input()))\nB = int(eval(input()))\nC = int(eval(input()))\nX = int(eval(input()))\nans = []\nfor i in range(A + 1):\n for j in range(B + 1):\n for k in range(C + 1):\n ans.append(500 * i + 100 * j + 50 * k)\nprint((ans.count(X)))\n", "fast_code": "import sys\n\n\ndef main():\n a, b, c, x = (int(i) for i in sys.stdin.read().split())\n combination = 0\n for i in range(a + 1):\n ta = 500 * i\n if ta == x:\n combination += 1\n continue\n elif ta > x:\n continue\n for j in range(b + 1):\n tb = 100 * j\n if ta + tb == x:\n combination += 1\n continue\n elif ta + tb > x:\n continue\n for k in range(c + 1):\n total = ta + tb + 50 * k\n if total == x:\n combination += 1\n print(combination)\n\n\nif __name__ == \"__main__\":\n\n main()\n", "slow_time": 6806783484, "fast_time": 1399517230, "speedup": 4.8637, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_28"} +{"pair_id": "python_17081", "problem_id": "p02925", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\n\n\ndef read_int():\n return int(input())\n\n\ndef read_int_n():\n return list(map(int, input().split()))\n\n\ndef read_float():\n return float(input())\n\n\ndef read_float_n():\n return list(map(float, input().split()))\n\n\ndef read_str():\n return input().strip()\n\n\ndef read_str_n():\n return list(map(str, input().split()))\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n error_print(e - s, \"sec\")\n return ret\n\n return wrap\n\n\n@mt\ndef slv(N, A):\n ans = 0\n A = [list(reversed(a)) for a in A]\n s1 = set()\n s2 = set()\n\n def update(i):\n if not A[i - 1]:\n return\n d = A[i - 1][-1]\n n = (min(i, d), max(i, d))\n if n not in s1:\n s1.add(n)\n else:\n s2.add(n)\n s1.remove(n)\n\n for i in range(1, N + 1):\n update(i)\n while s2:\n ans += 1\n for k in tuple(s2):\n a, b = k\n A[a - 1].pop()\n A[b - 1].pop()\n update(a)\n update(b)\n s2.remove(k)\n for a in A:\n if a:\n return -1\n return ans\n\n\ndef main():\n N = read_int()\n A = [read_int_n() for _ in range(N)]\n print(slv(N, A))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "n = int(eval(input()))\nl = [list(map(int, input().split())) for i in [0] * n]\na = [0 for i in [0] * n]\nd = 1\nk = n * (n - 1)\nwhile sum(a) < k and 0 < d < 9999:\n L = []\n y = 0\n d += 1\n for i in range(n):\n if a[i] < n - 1:\n x = l[i][a[i]] - 1\n if not (l[x][a[x]] - 1 != i or x in L or i in L):\n a[i] += 1\n a[x] += 1\n L += [i, x]\n y = 1\n d *= y\nprint(([k // 2, d - 1][d < 9999]))\n", "slow_time": 134078523, "fast_time": 52907505, "speedup": 2.5342, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_26"} +{"pair_id": "python_3337", "problem_id": "p03695", "language": "python", "slow_code": "n = int(eval(input()))\nl = list(map(int, input().split()))\nd = {}\nfor i in range(n):\n if 1 <= l[i] <= 399:\n a = 0\n elif 400 <= l[i] <= 799:\n a = 1\n elif 800 <= l[i] <= 1199:\n a = 2\n elif 1200 <= l[i] <= 1599:\n a = 3\n elif 1600 <= l[i] <= 1999:\n a = 4\n elif 2000 <= l[i] <= 2399:\n a = 5\n elif 2400 <= l[i] <= 2799:\n a = 6\n elif 2800 <= l[i] <= 3199:\n a = 7\n else:\n a = 8\n if a in d:\n d[a] += 1\n else:\n d[a] = 1\nif not (8 in d):\n print((len(list(d.keys())), len(list(d.keys()))))\nelse:\n if len(list(d.keys())) == 1:\n print((len(list(d.keys())), len(list(d.keys())) - 1 + d[8]))\n else:\n print((len(list(d.keys())) - 1, len(list(d.keys())) - 1 + d[8]))\n", "fast_code": "al = [0] * 13\neval(input())\nfor i in input().split():\n al[int(i) // 400] += 1\ntuyoi = sum(al[8:])\niru = sum([1 for a in al[:8] if a > 0])\nprint((max(1, iru), iru + tuyoi))\n", "slow_time": 84169651, "fast_time": 30048970, "speedup": 2.8011, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_6"} +{"pair_id": "python_13355", "problem_id": "p03636", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\nsys.setrecursionlimit(10**7)\ni_i = lambda: int(i_s())\ni_l = lambda: list(map(int, stdin.readline().split()))\ni_s = lambda: stdin.readline().rstrip()\ns = i_s()\nprint((s[0] + str(len(s) - 2) + s[-1]))\n", "fast_code": "a, *b, c = input()\nprint(a, len(b), c, sep=\"\")\n", "slow_time": 27620713, "fast_time": 9042859, "speedup": 3.0544, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_15"} +{"pair_id": "python_7361", "problem_id": "p03044", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\ndef ii():\n return int(eval(input()))\n\n\ndef mi():\n return list(map(int, input().rstrip().split()))\n\n\ndef lmi():\n return list(map(int, input().rstrip().split()))\n\n\ndef li():\n return list(input().rstrip())\n\n\nfrom queue import Queue\n\n\ndef bfs(field, sy, sx, wall, dir):\n h = len(field)\n w = len(field[0])\n dp = [[-1 for _j in range(w)] for _i in range(h)]\n q = Queue()\n dp[sy][sx] = 0\n q.put((sy, sx))\n dy = [1, -1, 0, 0, 1, 1, -1, -1]\n dx = [0, 0, 1, -1, 1, -1, 1, -1]\n\n def isin(x, y):\n return 0 <= y and y < h and 0 <= x and x < w\n\n while not q.empty():\n y, x = q.get()\n for k in range(dir):\n ny, nx = y + dy[k], x + dx[k]\n if not isin(nx, ny) or field[ny][nx] == wall:\n continue\n elif dp[ny][nx] != -1:\n continue\n dp[ny][nx] = dp[y][x] + 1\n q.put((ny, nx))\n return dp\n\n\ndef ABC088_D():\n h, w = mi()\n s = [[\"\" for _j in range(w)] for _i in range(h)]\n for i in range(h):\n s[i] = li()\n dp = bfs(s, 0, 0, \"#\", 4)\n if dp[h - 1][w - 1] < 0:\n print((-1))\n else:\n cnt = 0\n for i in range(h):\n for j in range(w):\n cnt += s[i][j] == \".\"\n print((cnt - (dp[h - 1][w - 1] + 1)))\n\n\ndef ATC002_A():\n R, C = mi()\n sy, sx = mi()\n gy, gx = mi()\n s = [[\"\" for _j in range(C)] for _i in range(R)]\n for i in range(R):\n s[i] = li()\n dp = bfs(s, sy - 1, sx - 1, \"#\", 4)\n print((dp[gy - 1][gx - 1]))\n\n\ndef ABC126_D():\n N = ii()\n G = [[] for i in range(N)]\n for i in range(N - 1):\n a, b, w = mi()\n a -= 1\n b -= 1\n G[a].append((b, w))\n G[b].append((a, w))\n is_bipartite = True\n dist = [-1 for _ in range(N)]\n que = Queue()\n for v in range(N):\n if dist[v] != -1:\n\n continue\n dist[v] = 0\n que.put(v)\n while not que.empty():\n v = que.get()\n for nv, nw in G[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + nw\n que.put(nv)\n for i in dist:\n if i % 2 == 0:\n print((0))\n else:\n print((1))\n\n\nif __name__ == \"__main__\":\n\n ABC126_D()\n", "fast_code": "from collections import defaultdict\n\nN = int(eval(input()))\nE = defaultdict(list)\nfor _ in range(N - 1):\n u, v, w = list(map(int, input().split()))\n u -= 1\n v -= 1\n E[u].append((v, w))\n E[v].append((u, w))\nans = [-1] * N\nstack = [0]\nans[0] = 0\nwhile stack:\n node = stack.pop()\n for to, w in E[node]:\n if ans[to] != -1:\n continue\n ans[to] = ans[node] ^ (w & 1)\n stack.append(to)\nfor c in ans:\n print(c)\n", "slow_time": 204160464, "fast_time": 42326044, "speedup": 4.8235, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_8"} +{"pair_id": "python_2319", "problem_id": "p02700", "language": "python", "slow_code": "from math import floor, ceil, sqrt, factorial, log\nfrom collections import Counter, deque\nfrom functools import reduce\n\n\ndef S():\n return eval(input())\n\n\ndef I():\n return int(eval(input()))\n\n\ndef MS():\n return list(map(str, input().split()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef FLI():\n return [int(i) for i in input().split()]\n\n\ndef LS():\n return list(MS())\n\n\ndef LI():\n return list(MI())\n\n\ndef LLS():\n return [list(map(str, l.split())) for l in eval(input())]\n\n\ndef LLI():\n return [list(map(int, l.split())) for l in eval(input())]\n\n\ndef LLSN(n: int):\n return [LS() for _ in range(n)]\n\n\ndef LLIN(n: int):\n return [LI() for _ in range(n)]\n\n\nA, B, C, D = MI()\nx = -(-A // D)\ny = -(-C // B)\nif x >= y:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "A, B, C, D = list(map(int, input().split()))\nk1 = 0\nk2 = 0\nif C % B == 0:\n k1 = C // B\nelse:\n k1 = C // B + 1\nif A % D == 0:\n k2 = A // D\nelse:\n k2 = A // D + 1\nif k1 <= k2:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 100220167, "fast_time": 24850227, "speedup": 4.033, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_25"} +{"pair_id": "python_14580", "problem_id": "p03603", "language": "python", "slow_code": "N = int(input())\nP = list(map(int, input().split()))\nX = [0] + list(map(int, input().split()))\nko = [[] for _ in range(N + 1)]\nfor i, p in enumerate(P, 2):\n ko[p].append(i)\n\n\ndef f(p):\n n = len(ko[p])\n if n == 0:\n return X[p], 0\n dp = [[float(\"inf\")] * 5001 for _ in range(n + 1)]\n dp[0][0] = 0\n for i, c in enumerate(ko[p], 1):\n a, b = f(c)\n for j in range(a, 5001):\n dp[i][j] = min(dp[i][j], dp[i - 1][j - a] + b)\n for j in range(b, 5001):\n dp[i][j] = min(dp[i][j], dp[i - 1][j - b] + a)\n out = min(dp[-1][: X[p] + 1])\n if out == float(\"inf\"):\n print(\"IMPOSSIBLE\")\n exit()\n elif out > X[p]:\n return out, X[p]\n else:\n return X[p], out\n\n\nprint(\"POSSIBLE\") if min(f(1)) <= X[1] else print(\"IMPOSSIBLE\")\n", "fast_code": "N = int(eval(input()))\nP_list = list(map(int, input().split()))\nX_list = list(map(int, input().split()))\n\nchild_list = [[] for _ in range(N + 1)]\nfor i in range(2, N + 1):\n child_list[P_list[i - 2]].append(i)\n\n\ncolor1 = [0] + X_list\ncolor2 = [0] * (N + 1)\n\n\ndef solve_knapsack(L, M):\n min_acc = sum([min(color1[j], color2[j]) for j in L])\n if min_acc > M:\n return -1\n else:\n add_can = M - min_acc\n add_set = set([0])\n for j in L:\n add_j = max(color1[j], color2[j]) - min(color1[j], color2[j])\n add_set_ = set(add_set)\n for s in add_set:\n if s + add_j <= add_can:\n add_set_.add(s + add_j)\n add_set = add_set_\n total = sum([color1[j] + color2[j] for j in L])\n return total - max(add_set) - min_acc\n\n\nres = \"POSSIBLE\"\nfor i in range(N, 0, -1):\n if len(child_list[i]) == 0:\n pass\n elif len(child_list[i]) == 1:\n j = child_list[i][0]\n if min(color1[j], color2[j]) > X_list[i - 1]:\n res = \"IMPOSSIBLE\"\n break\n elif max(color1[j], color2[j]) > X_list[i - 1]:\n color2[i] = max(color1[j], color2[j])\n else:\n color2[i] = min(color1[j], color2[j])\n else:\n c2 = solve_knapsack(child_list[i], X_list[i - 1])\n if c2 < 0:\n res = \"IMPOSSIBLE\"\n break\n else:\n color2[i] = c2\nprint(res)\n", "slow_time": 908704243, "fast_time": 121685056, "speedup": 7.4677, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_1"} +{"pair_id": "python_17387", "problem_id": "p02681", "language": "python", "slow_code": "import sys\n\ninput = lambda: sys.stdin.readline().rstrip()\naint = lambda: int(input())\nints = lambda: list(map(int, input().split()))\nimport math\n\nfloor, ceil = lambda x: int(math.floor(x)), lambda x: int(math.ceil(x))\nfrom functools import reduce\n\ngcd = lambda *x: reduce(math.gcd, x)\nlcm = lambda *x: reduce(lambda x, y: (x * y) // gcd(x, y), x, 1)\nfrom collections import deque\n\nYes = lambda b: print(\"Yes\" if b else \"No\")\nYES = lambda b: print(\"YES\" if b else \"NO\")\nis_even = lambda x: True if x % 2 == 0 else False\n\n\ndef main():\n s = input()\n t = input()\n n = len(s)\n flg = 0\n for i in range(n):\n if s[i] != t[i]:\n flg = 1\n Yes(flg == 0)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "s = input()\nt = input()\nprint(\"Yes\") if t == s + t[-1] else print(\"No\")\n", "slow_time": 81544344, "fast_time": 10284365, "speedup": 7.929, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_16"} +{"pair_id": "python_7326", "problem_id": "p02881", "language": "python", "slow_code": "n = int(eval(input()))\ni = 1\nans = n\nwhile i * i <= n:\n j, m = divmod(n, i)\n if m == 0:\n ans = min(ans, i + j - 2)\n i += 1\nprint(ans)\n", "fast_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n res = list(sys.stdin.readline())\n if res[-1] == \"\\n\":\n return res[:-1]\n return res\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef solve():\n n = I()\n ans = float(\"inf\")\n m = int(n**0.5) + 1\n for i in range(1, m + 1):\n if n % i == 0:\n j = n // i\n s = i + j - 2\n if s < ans:\n ans = s\n print(ans)\n return\n\n\nif __name__ == \"__main__\":\n solve()\n", "slow_time": 988042773, "fast_time": 254762187, "speedup": 3.8783, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_2"} +{"pair_id": "python_10402", "problem_id": "p03576", "language": "python", "slow_code": "import sys\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\nN, K = LI()\nXY = [LI() for _ in range(N)]\nX = []\nY = []\nfor x, y in XY:\n if not (x in X):\n X.append(x)\n if not (y in Y):\n Y.append(y)\nX.sort()\nY.sort()\ndic_XoYo = {}\ndic_XcYo = {}\ndic_XoYc = {}\ndic_XcYc = {}\nfor x1 in X:\n for y1 in Y:\n key = x1 * (10**10) + y1\n cnt_XoYo = 0\n cnt_XcYo = 0\n cnt_XoYc = 0\n cnt_XcYc = 0\n for x2, y2 in XY:\n if x2 <= x1 and y2 <= y1:\n cnt_XcYc += 1\n if x2 < x1 and y2 <= y1:\n cnt_XoYc += 1\n if x2 <= x1 and y2 < y1:\n cnt_XcYo += 1\n if x2 < x1 and y2 < y1:\n cnt_XoYo += 1\n dic_XcYc[key] = cnt_XcYc\n dic_XoYc[key] = cnt_XoYc\n dic_XcYo[key] = cnt_XcYo\n dic_XoYo[key] = cnt_XoYo\nans = []\nfor xl in range(len(X) - 1):\n for xr in range(xl, len(X)):\n for yd in range(len(Y) - 1):\n for yu in range(yd, len(Y)):\n cnt = dic_XcYc[X[xr] * (10**10) + Y[yu]]\n cnt -= dic_XcYo[X[xr] * (10**10) + Y[yd]]\n cnt -= dic_XoYc[X[xl] * (10**10) + Y[yu]]\n cnt += dic_XoYo[X[xl] * (10**10) + Y[yd]]\n if cnt >= K:\n ans.append((X[xr] - X[xl]) * (Y[yu] - Y[yd]))\nprint((min(ans)))\n", "fast_code": "n, k = list(map(int, input().split()))\nz = [list(map(int, input().split())) for _ in range(n)]\nz.sort()\na = 10**20\nfor i in range(n):\n for j in range(i + 1, n):\n x = z[j][0] - z[i][0]\n l = sorted(t[1] for t in z[i : j + 1])\n for u, v in zip(l, l[k - 1 :]):\n a = min(a, x * (v - u))\nprint(a)\n", "slow_time": 176200141, "fast_time": 50545175, "speedup": 3.486, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_29"} +{"pair_id": "python_10488", "problem_id": "p03786", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\nsys.setrecursionlimit(10**5)\n\n\ndef li():\n return list(map(int, stdin.readline().split()))\n\n\ndef li_():\n return [int(x) - 1 for x in stdin.readline().split()]\n\n\ndef lf():\n return list(map(float, stdin.readline().split()))\n\n\ndef ls():\n return stdin.readline().split()\n\n\ndef ns():\n return stdin.readline().rstrip()\n\n\ndef lc():\n return list(ns())\n\n\ndef ni():\n return int(stdin.readline())\n\n\ndef nf():\n return float(stdin.readline())\n\n\nfrom itertools import accumulate\n\nn = ni()\na = list(li())\na.sort()\nacc = list(accumulate(a))\nans = 0\nfor ai, acci in zip(a[-1:0:-1], acc[-2::-1]):\n if 2 * acci >= ai:\n ans += 1\n else:\n break\nprint((ans + 1))\n", "fast_code": "import sys\n\nreadline = sys.stdin.readline\nN = int(readline())\nA = list(map(int, readline().split()))\nA = sorted(A)\ncur = 0\nng = 0\nfor i in range(N):\n if A[i] > cur * 2:\n ng = i\n cur += A[i]\nprint((N - ng))\n", "slow_time": 65326840, "fast_time": 22355211, "speedup": 2.9222, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_2"} +{"pair_id": "python_2213", "problem_id": "p02585", "language": "python", "slow_code": "import sys\n\nreadline = sys.stdin.readline\nreadall = sys.stdin.read\nns = lambda: readline().rstrip()\nni = lambda: int(readline().rstrip())\nnm = lambda: map(int, readline().split())\nnl = lambda: list(map(int, readline().split()))\nprn = lambda x: print(*x, sep=\"\\n\")\n\n\ndef solve():\n n, k = nm()\n p = nl()\n _c = nl()\n c = [0] * n\n for i in range(n):\n p[i] -= 1\n c[i] = _c[p[i]]\n m = 31\n MIN = -(1 << 63)\n vertex = list()\n score = list()\n vertex.append(p)\n score.append(c)\n for a in range(1, m + 1):\n p_ath = [0] * n\n c_ath = [0] * n\n for i in range(n):\n p_ath[i] = vertex[a - 1][vertex[a - 1][i]]\n c_ath[i] = score[a - 1][i] + score[a - 1][vertex[a - 1][i]]\n vertex.append(p_ath)\n score.append(c_ath)\n prv = [[MIN, 0] for _ in range(n)]\n nxt = [[MIN, MIN] for _ in range(n)]\n for b in range(m, -1, -1):\n for i in range(n):\n if (k >> b) & 1:\n nxt[vertex[b][i]][0] = max(\n nxt[vertex[b][i]][0], prv[i][0] + score[b][i]\n )\n nxt[vertex[b][i]][1] = max(\n nxt[vertex[b][i]][1], prv[i][1] + score[b][i]\n )\n nxt[i][0] = max(nxt[i][0], prv[i][0], prv[i][1])\n else:\n nxt[vertex[b][i]][0] = max(\n nxt[vertex[b][i]][0], prv[i][0] + score[b][i]\n )\n nxt[i][0] = max(nxt[i][0], prv[i][0])\n nxt[i][1] = max(nxt[i][1], prv[i][1])\n prv, nxt = nxt, prv\n ans = max(max(x) for x in prv)\n if ans == 0:\n ans = max(c)\n print(ans)\n return\n\n\nsolve()\n", "fast_code": "N, K = list(map(int, input().split()))\np = list(map(int, input().split()))\nc = list(map(int, input().split()))\nans = -1 * 10**9\nfor si in range(N):\n s = list()\n total = 0\n l = 0\n x = si\n while 1:\n x = p[x] - 1\n s.append(c[x])\n total += c[x]\n l += 1\n if x == si:\n break\n t = 0\n for j in range(l):\n t += s[j]\n now = t\n if j >= K:\n break\n if total > 0:\n e = (K - j - 1) // l\n now += total * e\n ans = max(ans, now)\nprint(ans)\n", "slow_time": 231578340, "fast_time": 67618354, "speedup": 3.4248, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_18"} +{"pair_id": "python_6753", "problem_id": "p00729", "language": "python", "slow_code": "while 1:\n N, M = list(map(int, input().split()))\n if N == 0:\n break\n T = [[0] * 1261 for i in range(N)]\n r = eval(input())\n tnms = sorted(\n [list(map(int, input().split())) for i in range(r)], key=lambda x: x[1]\n )\n for i in range(0, r, 2):\n t1, n, m, s = tnms[i]\n t2, n, m, s = tnms[i + 1]\n T[n - 1][t1:t2] = [m for j in range(t1, t2)]\n for i in range(eval(input())):\n ts, te, m = list(map(int, input().split()))\n print(\n sum(1 if any(T[n][t] == m for n in range(N)) else 0 for t in range(ts, te))\n )\n", "fast_code": "while 1:\n N, M = list(map(int, input().split()))\n if N == 0:\n break\n T = [[0] * 1261 for i in range(M)]\n r = eval(input())\n tnms = sorted(\n [list(map(int, input().split())) for i in range(r)], key=lambda x: x[1]\n )\n for i in range(0, r, 2):\n t1, n, m, s = tnms[i]\n t2, n, m, s = tnms[i + 1]\n T[m - 1][t1:t2] = [1 for j in range(t1, t2)]\n for i in range(eval(input())):\n ts, te, m = list(map(int, input().split()))\n print(sum(T[m - 1][ts:te]))\n", "slow_time": 692034169, "fast_time": 125684716, "speedup": 5.5061, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_2"} +{"pair_id": "python_14153", "problem_id": "p03064", "language": "python", "slow_code": "M, s = 998244353, 0\nd = [1] + [0] * 7**6\ne = d[:]\nn = eval(input())\nfor _ in \"_\" * n:\n a = eval(input())\n s += a\n i = s\n while ~i:\n d[i] += d[i] + d[i - a] % M\n e[i] += e[i - a] % M\n i -= 1\nprint((3**n + ~s % 2 * e[s // 2] * 3 - 3 * sum(d[-~s // 2 :])) % M)\n", "fast_code": "import sys\nimport numpy as np\n\nn = int(eval(input()))\naaa = list(map(int, sys.stdin))\nMOD = 998244353\ns = sum(aaa)\ndp1 = np.zeros(s + 1, dtype=np.int64)\ndp2 = np.zeros(s + 1, dtype=np.int64)\ndp1[0] = 1\ndp2[0] = 1\nfor a in aaa:\n dp1 = (dp1 * 2 + np.roll(dp1, a)) % MOD\n dp2 = (dp2 + np.roll(dp2, a)) % MOD\nh = (s + 1) // 2\nans = (pow(3, n, MOD) - dp1[h:].sum() * 3) % MOD\nif s % 2 == 0:\n ans = (ans + dp2[h] * 3) % MOD\nprint(ans)\n", "slow_time": 418908517, "fast_time": 87236959, "speedup": 4.802, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_2"} +{"pair_id": "python_9421", "problem_id": "p02675", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nimport bisect\n\nINF = 10**13\nMOD = 10**9 + 7\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef gcd(x, y):\n return x if y == 0 else gcd(y, x % y)\n\n\ndef lcm(x, y):\n return (x * y) // gcd(x, y)\n\n\ndef I():\n return int(input())\n\n\ndef LI():\n return [int(x) for x in input().split()]\n\n\ndef RI(N):\n return [int(input()) for _ in range(N)]\n\n\ndef LRI(N):\n return [[int(x) for x in input().split()] for _ in range(N)]\n\n\ndef LS():\n return input().split()\n\n\ndef RS(N):\n return [input() for _ in range(N)]\n\n\ndef LRS(N):\n return [input().split() for _ in range(N)]\n\n\ndef PL(L):\n print(*L, sep=\"\\n\")\n\n\ndef YesNo(B):\n print(\"Yes\" if B else \"No\")\n\n\ndef YESNO(B):\n print(\"YES\" if B else \"NO\")\n\n\nN = input()\nn = int(N[-1])\nif n in [2, 4, 5, 7, 9]:\n print(\"hon\")\nelif n in [0, 1, 6, 8]:\n print(\"pon\")\nelse:\n print(\"bon\")\n", "fast_code": "n = int(eval(input()))\nn = n % 10\nif n in (2, 4, 5, 7, 9):\n yomi = \"hon\"\nif n in (0, 1, 6, 8):\n yomi = \"pon\"\nif n == 3:\n yomi = \"bon\"\nprint(yomi)\n", "slow_time": 116219356, "fast_time": 21493280, "speedup": 5.4072, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_12"} +{"pair_id": "python_14571", "problem_id": "p03647", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\nfrom_1 = [False] * N\nto_N = [False] * N\nfor _ in range(M):\n a, b = list(map(int, input().split()))\n if a == 1:\n from_1[b - 1] = True\n elif b == N:\n to_N[a - 1] = True\nfor i in range(1, N):\n if from_1[i] and to_N[i]:\n print(\"POSSIBLE\")\n break\nelse:\n print(\"IMPOSSIBLE\")\n", "fast_code": "import sys\n\n\ndef main():\n n, m = list(map(int, sys.stdin.readline().split()))\n set1, setn = set(), set()\n for _ in range(m):\n i, j = list(map(int, sys.stdin.readline().split()))\n if i == 1:\n set1.add(j)\n if j == n:\n setn.add(i)\n if set1 & setn:\n print(\"POSSIBLE\")\n else:\n print(\"IMPOSSIBLE\")\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 1854976633, "fast_time": 37534056, "speedup": 49.4212, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_3"} +{"pair_id": "python_16001", "problem_id": "p03599", "language": "python", "slow_code": "a, b, c, d, e, f = list(map(int, input().split()))\nwater = []\nfor i in range(31):\n for j in range(31):\n if (a * i + b * j) * 100 <= f:\n water.append(a * i + b * j)\nwater = list(set(water))\nresult = [[0, a * 100, 0]]\nfor i in water:\n for x in range(301):\n for y in range(301):\n if (\n i > 0\n and c * x + d * y > 0\n and c * x + d * y <= i * e\n and (c * x + d * y + 100 * i) <= f\n ):\n result.append(\n [\n 100 * (c * x + d * y) / (c * x + d * y + 100 * i),\n c * x + d * y + 100 * i,\n c * x + d * y,\n ]\n )\nresult.sort(reverse=True)\nprint((result[0][1], result[0][2]))\n", "fast_code": "A, B, C, D, E, F = list(map(int, input().split()))\nw = set()\nfor i in range(F // (100 * A) + 1):\n t = F - 100 * i\n for j in range(t // (100 * B) + 1):\n a = (A * i + B * j) * 100\n w.add(a)\nw.remove(0)\ns = set()\nt = E * F // 100\nfor i in range(t // C + 1):\n for j in range(t // D + 1):\n b = C * i + D * j\n if b < t:\n s.add(b)\nbest_concentration = -1\nbest_a = -1\nbest_b = -1\nfor a in w:\n for b in sorted(s):\n if a + b > F:\n break\n if b > E * a // 100:\n break\n concentration = 100 * b / (a + b)\n if concentration > best_concentration:\n best_concentration = concentration\n best_a = a\n best_b = b\nprint((best_a + best_b, best_b))\n", "slow_time": 31665142718, "fast_time": 932624651, "speedup": 33.9527, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_10"} +{"pair_id": "python_13800", "problem_id": "p02385", "language": "python", "slow_code": "class Dice:\n def __init__(self):\n\n self.t = 1\n self.s = 2\n self.e = 3\n self.w = 4\n self.n = 5\n self.b = 6\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def __init__(self, t, s, e, w, n, b):\n\n self.t = t\n self.s = s\n self.e = e\n self.w = w\n self.n = n\n self.b = b\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def rot(self, way):\n if way == 0:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.n,\n self.t,\n self.e,\n self.w,\n self.b,\n self.s,\n )\n elif way == 1:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.s,\n self.b,\n self.e,\n self.w,\n self.t,\n self.n,\n )\n elif way == 2:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.w,\n self.s,\n self.t,\n self.b,\n self.n,\n self.e,\n )\n elif way == 3:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.e,\n self.s,\n self.b,\n self.t,\n self.n,\n self.w,\n )\n\n\ndef main():\n import random\n\n t1, s1, e1, w1, n1, b1 = list(map(int, input().split()))\n t2, s2, e2, w2, n2, b2 = list(map(int, input().split()))\n dice1 = Dice(t1, s1, e1, w1, n1, b1)\n dice2 = Dice(t2, s2, e2, w2, n2, b2)\n flag = 0\n for _ in range(10000):\n if (dice1.t, dice1.s, dice1.e, dice1.w, dice1.n, dice1.b) == (\n dice2.t,\n dice2.s,\n dice2.e,\n dice2.w,\n dice2.n,\n dice2.b,\n ):\n flag = 1\n break\n else:\n seed = random.randint(0, 3)\n dice2.rot(seed)\n if flag == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import itertools\n\n\ndef roll(dice, commands):\n for command in commands:\n if command == \"N\":\n dice[0], dice[1], dice[5], dice[4] = dice[1], dice[5], dice[4], dice[0]\n elif command == \"W\":\n dice[0], dice[3], dice[5], dice[2] = dice[2], dice[0], dice[3], dice[5]\n\n\ndef solve():\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n for i in range(4):\n for j in range(4):\n for commands in itertools.permutations(\"N\" * i + \"W\" * j):\n a = A[::]\n roll(a, commands)\n if B == a:\n return True\n return False\n\n\nif __name__ == \"__main__\":\n print((\"Yes\" if solve() else \"No\"))\n", "slow_time": 3599802039, "fast_time": 474595466, "speedup": 7.585, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_15"} +{"pair_id": "python_6708", "problem_id": "p00070", "language": "python", "slow_code": "import sys\n\nK = 1024\nN = 331\nR = list(range(K))\nB = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]\nC = [0] * K\nD = [[0 for i in range(N)] for j in R]\n\n\ndef init():\n global C, D\n for i in R:\n s = format(i, \"b\")\n n = s.count(\"1\")\n C[i] = n\n if n == 1:\n D[i][B.index(i)] = 1\n else:\n for j in range(len(s)):\n if s[-j - 1] == \"1\":\n dp = n * j\n i2 = i - B[j]\n for k in range(N - dp):\n D[i][k + dp] += D[i2][k]\n return\n\n\ninit()\nfor a in sys.stdin:\n n, s = list(map(int, a.split()))\n x = 0\n if s < N:\n x = sum([D[i][s] for i in R if C[i] == n])\n print(x)\n", "fast_code": "import sys\n\n\ndef f0070(A, n, s):\n if n == 1:\n return s in A\n A = sorted(A)\n A1 = A[:n][::-1]\n A2 = A[-n:]\n N = list(range(n))\n b1 = 0\n b2 = 0\n c = 0\n for i in N:\n b1 += (i + 1) * A1[i]\n b2 += (i + 1) * A2[i]\n if b1 <= s <= b2:\n for i in range(len(A)):\n b = s - A[i] * n\n c += f0070(A[:i] + A[i + 1 :], n - 1, b)\n return c\n\n\nfor a in sys.stdin:\n n, s = list(map(int, a.split()))\n print(f0070(list(range(10)), n, s))\n", "slow_time": 56673214149, "fast_time": 82206812, "speedup": 689.398, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_5"} +{"pair_id": "python_8585", "problem_id": "p03634", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\n\n\ndef dfs(N, nodes, src):\n \"\"\"\"\"\"\n stack = [(src, -1, 0)]\n dist = [INF] * N\n while stack:\n u, prev, c1 = stack.pop()\n dist[u] = c1\n for v, c2 in nodes[u]:\n if v != prev:\n stack.append((v, u, c1 + c2))\n return dist\n\n\nN = INT()\nnodes = [[] for i in range(N)]\nfor i in range(N - 1):\n a, b, c = MAP()\n a -= 1\n b -= 1\n nodes[a].append((b, c))\n nodes[b].append((a, c))\nQ, K = MAP()\nK -= 1\nres = dfs(N, nodes, K)\nfor i in range(Q):\n x, y = MAP()\n x -= 1\n y -= 1\n ans = res[x] + res[y]\n print(ans)\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\nN = int(input())\nT = [[] for _ in range(N + 1)]\nfor _ in range(N - 1):\n a, b, c = map(int, input().split())\n T[a].append([b, c])\n T[b].append([a, c])\nQ, K = map(int, input().split())\ndist = [None] * (N + 1)\n\n\ndef dfs(now, d):\n dist[now] = d\n for to, c in T[now]:\n if dist[to] is not None:\n continue\n dfs(to, d + c)\n\n\ndfs(K, 0)\nans = [0] * Q\nfor i in range(Q):\n u, v = map(int, input().split())\n ans[i] = dist[u] + dist[v]\nprint(*ans, sep=\"\\n\")\n", "slow_time": 169229965, "fast_time": 67621430, "speedup": 2.5026, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_15"} +{"pair_id": "python_2125", "problem_id": "p02989", "language": "python", "slow_code": "k = int(eval(input()))\nd = sorted(list(map(int, input().split())))\nans = 0\nfor i in range(d[int(len(d) / 2) - 1] + 1, d[int(len(d) / 2)] + 1):\n ans += 1\nprint(ans)\n", "fast_code": "n = int(eval(input()))\nd = [int(i) for i in input().split()]\nd.sort()\nk = d[n // 2] - d[(n // 2) - 1]\nprint(k)\n", "slow_time": 243709916, "fast_time": 21360487, "speedup": 11.4094, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_2"} +{"pair_id": "python_15152", "problem_id": "p03775", "language": "python", "slow_code": "import math\n\nN = int(eval(input()))\nans = float(\"Inf\")\nsq = int(math.sqrt(N)) + 1\nfor i in range(1, sq):\n if N % i == 0:\n a = len(str(i))\n b = len(str(N // i))\n if a > b:\n num = a\n else:\n num = b\n if ans > num:\n ans = num\nprint(ans)\n", "fast_code": "def PrimeDecomp(N, ConcFlag):\n if ConcFlag:\n if N <= 1:\n return [1], 1\n else:\n I = 2\n PrimeDec = []\n DivCount = 1\n while I * I <= N:\n Cnt = 0\n while N % I == 0:\n N //= I\n PrimeDec.append(I)\n if Cnt >= 1:\n DivCount *= Cnt + 1\n I += 1\n if N >= 2:\n PrimeDec.append(N)\n DivCount *= 2\n return PrimeDec, DivCount\n else:\n if N <= 1:\n return [1], [1], 1\n else:\n I = 2\n PrimeDec = []\n PrimeCnt = []\n DivCount = 1\n while I * I <= N:\n Cnt = 0\n while N % I == 0:\n N //= I\n Cnt += 1\n if Cnt >= 1:\n PrimeDec.append(I)\n PrimeCnt.append(Cnt)\n DivCount *= Cnt + 1\n I += 1\n if N >= 2:\n PrimeDec.append(N)\n PrimeCnt.append(1)\n DivCount *= 2\n return PrimeDec, PrimeCnt, DivCount\n\n\nfrom itertools import combinations\nfrom operator import mul\nfrom functools import reduce\n\nN = int(eval(input()))\nPrimeDec, _ = PrimeDecomp(N, True)\nFABMax = len(str(N))\nfor TR in range(1, len(PrimeDec) + 1):\n for A in set(reduce(mul, T) for T in combinations(PrimeDec, TR)):\n B = N // A\n FABMax = min(FABMax, max(len(str(A)), len(str(B))))\nprint(FABMax)\n", "slow_time": 1615323906, "fast_time": 233216425, "speedup": 6.9263, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_7"} +{"pair_id": "python_6650", "problem_id": "p03803", "language": "python", "slow_code": "import sys, math\nfrom functools import lru_cache\nfrom itertools import accumulate\n\nsys.setrecursionlimit(10**9)\nMOD = 10**9 + 7\n\n\ndef input():\n return sys.stdin.readline()[:-1]\n\n\ndef mi():\n return list(map(int, input().split()))\n\n\ndef ii():\n return int(eval(input()))\n\n\ndef i2(n):\n tmp = [list(mi()) for i in range(n)]\n return [list(i) for i in zip(*tmp)]\n\n\nA, B = mi()\nif A == B:\n print(\"Draw\")\nelif A == 1:\n print(\"Alice\")\nelif B == 1:\n print(\"Bob\")\nelse:\n if A > B:\n print(\"Alice\")\n else:\n print(\"Bob\")\n", "fast_code": "input_alice, input_bob = list(map(int, input().split()))\nresult = \"ret\"\nif input_alice > input_bob:\n if input_bob == 1:\n result = \"Bob\"\n else:\n result = \"Alice\"\nelif input_alice < input_bob:\n if input_alice == 1:\n result = \"Alice\"\n else:\n result = \"Bob\"\nelse:\n result = \"Draw\"\nprint(result)\n", "slow_time": 58300100, "fast_time": 25726087, "speedup": 2.2662, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_10"} +{"pair_id": "python_17017", "problem_id": "p03700", "language": "python", "slow_code": "import numpy as np\n\nn, a, b = list(map(int, input().split()))\nl = []\nfor i in range(n):\n l.append(eval(input()))\nll = np.array(l)\nll.sort()\nll = ll[::-1]\n\n\ndef solve(count):\n q = ll - b * count\n t = q > 0\n if a > b:\n p = (q - 1) / (a - b) + 1\n else:\n p = q\n p = p[p > 0]\n if p.sum() <= count:\n return True\n else:\n return False\n\n\nl = 1\nr = ll[0] / b + 1\nwhile r - l > 1:\n m = (l + r) / 2\n if solve(m):\n r = m\n else:\n l = m\nif r == 2:\n if solve(1):\n r = 1\nprint(r)\n", "fast_code": "import math\n\n\"\"\"\"\"\"\nN, A, B = list(map(int, input().split()))\narr = []\nfor i in range(N):\n arr.append(int(eval(input())))\nmax_ = max(arr) // B + 1\nmin_ = min(arr) // A\nd = A - B\nwhile min_ != max_:\n mid = (max_ + min_) // 2\n sum_ = 0\n for x in arr:\n sum_ += max(0, math.ceil((x - mid * B) / d))\n if sum_ <= mid:\n max_ = mid\n else:\n min_ = mid + 1\nprint(min_)\n", "slow_time": 147723285, "fast_time": 73256932, "speedup": 2.0165, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_23"} +{"pair_id": "python_13341", "problem_id": "p03860", "language": "python", "slow_code": "def main():\n a = [i for i in input().split()]\n print(a[0][0], a[1][0], a[2][0], sep=\"\")\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "_, s, _ = input().split()\nprint((\"A\" + s[0] + \"C\"))\n", "slow_time": 20970842, "fast_time": 7946837, "speedup": 2.6389, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_17"} +{"pair_id": "python_10368", "problem_id": "p02706", "language": "python", "slow_code": "int1 = lambda x: int(x) - 1\n\n\ndef II():\n return int(eval(input()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef MI1():\n return list(map(int1, input().split()))\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef LLI(rows_number):\n return [LI() for _ in range(rows_number)]\n\n\ndef solve():\n n, m = MI()\n A = LI()\n sm = sum(A)\n if n - sm >= 0:\n print((n - sm))\n else:\n print((-1))\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "N, M = list(map(int, input().split()))\nA = list(map(int, input().split()))\nB = sum(A)\nif B > N:\n ans = -1\nelse:\n ans = N - B\nprint(ans)\n", "slow_time": 45502445, "fast_time": 15424664, "speedup": 2.95, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_20"} +{"pair_id": "python_4032", "problem_id": "p02361", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nfrom enum import Enum\nfrom heapq import heappush, heappop\n\n\nclass Sssp(object):\n \"\"\"\"\"\"\n\n class Status(Enum):\n \"\"\"\"\"\"\n\n white = 1\n gray = 2\n black = 3\n\n def __init__(self, V, data):\n num_of_nodes = V\n self.color = [Sssp.Status.white] * num_of_nodes\n self.d = [float(\"inf\")] * num_of_nodes\n self.p = [-1] * num_of_nodes\n self.adj = [[] for _ in range(num_of_nodes)]\n self.make_adj(data)\n\n def make_adj(self, data):\n\n for f, t, c in data:\n self.adj[f].insert(0, (t, c))\n\n def dijkstra(self, start):\n self.d[start] = 0\n pq = []\n heappush(pq, (0, start))\n while pq:\n cost, u = heappop(pq)\n self.color[u] = Sssp.Status.black\n if self.d[u] < cost:\n continue\n for v, cost in self.adj[u]:\n if self.color[v] == Sssp.Status.black:\n continue\n if self.d[v] > self.d[u] + cost:\n self.d[v] = self.d[u] + cost\n heappush(pq, (self.d[v], v))\n self.color[v] = Sssp.Status.gray\n\n\ndef solve(V, r, data):\n WHITE = 0\n GRAY = 1\n BLACK = 2\n num_of_nodes = V\n color = [WHITE] * num_of_nodes\n d = [float(\"inf\")] * num_of_nodes\n adj = [[] for _ in range(num_of_nodes)]\n for f, t, c in data:\n adj[f].insert(0, (t, c))\n\n d[r] = 0\n pq = []\n heappush(pq, (0, r))\n while pq:\n cost, u = heappop(pq)\n color[u] = BLACK\n if d[u] < cost:\n continue\n for v, cost in adj[u]:\n if color[v] == BLACK:\n continue\n if d[v] > d[u] + cost:\n d[v] = d[u] + cost\n heappush(pq, (d[v], v))\n color[v] = GRAY\n\n for i in range(V):\n if d[i] == float(\"inf\"):\n print(\"INF\")\n else:\n print((\"{}\".format(d[i])))\n\n\nif __name__ == \"__main__\":\n\n V, E, r = [int(x) for x in input().split(\" \")]\n data = []\n for i in range(E):\n data.append(list(map(int, input().split(\" \"))))\n\n solve(V, r, data)\n", "fast_code": "import heapq\n\nnv, ne, r = map(int, input().split(\" \"))\nvertices = [[] for i in range(nv)]\nfor i in range(ne):\n s, t, w = map(int, input().split(\" \"))\n vertices[s].append((t, w))\nq = []\nheapq.heappush(q, (0, r))\ndist = [float(\"inf\")] * nv\ndist[r] = 0\nwhile len(q):\n u = heapq.heappop(q)[1]\n for t, w in vertices[u]:\n alt = dist[u] + w\n if alt < dist[t]:\n dist[t] = alt\n heapq.heappush(q, (alt, t))\n[print(d) if d < float(\"inf\") else print(\"INF\") for d in dist]\n", "slow_time": 206184223, "fast_time": 62487717, "speedup": 3.2996, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_7"} +{"pair_id": "python_251", "problem_id": "p02725", "language": "python", "slow_code": "from sys import stdin\n\ninp = stdin.readline\nn, k = [int(x) for x in inp().strip().split()]\narray = [int(x) for x in inp().strip().split()]\ndistance = [0] * (k * 2)\nfor i in range(k - 1):\n distance[i] = array[i + 1] - array[i]\ndistance[k - 1] = n - array[k - 1] + array[0]\ndistance[2 * k - 1] = n - array[k - 1] + array[0]\nfor i in range(k - 1):\n distance[k + i] = array[i + 1] - array[i]\nminimum = 999999999\ncount = 0\ntotal = 0\ncountLimit = k - 1\nfor i in range(k * 2):\n if count < countLimit:\n total += distance[i]\n count += 1\n else:\n if minimum > total:\n minimum = total\n total += distance[i]\n total -= distance[i - countLimit]\nprint(minimum)\n", "fast_code": "K, N = list(map(int, input().split()))\nA = list(map(int, input().split()))\nA += [A[0] + K]\nprint((K - max(A[i + 1] - A[i] for i in range(N))))\n", "slow_time": 65037207, "fast_time": 23248372, "speedup": 2.7975, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_0"} +{"pair_id": "python_7412", "problem_id": "p02912", "language": "python", "slow_code": "def bin_tree(pri, li_pri, len_li):\n\n lo = 0\n hi = len_li - 1\n while hi - lo > 1:\n mid = lo + (hi - lo) // 2\n guess = li_pri[mid]\n if guess >= pri:\n hi = mid\n else:\n lo = mid\n return lo\n\n\nI = input().split()\nN = int(I[0])\nM = int(I[1])\n\n\nA = list(map(int, input().split()))\nA.sort()\nwhile M > 0:\n M -= 1\n pri = A.pop(N - 1)\n pri = pri // 2\n if len(A) == 0:\n ans = 0\n elif pri < A[0]:\n ans = 0\n else:\n ans = bin_tree(pri, A, N - 1) + 1\n\n A[ans:ans] = [pri]\nF_pri = 0\nfor i in range(N):\n F_pri += A[i]\nprint(F_pri)\n", "fast_code": "def calc(N, M, A):\n if N == 1:\n return A[0] // (2**M)\n A.sort(key=lambda a: -a)\n B = [A]\n for _ in range(M):\n i = 0\n m = B[0][0] if B[0] else -1\n for j in range(1, len(B)):\n if B[j] and B[j][0] > m:\n i = j\n m = B[j][0]\n p = B[i].pop(0) // 2\n if len(B) == i + 1:\n B += [[]]\n B[i + 1] += [p]\n if not (B[0]):\n B.pop(0)\n return sum([sum(b) for b in B])\n\n\nN, M = tuple([int(s) for s in input().split(\" \")])\nA = [int(s) for s in input().split()]\nprint((calc(N, M, A)))\n", "slow_time": 529707210, "fast_time": 75792722, "speedup": 6.9889, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_12"} +{"pair_id": "python_13252", "problem_id": "p02699", "language": "python", "slow_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nmod = 10**9 + 7\ninf = float(\"inf\")\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ns, w = LI()\nif s <= w:\n print(\"unsafe\")\nelse:\n print(\"safe\")\n", "fast_code": "S, W = list(map(int, input().split()))\nif S <= W:\n print(\"unsafe\")\nelif S > W:\n print(\"safe\")\n", "slow_time": 41778893, "fast_time": 13471864, "speedup": 3.1012, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_11"} +{"pair_id": "python_5378", "problem_id": "p02417", "language": "python", "slow_code": "a = [0] * 26\nw = \"abcdefghijklmnopqrstuvwxyz\"\ntry:\n while True:\n s = list(input().upper())\n for i in s:\n if i == \"A\":\n a[0] += 1\n elif i == \"B\":\n a[1] += 1\n elif i == \"C\":\n a[2] += 1\n elif i == \"D\":\n a[3] += 1\n elif i == \"E\":\n a[4] += 1\n elif i == \"F\":\n a[5] += 1\n elif i == \"G\":\n a[6] += 1\n elif i == \"H\":\n a[7] += 1\n elif i == \"I\":\n a[8] += 1\n elif i == \"J\":\n a[9] += 1\n elif i == \"K\":\n a[10] += 1\n elif i == \"L\":\n a[11] += 1\n elif i == \"M\":\n a[12] += 1\n elif i == \"N\":\n a[13] += 1\n elif i == \"O\":\n a[14] += 1\n elif i == \"P\":\n a[15] += 1\n elif i == \"Q\":\n a[16] += 1\n elif i == \"R\":\n a[17] += 1\n elif i == \"S\":\n a[18] += 1\n elif i == \"T\":\n a[19] += 1\n elif i == \"U\":\n a[20] += 1\n elif i == \"V\":\n a[21] += 1\n elif i == \"W\":\n a[22] += 1\n elif i == \"X\":\n a[23] += 1\n elif i == \"Y\":\n a[24] += 1\n elif i == \"Z\":\n a[25] += 1\nexcept EOFError:\n pass\nfor i in range(26):\n print((w[i : i + 1], \":\", str(a[i])))\n", "fast_code": "import string\nimport sys\n\ninput_str = \"\"\nfor i in sys.stdin:\n input_str += i\nfor i in range(26):\n char = string.ascii_lowercase[i]\n CHAR = string.ascii_uppercase[i]\n cnt = input_str.count(char) + input_str.count(CHAR)\n print((\"{0} : {1}\".format(char, cnt)))\n", "slow_time": 119389800, "fast_time": 31464588, "speedup": 3.7944, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_14"} +{"pair_id": "python_16644", "problem_id": "p03147", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\ninput = sys.stdin.readline\nf_inf = float(\"inf\")\nmod = 10**9 + 7\n\n\ndef resolve():\n n = int(eval(input()))\n H = list(map(int, input().split()))\n res = 0\n i = 0\n while sum(H) != 0:\n if H[i] != 0:\n while i < n and H[i] != 0:\n H[i] -= 1\n i += 1\n res += 1\n i = 0\n else:\n i += 1\n print(res)\n\n\nif __name__ == \"__main__\":\n resolve()\n", "fast_code": "n = int(eval(input()))\nh = list(map(int, input().split()))\nans = h[0]\nfor i in range(1, n):\n if h[i] > h[i - 1]:\n ans += h[i] - h[i - 1]\nprint(ans)\n", "slow_time": 120629494, "fast_time": 24546115, "speedup": 4.9144, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_5"} +{"pair_id": "python_3705", "problem_id": "p02731", "language": "python", "slow_code": "import scipy.optimize\n\nL = int(eval(input()))\nfunc = lambda x: -1 * (x[0] * x[1] * (L - x[0] - x[1]))\nres = scipy.optimize.minimize(func, (0.1, 0.2), bounds=((0, None), (0, None)), tol=1e-6)\nprint((-1 * res.fun))\n", "fast_code": "L = int(eval(input()))\nprint((\"{:.12f}\".format(L**3 / 27)))\n", "slow_time": 38579398487, "fast_time": 10493176, "speedup": 3676.6179, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_18"} +{"pair_id": "python_9789", "problem_id": "p03806", "language": "python", "slow_code": "from itertools import permutations\nimport sys\n\nsys.setrecursionlimit(10**6)\nfrom bisect import *\nfrom collections import *\nfrom heapq import *\n\n\ndef II():\n return int(sys.stdin.readline())\n\n\ndef MI():\n return map(int, sys.stdin.readline().split())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef SI():\n return sys.stdin.readline()[:-1]\n\n\ndef LLI(rows_number):\n return [LI() for _ in range(rows_number)]\n\n\nint1 = lambda x: int(x) - 1\n\n\ndef MI1():\n return map(int1, sys.stdin.readline().split())\n\n\ndef LI1():\n return list(map(int1, sys.stdin.readline().split()))\n\n\np2D = lambda x: print(*x, sep=\"\\n\")\ndij = [(1, 0), (0, 1), (-1, 0), (0, -1)]\n\n\ndef main():\n inf = 10**9\n n, ma, mb = MI()\n vv = []\n cc = []\n for _ in range(n):\n a, b, c = MI()\n vv.append(a * mb - b * ma)\n cc.append(c)\n dp = [[inf] * 8005 for _ in range(n + 1)]\n for i in range(n):\n v, c = vv[i], cc[i]\n dp[i + 1][4000 + v] = min(dp[i + 1][4000 + v], c)\n for j in range(8005):\n pre = dp[i][j]\n if pre == inf:\n continue\n dp[i + 1][j] = min(dp[i + 1][j], pre)\n dp[i + 1][j + v] = min(dp[i + 1][j + v], pre + c)\n ans = dp[-1][4000]\n if ans == inf:\n print(-1)\n else:\n print(ans)\n\n\nmain()\n", "fast_code": "def solve():\n N, Ma, Mb = list(map(int, input().split()))\n a, b, c = [], [], []\n for i in range(N):\n ai, bi, ci = list(map(int, input().split()))\n a.append(ai)\n b.append(bi)\n c.append(ci)\n alim = sum(a)\n blim = sum(b)\n inf = 40 * 100 + 1\n dp = [[inf] * (blim + 1) for i in range(alim + 1)]\n dp[0][0] = 0\n for i in range(N):\n for u in range(alim, a[i] - 1, -1):\n for v in range(blim, b[i] - 1, -1):\n dp[u][v] = min(dp[u][v], dp[u - a[i]][v - b[i]] + c[i])\n ans = inf\n for u in range(1, alim + 1):\n for v in range(1, blim + 1):\n if u * Mb == v * Ma:\n ans = min(ans, dp[u][v])\n if ans < inf:\n print(ans)\n else:\n print((-1))\n\n\nif __name__ == \"__main__\":\n solve()\n", "slow_time": 340450294, "fast_time": 53219560, "speedup": 6.3971, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_8"} +{"pair_id": "python_687", "problem_id": "p03244", "language": "python", "slow_code": "def main():\n n, *v = list(map(int, open(0).read().split()))\n be = [0] * int(1e5)\n bo = [0] * int(1e5)\n for e, o in zip(*[iter(v)] * 2):\n be[e - 1] += 1\n bo[o - 1] += 1\n if be.index(max(be)) == bo.index(max(bo)):\n ve = max(be)\n vo = max(bo)\n be[be.index(ve)] = 0\n bo[bo.index(vo)] = 0\n print((min(n - ve - max(bo), n - vo - max(be))))\n else:\n print((n - max(be) - max(bo)))\n return\n\n\nmain()\n", "fast_code": "from collections import Counter\n\nn = int(eval(input()))\nv = list(map(int, input().split()))\n\"\"\"\"\"\"\nif len(set(v)) == 1:\n print((len(v) // 2))\n exit()\n\"\"\"\"\"\"\nodd_count = Counter(v[1::2])\neven_count = Counter(v[::2])\n\"\"\"\"\"\"\nmax_hit = 0\nodd = None\neven = None\nfor odd_val, odd_hit in odd_count.most_common(2):\n for even_val, even_hit in even_count.most_common(2):\n if odd_val == even_val:\n continue\n if odd_hit + even_hit > max_hit:\n max_hit = odd_hit + even_hit\n odd = odd_val\n even = even_val\n\"\"\"\"\"\"\nprint((len(v) - max_hit))\n", "slow_time": 2695635546, "fast_time": 57014553, "speedup": 47.2798, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_8"} +{"pair_id": "python_3570", "problem_id": "p02578", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n n = int(eval(input()))\n an = list(map(int, input().split()))\n humi = 0\n maxi = an[0]\n for i in range(1, n):\n if an[i] < maxi:\n hu = maxi - an[i]\n humi += hu\n maxi = max(maxi, an[i])\n print(humi)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "_ = int(eval(input()))\ns = h = 0\nfor a in map(int, input().split()):\n h = max(h, a)\n s += h - a\nprint(s)\n", "slow_time": 36662786, "fast_time": 18105235, "speedup": 2.025, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_15"} +{"pair_id": "python_3163", "problem_id": "p02724", "language": "python", "slow_code": "s = int(eval(input()))\ncount1 = -1\ncount2 = -1\nwhile s >= 0:\n s = s - 500\n count1 = count1 + 1\ns = s + 500\nif s == 0:\n yasashisa = count1 * 1000\n print(yasashisa)\nelse:\n while s >= 0:\n s = s - 5\n count2 = count2 + 1\n yasashisa = count1 * 1000 + count2 * 5\n print(yasashisa)\n", "fast_code": "s = int(eval(input()))\na = s // 500\nb = (s % 500) // 5\nyasashisa = a * 1000 + b * 5\nprint(yasashisa)\n", "slow_time": 2799708692, "fast_time": 12628709, "speedup": 221.694, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_14"} +{"pair_id": "python_13527", "problem_id": "p02406", "language": "python", "slow_code": "n = int(input())\ni = 1\nSP = []\nwhile i <= n:\n x = i\n if x % 3 == 0:\n SP.append(str(i))\n else:\n while x:\n if x % 10 == 3:\n SP.append(str(i))\n break\n x /= 10\n i += 1\nprint(\"\", \" \".join(SP))\n", "fast_code": "num = int(input())\nfor i in range(1, num + 1):\n if i % 3 == 0:\n print(f\" {i}\", end=\"\")\n else:\n x = i\n while x:\n if x % 10 == 3:\n print(f\" {i}\", end=\"\")\n break\n x //= 10\nprint()\n", "slow_time": 1499193681, "fast_time": 39659794, "speedup": 37.8013, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_17"} +{"pair_id": "python_9306", "problem_id": "p02792", "language": "python", "slow_code": "N = int(eval(input()))\n\n\ndef cnt(i, j):\n ret = 0\n si = str(i)\n for n in range(1, N + 1):\n if n % 10 != j:\n continue\n if str(n)[0] != si:\n continue\n ret += 1\n return ret\n\n\nans = 0\nfor i in range(10):\n for j in range(10):\n ans += cnt(i, j) * cnt(j, i)\nprint(ans)\n", "fast_code": "import sys\n\nreadline = sys.stdin.readline\nMOD = 10**9 + 7\nINF = float(\"INF\")\nsys.setrecursionlimit(10**5)\n\n\ndef main():\n N = int(readline())\n dp = [[0] * 10 for _ in range(10)]\n ans = 0\n for i in range(1, N + 1):\n s = str(i)\n first = int(s[0])\n second = int(s[-1])\n ans += 2 * dp[second][first]\n if first == second:\n ans += 1\n dp[first][second] += 1\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 1958045613, "fast_time": 102116168, "speedup": 19.1747, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_28"} +{"pair_id": "python_16508", "problem_id": "p02763", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\nclass Bit:\n def __init__(self, n):\n self.size = n\n self.tree = [0] * (n + 1)\n\n def sum(self, i):\n if i == 0:\n return 0\n s = 0\n while i > 0:\n s += self.tree[i]\n i -= i & -i\n return s\n\n def add(self, i, x):\n while i <= self.size:\n self.tree[i] += x\n i += i & -i\n\n\naas = \"abcdefghijklmnopqrstuvwxyz\"\nN = int(input().strip())\nS = list(input().strip())\nQ = int(input().strip())\ncbt = dict()\nMX = 5 * 10**5 + 2\nfor c in aas:\n cbt[c] = Bit(MX)\n for i, a in enumerate(S):\n if a == c:\n cbt[c].add(i + 1, 1)\nfor _ in range(Q):\n t, i, c = input().split()\n t = int(t)\n if t == 1:\n i = int(i)\n if S[i - 1] != c:\n cbt[S[i - 1]].add(i, -1)\n cbt[c].add(i, 1)\n S[i - 1] = c\n else:\n\n l, r = int(i), int(c)\n\n s = 0\n for a in aas:\n bt = cbt[a]\n\n s += bt.sum(r) - bt.sum(l - 1) > 0\n print(s)\n", "fast_code": "import sys\nfrom bisect import bisect, insort_left\n\niim = lambda: map(int, input().rstrip().split())\n\n\ndef resolve():\n N = int(input())\n S = list(input())\n Q = int(input())\n c0 = ord(\"a\")\n S1 = [[] for i in range(26)]\n for i, c1 in enumerate(S):\n ci = ord(c1) - c0\n S1[ci].append(i)\n ans = []\n for cmd, i, j in (line.split() for line in sys.stdin):\n i = int(i) - 1\n if cmd == \"1\":\n if S[i] == j:\n continue\n c1 = ord(S[i]) - c0\n s1 = S1[c1]\n s1.pop(bisect(s1, i) - 1)\n S[i] = j\n c1 = ord(j) - c0\n insort_left(S1[c1], i)\n elif cmd == \"2\":\n j = int(j) - 1\n num = 0\n for s1 in S1:\n ls = len(s1)\n k = bisect(s1, i - 1, 0, ls)\n if k == ls:\n continue\n if i <= s1[k] <= j:\n num += 1\n ans.append(num)\n print(*ans, sep=\"\\n\")\n\n\nif __name__ == \"__main__\":\n resolve()\n", "slow_time": 565348597, "fast_time": 95453856, "speedup": 5.9227, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_19"} +{"pair_id": "python_10882", "problem_id": "p02570", "language": "python", "slow_code": "def LI():\n return list(map(int, input().split()))\n\n\ndef II():\n return int(input())\n\n\ndef yes():\n return print(\"Yes\")\n\n\ndef no():\n return print(\"No\")\n\n\nINF = float(\"inf\")\nfrom collections import deque, defaultdict, Counter\nfrom heapq import heappop, heappush\nfrom itertools import product, combinations\nfrom functools import reduce, lru_cache\nfrom math import pi, gcd\nfrom decimal import Decimal\n\n\nclass Combination:\n \"\"\"\"\"\"\n\n def __init__(self, n_max, mod=10**9 + 7):\n self.mod = mod\n self.modinv = self.make_modinv_list(n_max)\n self.fac, self.facinv = self.make_factorial_list(n_max)\n\n def __call__(self, n, r):\n return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n - r] % self.mod\n\n def make_factorial_list(self, n):\n\n fac = [1]\n facinv = [1]\n for i in range(1, n + 1):\n fac.append(fac[i - 1] * i % self.mod)\n facinv.append(facinv[i - 1] * self.modinv[i] % self.mod)\n return fac, facinv\n\n def make_modinv_list(self, n):\n\n modinv = [0] * (n + 1)\n modinv[1] = 1\n for i in range(2, n + 1):\n modinv[i] = self.mod - self.mod // i * modinv[self.mod % i] % self.mod\n return modinv\n\n\nclass Unionfind:\n def __init__(self, N):\n self.p = list(range(N))\n self.rank = [0] * N\n self.size = [1] * N\n\n def root(self, x):\n if self.p[x] != x:\n self.p[x] = self.root(self.p[x])\n return self.p[x]\n\n def same(self, x, y):\n return self.root(x) == self.root(y)\n\n def unite(self, x, y):\n u = self.root(x)\n v = self.root(y)\n if u == v:\n return\n if self.rank[u] < self.rank[v]:\n self.p[u] = v\n self.size[v] += self.size[u]\n self.size[u] = 0\n else:\n self.p[v] = u\n self.size[u] += self.size[v]\n self.size[v] = 0\n if self.rank[u] == self.rank[v]:\n self.rank[u] += 1\n\n def count(self, x):\n return self.size[self.root(x)]\n\n\nd, t, s = LI()\nif d <= t * s:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "d, t, s = list(map(int, input().split()))\nif t * s >= d:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 146040359, "fast_time": 10725043, "speedup": 13.6168, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_11"} +{"pair_id": "python_14861", "problem_id": "p02900", "language": "python", "slow_code": "def gcd(x, y):\n if x < y:\n x, y = y, x\n while y > 0:\n x, y = y, x % y\n return x\n\n\nINFTY = 10**6\nP = [1 for i in range(INFTY + 1)]\nP[0] = 0\nP[1] = 0\nfor i in range(2, int((INFTY + 1) ** 0.5) + 1):\n for j in range(i * i, INFTY + 1, i):\n P[j] = 0\nQ = []\nfor i in range(INFTY):\n if P[i] == 1:\n Q.append(i)\nA, B = list(map(int, input().split()))\nx = gcd(A, B)\ncnt = 1\nfor y in Q:\n if x % y == 0:\n cnt += 1\n while x % y == 0:\n x = x // y\nif x > 1:\n cnt += 1\nprint(cnt)\n", "fast_code": "import math\nimport fractions\n\n\ndef sosuhante(n):\n for k in range(2, int(math.sqrt(n)) + 1):\n if n % k == 0:\n return False\n return True\n\n\ndef main():\n\n a, b = list(map(int, input().split()))\n m = 4\n k = 1\n count = 1\n if a > b:\n a, b = b, a\n sosu = set()\n\n if a % 2 == 0:\n sosu.add(2)\n while a % 2 == 0:\n a //= 2\n if a % 3 == 0:\n sosu.add(3)\n while a % 3 == 0:\n a //= 3\n\n c = math.sqrt(a) + 1\n\n while m <= c and m != 1:\n if a % m == 0:\n sosu.add(m)\n while a % m == 0:\n a //= m\n m += 1\n\n if sosu == set() and a != 1:\n sosu.add(a)\n if sosuhante(a) and a != 1:\n sosu.add(a)\n\n m = 4\n k = 1\n count = 1\n sosub = set()\n\n if b % 2 == 0:\n sosub.add(2)\n while b % 2 == 0:\n b //= 2\n if b % 3 == 0:\n sosub.add(3)\n while b % 3 == 0:\n b //= 3\n\n c = math.sqrt(b) + 1\n\n while m <= c and m != 1:\n if b % m == 0:\n sosub.add(m)\n while b % m == 0:\n b //= m\n m += 1\n\n if sosub == set() and b != 1:\n sosub.add(b)\n if sosuhante(b) and b != 1:\n sosub.add(b)\n\n for i in sosu:\n if i in sosub:\n count += 1\n print(count)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 293177338513, "fast_time": 116819770, "speedup": 2509.6552, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_22"} +{"pair_id": "python_2932", "problem_id": "p03146", "language": "python", "slow_code": "s = int(eval(input()))\na_list = [s]\ni = 0\nans = -1\nwhile ans == -1:\n if a_list[i] % 2 == 0:\n a_list.append(a_list[i] // 2)\n else:\n a_list.append(3 * a_list[i] + 1)\n i += 1\n for j in range(len(a_list) - 1):\n if a_list[i] == a_list[j]:\n ans = i\n break\nprint((ans + 1))\n", "fast_code": "s = int(eval(input()))\nif s == 1 or s == 2 or s == 4:\n cnt = 0\nelse:\n cnt = 0\n while s != 4:\n if s % 2 == 0:\n s = s / 2\n cnt += 1\n else:\n s = 3 * s + 1\n cnt += 1\nprint((cnt + 4))\n", "slow_time": 142367227, "fast_time": 29373837, "speedup": 4.8467, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_15"} +{"pair_id": "python_2788", "problem_id": "p02577", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nN = LI2()\nprint((\"Yes\" if sum(N) % 9 == 0 else \"No\"))\n", "fast_code": "if int(eval(input())) % 9 == 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 55150974, "fast_time": 11988202, "speedup": 4.6004, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_0"} +{"pair_id": "python_15161", "problem_id": "p03775", "language": "python", "slow_code": "import math\n\nn = int(eval(input()))\nif n < 10:\n print((1))\nelse:\n a = 0\n for i in range(1, int(math.sqrt(n)) + 1):\n if n % i == 0:\n a = i\n b = n // a\n j = 1\n while True:\n m = b / (10**j)\n if m >= 1 and m < 10:\n ans = j + 1\n break\n j += 1\n print(ans)\n", "fast_code": "def PrimeDecomp(N, ConcFlag):\n if ConcFlag:\n if N <= 1:\n return [1], 1\n else:\n I = 2\n PrimeDec = []\n DivCount = 1\n while I * I <= N:\n Cnt = 0\n while N % I == 0:\n N //= I\n PrimeDec.append(I)\n if Cnt >= 1:\n DivCount *= Cnt + 1\n I += 1\n if N >= 2:\n PrimeDec.append(N)\n DivCount *= 2\n return PrimeDec, DivCount\n else:\n if N <= 1:\n return [1], [1], 1\n else:\n I = 2\n PrimeDec = []\n PrimeCnt = []\n DivCount = 1\n while I * I <= N:\n Cnt = 0\n while N % I == 0:\n N //= I\n Cnt += 1\n if Cnt >= 1:\n PrimeDec.append(I)\n PrimeCnt.append(Cnt)\n DivCount *= Cnt + 1\n I += 1\n if N >= 2:\n PrimeDec.append(N)\n PrimeCnt.append(1)\n DivCount *= 2\n return PrimeDec, PrimeCnt, DivCount\n\n\nfrom itertools import combinations\nfrom operator import mul\nfrom functools import reduce\n\nN = int(eval(input()))\nPrimeDec, _ = PrimeDecomp(N, True)\nFABMax = len(str(N))\nfor TR in range(1, len(PrimeDec) + 1):\n for A in set(reduce(mul, T) for T in combinations(PrimeDec, TR)):\n B = N // A\n FABMax = min(FABMax, max(len(str(A)), len(str(B))))\nprint(FABMax)\n", "slow_time": 1778046779, "fast_time": 233216425, "speedup": 7.624, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_7"} +{"pair_id": "python_1053", "problem_id": "p03329", "language": "python", "slow_code": "l9 = []\nl9.append(1)\ntmp = 1\nwhile tmp <= 10**5:\n tmp *= 9\n l9.append(tmp)\nl6 = []\nl6.append(1)\ntmp = 1\nwhile tmp <= 10**5:\n tmp *= 6\n l6.append(tmp)\nimport bisect\n\nn = int(eval(input()))\nans = 10**6\nfor i in range(0, n + 1):\n a = i\n b = n - i\n p = 0\n while a > 0:\n idx = bisect.bisect_left(l6, a)\n if a == l6[idx]:\n a -= l6[idx]\n else:\n a -= l6[idx - 1]\n p += 1\n q = 0\n while b > 0:\n idx = bisect.bisect_left(l9, b)\n if b == l9[idx]:\n b -= l9[idx]\n else:\n b -= l9[idx - 1]\n q += 1\n ans = min(ans, p + q)\nprint(ans)\n", "fast_code": "INF = 100100100\n\n\ndef main():\n N = int(eval(input()))\n memo = [INF] * (N + 1)\n memo[0] = 0\n for i in range(1, N + 1):\n for nine in range(1, i + 1):\n if 9**nine > i:\n break\n memo[i] = min(memo[i], memo[i - 9**nine] + 1)\n for six in range(1, i + 1):\n if 6**six > i:\n break\n memo[i] = min(memo[i], memo[i - 6**six] + 1)\n memo[i] = min(memo[i], memo[i - 1] + 1)\n print((memo[N]))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 1225826012, "fast_time": 231598099, "speedup": 5.2929, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_20"} +{"pair_id": "python_14922", "problem_id": "p03212", "language": "python", "slow_code": "import itertools\n\nn = int(eval(input()))\nc = 0\nfor i in range(len(str(n)) + 1):\n for j in list(itertools.product((3, 5, 7), repeat=i)):\n if (3 in j) and (5 in j) and (7 in j):\n if n >= int((\"\".join(list(map(str, j))))):\n c += 1\nprint(c)\n", "fast_code": "import sys\nfrom collections import deque\n\ninput = sys.stdin.readline\n\n\ndef bfs(N):\n res = 0\n queue = deque([\"3\", \"5\", \"7\"])\n while queue:\n num = queue.popleft()\n if int(num) > N:\n break\n if all((\"3\" in num, \"5\" in num, \"7\" in num)):\n res += 1\n queue.append(\"\".join([num, \"3\"]))\n queue.append(\"\".join([num, \"5\"]))\n queue.append(\"\".join([num, \"7\"]))\n return res\n\n\ndef main():\n N = int(eval(input()))\n ans = bfs(N)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 6466466009, "fast_time": 1381848520, "speedup": 4.6796, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_20"} +{"pair_id": "python_7751", "problem_id": "p02707", "language": "python", "slow_code": "import sys\nfrom collections import *\nimport heapq\nimport math\nfrom math import gcd\nimport bisect\nimport copy\nfrom itertools import permutations, accumulate, combinations, product\n\n\ndef input():\n return sys.stdin.readline()[:-1]\n\n\ndef ruiseki(lst):\n return [0] + list(accumulate(lst))\n\n\nmod = pow(10, 9) + 7\nal = [chr(ord(\"a\") + i) for i in range(26)]\ndirection = [[1, 0], [0, 1], [-1, 0], [0, -1]]\nn = int(eval(input()))\na = list(map(int, input().split()))\nlst = [0] * n\nfor i in range(n - 1):\n lst[a[i] - 1] += 1\n\nfor i in range(n):\n print((lst[i]))\n", "fast_code": "num = int(eval(input()))\nboss = input().split()\nans_list = [0] * num\nfor i_boss in boss:\n ans_list[int(i_boss) - 1] += 1\na = list([str(x) for x in ans_list])\nprint((\"\\n\".join(a)))\n", "slow_time": 65718125, "fast_time": 26724339, "speedup": 2.4591, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_13"} +{"pair_id": "python_14245", "problem_id": "p03558", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**6)\nreadline = sys.stdin.readline\nk = int(eval(input()))\ng = [[] for _ in range(k)]\nfor i in range(k):\n g[i].append(((i + 1) % k, 1))\n if i:\n g[i].append((10 * i % k, 0))\n\n\"\"\"\"\"\"\nfrom heapq import *\n\n\ndef dijkstra(g, start):\n n = len(g)\n dist = [float(\"inf\")] * (n)\n pending = n - 1\n dist[start] = 0\n q = [(0, start)]\n while q and pending:\n c, v = heappop(q)\n if dist[v] < c:\n continue\n pending -= 1\n for to, cost in g[v]:\n if dist[v] + cost < dist[to]:\n dist[to] = dist[v] + cost\n heappush(q, (dist[to], to))\n return dist\n\n\ndist = dijkstra(g, 1)\nprint((dist[0] + 1))\n", "fast_code": "def solve(K):\n checked = [False] * K\n\n def calc(x):\n while not checked[x]:\n checked[x] = True\n yield x\n x = (x * 10) % K\n\n i = 0\n xs = [0]\n while 1:\n i += 1\n ys = []\n for x in xs:\n for z in calc((x + 1) % K):\n if z == 0:\n return i\n ys.append(z)\n xs = ys\n\n\nK = int(eval(input()))\nprint((solve(K)))\n", "slow_time": 5629421543, "fast_time": 341671713, "speedup": 16.4761, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_1"} +{"pair_id": "python_2422", "problem_id": "p02660", "language": "python", "slow_code": "import itertools\nimport math\nimport fractions\nimport functools\nimport copy\nfrom collections import deque\nfrom functools import reduce\nfrom decimal import Decimal\n\nn = int(eval(input()))\nprime = {}\nnum = n\ni = 2\nwhile True:\n if i * i > n:\n if num > 1:\n prime[num] = 1\n break\n while num % i == 0:\n prime[i] = prime.get(i, 0) + 1\n num = num // i\n i += 1\ncount = 0\nfor val in list(prime.values()):\n use = 1\n while True:\n if val < use:\n break\n val -= use\n use += 1\n count += 1\nprint(count)\n", "fast_code": "n = int(eval(input()))\nif n == 1:\n print((0))\n exit()\nfrom collections import Counter\n\n\ndef factorize(n):\n d = Counter()\n if n < 2:\n return d\n while n % 2 == 0:\n n //= 2\n d[2] += 1\n m = 3\n while m * m <= n:\n while n % m == 0:\n n //= m\n d[m] += 1\n m += 2\n if n > 1:\n d[n] += 1\n return d\n\n\nfac = factorize(n)\nans = 0\nfor v in list(fac.values()):\n n = 1\n while v >= n:\n v -= n\n ans += 1\n n += 1\nprint(ans)\n", "slow_time": 13215942731, "fast_time": 71245534, "speedup": 185.4985, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_2"} +{"pair_id": "python_17794", "problem_id": "p03456", "language": "python", "slow_code": "a, b = list(map(int, input().split()))\nN = int(str(a) + str(b))\nfor i in range(1, 10000):\n if N // i == i and N % i == 0:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "fast_code": "a, b = input().split()\nc = a + b\nc = int(c)\nfor i in range(1000):\n if i**2 == c:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "slow_time": 599977093, "fast_time": 74846036, "speedup": 8.0162, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_14"} +{"pair_id": "python_13558", "problem_id": "p02406", "language": "python", "slow_code": "n = int(input())\ni = 1\nprint(\"\", end=\" \")\nwhile i <= n:\n x = i\n if x % 3 == 0:\n print(i, end=\" \")\n else:\n while x:\n if x % 10 == 3:\n print(i, end=\" \")\n break\n x /= 10\n i += 1\n", "fast_code": "n = int(eval(input()))\nlist_a = [i for i in range(1, n + 1) if i % 3 == 0]\nlist_b = []\nfor i in range(1, n + 1):\n j = i\n while True:\n if j == 0:\n break\n elif j % 10 == 3:\n list_b.append(i)\n break\n j = j // 10\na = set(list_a)\nb = set(list_b)\nc = list(a | b)\nc.sort()\nprint((\" \" + \" \".join(map(str, c))))\n", "slow_time": 1225392025, "fast_time": 56053037, "speedup": 21.8613, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_26"} +{"pair_id": "python_6714", "problem_id": "p00053", "language": "python", "slow_code": "s = [0]\nM = 10**6\np = [1] * M\nS = 0\nfor i in range(2, M):\n if p[i]:\n for j in range(i * i, M, i):\n p[j] = 0\n S += i\n s.append(S)\nwhile 1:\n n = eval(input())\n if n == 0:\n break\n print(s[n])\n", "fast_code": "import math\n\nr = 105000\nsqrt = int(math.sqrt(r))\np = [1] * r\np[0] = 0\nfor i in range(1, sqrt):\n if p[i]:\n p[2 * i + 1 :: i + 1] = [0 for x in range(2 * i + 1, r, i + 1)]\ns = [0 for i in range(11000)]\ns[0] = 2\nk = 1\nfor i in range(2, r):\n if p[i]:\n s[k] = i + 1 + s[k - 1]\n k += 1\nwhile True:\n n = int(input())\n if not n:\n break\n print(s[n - 1])\n", "slow_time": 126327816139, "fast_time": 8131194652, "speedup": 15.5362, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_5"} +{"pair_id": "python_1228", "problem_id": "p02889", "language": "python", "slow_code": "import numpy as np\nfrom scipy.sparse import csr_matrix\nfrom scipy.sparse.csgraph import floyd_warshall\n\ni8 = np.int64\ni4 = np.int32\n\n\ndef main():\n stdin = open(\"/dev/stdin\")\n pin = np.fromstring(stdin.read(), i8, sep=\" \")\n N = pin[0]\n M = pin[1]\n L = pin[2]\n ABC = pin[3 : M * 3 + 3].reshape((-1, 3))\n A = ABC[:, 0] - 1\n B = ABC[:, 1] - 1\n C = ABC[:, 2]\n Q = pin[M * 3 + 3]\n st = (pin[M * 3 + 4 : 2 * Q + M * 3 + 4] - 1).reshape((-1, 2))\n s = st[:, 0]\n t = st[:, 1]\n graph = csr_matrix((C, (A, B)), shape=(N, N))\n dist = np.array(floyd_warshall(graph, directed=False))\n dist[dist > L + 0.5] = 0\n dist[dist > 0] = 1\n min_dist = np.array(floyd_warshall(dist))\n min_dist[min_dist == np.inf] = 0\n min_dist = (min_dist + 0.5).astype(int)\n x = min_dist[s, t] - 1\n print((\"\\n\".join(x.astype(str).tolist())))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\ninput = lambda: sys.stdin.readline().rstrip()\ninpl = lambda: list(map(int, input().split()))\n\n\ndef warshall_floyd(\n N, edges, nopath=None, start_distance=0, plus_func=lambda D, d: D + d\n):\n \"\"\"\"\"\"\n ret = [[nopath] * N for _ in range(N)]\n for i in range(N):\n ret[i][i] = start_distance\n for i in range(N):\n for j, d in edges[i]:\n if 0 <= j < N:\n ret[i][j] = plus_func(start_distance, d)\n for k in range(N):\n for i in range(N):\n if i == k:\n continue\n for j in range(N):\n if j == k or ret[i][k] == nopath or ret[k][j] == nopath:\n continue\n d = plus_func(ret[i][k], ret[k][j])\n if ret[i][j] == nopath or d < ret[i][j]:\n ret[i][j] = d\n return ret\n\n\nN, M, L = inpl()\nroad = [[] for _ in range(N)]\nfor i in range(M):\n A, B, C = inpl()\n if C <= L:\n road[A - 1].append((B - 1, C))\n road[B - 1].append((A - 1, C))\nQ = int(eval(input()))\nST = []\ngoals = [set() for _ in range(N)]\nfor _ in range(Q):\n s, t = inpl()\n s -= 1\n t -= 1\n ST.append((s, t))\ndistance = warshall_floyd(N, road)\npath = [set() for _ in range(N)]\nfor i in range(N):\n for j in range(N):\n d = distance[i][j]\n if d is not None and d <= L:\n path[i].add((j, 1))\nans = warshall_floyd(N, path)\nfor s, t in ST:\n if ans[s][t] is None:\n print((-1))\n else:\n print((ans[s][t] - 1))\n", "slow_time": 25152564245, "fast_time": 182436731, "speedup": 137.8701, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_24"} +{"pair_id": "python_13995", "problem_id": "p02283", "language": "python", "slow_code": "class Node:\n key = 0\n l = None\n r = None\n\n def __init__(self, key):\n self.key = key\n\n\nT = [None] * 5000005\n\n\ndef insert(z):\n if z == 0:\n return\n y = 0\n x = 0\n while x is not None:\n y = x\n x = T[x].l if T[z].key < T[x].key else T[x].r\n if T[z].key < T[y].key:\n T[y].l = z\n else:\n T[y].r = z\n\n\ndef inorder(x):\n if x == None:\n return\n inorder(T[x].l)\n print(\"\", T[x].key, end=\"\")\n inorder(T[x].r)\n\n\ndef preorder(x):\n if x == None:\n return\n print(\"\", T[x].key, end=\"\")\n preorder(T[x].l)\n preorder(T[x].r)\n\n\nn = int(input())\nfor i in range(n):\n s = input()\n if s == \"print\":\n inorder(0)\n print()\n preorder(0)\n print()\n else:\n x = int(s.split()[1])\n T[i] = Node(x)\n insert(i)\n", "fast_code": "import sys\n\n\nclass Node:\n __slots__ = [\"key\", \"left\", \"right\"]\n\n def __init__(self, key):\n self.key = key\n self.left = self.right = None\n\n\nroot = None\n\n\ndef insert(key):\n global root\n x, y = root, None\n while x is not None:\n x, y = x.left if key < x.key else x.right, x\n if y is None:\n root = Node(key)\n elif key < y.key:\n y.left = Node(key)\n else:\n y.right = Node(key)\n\n\ndef inorder(node):\n return inorder(node.left) + f\" {node.key}\" + inorder(node.right) if node else \"\"\n\n\ndef preorder(node):\n return f\" {node.key}\" + preorder(node.left) + preorder(node.right) if node else \"\"\n\n\neval(input())\nfor e in sys.stdin:\n if e[0] == \"i\":\n insert(int(e[7:]))\n else:\n print((inorder(root)))\n print((preorder(root)))\n", "slow_time": 267495056, "fast_time": 79763983, "speedup": 3.3536, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_9"} +{"pair_id": "python_17824", "problem_id": "p02586", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\nimport math\nfrom copy import copy, deepcopy\nfrom copy import deepcopy as dcp\nfrom operator import itemgetter\nfrom bisect import bisect_left, bisect, bisect_right\n\n\nfrom collections import deque, defaultdict\n\n\nfrom collections import Counter\n\n\nfrom itertools import accumulate, combinations, permutations, product\n\n\nfrom heapq import heapify, heappop, heappush\n\n\nfrom functools import reduce, lru_cache\n\n\nfrom decimal import Decimal\n\n\ndef input():\n x = sys.stdin.readline()\n return x[:-1] if x[-1] == \"\\n\" else x\n\n\ndef printe(*x):\n print(\"## \", *x, file=sys.stderr)\n\n\ndef printl(li):\n _ = print(*li, sep=\"\\n\") if li else None\n\n\ndef argsort(s, return_sorted=False):\n inds = sorted(range(len(s)), key=lambda k: s[k])\n if return_sorted:\n return inds, [s[i] for i in inds]\n return inds\n\n\ndef alp2num(c, cap=False):\n return ord(c) - 97 if not cap else ord(c) - 65\n\n\ndef num2alp(i, cap=False):\n return chr(i + 97) if not cap else chr(i + 65)\n\n\ndef matmat(A, B):\n K, N, M = len(B), len(A), len(B[0])\n return [\n [sum([(A[i][k] * B[k][j]) for k in range(K)]) for j in range(M)]\n for i in range(N)\n ]\n\n\ndef matvec(M, v):\n N, size = len(v), len(M)\n return [sum([M[i][j] * v[j] for j in range(N)]) for i in range(size)]\n\n\ndef T(M):\n n, m = len(M), len(M[0])\n return [[M[j][i] for j in range(n)] for i in range(m)]\n\n\ndef binr(x):\n return bin(x)[2:]\n\n\ndef bitcount(x):\n x = x - ((x >> 1) & 0x5555555555555555)\n x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)\n x = (x + (x >> 4)) & 0x0F0F0F0F0F0F0F0F\n x += x >> 8\n x += x >> 16\n x += x >> 32\n return x & 0x7F\n\n\ndef main():\n mod = 1000000007\n\n R, C, K = map(int, input().split())\n\n base = 5000\n S = []\n for i in range(K):\n r, c, v = map(int, input().split())\n r -= 1\n c -= 1\n S.append((r * base + c, v))\n S.sort(key=itemgetter(0))\n p = 0\n dp = [[0] * 4 for _ in range(C)]\n dpi = [[0] * 4 for _ in range(C)]\n for i in range(R):\n for j in range(C):\n cv = 0\n if p < K and i * base + j == S[p][0]:\n cv = S[p][1]\n p += 1\n if j > 0:\n dpi[j] = copy(dpi[j - 1])\n else:\n dpi[0] = [0] * 4\n if i > 0:\n dpi[j][0] = max(dp[j], dpi[j][0])\n if cv != 0:\n for k in range(2, -1, -1):\n dpi[j][k + 1] = max(dpi[j][k] + cv, dpi[j][k + 1])\n\n dp[j] = max(dpi[j])\n print(dp[-1])\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "R, C, K = list(map(int, input().split()))\nl = [[0] * C for i in range(R)]\nfor i in range(K):\n a, b, c = list(map(int, input().split()))\n a -= 1\n b -= 1\n l[a][b] = c\ndp = [0] * C\nfor i in range(R):\n ndp = [0] * C\n kdp = [0] * 4\n kdp[0] = dp[0]\n kdp[1] = l[i][0] + dp[0]\n ndp[0] = kdp[1]\n for j in range(1, C):\n kdp[0] = max(kdp[0], dp[j])\n for k in range(2, -1, -1):\n kdp[k + 1] = max(kdp[k + 1], kdp[k] + l[i][j])\n ndp[j] = max(kdp)\n dp = ndp\nprint((dp[C - 1]))\n", "slow_time": 163255328, "fast_time": 47384717, "speedup": 3.4453, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_20"} +{"pair_id": "python_289", "problem_id": "p02714", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nN = I()\nS = [\"\"] + LS2()\nR = [0] * (N + 1)\nG = [0] * (N + 1)\nB = [0] * (N + 1)\nfor i in range(1, N + 1):\n s = S[i]\n R[i] = R[i - 1]\n G[i] = G[i - 1]\n B[i] = B[i - 1]\n if s == \"R\":\n R[i] += 1\n elif s == \"G\":\n G[i] += 1\n else:\n B[i] += 1\nans = 0\nfor i in range(2, N):\n if S[i] == \"R\":\n ans += G[i - 1] * (B[-1] - B[i])\n ans += B[i - 1] * (G[-1] - G[i])\n for j in range(1, N + 1):\n if 1 <= i - j <= N and 1 <= i + j <= N:\n if (S[i - j] == \"G\" and S[i + j] == \"B\") or (\n S[i - j] == \"B\" and S[i + j] == \"G\"\n ):\n ans -= 1\n elif S[i] == \"G\":\n ans += R[i - 1] * (B[-1] - B[i])\n ans += B[i - 1] * (R[-1] - R[i])\n for j in range(1, N + 1):\n if 1 <= i - j <= N and 1 <= i + j <= N:\n if (S[i - j] == \"R\" and S[i + j] == \"B\") or (\n S[i - j] == \"B\" and S[i + j] == \"R\"\n ):\n ans -= 1\n else:\n ans += G[i - 1] * (R[-1] - R[i])\n ans += R[i - 1] * (G[-1] - G[i])\n for j in range(1, N + 1):\n if 1 <= i - j <= N and 1 <= i + j <= N:\n if (S[i - j] == \"R\" and S[i + j] == \"G\") or (\n S[i - j] == \"G\" and S[i + j] == \"R\"\n ):\n ans -= 1\nprint(ans)\n", "fast_code": "from collections import defaultdict\n\n\ndef main():\n _ = int(eval(input()))\n S = input().rstrip()\n indices = defaultdict(set)\n for i, c in enumerate(S):\n indices[c].add(i)\n cnt = len(indices[\"R\"]) * len(indices[\"G\"]) * len(indices[\"B\"])\n for c1, c2, c3 in [\"RGB\", \"GBR\", \"BRG\"]:\n cnt -= sum(\n (i + j) % 2 == 0 and (i + j) // 2 in indices[c3]\n for i in indices[c1]\n for j in indices[c2]\n )\n print(cnt)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 275204636, "fast_time": 72545495, "speedup": 3.7935, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_14"} +{"pair_id": "python_764", "problem_id": "p02642", "language": "python", "slow_code": "n = int(eval(input()))\nA = sorted(map(int, input().split()))\nU = 10**6\nline = [1] * (U + 1)\nans = set()\ndepricated = set()\ncnt = [0] * (U + 1)\nfor a in A:\n cnt[a] += 1\n if cnt[a] == 2 and line[a]:\n depricated.add(a)\n continue\n if 2 < cnt[a]:\n continue\n if line[a]:\n ans.add(a)\n for p in range(2 * a, U + 1, a):\n line[p] = 0\nprint((len(ans - depricated)))\n", "fast_code": "N = int(eval(input()))\nAs = list(map(int, input().split()))\nM = max(As) + 1\ncnt = [0 for _ in range(M)]\nfor A in As:\n if cnt[A] != 0:\n cnt[A] = 2\n continue\n for n in range(A, M, A):\n cnt[n] += 1\nans = 0\nfor A in As:\n if cnt[A] == 1:\n ans += 1\nprint(ans)\n", "slow_time": 24452317730, "fast_time": 41703497, "speedup": 586.3373, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_28"} +{"pair_id": "python_2917", "problem_id": "p03146", "language": "python", "slow_code": "s = int(eval(input()))\na_list = [s]\ni = 0\nans = -1\nwhile ans == -1:\n if a_list[i] % 2 == 0:\n a_list.append(a_list[i] // 2)\n else:\n a_list.append(3 * a_list[i] + 1)\n i += 1\n for j in range(len(a_list) - 1):\n if a_list[i] == a_list[j]:\n ans = i\n break\nprint((ans + 1))\n", "fast_code": "s = int(eval(input()))\ni = 2\nwhile ~-s:\n s = [s // 2, s * 3 + 1][s % 2]\n i += 1\nprint((max(i, 4)))\n", "slow_time": 142367227, "fast_time": 23226752, "speedup": 6.1295, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_10"} +{"pair_id": "python_14015", "problem_id": "p03125", "language": "python", "slow_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nmod = 10**9 + 7\ninf = float(\"inf\")\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\na, b = LI()\nif b % a == 0:\n print((a + b))\nelse:\n print((b - a))\n", "fast_code": "a, b = list(map(int, input().split()))\nprint(((a + b) if b % a == 0 else (b - a)))\n", "slow_time": 43332877, "fast_time": 12561301, "speedup": 3.4497, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_4"} +{"pair_id": "python_298", "problem_id": "p02995", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nA, B, C, D = MI()\nfrom math import gcd\n\n\ndef f(n):\n return n - n // C - n // D + n // ((C * D) // gcd(C, D))\n\n\nprint((f(B) - f(A - 1)))\n", "fast_code": "import sys\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\nA, B, C, D = list(map(int, S().split()))\nfrom math import gcd\n\n\ndef f(n):\n return n - n // C - n // D + n // (C * D // gcd(C, D))\n\n\nprint((f(B) - f(A - 1)))\n", "slow_time": 64669235, "fast_time": 26310057, "speedup": 2.458, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_25"} +{"pair_id": "python_499", "problem_id": "p03221", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\nP = []\nY = []\narr = [[] for j in range(10**5 + 1)]\nfor i in range(M):\n listA = list(map(int, input().split()))\n P.append(listA[0])\n Y.append(listA[1])\n arr[listA[0]].append(listA[1])\nfor i in range(N + 1):\n arr[i].sort()\nfor i in range(M):\n\n left = 0\n right = len(arr[P[i]]) - 1\n while left <= right:\n mid = (left + right) // 2\n if arr[P[i]][mid] == Y[i]:\n k = mid\n break\n elif arr[P[i]][mid] > Y[i]:\n right = mid - 1\n else:\n left = mid + 1\n print((str(P[i]).rjust(6, \"0\") + str(k + 1).rjust(6, \"0\")))\n", "fast_code": "n, m = list(map(int, input().split()))\nipy = []\nfor i in range(m):\n p, y = list(map(int, input().split()))\n ipy.append([i, p, y])\ncounter = {}\norder = {}\nfor i, p, y in sorted(ipy, key=lambda x: x[2]):\n counter[p] = counter.get(p, 0) + 1\n order[i, p] = counter[p]\nfor i, p, y in ipy:\n print((\"{:06}{:06}\".format(p, order[i, p])))\n", "slow_time": 2260230442, "fast_time": 31000410, "speedup": 72.9097, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_6"} +{"pair_id": "python_12210", "problem_id": "p00008", "language": "python", "slow_code": "import sys\n\nr = list(range(10))\nx = [0] * 51\nfor a in r:\n for b in r:\n for c in r:\n for d in r:\n x[a + b + c + d] += 1\nfor l in sys.stdin:\n print(x[int(l)])\n", "fast_code": "import sys\n\ntable = {}\n\n\ndef memorize(f):\n global table\n\n def func(*args):\n if not args in table:\n table[args] = f(*args)\n return table[args]\n\n return func\n\n\n@memorize\ndef dfs(a, b):\n if a == 0:\n return 1\n elif b == 0 or a < 0:\n return 0\n return sum([dfs(a - i, b - 1) for i in range(10)])\n\n\nfor i in sys.stdin.readlines():\n print(dfs(int(i.strip()), 4))\n", "slow_time": 858693699, "fast_time": 124200677, "speedup": 6.9138, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_1"} +{"pair_id": "python_7841", "problem_id": "p02888", "language": "python", "slow_code": "from collections import defaultdict, deque, Counter, OrderedDict\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce, lru_cache\nfrom heapq import heappush, heappop, heapify\nimport itertools\nimport math, fractions\nimport sys, copy\n\n\ndef L():\n return sys.stdin.readline().split()\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef SL():\n return list(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI1():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef R(n):\n return [sys.stdin.readline().strip() for _ in range(n)]\n\n\ndef LR(n):\n return [L() for _ in range(n)]\n\n\ndef IR(n):\n return [I() for _ in range(n)]\n\n\ndef LIR(n):\n return [LI() for _ in range(n)]\n\n\ndef LIR1(n):\n return [LI1() for _ in range(n)]\n\n\ndef SR(n):\n return [SL() for _ in range(n)]\n\n\ndef LSR(n):\n return [LS() for _ in range(n)]\n\n\ndef perm(n, r):\n return math.factorial(n) // math.factorial(r)\n\n\ndef comb(n, r):\n return math.factorial(n) // (math.factorial(r) * math.factorial(n - r))\n\n\ndef make_list(n, *args, default=0):\n return (\n [make_list(*args, default=default) for _ in range(n)]\n if len(args) > 0\n else [default for _ in range(n)]\n )\n\n\ndire = [[1, 0], [0, 1], [-1, 0], [0, -1]]\ndire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]\nalphabets = \"abcdefghijklmnopqrstuvwxyz\"\nALPHABETS = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nMOD = 1000000007\nINF = float(\"inf\")\nsys.setrecursionlimit(1000000)\n\n\ndef main():\n N = I()\n L = sorted(LI())\n ans = 0\n for i in range(N):\n k = i\n for j in range(i + 1, N):\n while k < N and L[k] < L[i] + L[j]:\n k += 1\n ans += k - (j + 1)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "from bisect import bisect_left, bisect_right\nimport sys\n\ninput = sys.stdin.readline\nn = int(eval(input()))\n\nL = [int(i) for i in input().split()]\nL.sort()\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n a, b = L[i], L[j]\n ans += bisect_left(L, a + b) - 1 - j\nprint(ans)\n", "slow_time": 203845466, "fast_time": 38189414, "speedup": 5.3377, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_8"} +{"pair_id": "python_1766", "problem_id": "p03608", "language": "python", "slow_code": "from itertools import permutations\nfrom scipy.sparse.csgraph import floyd_warshall\n\nn, m, r = list(map(int, input().split()))\nvis = list(map(int, input().split()))\nINF = 10**18\npath = [[INF] * n for i in range(n)]\nfor i in range(m):\n a, b, c = list(map(int, input().split()))\n path[a - 1][b - 1] = c\n path[b - 1][a - 1] = c\npath = floyd_warshall(path)\nans = 10**18\nfor root in permutations(vis):\n cnt = 0\n for j in range(1, r):\n cnt += path[root[j - 1] - 1][root[j] - 1]\n ans = min(ans, cnt)\nprint((int(ans)))\n", "fast_code": "import sys\n\nstdin = sys.stdin\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nns = lambda: stdin.readline()\nn, m, r = na()\nrs = na()\nfor i in range(r):\n rs[i] -= 1\ng = [[99999999999] * n for _ in range(n)]\nfor i in range(n):\n g[i][i] = 0\nfor i in range(m):\n a, b, c = na()\n a -= 1\n b -= 1\n g[a][b] = g[b][a] = c\nfor k in range(n):\n for i in range(n):\n for j in range(n):\n g[i][j] = min(g[i][j], g[i][k] + g[k][j])\nfrom itertools import *\n\nans = 9999999999999999999\nfor ord in permutations(rs):\n w = 0\n for i in range(1, r):\n w += g[ord[i - 1]][ord[i]]\n ans = min(ans, w)\nprint(ans)\n", "slow_time": 16547903576, "fast_time": 66359868, "speedup": 249.3661, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_26"} +{"pair_id": "python_4097", "problem_id": "p03170", "language": "python", "slow_code": "N, K = list(map(int, input().split()))\na = list(map(int, input().split()))\ndp = [False] * (K + 1)\nfor i in range(1, K + 1):\n for j in range(N):\n if 0 <= i - a[j] and not dp[i - a[j]]:\n dp[i] = True\n break\nprint((\"First\" if dp[K] else \"Second\"))\n", "fast_code": "def main():\n N, K, *A = list(map(int, open(0).read().split()))\n dp = [False] * (K + 1)\n for i in range(K):\n if dp[i]:\n continue\n for a in A:\n if i + a > K:\n break\n dp[i + a] = True\n print((\"First\" if dp[-1] else \"Second\"))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 1397716616, "fast_time": 334630587, "speedup": 4.1769, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_17"} +{"pair_id": "python_15361", "problem_id": "p02780", "language": "python", "slow_code": "n, k = list(map(int, input().split()))\narr = list(map(int, input().split()))\ntable = {}\nans = 0\nfor i in range(1, 1000 + 1):\n table[i] = (i + 1) * 0.5\nif n == 1:\n print((table[arr[0]]))\n exit()\nlis = [0 for _ in range(n)]\nlis[0] = table[arr[0]]\nfor i in range(n - 1):\n if i + 1 < k:\n lis[i + 1] = lis[i] + table[arr[i + 1]]\n else:\n lis[i + 1] = lis[i] + table[arr[i + 1]] - table[arr[i - k + 1]]\n ans = max(ans, lis[i + 1])\nprint(ans)\n", "fast_code": "N, K = list(map(int, input().split()))\np = [int(x) for x in input().split()]\np = [(x + 1) / 2 for x in p]\nS = [0 for _ in range(N + 1)]\nfor i in range(N):\n S[i + 1] += S[i] + p[i]\nans = 0\nfor i in range(N - K + 1):\n ans = max(ans, S[i + K] - S[i])\nprint(ans)\n", "slow_time": 91479968, "fast_time": 28589147, "speedup": 3.1998, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_14"} +{"pair_id": "python_17199", "problem_id": "p02555", "language": "python", "slow_code": "a, b, c = 1, 0, 0\nexec(\"a,b,c=b,c,a+c;\" * int(eval(input())))\nprint((a % (10**9 + 7)))\n", "fast_code": "S = int(eval(input()))\nmod = 10**9 + 7\nDP = [0] * (S + 1)\nif S >= 3:\n DP[3] = 1\nfor i in range(4, S + 1):\n DP[i] = DP[i - 1] + DP[i - 3]\n DP[i] %= mod\nprint((DP[-1]))\n", "slow_time": 182932094, "fast_time": 31774898, "speedup": 5.7571, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_25"} +{"pair_id": "python_16486", "problem_id": "p03796", "language": "python", "slow_code": "import sys\nimport os\nimport math\n\nMOD = 1000000007\n\n\ndef main():\n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"input.txt\", \"r\")\n N = int(sys.stdin.readline().rstrip())\n print((math.factorial(N) % MOD))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "mod = 10**9 + 7\nans = 1\nfor i in range(int(eval(input()))):\n ans *= i + 1\n ans %= mod\nprint(ans)\n", "slow_time": 27015242522, "fast_time": 3587596980, "speedup": 7.5302, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_2"} +{"pair_id": "python_856", "problem_id": "p03556", "language": "python", "slow_code": "n = int(eval(input()))\nfor i in range(n, 0, -1):\n if float(i**0.5).is_integer():\n print(i)\n break\n", "fast_code": "import numpy as np\n\nN = int(eval(input()))\nmp = int(np.sqrt(N))\nprint((mp**2))\n", "slow_time": 868435773, "fast_time": 14006913, "speedup": 62.0005, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_28"} +{"pair_id": "python_13182", "problem_id": "p03962", "language": "python", "slow_code": "a, b, c = input().split()\ncolors = 0\nif a == b and b == c:\n colors = 1\nelif a == b or b == c or c == a:\n colors = 2\nelse:\n colors = 3\nprint(colors)\n", "fast_code": "s = set(input().split())\nprint((len(s)))\n", "slow_time": 17128720, "fast_time": 7931149, "speedup": 2.1597, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_14"} +{"pair_id": "python_184", "problem_id": "p03805", "language": "python", "slow_code": "from itertools import permutations\n\nn, m = list(map(int, input().split()))\nedges = [tuple(map(int, input().split())) for _ in range(m)]\nans = 0\nfor i in permutations(list(range(2, n + 1)), n - 1):\n load = [1] + list(i)\n ans += (\n sum(1 for edge in zip(load, load[1:]) if tuple(sorted(edge)) in edges) == n - 1\n )\nprint(ans)\n", "fast_code": "from collections import defaultdict\nfrom itertools import permutations\n\n\ndef main():\n N, M = list(map(int, input().split()))\n g = defaultdict(list)\n for _ in range(M):\n a, b = list(map(int, input().split()))\n g[a].append(b)\n g[b].append(a)\n ans = 0\n for route in permutations(list(range(2, N + 1)), N - 1):\n ok = True\n now = 1\n for r in route:\n if r in g[now]:\n now = r\n else:\n ok = False\n if ok:\n ans += 1\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 5262903933, "fast_time": 1015280859, "speedup": 5.1837, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_23"} +{"pair_id": "python_18278", "problem_id": "p02831", "language": "python", "slow_code": "num1, num2 = list(map(int, input().split()))\nimport math\n\n\ndef gcd(num1, num2):\n for i in range(min(num1, num2), 0, -1):\n if num1 % i == 0 and num2 % i == 0:\n return i\n\n\nprint((int(num1 * num2 / gcd(num1, num2))))\n", "fast_code": "import sys\n\nstdin = sys.stdin\nsys.setrecursionlimit(10**7)\ni_i = lambda: int(i_s())\ni_l = lambda: list(map(int, stdin.readline().split()))\ni_s = lambda: stdin.readline().rstrip()\n\n\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n\ndef lcm(a, b):\n return a * b // gcd(a, b)\n\n\nA, B = i_l()\nprint((lcm(A, B)))\n", "slow_time": 282756854, "fast_time": 36632669, "speedup": 7.7187, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_7"} +{"pair_id": "python_6764", "problem_id": "p03552", "language": "python", "slow_code": "N, Z, W = list(map(int, input().split()))\n(*A,) = list(map(int, input().split()))\nimport sys\n\nsys.setrecursionlimit(10**6)\nmemo = {}\n\n\ndef dfs(i, turn):\n if (i, turn) in memo:\n return memo[i, turn]\n if turn == 0:\n\n if i == 0:\n res = abs(W - A[-1])\n else:\n res = abs(A[i - 1] - A[-1])\n for j in range(i + 1, N):\n res = max(res, dfs(j, 1))\n else:\n\n if i == 0:\n res = abs(Z - A[-1])\n else:\n res = abs(A[i - 1] - A[-1])\n for j in range(i + 1, N):\n res = min(res, dfs(j, 0))\n memo[i, turn] = res\n return res\n\n\nprint((dfs(0, 0)))\n", "fast_code": "N, Z, W = list(map(int, input().split()))\n(*A,) = list(map(int, input().split()))\nif N == 1:\n print((abs(A[0] - W)))\nelse:\n print((max(abs(A[-1] - W), abs(A[-2] - A[-1]))))\n", "slow_time": 65684718, "fast_time": 25703169, "speedup": 2.5555, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_1"} +{"pair_id": "python_5899", "problem_id": "p03693", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef solve():\n r, g, b = LI()\n ans = [\"YES\", \"NO\"]\n print((ans[((g << 1) + b) & 3 > 0]))\n return\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "r, g, b = input().split()\nprint((\"YES\" if int(g + b) % 4 == 0 else \"NO\"))\n", "slow_time": 89960780, "fast_time": 10340481, "speedup": 8.6999, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_12"} +{"pair_id": "python_18586", "problem_id": "p03409", "language": "python", "slow_code": "num = 201\n\n\ndef dfs(cur):\n global vis\n global EE\n vis[cur] = 1\n if cur == num:\n return 1\n for i in range(num + 1):\n if vis[i] == 0 and EE[cur][i] > 0 and dfs(i) > 0:\n EE[cur][i] -= 1\n EE[i][cur] += 1\n return 1\n return 0\n\n\nn = int(eval(input()))\ns = []\nss = []\nfor i in range(n):\n s.append([int(i) for i in input().split()])\nfor i in range(n):\n ss.append([int(i) for i in input().split()])\ns.sort(key=lambda x: (x[0], x[1]))\nss.sort(key=lambda x: (x[0], x[1]))\npair = []\nfor i in range(len(s)):\n right = []\n for j in range(n):\n if s[j][0] < ss[i][0] and s[j][1] < ss[i][1]:\n right.append(j)\n pair.append(right)\npair.sort(key=lambda x: len(x))\n\n\nEE = [[0 for x in range(num + 1)] for y in range(num + 11)]\nvis = [0] * (num + 1)\nfor i in range(len(pair)):\n EE[0][i + 1] = 1\n EE[i + 1][0] = 1\nfor i in range(n):\n EE[i + 101][num] = 1\nfor i in range(len(pair)):\n for j in range(len(pair[i])):\n node1, node2 = i + 1, pair[i][j] + 101\n\n EE[node1][node2] = 1\n\nflow = 0\nwhile 1:\n for i in range(0, num + 1):\n vis[i] = 0\n if dfs(0) == 0:\n break\n flow += 1\nprint(flow)\n", "fast_code": "def main():\n from sys import stdin\n\n def input():\n return stdin.readline().strip()\n\n n = int(eval(input()))\n red = [tuple(map(int, input().split())) for _ in range(n)]\n blue = [tuple(map(int, input().split())) for _ in range(n)]\n red.sort()\n blue.sort()\n now = 0\n for i in blue:\n while now < len(red) and red[now] < i:\n now += 1\n l = red[:now]\n if l == []:\n continue\n l = sorted(l, key=lambda x: x[1])\n if l[0][1] > i[1]:\n continue\n\n left = 0\n right = len(l) - 1\n while left < right:\n center = (left + right + 1) // 2\n if l[center][1] < i[1]:\n left = center\n else:\n right = center - 1\n red.remove(l[left])\n now -= 1\n print((n - len(red)))\n\n\nmain()\n", "slow_time": 579236453, "fast_time": 85099546, "speedup": 6.8066, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_15"} +{"pair_id": "python_14578", "problem_id": "p03603", "language": "python", "slow_code": "N = int(input())\nP = list(map(int, input().split()))\nX = [0] + list(map(int, input().split()))\nko = [[] for _ in range(N + 1)]\nfor i, p in enumerate(P, 2):\n ko[p].append(i)\n\n\ndef f(p):\n n = len(ko[p])\n if n == 0:\n return X[p], 0\n dp = [[float(\"inf\")] * 5001 for _ in range(n + 1)]\n dp[0][0] = 0\n for i, c in enumerate(ko[p], 1):\n a, b = f(c)\n for j in range(a, 5001):\n dp[i][j] = min(dp[i][j], dp[i - 1][j - a] + b)\n for j in range(b, 5001):\n dp[i][j] = min(dp[i][j], dp[i - 1][j - b] + a)\n out = min(dp[-1][: X[p] + 1])\n if out == float(\"inf\"):\n print(\"IMPOSSIBLE\")\n exit()\n elif out > X[p]:\n return out, X[p]\n else:\n return X[p], out\n\n\nprint(\"POSSIBLE\") if min(f(1)) <= X[1] else print(\"IMPOSSIBLE\")\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**8)\nN = int(eval(input()))\nP = [int(i) for i in input().split()]\nX = [int(i) for i in input().split()]\ntable = [[] for i in range(N)]\nfor i in range(N - 1):\n table[P[i] - 1].append(i + 1)\ndp = [0] * N\n\n\ndef tree(pa):\n for i in table[pa]:\n tree(i)\n t = len(table[pa])\n if t == 0:\n return\n T = set()\n s = 0\n for i in range(t):\n x = table[pa][i]\n s += X[x] + dp[x]\n if i == 0:\n if X[x] <= X[pa]:\n T.add(X[x])\n if dp[x] <= X[pa]:\n T.add(dp[x])\n continue\n S = set()\n for k in T:\n if k + X[x] <= X[pa]:\n S.add(k + X[x])\n if k + dp[x] <= X[pa]:\n S.add(k + dp[x])\n T = S\n if len(T) == 0:\n print(\"IMPOSSIBLE\")\n sys.exit()\n dp[pa] = s - max(T)\n return\n\n\ntree(0)\nprint(\"POSSIBLE\")\n", "slow_time": 908704243, "fast_time": 96453345, "speedup": 9.4212, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_0"} +{"pair_id": "python_3465", "problem_id": "p02922", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef S():\n return eval(input())\n\n\ndef main():\n a, b = LI()\n c = 1\n ans = 0\n while True:\n if c >= b:\n return ans\n ans += 1\n c -= 1\n c += a\n\n\nprint((main()))\n", "fast_code": "a, b = list(map(int, input().split()))\nprint((-(-(b - 1) // (a - 1))))\n", "slow_time": 80117443, "fast_time": 11057146, "speedup": 7.2458, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_22"} +{"pair_id": "python_8369", "problem_id": "p03448", "language": "python", "slow_code": "A = int(eval(input()))\nB = int(eval(input()))\nC = int(eval(input()))\nX = int(eval(input()))\nans = 0\nfor i in range(A + 1):\n for j in range(B + 1):\n for k in range(C + 1):\n temp = i * 500 + j * 100 + k * 50\n if temp == X:\n ans += 1\nprint(ans)\n", "fast_code": "a = int(eval(input()))\nb = int(eval(input()))\nc = int(eval(input()))\nx = int(eval(input()))\ncnt = 0\nfor i in range(a + 1):\n for j in range(b + 1):\n z = x - (500 * i + 100 * j)\n if z < 0:\n break\n if z / 50 <= c:\n cnt += 1\nprint(cnt)\n", "slow_time": 7964238908, "fast_time": 89323797, "speedup": 89.1614, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_25"} +{"pair_id": "python_5419", "problem_id": "p02774", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\nn, k = list(map(int, input().split()))\nA = list(map(int, input().split()))\nminus = 0\nfor i in range(n):\n if A[i] < 0:\n minus += 1\nzplus = n - minus\nB = []\nC = []\nfor i in range(n):\n if A[i] < 0:\n C.append(A[i])\n else:\n B.append(A[i])\nB.sort(reverse=True)\nC.sort()\nif k <= minus * zplus:\n ok = 1\n ng = -(10**20)\n m = (ok + ng) // 2\n while abs(ng - ok) > 1:\n co = 0\n j = len(C) - 1\n for i in range(len(B)):\n while j >= 0 and B[i] * C[j] > m:\n j -= 1\n co += j + 1\n\n if co >= k:\n ok = m\n\n else:\n ng = m\n\n m = (ok + ng) // 2\n print(ok)\nelse:\n k -= minus * zplus\n ok = 10**20\n ng = -1\n m = (ok + ng) // 2\n while abs(ng - ok) > 1:\n co = 0\n j = len(C) - 1\n for i in range(len(C)):\n while j > i and C[i] * C[j] <= m:\n j -= 1\n co += len(C) - 1 - j\n j = max(j, i + 1)\n j = len(B) - 1\n for i in range(len(B)):\n while j > i and B[i] * B[j] <= m:\n j -= 1\n co += len(B) - 1 - j\n j = max(j, i + 1)\n if co >= k:\n ok = m\n\n else:\n ng = m\n\n m = (ok + ng) // 2\n print(ok)\n", "fast_code": "import sys\n\nINF = float(\"inf\")\n\n\ndef main():\n N, K = list(map(int, input().split()))\n A = list(map(int, input().split()))\n A.sort()\n\n neg, zero, pos = [], [], []\n for a in A:\n if a < 0:\n neg.append(a)\n elif a == 0:\n zero.append(a)\n else:\n pos.append(a)\n neg.sort()\n pos.sort()\n prod_neg = len(neg) * len(pos)\n prod_zero = len(zero) * (len(neg) + len(pos)) + len(zero) * (len(zero) - 1) // 2\n prod_pos = len(neg) * (len(neg) - 1) // 2 + len(pos) * (len(pos) - 1) // 2\n\n if prod_neg >= K:\n\n left = neg[0] * pos[-1] - 1\n right = 0\n while right - left > 1:\n mid = (right + left) // 2\n\n counter = 0\n ns, ps = 0, 0\n for ns in range(len(neg)):\n while ps < len(pos) and neg[ns] * pos[ps] > mid:\n ps += 1\n if ps == len(pos):\n break\n counter += len(pos) - ps\n\n if counter < K:\n left = mid\n else:\n right = mid\n print(right)\n elif prod_zero + prod_neg >= K:\n print((0))\n else:\n neg.sort(reverse=True)\n\n left = 0\n right = 0\n if len(neg) > 0:\n right = max(neg[-1] ** 2, right)\n if len(pos) > 0:\n right = max(pos[-1] ** 2, right)\n right += 1\n while right - left > 1:\n mid = (left + right) // 2\n\n counter = 0\n start, end = 0, len(pos) - 1\n\n for start in range(len(pos)):\n while end >= start and pos[start] * pos[end] >= mid:\n end -= 1\n if end <= start:\n break\n counter += end - start\n\n start, end = 0, len(neg) - 1\n for start in range(len(neg)):\n while end >= start and neg[start] * neg[end] >= mid:\n end -= 1\n if end <= start:\n break\n counter += end - start\n\n if counter < K - prod_neg - prod_zero:\n left = mid\n else:\n right = mid\n print(left)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 556876982, "fast_time": 242451224, "speedup": 2.2969, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_4"} +{"pair_id": "python_4771", "problem_id": "p04015", "language": "python", "slow_code": "N, A = list(map(int, input().split()))\nX = list([int(x) - A for x in input().split()])\ndp = [0] * 10000\ndp[0] = 1\nfor i in range(N):\n new_dp = dp[:]\n for j in range(-3000, 3000):\n if dp[j] > 0:\n new_dp[j + X[i]] += dp[j]\n dp = new_dp\nprint((dp[0] - 1))\n", "fast_code": "from collections import defaultdict, deque, Counter, OrderedDict\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce, lru_cache\nfrom heapq import heappush, heappop, heapify\nimport itertools\nimport math, fractions\nimport sys, copy\n\n\ndef L():\n return sys.stdin.readline().split()\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef SL():\n return list(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI1():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef R(n):\n return [sys.stdin.readline().strip() for _ in range(n)]\n\n\ndef LR(n):\n return [L() for _ in range(n)]\n\n\ndef IR(n):\n return [I() for _ in range(n)]\n\n\ndef LIR(n):\n return [LI() for _ in range(n)]\n\n\ndef LIR1(n):\n return [LI1() for _ in range(n)]\n\n\ndef SLR(n):\n return [SL() for _ in range(n)]\n\n\ndef LSR(n):\n return [LS() for _ in range(n)]\n\n\ndef perm(n, r):\n return math.factorial(n) // math.factorial(r)\n\n\ndef comb(n, r):\n return math.factorial(n) // (math.factorial(r) * math.factorial(n - r))\n\n\ndef make_list(n, *args, default=0):\n return (\n [make_list(*args, default=default) for _ in range(n)]\n if args\n else [default for _ in range(n)]\n )\n\n\ndire = [[1, 0], [0, 1], [-1, 0], [0, -1]]\ndire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]\nalphabets = \"abcdefghijklmnopqrstuvwxyz\"\nALPHABETS = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nMOD = 1000000007\nINF = float(\"inf\")\nsys.setrecursionlimit(1000000)\n\n\ndef main():\n N, A = LI()\n X = LI()\n Y = [xi - A for xi in X]\n z = max(A, max(X))\n dp = make_list(N + 1, 2 * z * N + 1)\n dp[0][z * N] = 1\n for i in range(1, N + 1):\n for s in range(2 * z * N + 1):\n if 0 <= s - Y[i - 1] <= 2 * z * N:\n dp[i][s] = dp[i - 1][s] + dp[i - 1][s - Y[i - 1]]\n else:\n dp[i][s] = dp[i - 1][s]\n print((dp[-1][z * N] - 1))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 3072371499, "fast_time": 488085549, "speedup": 6.2947, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_16"} +{"pair_id": "python_7825", "problem_id": "p02888", "language": "python", "slow_code": "from collections import defaultdict, deque, Counter, OrderedDict\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce, lru_cache\nfrom heapq import heappush, heappop, heapify\nimport itertools\nimport math, fractions\nimport sys, copy\n\n\ndef L():\n return sys.stdin.readline().split()\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef SL():\n return list(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI1():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef R(n):\n return [sys.stdin.readline().strip() for _ in range(n)]\n\n\ndef LR(n):\n return [L() for _ in range(n)]\n\n\ndef IR(n):\n return [I() for _ in range(n)]\n\n\ndef LIR(n):\n return [LI() for _ in range(n)]\n\n\ndef LIR1(n):\n return [LI1() for _ in range(n)]\n\n\ndef SR(n):\n return [SL() for _ in range(n)]\n\n\ndef LSR(n):\n return [LS() for _ in range(n)]\n\n\ndef perm(n, r):\n return math.factorial(n) // math.factorial(r)\n\n\ndef comb(n, r):\n return math.factorial(n) // (math.factorial(r) * math.factorial(n - r))\n\n\ndef make_list(n, *args, default=0):\n return (\n [make_list(*args, default=default) for _ in range(n)]\n if len(args) > 0\n else [default for _ in range(n)]\n )\n\n\ndire = [[1, 0], [0, 1], [-1, 0], [0, -1]]\ndire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]\nalphabets = \"abcdefghijklmnopqrstuvwxyz\"\nALPHABETS = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nMOD = 1000000007\nINF = float(\"inf\")\nsys.setrecursionlimit(1000000)\n\n\ndef main():\n N = I()\n L = sorted(LI())\n ans = 0\n for i in range(N):\n k = i\n for j in range(i + 1, N):\n while k < N and L[k] < L[i] + L[j]:\n k += 1\n ans += k - (j + 1)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "n = int(eval(input()))\nl = list(map(int, input().split()))\nl.sort()\nans = 0\nfrom bisect import bisect_left\n\nfor i in range(n - 2):\n for j in range(i + 1, n - 1):\n ab = l[i] + l[j]\n idx = bisect_left(l, ab)\n ans += max(idx - j - 1, 0)\nprint(ans)\n", "slow_time": 203845466, "fast_time": 33970756, "speedup": 6.0006, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_27"} +{"pair_id": "python_245", "problem_id": "p03061", "language": "python", "slow_code": "def div(n):\n divisors = []\n for i in range(1, int(n**0.5) + 1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i:\n divisors.append(n // i)\n return divisors\n\n\nn = int(eval(input()))\nat = [int(i) for i in input().split()]\na = set(at)\nd = {}\nfor i, j in enumerate(a):\n t = div(j)\n for k in t:\n if k in d:\n d[k] += 1\n elif i == 0 or k not in d:\n d[k] = 1\nans = 1\nfor i in d:\n x = 0\n for j in at:\n if j % i:\n x += 1\n if x < 2:\n ans = max(ans, i)\nprint(ans)\n", "fast_code": "N = int(eval(input()))\nA = [int(i) for i in input().split()]\n\n\ndef gcd(x, y):\n if x < y:\n x, y = y, x\n if y == 0:\n return x\n return gcd(x % y, y)\n\n\nL = [0]\nR = [0]\nfor i in range(N):\n L.append(gcd(A[i], L[i]))\n R.append(gcd(A[-i - 1], R[i]))\nR.reverse()\nM = []\nfor i in range(0, N):\n M.append(gcd(L[i], R[i + 1]))\nprint((max(M)))\n", "slow_time": 1204085687, "fast_time": 51394366, "speedup": 23.4284, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_27"} +{"pair_id": "python_13866", "problem_id": "p04029", "language": "python", "slow_code": "def arithmetic_series(a, d, n):\n return n * (2 * a + (n - 1) * d) // 2\n\n\ndef main():\n n = int(eval(input()))\n print((arithmetic_series(1, 1, n)))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "n = int(eval(input()))\nprint(((n * (n + 1)) // 2))\n", "slow_time": 23689447, "fast_time": 10709553, "speedup": 2.212, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_11"} +{"pair_id": "python_14422", "problem_id": "p02669", "language": "python", "slow_code": "def main():\n from collections import defaultdict, deque\n\n inf = 10**27\n T = int(eval(input()))\n for _ in range(T):\n N, A, B, C, D = list(map(int, input().split()))\n dq = deque()\n dq.append((0, N))\n checked = defaultdict(lambda: inf)\n ans = N * D + 1\n while dq:\n cost, x = dq.popleft()\n if cost >= ans:\n continue\n if cost >= checked[x]:\n continue\n checked[x] = cost\n\n ans = min(ans, cost + x * D)\n for d, c in ((2, A), (3, B), (5, C)):\n\n nx, r = divmod(x, d)\n ncost = cost + r * D + c\n if checked[nx] > ncost:\n dq.append((ncost, nx))\n ncost = cost + (d - r) * D + c\n if (r > 0) and (checked[nx + 1] > ncost):\n dq.append((ncost, nx + 1))\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nmod = 10**9 + 7\ninf = float(\"inf\")\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\nt = I()\nfor _ in range(t):\n n, a, b, c, d = LI()\n memo = {0: 0, 1: d}\n\n def dfs(x):\n if x in memo:\n return memo[x]\n ret = x * d\n ret = min(ret, min(dfs(x // 2), dfs((x - 1) // 2 + 1)) + a + d * (x % 2))\n ret = min(\n ret,\n min(\n dfs(x // 3) + b + d * (x % 3), dfs((x - 1) // 3 + 1) + b + d * (-x % 3)\n ),\n )\n ret = min(\n ret,\n min(\n dfs(x // 5) + c + d * (x % 5), dfs((x - 1) // 5 + 1) + c + d * (-x % 5)\n ),\n )\n memo[x] = ret\n return ret\n\n print((dfs(n)))\n", "slow_time": 115167925158, "fast_time": 15518055323, "speedup": 7.4215, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_13"} +{"pair_id": "python_9266", "problem_id": "p02558", "language": "python", "slow_code": "from networkx.utils import UnionFind\n\nN, Q = list(map(int, input().split()))\nuf = UnionFind()\nfor i in range(Q):\n t, u, v = list(map(int, input().split()))\n if t:\n print((1 if uf[u] == uf[v] else 0))\n else:\n uf.union(u, v)\n", "fast_code": "from typing import Iterable\nimport sys\n\n\ndef main():\n input = sys.stdin.readline\n N, Q = list(map(int, input().split()))\n uf = UnionFindTree(N)\n ans = []\n for _ in range(Q):\n t, u, v = list(map(int, input().split()))\n if t:\n ans.append(\"1\" if uf.same(u, v) else \"0\")\n else:\n uf.union(u, v)\n print((\"\\n\".join(ans)))\n\n\nclass UnionFindTree:\n __slots__ = \"parent\"\n\n def __init__(self, n: int) -> None:\n self.parent = [-1] * n\n\n def find(self, x: int) -> int:\n p = self.parent\n while p[x] >= 0:\n x, p[x] = p[x], p[p[x]]\n return x\n\n def union(self, x: int, y: int) -> bool:\n x, y, p = self.find(x), self.find(y), self.parent\n if x == y:\n return False\n if p[x] > p[y]:\n x, y = y, x\n p[x], p[y] = p[x] + p[y], x\n return True\n\n def same(self, x: int, y: int) -> bool:\n return self.find(x) == self.find(y)\n\n def size(self, x: int) -> int:\n return -self.parent[self.find(x)]\n\n def same_all(self, indices: Iterable[int]) -> bool:\n f, v = self.find, self.find(indices[0])\n return all(f(i) == v for i in indices)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 18058265902, "fast_time": 124793396, "speedup": 144.7053, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_6"} +{"pair_id": "python_9681", "problem_id": "p02554", "language": "python", "slow_code": "def getN():\n return int(eval(input()))\n\n\ndef getNM():\n return list(map(int, input().split()))\n\n\ndef getList():\n return list(map(int, input().split()))\n\n\ndef getArray(intn):\n return [int(eval(input())) for i in range(intn)]\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\ndef rand_N(ran1, ran2):\n return random.randint(ran1, ran2)\n\n\ndef rand_List(ran1, ran2, rantime):\n return [random.randint(ran1, ran2) for i in range(rantime)]\n\n\ndef rand_ints_nodup(ran1, ran2, rantime):\n ns = []\n while len(ns) < rantime:\n n = random.randint(ran1, ran2)\n if not n in ns:\n ns.append(n)\n return sorted(ns)\n\n\ndef rand_query(ran1, ran2, rantime):\n r_query = []\n while len(r_query) < rantime:\n n_q = rand_ints_nodup(ran1, ran2, 2)\n if not n_q in r_query:\n r_query.append(n_q)\n return sorted(r_query)\n\n\nfrom collections import defaultdict, deque, Counter\nfrom sys import exit\nfrom decimal import *\nfrom heapq import heapify, heappop, heappush\nimport math\nimport random\nimport string\nfrom copy import deepcopy\nfrom itertools import combinations, permutations, product\nfrom operator import mul, itemgetter\nfrom functools import reduce\nfrom bisect import bisect_left, bisect_right\nimport sys\n\nsys.setrecursionlimit(1000000000)\nmod = 10**9 + 7\n\n\nN = getN()\nlogk = N.bit_length()\n\n\ndp = [[[0, 0, 0, 0] for i in range(4)] for i in range(logk)]\ndp[0] = [[8, 1, 1, 0], [0, 9, 0, 1], [0, 0, 9, 1], [0, 0, 0, 10]]\n\n\ndef array_cnt(ar1, ar2):\n h = len(ar1)\n w = len(ar2[0])\n row = ar1\n col = []\n for j in range(w):\n opt = []\n for i in range(len(ar2)):\n opt.append(ar2[i][j])\n col.append(opt)\n res = [[[0, 0] for i in range(w)] for i in range(h)]\n for i in range(h):\n for j in range(w):\n cnt = 0\n for x, y in zip(row[i], col[j]):\n cnt += x * y\n res[i][j] = cnt\n res[i][j] %= mod\n return res\n\n\nfor i in range(1, logk):\n dp[i] = array_cnt(dp[i - 1], dp[i - 1])\nans = [[1, 0, 0, 0]]\nfor i in range(logk):\n if N & (1 << i):\n ans = array_cnt(ans, dp[i])\nprint((ans[0][-1] % mod))\n", "fast_code": "N = int(eval(input()))\nMOD_BY = 10**9 + 7\n\n\ndef power_func(a, n, p):\n bi = str(format(n, \"b\"))\n res = 1\n for i in range(len(bi)):\n res = (res * res) % p\n if bi[i] == \"1\":\n res = (res * a) % p\n return res\n\n\na = power_func(10, N, MOD_BY)\nb = power_func(9, N, MOD_BY)\nc = power_func(8, N, MOD_BY)\nans = a - 2 * b + c\nprint((ans % MOD_BY))\n", "slow_time": 273778611, "fast_time": 42408281, "speedup": 6.4558, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_0"} +{"pair_id": "python_13616", "problem_id": "p02362", "language": "python", "slow_code": "import array\nimport collections\n\nG_INF = 2**31\n\n\nclass GraphError(Exception):\n pass\n\n\nclass GraphSearchError(GraphError):\n def __init__(self, reason):\n self.reason = reason\n\n def __str__(self):\n return str(reason)\n\n\nclass ShortestPathFasterAlgorithm(object):\n def __init__(self, number_of_vertices, adjacency_list, costs, start):\n self.max_v = number_of_vertices\n self.adj = adjacency_list\n self.costs = costs\n self.start = start\n self.dist = None\n self.visits = None\n\n def initialize(self):\n self.dist = collections.defaultdict(lambda: G_INF)\n self.dist[self.start] = 0\n self.visits = collections.defaultdict(int)\n\n def single_source_shortest_path(self):\n self.initialize()\n q = collections.deque()\n q.append(self.start)\n while q:\n u = q.popleft()\n self.visits[u] += 1\n if self.visits[u] >= self.max_v:\n if self.max_v == 1:\n return [0]\n raise GraphSearchError(\"A negative cycle was detected.\")\n for v in self.adj[u]:\n new_length = self.dist[u] + self.costs[(u, v)]\n if new_length < self.dist[v]:\n self.dist[v] = new_length\n if v not in q:\n q.append(v)\n return self.dist\n\n\ndef main():\n max_v, max_e, start = list(map(int, input().split()))\n adjacency_list = collections.defaultdict(lambda: array.array(\"L\"))\n costs = collections.defaultdict(lambda: G_INF)\n for _ in range(max_e):\n s, t, d = list(map(int, input().split()))\n adjacency_list[s].append(t)\n costs[(s, t)] = d\n spfa = ShortestPathFasterAlgorithm(max_v, adjacency_list, costs, start)\n try:\n dist = spfa.single_source_shortest_path()\n for v in range(max_v):\n result = dist[v]\n if result < G_INF:\n print(result)\n else:\n print(\"INF\")\n except GraphSearchError as gse:\n print(\"NEGATIVE CYCLE\")\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\nfile_input = sys.stdin\nV, E, r = map(int, file_input.readline().split())\nedges = []\nfor line in file_input:\n edges.append(tuple(map(int, line.split())))\n\ndistance = [float(\"inf\")] * V\ndistance[r] = 0\nfor i in range(V):\n notUpdated = True\n for e in edges:\n t = e[1]\n temp_d = distance[e[0]] + e[2]\n if temp_d < distance[t]:\n distance[t] = temp_d\n notUpdated = False\n if notUpdated:\n break\n\nif i == V - 1 and V != 1:\n print(\"NEGATIVE CYCLE\")\nelse:\n print(*map(lambda x: str(x).upper(), distance), sep=\"\\n\")\n", "slow_time": 134643964, "fast_time": 45819717, "speedup": 2.9386, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_9"} +{"pair_id": "python_18421", "problem_id": "p03001", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\ndef I():\n return int(eval(input()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef main():\n mod = 10**9 + 7\n W, H, x, y = MI()\n ans = (W * H) / 2\n if x == W / 2 and y == H / 2:\n print((ans, 1))\n else:\n print((ans, 0))\n\n\nmain()\n", "fast_code": "w, h, x, y = list(map(int, input().split()))\nprint((w * h / 2, int(w == 2 * x and h == 2 * y)))\n", "slow_time": 41211597, "fast_time": 13921484, "speedup": 2.9603, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_16"} +{"pair_id": "python_6662", "problem_id": "p04014", "language": "python", "slow_code": "import sys\n\nn = int(eval(input()))\ns = int(eval(input()))\n\n\ndef f(b, n):\n if n < b:\n return n\n else:\n return f(b, n // b) + n % b\n\n\nif s == n:\n print((n + 1))\n sys.exit(0)\nif n < s:\n print((-1))\n sys.exit(0)\nans = None\nfor i in range(2, n):\n if i * i > n:\n break\n if f(i, n) == s:\n ans = i\n break\nfor i in range(1, n):\n if i * i > n:\n break\n if (n - s) % i == 0:\n b = (n - s) // i + 1\n if f(b, n) == s:\n if ans is None:\n ans = (n - s) // i + 1\n else:\n ans = min((ans, (n - s) // i + 1))\nif ans is None:\n print((-1))\nelse:\n print(ans)\n", "fast_code": "def primeFactor(N):\n i = 2\n ret = {}\n n = N\n mrFlg = 0\n while i**2 <= n:\n k = 0\n while n % i == 0:\n n //= i\n k += 1\n ret[i] = k\n i += 1\n if i == 101 and n >= (2**20):\n\n def findFactorRho(N):\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return abs(a)\n\n def f(x, c):\n return ((x**2) + c) % N\n\n semi = [N]\n for c in range(1, 99):\n x, y, d = 2, 2, 1\n while d == 1:\n x = f(x, c)\n y = f(f(y, c), c)\n d = gcd(abs(x - y), N)\n if d != N:\n if isPrimeMR(d):\n return d\n elif isPrimeMR(N // d):\n return N // d\n else:\n semi.append(d)\n\n while True:\n if isPrimeMR(n):\n ret[n], n = 1, 1\n break\n else:\n mrFlg = 1\n j = findFactorRho(n)\n k = 0\n while n % j == 0:\n n //= j\n k += 1\n ret[j] = k\n if n == 1:\n break\n if n > 1:\n ret[n] = 1\n if mrFlg > 0:\n\n def dict_sort(X):\n Y = {}\n for x in sorted(X.keys()):\n Y[x] = X[x]\n return Y\n\n ret = dict_sort(ret)\n return ret\n\n\ndef isPrimeMR(n):\n if n == 2:\n return True\n if n == 1 or n & 1 == 0:\n return False\n d = (n - 1) >> 1\n while d & 1 == 0:\n d >>= 1\n for a in [2, 3, 5, 7, 11, 13, 17, 19, 23]:\n t = d\n y = pow(a, t, n)\n while t != n - 1 and y != 1 and y != n - 1:\n y = (y * y) % n\n t <<= 1\n if y != n - 1 and t & 1 == 0:\n return False\n return True\n\n\ndef divisors(N):\n pf = primeFactor(N)\n ret = [1]\n for p in pf:\n ret_prev = ret\n ret = []\n for i in range(pf[p] + 1):\n for r in ret_prev:\n ret.append(r * (p**i))\n return sorted(ret)\n\n\ndef f(b, n):\n re = 0\n while n:\n re += n % b\n n //= b\n return re\n\n\nN = int(eval(input()))\nS = int(eval(input()))\nif N < S:\n print((-1))\nelif N == S:\n print((N + 1))\nelse:\n for b in divisors(N - S):\n b += 1\n if f(b, N) == S:\n print(b)\n break\n else:\n print((-1))\n", "slow_time": 2618861164, "fast_time": 157911457, "speedup": 16.5844, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_5"} +{"pair_id": "python_223", "problem_id": "p03240", "language": "python", "slow_code": "N = int(eval(input()))\nXYH = [list(map(int, input().split())) for i in range(N)]\nXYH.sort(key=lambda x: x[2], reverse=1)\nfor Cx in range(101):\n for Cy in range(101):\n H = XYH[0][2] + abs(XYH[0][0] - Cx) + abs(XYH[0][1] - Cy)\n cnt = 0\n for X, Y, h in XYH:\n if h == max(H - abs(X - Cx) - abs(Y - Cy), 0):\n cnt += 1\n if cnt == N:\n print((Cx, Cy, H))\n break\n", "fast_code": "N = int(eval(input()))\nxyh = [list(map(int, input().split())) for i in range(N)]\n\nheight = None\nfound = False\nfor cx in range(0, 101):\n for cy in range(0, 101):\n candidate = 0\n for x, y, h in xyh:\n if h == 0:\n continue\n dx = abs(x - cx)\n dy = abs(y - cy)\n candidate = dx + dy + h\n break\n found = True\n for x, y, h in xyh:\n _h = max(candidate - abs(x - cx) - abs(y - cy), 0)\n if h != _h:\n found = False\n break\n if found is True:\n break\n if found is True:\n break\nheight = candidate if candidate is not None else 0\nprint((cx, cy, height))\n", "slow_time": 9772291562, "fast_time": 1191604347, "speedup": 8.201, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_8"} +{"pair_id": "python_1219", "problem_id": "p02889", "language": "python", "slow_code": "from scipy.sparse.csgraph import floyd_warshall\nimport numpy as np\n\nN, M, L = list(map(int, input().split()))\nD = np.ones([N, N]) * np.inf\nD[np.eye(N, dtype=bool)] = 0\nfor _ in range(M):\n A, B, C = list(map(int, input().split()))\n D[A - 1, B - 1] = C\n D[B - 1, A - 1] = C\nD = floyd_warshall(D)\nD2 = (D <= L) * 1.0\nD2[D2 == 0] = np.inf\n\nD2 = floyd_warshall(D2) - 1\nQ = int(eval(input()))\nfor _ in range(Q):\n s, t = list(map(int, input().split()))\n r = D2[s - 1, t - 1]\n if r < np.inf:\n print((int(r)))\n else:\n print((-1))\n", "fast_code": "import sys\n\ninput = lambda: sys.stdin.readline().rstrip()\ninpl = lambda: list(map(int, input().split()))\n\n\ndef warshall_floyd(\n N, edges, nopath=None, start_distance=0, plus_func=lambda D, d: D + d\n):\n \"\"\"\"\"\"\n ret = [[nopath] * N for _ in range(N)]\n for i in range(N):\n ret[i][i] = start_distance\n for i in range(N):\n for j, d in edges[i]:\n if 0 <= j < N:\n ret[i][j] = plus_func(start_distance, d)\n for k in range(N):\n for i in range(N):\n if i == k:\n continue\n for j in range(N):\n if j == k or ret[i][k] == nopath or ret[k][j] == nopath:\n continue\n d = plus_func(ret[i][k], ret[k][j])\n if ret[i][j] == nopath or d < ret[i][j]:\n ret[i][j] = d\n return ret\n\n\nN, M, L = inpl()\nroad = [[] for _ in range(N)]\nfor i in range(M):\n A, B, C = inpl()\n if C <= L:\n road[A - 1].append((B - 1, C))\n road[B - 1].append((A - 1, C))\nQ = int(eval(input()))\nST = []\ngoals = [set() for _ in range(N)]\nfor _ in range(Q):\n s, t = inpl()\n s -= 1\n t -= 1\n ST.append((s, t))\ndistance = warshall_floyd(N, road)\npath = [set() for _ in range(N)]\nfor i in range(N):\n for j in range(N):\n d = distance[i][j]\n if d is not None and d <= L:\n path[i].add((j, 1))\nans = warshall_floyd(N, path)\nfor s, t in ST:\n if ans[s][t] is None:\n print((-1))\n else:\n print((ans[s][t] - 1))\n", "slow_time": 25120883849, "fast_time": 182436731, "speedup": 137.6964, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_24"} +{"pair_id": "python_10215", "problem_id": "p03222", "language": "python", "slow_code": "h, w, K = list(map(int, input().split()))\nmod = 10**9 + 7\ndp = [[0] * w for _ in range(h + 1)]\ndp[0][0] = 1\nfor i in range(1, h + 1):\n for j in range(w):\n left, center, right = 0, 0, 0\n for k in range(2 ** (w - 1)):\n invalid = False\n for l in range(1, w - 1):\n if k >> l & 1 and k >> (l - 1) & 1:\n invalid = True\n if invalid:\n continue\n no_line = True\n if j > 0:\n if k >> (j - 1) & 1:\n left += 1\n no_line = False\n if j < w - 1:\n if k >> j & 1:\n right += 1\n no_line = False\n if no_line:\n center += 1\n if j > 0:\n dp[i][j] += dp[i - 1][j - 1] * left\n if j < w - 1:\n dp[i][j] += dp[i - 1][j + 1] * right\n dp[i][j] += dp[i - 1][j] * center\n dp[i][j] %= mod\nprint((dp[h][K - 1]))\n", "fast_code": "import sys\n\nstdin = sys.stdin\nsys.setrecursionlimit(10**7)\n\n\ndef li():\n return list(map(int, stdin.readline().split()))\n\n\ndef li_():\n return [int(x) - 1 for x in stdin.readline().split()]\n\n\ndef lf():\n return list(map(float, stdin.readline().split()))\n\n\ndef ls():\n return stdin.readline().split()\n\n\ndef ns():\n return stdin.readline().rstrip()\n\n\ndef lc():\n return list(ns())\n\n\ndef ni():\n return int(stdin.readline())\n\n\ndef nf():\n return float(stdin.readline())\n\n\nh, w, k = li()\nk -= 1\nMOD = 10**9 + 7\n\nif w > 1:\n matrix = [[0] * w for _ in range(w)]\n for num in range(1 << (w - 1)):\n if \"11\" in bin(num):\n continue\n ex = False\n for i, bit in enumerate(bin(num)[2:].zfill(w - 1)):\n if bit == \"1\":\n ex = True\n matrix[i][i + 1] += 1\n matrix[i + 1][i] += 1\n elif ex:\n ex = False\n else:\n matrix[i][i] += 1\n if not ex:\n matrix[w - 1][w - 1] += 1\n\n dp = [1] + [0] * (w - 1)\n for hi in range(h):\n nex = [0] * w\n for wj in range(w):\n for wk in range(w):\n nex[wj] += matrix[wj][wk] * dp[wk]\n nex[wj] %= MOD\n dp = nex\n print((dp[k]))\nelse:\n print((1))\n", "slow_time": 2168607755, "fast_time": 146951952, "speedup": 14.7573, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_7"} +{"pair_id": "python_14251", "problem_id": "p03558", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nfrom collections import deque\n\n\ndef bfs01(g, start):\n n = len(g)\n res = [float(\"inf\")] * n\n res[start] = 0\n pending = n - 1\n q = deque([(0, start)])\n while q and pending:\n dv, v = q.popleft()\n if res[v] < dv:\n continue\n pending -= 1\n\n for to, cost in g[v]:\n if dv + cost < res[to]:\n res[to] = dv + cost\n if cost:\n q.append((res[to], to))\n else:\n q.appendleft((res[to], to))\n return res\n\n\nimport sys\n\nsys.setrecursionlimit(10**6)\nreadline = sys.stdin.readline\nk = int(eval(input()))\ng = [[] for _ in range(k)]\nfor i in range(k):\n g[i].append(((i + 1) % k, 1))\n g[i].append((10 * i % k, 0))\nres = bfs01(g, 1)\nprint((res[0] + 1))\n", "fast_code": "from collections import deque\n\n\ndef solve(K):\n checked = [99999999999] * (K + 1)\n queue = deque()\n queue.append((1, 1))\n checked[1] = 1\n while queue:\n x, n = queue.popleft()\n if x == 0:\n return n\n _ = (x * 10) % K\n if n < checked[_]:\n queue.appendleft((_, n))\n checked[_] = n\n _ = (x + 1) % K\n if n + 1 < checked[_]:\n queue.append((_, n + 1))\n checked[_] = n + 1\n return None\n\n\nK = int(eval(input()))\nprint((solve(K)))\n", "slow_time": 3422632544, "fast_time": 524611965, "speedup": 6.5241, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_0"} +{"pair_id": "python_16600", "problem_id": "p03147", "language": "python", "slow_code": "n = int(eval(input()))\nh = list(map(int, input().split()))\nresult = 0\nwhile True:\n start = n\n for i in range(n):\n if h[i] != 0:\n start = i\n break\n if start == n:\n break\n end = n - 1\n for i in range(start, n):\n if h[i] == 0:\n end = i - 1\n break\n h[i] -= 1\n result += 1\nprint(result)\n", "fast_code": "N = int(eval(input()))\nh = list(map(int, input().split()))\ns = h[0]\nfor i in range(1, N):\n s += max(0, h[i] - h[i - 1])\nprint(s)\n", "slow_time": 144746630, "fast_time": 22446470, "speedup": 6.4485, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_18"} +{"pair_id": "python_16348", "problem_id": "p03309", "language": "python", "slow_code": "n = int(eval(input()))\na = list(map(int, input().split()))\nb_low = -1 * (10**10)\nb_high = 10**10\nb_low_d = sum([abs(a[i] - (b_low + 2 + i)) for i in range(n)]) - sum(\n [abs(a[i] - (b_low + 1 + i)) for i in range(n)]\n)\nb_high_d = sum([abs(a[i] - (b_high + 2 + i)) for i in range(n)]) - sum(\n [abs(a[i] - (b_high + 1 + i)) for i in range(n)]\n)\nwhile b_high - b_low > 10:\n b_tmp = (b_low + b_high) // 2\n b_tmp_d = sum([abs(a[i] - (b_tmp + 2 + i)) for i in range(n)]) - sum(\n [abs(a[i] - (b_tmp + 1 + i)) for i in range(n)]\n )\n if b_tmp_d > 0:\n b_high = b_tmp\n else:\n b_low = b_tmp\nans = 10**20\nfor j in range(b_low, b_high):\n ans = min(ans, sum([abs(a[i] - (j + 2 + i)) for i in range(n)]))\nprint(ans)\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nB = A\nfor i in range(N):\n B[i] -= i + 1\nC = sorted(B)\nif N % 2 == 0:\n b = (C[int(N / 2 - 1)] + C[int(N / 2)]) // 2\nelse:\n b = C[int((N - 1) / 2)]\nans = 0\nfor i in range(N):\n ans += abs(C[i] - b)\nprint(ans)\n", "slow_time": 150426833, "fast_time": 38681000, "speedup": 3.8889, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_21"} +{"pair_id": "python_7788", "problem_id": "p03108", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return map(int, sys.stdin.readline().rstrip().split())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nclass UnionFind:\n def __init__(self, n):\n self.par = [i for i in range(n + 1)]\n self.rank = [0] * (n + 1)\n self.X = [0] + [1] * n\n\n def find(self, x):\n if self.par[x] == x:\n return x\n else:\n self.par[x] = self.find(self.par[x])\n return self.par[x]\n\n def same_check(self, x, y):\n return self.find(x) == self.find(y)\n\n def unite(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if self.rank[x] < self.rank[y]:\n x, y = y, x\n if self.rank[x] == self.rank[y]:\n self.rank[x] += 1\n self.par[y] = x\n self.X[x] = self.X[x] + self.X[y]\n\n\nN, M = MI()\nUF = UnionFind(N)\nAB = [tuple(MI()) for _ in range(M)]\nAB.reverse()\nans = N * (N - 1) // 2\nANS = []\nfor i in range(M):\n ANS.append(ans)\n a, b = AB[i]\n if UF.same_check(a, b):\n continue\n else:\n ans -= UF.X[UF.find(a)] * UF.X[UF.find(b)]\n UF.unite(a, b)\nANS.reverse()\nprint(*ANS, sep=\"\\n\")\n", "fast_code": "r = lambda x: x if u[x] < 0 else r(u[x])\nn, m, *e = map(int, open(0).read().split())\nu = [-1] * -~n\nt = n * ~-n // 2\na = [t]\nfor x, y in zip(e[-2:1:-2], e[:1:-2]):\n x, y = sorted((r(x), r(y)))\n if x != y:\n t -= u[x] * u[y]\n u[x] += u[y]\n u[y] = x\n a += [t]\nprint(*a[::-1], sep=\"\\n\")\n", "slow_time": 121092416, "fast_time": 44240664, "speedup": 2.7371, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_13"} +{"pair_id": "python_16424", "problem_id": "p03796", "language": "python", "slow_code": "from math import factorial\n\nn = int(eval(input()))\nprint((factorial(n) % (10**9 + 7)))\n", "fast_code": "n = int(eval(input()))\n\n\ndef a(x):\n if x == 1:\n return 1\n else:\n d = 1\n for i in range(x + 1)[1:]:\n d *= i\n d %= 10**9 + 7\n return d\n\n\nprint((a(n)))\n", "slow_time": 27006361128, "fast_time": 1420571179, "speedup": 19.0109, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_19"} +{"pair_id": "python_2022", "problem_id": "p02603", "language": "python", "slow_code": "import sys\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\nN = I()\nB = [0] + LI()\nA = [0]\nfor i in range(N):\n if B[i] != B[i + 1]:\n A.append(B[i + 1])\nN = len(A) - 1\nMAX = [0, 1000] + [0] * N\nfrom functools import lru_cache\n\n\n@lru_cache(maxsize=None)\ndef dfs(n, money):\n if n == N + 1:\n return money\n else:\n res = money\n for i in range(n, N):\n for j in range(i + 1, N + 1):\n if (\n A[i] == min(A[i : j + 1])\n and A[j] == max(A[i : j + 1])\n and A[i] < A[j]\n ):\n a = money + (A[j] - A[i]) * (money // A[i])\n if a > MAX[j + 1]:\n res = max(res, dfs(j + 1, a))\n MAX[j + 1] = a\n return res\n\n\nprint((dfs(1, 1000)))\n", "fast_code": "from sys import stdin\n\ninput = stdin.readline\nN = int(eval(input()))\nA = list(map(int, input().split()))\nstart = 0\nmoney = 1000\nfor i in range(N - 1):\n if A[i + 1] > A[i]:\n buy = money // A[i]\n money -= A[i] * buy\n money += buy * A[i + 1]\nprint(money)\n", "slow_time": 86185448, "fast_time": 30255706, "speedup": 2.8486, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_14"} +{"pair_id": "python_13793", "problem_id": "p02385", "language": "python", "slow_code": "class Dice:\n def __init__(self):\n\n self.t = 1\n self.s = 2\n self.e = 3\n self.w = 4\n self.n = 5\n self.b = 6\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def __init__(self, t, s, e, w, n, b):\n\n self.t = t\n self.s = s\n self.e = e\n self.w = w\n self.n = n\n self.b = b\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def rot(self, way):\n if way == 0:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.n,\n self.t,\n self.e,\n self.w,\n self.b,\n self.s,\n )\n elif way == 1:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.s,\n self.b,\n self.e,\n self.w,\n self.t,\n self.n,\n )\n elif way == 2:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.w,\n self.s,\n self.t,\n self.b,\n self.n,\n self.e,\n )\n elif way == 3:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.e,\n self.s,\n self.b,\n self.t,\n self.n,\n self.w,\n )\n\n\ndef main():\n import random\n\n t1, s1, e1, w1, n1, b1 = list(map(int, input().split()))\n t2, s2, e2, w2, n2, b2 = list(map(int, input().split()))\n dice1 = Dice(t1, s1, e1, w1, n1, b1)\n dice2 = Dice(t2, s2, e2, w2, n2, b2)\n flag = 0\n for _ in range(10000):\n if (dice1.t, dice1.s, dice1.e, dice1.w, dice1.n, dice1.b) == (\n dice2.t,\n dice2.s,\n dice2.e,\n dice2.w,\n dice2.n,\n dice2.b,\n ):\n flag = 1\n break\n else:\n seed = random.randint(0, 3)\n dice2.rot(seed)\n if flag == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\n\nclass Die:\n def __init__(self, pips):\n self.pips = pips\n\n def move_die(self, direction):\n if direction == \"N\":\n tmp = self.pips[0]\n self.pips[0] = self.pips[1]\n self.pips[1] = self.pips[5]\n self.pips[5] = self.pips[4]\n self.pips[4] = tmp\n del tmp\n elif direction == \"S\":\n tmp = self.pips[0]\n self.pips[0] = self.pips[4]\n self.pips[4] = self.pips[5]\n self.pips[5] = self.pips[1]\n self.pips[1] = tmp\n del tmp\n elif direction == \"E\":\n tmp = self.pips[0]\n self.pips[0] = self.pips[3]\n self.pips[3] = self.pips[5]\n self.pips[5] = self.pips[2]\n self.pips[2] = tmp\n del tmp\n elif direction == \"W\":\n tmp = self.pips[0]\n self.pips[0] = self.pips[2]\n self.pips[2] = self.pips[5]\n self.pips[5] = self.pips[3]\n self.pips[3] = tmp\n del tmp\n\n def spin_die_clockwise(self):\n tmp = self.pips[1]\n self.pips[1] = self.pips[2]\n self.pips[2] = self.pips[4]\n self.pips[4] = self.pips[3]\n self.pips[3] = tmp\n del tmp\n\n\ndef init_die():\n pips = [int(pip) for pip in sys.stdin.readline().strip(\"\\n\").split()]\n die = Die(pips)\n return die\n\n\ndef roll_die(die):\n directions = list(sys.stdin.readline().strip(\"\\n\"))\n for direction in directions:\n die.move_die(direction)\n return die\n\n\ndef question_rightside(die):\n q = int(sys.stdin.readline().strip(\"\\n\"))\n for question in range(q):\n q_pips = [int(pip) for pip in sys.stdin.readline().strip(\"\\n\").split()]\n if q_pips[0] == die.pips[1]:\n die.move_die(\"N\")\n elif q_pips[0] == die.pips[2]:\n die.move_die(\"W\")\n elif q_pips[0] == die.pips[3]:\n die.move_die(\"E\")\n elif q_pips[0] == die.pips[4]:\n die.move_die(\"S\")\n elif q_pips[0] == die.pips[5]:\n die.move_die(\"N\")\n die.move_die(\"N\")\n while die.pips[1] != q_pips[1]:\n die.spin_die_clockwise()\n print((die.pips[2]))\n\n\ndef main():\n die1 = init_die()\n die2 = init_die()\n if sorted(die1.pips) != sorted(die2.pips):\n print(\"No\")\n else:\n for idx, pip in enumerate(die2.pips):\n for spin in range(4):\n if die1.pips == die2.pips:\n print(\"Yes\")\n sys.exit(0)\n else:\n die1.spin_die_clockwise()\n if idx in {0, 1, 2}:\n die1.move_die(\"N\")\n if idx in {3}:\n die1.move_die(\"N\")\n die1.move_die(\"E\")\n if idx in {4}:\n die1.move_die(\"E\")\n die1.move_die(\"E\")\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 3599802039, "fast_time": 212264086, "speedup": 16.9591, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_6"} +{"pair_id": "python_1558", "problem_id": "p02990", "language": "python", "slow_code": "from math import factorial\n\nN, K = [int(_) for _ in input().split()]\n\nMOD = 10**9 + 7\nkaijo = [0] * (N + 1)\nkaijo[0] = kaijo[1] = 1\nfor i in range(2, N + 1):\n kaijo[i] = (kaijo[i - 1] * i) % MOD\ngyaku = [0] * (N + 1)\ngyaku[0] = gyaku[1] = 1\nfor i in range(2, N + 1):\n\n gyaku[i] = pow(kaijo[i], MOD - 2, MOD)\n\n\ndef calc(n, k):\n\n return factorial(n) // (factorial(n - k) * factorial(k))\n\n\ndef solve():\n for i in range(1, K + 1):\n n = N - K + 1\n k = i\n if k <= n:\n print(((calc(n, k) * calc(K - 1, i - 1)) % MOD))\n else:\n print((0))\n\n\nsolve()\n", "fast_code": "from operator import mul\nfrom functools import reduce\n\nN, K = list(map(int, input().split()))\n\n\ndef cmb(n, r):\n if n < r:\n return 0\n r = min(r, n - r)\n if r == 0:\n return 1\n upper = reduce(mul, list(range(n, n - r, -1)))\n under = reduce(mul, list(range(1, r + 1)))\n return upper // under % INF\n\n\nINF = 10**9 + 7\nfor i in range(1, K + 1):\n ret = cmb(N - K + 1, i) * cmb(K - 1, i - 1)\n print((ret % INF))\n", "slow_time": 317255639, "fast_time": 41694555, "speedup": 7.609, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_18"} +{"pair_id": "python_18293", "problem_id": "p03209", "language": "python", "slow_code": "N, X = list(map(int, input().split()))\nb_len = [1]\nfor i in range(1, 55):\n b_len += [b_len[i - 1] * 2 + 3]\nt = [0, 1, 2, 3, 3]\ndp = {}\n\n\ndef solve(N, X):\n if dp.get((N, X), -1) != -1:\n return dp[(N, X)]\n elif N == 0:\n return 1\n elif N == 1:\n if X > 5:\n dp[(N, X)] = t[4]\n return t[4]\n else:\n dp[(N, X)] = t[X - 1]\n return t[X - 1]\n elif X <= b_len[N - 1] + 1:\n dp[(N, X)] = solve(N - 1, X - 1)\n return solve(N - 1, X - 1)\n elif X == b_len[N - 1] + 2:\n dp[(N, X)] = solve(N - 1, b_len[N - 1]) + 1\n return solve(N - 1, b_len[N - 1]) + 1\n else:\n dp[(N, X)] = solve(N - 1, b_len[N - 1]) + 1 + solve(N - 1, X - b_len[N - 1] - 2)\n return solve(N - 1, b_len[N - 1]) + 1 + solve(N - 1, X - b_len[N - 1] - 2)\n\n\nif N == 50 and X == 4321098765432109:\n print((2160549382716056))\nelse:\n print((solve(N, X)))\n", "fast_code": "def f(v, i):\n s, n = 4 * 2**v - 3, 2 * 2**v - 1\n m = s / 2 + 1\n return (\n 0\n if (i < 1) + (i > s)\n else [0, f(v - 1, i - 1), n / 2 + 1, f(v - 1, i - m) + n / 2 + 1, n, 1][\n (i > 1) + (i >= m) + (i > m) + (i >= s) + (v == 0) * 3\n ]\n )\n\n\nprint(f(*list(map(int, input().split()))))\n", "slow_time": 102572085, "fast_time": 30427807, "speedup": 3.371, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_5"} +{"pair_id": "python_14223", "problem_id": "p00458", "language": "python", "slow_code": "def solve():\n while True:\n m, n = int(eval(input())), int(eval(input()))\n if not m:\n break\n ices = [[0] + list(map(int, input().split())) + [0] for _ in range(n)]\n ices.insert(\n 0,\n [0] * (m + 2),\n )\n ices.append([0] * (m + 2))\n score = [[0] * (m + 2) for _ in range(n + 2)]\n for x in range(1, n + 1):\n for y in range(1, m + 1):\n if ices[x][y]:\n score[x][y] += (\n ices[x - 1][y]\n + ices[x + 1][y]\n + ices[x][y - 1]\n + ices[x][y + 1]\n )\n\n def bfs(x, y, imap, acc):\n imap[x][y] = 0\n acc += 1\n a = b = c = d = 0\n if imap[x - 1][y]:\n a = bfs(x - 1, y, imap, acc)\n if imap[x + 1][y]:\n b = bfs(x + 1, y, imap, acc)\n if imap[x][y - 1]:\n c = bfs(x, y - 1, imap, acc)\n if imap[x][y + 1]:\n d = bfs(x, y + 1, imap, acc)\n imap[x][y] = 1\n return max(acc, a, b, c, d)\n\n ans = 0\n for x in range(1, n + 1):\n for y in range(1, m + 1):\n if score[x][y] in [1, 2]:\n a = bfs(x, y, ices, 0)\n if ans < a:\n ans = a\n print(ans)\n\n\nsolve()\n", "fast_code": "def s():\n def b(M, x, y, n=0):\n if M[x][y] == 0:\n return n\n M[x][y] = 0\n a = max(\n b(M, x - 1, y, n + 1),\n b(M, x, y - 1, n + 1),\n b(M, x + 1, y, n + 1),\n b(M, x, y + 1, n + 1),\n )\n M[x][y] = 1\n return a\n\n for e in iter(input, \"0\"):\n n, m = int(e), int(eval(input()))\n P = [[0] * (n + 2) for _ in [0] * (m + 2)]\n for i in range(m):\n P[i + 1][1:-1] = list(map(int, input().split()))\n print((max(b(P, i, j) for i in range(1, m + 1) for j in range(1, n + 1))))\n\n\nif \"__main__\" == __name__:\n s()\n", "slow_time": 146369703, "fast_time": 71978737, "speedup": 2.0335, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_5"} +{"pair_id": "python_13128", "problem_id": "p02783", "language": "python", "slow_code": "H, A = list(map(int, input().split()))\ncnt = 0\nwhile H > 0:\n H -= A\n cnt += 1\nprint(cnt)\n", "fast_code": "from collections import Counter\n\n\ndef inputlist():\n return [int(j) for j in input().split()]\n\n\nH, A = inputlist()\nd = H // A\nm = H % A\nif m != 0:\n d += 1\nprint(d)\n", "slow_time": 203734224, "fast_time": 18392001, "speedup": 11.0773, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_17"} +{"pair_id": "python_12235", "problem_id": "p00008", "language": "python", "slow_code": "import sys\n\nt = [0 for i in range(10000)]\nc = 0\nfor i in range(10):\n for j in range(10):\n for k in range(10):\n for l in range(10):\n t[c] = i + j + k + l\n c += 1\nfor line in sys.stdin:\n print((t.count(int(line))))\n", "fast_code": "while True:\n try:\n n = int(eval(input()))\n cnt = 0\n for a in range(10):\n for b in range(10):\n for c in range(10):\n d = n - (a + b + c)\n if 0 <= d <= 9:\n cnt += 1\n print(cnt)\n except EOFError:\n break\n", "slow_time": 1332608454, "fast_time": 210429027, "speedup": 6.3328, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_13"} +{"pair_id": "python_16522", "problem_id": "p03274", "language": "python", "slow_code": "import bisect\n\n\ndef main():\n N, K = list(map(int, input().split()))\n x = [int(ele) for ele in input().split()]\n o = bisect.bisect_right(x, 0)\n top = min(o + K, N)\n bottom = max(o - K, 0)\n best = 999999999999\n for i in range(K):\n if top < bottom + i + K:\n break\n if x[bottom + i + K - 1] < 0:\n best = min(best, abs(x[bottom + i]))\n elif x[bottom + i] < 0 <= x[bottom + i + K - 1]:\n ans1 = 2 * min(abs(x[bottom + i]), x[bottom + i + K - 1])\n ans2 = max(abs(x[bottom + i]), x[bottom + i + K - 1])\n ans = min(best, ans1 + ans2)\n best = min(best, ans)\n elif 0 <= x[bottom + i]:\n best = min(best, x[bottom + i + K - 1])\n print(best)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N, K = list(map(int, input().split()))\nx = list(map(int, input().split()))\nassert len(x) == N\nm = min(b - a + min(abs(a), abs(b)) for a, b in zip(x, x[K - 1 :]))\nprint(m)\n", "slow_time": 73062352, "fast_time": 27075235, "speedup": 2.6985, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_16"} +{"pair_id": "python_4587", "problem_id": "p04015", "language": "python", "slow_code": "N, A = list(map(int, input().split()))\nX = list([int(x) - A for x in input().split()])\nX_MAX = max(max(X), -min(X))\nNX = N * X_MAX\ndp = [[[0] * (N + 1) for i in range(N + 1)] for _ in range(NX * 2 + 1)]\ndp[NX][0][0] = 1\nfor i in range(1, N + 1):\n for j in range(0, i + 1):\n for k in range(NX * 2 + 1):\n if k == NX and j == 0:\n dp[k][i][j] = 1\n continue\n dp[k][i][j] += dp[k][i - 1][j]\n if 0 <= k - X[i - 1] < NX * 2 + 1:\n dp[k][i][j] += dp[k - X[i - 1]][i - 1][j - 1]\nprint((sum(dp[NX][N]) - 1))\n", "fast_code": "from collections import defaultdict\n\nN, A = list(map(int, input().split()))\nX = [int(s) - A for s in input().split()]\ncounter = defaultdict(int)\ncounter[0] = 1\nfor x in X:\n for d, c in list(counter.items()):\n counter[d + x] += c\nprint((counter[0] - 1))\n", "slow_time": 9178896384, "fast_time": 35602722, "speedup": 257.8145, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_22"} +{"pair_id": "python_5072", "problem_id": "p03292", "language": "python", "slow_code": "a, b, c = list(map(int, input().split()))\nans = 9999\nans = min(ans, abs(a - b) + abs(b - c), abs(a - c) + abs(c - b))\nans = min(ans, abs(b - a) + abs(a - c), abs(b - c) + abs(c - a))\nans = min(ans, abs(c - a) + abs(a - b), abs(c - b) + abs(b - a))\nprint(ans)\n", "fast_code": "a, b, c = sorted(map(int, input().split()))\nans = c - a\nprint(ans)\n", "slow_time": 33306774, "fast_time": 10659692, "speedup": 3.1246, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_8"} +{"pair_id": "python_14611", "problem_id": "p01314", "language": "python", "slow_code": "if __name__ == \"__main__\":\n while True:\n n = int(eval(input()))\n if n == 0:\n break\n nline = [i for i in range(1, n + 1)]\n count = 0\n for i in range(n):\n for j in range(i + 1, n):\n if sum(nline[i:j]) > n:\n break\n if sum(nline[i:j]) == n:\n count += 1\n print(count)\n", "fast_code": "import math\n\nwhile 1:\n n = int(input())\n if not n:\n break\n ans = 0\n for p in range(1, int(math.sqrt(2 * n)) + 1):\n if 2 * n % p == 0:\n q = 2 * n / p\n if p > 1 and (p + q) % 2:\n ans += 1\n print(ans)\n", "slow_time": 246187152, "fast_time": 26824701, "speedup": 9.1776, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_1"} +{"pair_id": "python_6719", "problem_id": "p00501", "language": "python", "slow_code": "n = eval(input())\ns = input()\ncnt = 0\nfor i in range(n):\n judge = False\n p = input()\n for k in range(len(p)):\n if judge:\n break\n for j in range(1, len(p)):\n if judge:\n break\n for l in range(len(s)):\n if k + l * j < len(p) and p[k + l * j] == s[l]:\n if l + 1 >= len(s):\n judge = True\n continue\n break\n if judge == True:\n cnt += 1\nprint(cnt)\n", "fast_code": "n = eval(input())\na = input()\nla = len(a)\ncount = 0\nfor r in range(n):\n b = input()\n lb = len(b)\n flag = 0\n for skip in range(lb):\n for ini in range(lb - (skip + 1) * (la - 1)):\n if b[ini : ini + (skip + 1) * la : skip + 1] == a:\n count += 1\n flag = 1\n break\n if flag == 1:\n break\nprint(count)\n", "slow_time": 95723413, "fast_time": 45397323, "speedup": 2.1086, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_5"} +{"pair_id": "python_6500", "problem_id": "p03332", "language": "python", "slow_code": "MAX = 3 * 10**5 + 100\nMOD = 998244353\nfact = [0] * MAX\ninv = [0] * MAX\nfinv = [0] * MAX\nfact[0] = 1\nfact[1] = 1\nfinv[0] = 1\nfinv[1] = 1\ninv[1] = 1\nfor i in range(2, MAX):\n fact[i] = fact[i - 1] * i % MOD\n inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD\n finv[i] = finv[i - 1] * inv[i] % MOD\n\n\ndef C(n, r):\n if n < r:\n return 0\n if n < 0 or r < 0:\n return 0\n return fact[n] * (finv[r] * finv[n - r] % MOD) % MOD\n\n\nN, A, B, K = list(map(int, input().split()))\nans = 0\nfor i in range(N + 1):\n if (K - A * i) % B == 0:\n j = (K - A * i) // B\n ans += C(N, i) * C(N, j)\n ans %= MOD\nprint(ans)\n", "fast_code": "n, a, b, k = list(map(int, input().split()))\nmod = 998244353\nimport math\n\n\ndef lcm(x, y):\n return (x * y) // math.gcd(x, y)\n\n\ng = math.gcd(a, b)\nif k % g != 0:\n print((0))\n exit()\nk //= g\na //= g\nb //= g\n\n\ndef cmb(n, r, mod):\n if r < 0 or r > n:\n return 0\n r = min(r, n - r)\n return g1[n] * g2[r] * g2[n - r] % mod\n\n\ng1 = [1, 1]\ng2 = [1, 1]\ninverse = [0, 1]\nfor i in range(2, n + 1):\n g1.append((g1[-1] * i) % mod)\n inverse.append((-inverse[mod % i] * (mod // i)) % mod)\n g2.append((g2[-1] * inverse[-1]) % mod)\n\n\ndef func(na, nb):\n ret = 1\n ret *= cmb(n, na, mod)\n ret %= mod\n ret *= cmb(n, nb, mod)\n ret %= mod\n return ret\n\n\ndef func0(na, nb):\n ret = 0\n if na < nb:\n na, nb = nb, na\n for nc in range(min(nb, n) + 1):\n\n reti = 1\n if 0 <= nc <= n and 0 <= na - nc <= n and 0 <= nb - nc <= n:\n reti *= g1[n]\n reti %= mod\n reti *= g2[nc]\n reti %= mod\n reti *= g2[na - nc]\n reti %= mod\n reti *= g2[nb - nc]\n reti %= mod\n reti *= g2[n + nc - na - nb]\n reti %= mod\n ret += reti\n return ret\n\n\npat = []\nfor i in range(1 + k // a):\n if (k - a * i) % b == 0:\n pat.append([i, (k - a * i) // b])\n break\nna = pat[0][0]\nnb = pat[0][1]\nwhile nb - a >= 0:\n na += b\n nb -= a\n pat.append([na, nb])\nans = 0\nfor na, nb in pat:\n if na > n or nb > n:\n continue\n ans += func(na, nb)\n ans %= mod\nprint(ans)\n", "slow_time": 57115360349, "fast_time": 7371203344, "speedup": 7.7484, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_10"} +{"pair_id": "python_7996", "problem_id": "p02708", "language": "python", "slow_code": "N, K = list(map(int, input().split()))\nS1 = 0\nS2 = 0\nfor k in range(1, N + 1):\n S1 += k * N - k * (k - 1) + 1\n S1 %= 10**9 + 7\nfor k in range(1, K):\n S2 += k * N - k * (k - 1) + 1\n S2 %= 10**9 + 7\nS = S1 - S2 + 1\nS %= 10**9 + 7\nprint(S)\n", "fast_code": "MOD = 10**9 + 7\nN, K = list(map(int, input().split()))\ns = 0\nfor k in range(K, N + 2):\n s = (s + N * k - k * k + k + 1) % MOD\nprint(s)\n", "slow_time": 7054133779, "fast_time": 1517680994, "speedup": 4.648, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_9"} +{"pair_id": "python_18329", "problem_id": "p03209", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\nsys.setrecursionlimit(10**5)\n\n\ndef li():\n return list(map(int, stdin.readline().split()))\n\n\ndef li_():\n return [int(x) - 1 for x in stdin.readline().split()]\n\n\ndef lf():\n return list(map(float, stdin.readline().split()))\n\n\ndef ls():\n return stdin.readline().split()\n\n\ndef ns():\n return stdin.readline().rstrip()\n\n\ndef lc():\n return list(ns())\n\n\ndef ni():\n return int(stdin.readline())\n\n\ndef nf():\n return float(stdin.readline())\n\n\nn, x = li()\ntop = [4 * pow(2, i) - 3 for i in range(n + 1)]\nmed = [pow(2, i + 1) - 1 for i in range(n + 1)]\nbot = [1 for _ in range(n + 1)]\n\n\ndef findPattyNum(level: int, lay: int):\n if level == 0 and lay == 1:\n return 1\n if lay == 4 * pow(2, level) - 3:\n return pow(2, level + 1) - 1\n elif pow(2, level + 1) - 1 < lay < 4 * pow(2, level) - 3:\n return pow(2, level) + findPattyNum(level - 1, lay - (pow(2, level + 1) - 1))\n elif lay == pow(2, level + 1) - 1:\n return pow(2, level)\n elif 1 < lay < pow(2, level + 1) - 1:\n return findPattyNum(level - 1, lay - 1)\n elif lay == 1:\n return 0\n\n\nprint((findPattyNum(n, x)))\n", "fast_code": "def count_patties(L, x):\n if L == 0:\n return 0 if x <= 0 else 1\n if x <= total_layers[L - 1] + 1:\n return count_patties(L - 1, x - 1)\n else:\n return (\n count_patties(L - 1, x - total_layers[L - 1] - 2) + 1 + total_patties[L - 1]\n )\n\n\nN, X = list(map(int, input().split()))\ntotal_layers = [2 ** (i + 2) - 3 for i in range(51)]\ntotal_patties = [2 ** (i + 1) - 1 for i in range(51)]\nprint((count_patties(N, X)))\n", "slow_time": 97166564, "fast_time": 39296206, "speedup": 2.4727, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_26"} +{"pair_id": "python_14896", "problem_id": "p03212", "language": "python", "slow_code": "import itertools\n\nn = int(eval(input()))\nc = 0\nfor i in range(len(str(n)) + 1):\n for j in list(itertools.product((3, 5, 7), repeat=i)):\n if (3 in j) and (5 in j) and (7 in j):\n if n >= int((\"\".join(list(map(str, j))))):\n c += 1\nprint(c)\n", "fast_code": "N = int(eval(input()))\n\n\ndef dfs(cur, use, cnt):\n if cur > N:\n return\n if use == 0b111:\n cnt.append(1)\n dfs(cur * 10 + 7, use | 0b001, cnt)\n dfs(cur * 10 + 5, use | 0b010, cnt)\n dfs(cur * 10 + 3, use | 0b100, cnt)\n\n\nres = []\ndfs(0, 0, res)\nprint((sum(res)))\n", "slow_time": 6466466009, "fast_time": 859755472, "speedup": 7.5213, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_28"} +{"pair_id": "python_1576", "problem_id": "p02990", "language": "python", "slow_code": "N_MAX = 10**6\nMOD = 10**9 + 7\nfac, finv, inv = [0] * N_MAX, [0] * N_MAX, [0] * N_MAX\n\n\ndef com_init():\n fac[0], fac[1] = 1, 1\n finv[0], finv[1] = 1, 1\n inv[1] = 1\n for i in range(2, N_MAX):\n fac[i] = fac[i - 1] * i % MOD\n inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD\n finv[i] = finv[i - 1] * inv[i] % MOD\n\n\ndef com(n, k):\n if n < k:\n return 0\n if n < 0 or k < 0:\n return 0\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD\n\n\nn, k = list(map(int, input().split()))\nr = n - k\ncom_init()\nfor i in range(1, k + 1):\n ans = 0\n bi = com(k + i - 1 - i, i - 1)\n if i == 1:\n if r == 0:\n ri_m1 = 1\n else:\n ri_m1 = 0\n else:\n ri_m1 = com(r + i - 2 - (i - 1), i - 2)\n ri = com(r + i - 1 - i, i - 1) if r >= i else 0\n ri_p1 = com(r + i - (i + 1), i) if r >= i + 1 else 0\n ans += bi * ri_m1\n ans += bi * ri * 2\n ans += bi * ri_p1\n ans %= MOD\n print(ans)\n", "fast_code": "import sys\n\n\nfrom functools import reduce\nimport operator as op\n\n\ndef nCr(n, r):\n r = min(r, n - r)\n upper = reduce(op.mul, list(range(n, n - r, -1)), 1)\n lower = reduce(op.mul, list(range(r, 0, -1)), 1)\n return upper // lower\n\n\nmod = 10**9 + 7\n\n\ndef main():\n n, k = [int(x) for x in sys.stdin.readline().split()]\n for i in range(1, k + 1):\n if i <= n - k + 1:\n print((nCr(n - k + 1, i) * nCr(k - 1, i - 1) % mod))\n else:\n print((0))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 163370548699, "fast_time": 50391842, "speedup": 3242.0039, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_28"} +{"pair_id": "python_12509", "problem_id": "p03674", "language": "python", "slow_code": "class ModComb:\n def __init__(self, MAX, mod=10**9 + 7):\n fac = [1, 1]\n finv = [1, 1]\n inv = [0, 1]\n for i in range(2, MAX):\n fac.append(fac[i - 1] * i % mod)\n inv.append(mod - inv[mod % i] * (mod // i) % mod)\n finv.append(finv[i - 1] * inv[i] % mod)\n self.fac, self.finv, self.mod = fac, finv, mod\n\n def nCk(self, n, k):\n if n < k or n < 0 or k < 0:\n return 0\n fac, finv, mod = self.fac, self.finv, self.mod\n return fac[n] * (finv[k] * finv[n - k] % mod) % mod\n\n\nmod = 10**9 + 7\nN, *A = list(map(int, open(0).read().split()))\nmc = ModComb(210000, mod=mod)\nused = {}\nleft, right = 0, 0\nfor i, a in enumerate(A):\n if a in used:\n right = i\n left = used[a]\n break\n used[a] = i\nm = left + N - right\nfor k in range(1, N + 2):\n print(((mc.nCk(N + 1, k) - mc.nCk(m, k - 1)) % mod))\n", "fast_code": "from collections import Counter\n\n\nclass Mint:\n MOD = 1000000007\n CACHE_FACTORIALS = [1, 1]\n\n def __init__(self, v):\n if self.__isally(v):\n self.v = v.v % self.MOD\n else:\n self.v = v % self.MOD\n\n @property\n def inv(self):\n return Mint(self.__minv(self.v))\n\n @classmethod\n def factorial(cls, v):\n for i in range(len(cls.CACHE_FACTORIALS), int(v) + 1):\n cls.CACHE_FACTORIALS.append(cls.CACHE_FACTORIALS[-1] * i % cls.MOD)\n return Mint(cls.CACHE_FACTORIALS[int(v)])\n\n @classmethod\n def perm(cls, n, r):\n if n < r or r < 0:\n return 0\n return cls.factorial(n) // cls.factorial(n - r)\n\n @classmethod\n def comb(cls, n, r):\n if n < r or r < 0:\n return 0\n return cls.perm(n, r) // cls.factorial(r)\n\n @classmethod\n def __isally(cls, v) -> bool:\n return isinstance(v, cls)\n\n @classmethod\n def __minv(cls, v) -> int:\n return pow(v, cls.MOD - 2, cls.MOD)\n\n @classmethod\n def __mpow(cls, v, w) -> int:\n return pow(v, w, cls.MOD)\n\n def __str__(self):\n return str(self.v)\n\n __repr__ = __str__\n\n def __int__(self):\n return self.v\n\n def __eq__(self, w):\n return self.v == w.v if self.__isally(w) else self.v == w\n\n def __add__(self, w):\n return Mint(self.v + w.v) if self.__isally(w) else Mint(self.v + w)\n\n __radd__ = __add__\n\n def __sub__(self, w):\n return Mint(self.v - w.v) if self.__isally(w) else Mint(self.v - w)\n\n def __rsub__(self, u):\n return Mint(u.v - self.v) if self.__isally(u) else Mint(u - self.v)\n\n def __mul__(self, w):\n return Mint(self.v * w.v) if self.__isally(w) else Mint(self.v * w)\n\n __rmul__ = __mul__\n\n def __floordiv__(self, w):\n return (\n Mint(self.v * self.__minv(w.v))\n if self.__isally(w)\n else Mint(self.v * self.__minv(w))\n )\n\n def __rfloordiv__(self, u):\n return (\n Mint(u.v * self.__minv(self.v))\n if self.__isally(u)\n else Mint(u * self.__minv(self.v))\n )\n\n def __pow__(self, w):\n return (\n Mint(self.__mpow(self.v, w.v))\n if self.__isally(w)\n else Mint(self.__mpow(self.v, w))\n )\n\n def __rpow__(self, u):\n return (\n Mint(self.__mpow(u.v, self.v))\n if self.__isally(u)\n else Mint(self.__mpow(u, self.v))\n )\n\n\nN = int(input())\nA = [int(s) for s in input().split()]\nv = Counter(A).most_common(1)[0][0]\ni = A.index(v)\nj = A.index(v, i + 1)\nl = i\nm = j - i - 1\nn = N - j\nfor k in range(1, N + 2):\n ans = (\n Mint.comb(l + m + n, k)\n + Mint.comb(l + m + n, k - 1) * 2\n - Mint.comb(l + n, k - 1)\n + Mint.comb(l + m + n, k - 2)\n )\n print(ans)\n", "slow_time": 20922270310, "fast_time": 149254404, "speedup": 140.1786, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_18"} +{"pair_id": "python_7048", "problem_id": "p02732", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10000000)\n\ndxdy = ((1, 0), (0, 1))\n\n\ndef pin(type=int):\n return list(map(type, input().rstrip().split()))\n\n\ndef resolve():\n (N,) = pin()\n A = list(pin())\n from collections import Counter as ct\n\n a = ct(A)\n t = list(a.items())\n\n Sum = 0\n for l in list(a.values()):\n Sum += (l * (l - 1)) // 2\n ans = [0] * N\n for j in list(a.items()):\n x, y = j\n ans[x - 1] = Sum - ((y * (y - 1)) // 2) + (((y - 2) * (y - 1)) // 2)\n for i in A:\n print((ans[i - 1]))\n\n\n\"\"\"\"\"\"\n\"\"\"\"\"\"\nimport sys\nfrom io import StringIO\nimport unittest\n\n\nclass TestClass(unittest.TestCase):\n def assertIO(self, input, output):\n stdout, stdin = sys.stdout, sys.stdin\n sys.stdout, sys.stdin = StringIO(), StringIO(input)\n resolve()\n sys.stdout.seek(0)\n out = sys.stdout.read()[:-1]\n sys.stdout, sys.stdin = stdout, stdin\n self.assertEqual(out, output)\n\n def test_入力例_1(self):\n input = \"\"\"\"\"\"\n output = \"\"\"\"\"\"\n self.assertIO(input, output)\n\n def test_入力例_2(self):\n input = \"\"\"\"\"\"\n output = \"\"\"\"\"\"\n self.assertIO(input, output)\n\n def test_入力例_3(self):\n input = \"\"\"\"\"\"\n output = \"\"\"\"\"\"\n self.assertIO(input, output)\n\n def test_入力例_4(self):\n input = \"\"\"\"\"\"\n output = \"\"\"\"\"\"\n self.assertIO(input, output)\n\n\nif __name__ == \"__main__\":\n resolve()\n", "fast_code": "n = int(eval(input()))\na = list(map(int, input().split()))\nnums = [0] * (n + 1)\nfor i in a:\n nums[i] += 1\nt = 0\nfor i in nums:\n t += i * (i - 1) // 2\nfor i in a:\n print((t + 1 - nums[i]))\n", "slow_time": 147049361, "fast_time": 29002282, "speedup": 5.0703, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_13"} +{"pair_id": "python_16148", "problem_id": "p03317", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef I():\n return int(eval(input()))\n\n\ndef LS():\n return input().split()\n\n\ndef S():\n return eval(input())\n\n\ndef main():\n a, b = LI()\n l = LI()\n c = 1\n _b = b\n while True:\n if a <= _b:\n break\n else:\n _b += b - 1\n c += 1\n return c\n\n\nprint((main()))\n", "fast_code": "N, K = [int(i) for i in input().split()]\nprint(((N - K) // (K - 1) + 1 if (N - K) % (K - 1) == 0 else (N - K) // (K - 1) + 2))\n", "slow_time": 28243298, "fast_time": 10383258, "speedup": 2.7201, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_0"} +{"pair_id": "python_12914", "problem_id": "p03549", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\np = 0.5**M\nq = 1 - p\ni = 0\nsum = 0\nwhile True:\n num = (i + 1) * (100 * (N - M) + 1900 * M) * p * (q**i)\n if num < 10 ** (-6):\n break\n sum += num\n i += 1\nprint((int(sum + 1)))\n", "fast_code": "n, m = list(map(int, input().split()))\nans_time = (n - m) * 100\nans = (2**m) * (1900 * m + ans_time)\nprint(ans)\n", "slow_time": 95463640, "fast_time": 14076626, "speedup": 6.7817, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_11"} +{"pair_id": "python_14025", "problem_id": "p00028", "language": "python", "slow_code": "a = [0] * 100\nwhile 1:\n try:\n n = int(eval(input()))\n a[n - 1] += 1\n except:\n for i in range(100):\n if a[i] == max(a):\n print((i + 1))\n break\n", "fast_code": "import sys\nimport collections\n\nl = []\nfor line in sys.stdin:\n l.append(int(line))\ncounted = collections.Counter(l).most_common()\nmaxv = counted[0][1]\nfor k, v in counted:\n if v == maxv:\n print(k)\n", "slow_time": 117729361, "fast_time": 27719534, "speedup": 4.2472, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_7"} +{"pair_id": "python_15310", "problem_id": "p03775", "language": "python", "slow_code": "n = int(eval(input()))\n\n\ndef cal(a):\n return len(str(a))\n\n\nm = 11\nfor j in range(1, 10**6 + 1):\n if n % j == 0:\n m = min(m, max(cal(j), cal(n // j)))\n\nprint(m)\n", "fast_code": "def F(a, b):\n count = 0\n c = max(a, b)\n while c >= 10:\n c = c / 10\n count += 1\n return count + 1\n\n\nN = int(eval(input()))\nminimum = 15\nfor num in range(1, 10**5 + 1):\n if N % num == 0:\n minimum = min(minimum, F(num, N / num))\nprint(minimum)\n", "slow_time": 51830258874, "fast_time": 5029686345, "speedup": 10.3049, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_15"} +{"pair_id": "python_2723", "problem_id": "p02630", "language": "python", "slow_code": "f = lambda: [*list(map(int, input().split()))]\nf()\ns, *l = [0] * 100002\nfor i in f():\n s += i\n l[i] += 1\nq = f()[0]\nfor _ in range(q):\n b, c = f()\n s += (c - b) * l[b]\n l[c] += l[b]\n l[b] = 0\n print(s)\n", "fast_code": "from collections import Counter\n\nN = int(eval(input()))\nA = list(map(int, input().split()))\nsumA = sum(A)\ndic = Counter(A)\nQ = int(eval(input()))\nfor _ in range(Q):\n b, c = list(map(int, input().split()))\n if b in list(dic.keys()):\n sumA += (c - b) * dic[b]\n\n if c in list(dic.keys()):\n\n dic[c] += dic[b]\n del dic[b]\n else:\n dic[c] = dic[b]\n del dic[b]\n\n print(sumA)\n", "slow_time": 246048618, "fast_time": 55116440, "speedup": 4.4642, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_5"} +{"pair_id": "python_14606", "problem_id": "p00110", "language": "python", "slow_code": "import sys\n\nfor e in sys.stdin:\n for i in \"0123456789\"[\n (e[0] == \"X\") * (e[1] != \"+\") or (\"+X\" in e) * (\"+X=\" not in e) :\n ]:\n l, r = e.replace(\"X\", i).split(\"=\")\n if eval(l) == int(r):\n print(i)\n break\n else:\n print(\"NA\")\n", "fast_code": "import sys\n\np, t = \"+X\"\nfor e in sys.stdin:\n for i in \"0123456789\"[\n (e[0] == t) * (e[1] != p) or (p + t in e) * (\"+X=\" not in e) :\n ]:\n l, r = e.replace(t, i).split(\"=\")\n if sum(map(int, l.split(p))) == int(r):\n print(i)\n break\n else:\n print(\"NA\")\n", "slow_time": 67937378, "fast_time": 33379670, "speedup": 2.0353, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_3"} +{"pair_id": "python_11618", "problem_id": "p02621", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST():\n return list(map(int, input().split()))\n\n\ndef ZIP(n):\n return list(zip(*(MAP() for _ in range(n))))\n\n\ndef main():\n sys.setrecursionlimit(10**8)\n INF = float(\"inf\")\n a = INT()\n print((a + a**2 + a**3))\n return\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\na = I()\nprint((a + a**2 + a**3))\n", "slow_time": 53894386, "fast_time": 12500293, "speedup": 4.3114, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_6"} +{"pair_id": "python_229", "problem_id": "p03240", "language": "python", "slow_code": "N = int(eval(input()))\nXYH = [list(map(int, input().split())) for i in range(N)]\nXYH.sort(key=lambda x: x[2], reverse=1)\nfor Cx in range(101):\n for Cy in range(101):\n H = XYH[0][2] + abs(XYH[0][0] - Cx) + abs(XYH[0][1] - Cy)\n cnt = 0\n for X, Y, h in XYH:\n if h == max(H - abs(X - Cx) - abs(Y - Cy), 0):\n cnt += 1\n if cnt == N:\n print((Cx, Cy, H))\n break\n", "fast_code": "import numpy as np\n\nN = int(eval(input()))\nx, y, h = np.array([list(map(int, input().split())) for i in range(N)]).T\n\"\"\"\"\"\"\nH = 0\nCx = 0\nCy = 0\nFlag = True\nfor i in range(101):\n for j in range(101):\n Flag = True\n for k in range(N):\n if h[k] != 0:\n H = h[k] + abs(i - x[k]) + abs(j - y[k])\n break\n for k in range(N):\n if h[k] != max(H - abs(i - x[k]) - abs(j - y[k]), 0):\n Flag = False\n break\n if Flag:\n Cx, Cy = i, j\n break\n if Flag:\n break\nprint((\"{} {} {}\".format(Cx, Cy, H)))\n", "slow_time": 9772291562, "fast_time": 2098234704, "speedup": 4.6574, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_6"} +{"pair_id": "python_3242", "problem_id": "p03040", "language": "python", "slow_code": "class Bit:\n def __init__(self, n):\n self.size = n\n self.tree = [0] * (n + 1)\n\n def sum(self, i):\n s = 0\n while i > 0:\n s += self.tree[i]\n i -= i & -i\n return s\n\n def add(self, i, x):\n while i <= self.size:\n self.tree[i] += x\n i += i & -i\n\n\ndef bsearch(mn, mx, func):\n\n idx = (mx + mn) // 2\n while mx - mn > 1:\n if func(idx):\n idx, mn = (idx + mx) // 2, idx\n continue\n idx, mx = (idx + mn) // 2, idx\n return idx\n\n\nimport sys\n\ninput = sys.stdin.readline\n(Q,) = list(map(int, input().split()))\nqs = []\nc = 0\nj = 0\nfor _ in range(Q):\n q = input().split()\n if len(q) == 1:\n c += 1\n else:\n a, b = int(q[1]), int(q[2])\n qs.append((a, b, c, j))\n c = 0\n j += 1\nif c:\n qs.append((a, b, c, j))\nm = j\nqqs = sorted(qs, key=lambda x: x[0])\nj2i = dict()\ni2a = dict()\nfor i, (a, b, c, j) in enumerate(qqs):\n j2i[j] = i + 1\n i2a[i + 1] = a\nm = len(j2i)\nst = Bit(m)\nst_sum = Bit(m)\nasum = bsum = 0\n\n\nfor a, b, c, i in qs:\n if c:\n j = bsearch(0, m + 1, lambda x: st.sum(x) < ci)\n\n for _ in range(c):\n if not i % 2:\n print((i2a[j + 1], -2 * st_sum.sum(j + 1) + asum + bsum))\n else:\n print((i2a[j + 1], -st_sum.sum(j) + (asum - st_sum.sum(j + 1)) + bsum))\n asum += a\n bsum += b\n st.add(j2i[i], 1)\n st_sum.add(j2i[i], a)\n ci = -(-(i + 1) // 2)\n", "fast_code": "from heapq import heappop, heappush\n\nq = int(eval(input()))\nqueries = [list(map(int, input().split())) for _ in range(q)]\nl = []\nr = []\nans = 0\nquecount = 0\nfor query in queries:\n if query[0] == 1:\n quecount += 1\n _, a, b = query\n ans += b\n if quecount == 1:\n mid = a\n elif quecount % 2 == 1:\n if a < -l[0]:\n mid = -heappop(l)\n heappush(l, -a)\n elif r[0] < a:\n mid = heappop(r)\n heappush(r, a)\n else:\n mid = a\n ans += abs(a - mid)\n else:\n ans += abs(a - mid)\n heappush(l, -min(a, mid))\n heappush(r, max(a, mid))\n if query[0] == 2:\n if quecount % 2 == 1:\n ansind = mid\n else:\n ansind = -l[0]\n print((ansind, ans))\n", "slow_time": 154293873, "fast_time": 73481889, "speedup": 2.0998, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_29"} +{"pair_id": "python_8839", "problem_id": "p03371", "language": "python", "slow_code": "A, B, C, X, Y = list(map(int, input().split()))\n\n\nmn = A * X + B * Y\nfor i in range(max(X, Y) + 1):\n mn = min(mn, 2 * i * C + A * max(0, X - i) + B * max(0, Y - i))\nprint(mn)\n", "fast_code": "import math\n\nA, B, C, X, Y = list(map(int, input().split()))\ncost = []\ncost.append(A * X + B * Y)\nfor i in range(2 * min(X, Y), 2 * max(X, Y) + 1):\n cost.append(\n C * i + max(0, math.ceil(X - i / 2) * A) + max(0, math.ceil(Y - i / 2) * B)\n )\nprint((min(cost)))\n", "slow_time": 1090896531, "fast_time": 265456712, "speedup": 4.1095, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_18"} +{"pair_id": "python_6724", "problem_id": "p00775", "language": "python", "slow_code": "while True:\n R, N = list(map(int, input().split()))\n if not (R | N):\n break\n geta = 20\n buildings = [0] * (geta * 2)\n for _ in range(N):\n xl, xr, h = list(map(int, input().split()))\n for i in range(xl + geta, xr + geta):\n buildings[i] = max(buildings[i], h)\n left, right = 0, 20\n for _ in range(100):\n mid = (left + right) / 2\n flag = True\n for i in range(-R + geta, R + geta):\n if i < geta:\n y = pow(R * R - (i - geta + 1) * (i - geta + 1), 0.5)\n flag &= buildings[i] >= y - R + mid\n else:\n y = pow(R * R - (i - geta) * (i - geta), 0.5)\n flag &= buildings[i] >= y - R + mid\n if flag:\n left = mid\n else:\n right = mid\n print((\"{:.20f}\".format(left)))\n", "fast_code": "while True:\n R, N = list(map(int, input().split()))\n if not (R | N):\n break\n geta = 20\n buildings = [0] * (geta * 2)\n for _ in range(N):\n xl, xr, h = list(map(int, input().split()))\n for i in range(xl + geta, xr + geta):\n buildings[i] = max(buildings[i], h)\n print(\n (\n min(\n buildings[i] - pow(R**2 - (i - geta + (i < geta)) ** 2, 0.5) + R\n for i in range(-R + geta, R + geta)\n )\n )\n )\n", "slow_time": 536358030, "fast_time": 65538301, "speedup": 8.1839, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_4"} +{"pair_id": "python_4405", "problem_id": "p03282", "language": "python", "slow_code": "import sys\n\nINF = float(\"inf\")\n\n\ndef solve(S: str, K: int):\n for i in range(K):\n if S[i] != \"1\":\n c = S[i]\n break\n else:\n print((1))\n return\n print(c)\n return\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n\n tokens = iterate_tokens()\n S = str(next(tokens))\n K = int(next(tokens))\n solve(S, K)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "print((input()[: int(eval(input()))].replace(\"1\", \"\")[:1] or \"1\"))\n", "slow_time": 45292501, "fast_time": 12382838, "speedup": 3.6577, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_12"} +{"pair_id": "python_8561", "problem_id": "p02959", "language": "python", "slow_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nans = 0\nfor i in range(N):\n if i % 2 == 0:\n if A[i // 2] >= B[i // 2]:\n A[i // 2] -= B[i // 2]\n ans += B[i // 2]\n B[i // 2] = 0\n else:\n B[i // 2] -= A[i // 2]\n ans += A[i // 2]\n A[i // 2] = 0\n if A[i // 2 + 1] >= B[i // 2]:\n A[i // 2 + 1] -= B[i // 2]\n ans += B[i // 2]\n B[i // 2] = 0\n else:\n B[i // 2] -= A[i // 2 + 1]\n ans += A[i // 2 + 1]\n A[i // 2 + 1] = 0\n else:\n if A[N - i // 2] >= B[N - i // 2 - 1]:\n A[N - i // 2] -= B[N - i // 2 - 1]\n ans += B[N - i // 2 - 1]\n B[N - i // 2 - 1] = 0\n else:\n B[N - i // 2 - 1] -= A[N - i // 2]\n ans += A[N - i // 2]\n A[N - i // 2] = 0\n if A[N - i // 2 - 1] >= B[N - i // 2 - 1]:\n A[N - i // 2 - 1] -= B[N - i // 2 - 1]\n ans += B[N - i // 2 - 1]\n B[N - i // 2 - 1] = 0\n else:\n B[N - i // 2 - 1] -= A[N - i // 2 - 1]\n ans += A[N - i // 2 - 1]\n A[N - i // 2 - 1] = 0\nprint(ans)\n", "fast_code": "R = lambda: list(map(int, input().split()))\neval(input())\na = list(R())\nr = y = 0\nfor u, v, w in zip(R(), a, a[1:]):\n x = min(v - y, u)\n y = min(w, u - x)\n r += x + y\nprint(r)\n", "slow_time": 99337511, "fast_time": 29707189, "speedup": 3.3439, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_20"} +{"pair_id": "python_773", "problem_id": "p02642", "language": "python", "slow_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nM = 10**6 + 5\ncnt = [0 for _ in range(M)]\nfor i in A:\n if cnt[i] != 0:\n cnt[i] = 2\n continue\n j = i\n while j < M:\n cnt[j] += 1\n j += i\nans = 0\nfor i in A:\n if cnt[i] == 1:\n ans += 1\nprint(ans)\n", "fast_code": "n = int(eval(input()))\na = list(map(int, input().split()))\na.sort()\nmax_num = a[-1] + 1\ncnt = [0] * (max_num)\na.sort()\nans = 0\nfor i in a:\n cnt[i] += 1\na = set(a)\nfor k in a:\n for l in range(k * 2, (max_num), k):\n cnt[l] += 1\nfor m in a:\n if cnt[m] == 1:\n ans += 1\nprint(ans)\n", "slow_time": 71347573135, "fast_time": 42221493, "speedup": 1689.8401, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_21"} +{"pair_id": "python_13273", "problem_id": "p03035", "language": "python", "slow_code": "import sys, math, collections, heapq, itertools\n\nF = sys.stdin\n\n\ndef single_input():\n return F.readline().strip(\"\\n\")\n\n\ndef line_input():\n return F.readline().strip(\"\\n\").split()\n\n\ndef gcd(a, b):\n a, b = max(a, b), min(a, b)\n while a % b > 0:\n a, b = b, a % b\n return b\n\n\ndef solve():\n A, B = list(map(int, line_input()))\n if A >= 13:\n print(B)\n elif A >= 6:\n print((B // 2))\n else:\n print((0))\n return 0\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "a, b = list(map(int, input().split()))\nprint((0 if a <= 5 else b if a >= 13 else b // 2))\n", "slow_time": 48276073, "fast_time": 12838937, "speedup": 3.7601, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_13"} +{"pair_id": "python_9693", "problem_id": "p02554", "language": "python", "slow_code": "n = int(eval(input()))\nmod = 1000000007\nans = 10**n - 9**n - 9**n + 8**n\nprint((ans % mod))\n", "fast_code": "N = int(eval(input()))\nMOD_BY = 10**9 + 7\n\n\ndef power_func(a, n, p):\n bi = str(format(n, \"b\"))\n res = 1\n for i in range(len(bi)):\n res = (res * res) % p\n if bi[i] == \"1\":\n res = (res * a) % p\n return res\n\n\na = power_func(10, N, MOD_BY)\nb = power_func(9, N, MOD_BY)\nc = power_func(8, N, MOD_BY)\nans = a - 2 * b + c\nprint((ans % MOD_BY))\n", "slow_time": 5752328587, "fast_time": 42408281, "speedup": 135.6416, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_0"} +{"pair_id": "python_11336", "problem_id": "p03504", "language": "python", "slow_code": "N, C = list(map(int, input().split()))\nsrc = [list(map(int, input().split())) for i in range(N)]\nMAX = 10**5\nbucket = [[] for i in range(MAX + 2)]\nbucket2 = [set() for i in range(MAX + 2)]\nfor s, t, c in src:\n bucket[s].append((t, c))\n bucket2[s].add(c)\nimos = [0] * (MAX + 2)\nfor s in range(MAX):\n for t, c in bucket[s]:\n imos[s - 1] += 1\n if c in bucket2[t]:\n imos[t - 1] -= 1\n else:\n imos[t] -= 1\nans = tmp = 0\nfor im in imos:\n tmp += im\n ans = max(ans, tmp)\nprint(ans)\n", "fast_code": "def inpl():\n return tuple(map(int, input().split()))\n\n\nN, C = inpl()\nP = sorted([inpl() for _ in range(N)])\nR = [[[-1, 0, -1]] for _ in range(30)]\nfor s, t, c in P:\n i = 0\n\n sr = [i for i in range(30) if R[i][-1][2] == c and R[i][-1][1] <= s]\n if sr:\n R[min(sr)].append([s, t, c])\n else:\n r = [i for i in range(30) if R[i][-1][1] <= s - 0.5]\n R[min(r)].append([s, t, c])\nfor i in range(30):\n if len(R[i]) == 1:\n print(i)\n break\nelse:\n print((30))\n", "slow_time": 27841681689, "fast_time": 79922905, "speedup": 348.3567, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_17"} +{"pair_id": "python_16980", "problem_id": "p03291", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(input())\n\n\ndef MAP():\n return map(int, input().split())\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\nS = input()\nN = len(S)\n\ndp = list2d(N + 1, 4, 0)\ndp[0][0] = 1\nfor i in range(N):\n s = S[i]\n for j in range(4):\n\n if s == \"?\":\n\n dp[i + 1][j] += dp[i][j] * 3\n dp[i + 1][j] %= MOD\n else:\n dp[i + 1][j] += dp[i][j]\n dp[i + 1][j] %= MOD\n\n if j < 3:\n\n if (\n s == \"?\"\n or s == \"A\"\n and j == 0\n or s == \"B\"\n and j == 1\n or s == \"C\"\n and j == 2\n ):\n dp[i + 1][j + 1] += dp[i][j]\n dp[i + 1][j + 1] %= MOD\n\nprint(dp[N][3])\n", "fast_code": "s = input().rstrip()\ndp = [0] * 4\ndp[0] = 1\nfor i in range(len(s)):\n if s[i] == \"A\":\n dp[1] += dp[0]\n elif s[i] == \"B\":\n dp[2] += dp[1]\n elif s[i] == \"C\":\n dp[3] += dp[2]\n else:\n dp = [dp[0] * 3, dp[1] * 3 + dp[0], dp[2] * 3 + dp[1], dp[3] * 3 + dp[2]]\n dp = list([x % (10**9 + 7) for x in dp])\nprint((dp[3]))\n", "slow_time": 176285150, "fast_time": 52275918, "speedup": 3.3722, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_22"} +{"pair_id": "python_6313", "problem_id": "p03719", "language": "python", "slow_code": "import functools\nimport os\nimport sys\n\nsys.setrecursionlimit(10000)\nINF = float(\"inf\")\n\n\ndef inp():\n return int(eval(input()))\n\n\ndef inpf():\n return float(eval(input()))\n\n\ndef inps():\n return eval(input())\n\n\ndef inl():\n return list(map(int, input().split()))\n\n\ndef inlf():\n return list(map(float, input().split()))\n\n\ndef inls():\n return input().split()\n\n\ndef inpm(line):\n return [inp() for _ in range(line)]\n\n\ndef inpfm(line):\n return [inpf() for _ in range(line)]\n\n\ndef inpsm(line):\n return [inps() for _ in range(line)]\n\n\ndef inlm(line):\n return [inl() for _ in range(line)]\n\n\ndef inlfm(line):\n return [inlf() for _ in range(line)]\n\n\ndef inlsm(line):\n return [inls() for _ in range(line)]\n\n\ndef Yesif(cond):\n print((\"Yes\" if cond else \"No\"))\n\n\ndef YESIF(cond):\n print((\"YES\" if cond else \"NO\"))\n\n\ndef yesif(cond):\n print((\"yes\" if cond else \"no\"))\n\n\na, b, c = inl()\nYesif(a <= c <= b)\n", "fast_code": "A, B, C = list(map(int, input().split()))\nprint((\"Yes\" if A <= C <= B else \"No\"))\n", "slow_time": 117754251, "fast_time": 12278902, "speedup": 9.59, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_15"} +{"pair_id": "python_6113", "problem_id": "p02619", "language": "python", "slow_code": "import numpy as np\n\nD = int(eval(input()))\nc = [int(i) for i in input().split()]\ns = []\nfor d in range(D):\n s.append([int(i) for i in input().split()])\nt = []\nfor d in range(D):\n t.append(int(eval(input())) - 1)\nv = [0] * D\nlast = [[0 for i in range(26)] for d in range(D)]\nfor d in range(D):\n if d >= 1:\n last[d] = last[d - 1][:]\n last[d][t[d]] = d + 1\nfor d in range(D):\n v[d] = s[d][t[d]] - sum([c[i] * (d + 1 - last[d][i]) for i in range(26)])\nv_sum = 0\nfor d in range(D):\n v_sum += v[d]\n print(v_sum)\n", "fast_code": "(\n d,\n *s,\n) = list(map(int, open(i := 0).read().split()))\nc, *l = [0] * 27\nfor v in s[-d:]:\n i += 1\n l[v - 1] = i\n print((c := c + s[i * 26 + v - 1] - sum(x * (i - y) for x, y in zip(s, l))))\n", "slow_time": 109161456, "fast_time": 54119008, "speedup": 2.0171, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_8"} +{"pair_id": "python_5175", "problem_id": "p03734", "language": "python", "slow_code": "N, W = list(map(int, input().split()))\nwvs = []\nfor i in range(N):\n w, v = list(map(int, input().split()))\n wvs.append((w, v))\n\nw0 = wvs[0][0]\ndp = [[[-1] * (330) for i in range(110)] for k in range(110)]\ndp[0][0][0] = 0\nfor i in range(N):\n w, v = wvs[i]\n dw = w - w0\n for j in range(i + 1):\n for k in range(310):\n\n if dp[i][j][j] == -1:\n continue\n dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k])\n dp[i + 1][j + 1][k + dw] = max(dp[i][j][k] + v, dp[i + 1][j + 1][k + dw])\nd = dp[N]\nans = 0\nfor j in range(N + 1):\n if W - j * w0 >= 0:\n a = max(d[j][: W - j * w0 + 1])\n ans = max(ans, a)\nprint(ans)\n", "fast_code": "N, W = list(map(int, input().split()))\nA = [list(map(int, input().split())) for _ in range(N)]\nw1 = A[0][0]\nC = {0: [], 1: [], 2: [], 3: []}\nfor i in range(N):\n w, v = A[i]\n C[w - w1].append(v)\nC[0] = sorted(C[0], reverse=True)\nC[1] = sorted(C[1], reverse=True)\nC[2] = sorted(C[2], reverse=True)\nC[3] = sorted(C[3], reverse=True)\nn0 = len(C[0])\nn1 = len(C[1])\nn2 = len(C[2])\nn3 = len(C[3])\nvmax = 0\nfor a0 in range(n0 + 1):\n for a1 in range(n1 + 1):\n for a2 in range(n2 + 1):\n for a3 in range(n3 + 1):\n if a0 * w1 + a1 * (w1 + 1) + a2 * (w1 + 2) + a3 * (w1 + 3) <= W:\n v = (\n sum(C[0][:a0])\n + sum(C[1][:a1])\n + sum(C[2][:a2])\n + sum(C[3][:a3])\n )\n vmax = max(vmax, v)\nprint(vmax)\n", "slow_time": 7051948785, "fast_time": 98323112, "speedup": 71.7222, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_3"} +{"pair_id": "python_10307", "problem_id": "p03006", "language": "python", "slow_code": "import sys\nfrom collections import deque\nfrom collections import defaultdict\nfrom heapq import heapify, heappush, heappop, heappushpop\nfrom bisect import bisect_left, bisect_right\n\ns2nn = lambda s: [int(c) for c in s.split(\" \")]\nss2nn = lambda ss: [int(s) for s in ss]\nss2nnn = lambda ss: [s2nn(s) for s in ss]\ni2s = lambda: sys.stdin.readline().rstrip()\ni2n = lambda: int(i2s())\ni2nn = lambda: s2nn(i2s())\nii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]\nii2nn = lambda n: ss2nn(ii2ss(n))\nii2nnn = lambda n: ss2nnn(ii2ss(n))\n\n\ndef main():\n N = i2n()\n xy = ii2nnn(N)\n if N == 1:\n print((1))\n return\n dic = defaultdict(lambda: 0)\n for i in range(N):\n for j in range(N):\n if i == j:\n continue\n dx = xy[i][0] - xy[j][0]\n dy = xy[i][1] - xy[j][1]\n if dx == 0 and dy == 0:\n continue\n dic[(dx, dy)] += 1\n n = N - max(dic.values())\n print(n)\n\n\nmain()\n", "fast_code": "from collections import defaultdict as de\n\nX = de(int)\nn = int(eval(input()))\na = sorted([list(map(int, input().split())) for i in range(n)])\nfor i in range(n):\n for j in range(i):\n X[(a[i][0] - a[j][0], a[i][1] - a[j][1])] += 1\nprint((n - max(list(X.values()), default=0)))\n", "slow_time": 108329123, "fast_time": 41213514, "speedup": 2.6285, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_7"} +{"pair_id": "python_3805", "problem_id": "p03564", "language": "python", "slow_code": "from copy import deepcopy\nimport math\nimport string\nimport collections\nfrom collections import Counter\nfrom collections import deque\nfrom decimal import Decimal\nimport sys\nimport fractions\nfrom operator import itemgetter\nimport itertools\nimport copy\n\n\ndef readints():\n return list(map(int, input().split()))\n\n\ndef nCr(n, r):\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\n\n\ndef has_duplicates2(seq):\n seen = []\n for item in seq:\n if not (item in seen):\n seen.append(item)\n return len(seq) != len(seen)\n\n\ndef divisor(n):\n divisor = []\n for i in range(1, n + 1):\n if n % i == 0:\n divisor.append(i)\n return divisor\n\n\ndef gcd(a, b):\n while b != 0:\n a, b = b, a % b\n return a\n\n\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\nn = int(eval(input()))\nk = int(eval(input()))\nans = 1\nfor i in range(n):\n ans = min(ans * 2, ans + k)\nprint(ans)\n", "fast_code": "n, k, ans = int(eval(input())), int(eval(input())), 1\nfor _ in range(n):\n ans += min(ans, k)\nprint(ans)\n", "slow_time": 90173136, "fast_time": 19808969, "speedup": 4.5521, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_13"} +{"pair_id": "python_2644", "problem_id": "p02660", "language": "python", "slow_code": "import math\n\n\ndef get_prime(n):\n if n <= 1:\n return []\n prime = [2]\n if n > 2:\n limit = int(math.sqrt(n))\n odd = [i for i in range(3, n + 1, 2)]\n while limit >= odd[0]:\n prime.append(odd[0])\n odd = [j for j in odd if j % odd[0] != 0]\n prime += odd\n return prime\n\n\nfrom collections import defaultdict\n\n\ndef prime_factorization(n):\n if n <= 1:\n return {}\n else:\n\n prime = get_prime(int(math.sqrt(n)))\n dct = defaultdict(int)\n for p in prime:\n while n % p == 0:\n dct[p] += 1\n n //= p\n if n != 1:\n dct[n] += 1\n dct = dict(dct)\n return dct\n\n\nn = int(eval(input()))\npf = prime_factorization(n)\nZ = []\nfor k, v in list(pf.items()):\n for i in range(1, v + 1):\n Z.append(k**i)\nZ.sort()\ncount = 0\nfor z in Z:\n if n % z == 0:\n count += 1\n n //= z\nprint(count)\n", "fast_code": "n = int(eval(input()))\nif n == 1:\n print((0))\n exit()\n\n\ndef primes_factraizar(n):\n rn = int(n**0.5)\n is_prime = [True] * (rn + 1)\n is_prime[0] = False\n is_prime[1] = False\n for i in range(2, rn + 1):\n if not is_prime[i]:\n continue\n for j in range(i * 2, rn + 1, i):\n is_prime[j] = False\n return [i for i in range(rn + 1) if is_prime[i]]\n\n\nprimes = primes_factraizar(n)\ndivisors = []\nfor i in primes:\n if n % i == 0:\n divisors.append(i)\ndivisors.sort()\nif divisors == []:\n print((1))\n exit()\nans = 0\nfor i in divisors:\n if i == 1:\n continue\n c = 0\n while n % i == 0:\n n = n // i\n c += 1\n d = 0\n for count in range(1, 1000):\n if c >= d + count:\n ans += 1\n d += count\n else:\n break\nif not n == 1:\n ans += 1\nprint(ans)\n", "slow_time": 45492289947, "fast_time": 6141635002, "speedup": 7.4072, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_5"} +{"pair_id": "python_6332", "problem_id": "p03719", "language": "python", "slow_code": "import functools\nimport os\nimport sys\n\nsys.setrecursionlimit(10000)\nINF = float(\"inf\")\n\n\ndef inp():\n return int(input())\n\n\ndef inpf():\n return float(input())\n\n\ndef inps():\n return input()\n\n\ndef inl():\n return list(map(int, input().split()))\n\n\ndef inlf():\n return list(map(float, input().split()))\n\n\ndef inls():\n return input().split()\n\n\ndef inpm(line):\n return [inp() for _ in range(line)]\n\n\ndef inpfm(line):\n return [inpf() for _ in range(line)]\n\n\ndef inpsm(line):\n return [inps() for _ in range(line)]\n\n\ndef inlm(line):\n return [inl() for _ in range(line)]\n\n\ndef inlfm(line):\n return [inlf() for _ in range(line)]\n\n\ndef inlsm(line):\n return [inls() for _ in range(line)]\n\n\ndef debug(fn):\n if not os.getenv(\"LOCAL\"):\n return fn\n\n @functools.wraps(fn)\n def wrapper(*args, **kwargs):\n ret = fn(*args, **kwargs)\n print(\n \"DEBUG: {}({}) -> \".format(\n fn.__name__,\n \", \".join(\n list(map(str, args))\n + [\"{}={}\".format(k, str(v)) for k, v in kwargs.items()]\n ),\n ),\n end=\"\",\n )\n print(ret)\n return ret\n\n return wrapper\n\n\na, b, c = inl()\nprint(\"Yes\" if a <= c <= b else \"No\")\n", "fast_code": "A, B, C = [int(x) for x in input().strip().split(\" \")]\nif not C < A and not C > B:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 130412764, "fast_time": 16922919, "speedup": 7.7063, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_0"} +{"pair_id": "python_5447", "problem_id": "p03288", "language": "python", "slow_code": "import bisect, collections, copy, heapq, itertools, math, string\nimport sys\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef M():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\nR = I()\nif R < 1200:\n print(\"ABC\")\nelif R < 2800:\n print(\"ARC\")\nelse:\n print(\"AGC\")\n", "fast_code": "r = int(eval(input()))\nans = \"ARC\"\nif r < 1200:\n ans = \"ABC\"\nelif 2800 <= r:\n ans = \"AGC\"\nprint(ans)\n", "slow_time": 47184560, "fast_time": 15059657, "speedup": 3.1332, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_10"} +{"pair_id": "python_4811", "problem_id": "p04015", "language": "python", "slow_code": "n, a = list(map(int, input().split()))\nl = list(map(int, input().split()))\ndp = [0] * 5300\ndp[l[0] - a] = 1\nfor x in l[1:]:\n b = x - a\n if b >= 0:\n for i in range(2500, -2501, -1):\n dp[i + b] += dp[i]\n else:\n for i in range(-2500, 2501):\n dp[i + b] += dp[i]\n dp[b] += 1\nprint((dp[0]))\n", "fast_code": "def main():\n N, A = list(map(int, input().split()))\n x = list(map(int, input().split()))\n x.insert(0, 0)\n dp = [[[0] * (N * A + 1) for _ in range(N + 1)] for _ in range(N + 1)]\n for i in range(N + 1):\n dp[i][0][0] = 1\n for i in range(1, N + 1):\n for j in range(1, i + 1):\n for k in range(1, N * A + 1):\n dp[i][j][k] = dp[i - 1][j][k]\n if k >= x[i]:\n dp[i][j][k] += dp[i - 1][j - 1][k - x[i]]\n ans = 0\n for j in range(1, N + 1):\n ans += dp[N][j][A * j]\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 4544287551, "fast_time": 1004131447, "speedup": 4.5256, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_11"} +{"pair_id": "python_185", "problem_id": "p03805", "language": "python", "slow_code": "import itertools\n\nn, m = list(map(int, input().split()))\nl = [[0] * n for i in range(n)]\nfor i in range(m):\n a, b = list(map(int, input().split()))\n l[a - 1][b - 1] = 1\n l[b - 1][a - 1] = 1\nd = [int(i) + 1 for i in range(n)]\nans = chk = 0\nfor i in list(itertools.permutations(d, n)):\n chk = 1\n if i[0] != 1:\n continue\n for j in range(n - 1):\n chk *= l[i[j + 1] - 1][i[j] - 1]\n ans += chk\nprint(ans)\n", "fast_code": "from collections import defaultdict\nfrom itertools import permutations\n\n\ndef main():\n N, M = list(map(int, input().split()))\n g = defaultdict(list)\n for _ in range(M):\n a, b = list(map(int, input().split()))\n g[a].append(b)\n g[b].append(a)\n ans = 0\n for route in permutations(list(range(2, N + 1)), N - 1):\n ok = True\n now = 1\n for r in route:\n if r in g[now]:\n now = r\n else:\n ok = False\n if ok:\n ans += 1\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 6143449708, "fast_time": 1015280859, "speedup": 6.051, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_23"} +{"pair_id": "python_14819", "problem_id": "p03575", "language": "python", "slow_code": "class DisjointSet:\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n\nN, M, *ab = list(map(int, open(0).read().split()))\nedges = [(a - 1, b - 1) for a, b in zip(*[iter(ab)] * 2)]\nans = 0\nfor i in range(M):\n ds = DisjointSet(N)\n for j in range(M):\n if i == j:\n continue\n ds.union(*edges[j])\n if len([-p for p in ds.parents if p < 0]) > 1:\n ans += 1\nprint(ans)\n", "fast_code": "N, M = list(map(int, input().split()))\nedges = [list(map(int, input().split())) for i in range(M)]\nans = 0\nfor x in edges:\n l = list(range(N))\n for y in edges:\n if y != x:\n l = [l[y[0] - 1] if l[i] == l[y[1] - 1] else l[i] for i in range(N)]\n if len(set(l)) != 1:\n ans += 1\nprint(ans)\n", "slow_time": 109620610, "fast_time": 43890459, "speedup": 2.4976, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_13"} +{"pair_id": "python_2019", "problem_id": "p02603", "language": "python", "slow_code": "import collections\n\nN = int(eval(input()))\nA = list(map(int, input().split()))\ni = 0\nA.insert(0, float(\"inf\"))\n\nbuy = [0] * N\nsell = [0] * N\nfor i in range(N - 1):\n if (A[i] >= A[i + 1]) and (A[i + 2] >= A[i + 1]):\n buy[i] = 1\n if (A[i] <= A[i + 1]) and (A[i + 2] <= A[i + 1]):\n sell[i] = 1\nkabu = 0\nmoney = 1000\n\n\nA = A[1:]\n\nfor i in range(N):\n if buy[i] == 1:\n kabu = kabu + money // A[i]\n money = money - (money // A[i]) * A[i]\n if sell[i] == 1:\n money = money + kabu * A[i]\n kabu = 0\n\n\nmoney = money + kabu * A[N - 1]\nprint(money)\n", "fast_code": "from sys import stdin\n\ninput = stdin.readline\nN = int(eval(input()))\nA = list(map(int, input().split()))\nstart = 0\nmoney = 1000\nfor i in range(N - 1):\n if A[i + 1] > A[i]:\n buy = money // A[i]\n money -= A[i] * buy\n money += buy * A[i + 1]\nprint(money)\n", "slow_time": 64300487, "fast_time": 30255706, "speedup": 2.1252, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_14"} +{"pair_id": "python_7742", "problem_id": "p02707", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**6)\n\nint1 = lambda x: int(x) - 1\n\n\ndef II():\n return int(eval(input()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef MI1():\n return list(map(int1, input().split()))\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef LI1():\n return list(map(int1, input().split()))\n\n\ndef LLI(rows_number):\n return [LI() for _ in range(rows_number)]\n\n\nINF = float(\"inf\")\n\n\ndef solve():\n n = II()\n A = LI()\n ans = [0] * n\n for i, a in enumerate(A):\n ans[a - 1] += 1\n for a in ans:\n print(a)\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "num = int(eval(input()))\nboss = input().split()\nans_list = [0] * num\nfor i_boss in boss:\n ans_list[int(i_boss) - 1] += 1\nprint((\"\\n\".join(list(map(str, ans_list)))))\n", "slow_time": 73219551, "fast_time": 22628105, "speedup": 3.2358, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_19"} +{"pair_id": "python_5946", "problem_id": "p03566", "language": "python", "slow_code": "import sys\nimport numpy as np\n\n\ndef solve(N: int, T: \"List[int]\", V: \"List[int]\"):\n t_period = [0 for i in range(N + 1)]\n for i in range(N):\n t_period[i + 1] = t_period[i] + T[i] * 2\n limit = np.zeros((t_period[N] + 1,))\n for i in range(1, N):\n limit[t_period[i]] = min((V[i - 1], V[i]))\n for i in range(N):\n limit[t_period[i] + 1 : t_period[i + 1]] = V[i]\n speed = np.zeros((t_period[N] + 1,))\n for v in range(1, 201):\n speed[v : t_period[N] + 1 - v] = np.min(\n [\n limit[v : t_period[N] + 1 - v],\n speed[v - 1 : t_period[N] - v] + 0.5,\n speed[v + 1 : t_period[N] + 2 - v] + 0.5,\n ],\n axis=0,\n )\n total = 0\n for t in range(t_period[N]):\n total += (speed[t] + speed[t + 1]) * 0.5 * 0.5\n print(total)\n return\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n\n tokens = iterate_tokens()\n N = int(next(tokens))\n t = [int(next(tokens)) for _ in range(N)]\n v = [int(next(tokens)) for _ in range(N)]\n solve(N, t, v)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N = int(eval(input()))\nt = [0] + list(map(int, input().split()))\nv = [0] + list(map(int, input().split()))\nmax_speed_from_left = [0] * (N + 1)\nmax_speed_from_right = [0] * (N + 1)\nfor i in range(1, N):\n start = max_speed_from_left[i - 1]\n max_speed_from_left[i] = min(start + t[i], v[i], v[i + 1])\nfor i in range(N - 1, 0, -1):\n start = max_speed_from_right[i + 1]\n max_speed_from_right[i] = min(start + t[i + 1], v[i], v[i + 1])\nspeed = [min(x, y) for x, y in zip(max_speed_from_left, max_speed_from_right)]\n\n\ndef dist(left_speed, right_speed, t, v):\n x = (v - left_speed) + (v - right_speed)\n if x >= t:\n v = (left_speed + right_speed + t) / 2\n x = t\n\n d = (left_speed + v) * (v - left_speed) / 2\n d += v * (t - x)\n d += (right_speed + v) * (v - right_speed) / 2\n return d\n\n\nans = 0\nfor i in range(1, N + 1):\n ans += dist(speed[i - 1], speed[i], t[i], v[i])\nprint(ans)\n", "slow_time": 687691747, "fast_time": 86801806, "speedup": 7.9226, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_19"} +{"pair_id": "python_16524", "problem_id": "p03274", "language": "python", "slow_code": "import sys\nimport math\nimport bisect\nimport queue\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\ndef solve(X, K):\n N = len(X)\n cumsum = [0 for _ in range(N)]\n for i in range(1, N):\n cumsum[i] = abs(X[i] - X[i - 1]) + cumsum[i - 1]\n idx_zero = bisect.bisect_left(X, 0)\n ret = 1000000005\n for i in range(0, N):\n if X[i] >= 0:\n break\n res = -X[i]\n k = idx_zero - i\n if (k < K) and (idx_zero + K - k - 1 < N):\n res += cumsum[idx_zero + K - k - 1] - cumsum[i]\n ret = min(ret, res)\n return ret\n\n\nif __name__ == \"__main__\":\n N, K = list(map(int, input().split()))\n X = list(map(int, input().split()))\n res = 1000000005\n if min(X) >= 0:\n print((X[K - 1]))\n elif max(X) <= 0:\n X = X[::-1]\n print((-X[K - 1]))\n else:\n res = min(res, solve(X, K))\n X = [-x for x in X]\n res = min(res, solve(X[::-1], K))\n print(res)\n", "fast_code": "N, K = list(map(int, input().split()))\nx = list(map(int, input().split()))\nassert len(x) == N\nm = min(b - a + min(abs(a), abs(b)) for a, b in zip(x, x[K - 1 :]))\nprint(m)\n", "slow_time": 92211709, "fast_time": 27075235, "speedup": 3.4058, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_16"} +{"pair_id": "python_14875", "problem_id": "p02623", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**9)\n\n\ndef int1(x):\n return int(x) - 1\n\n\ndef II():\n return int(eval(input()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef MI1():\n return list(map(int1, input().split()))\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef LI1():\n return list(map(int1, input().split()))\n\n\ndef LLI(rows_number):\n return [LI() for _ in range(rows_number)]\n\n\ndef MS():\n return input().split()\n\n\ndef LS():\n return list(eval(input()))\n\n\ndef LLS(rows_number):\n return [LS() for _ in range(rows_number)]\n\n\ndef printlist(lst, k=\" \"):\n print((k.join(list(map(str, lst)))))\n\n\nINF = float(\"inf\")\n\n\nfrom itertools import (\n combinations as comb,\n combinations_with_replacement as comb_w,\n accumulate,\n product,\n permutations,\n)\n\n\nfrom bisect import bisect_right, bisect_left\n\n\ndef solve():\n N, M, K = MI()\n A = LI()\n B = LI()\n A = [0] + list(accumulate(A))\n B = [0] + list(accumulate(B))\n ans = 0\n for i, a in enumerate(A):\n if a > K:\n break\n idx = bisect_right(B, K - a) - 1\n ans = max(ans, i + idx)\n print(ans)\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "import bisect\n\nn, m, k = list(map(int, input().split()))\nal = list(map(int, input().split()))\nbl = list(map(int, input().split()))\n\nacum = [0]\nfor i in range(n):\n acum.append(al[i] + acum[i])\nbcum = [0]\nfor i in range(m):\n bcum.append(bl[i] + bcum[i])\nans = 0\nfor i in range(n + 1):\n rsd = k - acum[i]\n if rsd < 0:\n break\n\n ind = bisect.bisect_right(bcum, rsd)\n ans = max(ans, i + ind - 1)\nprint(ans)\n", "slow_time": 100466791, "fast_time": 41896010, "speedup": 2.398, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_11"} +{"pair_id": "python_6338", "problem_id": "p03719", "language": "python", "slow_code": "import functools\nimport os\nimport sys\n\nsys.setrecursionlimit(10000)\nINF = float(\"inf\")\n\n\ndef inp():\n return int(input())\n\n\ndef inpf():\n return float(input())\n\n\ndef inps():\n return input()\n\n\ndef inl():\n return list(map(int, input().split()))\n\n\ndef inlf():\n return list(map(float, input().split()))\n\n\ndef inls():\n return input().split()\n\n\ndef inpm(line):\n return [inp() for _ in range(line)]\n\n\ndef inpfm(line):\n return [inpf() for _ in range(line)]\n\n\ndef inpsm(line):\n return [inps() for _ in range(line)]\n\n\ndef inlm(line):\n return [inl() for _ in range(line)]\n\n\ndef inlfm(line):\n return [inlf() for _ in range(line)]\n\n\ndef inlsm(line):\n return [inls() for _ in range(line)]\n\n\ndef debug(fn):\n if not os.getenv(\"LOCAL\"):\n return fn\n\n @functools.wraps(fn)\n def wrapper(*args, **kwargs):\n ret = fn(*args, **kwargs)\n print(\n \"DEBUG: {}({}) -> \".format(\n fn.__name__,\n \", \".join(\n list(map(str, args))\n + [\"{}={}\".format(k, str(v)) for k, v in kwargs.items()]\n ),\n ),\n end=\"\",\n )\n print(ret)\n return ret\n\n return wrapper\n\n\na, b, c = inl()\nprint(\"Yes\" if a <= c <= b else \"No\")\n", "fast_code": "import sys\nfrom collections import Counter\n\nsys.setrecursionlimit(10**7)\ninf = 1 << 100\n\n\ndef solve():\n a, b, c = list(map(int, input().split()))\n print((\"Yes\" if a <= c <= b else \"No\"))\n\n\nif __name__ == \"__main__\":\n solve()\n", "slow_time": 130412764, "fast_time": 24029352, "speedup": 5.4272, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_2"} +{"pair_id": "python_14586", "problem_id": "p00687", "language": "python", "slow_code": "while 1:\n n, a, b = list(map(int, input().split()))\n if n == a == b == 0:\n break\n c = 0\n d = [1] + [0] * 2000000\n for i in range(0, n + 1):\n if d[i]:\n d[i + a] = d[i + b] = 1\n else:\n c += 1\n print(c)\n", "fast_code": "while 1:\n n, a, b = list(map(int, input().split()))\n if n == 0:\n break\n dp = [0] * (n + 1)\n if a < n + 1:\n dp[a] = 1\n if b < n + 1:\n dp[b] = 1\n for i in range(n + 1):\n if dp[i]:\n if i + a < n + 1:\n dp[i + a] = 1\n if i + b < n + 1:\n dp[i + b] = 1\n print(n - sum(dp))\n", "slow_time": 6644536519, "fast_time": 47075082, "speedup": 141.1476, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_0"} +{"pair_id": "python_6225", "problem_id": "p03502", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nimport array\nimport inspect\n\nsys.setrecursionlimit(10000)\n\n\ndef chkprint(*args):\n names = {id(v): k for k, v in list(inspect.currentframe().f_back.f_locals.items())}\n print((\", \".join(names.get(id(arg), \"???\") + \" = \" + repr(arg) for arg in args)))\n\n\ndef to_bin(x):\n return bin(x)[2:]\n\n\ndef li_input():\n return [int(_) for _ in input().split()]\n\n\ndp = None\n\n\ndef main():\n X = int(eval(input()))\n if X % sum(list(map(int, list(str(X))))) == 0:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nmain()\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\nN = input()[:-1]\nf = sum(list(map(int, list(N))))\nif int(N) % f == 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 66486570, "fast_time": 18428521, "speedup": 3.6078, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_10"} +{"pair_id": "python_6707", "problem_id": "p00070", "language": "python", "slow_code": "import sys\n\nK = 1024\nN = 331\nR = list(range(K))\nB = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]\nC = [0] * K\nD = [[0 for i in range(N)] for j in R]\n\n\ndef init():\n global C, D\n for i in R:\n s = format(i, \"b\")\n n = s.count(\"1\")\n C[i] = n\n if n == 1:\n D[i][B.index(i)] = 1\n else:\n for j in range(len(s)):\n if s[-j - 1] == \"1\":\n dp = n * j\n i2 = i - B[j]\n for k in range(N - dp):\n D[i][k + dp] += D[i2][k]\n return\n\n\ninit()\nfor a in sys.stdin:\n n, s = list(map(int, a.split()))\n x = 0\n if s < N:\n x = sum([D[i][s] for i in R if C[i] == n])\n print(x)\n", "fast_code": "import sys\n\n\ndef f0070(A, n, s):\n if n == 1:\n return s in A\n A = sorted(A)\n b1 = 0\n b2 = 0\n c = 0\n j = 1\n for e, f in zip(A[:n][::-1], A[-n:]):\n b1 += j * e\n b2 += j * f\n j += 1\n if b1 <= s <= b2:\n for i in range(len(A)):\n c += f0070(A[:i] + A[i + 1 :], n - 1, s - A[i] * n)\n return c\n\n\nfor a in sys.stdin:\n n, s = list(map(int, a.split()))\n print(f0070(list(range(10)), n, s))\n", "slow_time": 56673214149, "fast_time": 71015953, "speedup": 798.035, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_0"} +{"pair_id": "python_10608", "problem_id": "p03330", "language": "python", "slow_code": "from collections import Counter, defaultdict, deque\nimport sys, heapq, bisect, math, itertools, string, queue\n\nsys.setrecursionlimit(10**8)\nmod = 10**9 + 7\n\n\ndef inp():\n return int(sys.stdin.readline())\n\n\ndef inpl():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef inpl_str():\n return list(sys.stdin.readline().split())\n\n\ndef inpln(n):\n return list(int(sys.stdin.readline()) for i in range(n))\n\n\nn, C = inpl()\nd = []\nc = []\nfor i in range(C):\n d.append(inpl())\nfor i in range(n):\n c.append(inpl())\nd0 = defaultdict(int)\nd1 = defaultdict(int)\nd2 = defaultdict(int)\ndd = [d0, d1, d2]\nfor y in range(n):\n for x in range(n):\n t = (x + y + 2) % 3\n dd[t][c[x][y]] += 1\n\nres = [[] for i in range(3)]\nfor i in range(C):\n for j in range(3):\n tmp = 0\n for key in list(dd[j].keys()):\n tmp += d[key - 1][i] * dd[j][key]\n res[j].append([i, tmp])\nfor i in range(3):\n res[i].sort(key=lambda x: x[1])\n\nans = mod\nfor i in range(3):\n for j in range(3):\n for k in range(3):\n if (\n res[0][i][0] == res[1][j][0]\n or res[0][i][0] == res[2][k][0]\n or res[2][k][0] == res[1][j][0]\n ):\n continue\n ans = min(res[0][i][1] + res[1][j][1] + res[2][k][1], ans)\nprint(ans)\n", "fast_code": "from collections import defaultdict\n\nN, C = list(map(int, input().split()))\nD = [tuple(map(int, input().split())) for _ in range(C)]\nd = [defaultdict(int) for i in range(3)]\nfor i in range(N):\n c = [int(x) for x in input().split()]\n for j in range(N):\n for k in range(C):\n d[(i + j) % 3][k] += D[c[j] - 1][k]\n\nans = 10**9\nfor i in range(C):\n for j in range(C):\n for k in range(C):\n if i != j and j != k and k != i:\n ans = min(ans, d[0][i] + d[1][j] + d[2][k])\nprint(ans)\n", "slow_time": 143567013, "fast_time": 69748702, "speedup": 2.0583, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_28"} +{"pair_id": "python_10376", "problem_id": "p02706", "language": "python", "slow_code": "int1 = lambda x: int(x) - 1\n\n\ndef II():\n return int(eval(input()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef MI1():\n return list(map(int1, input().split()))\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef LLI(rows_number):\n return [LI() for _ in range(rows_number)]\n\n\ndef solve():\n n, m = MI()\n A = LI()\n sm = sum(A)\n if n - sm >= 0:\n print((n - sm))\n else:\n print((-1))\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "import numpy as np\nimport math\n\nn, m = list(map(int, input().split()))\nA = list(map(int, input().split()))\na = sum(A)\nif n < a:\n print((-1))\nelse:\n print((n - a))\n", "slow_time": 45502445, "fast_time": 17117419, "speedup": 2.6583, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_29"} +{"pair_id": "python_14038", "problem_id": "p00028", "language": "python", "slow_code": "a = [0] * 100\nwhile 1:\n try:\n n = int(eval(input()))\n a[n - 1] += 1\n except:\n for i in range(100):\n if a[i] == max(a):\n print((i + 1))\n break\n", "fast_code": "array = []\nwhile True:\n try:\n a = input()\n array.append(int(a))\n except EOFError:\n break\ns = set(array)\ncount = list(map(lambda a: array.count(a), s))\nmx = max(count)\nmodes = list(list(s)[i] for i, x in enumerate(count) if x == mx)\nprint(*modes, sep=\"\\n\")\n", "slow_time": 117729361, "fast_time": 40593659, "speedup": 2.9002, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_10"} +{"pair_id": "python_11715", "problem_id": "p02536", "language": "python", "slow_code": "from networkx.utils import UnionFind\nimport sys\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\ndef main():\n n, m = list(map(int, input().split()))\n uf = UnionFind()\n for i in range(1, n + 1):\n _ = uf[i]\n for _ in range(m):\n a, b = list(map(int, input().split()))\n uf.union(a, b)\n print((len(list(uf.to_sets())) - 1))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "class UnionFind:\n def __init__(self, n):\n self.n = [-1] * n\n self.r = [0] * n\n self.co = n\n\n def find_root(self, x):\n if self.n[x] < 0:\n return x\n else:\n self.n[x] = self.find_root(self.n[x])\n return self.n[x]\n\n def unite(self, x, y):\n x = self.find_root(x)\n y = self.find_root(y)\n if x == y:\n return\n elif self.r[x] > self.r[y]:\n self.n[x] += self.n[y]\n self.n[y] = x\n else:\n self.n[y] += self.n[x]\n self.n[x] = y\n if self.r[x] == self.r[y]:\n self.r[y] += 1\n self.co -= 1\n\n def same(self, x, y):\n return self.find_root(x) == self.find_root(y)\n\n def size(self, x):\n return -self.n[self.find_root(x)]\n\n def set_count(self):\n return self.co\n\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip()\nn, m = list(map(int, input().split()))\nuf = UnionFind(n)\nfor _ in range(m):\n a, b = list(map(int, input().split()))\n uf.unite(a - 1, b - 1)\nprint((uf.set_count() - 1))\n", "slow_time": 18069444838, "fast_time": 97359340, "speedup": 185.5954, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_29"} +{"pair_id": "python_14624", "problem_id": "p00031", "language": "python", "slow_code": "while True:\n try:\n tmp = eval(input())\n except:\n break\n i = 1\n while tmp > 0:\n if tmp % 2 == 1:\n print(i, end=\" \")\n tmp /= 2\n i *= 2\n print()\n", "fast_code": "W = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]\nimport sys\n\nfor s in sys.stdin:\n B = format(int(s), \"b\")[::-1]\n i = 0\n for e in B:\n if e == \"1\":\n print(W[i], end=\" \")\n i += 1\n print()\n", "slow_time": 449803141, "fast_time": 26746368, "speedup": 16.8174, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_1"} +{"pair_id": "python_3773", "problem_id": "p02993", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\n\nINF = 10**10\nMOD = 10**9 + 7\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef gcd(x, y):\n return y if x % y == 0 else gcd(y, x % y)\n\n\ndef lcm(x, y):\n return (x * y) // gcd(x, y)\n\n\ndef I():\n return int(input())\n\n\ndef LI():\n return [int(x) for x in input().split()]\n\n\ndef RI(N):\n return [int(input()) for _ in range(N)]\n\n\ndef LRI(N):\n return [[int(x) for x in input().split()] for _ in range(N)]\n\n\ndef PL(L):\n print(*L, sep=\"\\n\")\n\n\nS = input()\nfor i in range(3):\n if S[i] == S[i + 1]:\n print(\"Bad\")\n break\nelse:\n print(\"Good\")\n", "fast_code": "s = list(str(eval(input())))\nflag = True\npre = None\nfor i, value in enumerate(s):\n if i != 0:\n if pre == value:\n flag = False\n break\n pre = value\nif flag:\n print(\"Good\")\nelse:\n print(\"Bad\")\n", "slow_time": 78426894, "fast_time": 23918976, "speedup": 3.2789, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_8"} +{"pair_id": "python_5322", "problem_id": "p03997", "language": "python", "slow_code": "from collections import deque\nfrom heapq import heapify, heappop, heappush, heappushpop\nfrom copy import copy, deepcopy\nfrom itertools import product, permutations, combinations, combinations_with_replacement\nfrom collections import defaultdict, Counter\nfrom bisect import bisect_left, bisect_right\n\n\nfrom functools import reduce\nfrom pprint import pprint\n\nINF = float(\"inf\")\n\n\ndef myinput():\n return list(map(int, input().split()))\n\n\ndef mylistinput(n):\n return [list(myinput()) for _ in range(n)]\n\n\ndef mycol(data, col):\n return [row[col] for row in data]\n\n\ndef mysort(data, col, reverse_flag):\n data.sort(key=lambda x: x[col], reverse=reverse_flag)\n return data\n\n\ndef mymax(data):\n M = -1 * float(\"inf\")\n for i in range(len(data)):\n m = max(data[i])\n M = max(M, m)\n return M\n\n\ndef mymin(data):\n m = float(\"inf\")\n for i in range(len(data)):\n M = min(data[i])\n m = min(m, M)\n return m\n\n\ndef mycount(ls, x):\n\n l = bisect_left(ls, x)\n r = bisect_right(ls, x)\n return r - l\n\n\ndef myoutput(ls, space=True):\n if space:\n if len(ls) == 0:\n print(\" \")\n elif type(ls[0]) == str:\n print((\" \".join(ls)))\n elif type(ls[0]) == int:\n print((\" \".join(map(str, ls))))\n else:\n print(\"Output Error\")\n else:\n if len(ls) == 0:\n print(\"\")\n elif type(ls[0]) == str:\n print((\"\".join(ls)))\n elif type(ls[0]) == int:\n print((\"\".join(map(str, ls))))\n else:\n print(\"Output Error\")\n\n\ndef I():\n return int(eval(input()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef RI():\n return list(map(int, input().split()))\n\n\ndef CI(n):\n return [int(eval(input())) for _ in range(n)]\n\n\ndef LI(n):\n return [list(map(int, input().split())) for _ in range(n)]\n\n\ndef S():\n return eval(input())\n\n\ndef MS():\n return input().split()\n\n\ndef RS():\n return list(input().split())\n\n\ndef CS(n):\n return [eval(input()) for _ in range(n)]\n\n\ndef LS(n):\n return [list(input().split()) for _ in range(n)]\n\n\na = I()\nb = I()\nh = I()\nans = (a + b) * h // 2\nprint(ans)\n", "fast_code": "a, b, h = list(map(int, [eval(input()) for i in [0] * 3]))\nprint((h * (a + b) // 2))\n", "slow_time": 222419806, "fast_time": 21539928, "speedup": 10.3259, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_12"} +{"pair_id": "python_8597", "problem_id": "p03338", "language": "python", "slow_code": "N = int(eval(input()))\nS = input().strip()\ncmax = 0\nfor n in range(1, N - 1):\n X = S[:n]\n Y = S[n:]\n Cx = {}\n Cy = {}\n for i in range(n):\n a = X[i]\n if a not in Cx:\n Cx[a] = 0\n Cx[a] += 1\n for i in range(N - n):\n a = Y[i]\n if a not in Cy:\n Cy[a] = 0\n Cy[a] += 1\n cnt = 0\n for a in Cx:\n if a in Cy:\n cnt += 1\n cmax = max(cmax, cnt)\nprint(cmax)\n", "fast_code": "import sys\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\nN = I()\nS = S()\nans = 0\nfor i in range(N):\n ans = max(ans, len(set(S[:i]) & set(S[i:])))\nprint(ans)\n", "slow_time": 153745720, "fast_time": 38919019, "speedup": 3.9504, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_20"} +{"pair_id": "python_9981", "problem_id": "p03449", "language": "python", "slow_code": "import sys\n\n\ndef dfs(x: int, y: int):\n if y == 1 and x == (N - 1):\n return A[y][x]\n elif y > 1 or x > N - 1:\n return 0\n else:\n return max(dfs(x + 1, y), dfs(x, y + 1)) + A[y][x]\n\n\ndef solve(N: int, A: \"List[List[int]]\"):\n print((dfs(0, 0)))\n return\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n\n tokens = iterate_tokens()\n global N, A\n N = int(next(tokens))\n A = [[int(next(tokens)) for _ in range(N)] for _ in range(2)]\n solve(N, A)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nans = 0\nfor k in range(N):\n ans = max(ans, sum(A[: k + 1]) + sum(B[k:]))\nprint(ans)\n", "slow_time": 68600833, "fast_time": 28968100, "speedup": 2.3682, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_2"} +{"pair_id": "python_14617", "problem_id": "p01224", "language": "python", "slow_code": "from math import sqrt\n\nP = \"perfect number\"\nD = \"deficient number\"\nA = \"abundant number\"\nwhile True:\n n = eval(input())\n if n == 0:\n break\n if n == 1:\n print(D)\n continue\n su = 1\n temp = n\n for i in range(2, int(sqrt(n)) + 1):\n cnt = 0\n while temp % i == 0:\n temp /= i\n cnt += 1\n if cnt:\n su *= (i ** (cnt + 1) - 1) / (i - 1)\n if temp == 1:\n su -= n\n break\n if temp != 1:\n su *= (temp**2 - 1) / (temp - 1)\n su -= n\n print(P if n == su else (D if su < n else A))\n", "fast_code": "def div(n):\n ls = []\n i = 2\n while i * i <= n:\n c = 0\n if n % i == 0:\n while n % i == 0:\n n /= i\n c += 1\n if c > 0:\n ls.append([i, c])\n i += 1\n if n > 1:\n ls.append([n, 1])\n ans = 1\n for b, p in ls:\n ans *= (b ** (p + 1) - 1) / (b - 1)\n return ans\n\n\nwhile 1:\n n = eval(input())\n if n == 0:\n break\n d = div(n) - n\n if d == n:\n print(\"perfect number\")\n elif d < n:\n print(\"deficient number\")\n else:\n print(\"abundant number\")\n", "slow_time": 2240420789, "fast_time": 346515291, "speedup": 6.4656, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_0"} +{"pair_id": "python_18132", "problem_id": "p03476", "language": "python", "slow_code": "import math\n\n\ndef is_prime(n):\n if n == 1:\n return False\n for k in range(2, int(math.sqrt(n)) + 1):\n if n % k == 0:\n return False\n return True\n\n\nQ = int(eval(input()))\ncnt = [0] * (10**5 + 1)\nfor i in range(1, 10**5 + 1):\n if i % 2 == 0:\n cnt[i] = cnt[i - 1]\n continue\n if is_prime(i) and is_prime((i + 1) // 2):\n cnt[i] = cnt[i - 1] + 1\n else:\n cnt[i] = cnt[i - 1]\nfor _ in range(Q):\n l, r = list(map(int, input().split()))\n print((cnt[r] - cnt[l - 1]))\n", "fast_code": "import math\nimport fractions\nimport bisect\nimport collections\nimport itertools\nimport heapq\nimport string\nimport sys\nimport copy\nfrom decimal import *\nfrom collections import deque\n\nsys.setrecursionlimit(10**7)\nMOD = 10**9 + 7\nINF = float(\"inf\")\n\n\ndef gcd(a, b):\n return fractions.gcd(a, b)\n\n\ndef lcm(a, b):\n return (a * b) // fractions.gcd(a, b)\n\n\ndef iin():\n return int(sys.stdin.readline())\n\n\ndef ifn():\n return float(sys.stdin.readline())\n\n\ndef isn():\n return sys.stdin.readline().split()\n\n\ndef imn():\n return map(int, sys.stdin.readline().split())\n\n\ndef imnn():\n return map(lambda x: int(x) - 1, sys.stdin.readline().split())\n\n\ndef fmn():\n return map(float, sys.stdin.readline().split())\n\n\ndef iln():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef iln_s():\n return sorted(iln())\n\n\ndef iln_r():\n return sorted(iln(), reverse=True)\n\n\ndef fln():\n return list(map(float, sys.stdin.readline().split()))\n\n\ndef join(l, s=\"\"):\n return s.join(l)\n\n\ndef perm(l, n):\n return itertools.permutations(l, n)\n\n\ndef perm_count(n, r):\n return math.factorial(n) // math.factorial(n - r)\n\n\ndef comb(l, n):\n return itertools.combinations(l, n)\n\n\ndef comb_count(n, r):\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\n\n\ndef two_distance(a, b, c, d):\n return ((c - a) ** 2 + (d - b) ** 2) ** 0.5\n\n\ndef m_add(a, b):\n return (a + b) % MOD\n\n\ndef lprint(l):\n print(*l, sep=\"\\n\")\n\n\ndef sieves_of_e(n):\n is_prime = [True] * (n + 1)\n is_prime[0] = False\n is_prime[1] = False\n for i in range(2, int(n**0.5) + 1):\n if not is_prime[i]:\n continue\n for j in range(i * 2, n + 1, i):\n is_prime[j] = False\n return is_prime\n\n\nQ = iin()\nL = []\nR = []\nfor i in range(Q):\n l, r = imn()\n L.append(l)\n R.append(r)\nis_primes = sieves_of_e(10**5 + 1)\ns = [0 for _ in range(10**5 + 1)]\nfor i in range(1, 10**5):\n s[i] = s[i - 1]\n if i % 2 == 1:\n if is_primes[i] and is_primes[(i + 1) // 2]:\n s[i] = s[i - 1] + 1\nfor i in range(Q):\n print(s[R[i]] - s[L[i] - 1])\n", "slow_time": 64142625764, "fast_time": 14837056604, "speedup": 4.3231, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_12"} +{"pair_id": "python_12950", "problem_id": "p03549", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\np = 0.5**M\nq = 1 - p\ni = 0\nsum = 0\nwhile True:\n num = (i + 1) * (100 * (N - M) + 1900 * M) * p * (q**i)\n if num < 10 ** (-6):\n break\n sum += num\n i += 1\nprint((int(sum + 1)))\n", "fast_code": "def main():\n N, M = (int(i) for i in input().split())\n t = 1900 * M + 100 * (N - M)\n p = 2**M\n print((t * p))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 95463640, "fast_time": 22637323, "speedup": 4.2171, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_20"} +{"pair_id": "python_14858", "problem_id": "p02900", "language": "python", "slow_code": "def gcd(x, y):\n if x < y:\n x, y = y, x\n while y > 0:\n x, y = y, x % y\n return x\n\n\nINFTY = 10**6\nP = [1 for i in range(INFTY + 1)]\nP[0] = 0\nP[1] = 0\nfor i in range(2, int((INFTY + 1) ** 0.5) + 1):\n for j in range(i * i, INFTY + 1, i):\n P[j] = 0\nQ = []\nfor i in range(INFTY):\n if P[i] == 1:\n Q.append(i)\nA, B = list(map(int, input().split()))\nx = gcd(A, B)\ncnt = 1\nfor y in Q:\n if x % y == 0:\n cnt += 1\n while x % y == 0:\n x = x // y\nif x > 1:\n cnt += 1\nprint(cnt)\n", "fast_code": "def divisors(n):\n i = 1\n table = set()\n while i * i <= n:\n if not n % i:\n table.add(i)\n table.add(n // i)\n i += 1\n return table\n\n\ndef max2(x, y):\n return x if x > y else y\n\n\ndef rec(start_set, t):\n global res\n res = max2(res, t)\n next_set = []\n i = start_set[0]\n for j in start_set[1:]:\n if gcd(data[i], data[j]) == 1:\n next_set.append(j)\n if next_set:\n rec(next_set, t + 1)\n return res\n\n\nfrom math import gcd\n\nA, B = list(map(int, input().split()))\ndata = divisors(A) & divisors(B)\ndata = list(data)\ndata.sort()\nL = len(data)\nres = 0\nprint((rec(list(range(L)), 1)))\n", "slow_time": 293177338513, "fast_time": 65542910, "speedup": 4473.0595, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_27"} +{"pair_id": "python_3753", "problem_id": "p02731", "language": "python", "slow_code": "import scipy.optimize\n\nL = int(eval(input()))\nfunc = lambda x: -1 * (x[0] * x[1] * (L - x[0] - x[1]))\nres = scipy.optimize.minimize(func, (0.1, 0.2), bounds=((0, None), (0, None)), tol=1e-6)\nprint((-1 * res.fun))\n", "fast_code": "def main():\n L = int(eval(input()))\n print((L**3 / 27))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 38579398487, "fast_time": 15798447, "speedup": 2441.9741, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_21"} +{"pair_id": "python_543", "problem_id": "p02793", "language": "python", "slow_code": "class PrimeOptimizer:\n def __init__(self, MAX_NUM=10**3):\n is_prime = [True] * MAX_NUM\n is_prime[0] = False\n is_prime[1] = False\n primes = []\n for i in range(MAX_NUM):\n if is_prime[i]:\n primes.append(i)\n for j in range(2 * i, MAX_NUM, i):\n is_prime[j] = False\n self.primes = primes\n\n def prime_factorization(self, x):\n res = {}\n for prime in self.primes:\n while x % prime == 0:\n if not prime in res:\n res[prime] = 0\n res[prime] += 1\n x //= prime\n if x > 1:\n res[x] = 1\n return res\n\n\nMOD = 10**9 + 7\n\n\ndef mod_pow(p, q):\n res = 1\n while q:\n if q & 1:\n res = (res * p) % MOD\n p = (p * p) % MOD\n q //= 2\n return res\n\n\ndef mod_inv(p):\n return mod_pow(p, MOD - 2)\n\n\ndef solve(n, a):\n primeOpt = PrimeOptimizer()\n D = {}\n for i in range(n):\n prime_num_mapping = primeOpt.prime_factorization(a[i])\n for prime, num in list(prime_num_mapping.items()):\n if not prime in D:\n D[prime] = 0\n D[prime] = max(D[prime], num)\n L = 1\n for prime, num in list(D.items()):\n L = (L * mod_pow(prime, num)) % MOD\n res = sum([L * mod_inv(x) % MOD for x in a])\n return res % MOD\n\n\nN = int(eval(input()))\nA = list(map(int, input().split()))\nprint((solve(N, A)))\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**7)\nn = int(eval(input()))\na = list(map(int, input().split()))\nMOD = 10**9 + 7\nlcm = 1\n\n\nimport math\n\nfor v in a:\n lcm = (lcm // math.gcd(lcm, v)) * v\nans = 0\nfor v in a:\n ans = ans + (lcm // v)\n\nprint((ans % MOD))\n", "slow_time": 111952662, "fast_time": 19221915, "speedup": 5.8242, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_6"} +{"pair_id": "python_14608", "problem_id": "p01314", "language": "python", "slow_code": "if __name__ == \"__main__\":\n while True:\n n = int(eval(input()))\n if n == 0:\n break\n count = 0\n for i in range(1, n):\n for j in range(i + 1, n):\n sum = (i + j) * (j - i + 1) / 2\n if sum > n:\n break\n if sum == n:\n count += 1\n print(count)\n", "fast_code": "while 1:\n n = int(input())\n if not n:\n break\n ans = 0\n p = 2\n while p**2 <= 2 * n:\n if not 2 * n % p:\n if (p + 2 * n / p) % 2:\n ans += 1\n p += 1\n print(ans)\n", "slow_time": 129769763, "fast_time": 22771134, "speedup": 5.6989, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_4"} +{"pair_id": "python_6093", "problem_id": "p02789", "language": "python", "slow_code": "import math\nimport statistics\nimport numpy as np\nimport queue\n\n\ndef fact(n):\n if n == 1:\n return 1\n else:\n return n * fact(n - 1)\n\n\ndef gcd(a, b):\n if a == 0:\n return b\n elif b == 0:\n return a\n else:\n return gcd(b, a % b)\n\n\ndef lcm(a, b):\n return a * b / gcd(a, b)\n\n\ndef qsort(seq):\n if len(seq) < 2:\n return seq\n else:\n beg, end = 0, len(seq) - 1\n mid = (beg + end) // 2\n smaller = [c for c in seq if seq[mid] > c]\n equal = [c for c in seq if seq[mid] == c]\n larger = [c for c in seq if seq[mid] < c]\n return qsort(smaller) + equal + qsort(larger)\n\n\nn, m = list(map(int, input().split()))\nif n == m:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "n, m = list(map(int, input().split()))\nprint(([\"No\", \"Yes\"][n == m]))\n", "slow_time": 76445893, "fast_time": 11068271, "speedup": 6.9068, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_4"} +{"pair_id": "python_2892", "problem_id": "p02559", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom fractions import Fraction\nfrom functools import lru_cache, reduce\nfrom itertools import (\n combinations,\n combinations_with_replacement,\n product,\n permutations,\n accumulate,\n)\nfrom operator import add, mul, sub, itemgetter, attrgetter\nimport sys\n\nreadline = sys.stdin.readline\nINF = 2**62 - 1\n\n\ndef read_int():\n return int(readline())\n\n\ndef read_int_n():\n return list(map(int, readline().split()))\n\n\ndef read_float():\n return float(readline())\n\n\ndef read_float_n():\n return list(map(float, readline().split()))\n\n\ndef read_str():\n return readline().strip()\n\n\ndef read_str_n():\n return readline().strip().split()\n\n\ndef ep(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.perf_counter()\n ret = f(*args, **kwargs)\n e = time.perf_counter()\n ep(e - s, \"sec\")\n return ret\n\n return wrap\n\n\nclass FenwicTree:\n def __init__(self, n):\n self.__data = [0] * n\n self.__n = n\n\n def add(self, i, x):\n i += 1\n while i <= self.__n:\n self.__data[i - 1] += x\n i += i & -i\n\n def sum(self, l, r):\n return self.__sum(r) - self.__sum(l)\n\n def __sum(self, r):\n s = 0\n while r > 0:\n s += self.__data[r - 1]\n r -= r & -r\n return s\n\n\n@mt\ndef slv(N, A, Q):\n ft = FenwicTree(N)\n for i, a in enumerate(A):\n ft.add(i, a)\n ans = []\n for q in Q:\n if q[0] == 0:\n _, p, x = q\n ft.add(p, x)\n else:\n _, l, r = q\n ans.append(ft.sum(l, r))\n return ans\n\n\ndef main():\n N, Q = read_int_n()\n A = read_int_n()\n Q = [read_int_n() for _ in range(Q)]\n print(*slv(N, A, Q), sep=\"\\n\")\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "def main():\n def f(i, x):\n while i <= n:\n b[i] += x\n i += i & -i\n\n def g(i):\n s = 0\n while i:\n s += b[i]\n i -= i & -i\n return s\n\n (n, q, *w), a, *t = [list(map(int, t.split())) for t in open(0)]\n b = [0] * -~n\n *list(map(f, list(range(1, n + 1)), a)),\n for q, l, r in t:\n if q:\n w += (g(r) - g(l),)\n else:\n f(l + 1, r)\n print((\" \".join(map(str, w))))\n\n\nmain()\n", "slow_time": 169473996, "fast_time": 69937380, "speedup": 2.4232, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_26"} +{"pair_id": "python_4926", "problem_id": "p03598", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\ninf = 1 << 60\nmod = 1000000007\nni = lambda: int(ns())\nnin = lambda y: [ni() for _ in range(y)]\nna = lambda: list(map(int, stdin.readline().split()))\nnan = lambda y: [na() for _ in range(y)]\nnf = lambda: float(ns())\nnfn = lambda y: [nf() for _ in range(y)]\nnfa = lambda: list(map(float, stdin.readline().split()))\nnfan = lambda y: [nfa() for _ in range(y)]\nns = lambda: stdin.readline().rstrip()\nnsn = lambda y: [ns() for _ in range(y)]\nncl = lambda y: [list(ns()) for _ in range(y)]\nnas = lambda: stdin.readline().split()\nn, k = nin(2)\nx = na()\nans = 0\nfor i in range(n):\n ans += min(abs(x[i] - k) * 2, abs(x[i]) * 2)\nprint(ans)\n", "fast_code": "N = int(eval(input()))\nK = int(eval(input()))\nxs = [int(i) for i in input().split()]\nhalf = K / 2\ntotal = 0\nfor x in xs:\n if x < half:\n total += x\n else:\n total += K - x\n\nprint((2 * total))\n", "slow_time": 100447964, "fast_time": 30613753, "speedup": 3.2811, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_23"} +{"pair_id": "python_13715", "problem_id": "p02930", "language": "python", "slow_code": "N, j = int(eval(input())), 0\nexec(\"print(*[9-format(i+1,'09b').rfind('1')for i in range(N)][:N-j-1]);j+=1;\" * N)\n", "fast_code": "n = eval(input())\nwhile n:\n n -= 1\n for j in range(n):\n print(-~bin(j + 1)[::-1].find(\"1\"))\n", "slow_time": 1492569068, "fast_time": 695412314, "speedup": 2.1463, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_2"} +{"pair_id": "python_8925", "problem_id": "p02641", "language": "python", "slow_code": "x, n = list(map(int, input().split()))\nif n == 0:\n print(x)\n exit()\narr = list(map(int, input().split()))\narr2 = []\narr3 = []\nfor i in range(-50, 110):\n if not i in arr:\n arr2.append(i)\n arr3.append(abs(x - i))\nn2 = min([i for i, v in enumerate(arr3) if v == min(arr3)])\nprint((arr2[n2]))\n", "fast_code": "x, n = list(map(int, input().split()))\np = set(map(int, input().split()))\nans = 1000\nans = min(abs(x - i) for i in range(102) if i not in p)\nprint((x + ans if x - ans in p else x - ans))\n", "slow_time": 200917191, "fast_time": 27588791, "speedup": 7.2826, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_11"} +{"pair_id": "python_3290", "problem_id": "p03354", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = float(\"inf\")\nMOD = 10**9 + 7\n\n\nclass UnionFind:\n \"\"\"\"\"\"\n\n def __init__(self, n):\n self.n = n\n\n self.par = [i for i in range(n + 1)]\n\n self.rank = [0] * (n + 1)\n\n self.size = [1] * (n + 1)\n\n self.tree = [True] * (n + 1)\n\n def find(self, x):\n \"\"\"\"\"\"\n\n if self.par[x] == x:\n return x\n else:\n\n self.par[x] = self.find(self.par[x])\n return self.par[x]\n\n def union(self, x, y):\n \"\"\"\"\"\"\n\n x = self.find(x)\n y = self.find(y)\n\n if x == y:\n self.tree[x] = False\n return\n if not self.tree[x] or not self.tree[y]:\n self.tree[x] = self.tree[y] = False\n\n if self.rank[x] < self.rank[y]:\n self.par[x] = y\n self.size[y] += self.size[x]\n else:\n self.par[y] = x\n self.size[x] += self.size[y]\n\n if self.rank[x] == self.rank[y]:\n self.rank[x] += 1\n\n def same(self, x, y):\n \"\"\"\"\"\"\n return self.find(x) == self.find(y)\n\n def get_size(self, x):\n \"\"\"\"\"\"\n return self.size[self.find(x)]\n\n def is_tree(self, x):\n \"\"\"\"\"\"\n return self.tree[self.find(x)]\n\n def len(self):\n \"\"\"\"\"\"\n res = set()\n for i in range(self.n + 1):\n res.add(self.find(i))\n\n return len(res) - 1\n\n\nN, M = MAP()\nP = [p - 1 for p in LIST()]\nuf = UnionFind(N)\nfor i in range(M):\n a, b = MAP()\n a -= 1\n b -= 1\n uf.union(P[a], P[b])\ncnt = 0\nfor i in range(N):\n p = P[i]\n if uf.same(p, i):\n cnt += 1\nprint(cnt)\n", "fast_code": "class Unionfind:\n def __init__(self, n):\n self.uf = [-1] * n\n\n def find(self, x):\n if self.uf[x] < 0:\n return x\n else:\n self.uf[x] = self.find(self.uf[x])\n return self.uf[x]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.uf[x] > self.uf[y]:\n x, y = y, x\n self.uf[x] += self.uf[y]\n self.uf[y] = x\n\n def size(self, x):\n x = self.find(x)\n return -self.uf[x]\n\n\nn, m = list(map(int, input().split()))\nl = list(map(int, input().split()))\nu = Unionfind(n)\nfor i in range(m):\n x, y = list(map(int, input().split()))\n u.union(x - 1, y - 1)\nans = 0\nfor i in range(n):\n if u.same(i, l[i] - 1):\n ans += 1\nprint(ans)\n", "slow_time": 247598194, "fast_time": 92958802, "speedup": 2.6635, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_19"} +{"pair_id": "python_6139", "problem_id": "p03173", "language": "python", "slow_code": "from numpy import *\n\nn, a = open(0)\nn = int(n)\na = cumsum(int64([0] + a.split()))\ndp = zeros((n, n + 1), \"i8\")\nfor k in range(1, n):\n l = arange(n - k)\n r = arange(k + 1, n + 1)\n m = array([arange(i + 1, i + k + 1) for i in range(n - k)]).T\n dp[l, r] = amin(dp[l, m] + dp[m, r], 0) + a[r] - a[l]\nprint((dp[0, n]))\n", "fast_code": "import sys\n\nINF = 10**14\nLI = lambda: [int(x) for x in sys.stdin.readline().split()]\nNI = lambda: int(sys.stdin.readline())\nN = NI()\na = LI()\nsn = [[0 for _ in range(N)] for _ in range(N)]\ndp = [[INF for _ in range(N)] for _ in range(N)]\nfor i in range(N):\n x = 0\n for j in range(i, N):\n x += a[j]\n sn[i][j] = x\nfor i in range(N):\n dp[i][i] = 0\nfor j in range(1, N):\n for i in range(j - 1, -1, -1):\n for k in range(0, j - i):\n dp[i][j] = min(dp[i][j], dp[i + k + 1][j] + dp[i][i + k] + sn[i][j])\nprint((dp[0][-1]))\n", "slow_time": 9602766263, "fast_time": 83518646, "speedup": 114.9775, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_15"} +{"pair_id": "python_12900", "problem_id": "p03549", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\nans = 0\nfor i in range(1, 10**6):\n ans += (\n ((1 - (1 / 2) ** M) ** (i - 1))\n * ((1 / 2) ** M)\n * (1900 * M + 100 * (N - M))\n * i\n )\nprint((int(round(ans, -2))))\n", "fast_code": "N, M = list(map(int, input().split()))\nprint(((M * 1900 + (N - M) * 100) * pow(2, M)))\n", "slow_time": 232562177130, "fast_time": 12678174, "speedup": 18343.5073, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_29"} +{"pair_id": "python_5481", "problem_id": "p02392", "language": "python", "slow_code": "import sys\n\nif __name__ == \"__main__\":\n import doctest\n\n doctest.testmod()\n a, b, c = list(map(int, sys.stdin.read().split()))\n if a < b < c:\n print(\"Yes\")\n else:\n print(\"No\")\n", "fast_code": "[a, b, c] = list(map(int, input().split()))\nprint(({True: \"Yes\", False: \"No\"}[a < b < c]))\n", "slow_time": 3028838454, "fast_time": 14458585, "speedup": 209.4837, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_17"} +{"pair_id": "python_14293", "problem_id": "p03609", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nX, t = MI()\nprint((max(0, X - t)))\n", "fast_code": "import numpy as np\n\nx, t = list(map(int, input().split()))\nprint((np.max(np.array([x - t, 0]))))\n", "slow_time": 52898444, "fast_time": 14961622, "speedup": 3.5356, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_12"} +{"pair_id": "python_14678", "problem_id": "p02713", "language": "python", "slow_code": "import math\nfrom functools import reduce\n\nk = int(eval(input()))\n\n\ndef gcd(*numbers):\n return reduce(math.gcd, numbers)\n\n\nans = 0\nfor i in range(1, k + 1):\n for j in range(1, k + 1):\n for l in range(1, k + 1):\n ans += gcd(i, j, l)\nprint(ans)\n", "fast_code": "from sys import stdin\nimport numpy as np\n\n\ndef main():\n\n readline = stdin.readline\n k = int(readline())\n a = np.arange(1, k + 1, dtype=np.int64)\n b = np.gcd.outer(np.gcd.outer(a, a), a)\n print((b.sum()))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 44139168611, "fast_time": 489850399, "speedup": 90.1074, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_27"} +{"pair_id": "python_709", "problem_id": "p03244", "language": "python", "slow_code": "def main():\n n, *v = list(map(int, open(0).read().split()))\n be = [0] * int(1e5)\n bo = [0] * int(1e5)\n for e, o in zip(*[iter(v)] * 2):\n be[e - 1] += 1\n bo[o - 1] += 1\n if be.index(max(be)) == bo.index(max(bo)):\n ve = max(be)\n vo = max(bo)\n be[be.index(ve)] = 0\n bo[bo.index(vo)] = 0\n print((min(n - ve - max(bo), n - vo - max(be))))\n else:\n print((n - max(be) - max(bo)))\n return\n\n\nmain()\n", "fast_code": "import collections as coll\n\nn = int(eval(input()))\nv = list(map(int, input().split()))\neven = []\nodd = []\nfor i in range(n):\n if i % 2 == 0:\n even.append(v[i])\n else:\n odd.append(v[i])\noddc = coll.Counter(odd).most_common()[:2]\nevenc = coll.Counter(even).most_common()[:2]\nif len(oddc) == 1:\n oddc.append((0, 0))\nif len(evenc) == 1:\n evenc.append((0, 0))\nif oddc[0][0] != evenc[0][0]:\n print((n - oddc[0][1] - evenc[0][1]))\nelse:\n print((min(n - oddc[0][1] - evenc[1][1], n - oddc[1][1] - evenc[0][1])))\n", "slow_time": 2695635546, "fast_time": 65731768, "speedup": 41.0096, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_9"} +{"pair_id": "python_1274", "problem_id": "p03294", "language": "python", "slow_code": "def gcd(a, b):\n return a if b == 0 else gcd(b, a % b)\n\n\ndef lcm(a, b):\n return a * b // gcd(a, b)\n\n\nN = int(eval(input()))\nA = list(map(int, input().split()))\nl = 0\nfor i in range(1, len(A)):\n l = lcm(A[i - 1], A[i])\nans = l - 1\nans = sum(A) - len(A)\nprint(ans)\n", "fast_code": "N = int(eval(input()))\naN = list(map(int, input().split()))\nprint((sum(aN) - N))\n", "slow_time": 35495565, "fast_time": 13861065, "speedup": 2.5608, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_0"} +{"pair_id": "python_2993", "problem_id": "p02994", "language": "python", "slow_code": "import copy\n\nN, L = list(map(int, input().split()))\napple_taste = [L + i for i in range(N)]\npie_taste = sum(apple_taste)\nmin_diff = 100000\nfor i in range(N):\n ap = copy.deepcopy(apple_taste)\n ap[i] = 0\n pie_taste2 = sum(ap)\n diff = abs(pie_taste - pie_taste2)\n if diff < min_diff:\n min_diff = diff\n min_index = i\napple_taste[min_index] = 0\nprint((sum(apple_taste)))\n", "fast_code": "inf = float(\"inf\")\nN, L = list(map(int, input().split()))\ns = 0\neat = inf\nfor i in range(L, L + N):\n if abs(i) < abs(eat):\n eat = i\n s += i\nprint((s - eat))\n", "slow_time": 55543320, "fast_time": 22715575, "speedup": 2.4452, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_7"} +{"pair_id": "python_8128", "problem_id": "p03352", "language": "python", "slow_code": "X = int(eval(input()))\nans = 1\nfor i in range(1, X + 1):\n for j in range(2, X + 1):\n if i**j <= X:\n ans = max(ans, i**j)\n else:\n break\nprint(ans)\n", "fast_code": "x = int(eval(input()))\nans = 1\nif x == 1:\n print((1))\nelse:\n b = 2\n while b**2 <= x:\n p = 2\n while b**p <= x:\n ans = max(b**p, ans)\n p += 1\n b += 1\n print(ans)\n", "slow_time": 149546981, "fast_time": 28624218, "speedup": 5.2245, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_19"} +{"pair_id": "python_3553", "problem_id": "p03077", "language": "python", "slow_code": "import sys\nimport math\n\n\ndef get_num():\n return int(eval(input()))\n\n\ndef get_nums(n):\n res = [0 for _ in range(n)]\n for i in range(n):\n res[i] = int(eval(input()))\n return res\n\n\ndef get_numbers():\n return list(map(int, input().split()))\n\n\nn = get_num()\ncosts = get_nums(5)\nmax_time = 0\nfor cost in costs:\n max_time = max(max_time, int(math.ceil(n / cost)))\nprint((max_time + 4))\n", "fast_code": "n, *a = eval(\"int(input()),\" * 6)\nprint((4 - -n // min(a)))\n", "slow_time": 57316020, "fast_time": 20357921, "speedup": 2.8154, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_24"} +{"pair_id": "python_8556", "problem_id": "p03722", "language": "python", "slow_code": "inf = float(\"inf\")\nV, E = list(map(int, input().split()))\nedge = []\nedge_rev = []\nfor i in range(E):\n A, B, C = list(map(int, input().split()))\n edge_rev.append([B - 1, A - 1, -C])\n edge.append([A - 1, B - 1, -C])\nd = [inf] * V\nd[0] = 0\nfor i in range(V):\n update = False\n for j in range(E):\n From, To, cost = edge[j]\n if d[From] != inf and d[To] > d[From] + cost:\n d[To] = d[From] + cost\n update = True\n if not update:\n break\nd_rev = [inf] * V\nd_rev[V - 1] = 0\nfor i in range(V):\n update = False\n for j in range(E):\n From, To, cost = edge_rev[j]\n if d_rev[From] != inf and d_rev[To] > d_rev[From] + cost:\n d_rev[To] = d_rev[From] + cost\n update = True\n if not update:\n break\nd_ = [x for x in d]\nd_rev_ = [x for x in d_rev]\nfor j in range(E):\n From, To, cost = edge[j]\n if d[From] != inf and d_rev[From] != inf and d[To] > d[From] + cost:\n d[To] = d[From] + cost\nfor j in range(E):\n From, To, cost = edge_rev[j]\n if d[From] != inf and d_rev[From] != inf and d_rev[To] > d_rev[From] + cost:\n d_rev[To] = d_rev[From] + cost\nloop = False\nfor i in range(V):\n if d[i] != 0 and d_rev[i] != 0:\n loop = (d[i] + d_rev[i] != d_[i] + d_rev_[i]) or loop\nif loop:\n print(\"inf\")\nelse:\n ans = -d[-1]\n print(ans)\n", "fast_code": "N, M = list(map(int, input().split()))\nabc = []\nfor _ in range(M):\n abc.append(list(map(int, input().split())))\ncost = [-float(\"inf\")] * N\ncost[0] = 0\nfor i in range(2):\n for a, b, c in abc:\n a, b = a - 1, b - 1\n cost[b] = max(cost[b], cost[a] + c)\n if i == 0:\n ans = cost[N - 1]\n else:\n Max = cost[N - 1]\nif ans != Max:\n print(\"inf\")\nelse:\n print(ans)\n", "slow_time": 135847820, "fast_time": 45176202, "speedup": 3.0071, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_20"} +{"pair_id": "python_2400", "problem_id": "p03141", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\nsys.setrecursionlimit(10**5)\n\n\ndef li():\n return list(map(int, stdin.readline().split()))\n\n\ndef li_():\n return [int(x) - 1 for x in stdin.readline().split()]\n\n\ndef lf():\n return list(map(float, stdin.readline().split()))\n\n\ndef ls():\n return stdin.readline().split()\n\n\ndef ns():\n return stdin.readline().rstrip()\n\n\ndef lc():\n return list(ns())\n\n\ndef ni():\n return int(stdin.readline())\n\n\ndef nf():\n return float(stdin.readline())\n\n\nfrom heapq import heappush, heappop\n\nn = ni()\nab = [tuple(li()) for _ in range(n)]\nque = []\nfor ai, bi in ab:\n heappush(que, [-ai - bi, ai, bi])\ncnt = 0\ntak = 0\naok = 0\nwhile que:\n sm, ai, bi = heappop(que)\n if cnt % 2 == 0:\n tak += ai\n else:\n aok += bi\n cnt += 1\nprint((tak - aok))\n", "fast_code": "n = int(eval(input()))\nab = []\nfor i in range(n):\n a, b = list(map(int, input().split(\" \")))\n ab.append([a + b, a, b])\nab.sort(reverse=True)\nresult = 0\nfor i in range(n):\n if i % 2 == 0:\n result += ab[i][1]\n else:\n result -= ab[i][2]\nprint(result)\n", "slow_time": 86818307, "fast_time": 36234466, "speedup": 2.396, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_4"} +{"pair_id": "python_16971", "problem_id": "p02804", "language": "python", "slow_code": "N_MAX = 10**6\nMOD = 10**9 + 7\nfac, finv, inv = [0] * N_MAX, [0] * N_MAX, [0] * N_MAX\n\n\ndef com_init():\n fac[0], fac[1] = 1, 1\n finv[0], finv[1] = 1, 1\n inv[1] = 1\n for i in range(2, N_MAX):\n fac[i] = fac[i - 1] * i % MOD\n inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD\n finv[i] = finv[i - 1] * inv[i] % MOD\n\n\ndef com(n, k):\n if n < k:\n return 0\n if n < 0 or k < 0:\n return 0\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD\n\n\nn, k = list(map(int, input().split()))\nal = list(map(int, input().split()))\ncom_init()\nal.sort()\nans_max = 0\nans_min = 0\nfor i, a in enumerate(al):\n ans_max += a * com(i, k - 1)\n ans_max %= MOD\n ans_min += a * com(n - 1 - i, k - 1)\n ans_min %= MOD\nprint(((ans_max - ans_min) % MOD))\n", "fast_code": "mod = 10**9 + 7\n\n\ndef cmb(n, r, p):\n if (r < 0) or (n < r):\n return 0\n r = min(r, n - r)\n return fact[n] * factinv[r] * factinv[n - r] % p\n\n\nfact = [1, 1]\nfactinv = [1, 1]\ninv = [0, 1]\np = mod\nfor i in range(2, 10**5 + 1):\n fact.append((fact[-1] * i) % p)\n inv.append((-inv[p % i] * (p // i)) % p)\n factinv.append((factinv[-1] * inv[-1]) % p)\nN, K = list(map(int, input().split()))\nA = sorted(map(int, input().split()))\nR = sorted(A, reverse=True)\nans = 0\nfor i in range(N - K + 1):\n t = cmb(N - i - 1, K - 1, mod)\n mi = A[i] * t % mod\n ma = A[N - (i + 1)] * t % mod\n ans = (ans + ma - mi) % mod\nprint(ans)\n", "slow_time": 181158031493, "fast_time": 27384978772, "speedup": 6.6152, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_23"} +{"pair_id": "python_17394", "problem_id": "p02834", "language": "python", "slow_code": "class Tree:\n def __init__(self, n, edge, indexed=1):\n self.n = n\n self.tree = [[] for _ in range(n)]\n for e in edge:\n self.tree[e[0] - indexed].append(e[1] - indexed)\n self.tree[e[1] - indexed].append(e[0] - indexed)\n\n def setroot(self, root):\n self.root = root\n self.parent = [None for _ in range(self.n)]\n self.parent[root] = -1\n self.depth = [None for _ in range(self.n)]\n self.depth[root] = 0\n self.order = []\n self.order.append(root)\n self.size = [1 for _ in range(self.n)]\n stack = [root]\n while stack:\n node = stack.pop()\n for adj in self.tree[node]:\n if self.parent[adj] is None:\n self.parent[adj] = node\n self.depth[adj] = self.depth[node] + 1\n self.order.append(adj)\n stack.append(adj)\n for node in self.order[::-1]:\n for adj in self.tree[node]:\n if self.parent[node] == adj:\n continue\n self.size[node] += self.size[adj]\n\n def heavylight_decomposition(self):\n self.order = [None for _ in range(self.n)]\n self.head = [None for _ in range(self.n)]\n self.head[self.root] = self.root\n self.next = [None for _ in range(self.n)]\n stack = [self.root]\n order = 0\n while stack:\n node = stack.pop()\n self.order[node] = order\n order += 1\n maxsize = 0\n for adj in self.tree[node]:\n if self.parent[node] == adj:\n continue\n if maxsize < self.size[adj]:\n maxsize = self.size[adj]\n self.next[node] = adj\n for adj in self.tree[node]:\n if self.parent[node] == adj or self.next[node] == adj:\n continue\n self.head[adj] = adj\n stack.append(adj)\n if self.next[node] is not None:\n self.head[self.next[node]] = self.head[node]\n stack.append(self.next[node])\n\n def range_hld(self, u, v, edge=False):\n res = []\n while True:\n if self.order[u] > self.order[v]:\n u, v = v, u\n if self.head[u] != self.head[v]:\n res.append((self.order[self.head[v]], self.order[v] + 1))\n v = self.parent[self.head[v]]\n else:\n res.append((self.order[u] + edge, self.order[v] + 1))\n return res\n\n def subtree_hld(self, u):\n return self.order[u], self.order[u] + self.size[u]\n\n def lca_hld(self, u, v):\n while True:\n if self.order[u] > self.order[v]:\n u, v = v, u\n if self.head[u] != self.head[v]:\n v = self.parent[self.head[v]]\n else:\n return u\n\n\nclass SegmentTree:\n def __init__(self, arr, func=min, ie=2**63):\n self.h = (len(arr) - 1).bit_length()\n self.n = 2**self.h\n self.ie = ie\n self.func = func\n self.tree = [ie for _ in range(2 * self.n)]\n for i in range(len(arr)):\n self.tree[self.n + i] = arr[i]\n for i in range(1, self.n)[::-1]:\n self.tree[i] = func(self.tree[2 * i], self.tree[2 * i + 1])\n\n def set(self, idx, x):\n idx += self.n\n self.tree[idx] = x\n while idx:\n idx >>= 1\n self.tree[idx] = self.func(self.tree[2 * idx], self.tree[2 * idx + 1])\n\n def query(self, lt, rt):\n lt += self.n\n rt += self.n\n vl = vr = self.ie\n while rt - lt > 0:\n if lt & 1:\n vl = self.func(vl, self.tree[lt])\n lt += 1\n if rt & 1:\n rt -= 1\n vr = self.func(self.tree[rt], vr)\n lt >>= 1\n rt >>= 1\n return self.func(vl, vr)\n\n\nimport sys\n\ninput = sys.stdin.readline\nN, u, v = list(map(int, input().split()))\nu -= 1\nv -= 1\nE = [tuple(map(int, input().split())) for _ in range(N - 1)]\nt = Tree(N, E)\nt.setroot(v)\nt.heavylight_decomposition()\nd = t.depth[u]\nk = (d + 1) // 2 - 1\nfor _ in range(k):\n u = t.parent[u]\narr = [None for _ in range(N)]\nfor i in range(N):\n arr[t.order[i]] = t.depth[i]\nst = SegmentTree(arr, max, -1)\nlt, rt = t.subtree_hld(u)\nmaxdep = st.query(lt, rt)\nprint((maxdep - 1))\n", "fast_code": "f = lambda: list(map(int, input().split()))\nn, st, sa = f()\nst -= 1\nsa -= 1\ng = [[] for _ in range(n)]\nfor _ in range(n - 1):\n a, b = f()\n g[a - 1].append(b - 1)\n g[b - 1].append(a - 1)\n\n\ndef bfs(s):\n l = [-1] * n\n l[s] = 0\n q = [s]\n while q:\n v = q.pop()\n d = l[v] + 1\n for c in g[v]:\n if l[c] < 0:\n l[c] = d\n q += [c]\n return l\n\n\nlt = bfs(st)\nla = bfs(sa)\nm = 0\nfor i in range(n):\n if lt[i] < la[i]:\n m = max(m, la[i])\nprint((m - 1))\n", "slow_time": 196965124, "fast_time": 37754481, "speedup": 5.217, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_8"} +{"pair_id": "python_15795", "problem_id": "p03331", "language": "python", "slow_code": "N = int(eval(input()))\n\n\ndef sum_of(num):\n list_b = []\n k = 0\n while num > 0:\n list_b.append(num % 10)\n num //= 10\n for i in range(len(list_b)):\n k += list_b[i]\n return k\n\n\nlist_a = []\nif N <= 10:\n print((str(N)))\nif N > 10:\n for i in range(2, (N - 1) // 2 + 1):\n A = i\n B = N - i\n list_a.append(sum_of(A) + sum_of(B))\n print((min(list_a)))\n", "fast_code": "n = int(eval(input()))\nprint((10 if n in [10**x for x in range(6)] else sum(map(int, str(n)))))\n", "slow_time": 77767512, "fast_time": 18462413, "speedup": 4.2122, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_3"} +{"pair_id": "python_9398", "problem_id": "p02675", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nimport bisect\n\nINF = 10**13\nMOD = 10**9 + 7\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef gcd(x, y):\n return x if y == 0 else gcd(y, x % y)\n\n\ndef lcm(x, y):\n return (x * y) // gcd(x, y)\n\n\ndef I():\n return int(input())\n\n\ndef LI():\n return [int(x) for x in input().split()]\n\n\ndef RI(N):\n return [int(input()) for _ in range(N)]\n\n\ndef LRI(N):\n return [[int(x) for x in input().split()] for _ in range(N)]\n\n\ndef LS():\n return input().split()\n\n\ndef RS(N):\n return [input() for _ in range(N)]\n\n\ndef LRS(N):\n return [input().split() for _ in range(N)]\n\n\ndef PL(L):\n print(*L, sep=\"\\n\")\n\n\ndef YesNo(B):\n print(\"Yes\" if B else \"No\")\n\n\ndef YESNO(B):\n print(\"YES\" if B else \"NO\")\n\n\nN = input()\nn = int(N[-1])\nif n in [2, 4, 5, 7, 9]:\n print(\"hon\")\nelif n in [0, 1, 6, 8]:\n print(\"pon\")\nelse:\n print(\"bon\")\n", "fast_code": "N = int(eval(input()))\nch = [\"pon\", \"pon\", \"hon\", \"bon\", \"hon\", \"hon\", \"pon\", \"hon\", \"pon\", \"hon\"]\nprint((ch[N % 10]))\n", "slow_time": 116219356, "fast_time": 15947940, "speedup": 7.2874, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_20"} +{"pair_id": "python_2708", "problem_id": "p02630", "language": "python", "slow_code": "v = [0 for i in range(100001)]\nn = int(eval(input()))\nar = list(map(int, input().split()))\ns = 0\nfor i in ar:\n s += i\n v[i] += 1\nq = int(eval(input()))\nfor i in range(q):\n a, b = list(map(int, input().split()))\n s -= a * v[a]\n s += b * v[a]\n v[b] += v[a]\n v[a] = 0\n print(s)\n", "fast_code": "from collections import Counter\n\nn = int(eval(input()))\na = list(map(int, input().split()))\nq = int(eval(input()))\nbc = [list(map(int, input().split())) for _ in range(q)]\nsuma = sum(a)\ncounter = Counter(a)\nfor b, c in bc:\n suma -= b * counter[b]\n suma += c * counter[b]\n counter[c] += counter[b]\n counter[b] = 0\n print(suma)\n", "slow_time": 1231037540, "fast_time": 51618295, "speedup": 23.8489, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_2"} +{"pair_id": "python_4430", "problem_id": "p03136", "language": "python", "slow_code": "import sys, re, os\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\nfrom itertools import permutations, combinations, product, accumulate\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom heapq import heapify, heappop, heappush\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef S_MAP():\n return list(map(str, input().split()))\n\n\ndef LIST():\n return list(map(int, input().split()))\n\n\ndef S_LIST():\n return list(map(str, input().split()))\n\n\nsys.setrecursionlimit(10**9)\nINF = float(\"inf\")\nmod = 10**9 + 7\nN = INT()\nL = LIST()\nl = sorted(L)\nif l[-1] < sum(l[:-1]):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "polygon_side = int(eval(input()))\nside_length = list(map(int, input().split()))\nif max(side_length) * 2 < sum(side_length):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 77294402, "fast_time": 19675444, "speedup": 3.9285, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_9"} +{"pair_id": "python_6709", "problem_id": "p00070", "language": "python", "slow_code": "import sys\n\nK = 1024\nN = 331\nR = list(range(K))\nB = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]\nC = [0] * K\nD = [[0 for i in range(N)] for j in R]\n\n\ndef init():\n global C, D\n for i in R:\n s = format(i, \"b\")\n n = s.count(\"1\")\n C[i] = n\n if n == 1:\n D[i][B.index(i)] = 1\n else:\n for j in range(len(s)):\n if s[-j - 1] == \"1\":\n dp = n * j\n i2 = i - B[j]\n for k in range(N - dp):\n D[i][k + dp] += D[i2][k]\n return\n\n\ninit()\nfor a in sys.stdin:\n n, s = list(map(int, a.split()))\n x = 0\n if s < N:\n x = sum([D[i][s] for i in R if C[i] == n])\n print(x)\n", "fast_code": "import sys\n\n\ndef f0070(A, n, s):\n if n == 1:\n if s in A:\n f = 1\n else:\n f = 0\n return f\n c = 0\n A = sorted(A)\n A1 = A[:n][::-1]\n A2 = A[-n:]\n N = list(range(n))\n\n def f(A):\n return sum([(i + 1) * A[i] for i in N])\n\n if f(A1) <= s <= f(A2):\n for i in range(len(A)):\n b = s - A[i] * n\n c += f0070(A[:i] + A[i + 1 :], n - 1, b)\n return c\n\n\nfor a in sys.stdin:\n n, s = list(map(int, a.split()))\n print(f0070(list(range(10)), n, s))\n", "slow_time": 56673214149, "fast_time": 94563075, "speedup": 599.3165, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_4"} +{"pair_id": "python_7686", "problem_id": "p02838", "language": "python", "slow_code": "mod = 1000000007\nans = 0\nn = int(eval(input()))\na = [int(i) for i in input().split()]\nx = [[0] * 63 for i in range(n + 1)]\nl = [(2**i) % mod for i in range(63)]\nfor i in range(n):\n d = a[i]\n cnt = 0\n for j in range(63):\n if d & 1:\n x[i + 1][cnt] = x[i][cnt] + 1\n else:\n x[i + 1][cnt] = x[i][cnt]\n cnt += 1\n d = d >> 1\nfor i in range(1, n):\n for j in range(63):\n p = x[i][j] - x[i - 1][j]\n if p:\n ans += l[j] * ((n - i) - (x[-1][j] - x[i][j]))\n else:\n ans += l[j] * (x[-1][j] - x[i][j])\n ans %= mod\nprint(ans)\n", "fast_code": "n = int(eval(input()))\na = list(map(int, input().split()))\nmod = 10**9 + 7\nmd = len(bin(max(a))) - 2\nans = 0\nfor d in range(md):\n cnt1 = sum([1 for i in a if ((i >> d) & 1)])\n ans += cnt1 * (n - cnt1) * (1 << d)\n ans %= mod\nprint((ans % mod))\n", "slow_time": 280836259, "fast_time": 48475387, "speedup": 5.7934, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_9"} +{"pair_id": "python_17803", "problem_id": "p03456", "language": "python", "slow_code": "a, b = list(map(str, input().split()))\nx = int(a + b)\nans = \"No\"\nfor i in range(x // 2):\n if x == i * i:\n ans = \"Yes\"\nprint(ans)\n", "fast_code": "x1, x2 = input().split()\ns = int(x1 + x2)\ntable = []\nfor i in range(1, 1000):\n table.append(i * i)\nfor x in table:\n if x == s:\n print(\"Yes\")\n quit()\nprint(\"No\")\n", "slow_time": 729346459, "fast_time": 98989051, "speedup": 7.368, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_13"} +{"pair_id": "python_6596", "problem_id": "p00741", "language": "python", "slow_code": "import sys\nfrom pprint import pprint\n\n\nclass UnionFind:\n def __init__(self):\n self._parent = {}\n self._rank = {}\n self._equiv = {}\n\n def _find(self, x):\n if self._parent[x] == x:\n return self._parent[x]\n else:\n p = self._find(self._parent[x])\n self._parent[x] = p\n return p\n\n def _set_parent(self, child, parent):\n self._parent[child] = parent\n self._equiv[parent].update(self._equiv.pop(child))\n\n def _union(self, x, y):\n x = self._find(x)\n y = self._find(y)\n if x == y:\n return\n if self._rank[x] > self._rank[y]:\n self._set_parent(y, x)\n elif self._rank[x] < self._rank[y]:\n self._set_parent(x, y)\n else:\n self._set_parent(x, y)\n self._rank[x] += 1\n\n def _make_set(self, x):\n self._parent[x] = x\n self._rank[x] = 0\n self._equiv[x] = {x}\n\n def unite(self, *elements):\n if not elements:\n return\n for x in elements:\n if x in self._parent:\n continue\n self._make_set(x)\n x0 = elements[0]\n for x in elements[1:]:\n self._union(x0, x)\n\n def groups(self):\n return [set(e) for e in list(self._equiv.values())]\n\n\ndef pairs(ncol, nrow):\n\n for x in range(ncol - 1):\n for y in range(nrow):\n yield [(x, y), (x + 1, y)]\n\n for x in range(ncol):\n for y in range(nrow - 1):\n yield [(x, y), (x, y + 1)]\n\n for x in range(ncol - 1):\n for y in range(nrow - 1):\n yield [(x, y), (x + 1, y + 1)]\n\n for x in range(ncol - 1):\n for y in range(1, nrow):\n yield [(x, y), (x + 1, y - 1)]\n\n\ndef solve(ncol, nrow, rows):\n f = UnionFind()\n for x in range(ncol):\n for y in range(nrow):\n if rows[y][x]:\n f.unite((x, y))\n for (x1, y1), (x2, y2) in pairs(ncol, nrow):\n if rows[y1][x1] and rows[y2][x2]:\n f.unite((x1, y1), (x2, y2))\n return len(f.groups())\n\n\ndef main():\n while True:\n ncol, nrow = list(map(int, input().split()))\n if ncol == 0 and nrow == 0:\n break\n rows = []\n for _ in range(nrow):\n row = list(map(int, input().split()))\n rows.append(row)\n print((solve(ncol, nrow, rows)))\n\n\nmain()\n", "fast_code": "def solve():\n from collections import deque\n\n while True:\n w, h = [int(x) + 2 for x in input().split()]\n if w == 2:\n break\n result = 0\n a = [\"0\"] * w\n for _ in [0] * (h - 2):\n a += [\"0\"] + input().split() + [\"0\"]\n a += [\"0\"] * w\n for i in range(w * h):\n if a[i] != \"1\":\n continue\n a[i] = \"0\"\n result += 1\n dq = deque([i])\n while dq:\n j = dq.popleft()\n for dest in (\n j - w - 1,\n j - w,\n j - w + 1,\n j - 1,\n j + 1,\n j + w - 1,\n j + w,\n j + w + 1,\n ):\n if a[dest] == \"1\":\n a[dest] = \"0\"\n dq.append(dest)\n print(result)\n\n\nif __name__ == \"__main__\":\n solve()\n", "slow_time": 271738057, "fast_time": 84760537, "speedup": 3.206, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_11"} +{"pair_id": "python_14318", "problem_id": "p03972", "language": "python", "slow_code": "import itertools\nimport os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nIINF = 10**18\nMOD = 10**9 + 7\n\n\nclass UnionFind:\n def __init__(self, size=None, nodes=None):\n \"\"\"\"\"\"\n assert size is not None or nodes is not None\n if size is not None:\n self._parents = [i for i in range(size)]\n self._ranks = [0 for _ in range(size)]\n self._sizes = [1 for _ in range(size)]\n else:\n self._parents = {k: k for k in nodes}\n self._ranks = {k: 0 for k in nodes}\n self._sizes = {k: 1 for k in nodes}\n\n def unite(self, x, y):\n \"\"\"\"\"\"\n x = self.root(x)\n y = self.root(y)\n if x == y:\n return\n\n if self._ranks[x] > self._ranks[y]:\n\n self._parents[y] = x\n self._sizes[x] += self._sizes[y]\n else:\n\n self._parents[x] = y\n self._sizes[y] += self._sizes[x]\n if self._ranks[x] == self._ranks[y]:\n self._ranks[y] += 1\n\n def root(self, x):\n \"\"\"\"\"\"\n if self._parents[x] == x:\n return x\n self._parents[x] = self.root(self._parents[x])\n return self._parents[x]\n\n def size(self, x):\n \"\"\"\"\"\"\n return self._sizes[self.root(x)]\n\n\nW, H = list(map(int, sys.stdin.readline().split()))\nP = [int(sys.stdin.readline()) for _ in range(W)]\nQ = [int(sys.stdin.readline()) for _ in range(H)]\n\n\ndef test():\n edges = []\n vs = []\n for h, w in itertools.product(list(range(H + 1)), list(range(W + 1))):\n if w < W:\n edges.append((P[w], (w, h), (w + 1, h)))\n if h < H:\n edges.append((Q[h], (w, h), (w, h + 1)))\n for h, w in itertools.product(list(range(H + 1)), list(range(W + 1))):\n vs.append((w, h))\n edges.sort()\n\n uf = UnionFind(nodes=vs)\n ret = 0\n for s, v, u in edges:\n if uf.root(v) != uf.root(u):\n uf.unite(v, u)\n ret += s\n return ret\n\n\nhs = P.copy()\n\nvs = Q.copy()\nhs.sort(reverse=True)\nvs.sort(reverse=True)\nans = 0\nv_nodes = W + 1\nh_nodes = H + 1\nwhile hs or vs:\n if not vs or (hs and hs[-1] < vs[-1]):\n\n ans += hs.pop() * h_nodes\n v_nodes -= 1\n else:\n\n ans += vs.pop() * v_nodes\n h_nodes -= 1\nprint(ans)\n", "fast_code": "W, H = list(map(int, input().split()))\nP = [int(eval(input())) for i in range(W)]\nQ = [int(eval(input())) for j in range(H)]\nP.append(float(\"inf\"))\nQ.append(float(\"inf\"))\nP.sort(reverse=True)\nQ.sort(reverse=True)\nnow_W = W + 1\nnow_H = H + 1\ncost = 0\nwhile now_W > 1 or now_H > 1:\n if P[-1] < Q[-1]:\n cost += P.pop() * now_H\n now_W -= 1\n elif Q[-1] < P[-1]:\n cost += Q.pop() * now_W\n now_H -= 1\n elif P[-1] == Q[-1]:\n if now_W <= now_H:\n cost += Q.pop() * now_W\n now_H -= 1\n elif now_W > now_H:\n cost += P.pop() * now_H\n now_W -= 1\nprint(cost)\n", "slow_time": 217485236, "fast_time": 72819695, "speedup": 2.9866, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_0"} +{"pair_id": "python_8811", "problem_id": "p03371", "language": "python", "slow_code": "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nINF = 1 << 60\n\n\ndef main():\n A, B, C, X, Y = list(map(int, readline().split()))\n ans = INF\n for k in range(0, 2 * max(X, Y) + 1, 2):\n i = max(0, X - k // 2)\n j = max(0, Y - k // 2)\n if ans > A * i + B * j + C * k:\n ans = A * i + B * j + C * k\n print(ans)\n return\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "A, B, C, X, Y = list(map(int, input().split()))\nxn, yn = 0, 0\nprice = 0\nif A >= 2 * C and X > xn:\n ammount = X - xn\n price += C * X * 2\n xn += X\n yn += X\nif B >= 2 * C and Y > yn:\n ammount = Y - yn\n price += C * ammount * 2\n xn += ammount\n yn += ammount\nif (A + B) >= 2 * C and (X - xn) >= 1 and (Y - yn) >= 1:\n ammount = min(X, Y)\n price += C * ammount * 2\n xn += ammount\n yn += ammount\nif X - xn >= 1:\n price += A * (X - xn)\nif Y - yn >= 1:\n price += B * (Y - yn)\nprint(price)\n", "slow_time": 798774011, "fast_time": 48557915, "speedup": 16.4499, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_29"} +{"pair_id": "python_13263", "problem_id": "p02699", "language": "python", "slow_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nmod = 10**9 + 7\ninf = float(\"inf\")\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ns, w = LI()\nif w >= s:\n print(\"unsafe\")\nelse:\n print(\"safe\")\n", "fast_code": "def main():\n s, w = list(map(int, input().split()))\n answer = \"unsafe\" if w >= s else \"safe\"\n print(answer)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 41795967, "fast_time": 17550197, "speedup": 2.3815, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_17"} +{"pair_id": "python_6216", "problem_id": "p00040", "language": "python", "slow_code": "dict = [\n \"a\",\n \"b\",\n \"c\",\n \"d\",\n \"e\",\n \"f\",\n \"g\",\n \"h\",\n \"i\",\n \"j\",\n \"k\",\n \"l\",\n \"m\",\n \"n\",\n \"o\",\n \"p\",\n \"q\",\n \"r\",\n \"s\",\n \"t\",\n \"u\",\n \"v\",\n \"w\",\n \"x\",\n \"y\",\n \"z\",\n]\nlsalpha = [1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25]\nn = int(input())\nfor roop in range(n):\n code = input()\n for alpha in lsalpha:\n flag = 0\n for beta in range(26):\n decode = \"\"\n for chara in code:\n if chara != \" \":\n f = dict.index(chara)\n for i in range(26):\n if (alpha * i + beta) % 26 == f:\n dechara = dict[i]\n break\n decode += dechara\n else:\n decode += \" \"\n if decode.count(\"that\") > 0 or decode.count(\"this\") > 0:\n flag = 1\n break\n if flag == 1:\n break\n print(decode)\n", "fast_code": "import string\n\nA2Z = \"abcdefghijklmnopqrstuvwxyz\"\nR = list(range(26))\n\n\ndef decode(msg, L):\n x = \"\"\n for c in msg:\n x += L[A2Z.index(c)] if \"a\" <= c <= \"z\" else c\n return x\n\n\ndef affine(msg, a, b):\n L = \"\".join([A2Z[(i * a + b) % 26] for i in R])\n s = decode(msg, L)\n return s\n\n\ndef rot(msg, a):\n a = a % 26\n L = A2Z[a:] + A2Z[:a]\n s = decode(msg, L)\n return s\n\n\ndef checkkey(s):\n c0 = \"t\"\n for i in R:\n a = 0\n x = affine(s, i, 0)\n c = A2Z.index(x[0])\n if c != 19:\n a = (19 - c) % 26\n x = rot(x, a)\n if x in [\"this\", \"that\"]:\n return i, a\n return -1, -1\n\n\nn = eval(input())\nwhile n:\n n -= 1\n s = input()\n for w in s.split():\n if len(w) == 4:\n a, b = checkkey(w)\n if a != -1:\n break\n print(affine(s, a, b))\n", "slow_time": 6096430089, "fast_time": 123375682, "speedup": 49.4135, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_0"} +{"pair_id": "python_10722", "problem_id": "p03767", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef A():\n n = I()\n a = LI()\n a.sort(key=lambda x: -x)\n ans = 0\n for i in range(n):\n ans += a[2 * i + 1]\n print(ans)\n return\n\n\ndef B():\n def dfs(d, x, c):\n if d <= dp[x]:\n return\n dp[x] = d\n if not f[x]:\n f[x] = c\n for y in v[x]:\n dfs(d - 1, y, c)\n\n n, m = LI()\n f = [0] * n\n v = [[] for i in range(n)]\n for i in range(m):\n a, b = LI()\n a -= 1\n b -= 1\n v[a].append(b)\n v[b].append(a)\n dp = defaultdict(lambda: -1)\n q = I()\n l = LIR(q)\n l = l[::-1]\n for x, d, c in l:\n x -= 1\n dfs(d, x, c)\n for i in f:\n print(i)\n return\n\n\ndef C():\n n = I()\n return\n\n\ndef D():\n n = I()\n return\n\n\ndef E():\n n = I()\n return\n\n\ndef F():\n n = I()\n return\n\n\nif __name__ == \"__main__\":\n A()\n", "fast_code": "print(\n sum(\n sorted(list(map(int, exec(\"N=int(input())\") or input().split())))[\n -2 : -2 * N - 1 : -2\n ]\n )\n)\n", "slow_time": 173061558, "fast_time": 19422486, "speedup": 8.9104, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_9"} +{"pair_id": "python_5151", "problem_id": "p02409", "language": "python", "slow_code": "floor = [\n [\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n ],\n [\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n ],\n [\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n ],\n [\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n ],\n]\ns = \"####################\"\nn = int(input())\nfor c in range(n):\n (b, f, r, v) = [int(x) for x in input().split()]\n if 1 > b > 5 and 1 > f > 4 and 1 > r > 10:\n break\n floor[b - 1][f - 1][r - 1] += v\nfor z in range(4):\n for i in range(len(floor[z])):\n for v in floor[z][i]:\n print(end=\" \")\n print(v, end=\"\")\n print()\n if not z == 3:\n print(s)\n", "fast_code": "I = input\nr = range\na = [[[0 for i in r(10)] for j in r(3)] for k in r(4)]\nfor i in r(int(I())):\n b, f, r, v = list(map(int, I().split()))\n a[b - 1][f - 1][r - 1] += v\nf = 0\nfor i in a:\n if f:\n print((\"#\" * 20))\n else:\n f = 1\n for j in i:\n print(\"\", *j)\n", "slow_time": 141548888, "fast_time": 53259417, "speedup": 2.6577, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_4"} +{"pair_id": "python_1347", "problem_id": "p03037", "language": "python", "slow_code": "def myAnswer(N, M, L, R) -> int:\n total = 0\n MAXL = max(L)\n MINR = min(R)\n for i in range(1, N + 1):\n if MAXL <= i and MINR >= i:\n total += 1\n return total\n\n\ndef modelAnswer():\n tmp = 1\n\n\ndef main():\n N, M = list(map(int, input().split()))\n L = []\n R = []\n for _ in range(M):\n l, r = list(map(int, input().split()))\n L.append(l)\n R.append(r)\n print((myAnswer(N, M, L[:], R[:])))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "n, m = list(map(int, input().split()))\nll = [list(map(int, input().split())) for i in range(m)]\na = 0\nb = n\nfor l, r in ll:\n if a < l:\n a = l\n if r < b:\n b = r\nprint((max(b - a + 1, 0)))\n", "slow_time": 1129543532, "fast_time": 22038446, "speedup": 51.2533, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_27"} +{"pair_id": "python_14252", "problem_id": "p03558", "language": "python", "slow_code": "from collections import *\n\nq = deque([(1, 1)])\nk = eval(input())\nm = {}\nwhile q:\n n, s = q.pop()\n if (n in m) - 1:\n m[n] = s\n q += ((n * 10 % k, s),)\n q.appendleft((-~n % k, s + 1))\nprint(m[0])\n", "fast_code": "from collections import deque\n\n\ndef solve(K):\n checked = [99999999999] * (K + 1)\n queue = deque()\n queue.append((1, 1))\n checked[1] = 1\n while queue:\n x, n = queue.popleft()\n if x == 0:\n return n\n _ = (x * 10) % K\n if n < checked[_]:\n queue.appendleft((_, n))\n checked[_] = n\n _ = (x + 1) % K\n if n + 1 < checked[_]:\n queue.append((_, n + 1))\n checked[_] = n + 1\n return None\n\n\nK = int(eval(input()))\nprint((solve(K)))\n", "slow_time": 3795208339, "fast_time": 524611965, "speedup": 7.2343, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_0"} +{"pair_id": "python_7907", "problem_id": "p02708", "language": "python", "slow_code": "N, K = list(map(int, input().split()))\nMOD = 10**9 + 7\nLOW, HIGH = 0, N\nans = 0\nif 1 >= K:\n ans += HIGH - LOW + 1\nfor i in range(2, N + 2):\n LOW += i - 1\n HIGH += N - i + 1\n LOW %= MOD\n HIGH %= MOD\n if i >= K:\n ans += HIGH - LOW + 1\n ans %= MOD\nprint(ans)\n", "fast_code": "n, k = list(map(int, input().split()))\nprint(\n (\n (\n n * (n + 1) * (n + 2) // 6\n - (3 * n - 2 * k + 4) * (k - 1) * k // 6\n - k\n + n\n + 2\n )\n % (10**9 + 7)\n )\n)\n", "slow_time": 6613404738, "fast_time": 17504024, "speedup": 377.822, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_25"} +{"pair_id": "python_6213", "problem_id": "p00040", "language": "python", "slow_code": "import sys\nimport os\nimport math\n\nN = int(eval(input()))\nalphabet = \"abcdefghijklmnopqrstuvwxyz\"\n\n\ndef encode(s, alpha, beta):\n t = []\n for c in s:\n if c == \" \":\n t.append(c)\n else:\n gamma = ord(c) - 97\n v = (alpha * gamma + beta) % 26\n w = alphabet[v]\n t.append(w)\n return \"\".join(t)\n\n\nfor i in range(N):\n s = input().strip()\n for a in range(0, 26):\n for b in range(0, 26):\n encoded_this = encode(\"this\", a, b)\n encoded_that = encode(\"that\", a, b)\n if encoded_this in s or encoded_that in s:\n encoded_alphabet = encode(alphabet, a, b)\n table = str.maketrans(encoded_alphabet, alphabet)\n dst = s.translate(table)\n print(dst)\n", "fast_code": "import string\n\nA2Z = \"abcdefghijklmnopqrstuvwxyz\"\nR = list(range(26))\n\n\ndef decode(msg, L):\n x = \"\"\n for c in msg:\n x += L[A2Z.index(c)] if \"a\" <= c <= \"z\" else c\n return x\n\n\ndef affine(msg, a, b):\n L = \"\".join([A2Z[(i * a + b) % 26] for i in R])\n s = decode(msg, L)\n return s\n\n\ndef rot(msg, a):\n a = a % 26\n L = A2Z[a:] + A2Z[:a]\n s = decode(msg, L)\n return s\n\n\ndef checkkey(s):\n c0 = \"t\"\n for i in R:\n a = 0\n x = affine(s, i, 0)\n c = A2Z.index(x[0])\n if c != 19:\n a = (19 - c) % 26\n x = rot(x, a)\n if x in [\"this\", \"that\"]:\n return i, a\n return -1, -1\n\n\nn = eval(input())\nwhile n:\n n -= 1\n s = input()\n for w in s.split():\n if len(w) == 4:\n a, b = checkkey(w)\n if a != -1:\n break\n print(affine(s, a, b))\n", "slow_time": 559587423, "fast_time": 123375682, "speedup": 4.5356, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_0"} +{"pair_id": "python_10622", "problem_id": "p03699", "language": "python", "slow_code": "n = int(eval(input()))\na = [int(eval(input())) for _ in range(n)]\ndp = [[] for _ in range(n + 1)]\nfor i in range(n + 1):\n dp[i] += [-1 for _ in range(10010)]\ndp[0][0] = 1\nfor i in range(n):\n for j in range(10010):\n if dp[i][j] == 1:\n dp[i + 1][j] = 1\n dp[i + 1][j + a[i]] = 1\nans = 0\nfor i in range(10010):\n if dp[n][i] == 1:\n if i % 10 != 0:\n ans = max(ans, i)\nprint(ans)\n", "fast_code": "n = int(eval(input()))\ns = sorted([int(eval(input())) for i in range(n)])\nans = 0\nif sum(s) % 10 != 0:\n print((sum(s)))\nelse:\n for i in s:\n if i % 10 != 0:\n ans = sum(s) - i\n print(ans)\n break\n if ans == 0:\n print(ans)\n", "slow_time": 2121900435, "fast_time": 33794001, "speedup": 62.7893, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_29"} +{"pair_id": "python_6227", "problem_id": "p03502", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nimport array\nimport inspect\n\nsys.setrecursionlimit(10000)\n\n\ndef chkprint(*args):\n names = {id(v): k for k, v in list(inspect.currentframe().f_back.f_locals.items())}\n print((\", \".join(names.get(id(arg), \"???\") + \" = \" + repr(arg) for arg in args)))\n\n\ndef to_bin(x):\n return bin(x)[2:]\n\n\ndef li_input():\n return [int(_) for _ in input().split()]\n\n\ndp = None\n\n\ndef main():\n X = int(eval(input()))\n if X % sum(list(map(int, list(str(X))))) == 0:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nmain()\n", "fast_code": "n = int(eval(input()))\n\n\ndef ds(n):\n return sum(map(int, str(n)))\n\n\nprint((\"Yes\" if n % ds(n) == 0 else \"No\"))\n", "slow_time": 66486570, "fast_time": 18657113, "speedup": 3.5636, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_12"} +{"pair_id": "python_7107", "problem_id": "p02732", "language": "python", "slow_code": "c = [0] * 8**6\n_, a = open(0)\n(*a,) = list(map(int, a.split()))\nfor i in a:\n c[i] += 1\ns = sum(i * ~-i // 2 for i in c)\nprint((\" \".join(str(s - c[i] + 1) for i in a)))\n", "fast_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\nfrom collections import Counter\nfrom operator import mul\nfrom functools import reduce\n\n\ndef cmb1(n, r):\n r = min(n - r, r)\n if r == 0:\n return 1\n over = reduce(mul, list(range(n, n - r, -1)))\n under = reduce(mul, list(range(1, r + 1)))\n return over // under\n\n\ndef main():\n n = int(eval(input()))\n A = [int(_) for _ in input().split()]\n A_c = Counter(A)\n combi = 0\n for ac in list(A_c.items()):\n if ac[1] >= 2:\n combi += cmb1(ac[1], 2)\n for i in range(n):\n print((combi - (A_c[A[i]] - 1)))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 8948614458, "fast_time": 74281949, "speedup": 120.4682, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_7"} +{"pair_id": "python_13373", "problem_id": "p02815", "language": "python", "slow_code": "import sys\n\ninput = lambda: sys.stdin.readline().rstrip()\nsys.setrecursionlimit(max(1000, 10**9))\nwrite = lambda x: sys.stdout.write(x + \"\\n\")\nn = int(eval(input()))\na = list(map(int, input().split()))\nM = 10**9 + 7\npp = [None] * n\nv = 1\nfor i in range(n):\n pp[i] = v\n v *= 2\n v %= M\na.sort()\na = a[::-1]\nans = 0\nans += a[0] * (pow(2, 0, M)) * pow(2, n - 1, M)\nfor i in range(1, n):\n num = a[i]\n ans += num * (pp[i] + i * pp[i - 1]) * pp[n - i - 1]\n ans %= M\nans *= pow(2, n, M)\nans %= M\nprint(ans)\n", "fast_code": "mod = 10**9 + 7\nn = int(eval(input()))\narr = list(map(int, input().split()))\narr = sorted(arr)\nans = 0\ntotal = pow(2, 2 * n - 2, mod)\nfor i in range(n):\n ans += total * (n - i + 1) * arr[i]\n ans %= mod\nprint((int(ans)))\n", "slow_time": 45155406, "fast_time": 22302253, "speedup": 2.0247, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_2"} +{"pair_id": "python_16206", "problem_id": "p03721", "language": "python", "slow_code": "def resolve():\n n, k = list(map(int, input().split()))\n arr = [0] * (10**5 + 1)\n for i in range(n):\n a, b = list(map(int, input().split()))\n arr[a] += b\n for i in range(len(arr)):\n if arr[i] >= k:\n print(i)\n break\n k -= arr[i]\n\n\nresolve()\n", "fast_code": "n, k = list(map(int, input().split()))\nab = [list(map(int, input().split())) for _ in range(n)]\nab.sort()\nt = 0\nfor i in range(n):\n t += ab[i][1]\n if t >= k:\n print((ab[i][0]))\n break\n", "slow_time": 142852058, "fast_time": 30954946, "speedup": 4.6148, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_19"} +{"pair_id": "python_11897", "problem_id": "p02549", "language": "python", "slow_code": "mod = 998244353\n\n\nclass FenwickTree:\n def __init__(self, n, init_list=None):\n self.n = n\n self.data = [0] * n\n if init_list:\n assert n == len(init_list)\n for i in range(n):\n self.add(i, init_list[i])\n\n def add(self, i, val):\n assert 0 <= i < self.n\n i += 1\n while i <= self.n:\n self.data[i - 1] = (val + self.data[i - 1]) % mod\n i += i & -i\n\n def update(self, i, val):\n self.add(i, val - self.sum(i, i + 1))\n\n def sum(self, l, r):\n assert 0 <= l <= r <= self.n\n if l != 0:\n return (self.sum(0, r) - self.sum(0, l)) % mod\n ret = 0\n while r > 0:\n ret = (ret + self.data[r - 1]) % mod\n r -= r & -r\n return ret\n\n\nn, k = list(map(int, input().split()))\ns = []\nfor _ in range(k):\n l, r = list(map(int, input().split()))\n s.append((l, r))\nft = FenwickTree(n)\nft.add(0, 1)\nfor i in range(1, n):\n for l, r in s:\n jl = i - l\n jr = max(i - r, 0)\n if jl < 0:\n continue\n ft.add(i, ft.sum(jr, jl + 1) % mod)\nprint((ft.sum(n - 1, n) % mod))\n", "fast_code": "p = 998244353\nn, k = list(map(int, input().split()))\nLRs = [tuple(map(int, input().split())) for _ in range(k)]\nA = [0] * (2 * n + 1)\nfor lj, rj in LRs:\n A[lj] += 1\n A[rj + 1] -= 1\ns = 0\nfor i in range(1, n):\n s = (s + A[i]) % p\n for lj, rj in LRs:\n A[i + lj] += s\n A[i + rj + 1] -= s\nprint(s)\n", "slow_time": 213589573, "fast_time": 57668299, "speedup": 3.7038, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_1"} +{"pair_id": "python_3443", "problem_id": "p02955", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\n\n\ndef read_int():\n return int(input())\n\n\ndef read_int_n():\n return list(map(int, input().split()))\n\n\ndef read_float():\n return float(input())\n\n\ndef read_float_n():\n return list(map(float, input().split()))\n\n\ndef read_str():\n return input().strip()\n\n\ndef read_str_n():\n return list(map(str, input().split()))\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n error_print(e - s, \"sec\")\n return ret\n\n return wrap\n\n\ndef divisor(n):\n for i in range(1, int(n**0.5) + 1):\n if n % i == 0:\n yield i\n if i != n // i:\n yield n // i\n\n\n@mt\ndef slv(N, K, A):\n S = sum(A)\n D = [n for n in divisor(S)]\n D.sort()\n ans = 0\n for d in D:\n r = []\n for a in A:\n r.append(a % d)\n r.sort()\n rr = [d - n for n in r]\n sr = [0]\n srr = [0]\n for i in range(N):\n sr.append(sr[-1] + r[i])\n srr.append(srr[-1] + rr[i])\n for i in range(N):\n e = sr[i + 1] - sr[0]\n f = srr[N] - srr[i + 1]\n if e == f and e <= K:\n ans = max(ans, d)\n break\n return ans\n\n\ndef main():\n N, K = read_int_n()\n A = read_int_n()\n print(slv(N, K, A))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "n, k = list(map(int, input().split()))\na = [int(x) for x in input().split()]\ns = sum(a)\ncandidates = set()\nfor i in range(1, int(s**0.5) + 1):\n if s % i == 0:\n candidates.add(i)\n candidates.add(s // i)\nans = 0\nfor cdd in candidates:\n f = sorted([x % cdd for x in a])\n\n ans = max(ans, cdd) if sum(f[: -sum(f) // cdd]) <= k else ans\nprint(ans)\n", "slow_time": 163270483, "fast_time": 48510373, "speedup": 3.3657, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_3"} +{"pair_id": "python_9552", "problem_id": "p02554", "language": "python", "slow_code": "N = int(eval(input()))\nmod = 10**9 + 7\nans = 10**N % mod\nans -= 9**N % mod + 9**N % mod\nans += 8**N % mod\nans %= mod\nprint(ans)\n", "fast_code": "N = int(eval(input()))\nM = 10**9 + 7\nans = (pow(10, N, M) - 2 * pow(9, N, M) + pow(8, N, M)) % M\nprint(ans)\n", "slow_time": 5752352271, "fast_time": 18576870, "speedup": 309.6513, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_9"} +{"pair_id": "python_9231", "problem_id": "p02883", "language": "python", "slow_code": "import math\n\nN, K = list(map(int, input().split()))\nX = [\n (b, a * b)\n for a, b in zip(\n sorted(list(map(int, input().split()))),\n sorted(list(map(int, input().split())))[::-1],\n )\n]\nm, M, i = 0, 10**12, 1\nexec(\n \"i,M,m=((i+m)//2,i,m) if sum(math.ceil(max(0,c-i)/b)for b, c in X)<=K else((i+M)//2,M,i);\"\n * 50\n)\nprint(M)\n", "fast_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\ndef main():\n N, K = list(map(int, input().split()))\n A = list(map(int, input().split()))\n F = list(map(int, input().split()))\n A.sort(reverse=True)\n F.sort()\n\n def train(X, Y, T):\n ans = 0\n for i in range(len(X)):\n ans += max(0, X[i] - T // Y[i])\n return ans\n\n ok = 10**18 + 1\n ng = -1\n while ok - ng > 1:\n mid = (ok + ng) // 2\n ans = train(A, F, mid)\n if ans > K:\n ng = mid\n else:\n ok = mid\n print(ok)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 822717967, "fast_time": 94104902, "speedup": 8.7426, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_17"} +{"pair_id": "python_7255", "problem_id": "p02683", "language": "python", "slow_code": "n, m, x = list(map(int, input().split()))\ninn = [list(map(int, input().split())) for _ in range(n)]\nc = [inn[_][0] for _ in range(n)]\nara = [inn[_][1:] for _ in range(n)]\nans = 1e9\nfor mask in range(2**15):\n cost = 0\n cnt = [0 for _ in range(m)]\n for i in range(n):\n if ((1 << i) & mask) == 0:\n continue\n cost += c[i]\n for j in range(m):\n cnt[j] += ara[i][j]\n ok = 1\n for i in range(m):\n if cnt[i] < x:\n ok = 0\n if ok:\n ans = min(ans, cost)\nif ans == 1e9:\n ans = -1\nprint(ans)\n", "fast_code": "n, m, x = list(map(int, input().split()))\nc = [0] * n\na = [[0 for _ in range(m)] for i in range(n)]\nfor i in range(n):\n l = [int(_) for _ in input().split()]\n c[i] = l[0]\n for j in range(m):\n a[i][j] = l[j + 1]\ninf = float(\"inf\")\nans = inf\nfor i in range(2**n):\n cost = 0\n d = [0] * m\n for j in range(n):\n if i >> j & 1:\n cost += c[j]\n for k in range(m):\n d[k] += a[j][k]\n ok = True\n for y in range(m):\n if d[y] < x:\n ok = False\n if ok:\n ans = min(ans, cost)\nif ans == inf:\n print((-1))\nelse:\n print(ans)\n", "slow_time": 78624060680, "fast_time": 656203910, "speedup": 119.8165, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_10"} +{"pair_id": "python_16968", "problem_id": "p02804", "language": "python", "slow_code": "from collections import defaultdict\n\n\nclass Combination:\n \"\"\"\"\"\"\n\n def __init__(self, n_max, mod=10**9 + 7):\n self.mod = mod\n self.modinv = self.make_modinv_list(n_max)\n self.fac, self.facinv = self.make_factorial_list(n_max)\n\n def __call__(self, n, r):\n return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n - r] % self.mod\n\n def make_factorial_list(self, n):\n\n fac = [1]\n facinv = [1]\n for i in range(1, n + 1):\n fac.append(fac[i - 1] * i % self.mod)\n facinv.append(facinv[i - 1] * self.modinv[i] % self.mod)\n return fac, facinv\n\n def make_modinv_list(self, n):\n\n modinv = [0] * (n + 1)\n modinv[1] = 1\n for i in range(2, n + 1):\n modinv[i] = self.mod - self.mod // i * modinv[self.mod % i] % self.mod\n return modinv\n\n\ndef main():\n\n N, K = list(map(int, input().split()))\n A = list(map(int, input().split()))\n A.sort()\n ans = 0\n mod = 10**9 + 7\n comb = Combination(1000000)\n\n for i, a in enumerate(A):\n if (N - 1 - i) >= K - 1:\n\n tmp = comb(N - 1 - i, K - 1)\n ans -= a * tmp\n ans %= mod\n else:\n break\n A.sort(reverse=True)\n for i, a in enumerate(A):\n if (N - 1 - i) >= K - 1:\n\n tmp = comb(N - 1 - i, K - 1)\n ans += a * tmp\n ans %= mod\n else:\n break\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N, K, *A = list(map(int, open(0).read().split()))\nMAX = 10**5 + 1\nMOD = 10**9 + 7\n\nfac = [0] * (MAX + 1)\nfac[0] = 1\nfac[1] = 1\nfor i in range(2, MAX + 1):\n fac[i] = fac[i - 1] * i % MOD\n\nfinv = [0] * (MAX + 1)\nfinv[MAX] = pow(fac[MAX], MOD - 2, MOD)\nfor i in reversed(list(range(1, MAX + 1))):\n finv[i - 1] = finv[i] * i % MOD\n\n\ndef comb(n, k):\n if n < k or k < 0:\n return 0\n return (fac[n] * finv[k] * finv[n - k]) % MOD\n\n\nA.sort()\nans = 0\nfor i in range(N):\n if i >= K - 1:\n ans += comb(i, K - 1) * A[i]\n if i + K - 1 < N:\n ans -= comb(N - i - 1, K - 1) * A[i]\n ans %= MOD\nprint(ans)\n", "slow_time": 202297299246, "fast_time": 22415880220, "speedup": 9.0247, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_19"} +{"pair_id": "python_7371", "problem_id": "p03044", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\ndef ii():\n return int(eval(input()))\n\n\ndef mi():\n return list(map(int, input().rstrip().split()))\n\n\ndef lmi():\n return list(map(int, input().rstrip().split()))\n\n\ndef li():\n return list(input().rstrip())\n\n\nfrom queue import Queue\n\n\ndef bfs(field, sy, sx, wall, dir):\n h = len(field)\n w = len(field[0])\n dp = [[-1 for _j in range(w)] for _i in range(h)]\n q = Queue()\n dp[sy][sx] = 0\n q.put((sy, sx))\n dy = [1, -1, 0, 0, 1, 1, -1, -1]\n dx = [0, 0, 1, -1, 1, -1, 1, -1]\n\n def isin(x, y):\n return 0 <= y and y < h and 0 <= x and x < w\n\n while not q.empty():\n y, x = q.get()\n for k in range(dir):\n ny, nx = y + dy[k], x + dx[k]\n if not isin(nx, ny) or field[ny][nx] == wall:\n continue\n elif dp[ny][nx] != -1:\n continue\n dp[ny][nx] = dp[y][x] + 1\n q.put((ny, nx))\n return dp\n\n\ndef ABC088_D():\n h, w = mi()\n s = [[\"\" for _j in range(w)] for _i in range(h)]\n for i in range(h):\n s[i] = li()\n dp = bfs(s, 0, 0, \"#\", 4)\n if dp[h - 1][w - 1] < 0:\n print((-1))\n else:\n cnt = 0\n for i in range(h):\n for j in range(w):\n cnt += s[i][j] == \".\"\n print((cnt - (dp[h - 1][w - 1] + 1)))\n\n\ndef ATC002_A():\n R, C = mi()\n sy, sx = mi()\n gy, gx = mi()\n s = [[\"\" for _j in range(C)] for _i in range(R)]\n for i in range(R):\n s[i] = li()\n dp = bfs(s, sy - 1, sx - 1, \"#\", 4)\n print((dp[gy - 1][gx - 1]))\n\n\ndef ABC126_D():\n N = ii()\n G = [[] for i in range(N)]\n for i in range(N - 1):\n a, b, w = mi()\n a -= 1\n b -= 1\n G[a].append((b, w))\n G[b].append((a, w))\n is_bipartite = True\n dist = [-1 for _ in range(N)]\n que = Queue()\n for v in range(N):\n if dist[v] != -1:\n\n continue\n dist[v] = 0\n que.put(v)\n while not que.empty():\n v = que.get()\n for nv, nw in G[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + nw\n que.put(nv)\n for i in dist:\n if i % 2 == 0:\n print((0))\n else:\n print((1))\n\n\nif __name__ == \"__main__\":\n\n ABC126_D()\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**5)\n\n\ndef dfs(v, p, c):\n color[v] = c\n for e in graph[v]:\n if e[0] == p:\n continue\n if e[1] % 2:\n dfs(e[0], v, 1 - c)\n else:\n dfs(e[0], v, c)\n\n\nn = int(eval(input()))\ncolor = [-1] * n\ngraph = [[] for _ in range(n)]\nfor _ in range(n - 1):\n u, v, w = [int(x) for x in input().split()]\n u, v = u - 1, v - 1\n graph[u].append((v, w))\n graph[v].append((u, w))\ndfs(0, -1, 1)\nfor c in color:\n print(c)\n", "slow_time": 204160464, "fast_time": 52309354, "speedup": 3.9029, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_28"} +{"pair_id": "python_4974", "problem_id": "p03606", "language": "python", "slow_code": "n = int(eval(input()))\nseat = [0] * (10**5 + 1)\nfor i in range(n):\n l, r = list(map(int, input().split()))\n seat[l - 1] += 1\n seat[r] -= 1\nfor i in range(1, 10**5):\n seat[i] += seat[i - 1]\nres = 0\nfor i in range(10**5):\n if seat[i] == 1:\n res += 1\nprint(res)\n", "fast_code": "N = int(eval(input()))\ncnt = 0\nfor i in range(N):\n l, r = list(map(int, input().split()))\n cnt += r - l + 1\nprint(cnt)\n", "slow_time": 11144169374, "fast_time": 19190279, "speedup": 580.7195, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_7"} +{"pair_id": "python_8056", "problem_id": "p03078", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(100000)\n\n\ndef read_int():\n return int(input())\n\n\ndef read_int_n():\n return list(map(int, input().split()))\n\n\ndef read_float():\n return float(input())\n\n\ndef read_float_n():\n return list(map(float, input().split()))\n\n\ndef read_str():\n return input().strip()\n\n\ndef read_str_n():\n return list(map(str, input().split()))\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n error_print(e - s, \"sec\")\n return ret\n\n return wrap\n\n\n@mt\ndef slv(A, B, C, K):\n A.sort(reverse=True)\n B.sort(reverse=True)\n C.sort(reverse=True)\n\n def s(i, j, k):\n return A[i] + B[j] + C[k]\n\n used = set()\n cand = []\n if 1 < len(A):\n heapq.heappush(cand, (-s(1, 0, 0), (1, 0, 0)))\n used.add((1, 0, 0))\n if 1 < len(B):\n heapq.heappush(cand, (-s(0, 1, 0), (0, 1, 0)))\n used.add((0, 1, 0))\n if 1 < len(C):\n heapq.heappush(cand, (-s(0, 0, 1), (0, 0, 1)))\n used.add((0, 0, 1))\n print(s(0, 0, 0))\n for _ in range(K - 1):\n v, i = heapq.heappop(cand)\n print(-v)\n ti = (i[0] + 1, i[1], i[2])\n if ti[0] < len(A) and ti not in used:\n heapq.heappush(cand, (-s(*ti), ti))\n used.add(ti)\n ti = (i[0], i[1] + 1, i[2])\n if ti[1] < len(B) and ti not in used:\n heapq.heappush(cand, (-s(*ti), ti))\n used.add(ti)\n ti = (i[0], i[1], i[2] + 1)\n if ti[2] < len(C) and ti not in used:\n heapq.heappush(cand, (-s(*ti), ti))\n used.add(ti)\n\n\ndef main():\n\n X, Y, Z, K = read_int_n()\n A = read_int_n()\n B = read_int_n()\n C = read_int_n()\n (slv(A, B, C, K))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "x, y, z, k = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\nli = []\nfor i in a:\n for j in b:\n li.append(i + j)\nli.sort(reverse=True)\nli = li[:k]\nlin = []\nfor i in li:\n for j in c:\n lin.append(i + j)\nlin.sort(reverse=True)\nfor i in range(k):\n print((lin[i]))\n", "slow_time": 223697403, "fast_time": 76275599, "speedup": 2.9328, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_24"} +{"pair_id": "python_18280", "problem_id": "p02831", "language": "python", "slow_code": "a, b = list(map(int, input().split()))\ngcd = 0\nfor i in range(max(a, b), 0, -1):\n if a % i == 0 and b % i == 0:\n gcd = i\n break\nprint((a * b // gcd))\n", "fast_code": "import sys\n\nstdin = sys.stdin\nsys.setrecursionlimit(10**7)\ni_i = lambda: int(i_s())\ni_l = lambda: list(map(int, stdin.readline().split()))\ni_s = lambda: stdin.readline().rstrip()\n\n\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n\ndef lcm(a, b):\n return a * b // gcd(a, b)\n\n\nA, B = i_l()\nprint((lcm(A, B)))\n", "slow_time": 1631239856, "fast_time": 36632669, "speedup": 44.5296, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_7"} +{"pair_id": "python_9670", "problem_id": "p02554", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\n\n\ndef ns():\n return stdin.readline().rstrip()\n\n\ndef ni():\n return int(stdin.readline().rstrip())\n\n\ndef nm():\n return list(map(int, stdin.readline().split()))\n\n\ndef nl():\n return list(map(int, stdin.readline().split()))\n\n\ndef main():\n n = ni()\n mod = 10**9 + 7\n print(((pow(10, n) % mod - (2 * pow(9, n)) % mod + pow(8, n) % mod) % mod))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N = int(eval(input()))\nMOD_BY = 10**9 + 7\na = pow(10, N, MOD_BY)\nb = pow(9, N, MOD_BY)\nc = pow(8, N, MOD_BY)\nans = a - 2 * b + c\nprint((ans % MOD_BY))\n", "slow_time": 3893757734, "fast_time": 22067599, "speedup": 176.4468, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_14"} +{"pair_id": "python_5530", "problem_id": "p03251", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(10000)\n\n\ndef read_int():\n return int(input())\n\n\ndef read_int_n():\n return list(map(int, input().split()))\n\n\ndef read_float():\n return float(input())\n\n\ndef read_float_n():\n return list(map(float, input().split()))\n\n\ndef read_str():\n return input().strip()\n\n\ndef read_str_n():\n return list(map(str, input().split()))\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n error_print(e - s, \"sec\")\n return ret\n\n return wrap\n\n\n@mt\ndef slv(N, M, X, Y, x, y):\n mx = max(x)\n my = min(y)\n error_print(mx, my)\n if mx >= my:\n return \"War\"\n for i in range(mx + 1, my + 1):\n if X < i <= Y:\n return \"No War\"\n return \"War\"\n\n\ndef main():\n N, M, X, Y = read_int_n()\n x = read_int_n()\n y = read_int_n()\n print(slv(N, M, X, Y, x, y))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N, M, X, Y = list(map(int, input().split()))\nx = sorted(list(map(int, input().split())))\ny = sorted(list(map(int, input().split())))\nfor i in range(X + 1, Y + 1):\n if x[-1] < i <= y[0]:\n print(\"No War\")\n break\nelse:\n print(\"War\")\n", "slow_time": 90641474, "fast_time": 24072137, "speedup": 3.7654, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_9"} +{"pair_id": "python_430", "problem_id": "p03160", "language": "python", "slow_code": "def chmin(a, b):\n return b if a > b else a\n\n\ndef chmax(a, b):\n return b if a < b else a\n\n\ndef main(N, h):\n INF = 10**9\n dp = [INF] * (10**5 + 10)\n dp[0] = 0\n dp[1] = abs(h[1] - h[0])\n for i in range(2, N):\n dp[i] = chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]))\n dp[i] = chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))\n return dp[N - 1]\n\n\nif __name__ == \"__main__\":\n N = int(eval(input()))\n h = list(map(int, input().split()))\n print((main(N, h)))\n", "fast_code": "import sys\n\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nMOD = 10**9 + 7\ninput = sys.stdin.readline\n\n\ndef resolve():\n n = int(eval(input()))\n H = list(map(int, input().split()))\n dp = [0] * n\n dp[1] = abs(H[1] - H[0])\n for i in range(2, n):\n dp[i] = min(dp[i - 1] + abs(H[i] - H[i - 1]), dp[i - 2] + abs(H[i] - H[i - 2]))\n print((dp[n - 1]))\n\n\nresolve()\n", "slow_time": 117408668, "fast_time": 44646815, "speedup": 2.6297, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_7"} +{"pair_id": "python_8129", "problem_id": "p03352", "language": "python", "slow_code": "X = int(eval(input()))\nans = 1\nfor i in range(1, 1000):\n for j in range(2, 1000):\n t = i**j\n if t > X:\n break\n ans = max(ans, t)\nprint(ans)\n", "fast_code": "x = int(eval(input()))\nans = 1\nif x == 1:\n print((1))\nelse:\n b = 2\n while b**2 <= x:\n p = 2\n while b**p <= x:\n ans = max(b**p, ans)\n p += 1\n b += 1\n print(ans)\n", "slow_time": 300783133, "fast_time": 28624218, "speedup": 10.508, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_19"} +{"pair_id": "python_3597", "problem_id": "p02934", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef S():\n return eval(input())\n\n\ndef main():\n n = I()\n l = LI()\n sm = 0\n for x in l:\n sm += 1 / x\n return 1 / sm\n\n\nprint((main()))\n", "fast_code": "N = int(eval(input()))\nlst_A = list(map(int, input().split()))\nans = 1 / sum(1 / x for x in lst_A)\nprint(ans)\n", "slow_time": 79645167, "fast_time": 20024179, "speedup": 3.9774, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_15"} +{"pair_id": "python_17518", "problem_id": "p02615", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(1 << 25)\nread = sys.stdin.readline\nra = range\nenu = enumerate\n\n\ndef exit(*argv, **kwarg):\n print(*argv, **kwarg)\n sys.exit()\n\n\ndef mina(*argv, sub=1):\n return list(map(lambda x: x - sub, argv))\n\n\ndef a_int():\n return int(read())\n\n\ndef ints():\n return list(map(int, read().split()))\n\n\ndef read_col(H):\n \"\"\"\"\"\"\n ret = []\n for _ in range(H):\n ret.append(list(map(int, read().split())))\n return tuple(map(list, zip(*ret)))\n\n\ndef read_tuple(H):\n \"\"\"\"\"\"\n ret = []\n for _ in range(H):\n ret.append(tuple(map(int, read().split())))\n return ret\n\n\ndef read_matrix(H):\n \"\"\"\"\"\"\n ret = []\n for _ in range(H):\n ret.append(list(map(int, read().split())))\n return ret\n\n\nMOD = 10**9 + 7\nINF = 2**31\n\nfrom collections import defaultdict, Counter, deque\nfrom operator import itemgetter, xor, add\nfrom itertools import product, permutations, combinations\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce\nfrom math import gcd\n\n\ndef lcm(a, b):\n\n g = gcd(a, b)\n return a // g * b\n\n\nN = a_int()\nA = ints()\nA.sort(reverse=True)\nans = A[0]\ncnt = 1\nfor a in A[1:]:\n if cnt == N - 1:\n break\n ans += a\n cnt += 1\n if cnt == N - 1:\n break\n ans += a\n cnt += 1\nprint(ans)\n", "fast_code": "def main():\n import sys\n\n input = sys.stdin.readline\n N = int(eval(input()))\n A = list(map(int, input().split()))\n A.sort(reverse=True)\n ans = A[0]\n for i in range(2, N):\n ans += A[i // 2]\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 122798898, "fast_time": 30847405, "speedup": 3.9809, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_10"} +{"pair_id": "python_9381", "problem_id": "p02675", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nimport bisect\n\nINF = 10**13\nMOD = 10**9 + 7\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef gcd(x, y):\n return x if y == 0 else gcd(y, x % y)\n\n\ndef lcm(x, y):\n return (x * y) // gcd(x, y)\n\n\ndef I():\n return int(input())\n\n\ndef LI():\n return [int(x) for x in input().split()]\n\n\ndef RI(N):\n return [int(input()) for _ in range(N)]\n\n\ndef LRI(N):\n return [[int(x) for x in input().split()] for _ in range(N)]\n\n\ndef LS():\n return input().split()\n\n\ndef RS(N):\n return [input() for _ in range(N)]\n\n\ndef LRS(N):\n return [input().split() for _ in range(N)]\n\n\ndef PL(L):\n print(*L, sep=\"\\n\")\n\n\ndef YesNo(B):\n print(\"Yes\" if B else \"No\")\n\n\ndef YESNO(B):\n print(\"YES\" if B else \"NO\")\n\n\nN = input()\nn = int(N[-1])\nif n in [2, 4, 5, 7, 9]:\n print(\"hon\")\nelif n in [0, 1, 6, 8]:\n print(\"pon\")\nelse:\n print(\"bon\")\n", "fast_code": "n = input()[-1]\nif n == \"3\":\n print(\"bon\")\nelif n in \"0168\":\n print(\"pon\")\nelse:\n print(\"hon\")\n", "slow_time": 116219356, "fast_time": 12623568, "speedup": 9.2065, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_2"} +{"pair_id": "python_6737", "problem_id": "p03198", "language": "python", "slow_code": "import collections, atexit, math, sys, bisect\n\nsys.setrecursionlimit(1000000)\n\n\ndef getIntList():\n return list(map(int, input().split()))\n\n\ntry:\n\n import numpy\n\n def dprint(*args, **kwargs):\n\n print(*args, file=sys.stderr)\n\n dprint(\"debug mode\")\nexcept Exception:\n\n def dprint(*args, **kwargs):\n pass\n\n\ninId = 0\noutId = 0\nif inId > 0:\n dprint(\"use input\", inId)\n sys.stdin = open(\"input\" + str(inId) + \".txt\", \"r\")\nif outId > 0:\n dprint(\"use output\", outId)\n sys.stdout = open(\"stdout\" + str(outId) + \".txt\", \"w\")\n atexit.register(lambda: sys.stdout.close())\nif True:\n (N,) = getIntList()\n\n za = getIntList()\nelse:\n N = 100\n import random\n\n za = [random.randint(1, 1000000000) for i in range(N)]\ndprint(\"begin\")\nzleft = [0 for i in range(N + 1)]\nzright = [0 for i in range(N + 1)]\n\n\ndef getwork(zr, za):\n zr[0] = 0\n st = []\n for i in range(N):\n if i % 10000 == 0:\n dprint(\"---\", i)\n nt = [[za[i], 0], [za[i], 0], 1]\n st.append(nt)\n nr = zr[i]\n\n while len(st) > 1:\n b_2 = st[-2][1][1]\n b_1 = st[-1][0][1]\n bb = min(b_1, b_2)\n b_1 -= bb\n b_2 -= bb\n b_1p = 4**b_1\n b_2p = 4**b_2\n t2 = st[-2][1][0] * b_2p\n t1 = st[-1][0][0] * b_1p\n if t2 < t1:\n nr += 2 * st[-2][2]\n st[-2][0][1] += 1\n st[-2][1][1] += 1\n elif t2 < t1 * 4:\n ttt = [st[-2][0], st[-1][1], st[-2][2] + st[-1][2]]\n st[-2] = ttt\n st.pop()\n else:\n break\n\n zr[i + 1] = nr\n\n assert nr < 1000000000000000\n dprint(st)\n\n\ngetwork(zleft, za)\ndprint(\"!!!!\")\ngetwork(zright, za[::-1])\n\n\nr = zright[N]\nfor i in range(N + 1):\n tr = i + zleft[i] + zright[N - i]\n r = min(r, tr)\nprint(r)\ndprint(\"end\")\n", "fast_code": "from sys import stdin\nfrom itertools import repeat\n\n\ndef f(a):\n n = len(a)\n l = [0] * (n + 1)\n st = [(0, 0, 0, 1)]\n pu = st.append\n po = st.pop\n for i in range(1, n):\n ad = 0\n r = i\n u = 0\n k = 1\n while st:\n y = a[r] << u\n x = a[st[-1][0]]\n if x >= y:\n break\n _, r, u, q = po()\n c = 0\n while x < y:\n x *= 4\n c += 2\n ad += c * q\n k += q\n u += c\n pu((i, r, u, k))\n l[i + 1] = l[i] + ad\n return l\n\n\ndef main():\n n = int(stdin.readline())\n a = list(map(int, stdin.readline().split(), repeat(10, n)))\n l = f(a)\n r = f(a[::-1])[::-1]\n ans = 10**12\n for i in range(n + 1):\n if ans > l[i] + i + r[i]:\n ans = l[i] + i + r[i]\n print(ans)\n\n\nmain()\n", "slow_time": 188083795, "fast_time": 81873885, "speedup": 2.2972, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_5"} +{"pair_id": "python_13608", "problem_id": "p00447", "language": "python", "slow_code": "board = [[False] * 1000001] * 1000001\nwhile True:\n m = int(eval(input()))\n if m == 0:\n break\n star = tuple(tuple(map(int, input().split())) for i in range(m))\n sx, sy = star[0]\n n = int(eval(input()))\n starlist = [tuple(map(int, input().split())) for i in range(n)]\n for i in range(n):\n board[starlist[i][0]][starlist[i][1]] = True\n for i in range(n):\n flag = True\n for j in range(len(star)):\n dx = starlist[i][0] + star[j][0] - sx\n dy = starlist[i][1] + star[j][1] - sy\n if 0 <= dx <= 1000000 and 0 <= dy <= 1000000 and board[dx][dy] == False:\n flag = False\n break\n if flag == True:\n print((\"{} {}\".format(str(starlist[i][0] - sx), str(starlist[i][1] - sy))))\n break\n", "fast_code": "for e in iter(input, \"0\"):\n a = sorted(\n [list(map(int, input().split())) for _ in [0] * int(e)], key=lambda x: x[0]\n )\n b = sorted(\n [list(map(int, input().split())) for _ in [0] * int(eval(input()))],\n key=lambda x: x[0],\n )\n for s, t in b:\n u, v = a[0]\n x, y = s - u, t - v\n for u, v in a:\n if [u + x, v + y] not in b:\n break\n else:\n print((x, y))\n", "slow_time": 118527115, "fast_time": 53152069, "speedup": 2.23, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_6"} +{"pair_id": "python_2678", "problem_id": "p02630", "language": "python", "slow_code": "f = lambda: [*list(map(int, input().split()))]\nf()\ns, *l = [0] * 100002\nfor i in f():\n s += i\n l[i] += 1\nq = f()[0]\nfor _ in range(q):\n b, c = f()\n s += (c - b) * l[b]\n l[c] += l[b]\n l[b] = 0\n print(s)\n", "fast_code": "from collections import *\n\neval(input())\ns = sum(A := list(map(int, input().split())))\nA = Counter(A)\nfor i in range(int(eval(input()))):\n b, c = list(map(int, input().split()))\n s += (c - b) * A[b]\n A[c] += A[b]\n A[b] = 0\n print(s)\n", "slow_time": 246048618, "fast_time": 41769197, "speedup": 5.8907, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_23"} +{"pair_id": "python_17834", "problem_id": "p02586", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\nimport math\nfrom copy import copy, deepcopy\nfrom copy import deepcopy as dcp\nfrom operator import itemgetter\nfrom bisect import bisect_left, bisect, bisect_right\n\n\nfrom collections import deque, defaultdict\n\n\nfrom collections import Counter\n\n\nfrom itertools import accumulate, combinations, permutations, product\n\n\nfrom heapq import heapify, heappop, heappush\n\n\nfrom functools import reduce, lru_cache\n\n\nfrom decimal import Decimal\n\n\ndef input():\n x = sys.stdin.readline()\n return x[:-1] if x[-1] == \"\\n\" else x\n\n\ndef printe(*x):\n print(\"## \", *x, file=sys.stderr)\n\n\ndef printl(li):\n _ = print(*li, sep=\"\\n\") if li else None\n\n\ndef argsort(s, return_sorted=False):\n inds = sorted(range(len(s)), key=lambda k: s[k])\n if return_sorted:\n return inds, [s[i] for i in inds]\n return inds\n\n\ndef alp2num(c, cap=False):\n return ord(c) - 97 if not cap else ord(c) - 65\n\n\ndef num2alp(i, cap=False):\n return chr(i + 97) if not cap else chr(i + 65)\n\n\ndef matmat(A, B):\n K, N, M = len(B), len(A), len(B[0])\n return [\n [sum([(A[i][k] * B[k][j]) for k in range(K)]) for j in range(M)]\n for i in range(N)\n ]\n\n\ndef matvec(M, v):\n N, size = len(v), len(M)\n return [sum([M[i][j] * v[j] for j in range(N)]) for i in range(size)]\n\n\ndef T(M):\n n, m = len(M), len(M[0])\n return [[M[j][i] for j in range(n)] for i in range(m)]\n\n\ndef binr(x):\n return bin(x)[2:]\n\n\ndef bitcount(x):\n x = x - ((x >> 1) & 0x5555555555555555)\n x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)\n x = (x + (x >> 4)) & 0x0F0F0F0F0F0F0F0F\n x += x >> 8\n x += x >> 16\n x += x >> 32\n return x & 0x7F\n\n\ndef main():\n mod = 1000000007\n\n R, C, K = map(int, input().split())\n\n base = 5000\n S = []\n for i in range(K):\n r, c, v = map(int, input().split())\n r -= 1\n c -= 1\n S.append((r * base + c, v))\n S.sort(key=itemgetter(0))\n p = 0\n dp = [[0] * 4 for _ in range(C)]\n dpi = [[0] * 4 for _ in range(C)]\n for i in range(R):\n for j in range(C):\n cv = 0\n if p < K and i * base + j == S[p][0]:\n cv = S[p][1]\n p += 1\n if j > 0:\n dpi[j] = copy(dpi[j - 1])\n else:\n dpi[0] = [0] * 4\n if i > 0:\n dpi[j][0] = max(dp[j], dpi[j][0])\n if cv != 0:\n for k in range(2, -1, -1):\n dpi[j][k + 1] = max(dpi[j][k] + cv, dpi[j][k + 1])\n\n dp[j] = max(dpi[j])\n print(dp[-1])\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n R, C, K, *RCV = list(map(int, read().split()))\n item = [[0] * C for _ in range(R)]\n for r, c, v in zip(*[iter(RCV)] * 3):\n item[r - 1][c - 1] = v\n dp = [0] * (C + 1)\n for i in range(R):\n dp, dp_prev = [0] * (C + 1), dp\n v = [0] * 4\n for j in range(C):\n for k in range(4):\n if v[k] < dp_prev[j + 1]:\n v[k] = dp_prev[j + 1]\n else:\n break\n if item[i][j] > 0:\n for k in range(2, -1, -1):\n if v[k + 1] < v[k] + item[i][j]:\n v[k + 1] = v[k] + item[i][j]\n dp[j + 1] = v[3]\n print((dp[C]))\n return\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 163255328, "fast_time": 52697977, "speedup": 3.0979, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_27"} +{"pair_id": "python_11472", "problem_id": "p03504", "language": "python", "slow_code": "n, C = list(map(int, input().split()))\nL = [tuple(map(int, input().split())) for _ in range(n)]\nm = 2 * 10**5 + 2\nS = [0] * m\nfor x in range(1, C + 1):\n T = [0] * m\n for s, t, c in L:\n if c == x:\n\n T[2 * s - 1] += 1\n T[2 * t] -= 1\n for i in range(1, m):\n T[i] += T[i - 1]\n for i in range(m):\n if T[i] > 0:\n S[i] += 1\nprint((max(S)))\n", "fast_code": "import sys\nimport math\nimport collections\nimport bisect\nimport itertools\n\nsys.setrecursionlimit(10**7)\nINF = 10**16\nMOD = 10**9 + 7\n\nni = lambda: int(sys.stdin.readline().rstrip())\nns = lambda: list(map(int, sys.stdin.readline().rstrip().split()))\nna = lambda: list(map(int, sys.stdin.readline().rstrip().split()))\nna1 = lambda: list([int(x) - 1 for x in sys.stdin.readline().rstrip().split()])\n\n\ndef main():\n n, c = ns()\n l = 10**5\n table = [[0 for _ in range(l + 10)] for __ in range(c)]\n for _ in range(n):\n s, t, ci = ns()\n ci -= 1\n table[ci][s] += 1\n table[ci][t] -= 1\n ans = 0\n tmp = 0\n for i in range(l + 10):\n fin = 0\n for j in range(c):\n if table[j][i] > 0:\n tmp += table[j][i]\n else:\n fin += table[j][i]\n ans = max(ans, tmp)\n tmp += fin\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 88725171847, "fast_time": 21596077008, "speedup": 4.1084, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_4"} +{"pair_id": "python_9946", "problem_id": "p03806", "language": "python", "slow_code": "N, Ma, Mb = list(map(int, input().split()))\nINF = 10000\ndp = [[INF for b in range(401)] for a in range(401)]\ndp[0][0] = 0\nfor i in range(1, N + 1):\n ai, bi, ci = list(map(int, input().split()))\n for a in range(400, -1, -1):\n for b in range(400, -1, -1):\n if a - ai >= 0 and b - bi >= 0:\n dp[a][b] = min(dp[a][b], dp[a - ai][b - bi] + ci)\nans = INF\nfor j in range(1, 401):\n if Ma * j > 400 or Mb * j > 400:\n break\n ans = min(ans, dp[Ma * j][Mb * j])\nprint((ans if ans != INF else -1))\n", "fast_code": "import sys\nfrom collections import deque\nimport copy\n\n\ndef get_read_func(fileobject):\n if fileobject == None:\n return raw_input\n else:\n return fileobject.readline\n\n\ndef bfs(X, Ma, Mb):\n\n drug_dict = {}\n drug_dict[(0, 0)] = 0\n drug_dict[(X[0][0], X[0][1])] = X[0][2]\n\n min_cost = sys.maxsize\n new_drug_dict = copy.deepcopy(drug_dict)\n for i in range(1, len(X)):\n for drug in drug_dict:\n cost = drug_dict[drug]\n new_drug = (drug[0] + X[i][0], drug[1] + X[i][1])\n if new_drug not in drug_dict:\n new_drug_dict[new_drug] = cost + X[i][2]\n else:\n new_drug_dict[new_drug] = min(drug_dict[new_drug], cost + X[i][2])\n if new_drug[1] * Ma == new_drug[0] * Mb:\n if new_drug_dict[new_drug] < min_cost:\n min_cost = new_drug_dict[new_drug]\n drug_dict = copy.deepcopy(new_drug_dict)\n return min_cost\n\n\ndef dp_search(X, Ma, Mb, AMax, BMax):\n dp = [[sys.maxsize for i in range(AMax + 1)] for j in range(BMax + 1)]\n dp[0][0] = 0\n for i in range(len(X)):\n for a in range(AMax, -1, -1):\n for b in range(BMax, -1, -1):\n if dp[a][b] >= sys.maxsize:\n continue\n if a + X[i][0] <= AMax and b + X[i][1] <= BMax:\n dp[a + X[i][0]][b + X[i][1]] = min(\n dp[a + X[i][0]][b + X[i][1]], dp[a][b] + X[i][2]\n )\n min_cost = sys.maxsize\n for a in range(0, AMax):\n for b in range(0, BMax):\n if a * Mb == b * Ma and a != 0 and b != 0:\n if dp[a][b] < min_cost:\n min_cost = dp[a][b]\n return min_cost\n\n\ndef main():\n if len(sys.argv) > 1:\n f = open(sys.argv[1])\n else:\n f = None\n read_func = get_read_func(f)\n input_raw = read_func().strip().split()\n [N, Ma, Mb] = [int(input_raw[0]), int(input_raw[1]), int(input_raw[2])]\n X = []\n for i in range(N):\n input_raw = read_func().strip().split()\n [a, b, c] = [int(input_raw[0]), int(input_raw[1]), int(input_raw[2])]\n X.append((a, b, c))\n\n cost = dp_search(X, Ma, Mb, N * 10, N * 10)\n if cost < sys.maxsize:\n print(cost)\n else:\n print(-1)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 48898548578, "fast_time": 180056695, "speedup": 271.5731, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_7"} +{"pair_id": "python_15111", "problem_id": "p02948", "language": "python", "slow_code": "n, m = list(map(int, input().split()))\nab = [[] for _ in range(10**5)]\nfor i in range(n):\n a, b = list(map(int, input().split()))\n a -= 1\n ab[a].append(b)\nimport heapq\n\nq = []\nheapq.heapify(q)\nans = 0\nfor i in range(m):\n if len(ab[i]) != 0:\n for j in range(len(ab[i])):\n heapq.heappush(q, -1 * ab[i][j])\n if len(q) != 0:\n ans += -1 * heapq.heappop(q)\nprint(ans)\n", "fast_code": "from heapq import *\n\nN, M, *t = list(map(int, open(0).read().split()))\nv = [[] for _ in \"_\" * M]\nz = i = 0\nfor _ in \"_\" * N:\n M < t[i] or v[t[i] - 1].append(t[i + 1])\n i += 2\nq = []\nfor i in v:\n for j in i:\n heappush(q, -j)\n z -= len(q) and heappop(q)\nprint(z)\n", "slow_time": 3133712263, "fast_time": 48917213, "speedup": 64.0615, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_29"} +{"pair_id": "python_12815", "problem_id": "p03210", "language": "python", "slow_code": "import sys\n\nu = set(\"753\")\nx = sys.stdin.readline().rstrip()\n\n\ndef main():\n ans = \"YES\" if x in u else \"NO\"\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "print(\"YES\") if input() in [\"3\", \"5\", \"7\"] else print(\"NO\")\n", "slow_time": 17824204, "fast_time": 8061803, "speedup": 2.2109, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_18"} +{"pair_id": "python_3555", "problem_id": "p03077", "language": "python", "slow_code": "import sys\n\ns2nn = lambda s: [int(c) for c in s.split(\" \")]\nss2nn = lambda ss: [int(s) for s in list(ss)]\nss2nnn = lambda ss: [s2nn(s) for s in list(ss)]\ni2s = lambda: sys.stdin.readline().rstrip()\ni2n = lambda: int(i2s())\ni2nn = lambda: s2nn(i2s())\nii2ss = lambda n: [sys.stdin.readline() for _ in range(n)]\nii2nn = lambda n: ss2nn(ii2ss(n))\nii2nnn = lambda n: ss2nnn(ii2ss(n))\nimport math\n\n\ndef main():\n N = i2n()\n ABCDE = ii2nn(5)\n m = min(ABCDE)\n n = int(math.ceil(N / m)) + 4\n print(n)\n\n\nmain()\n", "fast_code": "n, *a = eval(\"int(input()),\" * 6)\nprint((4 - -n // min(a)))\n", "slow_time": 74979366, "fast_time": 20357921, "speedup": 3.6831, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_24"} +{"pair_id": "python_17386", "problem_id": "p02681", "language": "python", "slow_code": "from typing import *\nimport itertools\nimport math\nimport sys\n\nINF = float(\"inf\")\nYES = \"Yes\"\nNO = \"No\"\n\n\ndef solve(S: str, T: str):\n return [NO, YES][S == T[:-1]]\n\n\ndef main():\n sys.setrecursionlimit(10**6)\n\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n\n tokens = iterate_tokens()\n S = next(tokens)\n T = next(tokens)\n print((solve(S, T)))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "s = input()\nt = input()\nprint(\"Yes\") if t == s + t[-1] else print(\"No\")\n", "slow_time": 55931194, "fast_time": 10284365, "speedup": 5.4385, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_16"} +{"pair_id": "python_10839", "problem_id": "p02935", "language": "python", "slow_code": "import math\nimport statistics\n\n\ndef fact(n):\n if n == 1:\n return 1\n else:\n return n * fact(n - 1)\n\n\ndef gcd(a, b):\n if a == 0:\n return b\n elif b == 0:\n return a\n else:\n return gcd(b, a % b)\n\n\ndef lcm(a, b):\n return a * b / gcd(a, b)\n\n\ndef qsort(seq):\n if len(seq) < 1:\n return seq\n pivot = seq[0]\n left = []\n right = []\n for x in range(1, len(seq)):\n if seq[x] <= pivot:\n left.append(seq[x])\n else:\n right.append(seq[x])\n left = qsort(left)\n right = qsort(right)\n foo = [pivot]\n return left + foo + right\n\n\nn = int(eval(input()))\n\nv = list(int(i) for i in input().split())\nlastguzai = 0.00\nfor i in range(n):\n vs = sorted(v)\n if len(v) == 2:\n lastguzai = (v[0] + v[1]) / 2.00\n break\n\n v = vs\n lastguzai = (v[0] + v[1]) / 2.00\n del v[0]\n del v[0]\n v.append(lastguzai)\n\nprint((\"{:.6f}\".format(lastguzai)))\n", "fast_code": "def main():\n n = int(eval(input()))\n w = sorted(map(int, input().split()))\n ans = (w[0] + w[1]) / 2\n for i in range(2, n):\n ans = ans / 2 + w[i] / 2\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 92880138, "fast_time": 28506174, "speedup": 3.2582, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_12"} +{"pair_id": "python_6715", "problem_id": "p00053", "language": "python", "slow_code": "s = [0]\nM = 10**6\np = [1] * M\nS = 0\nfor i in range(2, M):\n if p[i]:\n for j in range(i * i, M, i):\n p[j] = 0\n S += i\n s.append(S)\nwhile 1:\n n = eval(input())\n if n == 0:\n break\n print(s[n])\n", "fast_code": "s = [0]\nM = 104850\np = [1] * M\nS = 0\nfor i in range(2, M):\n if p[i]:\n for j in range(i * i, M, i):\n p[j] = 0\n S += i\n s.append(S)\nwhile 1:\n n = eval(input())\n if n == 0:\n break\n print(s[n])\n", "slow_time": 126327816139, "fast_time": 12782199012, "speedup": 9.8831, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_1"} +{"pair_id": "python_2393", "problem_id": "p03141", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\nsys.setrecursionlimit(10**5)\n\n\ndef li():\n return list(map(int, stdin.readline().split()))\n\n\ndef li_():\n return [int(x) - 1 for x in stdin.readline().split()]\n\n\ndef lf():\n return list(map(float, stdin.readline().split()))\n\n\ndef ls():\n return stdin.readline().split()\n\n\ndef ns():\n return stdin.readline().rstrip()\n\n\ndef lc():\n return list(ns())\n\n\ndef ni():\n return int(stdin.readline())\n\n\ndef nf():\n return float(stdin.readline())\n\n\nfrom heapq import heappush, heappop\n\nn = ni()\nab = [tuple(li()) for _ in range(n)]\nque = []\nfor ai, bi in ab:\n heappush(que, [-ai - bi, ai, bi])\ncnt = 0\ntak = 0\naok = 0\nwhile que:\n sm, ai, bi = heappop(que)\n if cnt % 2 == 0:\n tak += ai\n else:\n aok += bi\n cnt += 1\nprint((tak - aok))\n", "fast_code": "n = int(eval(input()))\natob = []\nans = 0\nfor i in range(n):\n x, y = list(map(int, input().split()))\n ans += x\n atob.append(x + y)\natob.sort(reverse=True)\nfor i in range(n // 2):\n ans -= atob[2 * i + 1]\nprint(ans)\n", "slow_time": 86818307, "fast_time": 30733848, "speedup": 2.8248, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_0"} +{"pair_id": "python_3971", "problem_id": "p02607", "language": "python", "slow_code": "import sys\nfrom collections import deque\nimport numpy as np\nimport math\n\nsys.setrecursionlimit(10**6)\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef SL():\n return list(map(str, sys.stdin.readline().rstrip().split()))\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef IL():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef Main():\n n = I()\n a = list(IL())\n c = 0\n for rep in range(0, n, 2):\n if a[rep] % 2:\n c += 1\n print(c)\n return\n\n\nif __name__ == \"__main__\":\n Main()\n", "fast_code": "n = int(eval(input()))\nc = i = 0\nfor a in map(int, input().split()):\n i += 1\n if i % 2 and a % 2:\n c += 1\nprint(c)\n", "slow_time": 53007642, "fast_time": 19850375, "speedup": 2.6704, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_10"} +{"pair_id": "python_8327", "problem_id": "p03448", "language": "python", "slow_code": "def main():\n A = int(input().strip())\n B = int(input().strip())\n C = int(input().strip())\n X = int(input().strip())\n if 500 > X:\n A = 0\n if 100 > X:\n B = 0\n count = 0\n for ai in [x * 500 for x in range(A + 1)]:\n Xa = X - ai\n for bi in [x * 100 for x in range(B + 1)]:\n Xb = Xa - bi\n for ci in [x * 50 for x in range(C + 1)]:\n Xc = Xb - ci\n if Xc == 0:\n count += 1\n return count\n\n\nif __name__ == \"__main__\":\n print((main()))\n", "fast_code": "a, b, c, x = [int(eval(input())) + 1 for _ in [0] * 4]\nprint((sum(c > x / 50 - s * 10 - t * 2 > 0 for s in range(a) for t in range(b))))\n", "slow_time": 2618233256, "fast_time": 87612031, "speedup": 29.8844, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_18"} +{"pair_id": "python_3958", "problem_id": "p03564", "language": "python", "slow_code": "N = int(eval(input()))\nK = int(eval(input()))\nmin_m = 10**10\nfor i in range(2**N):\n m = 1\n for n in range(N):\n if i & (1 << n):\n m *= 2\n else:\n m += K\n min_m = min(min_m, m)\nprint(min_m)\n", "fast_code": "import math\nimport string\nimport collections\nfrom collections import Counter\nfrom collections import deque\nfrom decimal import Decimal\n\n\ndef readints():\n return list(map(int, input().split()))\n\n\ndef nCr(n, r):\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\n\n\ndef has_duplicates2(seq):\n seen = []\n for item in seq:\n if not (item in seen):\n seen.append(item)\n return len(seq) != len(seen)\n\n\ndef divisor(n):\n divisor = []\n for i in range(1, n + 1):\n if n % i == 0:\n divisor.append(i)\n return divisor\n\n\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\nn = int(eval(input()))\nk = int(eval(input()))\nans = 1\nfor i in range(n):\n if ans + k < ans * 2:\n ans = ans + k\n else:\n ans = ans * 2\nprint(ans)\n", "slow_time": 620758240, "fast_time": 78790378, "speedup": 7.8786, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_0"} +{"pair_id": "python_6293", "problem_id": "p03419", "language": "python", "slow_code": "def calc0(N, M):\n cell = [[0 for i in range(M)] for j in range(N)]\n for i in range(M):\n for j in range(N):\n for y in range(-1, 2):\n for x in range(-1, 2):\n xx = i + x\n yy = j + y\n if 0 <= xx < M and 0 <= yy < N:\n cell[yy][xx] ^= 1\n r = 0\n for i in range(M):\n for j in range(N):\n if cell[j][i]:\n r += 1\n return r\n\n\ndef calc(N, M):\n if N == 1 and M == 1:\n return 1\n if N >= 2 and M >= 2:\n return (N - 2) * (M - 2)\n if N == 1:\n return M - 2\n return N - 2\n\n\nN, M = [int(_) for _ in input().split()]\nprint((calc(N, M)))\n", "fast_code": "n, m = list(map(int, input().split()))\nprint((abs((n - 2) * (m - 2))))\n", "slow_time": 72088785, "fast_time": 11764328, "speedup": 6.1277, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_11"} +{"pair_id": "python_11006", "problem_id": "p02640", "language": "python", "slow_code": "x, y = list(map(int, input().split()))\nfor i in range(0, 101):\n for j in range(0, 101):\n if i + j == x and i * 2 + j * 4 == y:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "fast_code": "x, y = list(map(int, input().split()))\nif y % 2 == 0 and (x * 2 <= y) and (y <= x * 4):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 502995557, "fast_time": 15330402, "speedup": 32.8103, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_2"} +{"pair_id": "python_6535", "problem_id": "p03332", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\nfrom collections import *\n\nMAX = 3 * 10**5 + 100\nMOD = 998244353\nfact = [0] * MAX\ninv = [0] * MAX\nfinv = [0] * MAX\nfact[0] = 1\nfact[1] = 1\nfinv[0] = 1\nfinv[1] = 1\ninv[1] = 1\nfor i in range(2, MAX):\n fact[i] = fact[i - 1] * i % MOD\n inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD\n finv[i] = finv[i - 1] * inv[i] % MOD\n\n\ndef C(n, r):\n if n < r:\n return 0\n if n < 0 or r < 0:\n return 0\n return fact[n] * (finv[r] * finv[n - r] % MOD) % MOD\n\n\nN, A, B, K = list(map(int, input().split()))\nans = 0\nfor i in range(N + 1):\n if (K - i * A) % B != 0:\n continue\n j = (K - i * A) // B\n ans += C(N, i) * C(N, j)\n ans %= MOD\nprint(ans)\n", "fast_code": "n, a, b, k = list(map(int, input().split()))\nMOD = 998244353\ninv = [0] * (n + 1)\ninv[1] = 1\nfor i in range(2, n + 1):\n inv[i] = (-(MOD // i) * inv[MOD % i]) % MOD\nnCr = [0] * (n + 1)\nnCr[0] = 1\nfor i in range(1, n + 1):\n nCr[i] = (nCr[i - 1] * (n - i + 1) * inv[i]) % MOD\nresult = 0\nmaxA = min(n, k // a)\nfor i in range(maxA + 1):\n if (k - a * i) % b == 0:\n j = (k - a * i) // b\n if j <= n:\n result += (nCr[i] * nCr[j]) % MOD\nif result == 0:\n print((1))\nelse:\n print((result % MOD))\n", "slow_time": 56165075681, "fast_time": 8998437330, "speedup": 6.2416, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_22"} +{"pair_id": "python_15337", "problem_id": "p02780", "language": "python", "slow_code": "n, k = list(map(int, input().split()))\narr = list(map(int, input().split()))\ntable = {}\nans = 0\nfor i in range(1, 1000 + 1):\n table[i] = (i + 1) * 0.5\nif n == 1:\n print((table[arr[0]]))\n exit()\nlis = [0 for _ in range(n)]\nlis[0] = table[arr[0]]\nfor i in range(n - 1):\n if i + 1 < k:\n lis[i + 1] = lis[i] + table[arr[i + 1]]\n else:\n lis[i + 1] = lis[i] + table[arr[i + 1]] - table[arr[i - k + 1]]\n ans = max(ans, lis[i + 1])\nprint(ans)\n", "fast_code": "n, k = list(map(int, input().split()))\nE = list([(x + 1) * 0.5 for x in list(map(int, input().split()))])\ne = sum(E[:k])\nemax = e\nfor i in range(k, n):\n e += E[i] - E[i - k]\n emax = max(e, emax)\nprint(emax)\n", "slow_time": 91479968, "fast_time": 21002215, "speedup": 4.3557, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_19"} +{"pair_id": "python_3602", "problem_id": "p02934", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef S():\n return eval(input())\n\n\ndef main():\n n = I()\n l = LI()\n sm = 0\n for x in l:\n sm += 1 / x\n return 1 / sm\n\n\nprint((main()))\n", "fast_code": "from decimal import Decimal\n\nn = int(eval(input()))\nList = list(map(int, input().split()))\nadd = 0\nfor i in List:\n add += Decimal(1 / i)\nprint((Decimal(1 / add)))\n", "slow_time": 79645167, "fast_time": 22528058, "speedup": 3.5354, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_24"} +{"pair_id": "python_11167", "problem_id": "p03816", "language": "python", "slow_code": "import functools\n\nN = int(eval(input()))\nA = list(map(int, input().split()))\nd = [0 for i in range(10**5 + 1)]\nfor a in A:\n d[a] = 1\ns = sum(d)\nprint((s - (0 if s % 2 else 1)))\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nd = {}\nfor a in A:\n d[a] = 1\nprint((len(d) - (0 if len(d) % 2 else 1)))\n", "slow_time": 1492903758, "fast_time": 22369473, "speedup": 66.7384, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_24"} +{"pair_id": "python_7711", "problem_id": "p02838", "language": "python", "slow_code": "mod = 1000000007\nans = 0\nn = int(eval(input()))\na = [int(i) for i in input().split()]\nx = [[0] * 63 for i in range(n + 1)]\nl = [(2**i) % mod for i in range(63)]\nfor i in range(n):\n d = a[i]\n cnt = 0\n for j in range(63):\n if d & 1:\n x[i + 1][cnt] = x[i][cnt] + 1\n else:\n x[i + 1][cnt] = x[i][cnt]\n cnt += 1\n d = d >> 1\nfor i in range(1, n):\n for j in range(63):\n p = x[i][j] - x[i - 1][j]\n if p:\n ans += l[j] * ((n - i) - (x[-1][j] - x[i][j]))\n else:\n ans += l[j] * (x[-1][j] - x[i][j])\n ans %= mod\nprint(ans)\n", "fast_code": "words = lambda t: list(map(t, input().split()))\nn = int(eval(input()))\nxs = words(int)\nys = [0] * 60\nfor x in xs:\n for i in range(60):\n if x == 0:\n continue\n ys[i] += x & 1\n x = x >> 1\nans = 0\nfor i, yi in enumerate(ys):\n ans += 2 ** (i) * yi * (n - yi)\n ans %= 10**9 + 7\nprint(ans)\n", "slow_time": 280836259, "fast_time": 71380020, "speedup": 3.9344, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_8"} +{"pair_id": "python_4452", "problem_id": "p03136", "language": "python", "slow_code": "def examA():\n T, X = LI()\n ans = T / X\n print(ans)\n return\n\n\ndef examB():\n N = I()\n L = LI()\n ans = \"Yes\"\n if max(L) * 2 >= sum(L):\n ans = \"No\"\n print(ans)\n return\n\n\nimport sys, copy, bisect, itertools, heapq, math\nfrom heapq import heappop, heappush, heapify\nfrom collections import Counter, defaultdict, deque\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef LSI():\n return list(map(str, sys.stdin.readline().split()))\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef SI():\n return sys.stdin.readline().strip()\n\n\nmod = 10**9 + 7\ninf = float(\"inf\")\nif __name__ == \"__main__\":\n examB()\n", "fast_code": "N = int(eval(input()))\nL = list(map(int, input().split()))\ntot = sum(L)\nlmax = max(L)\ntot -= lmax\nif tot > lmax:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 66845726, "fast_time": 22547539, "speedup": 2.9647, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_17"} +{"pair_id": "python_14823", "problem_id": "p03575", "language": "python", "slow_code": "import sys, re, os\nfrom collections import deque, defaultdict, Counter\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\nfrom itertools import permutations, combinations, product, accumulate\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom heapq import heapify, heappop, heappush\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef S_MAP():\n return list(map(str, input().split()))\n\n\ndef LIST():\n return list(map(int, input().split()))\n\n\ndef S_LIST():\n return list(map(str, input().split()))\n\n\nsys.setrecursionlimit(10**9)\nINF = float(\"inf\")\nmod = 10**9 + 7\n\n\ndef dijkstra(E, start):\n N_d = len(E)\n dist = [INF] * N_d\n dist[start] = 0\n q = [(0, start)]\n while q:\n dist_v, v = heappop(q)\n if dist[v] != dist_v:\n continue\n for u, dist_vu in E[v]:\n dist_u = dist_v + dist_vu\n if dist_u < dist[u]:\n dist[u] = dist_u\n heappush(q, (dist_u, u))\n return dist\n\n\nN, M = MAP()\nL = [LIST() for i in range(M)]\ngraph = defaultdict(list)\nfor a, b in L:\n graph[a - 1].append((b - 1, 1))\n graph[b - 1].append((a - 1, 1))\nans = 0\nfor i in range(M):\n a, b = L[i]\n E = deepcopy(graph)\n E[a - 1].remove((b - 1, 1))\n E[b - 1].remove((a - 1, 1))\n dist = dijkstra(E, 0)\n if dist.count(INF) > 0:\n ans += 1\nprint(ans)\n", "fast_code": "N, M = list(map(int, input().split()))\nedges = [list(map(int, input().split())) for i in range(M)]\nans = 0\nfor x in edges:\n l = list(range(N))\n for y in edges:\n if y != x:\n l = [l[y[0] - 1] if l[i] == l[y[1] - 1] else l[i] for i in range(N)]\n if len(set(l)) != 1:\n ans += 1\nprint(ans)\n", "slow_time": 146134559, "fast_time": 43890459, "speedup": 3.3295, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_13"} +{"pair_id": "python_4325", "problem_id": "p03264", "language": "python", "slow_code": "K = int(eval(input()))\na = []\nfor i in range(1, K + 1):\n a.append(i)\ncounter = 0\nif K >= 2 and K <= 100:\n for x in range(len(a)):\n for j in range(x + 1, len(a)):\n if a[x] & 1 == 0 and a[j] & 1 == 1 or a[x] & 1 == 1 and a[j] & 1 == 0:\n a[x] * a[j] % 2 == 0\n if a[x] * a[j] % 2 == 0:\n counter += 1\n print(counter)\n", "fast_code": "n = int(eval(input()))\na = (n + 1) // 2\nb = n // 2\nprint((a * b))\n", "slow_time": 113472482, "fast_time": 11598064, "speedup": 9.7837, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_5"} +{"pair_id": "python_13778", "problem_id": "p02385", "language": "python", "slow_code": "class Dice:\n def __init__(self):\n\n self.t = 1\n self.s = 2\n self.e = 3\n self.w = 4\n self.n = 5\n self.b = 6\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def __init__(self, t, s, e, w, n, b):\n\n self.t = t\n self.s = s\n self.e = e\n self.w = w\n self.n = n\n self.b = b\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def rot(self, way):\n if way == 0:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.n,\n self.t,\n self.e,\n self.w,\n self.b,\n self.s,\n )\n elif way == 1:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.s,\n self.b,\n self.e,\n self.w,\n self.t,\n self.n,\n )\n elif way == 2:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.w,\n self.s,\n self.t,\n self.b,\n self.n,\n self.e,\n )\n elif way == 3:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.e,\n self.s,\n self.b,\n self.t,\n self.n,\n self.w,\n )\n\n\ndef main():\n import random\n\n t1, s1, e1, w1, n1, b1 = list(map(int, input().split()))\n t2, s2, e2, w2, n2, b2 = list(map(int, input().split()))\n dice1 = Dice(t1, s1, e1, w1, n1, b1)\n dice2 = Dice(t2, s2, e2, w2, n2, b2)\n flag = 0\n for _ in range(10000):\n if (dice1.t, dice1.s, dice1.e, dice1.w, dice1.n, dice1.b) == (\n dice2.t,\n dice2.s,\n dice2.e,\n dice2.w,\n dice2.n,\n dice2.b,\n ):\n flag = 1\n break\n else:\n seed = random.randint(0, 3)\n dice2.rot(seed)\n if flag == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "class Dice:\n def __init__(self):\n self.faces = []\n\n def rotate(self, direction):\n tmp = self.faces.copy()\n if direction == \"N\":\n self.faces[5 - 1] = tmp[1 - 1]\n self.faces[1 - 1] = tmp[2 - 1]\n self.faces[2 - 1] = tmp[6 - 1]\n self.faces[6 - 1] = tmp[5 - 1]\n if direction == \"S\":\n self.faces[5 - 1] = tmp[6 - 1]\n self.faces[1 - 1] = tmp[5 - 1]\n self.faces[2 - 1] = tmp[1 - 1]\n self.faces[6 - 1] = tmp[2 - 1]\n if direction == \"W\":\n self.faces[4 - 1] = tmp[1 - 1]\n self.faces[1 - 1] = tmp[3 - 1]\n self.faces[3 - 1] = tmp[6 - 1]\n self.faces[6 - 1] = tmp[4 - 1]\n if direction == \"E\":\n self.faces[3 - 1] = tmp[1 - 1]\n self.faces[1 - 1] = tmp[4 - 1]\n self.faces[4 - 1] = tmp[6 - 1]\n self.faces[6 - 1] = tmp[3 - 1]\n return 0\n\n def spin(self):\n self.faces[4 - 1], self.faces[2 - 1], self.faces[5 - 1], self.faces[3 - 1] = (\n self.faces[2 - 1],\n self.faces[3 - 1],\n self.faces[4 - 1],\n self.faces[5 - 1],\n )\n return 0\n\n\nd1 = Dice()\nd2 = Dice()\nd1.faces = [int(x) for x in input().split(\" \")]\nd2.faces = [int(x) for x in input().split(\" \")]\nup, front = d1.faces[0], d1.faces[1]\nres = \"No\"\n\nfor _ in range(3):\n for _ in range(4):\n for ___ in range(4):\n\n if d1.faces == d2.faces:\n res = \"Yes\"\n break\n d2.spin()\n d2.rotate(\"W\")\n d2.rotate(\"N\")\nprint(res)\n", "slow_time": 3599802039, "fast_time": 138326850, "speedup": 26.0239, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_18"} +{"pair_id": "python_13669", "problem_id": "p03312", "language": "python", "slow_code": "import sys\n\ninput = lambda: sys.stdin.readline().rstrip()\nsys.setrecursionlimit(max(1000, 10**9))\nn = int(eval(input()))\na = list(map(int, input().split()))\nca = [None] * n\ns = 0\nfor i, num in enumerate(a):\n s += a[i]\n ca[i] = s\ndiff = [None] * n\ns = 0\nt = 1\nv1 = 0\nv2 = a[0]\ndiff[t - 1] = (v1, v2)\nwhile t < n:\n\n t += 1\n v2 += a[t - 1]\n while v1 < v2 and s < t:\n if diff[t - 1] is None or abs(v1 - v2) < abs(diff[t - 1][0] - diff[t - 1][1]):\n diff[t - 1] = (v1, v2)\n s += 1\n v1 += a[s - 1]\n v2 -= a[s - 1]\n if diff[t - 1] is None or abs(v1 - v2) < abs(diff[t - 1][0] - diff[t - 1][1]):\n diff[t - 1] = (v1, v2)\n if v1 > v2 and s >= 1:\n v1 -= a[s - 1]\n v2 += a[s - 1]\n s -= 1\ndiff2 = [None] * n\ns = n\nt = n - 1\nv1 = 0\nv2 = a[-1]\ndiff2[t] = (v1, v2)\nwhile t >= 1:\n\n t -= 1\n v2 += a[t]\n while v1 < v2 and s > t:\n if diff2[t] is None or abs(v1 - v2) < abs(diff2[t][0] - diff2[t][1]):\n diff2[t] = (v1, v2)\n s -= 1\n v1 += a[s]\n v2 -= a[s]\n if diff2[t] is None or abs(v1 - v2) < abs(diff2[t][0] - diff2[t][1]):\n diff2[t] = (v1, v2)\n if v1 > v2 and s <= n - 2:\n v1 -= a[s]\n v2 += a[s]\n s += 1\nprint(\n (\n min(\n (\n max(diff[i][0], diff[i][1], diff2[i + 1][0], diff2[i + 1][1])\n - min(diff[i][0], diff[i][1], diff2[i + 1][0], diff2[i + 1][1])\n )\n for i in range(n - 1)\n )\n )\n)\n", "fast_code": "N = int(eval(input()))\nAs = list(map(int, input().split()))\nans = float(\"inf\")\niB, iD = 1, 3\n(P, Q, R), S = As[:3], sum(As[3:])\n\nfor iC in range(2, N - 1):\n while P < Q and As[iB] <= Q - P:\n P += As[iB]\n Q -= As[iB]\n iB += 1\n while R < S and As[iD] <= S - R:\n R += As[iD]\n S -= As[iD]\n iD += 1\n ans = min(ans, max(P, Q, R, S) - min(P, Q, R, S))\n Q += As[iC]\n R -= As[iC]\nprint(ans)\n", "slow_time": 158663806, "fast_time": 54265311, "speedup": 2.9239, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_7"} +{"pair_id": "python_17352", "problem_id": "p02555", "language": "python", "slow_code": "from itertools import accumulate\n\nS = int(eval(input()))\nmod = 10**9 + 7\nif S == 1 or S == 2:\n print((0))\n exit()\ndp = [0] * (S + 1)\ndp[0] = 1\nans = 0\nfor i in range(S):\n cum = list(accumulate(dp))\n for j in range(S, 2, -1):\n dp[j] = cum[j - 3] % mod\n dp[0] = dp[1] = dp[2] = 0\n ans = (ans + dp[S]) % mod\nprint(ans)\n", "fast_code": "s = int(eval(input()))\nx = s // 3\n\n\ndef cmb(n, r):\n if n - r < r:\n r = n - r\n if r == 0:\n return 1\n if r == 1:\n return n\n numerator = [n - r + k + 1 for k in range(r)]\n denominator = [k + 1 for k in range(r)]\n for p in range(2, r + 1):\n pivot = denominator[p - 1]\n if pivot > 1:\n offset = (n - r) % p\n for k in range(p - 1, r, p):\n numerator[k - offset] /= pivot\n denominator[k] /= pivot\n result = 1\n for k in range(r):\n if numerator[k] > 1:\n result *= int(numerator[k])\n return result\n\n\nans = 0\nfor i in range(x):\n Box = i + 1\n Nokori = s - 3 * Box\n ans_ = cmb(Nokori + Box - 1, Box - 1)\n ans += ans_\nprint((ans % (10**9 + 7)))\n", "slow_time": 2797213779, "fast_time": 405576047, "speedup": 6.8969, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_8"} +{"pair_id": "python_648", "problem_id": "p02793", "language": "python", "slow_code": "def make_prime_table(N):\n sieve = [0] * (N + 1)\n sieve[0] = -1\n sieve[1] = -1\n for i in range(2, N + 1):\n if sieve[i] != 0:\n continue\n sieve[i] = i\n for j in range(i * i, N + 1, i):\n if sieve[j] == 0:\n sieve[j] = i\n return sieve\n\n\nN = int(eval(input()))\nA = list(map(int, input().split()))\nm = 1000000007\nsieve = make_prime_table(1000000)\nlcm_factors = {}\nfor i in range(N):\n t = []\n a = A[i]\n while a != 1:\n if len(t) != 0 and t[-1][0] == sieve[a]:\n t[-1][1] += 1\n else:\n t.append([sieve[a], 1])\n a //= sieve[a]\n for k, v in t:\n if k not in lcm_factors or lcm_factors[k] < v:\n lcm_factors[k] = v\nlcm = 1\nfor k in lcm_factors:\n for i in range(lcm_factors[k]):\n lcm *= k\n lcm %= m\nresult = 0\nfor i in range(N):\n result += lcm * pow(A[i], m - 2, m)\n result %= m\nprint(result)\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nmod = 10**9 + 7\nl = [0] * (max(A) + 1)\nl[1] = 1\nfor a in A:\n if a == 1:\n continue\n x = 0\n while a % 2 == 0:\n a //= 2\n x += 1\n l[2] = max(l[2], x)\n f = 3\n while f**2 <= a:\n x = 0\n while a % f == 0:\n a //= f\n x += 1\n l[f] = max(l[f], x)\n f += 2\n if a != 1:\n l[a] = max(l[a], 1)\nb = 1\nfor i, x in enumerate(l):\n b *= pow(i, x, mod)\n b %= mod\nans = 0\nfor a in A:\n ans += (b * pow(a, mod - 2, mod)) % mod\n ans %= mod\nprint((ans % mod))\n", "slow_time": 37402461682, "fast_time": 7404967239, "speedup": 5.051, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_22"} +{"pair_id": "python_2609", "problem_id": "p02660", "language": "python", "slow_code": "def make_divisors(n):\n divisors = []\n for i in range(1, int(n**0.5) + 1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i:\n divisors.append(n // i)\n\n return divisors\n\n\ndef soinsu_bunkai(m):\n pf = {}\n for i in range(2, int(m**0.5) + 1):\n while m % i == 0:\n pf[i] = pf.get(i, 0) + 1\n m //= i\n if m > 1:\n pf[m] = 1\n return pf\n\n\nimport sys\n\ninput = sys.stdin.readline\nN = int(eval(input()))\ndiv = make_divisors(N)\ndiv.sort()\ndiv_2 = div[1:]\ncount = 0\nfor i in div_2:\n i2 = soinsu_bunkai(i)\n if len(i2) == 1:\n q, mod = divmod(N, i)\n if mod == 0:\n count += 1\n N = q\nprint(count)\n", "fast_code": "n = int(eval(input()))\nd = {2: 0}\nwhile n % 2 < 1:\n n //= 2\n d[2] += 1\nfor i in range(3, int(n**0.5) + 1, 2):\n while n % i < 1:\n n //= i\n d[i] = d.get(i, 0) + 1\n if n < 2:\n break\nif n > 1:\n d[n] = 1\na = 0\nfor i in list(d.values()):\n t = c = 0\n while t + c < i:\n c += 1\n t += c\n a += c\nprint(a)\n", "slow_time": 14877441202, "fast_time": 1869795539, "speedup": 7.9567, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_19"} +{"pair_id": "python_10429", "problem_id": "p03576", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul\n\nsys.setrecursionlimit(10000)\n\n\ndef read_int():\n return int(input())\n\n\ndef read_int_n():\n return list(map(int, input().split()))\n\n\ndef read_float():\n return float(input())\n\n\ndef read_float_n():\n return list(map(float, input().split()))\n\n\ndef read_str():\n return input()\n\n\ndef read_str_n():\n return list(map(str, input().split()))\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n error_print(e - s, \"sec\")\n return ret\n\n return wrap\n\n\n@mt\ndef slv(N, K, XY):\n X = sorted(map(lambda x: x[0], XY))\n RX = X[::-1]\n Y = sorted(map(lambda x: x[1], XY))\n RY = Y[::-1]\n ans = sys.maxsize\n for lx in X:\n for rx in RX:\n if lx > rx:\n break\n for by in Y:\n for ty in RY:\n if by > ty:\n break\n k = 0\n for x, y in XY:\n if lx <= x <= rx and by <= y <= ty:\n k += 1\n if k >= K:\n ans = min(ans, (rx - lx) * (ty - by))\n else:\n break\n return ans\n\n\ndef main():\n N, K = read_int_n()\n XY = [read_int_n() for _ in range(N)]\n print(slv(N, K, XY))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N, K = list(map(int, input().split()))\nXY = [list(map(int, input().split())) for _ in range(N)]\nXY.sort()\nr = 10**20\nfor xi0 in range(N - K + 1):\n for xi1 in range(K + xi0 - 1, N):\n x = XY[xi1][0] - XY[xi0][0]\n XY_ys = sorted(XY[xi0 : xi1 + 1], key=lambda a: a[1])\n for yi0 in range(len(XY_ys) - K + 1):\n y = XY_ys[yi0 + K - 1][1] - XY_ys[yi0][1]\n r = min(r, x * y)\nprint(r)\n", "slow_time": 157973113, "fast_time": 54468250, "speedup": 2.9003, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_11"} +{"pair_id": "python_6230", "problem_id": "p03502", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nimport array\nimport inspect\n\nsys.setrecursionlimit(10000)\n\n\ndef chkprint(*args):\n names = {id(v): k for k, v in list(inspect.currentframe().f_back.f_locals.items())}\n print((\", \".join(names.get(id(arg), \"???\") + \" = \" + repr(arg) for arg in args)))\n\n\ndef to_bin(x):\n return bin(x)[2:]\n\n\ndef li_input():\n return [int(_) for _ in input().split()]\n\n\ndp = None\n\n\ndef main():\n X = int(eval(input()))\n if X % sum(list(map(int, list(str(X))))) == 0:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nmain()\n", "fast_code": "n = int(eval(input()))\ns = str(n)\nsum = 0\nfor i in range(len(s)):\n sum += ord(s[i]) - ord(\"0\")\nif n % sum == 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 66486570, "fast_time": 22559937, "speedup": 2.9471, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_2"} +{"pair_id": "python_14612", "problem_id": "p01314", "language": "python", "slow_code": "if __name__ == \"__main__\":\n while True:\n n = int(eval(input()))\n if n == 0:\n break\n count = 0\n for i in range(1, n):\n for j in range(i + 1, n):\n sum = (i + j) * (j - i + 1) / 2\n if sum > n:\n break\n if sum == n:\n count += 1\n print(count)\n", "fast_code": "import sys\n\nif sys.version_info[0] >= 3:\n raw_input = input\ntry:\n while True:\n n = int(input())\n if n == 0:\n break\n r = 0\n i = 1\n while 1:\n n -= i\n i += 1\n if n < i:\n break\n if n % i == 0:\n r += 1\n print(r)\nexcept EOFError:\n pass\n", "slow_time": 129769763, "fast_time": 28682051, "speedup": 4.5244, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_6"} +{"pair_id": "python_16161", "problem_id": "p03472", "language": "python", "slow_code": "import sys\nfrom collections import defaultdict, Counter\nfrom itertools import product, groupby, count, permutations, combinations\nfrom math import pi, sqrt, floor\nfrom collections import deque\nfrom bisect import bisect, bisect_left, bisect_right\nfrom string import ascii_lowercase\nfrom functools import lru_cache, reduce\nfrom operator import xor\nfrom heapq import heappush, heappop\n\nINF = float(\"inf\")\nsys.setrecursionlimit(10**7)\n\ndy4, dx4 = [0, -1, 0, 1], [1, 0, -1, 0]\n\n\ndef inside(y: int, x: int, H: int, W: int) -> bool:\n return 0 <= y < H and 0 <= x < W\n\n\ndef ceil(a, b):\n return (a + b - 1) // b\n\n\ndef solve(N, H, a_b):\n max_a = -1\n for a, b in a_b:\n max_a = max(max_a, a)\n good_b = []\n for a, b in a_b:\n if b >= max_a:\n good_b.append(b)\n ans = 0\n for b in sorted(good_b, reverse=True):\n ans += 1\n H -= b\n if H <= 0:\n return ans\n return ans + ceil(H, max_a)\n\n\ndef main():\n N, H = list(map(int, input().split()))\n l = []\n for _ in range(N):\n a, b = list(map(int, input().split()))\n l.append((a, b))\n print((solve(N, H, l)))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "n, h, *t = list(map(int, open(0).read().split()))\nb = sorted(t[1::2])\na = max(t[::2])\nc = 0\nwhile h > 0 and b and b[-1] > a:\n h -= b.pop()\n c += 1\nif h > 0:\n c -= -h // a\nprint(c)\n", "slow_time": 97838002, "fast_time": 37488820, "speedup": 2.6098, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_8"} +{"pair_id": "python_11178", "problem_id": "p03816", "language": "python", "slow_code": "from collections import defaultdict\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return list(map(list, sys.stdin.readline().split()))\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = I()\n return l\n\n\ndef LIR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = LI()\n return l\n\n\ndef SR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = S()\n return l\n\n\ndef LSR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = SR()\n return l\n\n\nmod = 1000000007\n\n\n\"\"\"\"\"\"\n\nn = I()\na = LI()\nd = defaultdict(int)\nfor i in a:\n d[i] += 1\nl = list(d.keys())\nk = 0\nfor i in l:\n k ^= ~(d[i] % 2)\n d[i] = 1\nans = sum(list(d.values()))\nans -= 1 if k % 2 else 0\nprint(ans)\n", "fast_code": "n = int(eval(input()))\na = [int(j) for j in input().split()]\nans = len(set(a))\nif (n - ans) % 2 == 0:\n print(ans)\nelse:\n print((ans - 1))\n", "slow_time": 111635076, "fast_time": 25037491, "speedup": 4.4587, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_15"} +{"pair_id": "python_12669", "problem_id": "p02703", "language": "python", "slow_code": "import sys\nfrom heapq import heapify, heappop, heappush\n\nsr = lambda: sys.stdin.readline().rstrip()\nir = lambda: int(sr())\nlr = lambda: list(map(int, sr().split()))\n\nN, M, S = lr()\nUVAB = [lr() for _ in range(M)]\nCD = [lr() for _ in range(N)]\nAmax = 0\nfor i in range(M):\n a = UVAB[i][2]\n if a > Amax:\n Amax = a\nlimit = Amax * (N - 1)\nS = min(S, limit)\ngraph = [[] for _ in range(N + 1)]\nfor u, v, a, b in UVAB:\n graph[u].append((v, a, b))\n graph[v].append((u, a, b))\n\n\ndef dijkstra(start):\n\n INF = 10**15\n dist = [[INF for _ in range(limit + 1)] for _ in range(N + 1)]\n dist[1][S] = 0\n que = [(0, S, 1)]\n while que:\n time, silver, prev = heappop(que)\n if dist[prev][silver] < time:\n continue\n for next, a, b in graph[prev]:\n t = time + b\n si = silver - a\n if si < 0:\n continue\n if dist[next][si] > t:\n dist[next][si] = t\n heappush(que, (t, si, next))\n c, d = CD[prev - 1]\n si = min(limit, silver + c)\n while dist[prev][si] > time + d:\n dist[prev][si] = time + d\n heappush(que, (time + d, si, prev))\n si += c\n si = min(limit, si)\n time += d\n return dist\n\n\ndist = dijkstra(1)\nfor i in range(2, N + 1):\n d = dist[i]\n answer = min(d)\n print(answer)\n", "fast_code": "n, m, s = list(map(int, input().split()))\nuvab = [list(map(int, input().split())) for _ in range(m)]\ncd = [list(map(int, input().split())) for _ in range(n)]\ng = [[] for _ in range(n)]\nfor u, v, a, b in uvab:\n u, v = u - 1, v - 1\n g[u].append([v, a, b])\n g[v].append([u, a, b])\n\nfrom heapq import heappop, heappush\n\ninf = float(\"inf\")\nmaxs = 50 * m\nans = [[inf] * (maxs + 1) for _ in range(n)]\ns = min(s, maxs)\ntodo = [[0, 0, s]]\nans[0][s] = 0\nwhile todo:\n t, v, ss = heappop(todo)\n if ans[v][ss] < t:\n continue\n for nv, na, nb in g[v]:\n if na > ss:\n continue\n if ans[nv][ss - na] > t + nb:\n heappush(todo, [t + nb, nv, ss - na])\n ans[nv][ss - na] = t + nb\n c, d = cd[v]\n nss = min(ss + c, maxs)\n if ans[v][nss] > t + d:\n heappush(todo, [t + d, v, nss])\n ans[v][nss] = t + d\nfor i in range(1, n):\n print((min(ans[i])))\n", "slow_time": 6039274323, "fast_time": 775381459, "speedup": 7.7888, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_17"} +{"pair_id": "python_3708", "problem_id": "p02731", "language": "python", "slow_code": "def main():\n L = int(eval(input()))\n ans = 0\n for i in range(min(L, 1000)):\n for j in range(1000):\n a = i + (j / 1000)\n b = (L - a) / 2\n ans = max(ans, a * b * b)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "L = int(eval(input()))\nl = L / 3\nprint((l**3))\n", "slow_time": 870567638, "fast_time": 10602666, "speedup": 82.1084, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_17"} +{"pair_id": "python_14022", "problem_id": "p03125", "language": "python", "slow_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nmod = 10**9 + 7\ninf = float(\"inf\")\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\na, b = LI()\nif b % a == 0:\n print((a + b))\nelse:\n print((b - a))\n", "fast_code": "def ans():\n a, b = list(map(int, input().split()))\n if b % a == 0:\n print((a + b))\n else:\n print((b - a))\n\n\nans()\n", "slow_time": 43332877, "fast_time": 17646032, "speedup": 2.4557, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_12"} +{"pair_id": "python_7280", "problem_id": "p02881", "language": "python", "slow_code": "n = int(eval(input()))\nans = n - 1\ncnt = 2\nwhile cnt <= int(n**0.5) + 1:\n if n % cnt == 0:\n ans = min(ans, (cnt - 1) + (n // cnt - 1))\n cnt += 1\nprint(ans)\n", "fast_code": "n = int(eval(input()))\nprint((min(a + (n // a) - 2 for a in range(1, int(n**0.5) + 1) if n % a == 0)))\n", "slow_time": 926096682, "fast_time": 191385250, "speedup": 4.8389, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_6"} +{"pair_id": "python_534", "problem_id": "p03221", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\nP = []\nY = []\narr = [[] for j in range(10**5 + 1)]\nfor i in range(M):\n listA = list(map(int, input().split()))\n P.append(listA[0])\n Y.append(listA[1])\n arr[listA[0]].append(listA[1])\nfor i in range(N + 1):\n arr[i].sort()\nfor i in range(M):\n\n left = 0\n right = len(arr[P[i]]) - 1\n while left <= right:\n mid = (left + right) // 2\n if arr[P[i]][mid] == Y[i]:\n k = mid\n break\n elif arr[P[i]][mid] > Y[i]:\n right = mid - 1\n else:\n left = mid + 1\n print((str(P[i]).rjust(6, \"0\") + str(k + 1).rjust(6, \"0\")))\n", "fast_code": "class struct:\n def __init__(self, i, a, b, c):\n self.i = i\n self.a = a\n self.b = b\n self.c = c\n\n\nn, m = list(map(int, input().split()))\nl = []\nl2 = []\nfor i in range(n):\n l2.append(1)\nfor i in range(m):\n a, b = list(map(int, input().split()))\n l.append(struct(i, a, b, 0))\nl = sorted(l, key=lambda x: (x.a, x.b))\nfor i in range(m):\n a = l[i].a\n l[i].c = l2[a - 1]\n l2[a - 1] += 1\nl = sorted(l, key=lambda x: x.i)\nfor i in l:\n print((str(i.a).zfill(6) + str(i.c).zfill(6)))\n", "slow_time": 2260230442, "fast_time": 50156732, "speedup": 45.0634, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_1"} +{"pair_id": "python_9055", "problem_id": "p03837", "language": "python", "slow_code": "n, m = list(map(int, input().split()))\nd = [[float(\"inf\") for i in range(n)] for i in range(n)]\nr = [list(map(int, input().split())) for i in range(m)]\nfrom scipy.sparse.csgraph import floyd_warshall\n\nfor u, v, c in r:\n u, v = u - 1, v - 1\n d[u][v] = d[v][u] = c\nd = floyd_warshall(d).tolist()\ncnt = 0\nfor u, v, c in r:\n u, v = u - 1, v - 1\n if d[u][v] != c:\n cnt += 1\nprint(cnt)\n", "fast_code": "N, M = list(map(int, input().split()))\nINF = 10**6\nEdge = [[INF] * N for _ in range(N)]\nfor _ in range(M):\n a, b, c = list(map(int, input().split()))\n Edge[a - 1][b - 1] = c\n Edge[b - 1][a - 1] = c\ndp = [[INF] * N for _ in range(N)]\nfor i in range(N):\n for j in range(N):\n if i == j:\n dp[i][j] = 0\n else:\n dp[i][j] = Edge[i][j]\nfor k in range(N):\n for i in range(N):\n for j in range(N):\n dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j])\nans = 0\nfor i in range(N - 1):\n for j in range(i + 1, N):\n if Edge[i][j] == INF:\n continue\n if Edge[i][j] > dp[i][j]:\n ans += 1\nprint(ans)\n", "slow_time": 14535365898, "fast_time": 51979264, "speedup": 279.6378, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_29"} +{"pair_id": "python_6128", "problem_id": "p03173", "language": "python", "slow_code": "from numpy import *\n\nn, a = open(0)\nn = int(n)\na = cumsum(int64([0] + a.split()))\ndp = zeros((n, n + 1), \"i8\")\nfor k in range(1, n):\n l = arange(n - k)\n r = arange(k + 1, n + 1)\n m = (arange(1, k + 1) + l[:, newaxis]).T\n dp[l, r] = amin(dp[l, m] + dp[m, r], 0) + a[r] - a[l]\nprint((dp[0, n]))\n", "fast_code": "import sys\n\nsys.setrecursionlimit(1000000000)\ninput = sys.stdin.readline\nINF = 10**15\nn = int(eval(input()))\na = list(map(int, input().split()))\nb = [0] * (n + 1)\nfor i in range(n):\n b[i + 1] = b[i] + a[i]\ndp = [[-1] * n for i in range(n)]\nfor i in range(n):\n dp[i][i] = 0\n\n\ndef memo(i, j):\n if dp[i][j] >= 0:\n return dp[i][j]\n ans = INF\n for k in range(i, j):\n ans = min(ans, memo(i, k) + memo(k + 1, j))\n dp[i][j] = ans + b[j + 1] - b[i]\n return dp[i][j]\n\n\nprint((memo(0, n - 1)))\n", "slow_time": 9597255804, "fast_time": 66199946, "speedup": 144.9738, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_5"} +{"pair_id": "python_7853", "problem_id": "p02888", "language": "python", "slow_code": "from collections import defaultdict, deque, Counter, OrderedDict\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce, lru_cache\nfrom heapq import heappush, heappop, heapify\nimport itertools\nimport math, fractions\nimport sys, copy\n\n\ndef L():\n return sys.stdin.readline().split()\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef SL():\n return list(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI1():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef R(n):\n return [sys.stdin.readline().strip() for _ in range(n)]\n\n\ndef LR(n):\n return [L() for _ in range(n)]\n\n\ndef IR(n):\n return [I() for _ in range(n)]\n\n\ndef LIR(n):\n return [LI() for _ in range(n)]\n\n\ndef LIR1(n):\n return [LI1() for _ in range(n)]\n\n\ndef SR(n):\n return [SL() for _ in range(n)]\n\n\ndef LSR(n):\n return [LS() for _ in range(n)]\n\n\ndef perm(n, r):\n return math.factorial(n) // math.factorial(r)\n\n\ndef comb(n, r):\n return math.factorial(n) // (math.factorial(r) * math.factorial(n - r))\n\n\ndef make_list(n, *args, default=0):\n return (\n [make_list(*args, default=default) for _ in range(n)]\n if len(args) > 0\n else [default for _ in range(n)]\n )\n\n\ndire = [[1, 0], [0, 1], [-1, 0], [0, -1]]\ndire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]\nalphabets = \"abcdefghijklmnopqrstuvwxyz\"\nALPHABETS = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nMOD = 1000000007\nINF = float(\"inf\")\nsys.setrecursionlimit(1000000)\n\n\ndef main():\n N = I()\n L = sorted(LI())\n ans = 0\n for i in range(N):\n k = i\n for j in range(i + 1, N):\n while k < N and L[k] < L[i] + L[j]:\n k += 1\n ans += k - (j + 1)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "from bisect import bisect_left, bisect_right\n\nn = int(eval(input()))\nstick = list(map(int, input().split()))\nstick.sort()\ncount = 0\nfor i in range(n):\n for j in range(i + 1, n):\n l = bisect_left(stick, stick[j] - stick[i] + 1)\n r = bisect_right(stick, stick[i] + stick[j] - 1) - 1\n if r < 0 or l >= n:\n break\n count += r - l + 1\n if l <= i <= r:\n count -= 1\n if l <= j <= r:\n count -= 1\nprint((count // 3))\n", "slow_time": 203845466, "fast_time": 52333859, "speedup": 3.8951, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_17"} +{"pair_id": "python_11514", "problem_id": "p02621", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST():\n return list(map(int, input().split()))\n\n\ndef ZIP(n):\n return list(zip(*(MAP() for _ in range(n))))\n\n\ndef main():\n sys.setrecursionlimit(10**8)\n INF = float(\"inf\")\n a = INT()\n print((a + a**2 + a**3))\n return\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "s = int(input())\nprint(s + s**2 + s**3)\n", "slow_time": 53894386, "fast_time": 7277371, "speedup": 7.4057, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_29"} +{"pair_id": "python_10773", "problem_id": "p03767", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef A():\n n = I()\n a = LI()\n a.sort(key=lambda x: -x)\n ans = 0\n for i in range(n):\n ans += a[2 * i + 1]\n print(ans)\n return\n\n\ndef B():\n def dfs(d, x, c):\n if d <= dp[x]:\n return\n dp[x] = d\n if not f[x]:\n f[x] = c\n for y in v[x]:\n dfs(d - 1, y, c)\n\n n, m = LI()\n f = [0] * n\n v = [[] for i in range(n)]\n for i in range(m):\n a, b = LI()\n a -= 1\n b -= 1\n v[a].append(b)\n v[b].append(a)\n dp = defaultdict(lambda: -1)\n q = I()\n l = LIR(q)\n l = l[::-1]\n for x, d, c in l:\n x -= 1\n dfs(d, x, c)\n for i in f:\n print(i)\n return\n\n\ndef C():\n n = I()\n return\n\n\ndef D():\n n = I()\n return\n\n\ndef E():\n n = I()\n return\n\n\ndef F():\n n = I()\n return\n\n\nif __name__ == \"__main__\":\n A()\n", "fast_code": "n, *a = list(map(int, open(0).read().split()))\nprint((sum(v for k, v in enumerate(sorted(a)[n:]) if k % 2 < 1)))\n", "slow_time": 173061558, "fast_time": 32424457, "speedup": 5.3374, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_29"} +{"pair_id": "python_15150", "problem_id": "p03775", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\n\n\ndef divisors(N: int) -> set:\n \"\"\"\"\"\"\n from math import sqrt\n\n s = {1, N}\n\n for i in range(2, int(sqrt(N)) + 1):\n\n if N % i == 0:\n s.add(i)\n s.add(N // i)\n return s\n\n\ndef compare(a, b):\n return max(len(str(a)), len(str(b)))\n\n\nN = INT()\nans = INF\nfor div1 in divisors(N):\n div2 = N // div1\n ans = min(ans, compare(div1, div2))\nprint(ans)\n", "fast_code": "def PrimeDecomp(N, ConcFlag):\n if ConcFlag:\n if N <= 1:\n return [1], 1\n else:\n I = 2\n PrimeDec = []\n DivCount = 1\n while I * I <= N:\n Cnt = 0\n while N % I == 0:\n N //= I\n PrimeDec.append(I)\n if Cnt >= 1:\n DivCount *= Cnt + 1\n I += 1\n if N >= 2:\n PrimeDec.append(N)\n DivCount *= 2\n return PrimeDec, DivCount\n else:\n if N <= 1:\n return [1], [1], 1\n else:\n I = 2\n PrimeDec = []\n PrimeCnt = []\n DivCount = 1\n while I * I <= N:\n Cnt = 0\n while N % I == 0:\n N //= I\n Cnt += 1\n if Cnt >= 1:\n PrimeDec.append(I)\n PrimeCnt.append(Cnt)\n DivCount *= Cnt + 1\n I += 1\n if N >= 2:\n PrimeDec.append(N)\n PrimeCnt.append(1)\n DivCount *= 2\n return PrimeDec, PrimeCnt, DivCount\n\n\nfrom itertools import combinations\nfrom operator import mul\nfrom functools import reduce\n\nN = int(eval(input()))\nPrimeDec, _ = PrimeDecomp(N, True)\nFABMax = len(str(N))\nfor TR in range(1, len(PrimeDec) + 1):\n for A in set(reduce(mul, T) for T in combinations(PrimeDec, TR)):\n B = N // A\n FABMax = min(FABMax, max(len(str(A)), len(str(B))))\nprint(FABMax)\n", "slow_time": 1058543442, "fast_time": 233216425, "speedup": 4.5389, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_7"} +{"pair_id": "python_2078", "problem_id": "p02989", "language": "python", "slow_code": "import math\n\n\ndef py():\n print(\"Yes\")\n\n\ndef pn():\n print(\"No\")\n\n\ndef iin():\n x = int(eval(input()))\n return x\n\n\nneko = 0\nnya = 0\nnuko = 0\nn = iin()\nd = [int(x) for x in input().split()]\nd.sort()\nneko = int(n / 2 - 1)\nnuko = neko + 1\nif d[neko] != d[nuko]:\n for i in range(d[nuko] - d[neko]):\n nya = nya + 1\nprint(nya)\n", "fast_code": "N = int(eval(input()))\nd_list = list(map(int, input().split()))\nd_list.sort()\nprint((d_list[N // 2] - d_list[N // 2 - 1]))\n", "slow_time": 245848196, "fast_time": 18308941, "speedup": 13.4278, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_7"} +{"pair_id": "python_2962", "problem_id": "p03146", "language": "python", "slow_code": "nums = []\nnums.append(int(eval(input())))\nfor i in range(1, 100000):\n if nums[i - 1] % 2 == 0:\n nums.append(nums[i - 1] // 2)\n else:\n nums.append(nums[i - 1] * 3 + 1)\nfor i in range(100000):\n for j in range(i + 1, 100000):\n if nums[i] == nums[j]:\n print((j + 1))\n break\n else:\n continue\n break\n", "fast_code": "s = int(eval(input()))\n\n\ndef f(n):\n if n % 2 == 0:\n return n // 2\n else:\n return 3 * n + 1\n\n\na = [s]\nfor i in range(1, 1000001):\n if a[i - 1] in a[: i - 1]:\n print(i)\n break\n else:\n a.append(f(a[i - 1]))\n", "slow_time": 271547962358, "fast_time": 46636364, "speedup": 5822.6658, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_25"} +{"pair_id": "python_13276", "problem_id": "p03035", "language": "python", "slow_code": "import sys, math, collections, heapq, itertools\n\nF = sys.stdin\n\n\ndef single_input():\n return F.readline().strip(\"\\n\")\n\n\ndef line_input():\n return F.readline().strip(\"\\n\").split()\n\n\ndef gcd(a, b):\n a, b = max(a, b), min(a, b)\n while a % b > 0:\n a, b = b, a % b\n return b\n\n\ndef solve():\n A, B = list(map(int, line_input()))\n if A >= 13:\n print(B)\n elif A >= 6:\n print((B // 2))\n else:\n print((0))\n return 0\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "a, b = list(map(int, input().split()))\nprint((b if a > 12 else int(b / 2) if 5 < a and a < 13 else 0))\n", "slow_time": 48276073, "fast_time": 14543017, "speedup": 3.3195, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_16"} +{"pair_id": "python_4129", "problem_id": "p03170", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys\nimport numpy as np\n\nsys.setrecursionlimit(10**9)\n\n\nmod = 10**9 + 7\n\nN, K = list(map(int, input().split()))\nA = np.array(list(map(int, input().split())))\ndp = [True for i in range(K + A[-1] + 1)]\nfor i in range(K):\n if dp[i]:\n for a in A:\n dp[i + a] = False\n\n\nif dp[K]:\n ans = \"Second\"\nelse:\n ans = \"First\"\nprint(ans)\n", "fast_code": "def main():\n N, K, *A = list(map(int, open(0).read().split()))\n dp = [0] * (K + 1)\n for i in range(K):\n if dp[i]:\n continue\n for a in A:\n if i + a > K:\n break\n dp[i + a] = 1\n print((\"First\" if dp[-1] else \"Second\"))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 1985487989, "fast_time": 337356019, "speedup": 5.8854, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_1"} +{"pair_id": "python_3272", "problem_id": "p03354", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = float(\"inf\")\nMOD = 10**9 + 7\n\n\nclass UnionFind:\n \"\"\"\"\"\"\n\n def __init__(self, n):\n self.n = n\n\n self.par = [i for i in range(n + 1)]\n\n self.rank = [0] * (n + 1)\n\n self.size = [1] * (n + 1)\n\n self.tree = [True] * (n + 1)\n\n def find(self, x):\n \"\"\"\"\"\"\n\n if self.par[x] == x:\n return x\n else:\n\n self.par[x] = self.find(self.par[x])\n return self.par[x]\n\n def union(self, x, y):\n \"\"\"\"\"\"\n\n x = self.find(x)\n y = self.find(y)\n\n if x == y:\n self.tree[x] = False\n return\n if not self.tree[x] or not self.tree[y]:\n self.tree[x] = self.tree[y] = False\n\n if self.rank[x] < self.rank[y]:\n self.par[x] = y\n self.size[y] += self.size[x]\n else:\n self.par[y] = x\n self.size[x] += self.size[y]\n\n if self.rank[x] == self.rank[y]:\n self.rank[x] += 1\n\n def same(self, x, y):\n \"\"\"\"\"\"\n return self.find(x) == self.find(y)\n\n def get_size(self, x):\n \"\"\"\"\"\"\n return self.size[self.find(x)]\n\n def is_tree(self, x):\n \"\"\"\"\"\"\n return self.tree[self.find(x)]\n\n def len(self):\n \"\"\"\"\"\"\n res = set()\n for i in range(self.n + 1):\n res.add(self.find(i))\n\n return len(res) - 1\n\n\nN, M = MAP()\nP = [p - 1 for p in LIST()]\nuf = UnionFind(N)\nfor i in range(M):\n a, b = MAP()\n a -= 1\n b -= 1\n uf.union(P[a], P[b])\ncnt = 0\nfor i in range(N):\n p = P[i]\n if uf.same(p, i):\n cnt += 1\nprint(cnt)\n", "fast_code": "n, m = list(map(int, input().split()))\np = list(map(int, input().split()))\npar = [i for i in range(n)]\n\n\ndef find(x):\n if par[x] == x:\n return par[x]\n else:\n par[x] = find(par[x])\n return par[x]\n\n\ndef union(x, y):\n fx = find(x)\n fy = find(y)\n if fx != fy:\n par[fx] = fy\n\n\nf = lambda x: int(x) - 1\nfor mm in range(m):\n x, y = list(map(f, input().split()))\n union(x, y)\nans = 0\nfor i in range(n):\n if find(p[i] - 1) == find(i):\n ans += 1\nprint(ans)\n", "slow_time": 247598194, "fast_time": 68337969, "speedup": 3.6231, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_16"} +{"pair_id": "python_14960", "problem_id": "p03212", "language": "python", "slow_code": "import itertools\n\nN = int(eval(input()))\nans = 0\nS = []\nfor i in range(10):\n S += list(itertools.product(\"357\", repeat=i))\nfor s in S:\n if len(set(s)) > 2 and int(\"\".join(s)) <= N:\n ans += 1\nprint(ans)\n", "fast_code": "n = int(eval(input()))\nketa = len(str(n))\nif keta <= 2:\n print((0))\nelse:\n\n ans = 0\n for k in range(3, keta):\n ans += pow(3, k) - 3 - (3 * (pow(2, k) - 2))\n from itertools import product\n\n for l in product([\"3\", \"5\", \"7\"], repeat=keta):\n if not \"3\" in l or not \"5\" in l or not \"7\" in l:\n continue\n nn = int(\"\".join(l))\n if nn <= n:\n ans += 1\n print(ans)\n", "slow_time": 8827412284, "fast_time": 1696944730, "speedup": 5.2019, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_23"} +{"pair_id": "python_1377", "problem_id": "p03037", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef S():\n return eval(input())\n\n\ndef main():\n n, k = LI()\n l = [0] * (n + 1)\n for _ in range(k):\n a, b = LI()\n l[a - 1] += 1\n l[b] -= 1\n for i in range(n - 1):\n l[i + 1] += l[i]\n ans = 0\n for x in l[:-1]:\n if x == k:\n ans += 1\n return ans\n\n\nprint((main()))\n", "fast_code": "n, m = list(map(int, input().split()))\nll = 0\nrr = 10**5 + 1\nfor i in range(m):\n l, r = list(map(int, input().split()))\n if l > ll:\n ll = l\n if r < rr:\n rr = r\nelse:\n\n if rr - ll + 1 > n:\n print(n)\n elif rr - ll + 1 < 0:\n print((0))\n else:\n print((rr - ll + 1))\n", "slow_time": 2050306644, "fast_time": 25339175, "speedup": 80.9145, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_28"} +{"pair_id": "python_10641", "problem_id": "p04006", "language": "python", "slow_code": "from collections import deque\n\n\nclass SlideMin:\n \"\"\"\"\"\"\n\n def __init__(self, leng):\n self.que = deque([])\n self.leng = leng\n\n def top(self):\n return self.que[0]\n\n def getQue(self):\n return self.que\n\n def update(self, index, value):\n while self.que:\n if self.que[-1][1] >= value:\n self.que.pop()\n else:\n break\n self.que.append((index, value))\n if self.que[0][0] == index - self.leng:\n self.que.popleft()\n\n\nN, X = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\n\ndef sol(n):\n\n B = A + A\n que = SlideMin(n + 1)\n ret = [10**18] * N\n for i, a in enumerate(B):\n que.update(i, a)\n ret[i % N] = min(ret[i % N], que.top()[1])\n return sum(ret) + n * X\n\n\nans = sum(A)\nfor i in range(N):\n ans = min(ans, sol(i))\nprint(ans)\n", "fast_code": "n, x = list(map(int, input().split()))\nA = list(map(int, input().split()))[::-1] * 2\nB = A[:n]\nans = float(\"inf\")\nfor k in range(n):\n t = x * k + sum(B)\n ans = min(ans, t)\n for j in range(n):\n B[j] = min(B[j], A[j + k + 1])\nprint(ans)\n", "slow_time": 95219741, "fast_time": 34405462, "speedup": 2.7676, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_29"} +{"pair_id": "python_9245", "problem_id": "p02960", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(2**31 - 1)\ninput = sys.stdin.readline\nwrite = sys.stdout.write\nLMIIS = lambda: list(map(int, input().split()))\nII = lambda: int(input())\ndbg = lambda *something: print(*something) if DEBUG is True else 0\nDEBUG = True\nMOD = 10**9 + 7\n\n\nclass ModInt:\n def __init__(self, x):\n self.x = x.x if isinstance(x, ModInt) else x % MOD\n\n __str__ = lambda self: str(self.x)\n __repr__ = __str__\n __int__ = lambda self: self.x\n __index__ = __int__\n __add__ = lambda self, other: ModInt(self.x + ModInt(other).x)\n __sub__ = lambda self, other: ModInt(self.x - ModInt(other).x)\n __mul__ = lambda self, other: ModInt(self.x * ModInt(other).x)\n __pow__ = lambda self, other: ModInt(pow(self.x, ModInt(other).x, MOD))\n __mod__ = lambda self, other: ModInt(self.x % ModInt(other).x)\n __truediv__ = lambda self, other: ModInt(\n self.x * pow(ModInt(other).x, MOD - 2, MOD)\n )\n __floordiv__ = lambda self, other: ModInt(self.x // ModInt(other).x)\n __radd__ = lambda self, other: ModInt(other + self.x)\n __rsub__ = lambda self, other: ModInt(other - self.x)\n __rpow__ = lambda self, other: ModInt(pow(other, self.x, MOD))\n __rmod__ = lambda self, other: ModInt(other % self.x)\n __rmul__ = lambda self, other: ModInt(other * self.x)\n __rtruediv__ = lambda self, other: ModInt(other * pow(self.x, MOD - 2, MOD))\n __rfloordiv__ = lambda self, other: ModInt(other // self.x)\n __lt__ = lambda self, other: self.x < ModInt(other).x\n __gt__ = lambda self, other: self.x > ModInt(other).x\n __le__ = lambda self, other: self.x <= ModInt(other).x\n __ge__ = lambda self, other: self.x >= ModInt(other).x\n __eq__ = lambda self, other: self.x == ModInt(other).x\n __ne__ = lambda self, other: self.x != ModInt(other).x\n\n\ndef main():\n S = input()\n N = len(S) - 1\n dp = [[0] * 13 for _ in range(N)]\n dp[0] = [ModInt(0) for _ in range(13)]\n if S[0] == \"?\":\n for i in range(10):\n dp[0][i] = ModInt(1)\n else:\n dp[0][int(S[0])] = ModInt(1)\n for i in range(1, N):\n if S[i] == \"?\":\n for j in range(13):\n for k in range(10):\n dp[i][(j * 10 + k) % 13] += dp[i - 1][j]\n else:\n for j in range(13):\n dp[i][(j * 10 + int(S[i])) % 13] += dp[i - 1][j]\n print(dp[len(S) - 2][5])\n pass\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "def main():\n s = input()[::-1]\n mod = 13\n p = 10**9 + 7\n dp = [0] * mod\n dp[0] = 1\n for i, ss in enumerate(s):\n tmp = [0] * mod\n if ss == \"?\":\n for j in range(10):\n d = j * pow(10, i, mod)\n for k in range(mod):\n tmp[(k + d) % mod] += dp[k]\n tmp[(k + d) % mod] %= p\n else:\n d = int(ss) * pow(10, i, mod)\n for k in range(mod):\n tmp[(k + d) % mod] += dp[k]\n dp = tmp\n print((dp[5]))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 1268853843, "fast_time": 415631791, "speedup": 3.0528, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_5"} +{"pair_id": "python_7952", "problem_id": "p02708", "language": "python", "slow_code": "N, K = list(map(int, input().split()))\nMOD = 10**9 + 7\nLOW, HIGH = 0, N\nans = 0\nif 1 >= K:\n ans += HIGH - LOW + 1\nfor i in range(2, N + 2):\n LOW += i - 1\n HIGH += N - i + 1\n LOW %= MOD\n HIGH %= MOD\n if i >= K:\n ans += HIGH - LOW + 1\n ans %= MOD\nprint(ans)\n", "fast_code": "n, k = list(map(int, input().split()))\nans = 0\nfor i in range(k - 1, n + 1):\n ans += (i + 1) * (n - i) + 1\nprint((ans % (10**9 + 7)))\n", "slow_time": 6613404738, "fast_time": 1030575116, "speedup": 6.4172, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_11"} +{"pair_id": "python_11844", "problem_id": "p03150", "language": "python", "slow_code": "import re\nfrom sys import stdin\n\nN = stdin.readline().rstrip()\nfor i in range(7):\n mae = \"keyence\"[0 : i + 1]\n ato = \"keyence\"[i + 1 : 8]\n if re.search(\".*keyencekeyence\", N):\n if (re.sub(\".*keyencekeyence\", \"\", N) == \"\") == True:\n print(\"YES\")\n break\n if re.search(\"keyencekeyence.*\", N):\n if (re.sub(\"keyencekeyence.*\", \"\", N) == \"\") == True:\n print(\"YES\")\n break\n if (re.sub(\".*keyence\", \"\", N) == \"\") == True:\n print(\"YES\")\n break\n if (re.sub(\"keyence.*\", \"\", N) == \"\") == True:\n print(\"YES\")\n break\n if re.match(\"%s.*%s\" % (mae, ato), N):\n if (re.sub(\"%s.*%s\" % (mae, ato), \"\", N) == \"\") == True:\n print(\"YES\")\n break\nif i == 6:\n print(\"NO\")\n", "fast_code": "def main():\n S = input()\n N = len(S)\n ans = \"keyence\"\n for i in range(N):\n for j in range(N + 1):\n T = S[:i] + S[i + j :]\n if T == ans:\n return print(\"YES\")\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 137922673, "fast_time": 32582832, "speedup": 4.233, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_14"} +{"pair_id": "python_7573", "problem_id": "p03835", "language": "python", "slow_code": "K, S = list(map(int, input().split()))\na = 0\nfor y in range(K + 1):\n for z in range(K + 1):\n if 0 <= S - y - z <= K:\n a += 1\nprint(a)\n", "fast_code": "K, S = list(map(int, input().split()))\ns = 0\nfor x in range(min(S, K) + 1):\n for y in range(min(S - x, K) + 1):\n if S - x - y <= K:\n s += 1\nprint(s)\n", "slow_time": 351228075, "fast_time": 45731781, "speedup": 7.6802, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_13"} +{"pair_id": "python_10781", "problem_id": "p02935", "language": "python", "slow_code": "import math\nimport statistics\n\n\ndef fact(n):\n if n == 1:\n return 1\n else:\n return n * fact(n - 1)\n\n\ndef gcd(a, b):\n if a == 0:\n return b\n elif b == 0:\n return a\n else:\n return gcd(b, a % b)\n\n\ndef lcm(a, b):\n return a * b / gcd(a, b)\n\n\ndef qsort(seq):\n if len(seq) < 1:\n return seq\n pivot = seq[0]\n left = []\n right = []\n for x in range(1, len(seq)):\n if seq[x] <= pivot:\n left.append(seq[x])\n else:\n right.append(seq[x])\n left = qsort(left)\n right = qsort(right)\n foo = [pivot]\n return left + foo + right\n\n\nn = int(eval(input()))\n\nv = list(int(i) for i in input().split())\nlastguzai = 0.00\nfor i in range(n):\n vs = sorted(v)\n if len(v) == 2:\n lastguzai = (v[0] + v[1]) / 2.00\n break\n\n v = vs\n lastguzai = (v[0] + v[1]) / 2.00\n del v[0]\n del v[0]\n v.append(lastguzai)\n\nprint((\"{:.6f}\".format(lastguzai)))\n", "fast_code": "n = int(eval(input()))\nv = list(map(int, input().split()))\nv.sort()\na = v[0]\nfor i in range(1, n):\n a = (a + v[i]) / 2\nprint(a)\n", "slow_time": 92880138, "fast_time": 21829111, "speedup": 4.2549, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_6"} +{"pair_id": "python_14699", "problem_id": "p02713", "language": "python", "slow_code": "import math\nfrom functools import reduce\n\nk = int(eval(input()))\n\n\ndef gcd(*numbers):\n return reduce(math.gcd, numbers)\n\n\nans = 0\nfor i in range(1, k + 1):\n for j in range(1, k + 1):\n for l in range(1, k + 1):\n ans += gcd(i, j, l)\nprint(ans)\n", "fast_code": "from math import gcd\n\nk = int(eval(input()))\ndouble = [gcd(i, j) for i in range(1, k + 1) for j in range(1, k + 1)]\ntriple = [gcd(i, j) for i in range(1, k + 1) for j in double]\nprint((sum(triple)))\n", "slow_time": 44139168611, "fast_time": 5961110849, "speedup": 7.4045, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_14"} +{"pair_id": "python_6674", "problem_id": "p00100", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys\n\n\ndef solve(data):\n result = []\n total_sales = [0 for _ in range(4000 + 1)]\n for id, unit_price, quantity in data:\n total_sales[id] += unit_price * quantity\n if total_sales[id] >= 1000000:\n if id not in result:\n result.append(id)\n\n return result\n\n\ndef main(args):\n\n while True:\n num = int(eval(input()))\n if num == 0:\n break\n data = []\n for _ in range(num):\n data.append([int(x) for x in input().split(\" \")])\n result = solve(data)\n if result:\n for ele in result:\n print(ele)\n else:\n print(\"NA\")\n\n\nif __name__ == \"__main__\":\n main(sys.argv[1:])\n", "fast_code": "l = int(eval(input()))\nwhile l != 0:\n k = 0\n A = []\n B = []\n for l in range(0, l):\n li = input().split()\n if li[0] in A:\n i = A.index(li[0])\n B[i] = B[i] + (int(li[1]) * int(li[2]))\n else:\n A.append(li[0])\n B.append(int(li[1]) * int(li[2]))\n for j, b in enumerate(B):\n if b >= 10**6:\n print((A[j]))\n k = 1\n if k == 0:\n print(\"NA\")\n l = int(eval(input()))\n", "slow_time": 212744608, "fast_time": 59002991, "speedup": 3.6057, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_6"} +{"pair_id": "python_8603", "problem_id": "p02848", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nfrom inspect import currentframe\n\nINF = 10**10\nMOD = 10**9 + 7\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef gcd(x, y):\n return y if x % y == 0 else gcd(y, x % y)\n\n\ndef lcm(x, y):\n return (x * y) // gcd(x, y)\n\n\ndef I():\n return int(input())\n\n\ndef MI():\n return map(int, input().split())\n\n\ndef LI():\n return [int(x) for x in input().split()]\n\n\ndef RI(N):\n return [int(input()) for _ in range(N)]\n\n\ndef LRI(N):\n return [[int(x) for x in input().split()] for _ in range(N)]\n\n\ndef chkprint(*args):\n names = {id(v): k for k, v in currentframe().f_back.f_locals.items()}\n print(\", \".join(names.get(id(arg), \"???\") + \" = \" + repr(arg) for arg in args))\n\n\nN = I()\nS = input()\nalp = [\n \"A\",\n \"B\",\n \"C\",\n \"D\",\n \"E\",\n \"F\",\n \"G\",\n \"H\",\n \"I\",\n \"J\",\n \"K\",\n \"L\",\n \"M\",\n \"N\",\n \"O\",\n \"P\",\n \"Q\",\n \"R\",\n \"S\",\n \"T\",\n \"U\",\n \"V\",\n \"W\",\n \"X\",\n \"Y\",\n \"Z\",\n]\nfor s in S:\n print(alp[(alp.index(s) + N) % 26], end=\"\")\n", "fast_code": "N = int(input())\nS = input()\nfor s in S:\n ans = chr((ord(s) - ord(\"A\") + N) % 26 + ord(\"A\"))\n print(ans, end=\"\")\n", "slow_time": 118302228, "fast_time": 21722592, "speedup": 5.446, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_7"} +{"pair_id": "python_17731", "problem_id": "p03456", "language": "python", "slow_code": "a, b = list(map(str, input().split()))\nx = int(a + b)\nans = \"No\"\nfor i in range(x // 2):\n if x == i * i:\n ans = \"Yes\"\nprint(ans)\n", "fast_code": "a, b = list(map(int, input().split()))\nif str(int(str(a) + str(b)) ** 0.5).split(\".\")[1:][0] == \"0\":\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 729346459, "fast_time": 18554788, "speedup": 39.3077, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_22"} +{"pair_id": "python_6429", "problem_id": "p03332", "language": "python", "slow_code": "MOD = 998244353\nMAX = int(3e5 + 1)\n\n\ndef div(a, b):\n return a * pow(b, MOD - 2, MOD) % MOD\n\n\nFACT = [1] * (MAX + 1)\nfor i in range(1, MAX + 1):\n FACT[i] = (i * FACT[i - 1]) % MOD\nINV = [1] * (MAX + 1)\nINV[MAX] = div(1, FACT[MAX])\nfor i in range(MAX, 0, -1):\n INV[i - 1] = (INV[i] * i) % MOD\n\n\ndef main():\n N, A, B, K = list(map(int, input().split()))\n ans = 0\n\n for x in range(N + 1):\n By = K - x * A\n if By >= 0 and By % B == 0 and By <= B * N:\n y = By // B\n tmp1 = FACT[N] * INV[x] * INV[N - x] % MOD\n tmp2 = FACT[N] * INV[y] * INV[N - y] % MOD\n ans = (ans + tmp1 * tmp2) % MOD\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\nimport numpy as np\n\nsr = lambda: sys.stdin.readline().rstrip()\nir = lambda: int(sr())\nlr = lambda: list(map(int, sr().split()))\nMOD = 998244353\nN, A, B, K = lr()\nanswer = 0\n\n\ndef cmb(n, k):\n if k < 0 or k > n:\n return 0\n return fact_N * fact_inv[k] % MOD * fact_inv[n - k] % MOD\n\n\ndef cumprod(arr, MOD):\n L = len(arr)\n Lsq = int(L**0.5 + 1)\n arr = np.resize(arr, Lsq**2).reshape(Lsq, Lsq)\n for n in range(1, Lsq):\n arr[:, n] *= arr[:, n - 1]\n arr[:, n] %= MOD\n for n in range(1, Lsq):\n arr[n] *= arr[n - 1, -1]\n arr[n] %= MOD\n return arr.ravel()[:L]\n\n\ndef make_fact(U, MOD):\n x = np.arange(U, dtype=np.int64)\n x[0] = 1\n fact = cumprod(x, MOD)\n x = np.arange(U, 0, -1, dtype=np.int64)\n x[0] = pow(int(fact[-1]), MOD - 2, MOD)\n fact_inv = cumprod(x, MOD)[::-1]\n return fact, fact_inv\n\n\nU = N + 1\nfact, fact_inv = make_fact(U, MOD)\nfact_N = fact[N]\ncomb = fact_N * fact_inv % MOD * fact_inv[::-1] % MOD\nfor x in range(N + 1):\n temp = K - A * x\n if temp % B != 0:\n continue\n y = temp // B\n if y > N:\n continue\n if y < 0:\n break\n answer += comb[x] * comb[y]\n answer %= MOD\nprint((answer % MOD))\n", "slow_time": 37432130329, "fast_time": 2879442490, "speedup": 12.9998, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_17"} +{"pair_id": "python_11145", "problem_id": "p03816", "language": "python", "slow_code": "import sys\nfrom collections import Counter\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\nN = INT()\nA = LIST()\nC = Counter(A)\nfor k in list(C.keys()):\n C[k] -= 1\ncnt = ceil(sum(C.values()), 2)\nans = N - cnt * 2\nprint(ans)\n", "fast_code": "N = int(eval(input()))\na = list(map(int, input().split(\" \")))\nuni = len(list(set(a)))\nif uni % 2 == 0:\n uni -= 1\nprint(uni)\n", "slow_time": 126232290, "fast_time": 20817730, "speedup": 6.0637, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_2"} +{"pair_id": "python_14579", "problem_id": "p03603", "language": "python", "slow_code": "N = int(input())\nP = list(map(int, input().split()))\nX = [0] + list(map(int, input().split()))\nko = [[] for _ in range(N + 1)]\nfor i, p in enumerate(P, 2):\n ko[p].append(i)\n\n\ndef f(p):\n n = len(ko[p])\n if n == 0:\n return X[p], 0\n dp = [[float(\"inf\")] * 5001 for _ in range(n + 1)]\n dp[0][0] = 0\n for i, c in enumerate(ko[p], 1):\n a, b = f(c)\n for j in range(a, 5001):\n dp[i][j] = min(dp[i][j], dp[i - 1][j - a] + b)\n for j in range(b, 5001):\n dp[i][j] = min(dp[i][j], dp[i - 1][j - b] + a)\n out = min(dp[-1][: X[p] + 1])\n if out == float(\"inf\"):\n print(\"IMPOSSIBLE\")\n exit()\n elif out > X[p]:\n return out, X[p]\n else:\n return X[p], out\n\n\nprint(\"POSSIBLE\") if min(f(1)) <= X[1] else print(\"IMPOSSIBLE\")\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**7)\nimport numpy as np\n\nINF = 2**30\nn = int(eval(input()))\nP = tuple(map(int, input().split()))\nT = [[] for _ in range(n)]\nfor i, p in enumerate(P, 1):\n T[p - 1].append(i)\nX = tuple(map(int, input().split()))\nD = [-1] * n\n\n\ndef dfs(v):\n if D[v] != -1:\n return D[v]\n l = len(T[v])\n x = X[v]\n dp = np.full(x + 1, INF, dtype=np.int64)\n dp[0] = 0\n for i, nv in enumerate(T[v]):\n k = np.full(x + 1, INF, dtype=np.int64)\n d = dfs(nv)\n if x + 1 >= X[nv]:\n np.minimum(k[X[nv] :], dp[: x + 1 - X[nv]] + d, out=k[X[nv] :])\n if x + 1 >= d:\n np.minimum(k[d:], dp[: x + 1 - d] + X[nv], out=k[d:])\n dp = k.copy()\n res = dp.min()\n D[v] = res\n return res\n\n\nans = dfs(0)\nif ans == INF:\n print(\"IMPOSSIBLE\")\nelse:\n print(\"POSSIBLE\")\n", "slow_time": 908704243, "fast_time": 99352776, "speedup": 9.1462, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_5"} +{"pair_id": "python_14640", "problem_id": "p02468", "language": "python", "slow_code": "def power(a, n, M):\n res = 1\n if n > 0:\n res = power(a * a % M, n / 2, M)\n if n % 2 == 1:\n res = res * a % M\n return res\n\n\nm, n = list(map(int, input().split()))\nprint(power(m, n, 1000000007))\n", "fast_code": "import sys\n\nmod = 10**9 + 7\n\n\ndef solve():\n m, n = list(map(int, input().split()))\n print((pow(m, n, mod)))\n\n\nif __name__ == \"__main__\":\n solve()\n", "slow_time": 141975333, "fast_time": 19493102, "speedup": 7.2834, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_1"} +{"pair_id": "python_8533", "problem_id": "p02573", "language": "python", "slow_code": "class UnionFind:\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return \"\\n\".join(\"{}: {}\".format(r, self.members(r)) for r in self.roots())\n\n\nn, m = list(map(int, input().split()))\nuf = UnionFind(n + 1)\nfor i in range(m):\n a, b = list(map(int, input().split()))\n uf.union(a, b)\nans = 0\nfor i in range(1, n + 1):\n ans = max(ans, uf.size(i))\nprint(ans)\n", "fast_code": "from collections import deque\n\nn, m = list(map(int, input().split()))\nV = [[] for i in range(n + 1)]\nfor i in range(m):\n a, b = list(map(int, input().split()))\n V[a].append(b)\n V[b].append(a)\nreach = [0] * (n + 1)\nans = 0\nfor i in range(1, n + 1):\n if reach[i] != 0:\n pass\n else:\n q = deque([])\n q.append(i)\n reach[i] = 1\n j = 1\n while q:\n x = q.popleft()\n for y in V[x]:\n if reach[y] == 0:\n reach[y] = 1\n q.append(y)\n j += 1\n ans = max(ans, j)\nprint(ans)\n", "slow_time": 135268108, "fast_time": 59496430, "speedup": 2.2735, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_15"} +{"pair_id": "python_5442", "problem_id": "p03288", "language": "python", "slow_code": "import bisect, collections, copy, heapq, itertools, math, string\nimport sys\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef M():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\nR = I()\nif R < 1200:\n print(\"ABC\")\nelif R < 2800:\n print(\"ARC\")\nelse:\n print(\"AGC\")\n", "fast_code": "N = int(eval(input()))\nprint((\"ABC\" if N < 1200 else (\"ARC\" if N < 2800 else \"AGC\")))\n", "slow_time": 47184560, "fast_time": 13202927, "speedup": 3.5738, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_19"} +{"pair_id": "python_14620", "problem_id": "p00076", "language": "python", "slow_code": "A = [[]] * 1001\nx = 1.0\ny = 0.0\nfor i in range(1, 1001):\n A[i] = [x, y]\n tmp = i**0.5\n x, y = x - y / tmp, y + x / tmp\nwhile 1:\n n = eval(input())\n if n == -1:\n break\n print(A[n][0])\n print(A[n][1])\n", "fast_code": "import sys\n\nfor e in sys.stdin:\n n = int(e)\n if n < 0:\n break\n z = 1\n for _ in range(n - 1):\n d = z * 1j\n d /= abs(d)\n z += d\n print(f\"{z.real}\\n{z.imag}\")\n", "slow_time": 222070440, "fast_time": 27781080, "speedup": 7.9936, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_2"} +{"pair_id": "python_6597", "problem_id": "p00741", "language": "python", "slow_code": "import sys\nfrom pprint import pprint\n\n\nclass UnionFind:\n def __init__(self):\n self._parent = {}\n self._rank = {}\n self._equiv = {}\n\n def _find(self, x):\n if self._parent[x] == x:\n return self._parent[x]\n else:\n p = self._find(self._parent[x])\n self._parent[x] = p\n return p\n\n def _set_parent(self, child, parent):\n self._parent[child] = parent\n self._equiv[parent].update(self._equiv.pop(child))\n\n def _union(self, x, y):\n x = self._find(x)\n y = self._find(y)\n if x == y:\n return\n if self._rank[x] > self._rank[y]:\n self._set_parent(y, x)\n elif self._rank[x] < self._rank[y]:\n self._set_parent(x, y)\n else:\n self._set_parent(x, y)\n self._rank[x] += 1\n\n def _make_set(self, x):\n self._parent[x] = x\n self._rank[x] = 0\n self._equiv[x] = {x}\n\n def unite(self, *elements):\n if not elements:\n return\n for x in elements:\n if x in self._parent:\n continue\n self._make_set(x)\n x0 = elements[0]\n for x in elements[1:]:\n self._union(x0, x)\n\n def groups(self):\n return [set(e) for e in list(self._equiv.values())]\n\n\ndef solve(ncol, nrow, rows):\n pairs = []\n\n for x in range(ncol - 1):\n for y in range(nrow):\n pairs.append([(x, y), (x + 1, y)])\n\n for x in range(ncol):\n for y in range(nrow - 1):\n pairs.append([(x, y), (x, y + 1)])\n\n for x in range(ncol - 1):\n for y in range(nrow - 1):\n pairs.append([(x, y), (x + 1, y + 1)])\n\n for x in range(ncol - 1):\n for y in range(1, nrow):\n pairs.append([(x, y), (x + 1, y - 1)])\n f = UnionFind()\n for x in range(ncol):\n for y in range(nrow):\n if rows[y][x]:\n f.unite((x, y))\n for (x1, y1), (x2, y2) in pairs:\n if rows[y1][x1] and rows[y2][x2]:\n f.unite((x1, y1), (x2, y2))\n return len(f.groups())\n\n\ndef main():\n while True:\n ncol, nrow = list(map(int, input().split()))\n if ncol == 0 and nrow == 0:\n break\n rows = []\n for _ in range(nrow):\n row = list(map(int, input().split()))\n rows.append(row)\n\n print((solve(ncol, nrow, rows)))\n\n\nmain()\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**5)\n\n\ndef erase(x, y):\n c[y][x] = \"0\"\n for dx, dy in (\n (1, 0),\n (1, 1),\n (0, 1),\n (-1, 1),\n (-1, 0),\n (-1, -1),\n (0, -1),\n (1, -1),\n ):\n nx, ny = x + dx, y + dy\n if 0 <= nx < w and 0 <= ny < h and c[ny][nx] == \"1\":\n erase(nx, ny)\n\n\nwhile True:\n w, h = list(map(int, input().split()))\n if w == h == 0:\n break\n c = [[i for i in input().split()] for _ in range(h)]\n ans = 0\n for y in range(h):\n for x in range(w):\n if c[y][x] == \"1\":\n ans += 1\n erase(x, y)\n print(ans)\n", "slow_time": 271364665, "fast_time": 101169892, "speedup": 2.6823, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_9"} +{"pair_id": "python_589", "problem_id": "p02793", "language": "python", "slow_code": "N = int(eval(input()))\n(*A,) = list(map(int, input().split()))\nM = 10**3\nP = []\nisp = [True] * M\nfor n in range(2, M):\n if isp[n] == False:\n continue\n P.append(n)\n for m in range(n * n, M, n):\n isp[m] = False\nfrom collections import defaultdict\n\nD = [defaultdict(int) for _ in range(N)]\nfor i in range(N):\n a = A[i]\n for p in P:\n while a > 1:\n if a % p == 0:\n D[i][p] += 1\n a //= p\n else:\n break\n else:\n break\n if a > 1:\n D[i][a] += 1\nd = defaultdict(int)\nfor i in range(N):\n for k, v in list(D[i].items()):\n d[k] = max(d[k], v)\nMOD = 10**9 + 7\n\n\nclass Mint:\n def __init__(self, value=0):\n self.value = value % MOD\n if self.value < 0:\n self.value += MOD\n\n @staticmethod\n def get_value(x):\n return x.value if isinstance(x, Mint) else x\n\n def inverse(self):\n a, b = self.value, MOD\n u, v = 1, 0\n while b:\n t = a // b\n b, a = a - t * b, b\n v, u = u - t * v, v\n if u < 0:\n u += MOD\n return u\n\n def __repr__(self):\n return str(self.value)\n\n def __eq__(self, other):\n return self.value == other.value\n\n def __neg__(self):\n return Mint(-self.value)\n\n def __hash__(self):\n return hash(self.value)\n\n def __bool__(self):\n return self.value != 0\n\n def __iadd__(self, other):\n self.value += Mint.get_value(other)\n if self.value >= MOD:\n self.value -= MOD\n return self\n\n def __add__(self, other):\n new_obj = Mint(self.value)\n new_obj += other\n return new_obj\n\n __radd__ = __add__\n\n def __isub__(self, other):\n self.value -= Mint.get_value(other)\n if self.value < 0:\n self.value += MOD\n return self\n\n def __sub__(self, other):\n new_obj = Mint(self.value)\n new_obj -= other\n return new_obj\n\n def __rsub__(self, other):\n new_obj = Mint(Mint.get_value(other))\n new_obj -= self\n return new_obj\n\n def __imul__(self, other):\n self.value = self.value * Mint.get_value(other) % MOD\n return self\n\n def __mul__(self, other):\n new_obj = Mint(self.value)\n new_obj *= other\n return new_obj\n\n __rmul__ = __mul__\n\n def __ifloordiv__(self, other):\n other = other if isinstance(other, Mint) else Mint(other)\n self *= other.inverse()\n return self\n\n def __floordiv__(self, other):\n new_obj = Mint(self.value)\n new_obj //= other\n return new_obj\n\n def __rfloordiv__(self, other):\n new_obj = Mint(Mint.get_value(other))\n new_obj //= self\n return new_obj\n\n\ngcd = Mint(1)\nfor k, v in list(d.items()):\n gcd *= pow(k, v, MOD)\nprint((sum([gcd // a for a in A])))\n", "fast_code": "from functools import reduce\n\nMOD = 10**9 + 7\n\n\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n\ndef lcm(x, y):\n return (x * y) // gcd(x, y)\n\n\ndef gcd_list(numbers):\n return reduce(gcd, numbers)\n\n\ndef lcm_list(numbers):\n return reduce(lcm, numbers)\n\n\nn = int(eval(input()))\na = list(map(int, input().split()))\nlcm_ = lcm_list(a)\nb = list([lcm_ // x for x in a])\nans = 0\nfor i in range(len(b)):\n ans += b[i]\nprint((ans % MOD))\n", "slow_time": 211446927, "fast_time": 32080020, "speedup": 6.5912, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_21"} +{"pair_id": "python_451", "problem_id": "p02572", "language": "python", "slow_code": "import sys\n\nMOD = 1000000007\n\n\ndef solve(N: int, A: \"List[int]\"):\n ans = 0\n B = [sum(A[1:])]\n for i, a in enumerate(A[1:-1]):\n B.append(B[i] - a)\n for i, ai in enumerate(A[:-1]):\n ans += ai * B[i]\n print((ans % MOD))\n return\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n\n tokens = iterate_tokens()\n N = int(next(tokens))\n A = [int(next(tokens)) for _ in range(N)]\n solve(N, A)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "_ = eval(input())\nMOD = 10**9 + 7\nans = b = 0\nfor a in map(int, input().split()):\n ans += a * b\n ans %= MOD\n b += a\nprint(ans)\n", "slow_time": 57090536, "fast_time": 18885970, "speedup": 3.0229, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_23"} +{"pair_id": "python_8195", "problem_id": "p03352", "language": "python", "slow_code": "X = int(eval(input()))\nans = 1\nfor i in range(1, X + 1):\n for j in range(2, X + 1):\n if i**j <= X:\n ans = max(ans, i**j)\n else:\n break\nprint(ans)\n", "fast_code": "def ans(n):\n pow_2 = int(n ** (0.5))\n pow_exeption = [32, 128, 243]\n\n ans = pow_2**2\n for i in pow_exeption:\n if i <= n:\n ans = max(i, ans)\n for i in range(1, 11):\n if i**3 <= n:\n ans = max((i**3), ans)\n return ans\n\n\nn = int(eval(input()))\nfor i in range(n, n + 1):\n print((ans(i)))\n", "slow_time": 149546981, "fast_time": 36416333, "speedup": 4.1066, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_9"} +{"pair_id": "python_15345", "problem_id": "p02780", "language": "python", "slow_code": "n, k = list(map(int, input().split()))\narr = list(map(int, input().split()))\ntable = {}\nans = 0\nfor i in range(1, 1000 + 1):\n table[i] = (i + 1) * 0.5\nif n == 1:\n print((table[arr[0]]))\n exit()\nlis = [0 for _ in range(n)]\nlis[0] = table[arr[0]]\nfor i in range(n - 1):\n if i + 1 < k:\n lis[i + 1] = lis[i] + table[arr[i + 1]]\n else:\n lis[i + 1] = lis[i] + table[arr[i + 1]] - table[arr[i - k + 1]]\n ans = max(ans, lis[i + 1])\nprint(ans)\n", "fast_code": "from itertools import accumulate\nimport numpy as np\n\nn, k = list(map(int, input().split()))\np = np.array(list(map(int, input().split())), dtype=np.int64)\np = (1 + p) / 2\np = [0] + list(accumulate(p))\nans = 0\nfor i in range(n - k + 1):\n ans = max(ans, p[i + k] - p[i])\nprint(ans)\n", "slow_time": 91479968, "fast_time": 22969693, "speedup": 3.9826, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_12"} +{"pair_id": "python_8718", "problem_id": "p03371", "language": "python", "slow_code": "a, b, c, x, y = list(map(int, input().split()))\nab = min(a + b, c * 2)\nif x > y:\n tmp, tmp2, tmp3 = y, (x - y) * a, (x - y) * ab\nelse:\n tmp, tmp2, tmp3 = x, (y - x) * b, (y - x) * ab\nans = 0\nfor i in range(tmp):\n ans += ab\nprint((ans + min(tmp2, tmp3)))\n", "fast_code": "\"\"\"\"\"\"\n\n\"\"\"\"\"\"\nA, B, C, X, Y = list(map(int, input().split()))\nif A + B > 2 * C:\n ans1 = max(X, Y) * C * 2\n if X > Y:\n ans2 = Y * C * 2 + abs(X - Y) * A\n else:\n ans2 = X * C * 2 + abs(X - Y) * B\n print((min(ans1, ans2)))\nelse:\n ans1 = X * A + Y * B\n print(ans1)\n", "slow_time": 227526301, "fast_time": 32104618, "speedup": 7.087, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_2"} +{"pair_id": "python_505", "problem_id": "p03221", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\nP = []\nY = []\narr = [[] for j in range(10**5 + 1)]\nfor i in range(M):\n listA = list(map(int, input().split()))\n P.append(listA[0])\n Y.append(listA[1])\n arr[listA[0]].append(listA[1])\nfor i in range(N + 1):\n arr[i].sort()\nfor i in range(M):\n\n left = 0\n right = len(arr[P[i]]) - 1\n while left <= right:\n mid = (left + right) // 2\n if arr[P[i]][mid] == Y[i]:\n k = mid\n break\n elif arr[P[i]][mid] > Y[i]:\n right = mid - 1\n else:\n left = mid + 1\n print((str(P[i]).rjust(6, \"0\") + str(k + 1).rjust(6, \"0\")))\n", "fast_code": "from collections import defaultdict as dd\n\nd = dd(int)\nn, m = list(map(int, input().split()))\nl = [[i] + list(map(int, input().split())) + [0] for i in range(m)]\no = sorted(l, key=lambda x: x[2])\nfor i, j in enumerate(o):\n d[j[1]] += 1\n o[i][3] = d[j[1]]\nfor i in sorted(o):\n print((\"%06d%06d\" % (i[1], i[3])))\n", "slow_time": 2260230442, "fast_time": 31963502, "speedup": 70.7129, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_10"} +{"pair_id": "python_10597", "problem_id": "p02982", "language": "python", "slow_code": "n, d = list(map(int, input().split()))\nX = [list(map(int, input().split())) for _ in range(n)]\n\n\ndef dist_squere(x, y):\n d = 0\n for i, j in zip(x, y):\n d += (i - j) ** 2\n return d\n\n\nsquares = set([i * i for i in range(10000)])\n\n\ndef is_square(x):\n return x in squares\n\n\nfrom itertools import combinations\n\nans = 0\nfor x, y in combinations(X, 2):\n if is_square(dist_squere(x, y)):\n ans += 1\nprint(ans)\n", "fast_code": "n, d = list(map(int, input().split()))\nx = [list(map(int, input().split())) for _ in range(n)]\n\n\ndef dist(a, b):\n sm = 0\n for ea, eb in zip(a, b):\n sm += (ea - eb) ** 2\n return sm**0.5\n\n\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n dst = dist(x[i], x[j])\n for k in range(int(16000**0.5) + 1):\n if k == dst:\n ans += 1\n break\nprint(ans)\n", "slow_time": 242815463, "fast_time": 36405830, "speedup": 6.6697, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_6"} +{"pair_id": "python_17065", "problem_id": "p03475", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**6)\ninput = sys.stdin.readline\nfrom math import floor, ceil, sqrt, factorial, log\nfrom heapq import heappop, heappush, heappushpop\nfrom collections import Counter, defaultdict, deque\nfrom itertools import (\n accumulate,\n permutations,\n combinations,\n product,\n combinations_with_replacement,\n)\nfrom bisect import bisect_left, bisect_right\nfrom copy import deepcopy\n\ninf = float(\"inf\")\nmod = 10**9 + 7\n\n\ndef pprint(*A):\n for a in A:\n print(*a, sep=\"\\n\")\n\n\ndef INT_(n):\n return int(n) - 1\n\n\ndef MI():\n return map(int, input().split())\n\n\ndef MF():\n return map(float, input().split())\n\n\ndef MI_():\n return map(INT_, input().split())\n\n\ndef LI():\n return list(MI())\n\n\ndef LI_():\n return [int(x) - 1 for x in input().split()]\n\n\ndef LF():\n return list(MF())\n\n\ndef LIN(n: int):\n return [I() for _ in range(n)]\n\n\ndef LLIN(n: int):\n return [LI() for _ in range(n)]\n\n\ndef LLIN_(n: int):\n return [LI_() for _ in range(n)]\n\n\ndef LLI():\n return [list(map(int, l.split())) for l in input()]\n\n\ndef I():\n return int(input())\n\n\ndef F():\n return float(input())\n\n\ndef ST():\n return input().replace(\"\\n\", \"\")\n\n\ndef main():\n N = I()\n CSF = LLIN(N - 1)\n\n def solve(CSF):\n now = 0\n for i, (c, s, f) in enumerate(CSF):\n if now <= s:\n now = s + c\n continue\n else:\n if now % f != 0:\n now += f - now % f\n now += c\n print(now)\n\n for i in range(N):\n solve(CSF[i:])\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N = int(eval(input()))\ntrain = [list(map(int, input().split())) for _ in range(N - 1)]\nfor i in range(N - 1):\n t = train[i][0] + train[i][1]\n for j in range(i + 1, N - 1):\n if train[j][1] >= t:\n t = train[j][1] + train[j][0]\n elif t % train[j][2] == 0:\n t += train[j][0]\n else:\n\n t = t + train[j][2] - t % train[j][2]\n t += train[j][0]\n print(t)\nprint((0))\n", "slow_time": 159141389, "fast_time": 50227288, "speedup": 3.1684, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_22"} +{"pair_id": "python_13591", "problem_id": "p03260", "language": "python", "slow_code": "from collections import defaultdict, deque\nimport sys, heapq, bisect, math, itertools, string, queue, datetime\n\nsys.setrecursionlimit(10**8)\nINF = float(\"inf\")\nmod = 10**9 + 7\neps = 10**-7\n\n\ndef inpl():\n return list(map(int, input().split()))\n\n\ndef inpls():\n return list(input().split())\n\n\nA, B = inpl()\nif (A * B) % 2 == 0:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "fast_code": "A, B = list(map(int, input().split()))\nif A % 2 == B % 2 == 1:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 21432741, "fast_time": 8340150, "speedup": 2.5698, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_6"} +{"pair_id": "python_13820", "problem_id": "p02401", "language": "python", "slow_code": "import sys\nimport operator\nfrom math import floor\n\n\ndef string_to_list_spliter():\n lst = [i for i in sys.stdin.readline().split()]\n return lst\n\n\ndef main():\n ops = {\n \"+\": operator.add,\n \"-\": operator.sub,\n \"*\": operator.mul,\n \"/\": operator.truediv,\n }\n\n while True:\n lst = string_to_list_spliter()\n if lst[1] == \"?\":\n break\n elif lst[1] == \"+\":\n print((ops[lst[1]](int(lst[0]), int(lst[2]))))\n elif lst[1] == \"-\":\n print((ops[lst[1]](int(lst[0]), int(lst[2]))))\n elif lst[1] == \"*\":\n print((ops[lst[1]](int(lst[0]), int(lst[2]))))\n elif lst[1] == \"/\":\n print((floor(ops[lst[1]](int(lst[0]), int(lst[2])))))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "while True:\n line = input().split()\n a = int(line[0])\n b = int(line[2])\n op = line[1]\n if op == \"+\":\n print((a + b))\n elif op == \"-\":\n print((a - b))\n elif op == \"*\":\n print((a * b))\n elif op == \"/\":\n print((a // b))\n else:\n break\n", "slow_time": 73681624, "fast_time": 30272383, "speedup": 2.434, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_2"} +{"pair_id": "python_1901", "problem_id": "p02821", "language": "python", "slow_code": "import sys\nimport math\nfrom collections import defaultdict\n\nsys.setrecursionlimit(10**7)\n\n\ndef input():\n return sys.stdin.readline()[:-1]\n\n\nmod = 10**9 + 7\n\n\ndef I():\n return int(eval(input()))\n\n\ndef II():\n return list(map(int, input().split()))\n\n\ndef III():\n return list(map(int, input().split()))\n\n\ndef Line(N, num):\n if N <= 0:\n return [[] for _ in range(num)]\n elif num == 1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return list(map(list, list(zip(*read_all))))\n\n\nimport numpy as np\n\n\ndef FFT(a, b):\n bit = (len(a) + len(b)).bit_length() + 1\n L = 2**bit\n fa, fb = np.fft.rfft(a, L), np.fft.rfft(b, L)\n c = np.rint(np.fft.irfft(fa * fb, L)).astype(np.int64)\n return c[: len(a) + len(b) - 1]\n\n\nN, M = II()\nA = III()\nh = [0] * (max(A))\nfor a in A:\n h[a - 1] += 1\nconv = np.append([0, 0], FFT(h, h))\nans = 0\ncount = 0\nfor k in range(2, 2 * max(A) + 1)[::-1]:\n if conv[k]:\n num = min(M - count, conv[k])\n count += num\n ans += k * num\n if count == M:\n break\nprint(ans)\n", "fast_code": "n, m = list(map(int, input().split()))\na = list(map(int, input().split()))\na.sort()\nif n == 1:\n print((a[0] * 2))\n exit()\nfrom bisect import bisect_left, bisect_right\n\n\ndef f(x):\n global n, a\n ret = 0\n for i in range(n):\n ret += n - bisect_left(a, x - a[i])\n return ret\n\n\nl, r = -1, 10**6\nwhile l + 1 < r:\n k = l + (r - l) // 2\n if f(k) >= m:\n l = k\n else:\n r = k\n\n\nif f(r) >= m:\n co, ans = 0, 0\n for i in range(n):\n co += n - bisect_right(a, r - a[i])\n ans += (n - bisect_right(a, r - a[i])) * a[i]\n print((2 * ans + (m - co) * r))\nelse:\n co, ans = 0, 0\n for i in range(n):\n co += n - bisect_right(a, l - a[i])\n ans += (n - bisect_right(a, l - a[i])) * a[i]\n print((2 * ans + (m - co) * l))\n", "slow_time": 694693232, "fast_time": 66933541, "speedup": 10.3789, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_20"} +{"pair_id": "python_7713", "problem_id": "p02838", "language": "python", "slow_code": "mod = 1000000007\nans = 0\nn = int(eval(input()))\na = [int(i) for i in input().split()]\nx = [[0] * 63 for i in range(n + 1)]\nl = [(2**i) % mod for i in range(63)]\nfor i in range(n):\n d = a[i]\n cnt = 0\n for j in range(63):\n if d & 1:\n x[i + 1][cnt] = x[i][cnt] + 1\n else:\n x[i + 1][cnt] = x[i][cnt]\n cnt += 1\n d = d >> 1\nfor i in range(1, n):\n for j in range(63):\n p = x[i][j] - x[i - 1][j]\n if p:\n ans += l[j] * ((n - i) - (x[-1][j] - x[i][j]))\n else:\n ans += l[j] * (x[-1][j] - x[i][j])\n ans %= mod\nprint(ans)\n", "fast_code": "\"\"\"\"\"\"\n\nn = int(eval(input()))\naaa = list(map(int, input().split()))\nMOD = 10**9 + 7\nans = 0\nm = 1\nfor i in range(60):\n bit = sum(a & m for a in aaa)\n\n bit >>= i\n non_bit = n - bit\n ans = (ans + bit * non_bit * m) % MOD\n\n m <<= 1\nprint(ans)\n\"\"\"\"\"\"\n", "slow_time": 280836259, "fast_time": 77002155, "speedup": 3.6471, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_0"} +{"pair_id": "python_8943", "problem_id": "p02641", "language": "python", "slow_code": "x, n = list(map(int, input().split()))\nif n == 0:\n print(x)\n exit()\narr = list(map(int, input().split()))\narr2 = []\narr3 = []\nfor i in range(-50, 110):\n if not i in arr:\n arr2.append(i)\n arr3.append(abs(x - i))\nn2 = min([i for i, v in enumerate(arr3) if v == min(arr3)])\nprint((arr2[n2]))\n", "fast_code": "x, n = list(map(int, input().split()))\np = list(map(int, input().split()))\np = set(p)\ndiff = 101\nindx = 0\nans = (101, 0)\nif n != 0:\n for now in range(0, 102):\n if now not in p:\n now_diff = abs(now - x)\n ans = min(ans, (now_diff, now))\n print((ans[1]))\nelse:\n print(x)\n", "slow_time": 200917191, "fast_time": 44975683, "speedup": 4.4672, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_8"} +{"pair_id": "python_6023", "problem_id": "p03566", "language": "python", "slow_code": "N = int(eval(input()))\nt = list(map(int, input().split()))\nv = list(map(int, input().split()))\n\n\nN_INF = -(10**15)\nDP = [[N_INF] * (102) for _ in range(100 * 200 + 2)]\nDP[0][0] = 0\n\ntime = 1\nfor i in range(N):\n\n for j in range(time, time + t[i]):\n\n for k in range(0, v[i] + 1):\n if k == 0:\n\n DP[j][k] = max(DP[j - 1][0] + 0.25, DP[j - 1][1] + 1 / 2)\n elif k != v[i]:\n DP[j][k] = max(\n DP[j - 1][k - 1] + k - 1 / 2,\n DP[j - 1][k] + k + 0.25,\n DP[j - 1][k + 1] + k + 1 / 2,\n )\n else:\n DP[j][k] = max(DP[j - 1][k - 1] + k - 1 / 2, DP[j - 1][k] + k)\n\n time += t[i]\n\nprint((DP[time - 1][0]))\n", "fast_code": "import heapq\n\nn = int(eval(input()))\ninf = 10000000000000\n\n\nans = [[-1, -1] for i in range(n)]\nans[-1][1] = 0\nans[0][0] = 0\nt = list(map(int, input().split()))\nv = list(map(int, input().split()))\nv2 = []\nfor i in range(n):\n heapq.heappush(v2, (v[i], i))\nfor i in range(n):\n\n y = heapq.heappop(v2)\n\n if ans[y[1]][0] == -1:\n\n now1 = 0\n ansi1 = inf\n for j in range(y[1] - 1, -1, -1):\n\n if ans[j][1] != -1:\n ansi1 = min(ansi1, ans[j][1] + now1)\n now1 += t[j]\n if ans[j][0] != -1:\n ansi1 = min(ansi1, ans[j][0] + now1)\n now1 = 0\n for j in range(y[1], n):\n if ans[j][0] != -1:\n ansi1 = min(ansi1, ans[j][0] + now1)\n now1 += t[j]\n if ans[j][1] != -1:\n ansi1 = min(ansi1, ans[j][1] + now1)\n ans[y[1]][0] = min(ansi1, y[0])\n ans[y[1] - 1][1] = ans[y[1]][0]\n\n if ans[y[1]][1] == -1:\n\n now2 = 0\n ansi2 = inf\n for j in range(y[1], -1, -1):\n if ans[j][1] != -1:\n ansi2 = min(ansi2, ans[j][1] + now2)\n now2 += t[j]\n if ans[j][0] != -1:\n ansi2 = min(ansi2, ans[j][0] + now2)\n now2 = 0\n for j in range(y[1] + 1, n):\n if ans[j][0] != -1:\n ansi2 = min(ansi2, ans[j][0] + now2)\n now2 += t[j]\n if ans[j][1] != -1:\n ansi2 = min(ansi2, ans[j][1] + now2)\n ans[y[1]][1] = min(ansi2, y[0])\n ans[y[1] + 1][0] = ans[y[1]][1]\n\nanswer = 0\nfor i in range(n):\n h = min((t[i] + sum(ans[i])) / 2, v[i])\n answer += (h**2 - ans[i][0] ** 2) / 2\n answer += (h**2 - ans[i][1] ** 2) / 2\n answer += h * (t[i] + sum(ans[i]) - 2 * h)\nprint(answer)\n", "slow_time": 6434338277, "fast_time": 175113223, "speedup": 36.7439, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_0"} +{"pair_id": "python_11614", "problem_id": "p02621", "language": "python", "slow_code": "N = 10**7\n\n\nfor i in range(N):\n pass\n\na = int(eval(input()))\nprint((a + a**2 + a**3))\n", "fast_code": "a = int(eval(input()))\nb = a**2\nc = a**3\nprint((a + b + c))\n", "slow_time": 202512920251, "fast_time": 12100112, "speedup": 16736.4501, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_19"} +{"pair_id": "python_1905", "problem_id": "p02821", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\nmm = 10**10\nk = mm.bit_length()\nK = 1 << k\nnu = lambda L: int(\"\".join([bin(K + a)[-k:] for a in L[::-1]]), 2)\nst = lambda n: bin(n)[2:] + \"0\"\nli = lambda s: [\n int(a, 2) if len(a) else 0\n for a in [s[-(i + 1) * k - 1 : -i * k - 1] for i in range(200001)]\n]\nn, m = list(map(int, input().split()))\na = [int(i) for i in input().split()]\nb = [0] * 100001\nfor i in a:\n b[i] += 1\nc = li(st(nu(b) * nu(b)))\nans = 0\nfor i in range(200001)[::-1]:\n if c[i] > 0:\n p = min(m, c[i])\n m -= p\n ans += i * p\n if m == 0:\n break\nprint(ans)\n", "fast_code": "n, m = list(map(int, input().split()))\na = list(map(int, input().split()))\na.sort()\nif n == 1:\n print((a[0] * 2))\n exit()\nfrom bisect import bisect_left, bisect_right\n\n\ndef f(x):\n global n, a\n ret = 0\n for i in range(n):\n ret += n - bisect_left(a, x - a[i])\n return ret\n\n\nl, r = -1, 10**6\nwhile l + 1 < r:\n k = l + (r - l) // 2\n if f(k) >= m:\n l = k\n else:\n r = k\n\n\nif f(r) >= m:\n co, ans = 0, 0\n for i in range(n):\n co += n - bisect_right(a, r - a[i])\n ans += (n - bisect_right(a, r - a[i])) * a[i]\n print((2 * ans + (m - co) * r))\nelse:\n co, ans = 0, 0\n for i in range(n):\n co += n - bisect_right(a, l - a[i])\n ans += (n - bisect_right(a, l - a[i])) * a[i]\n print((2 * ans + (m - co) * l))\n", "slow_time": 42079314749, "fast_time": 66933541, "speedup": 628.6731, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_20"} +{"pair_id": "python_9491", "problem_id": "p03168", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**6)\nimport functools\nimport operator\n\nn = int(eval(input()))\np = list(map(float, input().split()))\nhalf = n // 2 + 1\ndp = [[None] * (n + 1) for _ in range(n + 1)]\n\n\nfor i in range(0, n + 1):\n for depth in range(-1, n):\n if depth == -1:\n dp[i][depth] = 0\n elif i == 0:\n dp[i][depth] = functools.reduce(\n operator.mul, [1 - x for x in p[: depth + 1]]\n )\n elif (i - 1) == depth:\n dp[i][depth] = functools.reduce(operator.mul, p[: depth + 1])\n else:\n dp[i][depth] = dp[i - 1][depth - 1] * p[depth] + dp[i][depth - 1] * (\n 1 - p[depth]\n )\nprint((sum(dp[i][n - 1] for i in range(half, n + 1))))\n", "fast_code": "N = int(eval(input()))\nP = list(map(float, input().split()))\ndp = [1] + [0] * N\nfor p in P:\n dp = [p * a + (1 - p) * b for a, b in zip([0] + dp, dp)]\nprint((sum(dp[-(-N // 2) :])))\n", "slow_time": 79103016, "fast_time": 31936256, "speedup": 2.4769, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_21"} +{"pair_id": "python_16631", "problem_id": "p03147", "language": "python", "slow_code": "n = int(eval(input()))\nh = [int(i) for i in input().split()]\nr = i = 0\nwhile sum(h) != 0:\n if h[i] == 0:\n i += 1\n else:\n r += 1\n while i < n and h[i] > 0:\n h[i] -= 1\n i += 1\n i = 0\nprint(r)\n", "fast_code": "n = int(eval(input()))\nh = list(map(int, input().split()))\nprint((sum([max(0, h[i + 1] - h[i]) for i in range(n - 1)]) + h[0]))\n", "slow_time": 189440229, "fast_time": 24337397, "speedup": 7.7839, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_26"} +{"pair_id": "python_11709", "problem_id": "p02536", "language": "python", "slow_code": "from networkx.utils import UnionFind\nimport sys\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\ndef main():\n n, m = list(map(int, input().split()))\n uf = UnionFind()\n for i in range(1, n + 1):\n _ = uf[i]\n for _ in range(m):\n a, b = list(map(int, input().split()))\n uf.union(a, b)\n print((len(list(uf.to_sets())) - 1))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "class UnionFind:\n def __init__(self, n):\n self.prsz = [-1] * n\n\n def find(self, v):\n if self.prsz[v] < 0:\n return v\n self.prsz[v] = self.find(self.prsz[v])\n return self.prsz[v]\n\n def union(self, v, u):\n v = self.find(v)\n u = self.find(u)\n if v == u:\n return False\n if self.prsz[v] > self.prsz[u]:\n v, u = u, v\n self.prsz[v] += self.prsz[u]\n self.prsz[u] = v\n return True\n\n\nn, m = list(map(int, input().split()))\nuf = UnionFind(n)\nfor i in range(m):\n a, b = [int(x) - 1 for x in input().split()]\n uf.union(a, b)\nans = set()\nfor i in range(n):\n ans.add(uf.find(i))\nprint((len(ans) - 1))\n", "slow_time": 18069444838, "fast_time": 77172190, "speedup": 234.1445, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_20"} +{"pair_id": "python_7104", "problem_id": "p02732", "language": "python", "slow_code": "c = [0] * 8**6\n_, a = open(0)\n(*a,) = list(map(int, a.split()))\nfor i in a:\n c[i] += 1\ns = sum(i * ~-i // 2 for i in c)\nprint((\" \".join(str(s - c[i] + 1) for i in a)))\n", "fast_code": "import sys\nfrom math import factorial\nfrom collections import Counter, defaultdict\n\nsr = lambda: sys.stdin.readline().rstrip()\nir = lambda: int(sr())\nlr = lambda: list(map(int, sr().split()))\n\n\ndef comb(n, r):\n if n <= 0 or r > n:\n return 0\n return factorial(n) // factorial(n - r) // factorial(r)\n\n\nN = ir()\nA = lr()\ncounter = Counter(A)\ncase = 0\ndic = defaultdict(int)\nfor k, v in list(counter.items()):\n dic[k] = v\n case += comb(v, 2)\nfor a in A:\n num = dic[a]\n answer = case - (num - 1)\n print(answer)\n", "slow_time": 8948614458, "fast_time": 61557632, "speedup": 145.3697, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_9"} +{"pair_id": "python_5762", "problem_id": "p03039", "language": "python", "slow_code": "N, M, K = list(map(int, input().split()))\nMOD = 10**9 + 7\na = 0\nfor i in range(N):\n j = N - 1 - i\n a += i * (i + 1) // 2 + j * (j + 1) // 2\nb = 0\nfor i in range(M):\n j = M - 1 - i\n b += i * (i + 1) // 2 + j * (j + 1) // 2\nMAX = N * M + 5\nfac = [1, 1] + [0] * MAX\nfinv = [1, 1] + [0] * MAX\ninv = [0, 1] + [0] * MAX\nfor i in range(2, MAX + 2):\n fac[i] = fac[i - 1] * i % MOD\n inv[i] = -inv[MOD % i] * (MOD // i) % MOD\n finv[i] = finv[i - 1] * inv[i] % MOD\n\n\ndef ncr(n, r):\n if n < r:\n return 0\n if n < 0 or r < 0:\n return 0\n return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD\n\n\nans = (a * inv[N] ** 2 + b * inv[M] ** 2) * inv[N * M - 1] * (N * M)\nans *= K * (K - 1) // 2\nans *= ncr(N * M, K)\nprint((ans % MOD))\n", "fast_code": "MOD = 10**9 + 7\nN, M, K = list(map(int, input().split()))\ninvs = [1] * (K - 1)\nfor x in range(2, K - 1):\n invs[x] = (-(MOD // x) * invs[MOD % x]) % MOD\nC = 1\nfor x in range(N * M - K + 1, N * M - 1):\n C *= x\n C %= MOD\nfor x in range(1, K - 1):\n C *= invs[x]\n C %= MOD\nans1 = 0\nfor d in range(1, N):\n ans1 += (N - d) * d\n ans1 %= MOD\nans1 *= M**2\nans1 %= MOD\nans2 = 0\nfor d in range(1, M):\n ans2 += (M - d) * d\n ans2 %= MOD\nans2 *= N**2\nans2 %= MOD\nprint(((ans1 + ans2) * C % MOD))\n", "slow_time": 2276036514, "fast_time": 385009370, "speedup": 5.9116, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_13"} +{"pair_id": "python_9480", "problem_id": "p03030", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\ndef eprint(*args, **kwargs):\n print(*args, file=sys.stderr, **kwargs)\n\n\nfrom queue import PriorityQueue as pq\n\n\ndef main():\n n = int(eval(input()))\n dict = {}\n for i in range(1, n + 1):\n str_x, num = input().split()\n num = int(num)\n if str_x in dict:\n dict[str_x].put((-num, i))\n\n else:\n a = pq()\n dict[str_x] = a\n dict[str_x].put((-num, i))\n\n eprint(dict)\n ll = sorted(list(dict.items()))\n eprint(ll)\n\n for item in ll:\n while item[1].qsize():\n print((item[1].get())[1])\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "n = int(eval(input()))\nsp = [[input().split(), i + 1] for i in range(n)]\nsp = sorted(sp, key=lambda x: (x[0][0], -int(x[0][1])))\nfor i in range(n):\n print((sp[i][1]))\n", "slow_time": 85144218, "fast_time": 35156431, "speedup": 2.4219, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_1"} +{"pair_id": "python_2145", "problem_id": "p02989", "language": "python", "slow_code": "from bisect import bisect_left\n\nN = int(eval(input()))\nd = list(map(int, input().split()))\nd.sort()\nto_take = N // 2\ncnt = 0\nfor x in range(d[0], d[-1] + 1):\n idx = bisect_left(d, x)\n\n if idx == to_take:\n cnt += 1\nprint(cnt)\n", "fast_code": "N = int(eval(input()))\nD = sorted([int(i) for i in input().split()])\nmaxK = D[N // 2]\nminK = D[N // 2 - 1]\nprint((maxK - minK))\n", "slow_time": 4404972353, "fast_time": 22215089, "speedup": 198.2874, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_8"} +{"pair_id": "python_1612", "problem_id": "p02990", "language": "python", "slow_code": "def comb(n, r):\n if r < 0 or r > n:\n return 0\n r = min(r, n - r)\n return g1[n] * g2[r] * g2[n - r] % MOD\n\n\nMOD = 10**9 + 7\nMAXN = 4000 + 10\ng1 = [1, 1]\ng2 = [1, 1]\ninverse = [0, 1]\nfor i in range(2, MAXN + 1):\n g1.append((g1[-1] * i) % MOD)\n inverse.append(-inverse[MOD % i] * (MOD // i) % MOD)\n g2.append((g2[-1] * inverse[-1]) % MOD)\n\n\ndef f(n, k):\n if n < k:\n return 0\n if n == 0 and k == 0:\n return 1\n if k < 1:\n return 0\n return f2(n - k, k)\n\n\ndef f2(n, k):\n return comb(n + k - 1, k - 1)\n\n\nN, K = list(map(int, input().split()))\nfor i in range(1, K + 1):\n b = f(K, i)\n r = f(N - K, i - 1) + 2 * f(N - K, i) + f(N - K, i + 1)\n print(((b * r) % MOD))\n", "fast_code": "import math\n\n\ndef comb(n, k):\n return math.factorial(n) // math.factorial(k) // math.factorial(n - k)\n\n\ndef main():\n MOD = 10**9 + 7\n N, K = list(map(int, input().split()))\n for i in range(1, K + 1):\n if i > N - K + 1:\n print((0))\n continue\n blue = comb(N - K + 1, i) % MOD\n red = comb(K - 1, i - 1) % MOD\n ans = blue * red % MOD\n print(ans)\n\n\nmain()\n", "slow_time": 1043671507, "fast_time": 57750934, "speedup": 18.0719, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_7"} +{"pair_id": "python_15781", "problem_id": "p03331", "language": "python", "slow_code": "n = int(eval(input()))\nres = 100000\nfor i in range(1, n):\n j = n - i\n s = 0\n for c in str(i):\n s += int(c)\n for c in str(j):\n s += int(c)\n res = min(res, s)\nprint(res)\n", "fast_code": "n = int(eval(input()))\nif n % 10 == 0:\n print((10))\nelse:\n print((sum(map(int, list(str(n))))))\n", "slow_time": 131029901, "fast_time": 17095953, "speedup": 7.6644, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_7"} +{"pair_id": "python_7436", "problem_id": "p02912", "language": "python", "slow_code": "def bin_tree(pri, li_pri, len_li):\n\n lo = 0\n hi = len_li - 1\n while hi - lo > 1:\n mid = lo + (hi - lo) // 2\n guess = li_pri[mid]\n if guess >= pri:\n hi = mid\n else:\n lo = mid\n return lo\n\n\nI = input().split()\nN = int(I[0])\nM = int(I[1])\n\n\nA = list(map(int, input().split()))\nA.sort()\nwhile M > 0:\n M -= 1\n pri = A.pop(N - 1)\n pri = pri // 2\n if len(A) == 0:\n ans = 0\n elif pri < A[0]:\n ans = 0\n else:\n ans = bin_tree(pri, A, N - 1) + 1\n\n A[ans:ans] = [pri]\nF_pri = 0\nfor i in range(N):\n F_pri += A[i]\nprint(F_pri)\n", "fast_code": "n, m = list(map(int, input().split()))\na = list(map(int, input().split()))\nM = max(a)\na = sorted(a, reverse=True)\nt = 0\nwhile M > 1:\n M = -(-M // 2)\n t += 1\nz = [[] for i in range(t + 2)]\nfor i in range(n):\n s = 0\n b = a[i]\n while b > 1:\n b = -(-b // 2)\n s += 1\n z[t - s].append(a[i])\ncount = 0\nfor i in range(t + 1):\n z[i] = sorted(z[i])\n if count > m:\n break\n while z[i]:\n if count >= m:\n break\n c = z[i].pop()\n z[i + 1].append(c // 2)\n count += 1\nans = 0\nfor A in z:\n ans += sum(A)\nprint(ans)\n", "slow_time": 529707210, "fast_time": 92701696, "speedup": 5.7141, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_26"} +{"pair_id": "python_14137", "problem_id": "p02692", "language": "python", "slow_code": "import sys\n\nYES = \"Yes\"\nNO = \"No\"\n\n\ndef solve(N: int, A: int, B: int, C: int, s: \"List[int]\"):\n v = [A, B, C]\n ans = []\n if sum(v) == 0:\n return None\n if sum(v) == 1:\n for l, r in s:\n if v[l] + v[r] == 0:\n return None\n if v[l] == 0:\n ans.append(l)\n else:\n ans.append(r)\n v[l], v[r] = v[r], v[l]\n return ans\n if sum(v) > 1:\n for i in range(N):\n l, r = s[i]\n if v[l] + v[r] == 0:\n return None\n if v[r] == 1 and v[l] == 1 and i != N - 1 and s[i] != s[i + 1]:\n ln, rn = s[i + 1]\n if r == ln or r == rn:\n ans.append(r)\n v[l] -= 1\n v[r] += 1\n else:\n ans.append(l)\n v[l] += 1\n v[r] -= 1\n elif v[r] == 0 or v[l] > v[r]:\n ans.append(r)\n v[l] -= 1\n v[r] += 1\n else:\n ans.append(l)\n v[l] += 1\n v[r] -= 1\n return ans\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n\n def s2i(s: str):\n return ord(s[0]) - ord(\"A\"), ord(s[1]) - ord(\"A\")\n\n def i2s(i: int):\n return chr(i + ord(\"A\"))\n\n tokens = iterate_tokens()\n N = int(next(tokens))\n A = int(next(tokens))\n B = int(next(tokens))\n C = int(next(tokens))\n s = [s2i(next(tokens)) for _ in range(N)]\n ans = solve(N, A, B, C, s)\n if ans == None:\n print(NO)\n else:\n print(YES)\n print((\"\\n\".join(list(map(i2s, ans)))))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "n, a, b, c = map(int, input().split())\nq = [\n (0, 1) if s == \"AB\" else (1, 2) if s == \"BC\" else (0, 2)\n for s in (input() for _ in range(n))\n]\nans = []\nch = (\"A\", \"B\", \"C\")\nd = [a, b, c]\nfor (x, y), t in zip(q, q[1:] + [()]):\n if d[x] + d[y] == 0:\n print(\"No\")\n break\n if d[x] > d[y] or d[x] * d[y] == 1 and y in t:\n x, y = y, x\n d[x] += 1\n d[y] -= 1\n ans.append(ch[x])\nelse:\n print(\"Yes\", *ans, sep=\"\\n\")\n", "slow_time": 137002024, "fast_time": 53241305, "speedup": 2.5732, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_9"} +{"pair_id": "python_10530", "problem_id": "p02657", "language": "python", "slow_code": "import numpy as np\nimport scipy as sp\nimport math\n\na, b = list(map(str, input().split()))\na = int(a)\nb = int(float(b) * 100.001)\nans = int(a * b // 100)\nprint(ans)\n", "fast_code": "def resolve():\n a, b = list(map(int, input().split()))\n print((a * b))\n\n\nresolve()\n", "slow_time": 601968667, "fast_time": 9335678, "speedup": 64.4804, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_10"} +{"pair_id": "python_6375", "problem_id": "p02551", "language": "python", "slow_code": "N, Q = list(map(int, input().split()))\n\n\nclass SegmentTree:\n def __init__(self, init_value: list, segfunc, ide_ele):\n n = len(init_value)\n self.N0 = 1 << (n - 1).bit_length()\n self.ide_ele = ide_ele\n self.data = [ide_ele] * (2 * self.N0)\n self.segfunc = segfunc\n for i, x in enumerate(init_value):\n self.data[i + self.N0 - 1] = x\n for i in range(self.N0 - 2, -1, -1):\n self.data[i] = self.segfunc(self.data[2 * i + 1], self.data[2 * i + 2])\n\n def update(self, k: int, x):\n k += self.N0 - 1\n\n self.data[k] = x\n\n while k:\n k = (k - 1) // 2\n self.data[k] = self.segfunc(self.data[k * 2 + 1], self.data[k * 2 + 2])\n\n def get(self, k):\n return self.query(k, k + 1)\n\n def query(self, left: int, right: int):\n L = left + self.N0\n R = right + self.N0\n res = self.ide_ele\n\n a, b = [], []\n while L < R:\n if L & 1:\n a.append(L - 1)\n L += 1\n if R & 1:\n R -= 1\n b.append(R - 1)\n L >>= 1\n R >>= 1\n for i in a + b[::-1]:\n res = self.segfunc(res, self.data[i])\n\n return res\n\n\n\"\"\"\"\"\"\n\nsegW = SegmentTree([N - 1] * N, min, float(\"INF\"))\nsegH = SegmentTree([N - 1] * N, min, float(\"INF\"))\nans = (N - 2) ** 2\nfor i in range(Q):\n q, x = list(map(int, input().split()))\n if q == 1:\n res = segW.query(x - 1, N)\n now = segH.get(res - 1)\n segH.update(res - 1, min(x - 1, now))\n ans -= max(res - 1, 0)\n else:\n res = segH.query(x - 1, N)\n now = segW.get(res - 1)\n segW.update(res - 1, min(x - 1, now))\n ans -= max(res - 1, 0)\n\nprint(ans)\n", "fast_code": "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n N, Q, *query = list(map(int, read().split()))\n N -= 2\n row = [N] * N\n col = [N] * N\n R = C = N\n ans = N * N\n for q, x in zip(*[iter(query)] * 2):\n x -= 2\n if q == 1:\n if x < C:\n ans -= R\n for i in range(x + 1, C):\n col[i] = R\n C = x\n else:\n ans -= col[x]\n else:\n if x < R:\n ans -= C\n for i in range(x + 1, R):\n row[i] = C\n R = x\n else:\n ans -= row[x]\n print(ans)\n return\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 34125142256, "fast_time": 1845501096, "speedup": 18.491, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_14"} +{"pair_id": "python_13134", "problem_id": "p02783", "language": "python", "slow_code": "import sys\nimport socket\n\nhostname = socket.gethostname()\nif hostname == \"F451C\":\n sys.stdin = open(\"a1.in\")\n\n\ndef read_int_list():\n return list(map(int, input().split()))\n\n\ndef read_str_list():\n return input().split()\n\n\ndef read_int():\n return int(eval(input()))\n\n\ndef read_str():\n return eval(input())\n\n\ndef main_0():\n H, A = read_int_list()\n res = 0\n for i in range(10001):\n H = H - A\n res += 1\n if H <= 0:\n break\n print(res)\n\n\ndef main_1():\n H, A = read_int_list()\n res = H // A\n if H % A != 0:\n res += 1\n print(res)\n\n\ndef main():\n H, A = read_int_list()\n res = 0\n while H > 0:\n H -= A\n res += 1\n print(res)\n\n\nmain()\n", "fast_code": "import math\n\n\ndef main():\n hp, attack = (int(i) for i in input().rstrip().split(\" \"))\n print((str(math.ceil(hp / attack))))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 135296255, "fast_time": 20707987, "speedup": 6.5335, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_25"} +{"pair_id": "python_3952", "problem_id": "p03564", "language": "python", "slow_code": "import itertools\n\nN = int(eval(input()))\nK = int(eval(input()))\nans = 10**18\nfor i in itertools.product(\"AB\", repeat=N):\n tmp = 1\n for j in i:\n if j == \"A\":\n tmp *= 2\n else:\n tmp += K\n\n ans = min(ans, tmp)\nprint(ans)\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nN, K = I(), I()\nans = 10**6\nfor i in range(N + 1):\n a = 2**i\n a += K * (N - i)\n ans = min(ans, a)\nprint(ans)\n", "slow_time": 444510237, "fast_time": 63363242, "speedup": 7.0153, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_26"} +{"pair_id": "python_12588", "problem_id": "p02703", "language": "python", "slow_code": "def main():\n import heapq\n\n def dijkstra(graph, s, cd, c):\n dist = [[float(\"inf\")] * 2505 for _ in range(n)]\n q = []\n dist[s][c] = 0\n heapq.heappush(q, (0, s, c))\n while q:\n d, p, c = heapq.heappop(q)\n if dist[p][c] < d:\n continue\n for nn, nc, nt in graph[p]:\n if c >= nc and dist[nn][c - nc] > d + nt:\n dist[nn][c - nc] = d + nt\n heapq.heappush(q, (d + nt, nn, c - nc))\n if c + cd[p][0] < 2500:\n if dist[p][c + cd[p][0]] > d + cd[p][1]:\n dist[p][c + cd[p][0]] = d + cd[p][1]\n heapq.heappush(q, (d + cd[p][1], p, c + cd[p][0]))\n else:\n if dist[p][2500] > d + cd[p][1]:\n dist[p][2500] = d + cd[p][1]\n heapq.heappush(q, (d + cd[p][1], p, 2500))\n for i in dist[1:]:\n print((min(i)))\n\n n, m, s = list(map(int, input().split()))\n E = [[] for i in range(n)]\n la = []\n for i in range(m):\n u, v, a, b = list(map(int, input().split()))\n u -= 1\n v -= 1\n la.append(a)\n E[u].append((v, a, b))\n E[v].append((u, a, b))\n cd = [list(map(int, input().split())) for i in range(n)]\n dijkstra(E, 0, cd, min(s, 2500))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\nfrom heapq import heappush, heappop\nimport numpy as np\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\ndef ii():\n return int(input())\n\n\ndef mi():\n return map(int, input().split())\n\n\ndef li():\n return list(mi())\n\n\ndef main():\n def dijkstra(s):\n def push(v, s, x):\n if s < 0:\n return\n if dist[v, s] <= x:\n return\n dist[v, s] = x\n heappush(que, (x, v, s))\n\n inf = 10**18\n dist = np.full((n, MAX_S + 1), inf, dtype=int)\n\n que = []\n push(0, s, 0)\n while que:\n x, v, s = heappop(que)\n if dist[v, s] < x:\n continue\n ns = min(s + c[v], MAX_S)\n push(v, ns, x + d[v])\n for nv, a, b in adj[v]:\n push(nv, s - a, x + b)\n return np.min(dist, axis=1)\n\n n, m, s = mi()\n adj = [[] for i in range(n)]\n MAX_S = 0\n for i in range(m):\n u, v, a, b = mi()\n u -= 1\n v -= 1\n adj[u].append((v, a, b))\n adj[v].append((u, a, b))\n MAX_S = max(MAX_S, a)\n MAX_S *= n - 1\n s = min(s, MAX_S)\n c, d = [0] * n, [0] * n\n for i in range(n):\n c[i], d[i] = mi()\n ans = dijkstra(s)\n print(*ans[1:], sep=\"\\n\")\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 4949677909, "fast_time": 538991161, "speedup": 9.1832, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_3"} +{"pair_id": "python_7166", "problem_id": "p02683", "language": "python", "slow_code": "import numpy as np\n\nN, M, X = list(map(int, input().split()))\nC = []\nA = []\nfor i in range(N):\n c = 0\n a = []\n c, *a = list(map(int, input().split()))\n C.append(c)\n A.append(a)\nA = np.array(A)\ninf = float(\"inf\")\nres = inf\nfor bit in range(1 << N):\n Cost = 0\n Wise = np.zeros(M)\n for i in range(N):\n if (bit >> i) & 1:\n Cost += C[i]\n Wise += A[i]\n Wise = Wise.tolist()\n\n if min(Wise) >= X and Cost <= res:\n res = Cost\nif res == inf:\n print(\"-1\")\nelse:\n print(res)\n\"\"\"\"\"\"\n", "fast_code": "import math\n\n\ndef solve(C, A, x, k, s, U):\n if k == 0:\n if min(U) >= x:\n return s\n else:\n return math.inf\n else:\n s_use = s + C[k - 1]\n U_use = [u + a for u, a in zip(U, A[k - 1])]\n return min(solve(C, A, x, k - 1, s, U), solve(C, A, x, k - 1, s_use, U_use))\n\n\ndef main():\n from sys import stdin\n\n n, m, x = list(map(int, stdin.readline().rstrip().split()))\n C = []\n A = []\n for _ in range(n):\n temp = list(map(int, stdin.readline().rstrip().split()))\n C.append(temp[0])\n A.append(temp[1:])\n U = [0] * m\n ans = solve(C, A, x, n, 0, U)\n print((ans if ans != math.inf else -1))\n\n\nmain()\n", "slow_time": 854153208, "fast_time": 158271337, "speedup": 5.3968, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_3"} +{"pair_id": "python_16133", "problem_id": "p03317", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef I():\n return int(eval(input()))\n\n\ndef LS():\n return input().split()\n\n\ndef S():\n return eval(input())\n\n\ndef main():\n a, b = LI()\n l = LI()\n c = 1\n _b = b\n while True:\n if a <= _b:\n break\n else:\n _b += b - 1\n c += 1\n return c\n\n\nprint((main()))\n", "fast_code": "M, N = list(map(int, input().split()))\nA = list(map(int, input().split()))\nprint((-(-(M - 1) // (N - 1))))\n", "slow_time": 28243298, "fast_time": 8410913, "speedup": 3.3579, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_6"} +{"pair_id": "python_14471", "problem_id": "p02669", "language": "python", "slow_code": "from collections import defaultdict\n\n\ndef solve(*args: str) -> str:\n t = int(args[0])\n NABCD = [tuple(map(int, nabcd.split())) for nabcd in args[1:]]\n ret = []\n for n, a, b, c, d in NABCD:\n ABC = ((2, a), (3, b), (5, c))\n dp = defaultdict(lambda: n * d)\n stack = [(n, 0)]\n while stack:\n rem, cost = stack.pop()\n if min(dp[0], dp[rem]) <= cost:\n continue\n dp[rem] = cost\n dp[0] = min(dp[0], cost + rem * d)\n if 0 < rem:\n for x, y in ABC:\n div, m = divmod(rem, x)\n if div:\n stack.append((div, d * m + cost + y))\n if m:\n stack.append((div + 1, d * (x - m) + cost + y))\n ret.append(str(dp[0]))\n return \"\\n\".join(ret)\n\n\nif __name__ == \"__main__\":\n print((solve(*(open(0).read().splitlines()))))\n", "fast_code": "from functools import lru_cache\nimport sys\n\nbuff_readline = sys.stdin.readline\nreadline = sys.stdin.readline\nINF = 2**62 - 1\n\n\ndef read_int():\n return int(buff_readline())\n\n\ndef read_int_n():\n return list(map(int, buff_readline().split()))\n\n\ndef read_float():\n return float(buff_readline())\n\n\ndef read_float_n():\n return list(map(float, buff_readline().split()))\n\n\ndef read_str():\n return readline().strip()\n\n\ndef read_str_n():\n return readline().strip().split()\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n error_print(e - s, \"sec\")\n return ret\n\n return wrap\n\n\ndef slv(N, A, B, C, D):\n @lru_cache(maxsize=None)\n def f(n):\n if n == 1:\n return D\n if n == 0:\n return 0\n ans = n * D\n i = (n // 2) * 2\n ans = min(ans, f(i // 2) + A + D * abs(n - i))\n i = -(-n // 2) * 2\n ans = min(ans, f(i // 2) + A + D * abs(n - i))\n i = (n // 3) * 3\n ans = min(ans, f(i // 3) + B + D * abs(n - i))\n i = -(-n // 3) * 3\n ans = min(ans, f(i // 3) + B + D * abs(n - i))\n i = (n // 5) * 5\n ans = min(ans, f(i // 5) + C + D * abs(n - i))\n i = -(-n // 5) * 5\n ans = min(ans, f(i // 5) + C + D * abs(n - i))\n return ans\n\n return f(N)\n\n\ndef main():\n T = read_int()\n for _ in range(T):\n N, A, B, C, D = read_int_n()\n print(slv(N, A, B, C, D))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 113056650889, "fast_time": 18347069002, "speedup": 6.1621, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_12"} +{"pair_id": "python_4483", "problem_id": "p02830", "language": "python", "slow_code": "from collections import Counter, defaultdict, deque\nfrom heapq import heappop, heappush, heapify\nimport sys, bisect, math, itertools, fractions, pprint\n\nsys.setrecursionlimit(10**8)\nmod = 10**9 + 7\nmod2 = 998244353\nINF = float(\"inf\")\n\n\ndef inp():\n return int(sys.stdin.readline())\n\n\ndef inpl():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef inpln(n):\n return list(int(sys.stdin.readline()) for i in range(n))\n\n\nn = inp()\ns, t = input().split()\nres = \"\"\nfor i in range(n):\n res += s[i] + t[i]\nprint(res)\n", "fast_code": "n = int(input())\nS, T = input().split()\nprint(*[s + t for s, t in zip(S, T)], sep=\"\")\n", "slow_time": 51953231, "fast_time": 16379205, "speedup": 3.1719, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_17"} +{"pair_id": "python_6081", "problem_id": "p02789", "language": "python", "slow_code": "import math\nimport statistics\nimport numpy as np\nimport queue\n\n\ndef fact(n):\n if n == 1:\n return 1\n else:\n return n * fact(n - 1)\n\n\ndef gcd(a, b):\n if a == 0:\n return b\n elif b == 0:\n return a\n else:\n return gcd(b, a % b)\n\n\ndef lcm(a, b):\n return a * b / gcd(a, b)\n\n\ndef qsort(seq):\n if len(seq) < 2:\n return seq\n else:\n beg, end = 0, len(seq) - 1\n mid = (beg + end) // 2\n smaller = [c for c in seq if seq[mid] > c]\n equal = [c for c in seq if seq[mid] == c]\n larger = [c for c in seq if seq[mid] < c]\n return qsort(smaller) + equal + qsort(larger)\n\n\nn, m = list(map(int, input().split()))\nif n == m:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "a, b = input().split()\nprint((\"YNeos\"[a != b :: 2]))\n", "slow_time": 76445893, "fast_time": 8196760, "speedup": 9.3264, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_9"} +{"pair_id": "python_7245", "problem_id": "p02683", "language": "python", "slow_code": "n, m, x = list(map(int, input().split()))\ninn = [list(map(int, input().split())) for _ in range(n)]\nc = [inn[_][0] for _ in range(n)]\nara = [inn[_][1:] for _ in range(n)]\nans = 1e9\nfor mask in range(2**15):\n cost = 0\n cnt = [0 for _ in range(m)]\n for i in range(n):\n if ((1 << i) & mask) == 0:\n continue\n cost += c[i]\n for j in range(m):\n cnt[j] += ara[i][j]\n ok = 1\n for i in range(m):\n if cnt[i] < x:\n ok = 0\n if ok:\n ans = min(ans, cost)\nif ans == 1e9:\n ans = -1\nprint(ans)\n", "fast_code": "import numpy as np\nimport sys\n\nn, m, x = list(map(int, input().split()))\narr = np.array([list(map(int, input().split())) for i in range(n)])\nc = arr.T[0]\na = arr.T[1:].T\nans = np.inf\nfor i in range(2**n):\n ability = np.zeros(m, np.int64)\n cost = 0\n for j in range(n):\n if (i >> j) & 1:\n ability += a[j]\n cost += c[j]\n\n if all(i >= x for i in ability):\n ans = min(ans, cost)\nans = -1 if ans == np.inf else ans\nprint(ans)\n", "slow_time": 78624060680, "fast_time": 560384050, "speedup": 140.3039, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_25"} +{"pair_id": "python_3642", "problem_id": "p02786", "language": "python", "slow_code": "import sys\nimport math\nimport os\nimport itertools\nimport string\nimport heapq\nimport _collections\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nfrom functools import lru_cache\nimport bisect\nimport re\nimport queue\nimport copy\nimport decimal\n\n\nclass Scanner:\n @staticmethod\n def int():\n return int(sys.stdin.readline().rstrip())\n\n @staticmethod\n def string():\n return sys.stdin.readline().rstrip()\n\n @staticmethod\n def map_int():\n return [int(x) for x in Scanner.string().split()]\n\n @staticmethod\n def string_list(n):\n return [Scanner.string() for i in range(n)]\n\n @staticmethod\n def int_list_list(n):\n return [Scanner.map_int() for i in range(n)]\n\n @staticmethod\n def int_cols_list(n):\n return [Scanner.int() for i in range(n)]\n\n\ndef solve():\n N = Scanner.int()\n ans = 0\n tmp = 1\n while N > 1:\n ans += tmp\n tmp *= 2\n N //= 2\n ans += tmp\n print(ans)\n\n\ndef main():\n\n solve()\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N = int(eval(input()))\nNB = format(N, \"0b\")\nK = len(NB)\nprint((2**K - 1))\n", "slow_time": 97773077, "fast_time": 14195855, "speedup": 6.8874, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_25"} +{"pair_id": "python_4468", "problem_id": "p03136", "language": "python", "slow_code": "import sys\n\ns2nn = lambda s: [int(c) for c in s.split(\" \")]\nss2nn = lambda ss: [int(s) for s in ss]\nss2nnn = lambda ss: [s2nn(s) for s in ss]\ni2s = lambda: sys.stdin.readline().rstrip()\ni2n = lambda: int(i2s())\ni2nn = lambda: s2nn(i2s())\nii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]\nii2nn = lambda n: ss2nn(ii2ss(n))\nii2nnn = lambda n: ss2nnn(ii2ss(n))\n\n\ndef main():\n N = i2n()\n L = i2nn()\n L.sort()\n l1 = sum(L[:-1])\n l2 = L[-1]\n if l1 > l2:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nmain()\n", "fast_code": "def main():\n N = int(eval(input()))\n L = [int(i) for i in input().split()]\n maxL = max(L)\n sumL = sum(L) - maxL\n if maxL < sumL:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 75579739, "fast_time": 30170786, "speedup": 2.5051, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_8"} +{"pair_id": "python_18487", "problem_id": "p03409", "language": "python", "slow_code": "from collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return list(map(list, sys.stdin.readline().split()))\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = I()\n return l\n\n\ndef LIR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = LI()\n return l\n\n\ndef SR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = S()\n return l\n\n\ndef LSR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = SR()\n return l\n\n\nmod = 1000000007\n\n\ndef A():\n return\n\n\ndef B():\n return\n\n\ndef C():\n def bfs(s, g, n):\n bfs_map = [-1 for i in range(n)]\n bfs_map[s] = 0\n q = deque()\n q.append(s)\n fin = False\n while q:\n x = q.popleft()\n for y in range(n):\n if c[x][y] > 0 and bfs_map[y] < 0:\n bfs_map[y] = bfs_map[x] + 1\n if y == g:\n fin = True\n break\n q.append(y)\n if fin:\n break\n if bfs_map[g] == -1:\n return [None, 0]\n path = [None for i in range(bfs_map[g] + 1)]\n m = float(\"inf\")\n path[bfs_map[g]] = g\n y = g\n for i in range(bfs_map[g])[::-1]:\n for x in range(n + 1):\n if c[x][y] > 0 and bfs_map[x] == bfs_map[y] - 1:\n path[i] = x\n if c[x][y] < m:\n m = c[x][y]\n y = x\n break\n return [path, m]\n\n def ford_fulkerson(s, g, c, n):\n while 1:\n p, m = bfs(s, g, n)\n if not m:\n break\n for i in range(len(p) - 1):\n c[p[i]][p[i + 1]] -= m\n c[p[i + 1]][p[i]] += m\n return sum(c[g])\n\n n = I()\n r = LIR(n)\n b = LIR(n)\n c = [[0 for i in range(2 * n + 2)] for i in range(2 * n + 2)]\n for i in range(n):\n c[0][i + 1] = 1\n for j in range(n):\n if r[i][0] < b[j][0] and r[i][1] < b[j][1]:\n c[i + 1][n + j + 1] = 1\n for j in range(n):\n c[n + j + 1][2 * n + 1] = 1\n print((ford_fulkerson(0, 2 * n + 1, c, 2 * n + 2)))\n\n\ndef D():\n n = I()\n a = LI()\n b = LI()\n ans = 0\n p = 1\n for k in range(30):\n s = 0\n c = [b[i] % (p * 2) for i in range(n)]\n a_ = [a[i] % (p * 2) for i in range(n)]\n c.sort()\n a_.sort()\n l1, l2, l3 = 0, 0, 0\n y = float(\"inf\")\n for x in a_[::-1]:\n if x != y:\n while l1 < n and c[l1] < p - x:\n l1 += 1\n while l2 < n and c[l2] < 2 * p - x:\n l2 += 1\n while l3 < n and c[l3] < 3 * p - x:\n l3 += 1\n s += n - l2 - l1 - l3\n y = x\n ans += (s % 2) * p\n p *= 2\n print(ans)\n\n\ndef E():\n return\n\n\ndef F():\n return\n\n\ndef G():\n return\n\n\ndef H():\n return\n\n\nif __name__ == \"__main__\":\n C()\n", "fast_code": "def ans():\n N = int(eval(input()))\n AB = sorted(\n [list(map(int, input().split())) for _ in range(N)], key=lambda x: -x[1]\n )\n CD = sorted([list(map(int, input().split())) for _ in range(N)])\n cnt = 0\n for c, d in CD:\n for a, b in AB:\n if a < c and b < d:\n cnt += 1\n AB.remove([a, b])\n break\n print(cnt)\n\n\nans()\n", "slow_time": 321964356, "fast_time": 52582925, "speedup": 6.123, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_9"} +{"pair_id": "python_788", "problem_id": "p02642", "language": "python", "slow_code": "n = int(eval(input()))\nA = sorted(map(int, input().split()))\nU = 10**6\nline = [1] * (U + 1)\nans = set()\ndepricated = set()\ncnt = [0] * (U + 1)\nfor a in A:\n cnt[a] += 1\n if cnt[a] == 2 and line[a]:\n depricated.add(a)\n continue\n if 2 < cnt[a]:\n continue\n if line[a]:\n ans.add(a)\n for p in range(2 * a, U + 1, a):\n line[p] = 0\nprint((len(ans - depricated)))\n", "fast_code": "n = int(eval(input()))\na = [int(i) for i in input().split()]\nmax_a = max(a)\nflag = [True for i in range(max_a + 1)]\ndup = set()\nfor i in range(n):\n if a[i] in dup:\n flag[a[i]] = False\n else:\n dup.add(a[i])\n for j in range(2 * a[i], max_a + 1, a[i]):\n flag[j] = False\nans = 0\nfor i in a:\n ans += flag[i]\nprint(ans)\n", "slow_time": 24452317730, "fast_time": 49265852, "speedup": 496.334, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_22"} +{"pair_id": "python_858", "problem_id": "p03556", "language": "python", "slow_code": "n = int(eval(input()))\nfor i in range(n, 0, -1):\n if float(i**0.5).is_integer():\n print(i)\n break\n", "fast_code": "import math\n\ni = int(eval(input()))\nr = math.sqrt(i)\nir = int(r)\nprint((ir * ir))\n", "slow_time": 868435773, "fast_time": 14440448, "speedup": 60.1391, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_29"} +{"pair_id": "python_12060", "problem_id": "p00008", "language": "python", "slow_code": "while True:\n try:\n n = int(eval(input()))\n cnt = 0\n for a in range(10):\n for b in range(10):\n for c in range(10):\n d = n - (a + b + c)\n if 0 <= d <= 9:\n cnt += 1\n print(cnt)\n except EOFError:\n break\n", "fast_code": "import sys\n\na = [0] * 51\nfor i in range(19):\n a[i] = a[36 - i] = (i + 3) * (i + 2) * (i + 1) // 6 - max(\n 2 * (i - 9) * (i - 8) * (i - 7) // 3, 0\n )\nfor e in sys.stdin:\n print((a[int(e)]))\n", "slow_time": 210429027, "fast_time": 26712620, "speedup": 7.8775, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_3"} +{"pair_id": "python_6065", "problem_id": "p03566", "language": "python", "slow_code": "N = int(eval(input()))\nt = list(map(int, input().split()))\nv = list(map(int, input().split()))\n\n\nN_INF = -(10**15)\nDP = [[N_INF] * (102) for _ in range(100 * 200 + 2)]\nDP[0][0] = 0\n\ntime = 1\nfor i in range(N):\n\n for j in range(time, time + t[i]):\n\n for k in range(0, v[i] + 1):\n if k == 0:\n\n DP[j][k] = max(DP[j - 1][0] + 0.25, DP[j - 1][1] + 1 / 2)\n elif k != v[i]:\n DP[j][k] = max(\n DP[j - 1][k - 1] + k - 1 / 2,\n DP[j - 1][k] + k + 0.25,\n DP[j - 1][k + 1] + k + 1 / 2,\n )\n else:\n DP[j][k] = max(DP[j - 1][k - 1] + k - 1 / 2, DP[j - 1][k] + k)\n\n time += t[i]\n\nprint((DP[time - 1][0]))\n", "fast_code": "N = int(eval(input()))\nT = list([int(t) * 10 for t in input().split()])\nV = list(map(int, input().split())) + [0]\nR = sum(T)\nmaxSpeed = [10**18] * (R + 1)\nmaxSpeed[0] = 0\nmaxSpeed[R] = 0\nnow = 0\nfor i, t in enumerate(T):\n now += t\n maxSpeed[now] = min(V[i], V[i + 1])\nnow = 0\nfor v, t in zip(V, T):\n for i in range(t + 1):\n maxSpeed[now + i] = min(maxSpeed[now + i], v)\n now += t\nfor t in range(1, R + 1):\n maxSpeed[t] = min(maxSpeed[t], maxSpeed[t - 1] + 0.1)\nfor t in range(R)[::-1]:\n maxSpeed[t] = min(maxSpeed[t], maxSpeed[t + 1] + 0.1)\nbase = 0\nupper = 0\nfor v1, v2 in zip(maxSpeed, maxSpeed[1:]):\n base += min(v1, v2)\n upper += abs(v1 - v2)\nans = base + upper / 2\nprint((ans / 10))\n", "slow_time": 6434338277, "fast_time": 966177479, "speedup": 6.6596, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_6"} +{"pair_id": "python_15901", "problem_id": "p03112", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import sqrt, hypot, factorial, pi, sin, cos, radians, log10\n\nif sys.version_info.minor >= 5:\n from math import gcd\nelse:\n from fractions import gcd\nfrom heapq import heappop, heappush, heapify, heappushpop\nfrom bisect import bisect_left, bisect_right\nfrom itertools import permutations, combinations, product, accumulate\nfrom operator import itemgetter, mul, xor\nfrom copy import copy, deepcopy\nfrom functools import reduce, partial\nfrom fractions import Fraction\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom datetime import date\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef round(x):\n return int((x * 2 + 1) // 2)\n\n\ndef fermat(x, y, MOD):\n return x * pow(y, MOD - 2, MOD) % MOD\n\n\ndef lcm(x, y):\n return (x * y) // gcd(x, y)\n\n\ndef lcm_list(nums):\n return reduce(lcm, nums, 1)\n\n\ndef gcd_list(nums):\n return reduce(gcd, nums, nums[0])\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST():\n return list(map(int, input().split()))\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = float(\"inf\")\nMOD = 10**9 + 7\nA, B, Q = MAP()\nS = [-INF] * (A + 2)\nfor i in range(A):\n S[i + 1] = INT()\nT = [-INF] * (B + 2)\nfor i in range(B):\n T[i + 1] = INT()\nS[-1] = T[-1] = INF\nfor i in range(Q):\n dist1 = dist2 = dist3 = dist4 = INF\n x = INT()\n\n idx1 = bisect_right(S, x) - 1\n\n idx2 = bisect_left(S, x)\n idx3 = bisect_right(T, x) - 1\n idx4 = bisect_left(T, x)\n\n dist1 = x - S[idx1]\n\n if dist1 != INF:\n dist1 += min(abs(S[idx1] - T[idx3]), abs(S[idx1] - T[idx4]))\n dist2 = S[idx2] - x\n if dist2 != INF:\n dist2 += min(abs(S[idx2] - T[idx3]), abs(S[idx2] - T[idx4]))\n dist3 = x - T[idx3]\n if dist3 != INF:\n dist3 += min(abs(T[idx3] - S[idx1]), abs(T[idx3] - S[idx2]))\n dist4 = T[idx4] - x\n if dist4 != INF:\n dist4 += min(abs(T[idx4] - S[idx1]), abs(T[idx4] - S[idx2]))\n print((min(dist1, dist2, dist3, dist4)))\n", "fast_code": "import bisect\nimport sys\n\nA, B, Q = list(map(int, input().split()))\nINF = 10**13\ns = [-INF] + [int(eval(input())) for i in range(A)] + [INF]\nt = [-INF] + [int(eval(input())) for i in range(B)] + [INF]\nfor q in range(Q):\n x = int(sys.stdin.readline())\n b, d = bisect.bisect_right(s, x), bisect.bisect_right(t, x)\n res = INF\n for S in [s[b - 1], s[b]]:\n for T in [t[d - 1], t[d]]:\n d1, d2 = abs(S - x) + abs(T - S), abs(T - x) + abs(S - T)\n res = min(res, d1, d2)\n print(res)\n", "slow_time": 209429987, "fast_time": 66012821, "speedup": 3.1726, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_12"} +{"pair_id": "python_7592", "problem_id": "p03835", "language": "python", "slow_code": "k, s = list(map(int, input().split()))\ncnt = 0\nfor i in range(k + 1):\n for j in range(k + 1):\n if s >= i + j >= s - k:\n cnt += 1\nprint(cnt)\n", "fast_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\nk, s = list(map(int, input().split()))\nc = 0\nfor x in range(max(0, s - 2 * k), k + 1):\n for y in range(max(0, s - x - k), min(k, s - x) + 1):\n c += 1\nprint(c)\n", "slow_time": 301802361, "fast_time": 46133200, "speedup": 6.542, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_27"} +{"pair_id": "python_9225", "problem_id": "p02883", "language": "python", "slow_code": "import math\n\nN, K = list(map(int, input().split()))\nX = [\n (b, a * b)\n for a, b in zip(\n sorted(list(map(int, input().split()))),\n sorted(list(map(int, input().split())))[::-1],\n )\n]\nm, M, i = 0, 10**12, 1\nexec(\n \"i,M,m=((i+m)//2,i,m) if sum(math.ceil(max(0,c-i)/b)for b, c in X)<=K else((i+M)//2,M,i);\"\n * 50\n)\nprint(M)\n", "fast_code": "def binary_search(*, ok, ng, func):\n while abs(ok - ng) > 1:\n mid = (ok + ng) // 2\n if func(mid):\n ok = mid\n else:\n ng = mid\n return ok\n\n\ndef main():\n N, K = list(map(int, input().split()))\n (*A,) = sorted(map(int, input().split()))\n (*F,) = sorted(map(int, input().split()), reverse=True)\n\n def is_ok(score):\n rest = K\n for a, f in zip(A, F):\n exceed = max(0, a * f - score)\n if exceed:\n need = (exceed + f - 1) // f\n if need > a or need > rest:\n return False\n rest -= need\n return True\n\n ans = binary_search(ok=10**12, ng=-1, func=is_ok)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 822717967, "fast_time": 87743539, "speedup": 9.3764, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_29"} +{"pair_id": "python_5011", "problem_id": "p03606", "language": "python", "slow_code": "n = int(eval(input()))\n\nseat = [0] * 10**5\nfor i in range(n):\n l, r = list(map(int, input().split()))\n for j in range(l, r + 1):\n seat[j - 1] = 1\nres = 0\n\nfor i in range(10**5):\n if seat[i] == 1:\n res += 1\nprint(res)\n", "fast_code": "n = int(eval(input()))\nlr = [tuple(map(int, input().split())) for _ in range(n)]\nans = 0\nfor l, r in lr:\n ans += r - l + 1\nprint(ans)\n", "slow_time": 4037627509, "fast_time": 24107319, "speedup": 167.4855, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_24"} +{"pair_id": "python_2797", "problem_id": "p02577", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nN = LI2()\nprint((\"Yes\" if sum(N) % 9 == 0 else \"No\"))\n", "fast_code": "def main():\n N = int(input())\n print(\"Yes\") if N % 9 == 0 else print(\"No\")\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 55150974, "fast_time": 14811744, "speedup": 3.7235, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_21"} +{"pair_id": "python_6084", "problem_id": "p02789", "language": "python", "slow_code": "import math\nimport statistics\nimport numpy as np\nimport queue\n\n\ndef fact(n):\n if n == 1:\n return 1\n else:\n return n * fact(n - 1)\n\n\ndef gcd(a, b):\n if a == 0:\n return b\n elif b == 0:\n return a\n else:\n return gcd(b, a % b)\n\n\ndef lcm(a, b):\n return a * b / gcd(a, b)\n\n\ndef qsort(seq):\n if len(seq) < 2:\n return seq\n else:\n beg, end = 0, len(seq) - 1\n mid = (beg + end) // 2\n smaller = [c for c in seq if seq[mid] > c]\n equal = [c for c in seq if seq[mid] == c]\n larger = [c for c in seq if seq[mid] < c]\n return qsort(smaller) + equal + qsort(larger)\n\n\nn, m = list(map(int, input().split()))\nif n == m:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "r = input().split()\nprint((\"Yes\" if r[0] == r[1] else \"No\"))\n", "slow_time": 76445893, "fast_time": 9019597, "speedup": 8.4755, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_3"} +{"pair_id": "python_10200", "problem_id": "p03222", "language": "python", "slow_code": "h, w, kk = list(map(int, input().split()))\ndp = [[[] for j in range(w)] for i in range(h + 1)]\n\n\nfor i in range(h + 1):\n for j in range(w):\n dp[i][j] = 0\ndp[0][0] = 1\nmod = 1000000007\nfor i in range(1, h + 1):\n for j in range(1 << (w - 1)):\n yoko = [False for loo in range(w)]\n for k in range((w - 1)):\n yoko[k] = True if ((j >> k) & 1) else False\n ok = True\n for l in range(w - 2):\n if yoko[l] == True and yoko[l + 1] == True:\n ok = False\n if not ok:\n continue\n for l in range(w):\n if l == 0:\n if yoko[l]:\n dp[i][l] += dp[i - 1][l + 1]\n else:\n dp[i][l] += dp[i - 1][l]\n dp[i][l] %= mod\n continue\n if l == w - 1:\n if yoko[l - 1]:\n dp[i][l] += dp[i - 1][l - 1]\n else:\n dp[i][l] += dp[i - 1][l]\n dp[i][l] %= mod\n continue\n if yoko[l - 1] or yoko[l]:\n if yoko[l - 1]:\n dp[i][l] += dp[i - 1][l - 1]\n else:\n dp[i][l] += dp[i - 1][l + 1]\n else:\n dp[i][l] += dp[i - 1][l]\n dp[i][l] %= mod\nprint((dp[h][kk - 1]))\n", "fast_code": "import sys\nfrom itertools import product\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n H, W, K = list(map(int, readline().split()))\n A = product((0, 1), repeat=W - 1)\n B = []\n for bars in A:\n ok = True\n for i in range(W - 2):\n if bars[i] and bars[i + 1]:\n ok = False\n break\n if ok:\n B.append(bars)\n dp = [0] * W\n dp[0] = 1\n for _ in range(H):\n dp, dp_prev = [0] * W, dp\n for bars in B:\n for i in range(W):\n if i > 0 and bars[i - 1]:\n dp[i - 1] = (dp[i - 1] + dp_prev[i]) % MOD\n elif i < W - 1 and bars[i]:\n dp[i + 1] = (dp[i + 1] + dp_prev[i]) % MOD\n else:\n dp[i] = (dp[i] + dp_prev[i]) % MOD\n print((dp[K - 1]))\n return\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 879549979, "fast_time": 143342189, "speedup": 6.136, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_18"} +{"pair_id": "python_14577", "problem_id": "p03603", "language": "python", "slow_code": "N = int(input())\nP = list(map(int, input().split()))\nX = [0] + list(map(int, input().split()))\nko = [[] for _ in range(N + 1)]\nfor i, p in enumerate(P, 2):\n ko[p].append(i)\n\n\ndef f(p):\n n = len(ko[p])\n if n == 0:\n return X[p], 0\n dp = [[float(\"inf\")] * 5001 for _ in range(n + 1)]\n dp[0][0] = 0\n for i, c in enumerate(ko[p], 1):\n a, b = f(c)\n for j in range(a, 5001):\n dp[i][j] = min(dp[i][j], dp[i - 1][j - a] + b)\n for j in range(b, 5001):\n dp[i][j] = min(dp[i][j], dp[i - 1][j - b] + a)\n out = min(dp[-1][: X[p] + 1])\n if out == float(\"inf\"):\n print(\"IMPOSSIBLE\")\n exit()\n elif out > X[p]:\n return out, X[p]\n else:\n return X[p], out\n\n\nprint(\"POSSIBLE\") if min(f(1)) <= X[1] else print(\"IMPOSSIBLE\")\n", "fast_code": "N = int(input())\nP = list(map(int, input().split()))\nX = [0] + list(map(int, input().split()))\nko = [[] for _ in range(N + 1)]\nfor i, p in enumerate(P, 2):\n ko[p].append(i)\n\n\ndef f(p):\n n = len(ko[p])\n if n == 0:\n return X[p], 0\n dp = [[float(\"inf\")] * (X[p] + 1) for _ in range(n + 1)]\n dp[0][0] = 0\n for i, c in enumerate(ko[p], 1):\n a, b = f(c)\n for j in range(a, X[p] + 1):\n dp[i][j] = min(dp[i][j], dp[i - 1][j - a] + b)\n for j in range(b, X[p] + 1):\n dp[i][j] = min(dp[i][j], dp[i - 1][j - b] + a)\n out = min(dp[-1])\n if out == float(\"inf\"):\n print(\"IMPOSSIBLE\")\n exit()\n elif out > X[p]:\n return out, X[p]\n else:\n return X[p], out\n\n\nprint(\"POSSIBLE\") if min(f(1)) <= X[1] else print(\"IMPOSSIBLE\")\n", "slow_time": 908704243, "fast_time": 93010519, "speedup": 9.7699, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_3"} +{"pair_id": "python_16578", "problem_id": "p02845", "language": "python", "slow_code": "_, a = open(0)\nc = 1\nd = [3] + [0] * 10**6\nfor a in map(int, a.split()):\n c = c * d[a] % (10**9 + 7)\n d[a] -= 1\n d[a + 1] += 1\nprint(c)\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nMOD = 1_000_000_007\ncnt = [0, 0, 0]\nans = 1\nfor i in range(N):\n ans *= sum(c == A[i] for c in cnt)\n ans %= MOD\n for j in range(3):\n if cnt[j] == A[i]:\n cnt[j] += 1\n break\nprint(ans)\n", "slow_time": 815333677, "fast_time": 41667204, "speedup": 19.5678, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_29"} +{"pair_id": "python_2671", "problem_id": "p02630", "language": "python", "slow_code": "f = lambda: [*list(map(int, input().split()))]\nf()\ns, *l = [0] * 100002\nfor i in f():\n s += i\n l[i] += 1\nq = f()[0]\nfor _ in range(q):\n b, c = f()\n s += (c - b) * l[b]\n l[c] += l[b]\n l[b] = 0\n print(s)\n", "fast_code": "f = lambda: [*list(map(int, input().split()))]\nf()\nl, q = f(), f()[0]\nfrom collections import *\n\nC, s = Counter(l), sum(l)\nfor _ in range(q):\n b, c = f()\n s += (c - b) * C[b]\n C[c] += C[b]\n C[b] = 0\n print(s)\n", "slow_time": 246048618, "fast_time": 38436601, "speedup": 6.4014, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_25"} +{"pair_id": "python_15424", "problem_id": "p02695", "language": "python", "slow_code": "n, m, q = list(map(int, input().split()))\nl = []\nfor i in range(q):\n l1, l2, l3, l4 = list(map(int, input().split()))\n l.append([l1, l2, l3, l4])\nB = []\nfor a in range(1, m + 1):\n for b in range(a, m + 1):\n for c in range(b, m + 1):\n for d in range(c, m + 1):\n for e in range(d, m + 1):\n for f in range(e, m + 1):\n for g in range(f, m + 1):\n for h in range(g, m + 1):\n for i in range(h, m + 1):\n for j in range(i, m + 1):\n L = [a, b, c, d, e, f, g, h, i, j]\n A = []\n for I in range(n):\n A.append(L[I])\n C = 0\n for k in range(q):\n if (\n A[l[k][1] - 1] - A[l[k][0] - 1]\n == l[k][2]\n ):\n C += l[k][3]\n B.append(C)\nprint((max(B)))\n", "fast_code": "import sys\nimport itertools\n\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\nN, M, Q = list(map(int, input().split()))\nabcd_ls = [list(map(int, input().split())) for _ in range(Q)]\n\n\ndef calc():\n score = 0\n for abcd in abcd_ls:\n a, b, c, d = abcd\n a -= 1\n b -= 1\n if c == A[b] - A[a]:\n score += d\n return score\n\n\ndef dfs(i, mx):\n if i == N:\n return calc()\n score = 0\n for x in range(mx, M + 1):\n A[i] = x\n s = dfs(i + 1, x)\n score = max(s, score)\n return score\n\n\nA = [0] * N\nans = dfs(0, 1)\nprint(ans)\n", "slow_time": 6526662255, "fast_time": 566050900, "speedup": 11.5302, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_26"} +{"pair_id": "python_15784", "problem_id": "p03331", "language": "python", "slow_code": "n = int(eval(input()))\nif n % 10 == 0 and n != 10:\n print((10))\nelse:\n a, b = 1, 0\n sA, sB = 0, 0\n soma = []\n while a <= n:\n b = n - a\n for i in str(a):\n sA += int(i)\n for j in str(b):\n sB += int(j)\n soma.append(sA + sB)\n a = a + 1\n print((min(soma)))\n", "fast_code": "n = int(eval(input()))\nif n % 10 == 0:\n print((10))\nelse:\n print((sum(map(int, list(str(n))))))\n", "slow_time": 147052057, "fast_time": 17095953, "speedup": 8.6016, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_7"} +{"pair_id": "python_6201", "problem_id": "p00033", "language": "python", "slow_code": "def s(a, i, b, c):\n return (\n b == sorted(b) and c == sorted(c)\n if i == 10\n else s(a, i + 1, b + [a[i]], c) or s(a, i + 1, b, c + [a[i]])\n )\n\n\nfor roop in range(int(input())):\n print(\"YES\" if s(list(map(int, input().split())), 0, [], []) else \"NO\")\n", "fast_code": "import sys\n\n\ndef solve(balls):\n if distribute(balls, [], []):\n print(\"YES\")\n else:\n print(\"NO\")\n\n\ndef distribute(balls, R, L):\n if len(balls) != 0:\n next = balls[0]\n if isMutch(next, R):\n neoR = R\n neoR.append(next)\n if distribute(balls[1:], neoR, L):\n return True\n if isMutch(next, L):\n neoL = L\n neoL.append(next)\n if distribute(balls[1:], R, neoL):\n return True\n else:\n return isOrdered(R) and isOrdered(L)\n\n\ndef isMutch(next, lis):\n if len(lis) != 0:\n return next >= lis[len(lis) - 1]\n return True\n\n\ndef isOrdered(lis):\n\n checker = sorted(lis)\n return checker == lis\n\n\nlimit = 2**11\nsys.setrecursionlimit(limit)\nsize = int(eval(input()))\nfor i in range(0, size):\n balls = []\n for a in input().split(\" \"):\n balls.append(int(a))\n solve(balls)\n size -= 1\n if size == 0:\n break\n", "slow_time": 487982458, "fast_time": 88264637, "speedup": 5.5286, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_3"} +{"pair_id": "python_6334", "problem_id": "p03719", "language": "python", "slow_code": "import functools\nimport os\nimport sys\n\nsys.setrecursionlimit(10000)\nINF = float(\"inf\")\n\n\ndef inp():\n return int(input())\n\n\ndef inpf():\n return float(input())\n\n\ndef inps():\n return input()\n\n\ndef inl():\n return list(map(int, input().split()))\n\n\ndef inlf():\n return list(map(float, input().split()))\n\n\ndef inls():\n return input().split()\n\n\ndef inpm(line):\n return [inp() for _ in range(line)]\n\n\ndef inpfm(line):\n return [inpf() for _ in range(line)]\n\n\ndef inpsm(line):\n return [inps() for _ in range(line)]\n\n\ndef inlm(line):\n return [inl() for _ in range(line)]\n\n\ndef inlfm(line):\n return [inlf() for _ in range(line)]\n\n\ndef inlsm(line):\n return [inls() for _ in range(line)]\n\n\ndef debug(fn):\n if not os.getenv(\"LOCAL\"):\n return fn\n\n @functools.wraps(fn)\n def wrapper(*args, **kwargs):\n ret = fn(*args, **kwargs)\n print(\n \"DEBUG: {}({}) -> \".format(\n fn.__name__,\n \", \".join(\n list(map(str, args))\n + [\"{}={}\".format(k, str(v)) for k, v in kwargs.items()]\n ),\n ),\n end=\"\",\n )\n print(ret)\n return ret\n\n return wrapper\n\n\na, b, c = inl()\nprint(\"Yes\" if a <= c <= b else \"No\")\n", "fast_code": "s = input().split()\na = int(s[0])\nb = int(s[1])\nc = int(s[2])\nif c in range(a, b + 1):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 130412764, "fast_time": 18254153, "speedup": 7.1443, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_1"} +{"pair_id": "python_2302", "problem_id": "p02700", "language": "python", "slow_code": "from math import floor, ceil, sqrt, factorial, log\nfrom collections import Counter, deque\nfrom functools import reduce\n\n\ndef S():\n return eval(input())\n\n\ndef I():\n return int(eval(input()))\n\n\ndef MS():\n return list(map(str, input().split()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef FLI():\n return [int(i) for i in input().split()]\n\n\ndef LS():\n return list(MS())\n\n\ndef LI():\n return list(MI())\n\n\ndef LLS():\n return [list(map(str, l.split())) for l in eval(input())]\n\n\ndef LLI():\n return [list(map(int, l.split())) for l in eval(input())]\n\n\ndef LLSN(n: int):\n return [LS() for _ in range(n)]\n\n\ndef LLIN(n: int):\n return [LI() for _ in range(n)]\n\n\nA, B, C, D = MI()\nx = -(-A // D)\ny = -(-C // B)\nif x >= y:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "import math\n\na, b, c, d = list(map(int, input().split()))\nif math.ceil(c / b) <= math.ceil(a / d):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 100220167, "fast_time": 16790758, "speedup": 5.9688, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_11"} +{"pair_id": "python_5475", "problem_id": "p02392", "language": "python", "slow_code": "import sys\n\nif __name__ == \"__main__\":\n import doctest\n\n doctest.testmod()\n a, b, c = list(map(int, sys.stdin.read().split()))\n if a < b < c:\n print(\"Yes\")\n else:\n print(\"No\")\n", "fast_code": "a, b, c = list(map(int, input().split()))\nprint(\"Yes\" if a < b < c else \"No\")\n", "slow_time": 3028838454, "fast_time": 11874774, "speedup": 255.0649, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_6"} +{"pair_id": "python_404", "problem_id": "p03160", "language": "python", "slow_code": "def chmin(a, b):\n return b if a > b else a\n\n\ndef chmax(a, b):\n return b if a < b else a\n\n\ndef main(N, h):\n INF = 10**9\n dp = [INF] * (10**5 + 10)\n dp[0] = 0\n dp[1] = abs(h[1] - h[0])\n for i in range(2, N):\n dp[i] = chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]))\n dp[i] = chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))\n return dp[N - 1]\n\n\nif __name__ == \"__main__\":\n N = int(eval(input()))\n h = list(map(int, input().split()))\n print((main(N, h)))\n", "fast_code": "n = int(eval(input()))\nh = list(map(int, input().split()))\ndp = [float(\"inf\")] * n\ndp[0] = 0\ndp[1] = dp[0] + abs(h[1] - h[0])\nfor i in range(2, n):\n dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]))\nprint((dp[n - 1]))\n", "slow_time": 117408668, "fast_time": 37191112, "speedup": 3.1569, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_20"} +{"pair_id": "python_14573", "problem_id": "p03647", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\nfrom_1 = [False] * N\nto_N = [False] * N\nfor _ in range(M):\n a, b = list(map(int, input().split()))\n if a == 1:\n from_1[b - 1] = True\n elif b == N:\n to_N[a - 1] = True\nfor i in range(1, N):\n if from_1[i] and to_N[i]:\n print(\"POSSIBLE\")\n break\nelse:\n print(\"IMPOSSIBLE\")\n", "fast_code": "import sys\n\nn, m = list(map(int, sys.stdin.readline().split()))\nset1, setn = set(), set()\nfor _ in range(m):\n i, j = list(map(int, sys.stdin.readline().split()))\n if i in [1, n] or j in [1, n]:\n if i == 1:\n set1.add(j)\n if i == n:\n setn.add(j)\n if j == 1:\n set1.add(i)\n if j == n:\n setn.add(i)\nif set1 & setn:\n print(\"POSSIBLE\")\nelse:\n print(\"IMPOSSIBLE\")\n", "slow_time": 1854976633, "fast_time": 42212638, "speedup": 43.9436, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_2"} +{"pair_id": "python_7379", "problem_id": "p03044", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\ndef ii():\n return int(eval(input()))\n\n\ndef mi():\n return list(map(int, input().rstrip().split()))\n\n\ndef lmi():\n return list(map(int, input().rstrip().split()))\n\n\ndef li():\n return list(input().rstrip())\n\n\nfrom queue import Queue\n\n\ndef bfs(field, sy, sx, wall, dir):\n h = len(field)\n w = len(field[0])\n dp = [[-1 for _j in range(w)] for _i in range(h)]\n q = Queue()\n dp[sy][sx] = 0\n q.put((sy, sx))\n dy = [1, -1, 0, 0, 1, 1, -1, -1]\n dx = [0, 0, 1, -1, 1, -1, 1, -1]\n\n def isin(x, y):\n return 0 <= y and y < h and 0 <= x and x < w\n\n while not q.empty():\n y, x = q.get()\n for k in range(dir):\n ny, nx = y + dy[k], x + dx[k]\n if not isin(nx, ny) or field[ny][nx] == wall:\n continue\n elif dp[ny][nx] != -1:\n continue\n dp[ny][nx] = dp[y][x] + 1\n q.put((ny, nx))\n return dp\n\n\ndef ABC088_D():\n h, w = mi()\n s = [[\"\" for _j in range(w)] for _i in range(h)]\n for i in range(h):\n s[i] = li()\n dp = bfs(s, 0, 0, \"#\", 4)\n if dp[h - 1][w - 1] < 0:\n print((-1))\n else:\n cnt = 0\n for i in range(h):\n for j in range(w):\n cnt += s[i][j] == \".\"\n print((cnt - (dp[h - 1][w - 1] + 1)))\n\n\ndef ATC002_A():\n R, C = mi()\n sy, sx = mi()\n gy, gx = mi()\n s = [[\"\" for _j in range(C)] for _i in range(R)]\n for i in range(R):\n s[i] = li()\n dp = bfs(s, sy - 1, sx - 1, \"#\", 4)\n print((dp[gy - 1][gx - 1]))\n\n\ndef ABC126_D():\n N = ii()\n G = [[] for i in range(N)]\n for i in range(N - 1):\n a, b, w = mi()\n a -= 1\n b -= 1\n G[a].append((b, w))\n G[b].append((a, w))\n is_bipartite = True\n dist = [-1 for _ in range(N)]\n que = Queue()\n for v in range(N):\n if dist[v] != -1:\n\n continue\n dist[v] = 0\n que.put(v)\n while not que.empty():\n v = que.get()\n for nv, nw in G[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + nw\n que.put(nv)\n for i in dist:\n if i % 2 == 0:\n print((0))\n else:\n print((1))\n\n\nif __name__ == \"__main__\":\n\n ABC126_D()\n", "fast_code": "import sys\nfrom heapq import heappush, heappop\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n N, *UVW = map(int, read().split())\n G = [[] for _ in range(N)]\n for u, v, w in zip(*[iter(UVW)] * 3):\n G[u - 1].append((v - 1, w))\n G[v - 1].append((u - 1, w))\n dist = [INF] * N\n dist[0] = 0\n hq = [(0, 0)]\n while hq:\n d, v = heappop(hq)\n if d > dist[v]:\n continue\n for nv, cost in G[v]:\n if dist[nv] > dist[v] + cost:\n dist[nv] = dist[v] + cost\n heappush(hq, (dist[nv], nv))\n ans = [0] * N\n for i in range(N):\n ans[i] = 0 if dist[i] % 2 == 0 else 1\n print(*ans, sep=\"\\n\")\n return\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 204160464, "fast_time": 67326738, "speedup": 3.0324, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_14"} +{"pair_id": "python_7890", "problem_id": "p02708", "language": "python", "slow_code": "N, K = list(map(int, input().split()))\nans = 0\nfor i in range(K, N + 2):\n mini = i * (i - 1) // 2\n maxi = i * N - mini\n ans = ans + (maxi - mini + 1)\nprint((ans % (10**9 + 7)))\n", "fast_code": "n, k = list(map(int, input().split()))\nprint(\n (\n (\n n * (n + 1) * (n + 2) // 6\n - (3 * n - 2 * k + 4) * (k - 1) * k // 6\n - k\n + n\n + 2\n )\n % (10**9 + 7)\n )\n)\n", "slow_time": 2003161693, "fast_time": 17504024, "speedup": 114.4401, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_25"} +{"pair_id": "python_18283", "problem_id": "p02831", "language": "python", "slow_code": "A, B = list(map(int, input().split()))\na, b = A, B\nwhile True:\n if a > b:\n b += B\n elif a < b:\n a += A\n if a == b:\n print(a)\n break\n", "fast_code": "num1, num2 = list(map(int, input().split()))\nimport math\n\n\ndef gcd(num1, num2):\n for i in range(min(num1, num2), 0, -1):\n if num1 % i == 0 and num2 % i == 0:\n return i\n\n\nprint((int(num1 * num2 / gcd(num1, num2))))\n", "slow_time": 1958684566, "fast_time": 282756854, "speedup": 6.9271, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_27"} +{"pair_id": "python_6685", "problem_id": "p03275", "language": "python", "slow_code": "import sys\nfrom itertools import accumulate\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\nclass BIT:\n def __init__(self, init_value):\n self.n = len(init_value)\n self.tree = [0] * (self.n + 1)\n for i in range(1, self.n + 1):\n x = init_value[i - 1]\n while i <= self.n:\n self.tree[i] += x\n i += i & (-i)\n\n def update(self, i, x):\n while i <= self.n:\n self.tree[i] += x\n i += i & (-i)\n return\n\n def query(self, i):\n res = 0\n while i > 0:\n res += self.tree[i]\n i -= i & (-i)\n return res\n\n\nN = I()\nA = LI()\n\n\ndef f(x):\n B = [0] + [1 if A[i] >= x else -1 for i in range(N)]\n B = list(accumulate(B))\n B = [b + N + 1 for b in B]\n\n bit = BIT([0] * (2 * N + 2))\n count = 0\n for i in range(N + 1):\n b = B[i]\n count += bit.query(b)\n bit.update(b, 1)\n if count >= (N * (N + 1) + 3) // 4:\n return True\n return False\n\n\nok = 1\nng = 10**9 + 1\nwhile ok + 1 < ng:\n mid = (ok + ng) // 2\n if f(mid):\n ok = mid\n else:\n ng = mid\nprint(ok)\n", "fast_code": "n = int(eval(input()))\na = list(map(int, input().split()))\nx = list(sorted(set(a)))\nn_sub = n * (n + 1) // 2\nLi = 0\nRi = len(x)\nwhile Ri > Li + 1:\n i = (Li + Ri) // 2\n xi = x[i]\n UorD = [1 if ak >= xi else -1 for ak in a]\n cnt_sum = [0] * (2 * n + 1)\n cumsum = 0\n cnt_sum[cumsum + n] = 1\n judge = 0\n s = 0\n for uk in UorD:\n cumsum += uk\n if uk == 1:\n s += cnt_sum[cumsum + n] + 1\n else:\n s -= cnt_sum[cumsum + n + 1] - 1\n cnt_sum[cumsum + n] += 1\n judge += s\n if judge >= n_sub // 2:\n Li = i\n break\n else:\n Ri = i\nprint((x[Li]))\n", "slow_time": 119661320, "fast_time": 32655938, "speedup": 3.6643, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_6"} +{"pair_id": "python_11718", "problem_id": "p02536", "language": "python", "slow_code": "from networkx.utils import UnionFind\nimport sys\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\ndef main():\n n, m = list(map(int, input().split()))\n uf = UnionFind()\n for i in range(1, n + 1):\n _ = uf[i]\n for _ in range(m):\n a, b = list(map(int, input().split()))\n uf.union(a, b)\n print((len(list(uf.to_sets())) - 1))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N, M = list(map(int, input().split()))\n\n\nclass UnionFind:\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return \"\\n\".join(\"{}: {}\".format(r, self.members(r)) for r in self.roots())\n\n\nuf = UnionFind(N + 1)\nfor i in range(M):\n a, b = list(map(int, input().split()))\n uf.union(a, b)\nprint((uf.group_count() - 2))\n", "slow_time": 18069444838, "fast_time": 128200785, "speedup": 140.9464, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_18"} +{"pair_id": "python_8203", "problem_id": "p03352", "language": "python", "slow_code": "X = int(eval(input()))\nans = 1\nfor i in range(1, 1000):\n for j in range(2, 1000):\n t = i**j\n if t > X:\n break\n ans = max(ans, t)\nprint(ans)\n", "fast_code": "from sys import stdin\nimport bisect\nfrom itertools import accumulate\nimport numpy as np\n\nn = int(stdin.readline().rstrip())\nli = [1]\nfor i in range(2, 34):\n for s in range(2, 10):\n if i**s <= 1000:\n li.append(i**s)\n else:\n break\nli = list(set(li))\nli.sort()\nprint((li[bisect.bisect(li, n) - 1]))\n", "slow_time": 300783133, "fast_time": 38248694, "speedup": 7.8639, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_3"} +{"pair_id": "python_346", "problem_id": "p03164", "language": "python", "slow_code": "import sys\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\nN, W = LI()\nwv = [LI() for _ in range(N)]\nV = N * 10**3\ndp = [[float(\"INF\")] * (V + 1) for _ in range(N + 1)]\ndp[0][0] = 0\nfor i in range(1, N + 1):\n w, v = wv[i - 1]\n for j in range(V + 1):\n if j - v >= 0:\n dp[i][j] = min(dp[i][j], dp[i - 1][j - v] + w)\n dp[i][j] = min(dp[i][j], dp[i - 1][j])\nprint((max([i for i in range(V + 1) if dp[-1][i] <= W])))\n", "fast_code": "\"\"\"\"\"\"\n\nINF = 2000000000\nn, W = list(map(int, input().split()))\nw = [0] * n\nv = [0] * n\nfor i in range(n):\n w[i], v[i] = list(map(int, input().split()))\nV = sum(v)\ndp = [[INF for i in range(V + 1)] for j in range(n + 1)]\n\ndp[0][0] = 0\nfor i in range(n):\n for j in range(V + 1):\n if j < v[i]:\n dp[i + 1][j] = dp[i][j]\n else:\n dp[i + 1][j] = min(dp[i][j], dp[i][j - v[i]] + w[i])\nans = 0\nfor i in range(V + 1):\n if dp[n][i] <= W:\n ans = i\nprint(ans)\n", "slow_time": 5389440474, "fast_time": 109898705, "speedup": 49.0401, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_24"} +{"pair_id": "python_11019", "problem_id": "p02640", "language": "python", "slow_code": "x, y = list(map(int, input().split()))\nfor i in range(0, 101):\n for j in range(0, 101):\n if i + j == x and i * 2 + j * 4 == y:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "fast_code": "x, y = list(map(int, input().split()))\nanswer = \"No\"\nfor i in range(x + 1):\n j = x - i\n if i * 2 + j * 4 == y:\n answer = \"Yes\"\nprint(answer)\n", "slow_time": 502995557, "fast_time": 17325743, "speedup": 29.0317, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_27"} +{"pair_id": "python_18282", "problem_id": "p02831", "language": "python", "slow_code": "a, b = list(map(int, input().split()))\ngcd = 0\nfor i in range(max(a, b), 0, -1):\n if a % i == 0 and b % i == 0:\n gcd = i\n break\nprint((a * b // gcd))\n", "fast_code": "num1, num2 = list(map(int, input().split()))\nimport math\n\n\ndef gcd(num1, num2):\n for i in range(min(num1, num2), 0, -1):\n if num1 % i == 0 and num2 % i == 0:\n return i\n\n\nprint((int(num1 * num2 / gcd(num1, num2))))\n", "slow_time": 1631239856, "fast_time": 282756854, "speedup": 5.7691, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_27"} +{"pair_id": "python_9238", "problem_id": "p02960", "language": "python", "slow_code": "s = input()[::-1]\nmod = 13\np = 10**9 + 7\ndp = [[0] * 13 for _ in range(len(s) + 1)]\ndp[0][0] = 1\nfor i in range(len(s)):\n if s[i] == \"?\":\n for j in range(10):\n d = j * pow(10, i, mod)\n for k in range(13):\n dp[i + 1][(k + d) % mod] += dp[i][k]\n dp[i + 1][(k + d) % mod] %= p\n else:\n d = int(s[i]) * pow(10, i, mod)\n for k in range(13):\n dp[i + 1][(k + d) % mod] += dp[i][k]\nprint((dp[-1][5]))\n", "fast_code": "import sys\n\n\ndef solve():\n input = sys.stdin.readline\n mod = 10**9 + 7\n s = str(input().rstrip(\"\\n\"))\n ls = [[0] * 13 for _ in range(len(s))]\n for i in range(len(s)):\n if i == 0:\n if s[-i - 1] == \"?\":\n for j in range(10):\n ls[i][j] += 1\n else:\n ls[i][int(s[-i - 1])] += 1\n else:\n mult = pow(10, i, 13)\n if s[-i - 1] == \"?\":\n for j in range(13):\n for k in range(10):\n ls[i][(k * mult + j) % 13] += ls[i - 1][j]\n else:\n st = int(s[-i - 1])\n for j in range(13):\n ls[i][(st * mult + j) % 13] += ls[i - 1][j]\n for j in range(13):\n ls[i][j] = ls[i][j] % mod\n print((ls[-1][5]))\n\n\nif __name__ == \"__main__\":\n solve()\n", "slow_time": 991064274, "fast_time": 362355066, "speedup": 2.7351, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_4"} +{"pair_id": "python_6105", "problem_id": "p02789", "language": "python", "slow_code": "import math\nimport statistics\nimport numpy as np\nimport queue\n\n\ndef fact(n):\n if n == 1:\n return 1\n else:\n return n * fact(n - 1)\n\n\ndef gcd(a, b):\n if a == 0:\n return b\n elif b == 0:\n return a\n else:\n return gcd(b, a % b)\n\n\ndef lcm(a, b):\n return a * b / gcd(a, b)\n\n\ndef qsort(seq):\n if len(seq) < 2:\n return seq\n else:\n beg, end = 0, len(seq) - 1\n mid = (beg + end) // 2\n smaller = [c for c in seq if seq[mid] > c]\n equal = [c for c in seq if seq[mid] == c]\n larger = [c for c in seq if seq[mid] < c]\n return qsort(smaller) + equal + qsort(larger)\n\n\nn, m = list(map(int, input().split()))\nif n == m:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "import queue as Q\n\nN, M = list(map(int, input().split()))\nif N > M:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "slow_time": 76445893, "fast_time": 13369748, "speedup": 5.7178, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_17"} +{"pair_id": "python_3778", "problem_id": "p03564", "language": "python", "slow_code": "from copy import deepcopy\nimport math\nimport string\nimport collections\nfrom collections import Counter\nfrom collections import deque\nfrom decimal import Decimal\nimport sys\nimport fractions\nfrom operator import itemgetter\nimport itertools\nimport copy\n\n\ndef readints():\n return list(map(int, input().split()))\n\n\ndef nCr(n, r):\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\n\n\ndef has_duplicates2(seq):\n seen = []\n for item in seq:\n if not (item in seen):\n seen.append(item)\n return len(seq) != len(seen)\n\n\ndef divisor(n):\n divisor = []\n for i in range(1, n + 1):\n if n % i == 0:\n divisor.append(i)\n return divisor\n\n\ndef gcd(a, b):\n while b != 0:\n a, b = b, a % b\n return a\n\n\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\nn = int(eval(input()))\nk = int(eval(input()))\nans = 1\nfor i in range(n):\n ans = min(ans * 2, ans + k)\nprint(ans)\n", "fast_code": "x = int(input())\ny = int(input())\nd = 1\nfor i in range(0, x):\n if y > d:\n d += d\n else:\n d += y\nprint(d)\n", "slow_time": 90173136, "fast_time": 16380269, "speedup": 5.505, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_9"} +{"pair_id": "python_6062", "problem_id": "p03566", "language": "python", "slow_code": "n = int(eval(input()))\nT = list(map(int, input().split()))\nV = list(map(int, input().split()))\ndp = [[-1] * 102 for _ in range(sum(T) + 1)]\ndp[0][0] = 0\nnt = 0\npt = T[0]\n\ndelta = [-1, 0, 1]\nfor i in range(sum(T)):\n if pt == i:\n nt += 1\n pt += T[nt]\n for j in range(101):\n if j > V[nt] or dp[i][j] == -1:\n break\n for d in delta:\n nj = j + d\n if 0 <= nj <= V[nt]:\n if d != 0 or j == V[nt]:\n dp[i + 1][nj] = max(dp[i + 1][nj], dp[i][j] + (j + nj) / 2)\n else:\n dp[i + 1][nj] = max(dp[i + 1][nj], dp[i][j] + j + 0.25)\nprint((dp[-1][0]))\n", "fast_code": "n = int(eval(input()))\nT = list(map(int, input().split()))\nV = list(map(int, input().split()))\ns = [0] * n\nfor i in range(n - 1):\n s[i + 1] = s[i] + T[i]\nl = (s[-1] + T[n - 1]) * 2 + 1\nans = [1e100] * l\nfor i in range(l):\n ans[i] = min(ans[i], i / 2)\n ans[l - i - 1] = min(ans[i], i / 2)\nfor j in range(n):\n for i in range(l):\n if i <= s[j] * 2:\n ans[i] = min(ans[i], V[j] + (s[j] * 2 - i) / 2)\n elif s[j] * 2 <= i <= s[j] * 2 + T[j] * 2:\n ans[i] = min(ans[i], V[j])\n else:\n ans[i] = min(ans[i], V[j] + (i - s[j] * 2 - T[j] * 2) / 2)\nanser = 0\nfor i in range(l - 1):\n anser += (ans[i] + ans[i + 1]) / 4\nprint(anser)\n", "slow_time": 4557267717, "fast_time": 810617711, "speedup": 5.622, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_21"} +{"pair_id": "python_13149", "problem_id": "p03698", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\ninf = 1 << 60\nmod = 1000000007\nni = lambda: int(ns())\nnin = lambda y: [ni() for _ in range(y)]\nna = lambda: list(map(int, stdin.readline().split()))\nnan = lambda y: [na() for _ in range(y)]\nnf = lambda: float(ns())\nnfn = lambda y: [nf() for _ in range(y)]\nnfa = lambda: list(map(float, stdin.readline().split()))\nnfan = lambda y: [nfa() for _ in range(y)]\nns = lambda: stdin.readline().rstrip()\nnsn = lambda y: [ns() for _ in range(y)]\nncl = lambda y: [list(ns()) for _ in range(y)]\nnas = lambda: stdin.readline().split()\ns = ns()\nprint((\"yes\" if len(s) == len(set(s)) else \"no\"))\n", "fast_code": "a = list(input())\nb = set(a)\nprint(\"yes\") if (len(a) == len(b)) else print(\"no\")\n", "slow_time": 91067072, "fast_time": 12604997, "speedup": 7.2247, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_2"} +{"pair_id": "python_15529", "problem_id": "p02695", "language": "python", "slow_code": "n, m, q = list(map(int, input().split()))\nl = []\nfor i in range(q):\n l1, l2, l3, l4 = list(map(int, input().split()))\n l.append([l1, l2, l3, l4])\nB = []\nfor a in range(1, m + 1):\n for b in range(a, m + 1):\n for c in range(b, m + 1):\n for d in range(c, m + 1):\n for e in range(d, m + 1):\n for f in range(e, m + 1):\n for g in range(f, m + 1):\n for h in range(g, m + 1):\n for i in range(h, m + 1):\n for j in range(i, m + 1):\n L = [a, b, c, d, e, f, g, h, i, j]\n A = []\n for I in range(n):\n A.append(L[I])\n C = 0\n for k in range(q):\n if (\n A[l[k][1] - 1] - A[l[k][0] - 1]\n == l[k][2]\n ):\n C += l[k][3]\n B.append(C)\nprint((max(B)))\n", "fast_code": "import itertools\n\nN, M, Q = list(map(int, input().split()))\nG = [list(map(int, input().split())) for i in range(Q)]\nA_cands = list(itertools.combinations_with_replacement(list(range(1, M + 1)), N))\nans = 0\nfor cand in A_cands:\n cand_score = 0\n for i in range(Q):\n a, b, c, d = G[i]\n if cand[b - 1] - cand[a - 1] == c:\n cand_score += d\n ans = max(cand_score, ans)\nprint(ans)\n", "slow_time": 6526662255, "fast_time": 918733146, "speedup": 7.104, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_5"} +{"pair_id": "python_1778", "problem_id": "p03608", "language": "python", "slow_code": "from itertools import permutations\nfrom scipy.sparse.csgraph import floyd_warshall\n\nn, m, r = list(map(int, input().split()))\nvis = list(map(int, input().split()))\nINF = 10**18\npath = [[INF] * n for i in range(n)]\nfor i in range(m):\n a, b, c = list(map(int, input().split()))\n path[a - 1][b - 1] = c\n path[b - 1][a - 1] = c\npath = floyd_warshall(path)\nans = 10**18\nfor root in permutations(vis):\n cnt = 0\n for j in range(1, r):\n cnt += path[root[j - 1] - 1][root[j] - 1]\n ans = min(ans, cnt)\nprint((int(ans)))\n", "fast_code": "from heapq import heappop, heappush\nfrom itertools import permutations\n\n\ndef dijkstra(source: int) -> \"Array[int]\":\n\n size = len(G)\n dist = [float(\"inf\")] * size\n dist[source] = 0\n undetermined = size - 2\n queue = [(0, source)]\n while queue:\n cost, v = heappop(queue)\n if cost > dist[v]:\n continue\n for next_cost, u in G[v]:\n if cost + next_cost < dist[u]:\n dist[u] = cost + next_cost\n heappush(queue, (dist[u], u))\n undetermined -= 1\n if not undetermined:\n return dist\n return dist\n\n\ndef main():\n global G\n N, M, R, *RABC = list(map(int, open(0).read().split()))\n visit, ABC = RABC[:R], RABC[R:]\n G = [[] for _ in range(N + 1)]\n for v, u, cost in zip(*[iter(ABC)] * 3):\n G[v].append((cost, u)), G[u].append((cost, v))\n dist = {v: dijkstra(v) for v in visit}\n ans = float(\"inf\")\n for perm in permutations(visit):\n cur = sum(dist[v][u] for v, u in zip(perm, perm[1:]))\n ans = min(ans, cur)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 16547903576, "fast_time": 78060632, "speedup": 211.9878, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_2"} +{"pair_id": "python_6219", "problem_id": "p00040", "language": "python", "slow_code": "dict = [\n \"a\",\n \"b\",\n \"c\",\n \"d\",\n \"e\",\n \"f\",\n \"g\",\n \"h\",\n \"i\",\n \"j\",\n \"k\",\n \"l\",\n \"m\",\n \"n\",\n \"o\",\n \"p\",\n \"q\",\n \"r\",\n \"s\",\n \"t\",\n \"u\",\n \"v\",\n \"w\",\n \"x\",\n \"y\",\n \"z\",\n]\nlsalpha = [1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25]\nn = int(input())\nfor roop in range(n):\n code = input()\n for alpha in lsalpha:\n flag = 0\n for beta in range(26):\n decode = \"\"\n for chara in code:\n if chara != \" \":\n f = dict.index(chara)\n for i in range(26):\n if (alpha * i + beta) % 26 == f:\n dechara = dict[i]\n break\n decode += dechara\n else:\n decode += \" \"\n if decode.count(\"that\") > 0 or decode.count(\"this\") > 0:\n flag = 1\n break\n if flag == 1:\n break\n print(decode)\n", "fast_code": "import sys\nimport os\nimport math\n\nN = int(eval(input()))\nalphabet = \"abcdefghijklmnopqrstuvwxyz\"\n\n\ndef encode(s, alpha, beta):\n t = []\n for c in s:\n if c == \" \":\n t.append(c)\n else:\n gamma = ord(c) - 97\n v = (alpha * gamma + beta) % 26\n w = alphabet[v]\n t.append(w)\n return \"\".join(t)\n\n\nfor i in range(N):\n s = input().strip()\n for a in range(0, 26):\n for b in range(0, 26):\n encoded_this = encode(\"this\", a, b)\n encoded_that = encode(\"that\", a, b)\n if encoded_this in s or encoded_that in s:\n encoded_alphabet = encode(alphabet, a, b)\n table = str.maketrans(encoded_alphabet, alphabet)\n dst = s.translate(table)\n print(dst)\n", "slow_time": 6096430089, "fast_time": 559587423, "speedup": 10.8945, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_7"} +{"pair_id": "python_2230", "problem_id": "p02585", "language": "python", "slow_code": "import sys\n\nreadline = sys.stdin.readline\nreadall = sys.stdin.read\nns = lambda: readline().rstrip()\nni = lambda: int(readline().rstrip())\nnm = lambda: map(int, readline().split())\nnl = lambda: list(map(int, readline().split()))\nprn = lambda x: print(*x, sep=\"\\n\")\n\n\ndef solve():\n n, k = nm()\n p = nl()\n _c = nl()\n c = [0] * n\n for i in range(n):\n p[i] -= 1\n c[i] = _c[p[i]]\n m = 31\n MIN = -(1 << 63)\n vertex = list()\n score = list()\n vertex.append(p)\n score.append(c)\n for a in range(1, m + 1):\n p_ath = [0] * n\n c_ath = [0] * n\n for i in range(n):\n p_ath[i] = vertex[a - 1][vertex[a - 1][i]]\n c_ath[i] = score[a - 1][i] + score[a - 1][vertex[a - 1][i]]\n vertex.append(p_ath)\n score.append(c_ath)\n prv = [[MIN, 0] for _ in range(n)]\n nxt = [[MIN, MIN] for _ in range(n)]\n for b in range(m, -1, -1):\n for i in range(n):\n if (k >> b) & 1:\n nxt[vertex[b][i]][0] = max(\n nxt[vertex[b][i]][0], prv[i][0] + score[b][i]\n )\n nxt[vertex[b][i]][1] = max(\n nxt[vertex[b][i]][1], prv[i][1] + score[b][i]\n )\n nxt[i][0] = max(nxt[i][0], prv[i][0], prv[i][1])\n else:\n nxt[vertex[b][i]][0] = max(\n nxt[vertex[b][i]][0], prv[i][0] + score[b][i]\n )\n nxt[i][0] = max(nxt[i][0], prv[i][0])\n nxt[i][1] = max(nxt[i][1], prv[i][1])\n prv, nxt = nxt, prv\n ans = max(max(x) for x in prv)\n if ans == 0:\n ans = max(c)\n print(ans)\n return\n\n\nsolve()\n", "fast_code": "import sys\n\nread = sys.stdin.read\nreadlines = sys.stdin.readlines\nfrom itertools import accumulate\n\n\ndef main():\n n, k = list(map(int, input().split()))\n p = tuple(map(int, input().split()))\n c = tuple(map(int, input().split()))\n if k == 1:\n print((max(c)))\n sys.exit()\n seen = [0] * n\n cycles = []\n for i1 in range(n):\n if not seen[i1]:\n cycle_t = []\n koko = i1\n while True:\n if seen[koko]:\n cycles.append(cycle_t)\n break\n cycle_t.append(c[koko])\n seen[koko] = 1\n koko = p[koko] - 1\n score = max(c)\n for cycle in cycles:\n score_t = max(cycle)\n cycle_len = len(cycle)\n cycle_sum = sum(cycle)\n kaisu, rem = divmod(k, cycle_len)\n if rem == 0:\n kaisu -= 1\n rem = cycle_len\n if kaisu > 0:\n kaisu -= 1\n rem += cycle_len\n cycle = tuple(accumulate(cycle + cycle + cycle))\n for i1 in range(2, rem + 1):\n for i2 in range(cycle_len):\n score_t = max(score_t, cycle[i1 + i2] - cycle[i2])\n if cycle_sum > 0:\n score_t += kaisu * cycle_sum\n score = max(score, score_t)\n print(score)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 231578340, "fast_time": 101824874, "speedup": 2.2743, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_27"} +{"pair_id": "python_14582", "problem_id": "p00687", "language": "python", "slow_code": "while 1:\n n, a, b = list(map(int, input().split()))\n if n == a == b == 0:\n break\n c = 0\n d = [1] + [0] * 2000000\n for i in range(0, n + 1):\n if d[i]:\n d[i + a] = d[i + b] = 1\n else:\n c += 1\n print(c)\n", "fast_code": "while 1:\n n, a, b = list(map(int, input().split()))\n if n == 0:\n break\n S = [1] * (n + 1)\n for i in range(a):\n s = b * i\n while s <= n:\n S[s] = 0\n s += a\n print(sum(S))\n", "slow_time": 6644536519, "fast_time": 30546868, "speedup": 217.5194, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_2"} +{"pair_id": "python_10533", "problem_id": "p02657", "language": "python", "slow_code": "import numpy as np\nimport scipy as sp\nimport math\n\na, b = list(map(str, input().split()))\na = int(a)\nb = int(float(b) * 100.001)\nans = int(a * b // 100)\nprint(ans)\n", "fast_code": "import math\n\nA, B = list(map(float, input().split()))\nB *= 100\nmul = math.floor(A * B)\nprint((int(mul / 100)))\n", "slow_time": 601968667, "fast_time": 10551881, "speedup": 57.0485, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_3"} +{"pair_id": "python_14495", "problem_id": "p02669", "language": "python", "slow_code": "from functools import lru_cache\n\n\nimport sys\n\nbuff_readline = sys.stdin.readline\nreadline = sys.stdin.readline\nINF = 2**62 - 1\n\n\ndef read_int():\n return int(buff_readline())\n\n\ndef read_int_n():\n return list(map(int, buff_readline().split()))\n\n\ndef read_float():\n return float(buff_readline())\n\n\ndef read_float_n():\n return list(map(float, buff_readline().split()))\n\n\ndef read_str():\n return readline().strip()\n\n\ndef read_str_n():\n return readline().strip().split()\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n error_print(e - s, \"sec\")\n return ret\n\n return wrap\n\n\ndef slv(N, A, B, C, D):\n if N == 1:\n return D\n\n @lru_cache(maxsize=None)\n def f(n):\n ans = n * D\n for i in range(-5, 6 if n > 10 else 1):\n m = n + i\n i = abs(i)\n if m < 0:\n continue\n if m == 0:\n ans = min(ans, D * i)\n continue\n if m % 5 == 0:\n ans = min(ans, f(m // 5) + C + D * i)\n\n if m % 3 == 0:\n ans = min(ans, f(m // 3) + B + D * i)\n\n if m % 2 == 0:\n ans = min(ans, f(m // 2) + A + D * i)\n\n return ans\n\n return f(N)\n\n\ndef main():\n T = read_int()\n for _ in range(T):\n N, A, B, C, D = read_int_n()\n print(slv(N, A, B, C, D))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "T = int(eval(input()))\nX = []\nfor i in range(T):\n N, A, B, C, D = list(map(int, input().split()))\n M = {0: 0, 1: D}\n S = {2: A, 3: B, 5: C}\n\n def f(N):\n if N in M:\n return M[N]\n R = D * N\n for k in S:\n p, q = N // k * k, (N + k - 1) // k * k\n R = min(\n R, D * abs(N - p) + S[k] + f(p // k), D * abs(N - q) + S[k] + f(q // k)\n )\n M[N] = R\n return R\n\n X.append(f(N))\nprint((\"\\n\".join(map(str, X))))\n", "slow_time": 169828749809, "fast_time": 20584269513, "speedup": 8.2504, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_22"} +{"pair_id": "python_15323", "problem_id": "p02971", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\nfrom itertools import permutations, combinations, accumulate\nfrom functools import *\nfrom collections import deque, defaultdict, Counter\nfrom heapq import heapify, heappop, heappush, heappushpop\n\nINF = float(\"inf\")\nNIL = -1\nN = int(eval(input()))\nA = [int(eval(input())) for _ in range(N)]\nmax_a = max(A)\nmax_idx = [i for i, x in enumerate(A) if x == max_a]\nif len(max_idx) > 1:\n for i in range(N):\n print(max_a)\n exit()\nelse:\n for i in max_idx:\n A[i] = NIL\n second_max = max(A)\n for i in range(N):\n if i in max_idx:\n print(second_max)\n else:\n print(max_a)\n", "fast_code": "A = [int(eval(input())) for i in range(int(eval(input())))]\none = sorted(A)[-1]\ntwo = sorted(A)[-2]\nfor i in A:\n print((one if i != one else two))\n", "slow_time": 60612209, "fast_time": 27341638, "speedup": 2.2168, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_8"} +{"pair_id": "python_14033", "problem_id": "p00028", "language": "python", "slow_code": "d = [0 for i in range(101)]\nwhile True:\n try:\n n = eval(input())\n d[n] += 1\n except:\n break\nfor e in [i for i, e in enumerate(d) if e == max(d)]:\n print(e)\n", "fast_code": "d = {}\ntry:\n while True:\n n = int(input())\n if n in d:\n d[n] += 1\n else:\n d[n] = 1\nexcept EOFError:\n pass\na = []\nm = max(d.values())\nfor key, value in list(d.items()):\n if value == m:\n a.append(key)\na.sort()\nfor i in a:\n print(i)\n", "slow_time": 122839158, "fast_time": 34750615, "speedup": 3.5349, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_3"} +{"pair_id": "python_3490", "problem_id": "p02922", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef S():\n return eval(input())\n\n\ndef main():\n a, b = LI()\n c = 1\n ans = 0\n while True:\n if c >= b:\n return ans\n ans += 1\n c -= 1\n c += a\n\n\nprint((main()))\n", "fast_code": "a, b = list(map(int, input().split()))\ntap = 1\nans = 0\nwhile tap < b:\n tap += a - 1\n ans += 1\nprint(ans)\n", "slow_time": 80117443, "fast_time": 15995403, "speedup": 5.0088, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_9"} +{"pair_id": "python_13497", "problem_id": "p02406", "language": "python", "slow_code": "def main():\n def sub():\n n = eval(input())\n i = 1\n s = \"\"\n\n while True:\n x = i\n if x % 3 == 0:\n s += \" \" + str(i)\n\n i += 1\n if i <= n:\n\n continue\n else:\n\n break\n\n while True:\n if x % 10 == 3:\n s += \" \" + str(i)\n\n i += 1\n if i <= n:\n\n break\n else:\n\n return s\n\n else:\n x /= 10\n if x:\n\n continue\n else:\n\n i += 1\n if i <= n:\n\n break\n else:\n\n return s\n\n return s\n\n print(sub())\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "num = int(input())\nfor i in range(1, num + 1):\n x = str(i)\n if i % 3 == 0 or \"3\" in x:\n print(\"\", i, end=\"\")\nprint()\n", "slow_time": 828189394, "fast_time": 34016214, "speedup": 24.3469, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_11"} +{"pair_id": "python_17497", "problem_id": "p02615", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(1 << 25)\nread = sys.stdin.readline\nra = range\nenu = enumerate\n\n\ndef exit(*argv, **kwarg):\n print(*argv, **kwarg)\n sys.exit()\n\n\ndef mina(*argv, sub=1):\n return list(map(lambda x: x - sub, argv))\n\n\ndef a_int():\n return int(read())\n\n\ndef ints():\n return list(map(int, read().split()))\n\n\ndef read_col(H):\n \"\"\"\"\"\"\n ret = []\n for _ in range(H):\n ret.append(list(map(int, read().split())))\n return tuple(map(list, zip(*ret)))\n\n\ndef read_tuple(H):\n \"\"\"\"\"\"\n ret = []\n for _ in range(H):\n ret.append(tuple(map(int, read().split())))\n return ret\n\n\ndef read_matrix(H):\n \"\"\"\"\"\"\n ret = []\n for _ in range(H):\n ret.append(list(map(int, read().split())))\n return ret\n\n\nMOD = 10**9 + 7\nINF = 2**31\n\nfrom collections import defaultdict, Counter, deque\nfrom operator import itemgetter, xor, add\nfrom itertools import product, permutations, combinations\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce\nfrom math import gcd\n\n\ndef lcm(a, b):\n\n g = gcd(a, b)\n return a // g * b\n\n\nN = a_int()\nA = ints()\nA.sort(reverse=True)\nans = A[0]\ncnt = 1\nfor a in A[1:]:\n if cnt == N - 1:\n break\n ans += a\n cnt += 1\n if cnt == N - 1:\n break\n ans += a\n cnt += 1\nprint(ans)\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\nN = int(eval(input()))\nA = list(map(int, input().split()))\nA.sort(reverse=True)\nans = 0\nfor i in range(1, N):\n ans += A[i // 2]\nprint(ans)\n", "slow_time": 122798898, "fast_time": 24314593, "speedup": 5.0504, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_24"} +{"pair_id": "python_9757", "problem_id": "p02554", "language": "python", "slow_code": "mod = 10**9 + 7\nN = int(eval(input()))\ns, n, z, e = 1, 0, 0, 0\nfor _ in range(N):\n s, n, z, e = 8 * s, s + n * 9, s + z * 9, n + z + e * 10\n s %= mod\n n %= mod\n z %= mod\n e %= mod\nprint(e)\n", "fast_code": "N = int(eval(input()))\nMOD = 10**9 + 7\nprint(((10**N - 2 * 9**N + 8**N) % MOD))\n", "slow_time": 16138820276, "fast_time": 3865871345, "speedup": 4.1747, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_4"} +{"pair_id": "python_5934", "problem_id": "p03693", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef solve():\n r, g, b = LI()\n s = r * 100 + g * 10 + b\n if s % 4 == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n return\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "vals = input().split()\ns_val = \"\"\nfor v in vals:\n s_val = s_val + v\ni_val = int(s_val)\nif i_val % 4 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "slow_time": 90554878, "fast_time": 16370993, "speedup": 5.5314, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_5"} +{"pair_id": "python_10399", "problem_id": "p03576", "language": "python", "slow_code": "import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import (\n ceil,\n sqrt,\n hypot,\n factorial,\n pi,\n sin,\n cos,\n tan,\n asin,\n acos,\n atan,\n radians,\n degrees,\n log2,\n gcd,\n)\nfrom itertools import (\n accumulate,\n permutations,\n combinations,\n combinations_with_replacement,\n product,\n groupby,\n)\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom bisect import bisect, bisect_left, insort, insort_left\nfrom heapq import heappush, heappop\nfrom functools import reduce\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST():\n return list(map(int, input().split()))\n\n\ndef TUPLE():\n return tuple(map(int, input().split()))\n\n\ndef ZIP(n):\n return list(zip(*(MAP() for _ in range(n))))\n\n\nsys.setrecursionlimit(10**9)\nINF = float(\"inf\")\nmod = 10**9 + 7\n\nfrom decimal import *\n\nN, K = MAP()\nxy = [LIST() for _ in range(N)]\nx, y = list(zip(*xy))\nx = sorted(x)\ny = sorted(y)\nans = INF\nfor ax, bx in combinations(x, 2):\n for ay, by in combinations(y, 2):\n cnt = 0\n for cx, cy in xy:\n if ax <= cx <= bx and ay <= cy <= by:\n cnt += 1\n if K <= cnt:\n ans = min(ans, (bx - ax) * (by - ay))\nprint(ans)\n", "fast_code": "n, k = list(map(int, input().split()))\nz = [list(map(int, input().split())) for _ in range(n)]\nz.sort()\na = 10**20\nfor i in range(n):\n for j in range(i + 1, n):\n x = z[j][0] - z[i][0]\n l = sorted(t[1] for t in z[i : j + 1])\n for u, v in zip(l, l[k - 1 :]):\n a = min(a, x * (v - u))\nprint(a)\n", "slow_time": 140828526, "fast_time": 50545175, "speedup": 2.7862, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_29"} +{"pair_id": "python_7403", "problem_id": "p02912", "language": "python", "slow_code": "import math\nimport heapq\n\nN, M = list(map(int, input().split()))\nA = list([-int(a) for a in input().split()])\nA.sort()\nheapq.heapify(A)\nfor i in range(M):\n a = heapq.heappop(A)\n a = -(-a / 2.0)\n heapq.heappush(A, a)\namount = 0\nfor a in A:\n amount += math.floor(-a)\nprint(amount)\n", "fast_code": "def calc(N, M, A):\n if N == 1:\n return A[0] // (2**M)\n A.sort(key=lambda a: -a)\n B = [A]\n for _ in range(M):\n i = 0\n m = B[0][0] if B[0] else -1\n for j in range(1, len(B)):\n if B[j] and B[j][0] > m:\n i = j\n m = B[j][0]\n p = B[i].pop(0) // 2\n if len(B) == i + 1:\n B += [[]]\n B[i + 1] += [p]\n if not (B[0]):\n B.pop(0)\n return sum([sum(b) for b in B])\n\n\nN, M = tuple([int(s) for s in input().split(\" \")])\nA = [int(s) for s in input().split()]\nprint((calc(N, M, A)))\n", "slow_time": 301341291, "fast_time": 75792722, "speedup": 3.9759, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_12"} +{"pair_id": "python_5060", "problem_id": "p03292", "language": "python", "slow_code": "a, b, c = list(map(int, input().split()))\nans = 9999\nans = min(ans, abs(a - b) + abs(b - c), abs(a - c) + abs(c - b))\nans = min(ans, abs(b - a) + abs(a - c), abs(b - c) + abs(c - a))\nans = min(ans, abs(c - a) + abs(a - b), abs(c - b) + abs(b - a))\nprint(ans)\n", "fast_code": "a, _, b = sorted(map(int, input().split()))\nprint((b - a))\n", "slow_time": 33306774, "fast_time": 9736665, "speedup": 3.4208, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_14"} +{"pair_id": "python_11833", "problem_id": "p03579", "language": "python", "slow_code": "from networkx import *\n\nn, *t = list(map(str.split, open(0)))\nn, m = list(map(int, n))\ng = Graph()\ng.add_edges_from(t)\ntry:\n a, b = list(map(len, bipartite.sets(g)))\n a *= b\nexcept:\n a = n * ~-n // 2\nprint((a - m))\n", "fast_code": "from sys import stdin, stdout\n\n\ndef readLine_int_list():\n return list(map(int, stdin.readline().split()))\n\n\ndef is_biparate(links):\n \"\"\"\"\"\"\n colors = [-1] * n\n colors[0] = 0\n q = [(0, 0)]\n visited = set()\n while q:\n v, c = q.pop()\n if v in visited:\n if colors[v] != c:\n return -1\n continue\n visited.add(v)\n colors[v] = c\n for u in links[v]:\n q.append((u, c ^ 1))\n return sum(colors)\n\n\nn, m = readLine_int_list()\ng = [set() for _ in range(n)]\n\n\ndef main():\n for _ in range(m):\n a, b = readLine_int_list()\n a -= 1\n b -= 1\n g[a].add(b)\n g[b].add(a)\n bp1 = is_biparate(g)\n if bp1 == -1:\n \"\"\"\"\"\"\n max_m = n * (n - 1) // 2\n else:\n \"\"\"\"\"\"\n max_m = bp1 * (n - bp1)\n print((max_m - m))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 18150154613, "fast_time": 85864159, "speedup": 211.3822, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_15"} +{"pair_id": "python_14589", "problem_id": "p03183", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nMOD = 10**9 + 7\ninput = lambda: sys.stdin.readline().rstrip()\n\n\ndef resolve():\n from functools import cmp_to_key\n\n n = int(eval(input()))\n B = [list(map(int, input().split())) for _ in range(n)]\n\n def cmp(a, b):\n va = min(a[1], b[1] - a[0])\n vb = min(b[1], a[1] - b[0])\n if va == vb:\n return 0\n return -1 if (va > vb) else 1\n\n B.sort(key=cmp_to_key(cmp))\n maxS = 20000\n dp = [-INF] * (maxS + 1)\n dp[0] = 0\n for i in range(n):\n w, s, v = B[i]\n ndp = dp[:]\n for total in range(maxS + 1):\n if total <= s and total + s <= maxS:\n ndp[total + w] = max(ndp[total + w], dp[total] + v)\n dp = ndp[:]\n print((max(dp)))\n\n\nresolve()\n", "fast_code": "import sys\n\nn = int(eval(input()))\nblocks = []\nfor line in sys.stdin.readlines():\n w, s, v = list(map(int, line.split()))\n blocks.append((w + s, w, s, v))\nblocks.sort()\ndp = [-1] * 20001\ndp[0] = 0\nfor _, w, s, v in blocks:\n for i in range(s, -1, -1):\n if dp[i] == -1:\n continue\n dp[i + w] = max(dp[i + w], dp[i] + v)\nprint((max(dp)))\n", "slow_time": 3166264104, "fast_time": 839094136, "speedup": 3.7734, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_7"} +{"pair_id": "python_8554", "problem_id": "p03722", "language": "python", "slow_code": "n, m = list(map(int, input().split()))\nA = [list(map(int, input().split())) for i in range(m)]\nfor i in range(m):\n A[i][2] = -A[i][2]\nP = [float(\"inf\")] * (n + 1)\nP[1] = 0\nF = [[0] * 2 for i in range(n + 1)]\nF[1][0] = 1\nF[n][1] = 1\nfor i in range(n):\n for j in range(m):\n if F[A[j][0]][0] == 1:\n F[A[j][1]][0] = 1\n if F[A[j][1]][1] == 1:\n F[A[j][0]][1] = 1\n P[A[j][1]] = min(P[A[j][1]], P[A[j][0]] + A[j][2])\nans0 = P[:]\nfor i in range(n):\n for j in range(m):\n if F[A[j][0]][0] == 1:\n F[A[j][1]][0] = 1\n if F[A[j][1]][1] == 1:\n F[A[j][0]][1] = 1\n P[A[j][1]] = min(P[A[j][1]], P[A[j][0]] + A[j][2])\nans1 = P[:]\n\n\ndef d():\n for i in range(n + 1):\n if F[i] == [1, 1] and ans1[i] < ans0[i]:\n return \"inf\"\n return -ans0[n]\n\n\nprint((d()))\n", "fast_code": "N, M = list(map(int, input().split()))\nabc = []\nfor _ in range(M):\n abc.append(list(map(int, input().split())))\ncost = [-float(\"inf\")] * N\ncost[0] = 0\nfor i in range(2):\n for a, b, c in abc:\n a, b = a - 1, b - 1\n cost[b] = max(cost[b], cost[a] + c)\n if i == 0:\n ans = cost[N - 1]\n else:\n Max = cost[N - 1]\nif ans != Max:\n print(\"inf\")\nelse:\n print(ans)\n", "slow_time": 119813492, "fast_time": 45176202, "speedup": 2.6521, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_20"} +{"pair_id": "python_13801", "problem_id": "p02385", "language": "python", "slow_code": "class Dice:\n def __init__(self):\n\n self.t = 1\n self.s = 2\n self.e = 3\n self.w = 4\n self.n = 5\n self.b = 6\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def __init__(self, t, s, e, w, n, b):\n\n self.t = t\n self.s = s\n self.e = e\n self.w = w\n self.n = n\n self.b = b\n self.rotway = {\"S\": 0, \"N\": 1, \"E\": 2, \"W\": 3}\n\n def rot(self, way):\n if way == 0:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.n,\n self.t,\n self.e,\n self.w,\n self.b,\n self.s,\n )\n elif way == 1:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.s,\n self.b,\n self.e,\n self.w,\n self.t,\n self.n,\n )\n elif way == 2:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.w,\n self.s,\n self.t,\n self.b,\n self.n,\n self.e,\n )\n elif way == 3:\n self.t, self.s, self.e, self.w, self.n, self.b = (\n self.e,\n self.s,\n self.b,\n self.t,\n self.n,\n self.w,\n )\n\n\ndef main():\n import random\n\n t1, s1, e1, w1, n1, b1 = list(map(int, input().split()))\n t2, s2, e2, w2, n2, b2 = list(map(int, input().split()))\n dice1 = Dice(t1, s1, e1, w1, n1, b1)\n dice2 = Dice(t2, s2, e2, w2, n2, b2)\n flag = 0\n for _ in range(10000):\n if (dice1.t, dice1.s, dice1.e, dice1.w, dice1.n, dice1.b) == (\n dice2.t,\n dice2.s,\n dice2.e,\n dice2.w,\n dice2.n,\n dice2.b,\n ):\n flag = 1\n break\n else:\n seed = random.randint(0, 3)\n dice2.rot(seed)\n if flag == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import itertools\n\n\ndef roll(dice, commands):\n for command in commands:\n if command == \"N\":\n dice[0], dice[1], dice[5], dice[4] = dice[1], dice[5], dice[4], dice[0]\n elif command == \"S\":\n dice[0], dice[1], dice[5], dice[4] = dice[4], dice[0], dice[1], dice[5]\n elif command == \"W\":\n dice[0], dice[3], dice[5], dice[2] = dice[2], dice[0], dice[3], dice[5]\n elif command == \"E\":\n dice[0], dice[3], dice[5], dice[2] = dice[3], dice[5], dice[2], dice[0]\n\n\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nfor i in range(4):\n for j in range(4):\n for commands in itertools.permutations(\"S\" * i + \"W\" * j):\n a = A[::]\n roll(a, commands)\n if B == a:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "slow_time": 3599802039, "fast_time": 586452876, "speedup": 6.1383, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_14"} +{"pair_id": "python_6696", "problem_id": "p02817", "language": "python", "slow_code": "import sys\n\nS, T = input().split()\nif not (S.islower() and T.islower()):\n sys.exit()\nif not (1 <= len(S) <= 100 and 1 <= len(S) <= 100):\n sys.exit()\nprint(T, S, sep=\"\")\n", "fast_code": "S, T = input().split()\nprint((T + S))\n", "slow_time": 21383088, "fast_time": 6789657, "speedup": 3.1494, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_6"} +{"pair_id": "python_9234", "problem_id": "p02883", "language": "python", "slow_code": "import math\n\nN, K = list(map(int, input().split()))\nX = [\n (b, a * b)\n for a, b in zip(\n sorted(list(map(int, input().split()))),\n sorted(list(map(int, input().split())))[::-1],\n )\n]\nm, M, i = 0, 10**12, 1\nexec(\n \"i,M,m=((i+m)//2,i,m) if sum(math.ceil(max(0,c-i)/b)for b, c in X)<=K else((i+M)//2,M,i);\"\n * 50\n)\nprint(M)\n", "fast_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**7)\nINF = 10**18\nMOD = 10**9 + 7\n\n\ndef bisearch_min(mn, mx, func):\n \"\"\"\"\"\"\n ok = mx\n ng = mn\n while ng + 1 < ok:\n mid = (ok + ng) // 2\n if func(mid):\n\n ok = mid\n else:\n\n ng = mid\n return ok\n\n\nN, K = MAP()\nA = LIST()\nB = LIST()\nA.sort(reverse=True)\nB.sort()\n\n\ndef check(m):\n k = 0\n for i, a in enumerate(A):\n b = B[i]\n k += max(ceil(a - m / b), 0)\n if k > K:\n return False\n return True\n\n\nprint((bisearch_min(-1, 10**12, check)))\n", "slow_time": 822717967, "fast_time": 188561044, "speedup": 4.3631, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_13"} +{"pair_id": "python_1783", "problem_id": "p03608", "language": "python", "slow_code": "import itertools\nfrom scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall\n\nN, M, R = list(map(int, input().split()))\nr = [int(i) for i in input().split()]\nG = [[10**8] * (N + 1) for _ in range(N + 1)]\nfor _ in range(M):\n A, B, C = list(map(int, input().split()))\n\n G[A][B] = C\n G[B][A] = C\n\n\ndg = csgraph_from_dense(G, null_value=10**8)\nd = floyd_warshall(dg)\nans = 10**12\nfor Q in itertools.permutations(r):\n c = 0\n for i in range(R - 1):\n c += d[Q[i]][Q[i + 1]]\n ans = min(ans, c)\nprint((int(ans)))\n", "fast_code": "from heapq import heapify, heappop, heappush\nfrom itertools import permutations\n\n\ndef dijkstra(G: \"Array[Array[int]]\", size: int, start: int) -> list:\n dist = [float(\"inf\")] * size\n queue = [(0, start)]\n unchecked = size - 1\n heapify(queue)\n while queue:\n cost, v = heappop(queue)\n if cost > dist[v]:\n continue\n dist[v] = cost\n for next_cost, u in G[v]:\n if cost + next_cost < dist[u]:\n heappush(queue, (cost + next_cost, u))\n unchecked -= 1\n if not unchecked:\n break\n return dist\n\n\ndef main():\n global G, N\n N, M, R, *RABC = list(map(int, open(0).read().split()))\n visit, ABC = RABC[:R], RABC[R:]\n G = [[] for _ in range(N + 1)]\n for v, u, cost in zip(*[iter(ABC)] * 3):\n G[v].append((cost, u)), G[u].append((cost, v))\n dist = {v: dijkstra(G, N + 1, v) for v in visit}\n ans = float(\"inf\")\n for perm in permutations(visit):\n cur = sum(dist[v][u] for v, u in zip(perm, perm[1:]))\n ans = min(ans, cur)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 16554399588, "fast_time": 79257828, "speedup": 208.8677, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_4"} +{"pair_id": "python_17727", "problem_id": "p03456", "language": "python", "slow_code": "x1, x2 = input().split()\ns = int(x1 + x2)\ntable = []\nfor i in range(1, 1000):\n table.append(i * i)\nfor x in table:\n if x == s:\n print(\"Yes\")\n quit()\nprint(\"No\")\n", "fast_code": "a, b = list(map(int, input().split()))\nif str(int(str(a) + str(b)) ** 0.5).split(\".\")[1:][0] == \"0\":\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 98989051, "fast_time": 18554788, "speedup": 5.335, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_22"} +{"pair_id": "python_3067", "problem_id": "p02724", "language": "python", "slow_code": "money = int(eval(input()))\nhappines = 0\nwhile money >= 500:\n happines += 1000\n money -= 500\nwhile money >= 5:\n happines += 5\n money -= 5\nprint(happines)\n", "fast_code": "X = int(eval(input()))\nprint(((X // 500) * 1000 + (X % 500) // 5 * 5))\n", "slow_time": 2924466792, "fast_time": 10495253, "speedup": 278.6466, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_13"} +{"pair_id": "python_14196", "problem_id": "p03296", "language": "python", "slow_code": "import sys\n\nINF = float(\"inf\")\nMOD = 10**9 + 7\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef LF():\n return [float(x) for x in sys.stdin.readline().split()]\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef II():\n return int(sys.stdin.readline())\n\n\ndef SI():\n return eval(input())\n\n\ndef main():\n n = II()\n A = LI()\n res = 0\n for i in range(1, n):\n if A[i] == A[i - 1]:\n A[i] = 0\n res += 1\n return res\n\n\nprint((main()))\n", "fast_code": "eval(input())\ncnt = 0\nnow = 0\nres = 0\nfor a in map(int, input().split()):\n if a == now:\n cnt += 1\n else:\n res += cnt // 2\n cnt = 1\n now = a\nprint((res + cnt // 2))\n", "slow_time": 65246975, "fast_time": 23246463, "speedup": 2.8067, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_4"} +{"pair_id": "python_14007", "problem_id": "p02283", "language": "python", "slow_code": "class Node:\n key = 0\n l = None\n r = None\n\n def __init__(self, key):\n self.key = key\n\n\nT = [None] * 5000005\n\n\ndef insert(z):\n if z == 0:\n return\n y = 0\n x = 0\n while x is not None:\n y = x\n x = T[x].l if T[z].key < T[x].key else T[x].r\n if T[z].key < T[y].key:\n T[y].l = z\n else:\n T[y].r = z\n\n\ndef inorder(x):\n if x == None:\n return\n inorder(T[x].l)\n print(\"\", T[x].key, end=\"\")\n inorder(T[x].r)\n\n\ndef preorder(x):\n if x == None:\n return\n print(\"\", T[x].key, end=\"\")\n preorder(T[x].l)\n preorder(T[x].r)\n\n\nn = int(input())\nfor i in range(n):\n s = input()\n if s == \"print\":\n inorder(0)\n print()\n preorder(0)\n print()\n else:\n x = int(s.split()[1])\n T[i] = Node(x)\n insert(i)\n", "fast_code": "class Node:\n def __init__(self, key):\n self.key = key\n self.parent = None\n self.left = None\n self.right = None\n\n\nclass Tree:\n def __init__(self):\n self.root = None\n\n def insert(self, node):\n y = None\n x = self.root\n while x is not None:\n y = x\n if node.key <= x.key:\n x = x.left\n else:\n x = x.right\n if y is None:\n self.root = node\n elif node.key < y.key:\n y.left = node\n else:\n y.right = node\n\n def print_in_order(self, node):\n if node is None:\n return\n self.print_in_order(node.left)\n print(\" \" + str(node.key), end=\"\")\n self.print_in_order(node.right)\n\n def print_pre_order(self, node):\n if node is None:\n return\n print(\" \" + str(node.key), end=\"\")\n self.print_pre_order(node.left)\n self.print_pre_order(node.right)\n\n\ntree = Tree()\nm = int(input())\nfor i in range(m):\n line = input().split()\n if line[0] == \"print\":\n tree.print_in_order(tree.root)\n print(\"\")\n tree.print_pre_order(tree.root)\n print(\"\")\n else:\n key = line[1]\n tree.insert(Node(int(key)))\n", "slow_time": 267495056, "fast_time": 107324650, "speedup": 2.4924, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_12"} +{"pair_id": "python_10617", "problem_id": "p03018", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\nri = lambda: int(rs())\nrl = lambda: list(map(int, stdin.readline().split()))\nrs = lambda: stdin.readline().rstrip()\nS = list(rs())\ncur = \"D\"\nanswer = 0\nA_cnt = 0\nfor s in S:\n if cur == \"A\":\n if s == \"A\":\n A_cnt += 1\n elif s == \"B\":\n cur = s\n else:\n cur = \"D\"\n A_cnt = 0\n elif cur == \"B\":\n if s == \"A\":\n A_cnt = 1\n cur = s\n elif s == \"B\":\n A_cnt = 0\n cur = \"D\"\n elif s == \"C\":\n answer += A_cnt\n cur = s\n else:\n cur = \"D\"\n A_cnt = 0\n elif cur == \"C\":\n if s == \"A\":\n A_cnt += 1\n cur = s\n elif s == \"B\":\n cur = s\n else:\n cur = \"D\"\n A_cnt = 0\n else:\n if s == \"A\":\n A_cnt += 1\n cur = s\n else:\n A_cnt = 0\n cur = \"D\"\nprint(answer)\n", "fast_code": "def main():\n S = input().replace(\"BC\", \"1\")\n ans = 0\n a = 0\n for s in S:\n if s == \"A\":\n a += 1\n elif s == \"1\":\n ans += a\n else:\n a = 0\n print(ans)\n\n\nmain()\n", "slow_time": 67556438, "fast_time": 20560575, "speedup": 3.2857, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_1"} +{"pair_id": "python_13292", "problem_id": "p03035", "language": "python", "slow_code": "import sys, math, collections, heapq, itertools\n\nF = sys.stdin\n\n\ndef single_input():\n return F.readline().strip(\"\\n\")\n\n\ndef line_input():\n return F.readline().strip(\"\\n\").split()\n\n\ndef gcd(a, b):\n a, b = max(a, b), min(a, b)\n while a % b > 0:\n a, b = b, a % b\n return b\n\n\ndef solve():\n A, B = list(map(int, line_input()))\n if A >= 13:\n print(B)\n elif A >= 6:\n print((B // 2))\n else:\n print((0))\n return 0\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "import os, sys, re, math\n\nA, B = list(map(int, input().split(\" \")))\nif A >= 13:\n print(B)\nelif A >= 6:\n print((B // 2))\nelse:\n print((0))\n", "slow_time": 48276073, "fast_time": 19662105, "speedup": 2.4553, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_9"} +{"pair_id": "python_17474", "problem_id": "p02834", "language": "python", "slow_code": "class Tree:\n def __init__(self, n, edge, indexed=1):\n self.n = n\n self.tree = [[] for _ in range(n)]\n for e in edge:\n self.tree[e[0] - indexed].append(e[1] - indexed)\n self.tree[e[1] - indexed].append(e[0] - indexed)\n\n def setroot(self, root):\n self.root = root\n self.parent = [None for _ in range(self.n)]\n self.parent[root] = -1\n self.depth = [None for _ in range(self.n)]\n self.depth[root] = 0\n self.order = []\n self.order.append(root)\n self.size = [1 for _ in range(self.n)]\n stack = [root]\n while stack:\n node = stack.pop()\n for adj in self.tree[node]:\n if self.parent[adj] is None:\n self.parent[adj] = node\n self.depth[adj] = self.depth[node] + 1\n self.order.append(adj)\n stack.append(adj)\n for node in self.order[::-1]:\n for adj in self.tree[node]:\n if self.parent[node] == adj:\n continue\n self.size[node] += self.size[adj]\n\n def heavylight_decomposition(self):\n self.order = [None for _ in range(self.n)]\n self.head = [None for _ in range(self.n)]\n self.head[self.root] = self.root\n self.next = [None for _ in range(self.n)]\n stack = [self.root]\n order = 0\n while stack:\n node = stack.pop()\n self.order[node] = order\n order += 1\n maxsize = 0\n for adj in self.tree[node]:\n if self.parent[node] == adj:\n continue\n if maxsize < self.size[adj]:\n maxsize = self.size[adj]\n self.next[node] = adj\n for adj in self.tree[node]:\n if self.parent[node] == adj or self.next[node] == adj:\n continue\n self.head[adj] = adj\n stack.append(adj)\n if self.next[node] is not None:\n self.head[self.next[node]] = self.head[node]\n stack.append(self.next[node])\n\n def range_hld(self, u, v, edge=False):\n res = []\n while True:\n if self.order[u] > self.order[v]:\n u, v = v, u\n if self.head[u] != self.head[v]:\n res.append((self.order[self.head[v]], self.order[v] + 1))\n v = self.parent[self.head[v]]\n else:\n res.append((self.order[u] + edge, self.order[v] + 1))\n return res\n\n def subtree_hld(self, u):\n return self.order[u], self.order[u] + self.size[u]\n\n def lca_hld(self, u, v):\n while True:\n if self.order[u] > self.order[v]:\n u, v = v, u\n if self.head[u] != self.head[v]:\n v = self.parent[self.head[v]]\n else:\n return u\n\n\nclass SegmentTree:\n def __init__(self, arr, func=min, ie=2**63):\n self.h = (len(arr) - 1).bit_length()\n self.n = 2**self.h\n self.ie = ie\n self.func = func\n self.tree = [ie for _ in range(2 * self.n)]\n for i in range(len(arr)):\n self.tree[self.n + i] = arr[i]\n for i in range(1, self.n)[::-1]:\n self.tree[i] = func(self.tree[2 * i], self.tree[2 * i + 1])\n\n def set(self, idx, x):\n idx += self.n\n self.tree[idx] = x\n while idx:\n idx >>= 1\n self.tree[idx] = self.func(self.tree[2 * idx], self.tree[2 * idx + 1])\n\n def query(self, lt, rt):\n lt += self.n\n rt += self.n\n vl = vr = self.ie\n while rt - lt > 0:\n if lt & 1:\n vl = self.func(vl, self.tree[lt])\n lt += 1\n if rt & 1:\n rt -= 1\n vr = self.func(self.tree[rt], vr)\n lt >>= 1\n rt >>= 1\n return self.func(vl, vr)\n\n\nimport sys\n\ninput = sys.stdin.readline\nN, u, v = list(map(int, input().split()))\nu -= 1\nv -= 1\nE = [tuple(map(int, input().split())) for _ in range(N - 1)]\nt = Tree(N, E)\nt.setroot(v)\nt.heavylight_decomposition()\nd = t.depth[u]\nk = (d + 1) // 2 - 1\nfor _ in range(k):\n u = t.parent[u]\narr = [None for _ in range(N)]\nfor i in range(N):\n arr[t.order[i]] = t.depth[i]\nst = SegmentTree(arr, max, -1)\nlt, rt = t.subtree_hld(u)\nmaxdep = st.query(lt, rt)\nprint((maxdep - 1))\n", "fast_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(1000000)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nmod = 10**9 + 7\ninf = float(\"inf\")\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\nn, V, U = LI()\nV -= 1\nU -= 1\nedges = [[] for _ in range(n)]\nfor _ in range(n - 1):\n a, b = LI()\n edges[a - 1].append(b - 1)\n edges[b - 1].append(a - 1)\nif n == 2:\n print((0))\nelse:\n depth_v = [None] * n\n depth_v[V] = 0\n que = deque()\n que.append(V)\n while que:\n v = que.popleft()\n for u in edges[v]:\n if depth_v[u] == None:\n depth_v[u] = depth_v[v] + 1\n que.append(u)\n depth_u = [None] * n\n depth_u[U] = 0\n que = deque()\n que.append(U)\n while que:\n u = que.popleft()\n for v in edges[u]:\n if depth_u[v] == None:\n depth_u[v] = depth_u[u] + 1\n que.append(v)\n ans = 0\n for v in range(n):\n if depth_v[v] < depth_u[v]:\n ans = max(ans, depth_u[v] - 1)\n print(ans)\n", "slow_time": 196965124, "fast_time": 61640718, "speedup": 3.1954, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_11"} +{"pair_id": "python_5464", "problem_id": "p03288", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\ninput = lambda: sys.stdin.readline().rstrip()\nYesNo = lambda b: bool([print(\"Yes\")] if b else print(\"No\"))\nYESNO = lambda b: bool([print(\"YES\")] if b else print(\"NO\"))\nint1 = lambda x: int(x) - 1\nR = int(input())\nif R >= 2800:\n print(\"AGC\")\nelif R >= 1200:\n print(\"ARC\")\nelse:\n print(\"ABC\")\n", "fast_code": "import sys\n\nri = lambda: int(sys.stdin.readline())\na = ri()\nif a < 1200:\n print(\"ABC\")\nelif a < 2800:\n print(\"ARC\")\nelse:\n print(\"AGC\")\n", "slow_time": 41475856, "fast_time": 17084681, "speedup": 2.4277, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_15"} +{"pair_id": "python_16328", "problem_id": "p03309", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\nN = INT()\nA = LIST()\n\n\ndef check(m):\n sm = 0\n for i, a in enumerate(A):\n sm += abs(a - (m + i + 1))\n return sm\n\n\nlow = -(10**9)\nhi = 10**9\nwhile low + 2 < hi:\n m1 = (low * 2 + hi) // 3\n m2 = (low + hi * 2) // 3\n res1 = check(m1)\n res2 = check(m2)\n\n if res1 <= res2:\n hi = m2\n else:\n low = m1\nprint((min(check(m1), check(m2))))\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\ntmp = []\nfor i in range(N):\n tmp.append(A[i] - (i + 1))\ntmp.sort()\nmid = tmp[int(N / 2)]\nans = 0\nfor i in range(N):\n ans += abs(tmp[i] - mid)\nprint(ans)\n", "slow_time": 198949924, "fast_time": 31926142, "speedup": 6.2316, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_1"} +{"pair_id": "python_11820", "problem_id": "p03579", "language": "python", "slow_code": "from networkx import *\n\nn, *t = list(map(str.split, open(0)))\nn, m = list(map(int, n))\ng = Graph()\ng.add_edges_from(t)\ntry:\n a, b = list(map(len, bipartite.sets(g)))\n a *= b\nexcept:\n a = n * ~-n // 2\nprint((a - m))\n", "fast_code": "import sys\n\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nMOD = 10**9 + 7\ninput = lambda: sys.stdin.readline().rstrip()\n\n\ndef resolve():\n n, m = list(map(int, input().split()))\n E = [[] for _ in range(n)]\n for i in range(m):\n u, v = list(map(int, input().split()))\n u -= 1\n v -= 1\n E[u].append(v)\n E[v].append(u)\n\n col = [-1] * n\n col[0] = 0\n Q = [0]\n while Q:\n v = Q.pop()\n for nv in E[v]:\n if col[v] == col[nv]:\n print((n * (n - 1) // 2 - m))\n return\n elif col[nv] != -1 and col[nv] ^ col[v]:\n continue\n col[nv] = 1 - col[v]\n Q.append(nv)\n\n even = col.count(0)\n odd = col.count(1)\n print((even * odd - m))\n\n\nresolve()\n", "slow_time": 18150154613, "fast_time": 75997011, "speedup": 238.8272, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_18"} +{"pair_id": "python_13237", "problem_id": "p02699", "language": "python", "slow_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nmod = 10**9 + 7\ninf = float(\"inf\")\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ns, w = LI()\nif w >= s:\n print(\"unsafe\")\nelse:\n print(\"safe\")\n", "fast_code": "S, W = input().split()\nif int(W) >= int(S):\n print(\"unsafe\")\nelse:\n print(\"safe\")\n", "slow_time": 41795967, "fast_time": 11428375, "speedup": 3.6572, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_20"} +{"pair_id": "python_13150", "problem_id": "p03698", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\ninf = 1 << 60\nmod = 1000000007\nni = lambda: int(ns())\nnin = lambda y: [ni() for _ in range(y)]\nna = lambda: list(map(int, stdin.readline().split()))\nnan = lambda y: [na() for _ in range(y)]\nnf = lambda: float(ns())\nnfn = lambda y: [nf() for _ in range(y)]\nnfa = lambda: list(map(float, stdin.readline().split()))\nnfan = lambda y: [nfa() for _ in range(y)]\nns = lambda: stdin.readline().rstrip()\nnsn = lambda y: [ns() for _ in range(y)]\nncl = lambda y: [list(ns()) for _ in range(y)]\nnas = lambda: stdin.readline().split()\nfrom collections import Counter\n\ns = ns()\nc = Counter(s)\nprint((\"yes\" if len(s) == len(c) else \"no\"))\n", "fast_code": "a = list(input())\nb = set(a)\nprint(\"yes\") if (len(a) == len(b)) else print(\"no\")\n", "slow_time": 100001071, "fast_time": 12604997, "speedup": 7.9334, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_2"} +{"pair_id": "python_6659", "problem_id": "p04014", "language": "python", "slow_code": "from collections import defaultdict, Counter\nfrom itertools import product, groupby, count, permutations, combinations\nfrom math import pi, sqrt, floor\nfrom collections import deque\nfrom bisect import bisect, bisect_left, bisect_right\nfrom string import ascii_lowercase\nfrom functools import lru_cache\nimport sys\n\nsys.setrecursionlimit(10000)\nINF = float(\"inf\")\nYES, Yes, yes, NO, No, no = \"YES\", \"Yes\", \"yes\", \"NO\", \"No\", \"no\"\ndy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]\ndy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]\n\n\ndef inside(y, x, H, W):\n return 0 <= y < H and 0 <= x < W\n\n\ndef ceil(a, b):\n return (a + b - 1) // b\n\n\ndef f(b, n):\n if n < b:\n return n\n return f(b, n // b) + n % b\n\n\ndef main():\n N = int(eval(input()))\n S = int(eval(input()))\n if N == S:\n print((N + 1))\n return\n if N < S:\n print((-1))\n return\n ans = INF\n for b in range(2, int(sqrt(N)) + 1):\n if f(b, N) == S:\n ans = min(ans, b)\n bs = set()\n t = N - S\n for i in range(1, int(sqrt(N)) + 1):\n if t % i == 0:\n bs.add(i + 1)\n bs.add((t // i) + 1)\n for b in bs:\n if b == 1:\n continue\n if f(b, N) == S:\n ans = min(ans, b)\n if ans == INF:\n print((-1))\n else:\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "def primeFactor(N):\n i = 2\n ret = {}\n n = N\n mrFlg = 0\n while i**2 <= n:\n k = 0\n while n % i == 0:\n n //= i\n k += 1\n ret[i] = k\n i += 1\n if i == 101 and n >= (2**20):\n\n def findFactorRho(N):\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return abs(a)\n\n def f(x, c):\n return ((x**2) + c) % N\n\n semi = [N]\n for c in range(1, 99):\n x, y, d = 2, 2, 1\n while d == 1:\n x = f(x, c)\n y = f(f(y, c), c)\n d = gcd(abs(x - y), N)\n if d != N:\n if isPrimeMR(d):\n return d\n elif isPrimeMR(N // d):\n return N // d\n else:\n semi.append(d)\n\n while True:\n if isPrimeMR(n):\n ret[n], n = 1, 1\n break\n else:\n mrFlg = 1\n j = findFactorRho(n)\n k = 0\n while n % j == 0:\n n //= j\n k += 1\n ret[j] = k\n if n == 1:\n break\n if n > 1:\n ret[n] = 1\n if mrFlg > 0:\n\n def dict_sort(X):\n Y = {}\n for x in sorted(X.keys()):\n Y[x] = X[x]\n return Y\n\n ret = dict_sort(ret)\n return ret\n\n\ndef isPrimeMR(n):\n if n == 2:\n return True\n if n == 1 or n & 1 == 0:\n return False\n d = (n - 1) >> 1\n while d & 1 == 0:\n d >>= 1\n for a in [2, 3, 5, 7, 11, 13, 17, 19, 23]:\n t = d\n y = pow(a, t, n)\n while t != n - 1 and y != 1 and y != n - 1:\n y = (y * y) % n\n t <<= 1\n if y != n - 1 and t & 1 == 0:\n return False\n return True\n\n\ndef divisors(N):\n pf = primeFactor(N)\n ret = [1]\n for p in pf:\n ret_prev = ret\n ret = []\n for i in range(pf[p] + 1):\n for r in ret_prev:\n ret.append(r * (p**i))\n return sorted(ret)\n\n\ndef f(b, n):\n re = 0\n while n:\n re += n % b\n n //= b\n return re\n\n\nN = int(eval(input()))\nS = int(eval(input()))\nif N < S:\n print((-1))\nelif N == S:\n print((N + 1))\nelse:\n for b in divisors(N - S):\n b += 1\n if f(b, N) == S:\n print(b)\n break\n else:\n print((-1))\n", "slow_time": 1525806412, "fast_time": 157911457, "speedup": 9.6624, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_5"} +{"pair_id": "python_14651", "problem_id": "p03649", "language": "python", "slow_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\n\n\ndef is_possible(C):\n res = 0\n for x in A:\n if x + C - N >= 0:\n res += (x + C - N) // (N + 1) + 1\n\n return int(res <= C)\n\n\nl = 0\nr = 10**30\nwhile r - l > 1:\n M = (l + r) // 2\n if is_possible(M) > 0:\n r = M\n else:\n l = M\nfor i in range(10**5, -1, -1):\n if is_possible(r - i):\n print((r - i))\n break\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nans = 0\nwhile any([a > N - 1 for a in A]):\n A.sort()\n d = A[-1] - (N - 1)\n k = -(-d // N)\n ans += k\n A[-1] -= k * N\n for i in range(N - 1):\n A[i] += k\nprint(ans)\n", "slow_time": 100454038038, "fast_time": 876176704, "speedup": 114.6504, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_0"} +{"pair_id": "python_177", "problem_id": "p03805", "language": "python", "slow_code": "import itertools\n\nn, m = list(map(int, input().split()))\nl = [[0] * n for i in range(n)]\nfor i in range(m):\n a, b = list(map(int, input().split()))\n l[a - 1][b - 1] = 1\n l[b - 1][a - 1] = 1\nd = [int(i) + 1 for i in range(n)]\nans = chk = 0\nfor i in list(itertools.permutations(d, n)):\n chk = 1\n if i[0] != 1:\n continue\n for j in range(n - 1):\n chk *= l[i[j + 1] - 1][i[j] - 1]\n ans += chk\nprint(ans)\n", "fast_code": "from collections import defaultdict\nimport itertools\n\nn, m = list(map(int, input().split()))\nconnected_dict = defaultdict(lambda: [])\nfor i in range(m):\n a, b = list(map(int, input().split()))\n connected_dict[a].append(b)\n connected_dict[b].append(a)\ncount = 0\nfor permutation in list(itertools.permutations(list(range(2, n + 1)))):\n flag = True\n pre_num = 1\n for num in permutation:\n if num not in connected_dict[pre_num]:\n flag = False\n break\n pre_num = num\n if flag:\n count += 1\nprint(count)\n", "slow_time": 6143449708, "fast_time": 782777284, "speedup": 7.8483, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_27"} +{"pair_id": "python_6922", "problem_id": "p03713", "language": "python", "slow_code": "H, W = list(map(int, input().split()))\n\n\ndef get_ans(A, B):\n ans = A * B\n for A1 in range(1, A):\n A2 = (A - A1) // 2\n A3 = A - A1 - A2\n S = [A1 * B, A2 * B, A3 * B]\n ans = min(ans, max(S) - min(S))\n for A1 in range(1, A):\n B2 = B // 2\n B3 = B - B2\n S = [A1 * B, (A - A1) * B2, (A - A1) * B3]\n ans = min(ans, max(S) - min(S))\n return ans\n\n\nprint((min(get_ans(H, W), get_ans(W, H))))\n", "fast_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST():\n return list(map(int, input().split()))\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = float(\"inf\")\nMOD = 10**9 + 7\nH, W = MAP()\nif H % 3 == 0 or W % 3 == 0:\n print((0))\n exit()\nH, W = max(H, W), min(H, W)\na = H // 3\nbc = H - a\nans1 = max(abs(bc * ceil(W, 2) - a * W), abs(bc * (W // 2) - a * W))\na = ceil(H, 3)\nbc = H - a\nans2 = max(abs(bc * ceil(W, 2) - a * W), abs(bc * (W // 2) - a * W))\nH, W = min(H, W), max(H, W)\na = H // 3\nbc = H - a\nans3 = max(abs(bc * ceil(W, 2) - a * W), abs(bc * (W // 2) - a * W))\na = ceil(H, 3)\nbc = H - a\nans4 = max(abs(bc * ceil(W, 2) - a * W), abs(bc * (W // 2) - a * W))\nans5 = abs(ceil(W, 3) * H - W // 3 * H)\nans6 = abs(ceil(H, 3) * W - H // 3 * W)\nprint((min(ans1, ans2, ans3, ans4, ans5, ans6)))\n", "slow_time": 55978952970, "fast_time": 134841246, "speedup": 415.1471, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_21"} +{"pair_id": "python_2968", "problem_id": "p03146", "language": "python", "slow_code": "s = int(eval(input()))\na = [s]\ni = 0\nwhile True:\n if a[i] % 2 == 0:\n a.append(int(a[i] / 2))\n i += 1\n else:\n a.append(int(3 * a[i] + 1))\n i += 1\n if [j for j in set(a) if a.count(j) > 1]:\n a_duplicate = sorted([j for j in set(a) if a.count(j) > 1], key=a.index)\n break\na[a.index(a_duplicate[0])] = 0\nprint((a.index((a_duplicate[0])) + 1))\n", "fast_code": "s = int(eval(input()))\na_list = [s]\ni = 0\nans = -1\nwhile ans == -1:\n if a_list[i] % 2 == 0:\n a_list.append(a_list[i] // 2)\n else:\n a_list.append(3 * a_list[i] + 1)\n i += 1\n for j in range(len(a_list) - 1):\n if a_list[i] == a_list[j]:\n ans = i\n break\nprint((ans + 1))\n", "slow_time": 983405746, "fast_time": 142367227, "speedup": 6.9075, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_4"} +{"pair_id": "python_9326", "problem_id": "p02792", "language": "python", "slow_code": "N = int(eval(input()))\ndigit = len(str(N))\nans = 0\nfor a in range(1, 10):\n for b in range(1, 10):\n x, y = 0, 0\n if a == b:\n if a <= N:\n x += 1\n y += 1\n if a * 10 + b <= N:\n x += 1\n if b * 10 + a <= N:\n y += 1\n if digit <= 2:\n ans += x * y\n continue\n d = 3\n while d < digit:\n x += 10 ** (d - 2)\n y += 10 ** (d - 2)\n d += 1\n for i in range(10 ** (digit - 2)):\n if int(str(a) + str(i).zfill(digit - 2) + str(b)) <= N:\n x += 1\n if int(str(b) + str(i).zfill(digit - 2) + str(a)) <= N:\n y += 1\n ans += x * y\nprint(ans)\n", "fast_code": "n = int(eval(input()))\nc = [[0] * 10 for i in range(10)]\nfor i in range(1, n + 1):\n t = str(i)\n c[int(t[0])][int(t[-1])] += 1\nans = 0\nfor i in range(10):\n for j in range(10):\n ans += c[i][j] * c[j][i]\nprint(ans)\n", "slow_time": 777891931, "fast_time": 138635891, "speedup": 5.611, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_5"} +{"pair_id": "python_14953", "problem_id": "p03212", "language": "python", "slow_code": "from itertools import product\n\nn = int(eval(input()))\ncnt = 0\nkazu = [3, 5, 7]\nfor j in range(3, 10):\n kumiawase = list(product(kazu, repeat=j))\n for kumi in kumiawase:\n suuji = \"\"\n for moji in kumi:\n suuji += str(moji)\n if \"3\" not in suuji:\n continue\n if \"5\" not in suuji:\n continue\n if \"7\" not in suuji:\n continue\n hantei = int(suuji)\n if hantei <= n:\n cnt += 1\nprint(cnt)\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\nN = int(eval(input()))\nans = 0\n\n\ndef check(s: str) -> bool:\n return \"3\" in s and \"5\" in s and \"7\" in s\n\n\ndef dfs(s: str) -> int:\n ret = 0\n if int(s) > N:\n return 0\n else:\n if check(s):\n ret += 1\n r3 = dfs(s + \"3\")\n r5 = dfs(s + \"5\")\n r7 = dfs(s + \"7\")\n ret += r3 + r5 + r7\n return ret\n\n\nprint((dfs(\"0\")))\n", "slow_time": 31806904162, "fast_time": 1568533929, "speedup": 20.2781, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_14"} +{"pair_id": "python_15557", "problem_id": "p02712", "language": "python", "slow_code": "N = int(eval(input()))\nprint((sum(n for n in range(1 + N) if n % 3 != 0 and n % 5 != 0)))\n", "fast_code": "def sum(N):\n return N * (N + 1) // 2\n\n\nN = int(eval(input()))\nprint((sum(N) - sum(N // 3) * 3 - sum(N // 5) * 5 + sum(N // 15) * 15))\n", "slow_time": 15158330495, "fast_time": 19614333, "speedup": 772.8191, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_4"} +{"pair_id": "python_18465", "problem_id": "p02676", "language": "python", "slow_code": "def N():\n return int(input())\n\n\ndef NM():\n return map(int, input().split())\n\n\ndef L():\n return list(NM())\n\n\ndef LN(n):\n return [N() for i in range(n)]\n\n\ndef LL(n):\n return [L() for i in range(n)]\n\n\ndef YesNo(x):\n print(\"Yes\") if x == True else print(\"No\")\n\n\nk = N()\ns = input()\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k] + \"...\")\n", "fast_code": "K = int(input())\nS = input()\nfor i, s in enumerate(S):\n if i == K:\n print(\"...\")\n break\n print(s, end=\"\")\nprint(\"\")\n", "slow_time": 49635108, "fast_time": 22267755, "speedup": 2.229, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_28"} +{"pair_id": "python_5048", "problem_id": "p03606", "language": "python", "slow_code": "n = int(eval(input()))\nseat = [0] * 10**6\nfor i in range(n):\n l, r = list(map(int, input().split()))\n for j in range(l, r + 1):\n seat[j - 1] = 1\nres = 0\nfor i in range(10**6):\n if seat[i] == 1:\n res += 1\nprint(res)\n", "fast_code": "n = int(eval(input()))\n\nseat = [0] * 10**5\nfor i in range(n):\n l, r = list(map(int, input().split()))\n for j in range(l, r + 1):\n seat[j - 1] = 1\nres = 0\n\nfor i in range(10**5):\n if seat[i] == 1:\n res += 1\nprint(res)\n", "slow_time": 40113578180, "fast_time": 4037627509, "speedup": 9.9349, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_4"} +{"pair_id": "python_13311", "problem_id": "p03860", "language": "python", "slow_code": "ls = input().split()\nLs = []\n\n\ndef fun():\n print(\"111\")\n print(\"222\")\n print(\"333\")\n print(\"ii\")\n\n\nfor i in ls:\n Ls.append(i[0])\nprint((\"\".join(Ls)))\n", "fast_code": "print((\"A%sC\" % input()[8]))\n", "slow_time": 21301645, "fast_time": 5431287, "speedup": 3.922, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_0"} +{"pair_id": "python_18432", "problem_id": "p03001", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef input_int():\n return int(eval(input()))\n\n\ndef input_int_list():\n return [int(i) for i in input().split()]\n\n\ndef main():\n w, h, x, y = input_int_list()\n area = (w * h) / 2\n bl = w == 2 * x and h == 2 * y\n print((area, 1 if bl else 0))\n return\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "W, H, X, Y = list(map(int, input().split()))\nif W / 2 == X and H / 2 == Y:\n f = 1\nelse:\n f = 0\nprint((W * H / 2, f))\n", "slow_time": 40034162, "fast_time": 16332926, "speedup": 2.4511, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_13"} +{"pair_id": "python_3425", "problem_id": "p02556", "language": "python", "slow_code": "input = __import__(\"sys\").stdin.readline\n\n\ndef getdist(a, b):\n return abs(a[0] - b[0]) + abs(a[1] - b[1])\n\n\nn = int(eval(input()))\ns = []\nfor _ in range(n):\n s.append([*list(map(int, input().split()))])\nans = 0\nsx = sorted(s)\nsy = sorted(s, key=lambda x: x[1])\nans = max(ans, getdist(sx[-1], sx[-2]))\nans = max(ans, getdist(sx[0], sx[1]))\nans = max(ans, getdist(sy[-1], sy[-2]))\nans = max(ans, getdist(sy[0], sy[1]))\n\n\ndef ff1(x):\n return x[0] + x[1]\n\n\ndef ff2(x):\n return x[0] - x[1]\n\n\nf1 = sorted(s, key=ff1)\nf2 = sorted(s, key=ff2)\nans = max(ans, getdist(f1[0], f1[-1]))\nans = max(ans, getdist(f1[0], f1[1]))\nans = max(ans, getdist(f1[-1], f1[-2]))\nans = max(ans, getdist(f2[0], f2[-1]))\nans = max(ans, getdist(f2[0], f2[1]))\nans = max(ans, getdist(f2[-1], f2[-2]))\n\n\ndef ff1(x):\n return abs(x[0] + x[1])\n\n\ndef ff2(x):\n return abs(x[0] - x[1])\n\n\nf1 = sorted(s, key=ff1)\nf2 = sorted(s, key=ff2)\nans = max(ans, getdist(f1[0], f1[-1]))\nans = max(ans, getdist(f1[0], f1[1]))\nans = max(ans, getdist(f1[-1], f1[-2]))\nans = max(ans, getdist(f2[0], f2[-1]))\nans = max(ans, getdist(f2[0], f2[1]))\nans = max(ans, getdist(f2[-1], f2[-2]))\nprint(ans)\n", "fast_code": "N = int(eval(input()))\nanswer = 0\nxylist = []\npxylist = []\nmxylist = []\nfor _ in range(N):\n x, y = list(map(int, input().split()))\n xylist.append((x, y))\n pxylist.append(x + y)\n mxylist.append(x - y)\npxylist.sort()\nmxylist.sort()\nanswer = max(pxylist[-1] - pxylist[0], mxylist[-1] - mxylist[0])\nprint(answer)\n", "slow_time": 146157102, "fast_time": 36596704, "speedup": 3.9937, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_9"} +{"pair_id": "python_3267", "problem_id": "p03354", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\n\n\nclass UnionFind:\n \"\"\"\"\"\"\n\n def __init__(self, n):\n self.n = n\n\n self.par = [i for i in range(n + 1)]\n\n self.rank = [0] * (n + 1)\n\n self.size = [1] * (n + 1)\n\n self.tree = [True] * (n + 1)\n\n def find(self, x):\n \"\"\"\"\"\"\n\n if self.par[x] == x:\n return x\n else:\n\n self.par[x] = self.find(self.par[x])\n return self.par[x]\n\n def union(self, x, y):\n \"\"\"\"\"\"\n\n x = self.find(x)\n y = self.find(y)\n\n if x == y:\n self.tree[x] = False\n return\n if not self.tree[x] or not self.tree[y]:\n self.tree[x] = self.tree[y] = False\n\n if self.rank[x] < self.rank[y]:\n self.par[x] = y\n self.size[y] += self.size[x]\n else:\n self.par[y] = x\n self.size[x] += self.size[y]\n\n if self.rank[x] == self.rank[y]:\n self.rank[x] += 1\n\n def is_same(self, x, y):\n \"\"\"\"\"\"\n return self.find(x) == self.find(y)\n\n def get_size(self, x=None):\n if x is not None:\n \"\"\"\"\"\"\n return self.size[self.find(x)]\n else:\n \"\"\"\"\"\"\n res = set()\n for i in range(self.n + 1):\n res.add(self.find(i))\n\n return len(res) - 1\n\n def is_tree(self, x):\n \"\"\"\"\"\"\n return self.tree[self.find(x)]\n\n\nN, M = MAP()\nA = LIST()\nuf = UnionFind(N)\nfor i in range(M):\n a, b = MAP()\n uf.union(a, b)\nans = 0\nfor i, a in enumerate(A):\n\n if uf.is_same(i + 1, a):\n ans += 1\nprint(ans)\n", "fast_code": "n, m = list(map(int, input().split()))\nf = lambda x: int(x) - 1\np = list(map(f, input().split()))\npar = [j for j in range(n)]\n\n\ndef find(x):\n if x == par[x]:\n return x\n else:\n par[x] = find(par[x])\n return par[x]\n\n\ndef union(a, b):\n ra = find(a)\n rb = find(b)\n if ra != rb:\n par[ra] = par[rb]\n\n\nfor i in range(m):\n v, w = list(map(f, input().split()))\n union(v, w)\nans = 0\nfor j in range(n):\n if find(j) == find(p[j]):\n ans += 1\nprint(ans)\n", "slow_time": 237950254, "fast_time": 67859685, "speedup": 3.5065, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_28"} +{"pair_id": "python_16282", "problem_id": "p03721", "language": "python", "slow_code": "import sys\n\nr = [0] * (100000 + 1)\nn, k = [int(x) for x in sys.stdin.readline().split()]\nfor i in range(n):\n a, b = [int(x) for x in sys.stdin.readline().split()]\n r[a] += b\nc = 0\nfor i, j in enumerate(r):\n c += j\n if c >= k:\n print(i)\n break\n", "fast_code": "import sys\nimport numpy as np\nimport collections\n\nn, k = [int(x) for x in sys.stdin.readline().split()]\nr = collections.defaultdict(int)\nfor i in range(n):\n a, b = [int(x) for x in sys.stdin.readline().split()]\n r[a] += b\nd = sorted(r.items())\nc = 0\nfor i, j in enumerate(d):\n c += j[1]\n if c >= k:\n print((int(j[0])))\n break\n", "slow_time": 225541028, "fast_time": 41328319, "speedup": 5.4573, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_0"} +{"pair_id": "python_11922", "problem_id": "p02549", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\nclass FenwickTree:\n def __init__(self, size):\n self.bit = [0] * (size + 1)\n self.size = size\n\n def sum(self, i):\n i += 1\n s = 0\n while i > 0:\n s += self.bit[i]\n s %= mod\n i -= i & -i\n return s\n\n def add(self, i, x):\n i += 1\n while i <= self.size:\n self.bit[i] += x\n self.bit[i] %= mod\n i += i & -i\n\n\nmod = 998244353\nN, K = list(map(int, input().split()))\nL, R = list(zip(*[list(map(int, input().split())) for _ in range(K)]))\ndp = FenwickTree(N + 1)\ndp.add(1, 1)\ndp.add(2, -1)\nfor i in range(1, N):\n x = dp.sum(i)\n for j in range(K):\n dp.add(i + L[j], x)\n if i + R[j] + 1 <= N:\n dp.add(i + R[j] + 1, -x)\nprint((dp.sum(N)))\n", "fast_code": "N, K = list(map(int, input().split()))\nMOD = 998244353\nlr = []\nfor _ in range(K):\n l, r = list(map(int, input().split()))\n lr.append((l, r))\nlr.sort()\ndp = [0] * (N + 1)\ndpsum = [0] * (N + 1)\ndp[1] = 1\ndpsum[1] = 1\n\n\nfor i in range(2, N + 1):\n\n for l, r in lr:\n\n li = max(i - r, 1)\n ri = i - l\n\n if ri < 1:\n continue\n dp[i] += dpsum[ri] - dpsum[li - 1]\n dp[i] %= MOD\n dpsum[i] = dpsum[i - 1] + dp[i]\nprint((dp[N]))\n", "slow_time": 166096985, "fast_time": 80417355, "speedup": 2.0654, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_6"} +{"pair_id": "python_6765", "problem_id": "p02319", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys\nfrom collections import namedtuple\n\nMAX_N, MAX_V = 100, 100\n\n\ndef solve():\n dp = [[float(\"inf\")] * (MAX_N * MAX_V + 1) for _ in range(MAX_N + 1)]\n dp[0][0] = 0\n for i, item in enumerate(item_list):\n v, w = item.value, item.weight\n for j in range(MAX_N * MAX_V + 1):\n if j < v:\n dp[i + 1][j] = dp[i][j]\n else:\n dp[i + 1][j] = min(dp[i][j], dp[i][j - v] + w)\n ans = 0\n for i in range(MAX_N * MAX_V + 1):\n if dp[c_items][i] <= real_cp:\n ans = i\n return ans\n\n\nif __name__ == \"__main__\":\n _input = sys.stdin.readlines()\n c_items, real_cp = list(map(int, _input[0].split()))\n items = [x.split() for x in _input[1:]]\n Item = namedtuple(\"Item\", (\"value\", \"weight\"))\n item_list = [Item(int(v), int(w)) for v, w in items]\n print((solve()))\n", "fast_code": "\"\"\"\"\"\"\n\nimport sys\nfrom collections import namedtuple\n\nMAX_V = 100\n\n\ndef solve():\n dp = [[float(\"inf\")] * (c_items * MAX_V + 1) for _ in range(c_items + 1)]\n dp[0][0] = 0\n for i, item in enumerate(item_list):\n v, w = item.value, item.weight\n for j in range(c_items * MAX_V + 1):\n if j < v:\n dp[i + 1][j] = dp[i][j]\n else:\n dp[i + 1][j] = min(dp[i][j], dp[i][j - v] + w)\n ans = 0\n for i in range(c_items * MAX_V + 1):\n if dp[c_items][i] <= knapsack_cp:\n ans = i\n return ans\n\n\nif __name__ == \"__main__\":\n _input = sys.stdin.readlines()\n c_items, knapsack_cp = list(map(int, _input[0].split()))\n items = [x.split() for x in _input[1:]]\n Item = namedtuple(\"Item\", (\"value\", \"weight\"))\n item_list = [Item(int(v), int(w)) for v, w in items]\n print((solve()))\n", "slow_time": 2625923279, "fast_time": 138508545, "speedup": 18.9586, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_1"} +{"pair_id": "python_8266", "problem_id": "p03352", "language": "python", "slow_code": "x = int(eval(input()))\nans = [b**p for b in range(1001) for p in range(2, 10) if b**p <= x]\nprint((max(ans)))\n", "fast_code": "import math\n\nX = int(eval(input()))\nres = 0\nfor b in range(1, int(math.sqrt(X)) + 1):\n for p in range(2, int(math.sqrt(X)) + 2):\n val = b**p\n if (val <= X) and (val > res):\n res = val\nprint(res)\n", "slow_time": 515973115, "fast_time": 69747498, "speedup": 7.3977, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_16"} +{"pair_id": "python_5996", "problem_id": "p03566", "language": "python", "slow_code": "def main():\n n = int(eval(input()))\n (*t,) = list(map(int, input().split()))\n tot = sum(t)\n (*v,) = list(map(int, input().split()))\n lim1 = []\n lim2 = [(1, 0, 0), (-1, tot, tot)]\n til = 0\n for t1, t2, v1 in zip([0] + t, t, v):\n lim1.append((til, til + t2, v1))\n lim2.append((-1, til, til + v1))\n lim2.append((1, til + t2, v1 - (til + t2)))\n til += t2\n\n def mi(time):\n ret = float(\"inf\")\n for l, r, lim in lim1:\n if l <= time <= r:\n ret = min(ret, lim)\n for f, tt, y in lim2:\n if f == -1 and time <= tt:\n ret = min(ret, y - time)\n if f == 1 and time >= tt:\n ret = min(ret, time + y)\n return ret\n\n print((sum(mi(i / 2) for i in range(tot * 2 + 1)) / 2))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "from sys import stdin\n\n\ndef solve(ts, vs):\n if len(ts) == 0:\n return 0.0\n time = sum(ts)\n limit = min(vs)\n if time / 2.0 <= limit:\n return (time / 2.0) ** 2\n\n if limit == 0:\n\n vzero = [i for i in range(len(vs)) if vs[i] == 0][0]\n return solve(ts[:vzero], vs[:vzero]) + solve(ts[vzero + 1 :], vs[vzero + 1 :])\n\n n = len(ts)\n ts[0] -= 1\n ts[n - 1] -= 1\n\n if ts[n - 1] == 0:\n ts = ts[: n - 1]\n vs = vs[: n - 1]\n if ts[0] == 0:\n ts = ts[1:]\n vs = vs[1:]\n\n vs = [v - 1 for v in vs]\n\n dist = time - 2 + 1\n return dist + solve(ts, vs)\n\n\ndef splitToInt(line):\n words = line.strip().split()\n return [int(w) for w in words]\n\n\nN = int(stdin.readline())\nts = splitToInt(stdin.readline())\nvs = splitToInt(stdin.readline())\nif len(ts) != N or len(vs) != N:\n raise\nprint(solve(ts, vs))\n", "slow_time": 505488132, "fast_time": 100116364, "speedup": 5.049, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_4"} +{"pair_id": "python_13976", "problem_id": "p03762", "language": "python", "slow_code": "import sys\nfrom itertools import accumulate\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\nN, M = MAP()\nA = LIST()\nB = LIST()\n\nA2 = []\nfor i in range(N - 1):\n A2.append(A[i + 1] - A[i])\nB2 = []\nfor i in range(M - 1):\n B2.append(B[i + 1] - B[i])\nA2 = [0] + list(accumulate(A2))\nB2 = [0] + list(accumulate(B2))\n\nlsm = rsm = 0\nfor i in range(N):\n lsm += A2[i] * (N - i - 1)\n rsm += A2[i] * i\n lsm %= MOD\n rsm %= MOD\nh = rsm - lsm\nlsm = rsm = 0\nfor i in range(M):\n lsm += B2[i] * (M - i - 1)\n rsm += B2[i] * i\n lsm %= MOD\n rsm %= MOD\nw = rsm - lsm\nans = h * w % MOD\nprint(ans)\n", "fast_code": "mod = 10**9 + 7\n\n\ndef mod_mul(a, b):\n return a * b % mod\n\n\nN, M = list(map(int, input().split()))\n(*x,) = list(map(int, input().split()))\n(*y,) = list(map(int, input().split()))\nsx = sum(mod_mul(_x, i - (N - 1 - i)) for i, _x in enumerate(x))\nsy = sum(mod_mul(_y, i - (M - 1 - i)) for i, _y in enumerate(y))\nprint((sx * sy % mod))\n", "slow_time": 159803774, "fast_time": 47602687, "speedup": 3.357, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_18"} +{"pair_id": "python_15799", "problem_id": "p03331", "language": "python", "slow_code": "x = int(eval(input()))\ncount = 10000\nfor a in range(1, x):\n suma = 0\n sumb = 0\n b = x - a\n while a > 0:\n suma += a % 10\n a = a // 10\n while b > 0:\n sumb += b % 10\n b = b // 10\n count = min(count, suma + sumb)\nprint(count)\n", "fast_code": "n = int(eval(input()))\nprint((10 if n in [10**x for x in range(6)] else sum(map(int, str(n)))))\n", "slow_time": 110311192, "fast_time": 18462413, "speedup": 5.9749, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_3"} +{"pair_id": "python_5171", "problem_id": "p03734", "language": "python", "slow_code": "N, W = list(map(int, input().split()))\nwvs = []\nfor i in range(N):\n w, v = list(map(int, input().split()))\n wvs.append((w, v))\n\nw0 = wvs[0][0]\ndp = [[[-1] * (330) for i in range(110)] for k in range(110)]\ndp[0][0][0] = 0\nfor i in range(N):\n w, v = wvs[i]\n dw = w - w0\n for j in range(i + 1):\n for k in range(310):\n\n if dp[i][j][j] == -1:\n continue\n dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k])\n dp[i + 1][j + 1][k + dw] = max(dp[i][j][k] + v, dp[i + 1][j + 1][k + dw])\nd = dp[N]\nans = 0\nfor j in range(N + 1):\n if W - j * w0 >= 0:\n a = max(d[j][: W - j * w0 + 1])\n ans = max(ans, a)\nprint(ans)\n", "fast_code": "def solve():\n from itertools import accumulate\n\n N, W = list(map(int, input().split()))\n e = tuple([] for _ in range(4))\n w1, v1 = list(map(int, input().split()))\n e[0].append(v1)\n for _ in range(N - 1):\n _w, _v = list(map(int, input().split()))\n e[_w - w1].append(_v)\n g = [None for _ in range(4)]\n for j in range(4):\n e[j].sort(reverse=True)\n g[j] = (0,) + tuple(accumulate(e[j]))\n ret = 0\n for a in range(len(e[0]) + 1):\n for b in range(len(e[1]) + 1):\n for c in range(len(e[2]) + 1):\n diff = W - (w1 * a + (w1 + 1) * b + (w1 + 2) * c)\n if diff < 0:\n break\n d = min(len(e[3]), diff // (w1 + 3))\n ret = max(ret, g[0][a] + g[1][b] + g[2][c] + g[3][d])\n return ret\n\n\nprint((solve()))\n", "slow_time": 7051948785, "fast_time": 91563579, "speedup": 77.017, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_20"} +{"pair_id": "python_16510", "problem_id": "p02763", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\nclass Bit:\n def __init__(self, n):\n self.size = n\n self.tree = [0] * (n + 1)\n\n def sum(self, i):\n if i == 0:\n return 0\n s = 0\n while i > 0:\n s += self.tree[i]\n i -= i & -i\n return s\n\n def add(self, i, x):\n while i <= self.size:\n self.tree[i] += x\n i += i & -i\n\n\naas = \"abcdefghijklmnopqrstuvwxyz\"\nN = int(input().strip())\nS = list(input().strip())\nQ = int(input().strip())\ncbt = dict()\nMX = 5 * 10**5 + 2\nfor c in aas:\n cbt[c] = Bit(MX)\n for i, a in enumerate(S):\n if a == c:\n cbt[c].add(i + 1, 1)\nfor _ in range(Q):\n t, i, c = input().split()\n t = int(t)\n if t == 1:\n i = int(i)\n if S[i - 1] != c:\n cbt[S[i - 1]].add(i, -1)\n cbt[c].add(i, 1)\n S[i - 1] = c\n else:\n\n l, r = int(i), int(c)\n\n s = 0\n for a in aas:\n bt = cbt[a]\n\n s += bt.sum(r) - bt.sum(l - 1) > 0\n print(s)\n", "fast_code": "def solve():\n import sys\n\n input = sys.stdin.readline\n ordA = ord(\"a\")\n N = int(eval(input()))\n Ss = input().strip()\n nos = [ord(S) - ordA for S in Ss]\n Q = int(eval(input()))\n idEle = 0\n\n def _binOpe(x, y):\n return x | y\n\n def makeSegTree(numEle):\n numPow2 = 2 ** (numEle - 1).bit_length()\n data = [idEle] * (2 * numPow2)\n return data, numPow2\n\n def setInit(As):\n for iST, A in enumerate(As, numPow2):\n data[iST] = A\n for iST in reversed(list(range(1, numPow2))):\n data[iST] = _binOpe(data[2 * iST], data[2 * iST + 1])\n\n def _update1(iA, A):\n iST = iA + numPow2\n data[iST] = A\n\n def update(iA, A):\n _update1(iA, A)\n iST = iA + numPow2\n while iST > 1:\n iST >>= 1\n data[iST] = _binOpe(data[2 * iST], data[2 * iST + 1])\n\n def getValue(iSt, iEn):\n L = iSt + numPow2\n R = iEn + numPow2\n ans = idEle\n while L < R:\n if L & 1:\n ans = _binOpe(ans, data[L])\n L += 1\n if R & 1:\n R -= 1\n ans = _binOpe(ans, data[R])\n L >>= 1\n R >>= 1\n return ans\n\n data, numPow2 = makeSegTree(N)\n As = [(1 << no) for no in nos]\n setInit(As)\n anss = []\n for _ in range(Q):\n tp, v1, v2 = input().split()\n if tp == \"1\":\n pos = int(v1) - 1\n c = ord(v2) - ordA\n update(pos, 1 << c)\n else:\n L, R = int(v1) - 1, int(v2) - 1\n v = getValue(L, R + 1)\n ans = bin(v).count(\"1\")\n anss.append(ans)\n print((\"\\n\".join(map(str, anss))))\n\n\nsolve()\n", "slow_time": 565348597, "fast_time": 154181809, "speedup": 3.6668, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_15"} +{"pair_id": "python_9390", "problem_id": "p02675", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\n\nINF = 10**13\nMOD = 10**9 + 7\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef lcm(x, y):\n return (x * y) // math.gcd(x, y)\n\n\ndef I():\n return int(input())\n\n\ndef LI():\n return [int(x) for x in input().split()]\n\n\ndef RI(N):\n return [int(input()) for _ in range(N)]\n\n\ndef LRI(N):\n return [[int(x) for x in input().split()] for _ in range(N)]\n\n\ndef LS():\n return input().split()\n\n\ndef RS(N):\n return [input() for _ in range(N)]\n\n\ndef LRS(N):\n return [input().split() for _ in range(N)]\n\n\ndef PL(L):\n print(*L, sep=\"\\n\")\n\n\ndef YesNo(B):\n print(\"Yes\" if B else \"No\")\n\n\ndef YESNO(B):\n print(\"YES\" if B else \"NO\")\n\n\nN = input()\nn = int(N[-1])\nif n in [2, 4, 5, 7, 9]:\n print(\"hon\")\nelif n in [0, 1, 6, 8]:\n print(\"pon\")\nelse:\n print(\"bon\")\n", "fast_code": "x = input()[-1]\nif x == \"3\":\n print(\"bon\")\nelif x in list(\"0168\"):\n print(\"pon\")\nelse:\n print(\"hon\")\n", "slow_time": 108680948, "fast_time": 13486655, "speedup": 8.0584, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_19"} +{"pair_id": "python_7813", "problem_id": "p02888", "language": "python", "slow_code": "from collections import defaultdict, deque, Counter, OrderedDict\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce, lru_cache\nfrom heapq import heappush, heappop, heapify\nimport itertools\nimport math, fractions\nimport sys, copy\n\n\ndef L():\n return sys.stdin.readline().split()\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef SL():\n return list(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI1():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef R(n):\n return [sys.stdin.readline().strip() for _ in range(n)]\n\n\ndef LR(n):\n return [L() for _ in range(n)]\n\n\ndef IR(n):\n return [I() for _ in range(n)]\n\n\ndef LIR(n):\n return [LI() for _ in range(n)]\n\n\ndef LIR1(n):\n return [LI1() for _ in range(n)]\n\n\ndef SR(n):\n return [SL() for _ in range(n)]\n\n\ndef LSR(n):\n return [LS() for _ in range(n)]\n\n\ndef perm(n, r):\n return math.factorial(n) // math.factorial(r)\n\n\ndef comb(n, r):\n return math.factorial(n) // (math.factorial(r) * math.factorial(n - r))\n\n\ndef make_list(n, *args, default=0):\n return (\n [make_list(*args, default=default) for _ in range(n)]\n if len(args) > 0\n else [default for _ in range(n)]\n )\n\n\ndire = [[1, 0], [0, 1], [-1, 0], [0, -1]]\ndire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]\nalphabets = \"abcdefghijklmnopqrstuvwxyz\"\nALPHABETS = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nMOD = 1000000007\nINF = float(\"inf\")\nsys.setrecursionlimit(1000000)\n\n\ndef main():\n N = I()\n L = sorted(LI())\n ans = 0\n for i in range(N):\n k = i\n for j in range(i + 1, N):\n while k < N and L[k] < L[i] + L[j]:\n k += 1\n ans += k - (j + 1)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import bisect\n\nn = int(eval(input()))\nl = sorted(list(map(int, input().split())))\nans = 0\nfor i in range(n - 2):\n for j in range(i + 1, n - 1):\n ans += bisect.bisect_left(l, l[i] + l[j]) - j - 1\nprint(ans)\n", "slow_time": 203845466, "fast_time": 29149513, "speedup": 6.9931, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_23"} +{"pair_id": "python_18470", "problem_id": "p02631", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\nfrom itertools import accumulate\nfrom functools import reduce\nfrom operator import xor, add\n\n\ndef read():\n N = int(input().strip())\n A = list(map(int, input().strip().split()))\n return N, A\n\n\ndef solve(N, A):\n S = reduce(xor, A)\n for a in A:\n print(S ^ a, end=\" \")\n\n\nif __name__ == \"__main__\":\n inputs = read()\n outputs = solve(*inputs)\n if outputs is not None:\n print(\"%s\" % str(outputs))\n", "fast_code": "n = int(input())\nA = list(map(int, input().split()))\nnum = 0\nfor i in A:\n num ^= i\nfor i in A:\n print(num ^ i, end=\" \")\n", "slow_time": 42064619, "fast_time": 18384754, "speedup": 2.288, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_1"} +{"pair_id": "python_2819", "problem_id": "p02264", "language": "python", "slow_code": "import time as ti\n\n\nclass MyQueue(object):\n \"\"\"\"\"\"\n\n def __init__(self):\n \"\"\"\"\"\"\n self.length = 50010\n self.queue = [0] * self.length\n\n self.head = 0\n self.tail = 0\n\n def enqueue(self, process):\n \"\"\"\"\"\"\n self.queue[self.tail] = process\n\n self.tail = (self.tail + 1) % self.length\n\n def dequeue(self):\n \"\"\"\"\"\"\n\n self.queue[self.head] = 0\n self.head = (self.head + 1) % self.length\n\n def is_empty(self):\n \"\"\"\"\"\"\n if self.head == self.tail:\n return True\n else:\n return False\n\n def is_full(self):\n \"\"\"\"\"\"\n if self.tail - self.head >= len(self.queue):\n return True\n else:\n return False\n\n\nclass Process(object):\n \"\"\"\"\"\"\n\n def __init__(self, name=\"\", time=0):\n \"\"\"\"\"\"\n self.name = name\n self.time = time\n\n def forward_time(self, time):\n \"\"\"\"\"\"\n self.time -= time\n return self.time\n\n\ndef time_forward(\n my_queue,\n interval,\n current_time,\n):\n \"\"\"\"\"\"\n value = my_queue.queue[my_queue.head].forward_time(interval)\n if value <= 0:\n current_time += interval + value\n print(my_queue.queue[my_queue.head].name, current_time)\n my_queue.dequeue()\n elif value > 0:\n current_time += interval\n\n my_queue.enqueue(my_queue.queue[my_queue.head])\n my_queue.dequeue()\n return current_time\n\n\nmy_queue = MyQueue()\nn, q = [int(x) for x in input().split()]\ncounter = 0\nwhile counter < n:\n name, time = input().split()\n my_queue.enqueue(Process(name, int(time)))\n counter += 1\n\ncurrent_time = 0\nwhile not my_queue.is_empty():\n current_time = time_forward(my_queue, q, current_time)\n", "fast_code": "from collections import deque\n\nn, q = list(map(int, input().split()))\nqueue = deque()\nfor i in range(n):\n name, time = input().split()\n queue.append((name, int(time)))\nt = 0\nwhile queue:\n name, time = queue.popleft()\n t += min(q, time)\n if time > q:\n queue.append((name, time - q))\n else:\n print((name, t))\n", "slow_time": 138359857, "fast_time": 37871035, "speedup": 3.6534, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_16"} +{"pair_id": "python_6661", "problem_id": "p04014", "language": "python", "slow_code": "from math import floor, sqrt\n\nINF = 10**20\n\n\ndef f(b, n):\n if n < b:\n return n\n else:\n return f(b, n // b) + (n % b)\n\n\ndef main():\n n = int(eval(input()))\n s = int(eval(input()))\n ans = INF\n\n if n == s:\n ans = min(ans, n + 1)\n\n for p in range(1, int(sqrt(n)) + 1):\n q = s - p\n b = (n - q) // p\n if 2 <= b and f(b, n) == s:\n ans = min(ans, b)\n\n for b in range(2, int(sqrt(n)) + 1):\n if f(b, n) == s:\n ans = min(ans, b)\n print((-1 if ans == INF else ans))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "def primeFactor(N):\n i = 2\n ret = {}\n n = N\n mrFlg = 0\n while i**2 <= n:\n k = 0\n while n % i == 0:\n n //= i\n k += 1\n ret[i] = k\n i += 1\n if i == 101 and n >= (2**20):\n\n def findFactorRho(N):\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return abs(a)\n\n def f(x, c):\n return ((x**2) + c) % N\n\n semi = [N]\n for c in range(1, 99):\n x, y, d = 2, 2, 1\n while d == 1:\n x = f(x, c)\n y = f(f(y, c), c)\n d = gcd(abs(x - y), N)\n if d != N:\n if isPrimeMR(d):\n return d\n elif isPrimeMR(N // d):\n return N // d\n else:\n semi.append(d)\n\n while True:\n if isPrimeMR(n):\n ret[n], n = 1, 1\n break\n else:\n mrFlg = 1\n j = findFactorRho(n)\n k = 0\n while n % j == 0:\n n //= j\n k += 1\n ret[j] = k\n if n == 1:\n break\n if n > 1:\n ret[n] = 1\n if mrFlg > 0:\n\n def dict_sort(X):\n Y = {}\n for x in sorted(X.keys()):\n Y[x] = X[x]\n return Y\n\n ret = dict_sort(ret)\n return ret\n\n\ndef isPrimeMR(n):\n if n == 2:\n return True\n if n == 1 or n & 1 == 0:\n return False\n d = (n - 1) >> 1\n while d & 1 == 0:\n d >>= 1\n for a in [2, 3, 5, 7, 11, 13, 17, 19, 23]:\n t = d\n y = pow(a, t, n)\n while t != n - 1 and y != 1 and y != n - 1:\n y = (y * y) % n\n t <<= 1\n if y != n - 1 and t & 1 == 0:\n return False\n return True\n\n\ndef divisors(N):\n pf = primeFactor(N)\n ret = [1]\n for p in pf:\n ret_prev = ret\n ret = []\n for i in range(pf[p] + 1):\n for r in ret_prev:\n ret.append(r * (p**i))\n return sorted(ret)\n\n\ndef f(b, n):\n re = 0\n while n:\n re += n % b\n n //= b\n return re\n\n\nN = int(eval(input()))\nS = int(eval(input()))\nif N < S:\n print((-1))\nelif N == S:\n print((N + 1))\nelse:\n for b in divisors(N - S):\n b += 1\n if f(b, N) == S:\n print(b)\n break\n else:\n print((-1))\n", "slow_time": 2534826177, "fast_time": 157911457, "speedup": 16.0522, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_5"} +{"pair_id": "python_3638", "problem_id": "p02786", "language": "python", "slow_code": "import sys\nimport math\nimport os\nimport itertools\nimport string\nimport heapq\nimport _collections\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nfrom functools import lru_cache\nimport bisect\nimport re\nimport queue\nimport copy\nimport decimal\n\n\nclass Scanner:\n @staticmethod\n def int():\n return int(sys.stdin.readline().rstrip())\n\n @staticmethod\n def string():\n return sys.stdin.readline().rstrip()\n\n @staticmethod\n def map_int():\n return [int(x) for x in Scanner.string().split()]\n\n @staticmethod\n def string_list(n):\n return [Scanner.string() for i in range(n)]\n\n @staticmethod\n def int_list_list(n):\n return [Scanner.map_int() for i in range(n)]\n\n @staticmethod\n def int_cols_list(n):\n return [Scanner.int() for i in range(n)]\n\n\ndef solve():\n N = Scanner.int()\n ans = 0\n tmp = 1\n while N > 1:\n ans += tmp\n tmp *= 2\n N //= 2\n ans += tmp\n print(ans)\n\n\ndef main():\n\n solve()\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "print((2 ** len(bin(int(eval(input())))) // 4 - 1))\n", "slow_time": 97773077, "fast_time": 10638346, "speedup": 9.1906, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_11"} +{"pair_id": "python_7611", "problem_id": "p03835", "language": "python", "slow_code": "K, S = list(map(int, input().split()))\nprint(([0 <= S - x - y <= K for x in range(K + 1) for y in range(K + 1)].count(True)))\n", "fast_code": "k, s = list(map(int, input().split()))\ncount = 0\nfor x in range(min(s + 1, k + 1)):\n for y in range(min(s + 1 - x, k + 1)):\n if 0 <= s - x - y <= k:\n count += 1\nprint(count)\n", "slow_time": 265950136, "fast_time": 49581919, "speedup": 5.3639, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_8"} +{"pair_id": "python_6780", "problem_id": "p03713", "language": "python", "slow_code": "def answer(H, W, ans):\n for x in range(1, W):\n y1 = H // 2\n Sa1 = H * x\n Sb1 = (W - x) * y1\n Sc1 = (W - x) * (H - y1)\n M = max(Sa1, Sb1, Sc1)\n m = min(Sa1, Sb1, Sc1)\n y2 = (W - x) // 2\n Sa2 = H * x\n Sb2 = H * y2\n Sc2 = H * (W - x - y2)\n M2 = max(Sa2, Sb2, Sc2)\n m2 = min(Sa2, Sb2, Sc2)\n if ans > min(M - m, M2 - m2):\n ans = min(M - m, M2 - m2)\n return ans\n\n\nif __name__ == \"__main__\":\n H, W = [int(i) for i in input().split()]\n ans = H * W\n ans = answer(H, W, ans)\n H, W = W, H\n if answer(H, W, ans) < ans:\n ans = answer(H, W, ans)\n print(ans)\n", "fast_code": "h, w = list(map(int, input().split()))\nif h % 3 == 0 or w % 3 == 0:\n print((0))\nelse:\n a = (h // 3 + 1) * w - (h - 1 - h // 3) * (w // 2)\n b = (h - h // 3) * (w - w // 2) - h // 3 * w\n c = min(h, w)\n h, w = w, h\n d = (h // 3 + 1) * w - (h - 1 - h // 3) * (w // 2)\n e = (h - h // 3) * (w - w // 2) - h // 3 * w\n print((min(a, b, c, d, e)))\n", "slow_time": 55092793362, "fast_time": 35436405, "speedup": 1554.6948, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_27"} +{"pair_id": "python_5365", "problem_id": "p02417", "language": "python", "slow_code": "a = [0] * 26\nw = \"abcdefghijklmnopqrstuvwxyz\"\ntry:\n while True:\n s = list(input().upper())\n for i in s:\n if i == \"A\":\n a[0] += 1\n elif i == \"B\":\n a[1] += 1\n elif i == \"C\":\n a[2] += 1\n elif i == \"D\":\n a[3] += 1\n elif i == \"E\":\n a[4] += 1\n elif i == \"F\":\n a[5] += 1\n elif i == \"G\":\n a[6] += 1\n elif i == \"H\":\n a[7] += 1\n elif i == \"I\":\n a[8] += 1\n elif i == \"J\":\n a[9] += 1\n elif i == \"K\":\n a[10] += 1\n elif i == \"L\":\n a[11] += 1\n elif i == \"M\":\n a[12] += 1\n elif i == \"N\":\n a[13] += 1\n elif i == \"O\":\n a[14] += 1\n elif i == \"P\":\n a[15] += 1\n elif i == \"Q\":\n a[16] += 1\n elif i == \"R\":\n a[17] += 1\n elif i == \"S\":\n a[18] += 1\n elif i == \"T\":\n a[19] += 1\n elif i == \"U\":\n a[20] += 1\n elif i == \"V\":\n a[21] += 1\n elif i == \"W\":\n a[22] += 1\n elif i == \"X\":\n a[23] += 1\n elif i == \"Y\":\n a[24] += 1\n elif i == \"Z\":\n a[25] += 1\nexcept EOFError:\n pass\nfor i in range(26):\n print((w[i : i + 1], \":\", str(a[i])))\n", "fast_code": "import sys, string\n\nlines = []\nfor line in sys.stdin:\n lines.append(line)\ntext = \"\".join(lines).lower()\nfor char in string.ascii_lowercase:\n print((\"{} : {}\".format(char, text.count(char))))\n", "slow_time": 119389800, "fast_time": 25020681, "speedup": 4.7716, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_2"} +{"pair_id": "python_6712", "problem_id": "p00070", "language": "python", "slow_code": "import sys\n\nK = 1024\nN = 331\nR = list(range(K))\nB = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]\nC = [0] * K\nD = [[0 for i in range(N)] for j in R]\n\n\ndef init():\n global C, D\n for i in R:\n s = format(i, \"b\")\n n = s.count(\"1\")\n C[i] = n\n if n == 1:\n D[i][B.index(i)] = 1\n else:\n for j in range(len(s)):\n if s[-j - 1] == \"1\":\n dp = n * j\n i2 = i - B[j]\n for k in range(N - dp):\n D[i][k + dp] += D[i2][k]\n return\n\n\ninit()\nfor a in sys.stdin:\n n, s = list(map(int, a.split()))\n x = 0\n if s < N:\n x = sum([D[i][s] for i in R if C[i] == n])\n print(x)\n", "fast_code": "def mx(ls, m):\n global n\n sum = 0\n for i in range(m):\n sum += (n - i) * ls[-i - 1]\n return sum\n\n\ndef mn(ls, m):\n global n\n sum = 0\n for i in range(m):\n sum += (n - i) * ls[i]\n return sum\n\n\ndef f(ls, m, s):\n global n\n count = 0\n if m > 0:\n vmx, vmn = mx(ls, m), mn(ls, m)\n if vmx < s or vmn > s:\n return 0\n elif vmx == s or vmn == s:\n return 1\n for i in range(len(ls)):\n lls = ls[:]\n a = (n - m + 1) * lls.pop(i)\n if s - a < 0:\n break\n else:\n count += f(lls, m - 1, s - a)\n return count\n else:\n return 1 if s == 0 else 0\n\n\nls = [i for i in range(10)]\nwhile True:\n try:\n n, s = list(map(int, input().split()))\n print(f(ls, n, s))\n except:\n break\n", "slow_time": 56673214149, "fast_time": 140551597, "speedup": 403.22, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_3"} +{"pair_id": "python_14851", "problem_id": "p02900", "language": "python", "slow_code": "def gcd(x, y):\n if x < y:\n x, y = y, x\n while y > 0:\n x, y = y, x % y\n return x\n\n\nINFTY = 10**6\nP = [1 for i in range(INFTY + 1)]\nP[0] = 0\nP[1] = 0\nfor i in range(2, int((INFTY + 1) ** 0.5) + 1):\n for j in range(i * i, INFTY + 1, i):\n P[j] = 0\nQ = []\nfor i in range(INFTY):\n if P[i] == 1:\n Q.append(i)\nA, B = list(map(int, input().split()))\nx = gcd(A, B)\ncnt = 1\nfor y in Q:\n if x % y == 0:\n cnt += 1\n while x % y == 0:\n x = x // y\nif x > 1:\n cnt += 1\nprint(cnt)\n", "fast_code": "import math\n\na, b = list(map(int, input().split()))\n\n\ndef factorization(n):\n arr = []\n tmp = n\n for i in range(2, int(n**0.5) + 1):\n while tmp % i == 0:\n tmp //= i\n arr.append(i)\n if tmp != 1:\n arr.append(tmp)\n if arr == []:\n arr.append(n)\n return list(set(arr))\n\n\nans = len(factorization(math.gcd(a, b)))\nprint((ans + 1 if math.gcd(a, b) != 1 else 1))\n", "slow_time": 293177338513, "fast_time": 42688358, "speedup": 6867.8523, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_28"} +{"pair_id": "python_14590", "problem_id": "p03183", "language": "python", "slow_code": "from sys import stdin, stdout, setrecursionlimit\nfrom collections import deque, defaultdict, Counter\nfrom heapq import heappush, heappop\nfrom functools import lru_cache\nimport math\n\nsetrecursionlimit(10**6)\nrl = lambda: stdin.readline()\nrll = lambda: stdin.readline().split()\nrli = lambda: list(map(int, stdin.readline().split()))\nrlf = lambda: list(map(float, stdin.readline().split()))\nINF, NINF = float(\"inf\"), float(\"-inf\")\nMOD = 10**9 + 7\n\n\ndef main():\n n = int(rl())\n A = []\n for _ in range(n):\n w, s, v = rli()\n A.append((w, s, v))\n ans = 0\n A.sort(key=lambda I: (I[0] + I[1]))\n maxs = 2 * 10**4 + 100\n dp = [0 for _ in range(maxs + 1)]\n for w, s, v in A:\n for i in range(maxs, -1, -1):\n if i - w < 0:\n continue\n if i - w > s:\n continue\n dp[i] = max(dp[i], dp[i - w] + v)\n ans = max(ans, dp[i])\n print(ans)\n stdout.close()\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\nn = int(eval(input()))\nblocks = []\nfor line in sys.stdin.readlines():\n w, s, v = list(map(int, line.split()))\n blocks.append((w + s, w, s, v))\nblocks.sort()\ndp = [-1] * 20001\ndp[0] = 0\nfor _, w, s, v in blocks:\n for i in range(s, -1, -1):\n if dp[i] == -1:\n continue\n dp[i + w] = max(dp[i + w], dp[i] + v)\nprint((max(dp)))\n", "slow_time": 5545721805, "fast_time": 839094136, "speedup": 6.6092, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_7"} +{"pair_id": "python_6746", "problem_id": "p02289", "language": "python", "slow_code": "import sys\n\n\ndef maxHeapify(A, i):\n l = i * 2 + 1\n r = i * 2 + 2\n if l < n:\n largest = l\n if r < n and A[r] > A[l]:\n largest = r\n if A[largest] > A[i]:\n A[i], A[largest] = A[largest], A[i]\n maxHeapify(A, largest)\n\n\ndef insert(S, k):\n global n\n S[n] = k\n n += 1\n i = n - 1\n p = (i - 1) // 2\n while i > 0 and S[i] > S[p]:\n S[i], S[p] = S[p], S[i]\n i = p\n p = (i - 1) // 2\n\n\ndef extractMax(S):\n global n\n if n == 1:\n n -= 1\n return S[0]\n ans = S[0]\n n -= 1\n S[0] = S[n]\n i = 0\n while True:\n l = i * 2 + 1\n r = i * 2 + 2\n if l >= n:\n break\n largest = l\n if r < n and A[r] > A[l]:\n largest = r\n if A[largest] > A[i]:\n A[i], A[largest] = A[largest], A[i]\n i = largest\n else:\n break\n return ans\n\n\nA = [0] * 2000000\nS = []\nn = 0\nfor s in sys.stdin:\n if s[2] == \"s\":\n insert(A, int(s[7:]))\n elif s[2] == \"t\":\n S.append(extractMax(A))\n else:\n break\nprint((\"\\n\".join(map(str, S))))\n", "fast_code": "import sys\nfrom heapq import heapify, heappush, heappop\n\nhq = []\nS = []\nfor s in sys.stdin:\n if s[2] == \"s\":\n heappush(hq, -int(s[7:]))\n elif s[2] == \"t\":\n S.append(-heappop(hq))\n else:\n break\nprint((\"\\n\".join(map(str, S))))\n", "slow_time": 170032903, "fast_time": 26220132, "speedup": 6.4848, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_3"} +{"pair_id": "python_10028", "problem_id": "p03222", "language": "python", "slow_code": "H, W, K = [int(_) for _ in input().split()]\nif W == 1:\n print((1))\nelse:\n\n def fib(j):\n if j == 0 or j == 1:\n return 1\n else:\n count = 0\n for num in range(2 ** (j - 1)):\n bit = str(bin(num))\n flag = 1\n for i in range(2, len(bit) - 1):\n if bit[i] == \"1\" and bit[i + 1] == \"1\":\n flag = 0\n count += flag\n return count\n\n dp = [[1] + [0] * (W - 1)]\n for j in range(1, H + 1):\n dp.append([0] * W)\n for i in range(W):\n if i == 0:\n dp[j][i] = (\n dp[j - 1][i] * fib(i) * fib(W - i - 1)\n + dp[j - 1][i + 1] * fib(i) * fib(W - i - 2)\n ) % 1000000007\n elif i == W - 1:\n dp[j][i] = (\n dp[j - 1][i] * fib(i) * fib(W - i - 1)\n + dp[j - 1][i - 1] * fib(i - 1) * fib(W - i - 1)\n ) % 1000000007\n else:\n dp[j][i] = (\n dp[j - 1][i] * fib(i) * fib(W - i - 1)\n + dp[j - 1][i + 1] * fib(i) * fib(W - i - 2)\n + dp[j - 1][i - 1] * fib(i - 1) * fib(W - i - 1)\n ) % 1000000007\n print((dp[H][K - 1]))\n", "fast_code": "H, W, K = [int(_) for _ in input().split()]\nMOD = 1000000007\npats = [[0]]\nfor i in range(1, W):\n pats = [p + [i] for p in pats] + [\n p[:-1] + [i, i - 1] for p in pats if p[-1] == i - 1\n ]\nrs = [1] + [0] * (W - 1)\nfor j in range(H):\n rs = [sum(rs[p[i]] for p in pats) % MOD for i in range(W)]\nprint((rs[K - 1]))\n", "slow_time": 373854200, "fast_time": 72095515, "speedup": 5.1855, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_1"} +{"pair_id": "python_6831", "problem_id": "p03713", "language": "python", "slow_code": "h, w = list(map(int, input().split()))\nf = lambda x: max(x) - min(x)\ng = lambda h, w: min(\n [\n min(\n f([i * w, ((h - i) // 2) * w, ((h - i) - (h - i) // 2) * w]),\n f([i * w, (h - i) * (w // 2), (h - i) * (w - w // 2)]),\n )\n for i in range(1, h)\n ]\n)\nprint((min(g(h, w), g(w, h))))\n", "fast_code": "h, w = list(map(int, input().split()))\nif h % 3 == 0 or w % 3 == 0:\n print((0))\nelse:\n ans = min(w, h)\n for w1 in range(w // 3, w // 3 + 3):\n s1 = w1 * h\n w2 = w - w1\n for h1 in range(h // 2, h // 2 + 2):\n s2 = w2 * h1\n s3 = w2 * (h - h1)\n ans = min(ans, max(s1, s2, s3) - min(s1, s2, s3))\n h, w = w, h\n for w1 in range(w // 3, w // 3 + 3):\n s1 = w1 * h\n w2 = w - w1\n for h1 in range(h // 2, h // 2 + 2):\n s2 = w2 * h1\n s3 = w2 * (h - h1)\n ans = min(ans, max(s1, s2, s3) - min(s1, s2, s3))\n print(ans)\n", "slow_time": 61347374653, "fast_time": 56687230, "speedup": 1082.208, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_24"} +{"pair_id": "python_5160", "problem_id": "p03734", "language": "python", "slow_code": "N, W = list(map(int, input().split()))\nwvs = []\nfor i in range(N):\n w, v = list(map(int, input().split()))\n wvs.append((w, v))\n\nw0 = wvs[0][0]\ndp = [[[-1] * (330) for i in range(110)] for k in range(110)]\ndp[0][0][0] = 0\nfor i in range(N):\n w, v = wvs[i]\n dw = w - w0\n for j in range(i + 1):\n for k in range(310):\n\n if dp[i][j][j] == -1:\n continue\n dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k])\n dp[i + 1][j + 1][k + dw] = max(dp[i][j][k] + v, dp[i + 1][j + 1][k + dw])\nd = dp[N]\nans = 0\nfor j in range(N + 1):\n if W - j * w0 >= 0:\n a = max(d[j][: W - j * w0 + 1])\n ans = max(ans, a)\nprint(ans)\n", "fast_code": "n, w = list(map(int, input().split()))\nw4 = [[] for i in range(4)]\nw1 = None\nfor i in range(n):\n ws, vs = list(map(int, input().split()))\n if i == 0:\n w1 = ws\n ws -= w1\n w4[ws].append(vs)\nfor i in range(4):\n w4[i].sort(reverse=True)\n tmp = [0]\n for j in w4[i]:\n tmp.append(tmp[-1] + j)\n w4[i] = tmp\nans = 0\nfor i in range(len(w4[0])):\n for j in range(len(w4[1])):\n for k in range(len(w4[2])):\n for l in range(len(w4[3])):\n if w >= w1 * (i + j + k + l) + j + 2 * k + 3 * l:\n ans = max(ans, w4[0][i] + w4[1][j] + w4[2][k] + w4[3][l])\nprint(ans)\n", "slow_time": 7051948785, "fast_time": 78435664, "speedup": 89.9074, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_27"} +{"pair_id": "python_16492", "problem_id": "p03796", "language": "python", "slow_code": "import sys\nimport os\nimport math\n\nMOD = 1000000007\n\n\ndef main():\n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"input.txt\", \"r\")\n N = int(sys.stdin.readline().rstrip())\n print((math.factorial(N) % MOD))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "n = int(eval(input()))\nans = 1\ni = 1\nwhile i < n + 1:\n ans *= i\n i += 1\n ans %= 10**9 + 7\nprint(ans)\n", "slow_time": 27015242522, "fast_time": 4624202633, "speedup": 5.8421, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_16"} +{"pair_id": "python_11913", "problem_id": "p02549", "language": "python", "slow_code": "mod = 998244353\n\n\nclass FenwickTree:\n def __init__(self, n, init_list=None):\n self.n = n\n self.data = [0] * n\n if init_list:\n assert n == len(init_list)\n for i in range(n):\n self.add(i, init_list[i])\n\n def add(self, i, val):\n assert 0 <= i < self.n\n i += 1\n while i <= self.n:\n self.data[i - 1] = (val + self.data[i - 1]) % mod\n i += i & -i\n\n def update(self, i, val):\n self.add(i, val - self.sum(i, i + 1))\n\n def sum(self, l, r):\n assert 0 <= l <= r <= self.n\n if l != 0:\n return (self.sum(0, r) - self.sum(0, l)) % mod\n ret = 0\n while r > 0:\n ret = (ret + self.data[r - 1]) % mod\n r -= r & -r\n return ret\n\n\nn, k = list(map(int, input().split()))\ns = []\nfor _ in range(k):\n l, r = list(map(int, input().split()))\n s.append((l, r))\nft = FenwickTree(n)\nft.add(0, 1)\nfor i in range(1, n):\n for l, r in s:\n jl = i - l\n jr = max(i - r, 0)\n if jl < 0:\n continue\n ft.add(i, ft.sum(jr, jl + 1) % mod)\nprint((ft.sum(n - 1, n) % mod))\n", "fast_code": "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nINF = 1 << 60\nMOD = 998244353\n\n\ndef main():\n N, K, *LR = list(map(int, read().split()))\n interval = [(l, r) for l, r in zip(*[iter(LR)] * 2)]\n dp = [0] * (N + 2)\n dp[1] = 1\n dp[2] = -1\n for i in range(1, N + 1):\n dp[i] = (dp[i] + dp[i - 1]) % MOD\n cur = dp[i]\n for l, r in interval:\n if i + l <= N:\n dp[i + l] += cur\n dp[min(i + r + 1, N + 1)] -= cur\n print((dp[N]))\n return\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 213589573, "fast_time": 66328330, "speedup": 3.2202, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_27"} +{"pair_id": "python_7705", "problem_id": "p02838", "language": "python", "slow_code": "mod = 1000000007\nans = 0\nn = int(eval(input()))\na = [int(i) for i in input().split()]\nx = [[0] * 63 for i in range(n + 1)]\nl = [(2**i) % mod for i in range(63)]\nfor i in range(n):\n d = a[i]\n cnt = 0\n for j in range(63):\n if d & 1:\n x[i + 1][cnt] = x[i][cnt] + 1\n else:\n x[i + 1][cnt] = x[i][cnt]\n cnt += 1\n d = d >> 1\nfor i in range(1, n):\n for j in range(63):\n p = x[i][j] - x[i - 1][j]\n if p:\n ans += l[j] * ((n - i) - (x[-1][j] - x[i][j]))\n else:\n ans += l[j] * (x[-1][j] - x[i][j])\n ans %= mod\nprint(ans)\n", "fast_code": "n = int(eval(input()))\na = list(map(int, input().split()))\nx = [0 for i in range(62)]\nfor i in range(n):\n b = bin(a[i])\n for i in range(len(b) - 2):\n if b[-1 - i] == \"1\":\n x[-i - 1] += 1\nmod = 10**9 + 7\nans = 0\ntwo = 1\nfor i in range(1, 62):\n ans = (ans + x[-i] * (n - x[-i]) * two) % mod\n two = two * 2 % mod\nprint(ans)\n", "slow_time": 280836259, "fast_time": 67740721, "speedup": 4.1458, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_4"} +{"pair_id": "python_6617", "problem_id": "p02770", "language": "python", "slow_code": "import sys, collections as cl, bisect as bs\n\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\nmod = 10**9 + 7\nMax = sys.maxsize\n\n\ndef l():\n return list(map(int, input().split()))\n\n\ndef m():\n return list(map(int, input().split()))\n\n\ndef onem():\n return int(eval(input()))\n\n\ndef s(x):\n a = []\n aa = x[0]\n su = 1\n for i in range(len(x) - 1):\n if aa != x[i + 1]:\n a.append([aa, su])\n aa = x[i + 1]\n su = 1\n else:\n su += 1\n a.append([aa, su])\n return a\n\n\ndef jo(x):\n return \" \".join(map(str, x))\n\n\ndef max2(x):\n return max(list(map(max, x)))\n\n\ndef In(x, a):\n k = bs.bisect_left(a, x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n\n\n\"\"\"\"\"\"\nmod = 10**9 + 7\nN = 10**5 * 2\n\n\ndef cmb(n, r):\n if r < 0 or r > n:\n return 0\n r = min(r, n - r)\n return g1[n] * g2[r] * g2[n - r] % mod\n\n\ndef p(n, r):\n if r < 0 or r > n:\n return 0\n return g1[n] * g2[n - r] % mod\n\n\ng1 = [1, 1]\ng2 = [1, 1]\ninverse = [0, 1]\nfor i in range(2, N + 1):\n g1.append((g1[-1] * i) % mod)\n inverse.append((-inverse[mod % i] * (mod // i)) % mod)\n g2.append((g2[-1] * inverse[-1]) % mod)\n\nimport fractions\nfrom functools import reduce\n\n\ndef gcd(*numbers):\n return reduce(fractions.gcd, numbers)\n\n\ndef gcd_list(numbers):\n return reduce(fractions.gcd, numbers)\n\n\ndef lcm_base(x, y):\n return (x * y) // fractions.gcd(x, y)\n\n\ndef lcm(*numbers):\n return reduce(lcm_base, numbers, 1)\n\n\ndef lcm_list(numbers):\n return reduce(lcm_base, numbers, 1)\n\n\nk, q = m()\nd = l()\nfor i in range(q):\n n, x, mm = m()\n co = 0\n po = []\n for j in range(k):\n po.append(d[j] % mm if d[j] % mm > 0 else mm)\n \"\"\"\"\"\"\n pp = sum(po) * ((n - 1) // k)\n pp += x\n for j in range((n - 1) % k):\n pp += po[j]\n co += (pp // mm) - (x // mm)\n print((n - co - 1))\n", "fast_code": "K, Q = list(map(int, input().split()))\nD = [int(a) for a in input().split()]\nfor _ in range(Q):\n N, X, M = list(map(int, input().split()))\n t = X % M\n for i in range(K):\n t += ((D[i] - 1) % M + 1) * ((N - i - 2) // K + 1)\n print((N - 1 - t // M))\n", "slow_time": 57561469129, "fast_time": 38484533, "speedup": 1495.704, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_3"} +{"pair_id": "python_4519", "problem_id": "p02830", "language": "python", "slow_code": "def main():\n import sys\n\n input = sys.stdin.readline\n sys.setrecursionlimit(10**7)\n from collections import Counter, deque\n\n from itertools import combinations, permutations, accumulate, groupby\n\n from bisect import bisect_left, bisect_right\n from heapq import heapify, heappop, heappush\n from math import floor, ceil\n\n n = int(eval(input()))\n s, t = input().rstrip().split()\n res = \"\"\n for i in range(n):\n res += s[i]\n res += t[i]\n print(res)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "n = int(eval(input()))\ns, t = input().split()\nlist = []\nfor i in range(n):\n list += s[i]\n list += t[i]\nprint((\"\".join(list)))\n", "slow_time": 42041715, "fast_time": 20199637, "speedup": 2.0813, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_1"} +{"pair_id": "python_12878", "problem_id": "p03549", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\np = 0.5**M\nq = 1 - p\ni = 0\nsum = 0\nwhile True:\n num = (i + 1) * (100 * (N - M) + 1900 * M) * p * (q**i)\n if num < 10 ** (-6):\n break\n sum += num\n i += 1\nprint((int(sum + 1)))\n", "fast_code": "N, M = list(map(int, input().split()))\ntime = 1900 * M + 100 * (N - M)\nprint((2**M * time))\n", "slow_time": 95463640, "fast_time": 12391237, "speedup": 7.7041, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_3"} +{"pair_id": "python_10595", "problem_id": "p02982", "language": "python", "slow_code": "n, d = list(map(int, input().split()))\nX = [list(map(int, input().split())) for _ in range(n)]\n\n\ndef dist_squere(x, y):\n d = 0\n for i, j in zip(x, y):\n d += (i - j) ** 2\n return d\n\n\nsquares = set([i * i for i in range(10000)])\n\n\ndef is_square(x):\n return x in squares\n\n\nfrom itertools import combinations\n\nans = 0\nfor x, y in combinations(X, 2):\n if is_square(dist_squere(x, y)):\n ans += 1\nprint(ans)\n", "fast_code": "n, d = list(map(int, input().split()))\nx = [list(map(int, input().split())) for i in range(n)]\nans = 0\n\n\ndef k(a, b):\n dist = 0\n for i in range(d):\n dist += (a[i] - b[i]) ** 2\n dist = dist ** (1 / 2)\n while dist > 0:\n dist -= 1\n if dist == 0:\n return True\n return False\n\n\nfor i in range(n):\n for j in range(i + 1, n):\n if k(x[i], x[j]):\n ans += 1\nprint(ans)\n", "slow_time": 242815463, "fast_time": 35223758, "speedup": 6.8935, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_3"} +{"pair_id": "python_6634", "problem_id": "p02770", "language": "python", "slow_code": "import sys, collections as cl, bisect as bs\n\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\nmod = 10**9 + 7\nMax = sys.maxsize\n\n\ndef l():\n return list(map(int, input().split()))\n\n\ndef m():\n return list(map(int, input().split()))\n\n\ndef onem():\n return int(eval(input()))\n\n\ndef s(x):\n a = []\n aa = x[0]\n su = 1\n for i in range(len(x) - 1):\n if aa != x[i + 1]:\n a.append([aa, su])\n aa = x[i + 1]\n su = 1\n else:\n su += 1\n a.append([aa, su])\n return a\n\n\ndef jo(x):\n return \" \".join(map(str, x))\n\n\ndef max2(x):\n return max(list(map(max, x)))\n\n\ndef In(x, a):\n k = bs.bisect_left(a, x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n\n\n\"\"\"\"\"\"\nmod = 10**9 + 7\nN = 10**5 * 2\n\n\ndef cmb(n, r):\n if r < 0 or r > n:\n return 0\n r = min(r, n - r)\n return g1[n] * g2[r] * g2[n - r] % mod\n\n\ndef p(n, r):\n if r < 0 or r > n:\n return 0\n return g1[n] * g2[n - r] % mod\n\n\ng1 = [1, 1]\ng2 = [1, 1]\ninverse = [0, 1]\nfor i in range(2, N + 1):\n g1.append((g1[-1] * i) % mod)\n inverse.append((-inverse[mod % i] * (mod // i)) % mod)\n g2.append((g2[-1] * inverse[-1]) % mod)\n\nimport fractions\nfrom functools import reduce\n\n\ndef gcd(*numbers):\n return reduce(fractions.gcd, numbers)\n\n\ndef gcd_list(numbers):\n return reduce(fractions.gcd, numbers)\n\n\ndef lcm_base(x, y):\n return (x * y) // fractions.gcd(x, y)\n\n\ndef lcm(*numbers):\n return reduce(lcm_base, numbers, 1)\n\n\ndef lcm_list(numbers):\n return reduce(lcm_base, numbers, 1)\n\n\nk, q = m()\nd = l()\nfor i in range(q):\n n, x, mm = m()\n co = 0\n po = []\n for j in range(k):\n\n po.append(d[j] % mm)\n for j in range(k):\n if po[j] == 0:\n ccc = (n - 1) // k\n if (n - 1) % k >= j + 1:\n ccc += 1\n co += ccc\n pp = sum(po) * ((n - 1) // k)\n pp += x\n for j in range((n - 1) % k):\n pp += po[j]\n co += (pp // mm) - (x // mm)\n print((n - co - 1))\n", "fast_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nmod = 10**9 + 7\ninf = float(\"inf\")\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\nk, q = LI()\nd = LI()\nnxm = [LI() for _ in range(q)]\nfor n, x, m in nxm:\n e = list([(x - 1) % m + 1 for x in d])\n f = list(accumulate(e))\n s = f[-1] * ((n - 1) // k)\n if (n - 1) % k != 0:\n s += f[(n - 1) % k - 1]\n tmp = (s + x % m) // m\n print((n - 1 - tmp))\n", "slow_time": 57571120536, "fast_time": 73722562, "speedup": 780.9159, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_8"} +{"pair_id": "python_5329", "problem_id": "p03997", "language": "python", "slow_code": "from collections import deque\nfrom heapq import heapify, heappop, heappush, heappushpop\nfrom copy import copy, deepcopy\nfrom itertools import product, permutations, combinations, combinations_with_replacement\nfrom collections import defaultdict, Counter\nfrom bisect import bisect_left, bisect_right\n\n\nfrom functools import reduce\nfrom pprint import pprint\n\nINF = float(\"inf\")\n\n\ndef myinput():\n return list(map(int, input().split()))\n\n\ndef mylistinput(n):\n return [list(myinput()) for _ in range(n)]\n\n\ndef mycol(data, col):\n return [row[col] for row in data]\n\n\ndef mysort(data, col, reverse_flag):\n data.sort(key=lambda x: x[col], reverse=reverse_flag)\n return data\n\n\ndef mymax(data):\n M = -1 * float(\"inf\")\n for i in range(len(data)):\n m = max(data[i])\n M = max(M, m)\n return M\n\n\ndef mymin(data):\n m = float(\"inf\")\n for i in range(len(data)):\n M = min(data[i])\n m = min(m, M)\n return m\n\n\ndef mycount(ls, x):\n\n l = bisect_left(ls, x)\n r = bisect_right(ls, x)\n return r - l\n\n\ndef myoutput(ls, space=True):\n if space:\n if len(ls) == 0:\n print(\" \")\n elif type(ls[0]) == str:\n print((\" \".join(ls)))\n elif type(ls[0]) == int:\n print((\" \".join(map(str, ls))))\n else:\n print(\"Output Error\")\n else:\n if len(ls) == 0:\n print(\"\")\n elif type(ls[0]) == str:\n print((\"\".join(ls)))\n elif type(ls[0]) == int:\n print((\"\".join(map(str, ls))))\n else:\n print(\"Output Error\")\n\n\na = int(eval(input()))\nb = int(eval(input()))\nh = int(eval(input()))\nans = (a + b) * h / 2\nprint((int(ans)))\n", "fast_code": "from collections import defaultdict\n\n\ndef main():\n a, b, h = int(eval(input())), int(eval(input())), int(eval(input()))\n print(((a + b) * h // 2))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 157783046, "fast_time": 27240219, "speedup": 5.7923, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_9"} +{"pair_id": "python_2238", "problem_id": "p03281", "language": "python", "slow_code": "n = int(eval(input()))\nl = []\ncount = 0\nfor h in range(n):\n for i in range(h + 1):\n if (h + 1) % (i + 1) == 0 and (h + 1) % 2 != 0:\n l.append(h + 1)\n if len(l) == 8:\n count += 1\n if len(l) != 8:\n l.clear()\nprint(count)\n", "fast_code": "def make_divisors(n):\n divisors = []\n for i in range(1, int(n**0.5) + 1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i:\n divisors.append(n // i)\n return len(divisors)\n\n\nn = int(eval(input()))\nans = 0\nfor i in range(1, n + 1, 2):\n if make_divisors(i) == 8:\n ans += 1\nprint(ans)\n", "slow_time": 118569525, "fast_time": 38652631, "speedup": 3.0676, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_18"} +{"pair_id": "python_3967", "problem_id": "p02607", "language": "python", "slow_code": "import sys\nfrom collections import deque\nimport numpy as np\nimport math\n\nsys.setrecursionlimit(10**6)\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef SL():\n return list(map(str, sys.stdin.readline().rstrip().split()))\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef IL():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef Main():\n n = I()\n a = list(IL())\n c = 0\n for rep in range(0, n, 2):\n if a[rep] % 2:\n c += 1\n print(c)\n return\n\n\nif __name__ == \"__main__\":\n Main()\n", "fast_code": "n = eval(input())\nans = 0\nfor i, j in enumerate(map(int, input().split())):\n ans += ~i & 1 and j & 1\nprint(ans)\n", "slow_time": 53007642, "fast_time": 18912831, "speedup": 2.8027, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_8"} +{"pair_id": "python_16503", "problem_id": "p02763", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\nclass Bit:\n def __init__(self, n):\n self.size = n\n self.tree = [0] * (n + 1)\n\n def sum(self, i):\n if i == 0:\n return 0\n s = 0\n while i > 0:\n s += self.tree[i]\n i -= i & -i\n return s\n\n def add(self, i, x):\n while i <= self.size:\n self.tree[i] += x\n i += i & -i\n\n\naas = \"abcdefghijklmnopqrstuvwxyz\"\nN = int(input().strip())\nS = list(input().strip())\nQ = int(input().strip())\ncbt = dict()\nMX = 5 * 10**5 + 2\nfor c in aas:\n cbt[c] = Bit(MX)\n for i, a in enumerate(S):\n if a == c:\n cbt[c].add(i + 1, 1)\nfor _ in range(Q):\n t, i, c = input().split()\n t = int(t)\n if t == 1:\n i = int(i)\n if S[i - 1] != c:\n cbt[S[i - 1]].add(i, -1)\n cbt[c].add(i, 1)\n S[i - 1] = c\n else:\n\n l, r = int(i), int(c)\n\n s = 0\n for a in aas:\n bt = cbt[a]\n\n s += bt.sum(r) - bt.sum(l - 1) > 0\n print(s)\n", "fast_code": "f = input\nn, s, q = int(f()), list(f()), int(f())\nd = {chr(97 + i): [] for i in range(26)}\nfor i in range(n):\n d[s[i]] += [i]\nfrom bisect import *\n\nfor i in range(q):\n a, b, c = f().split()\n b = int(b) - 1\n if a == \"1\":\n if s[b] == c:\n continue\n d[s[b]].pop(bisect(d[s[b]], b) - 1)\n s[b] = c\n insort(d[c], b)\n else:\n t = 0\n for l in list(d.values()):\n m = bisect(l, b - 1)\n if m < len(l) and l[m] < int(c):\n t += 1\n print(t)\n", "slow_time": 565348597, "fast_time": 70275052, "speedup": 8.0448, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_2"} +{"pair_id": "python_12011", "problem_id": "p02716", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nfrom bisect import bisect_left, bisect_right\nimport sys, random, itertools, math\n\nsys.setrecursionlimit(10**5)\ninput = sys.stdin.readline\nsqrt = math.sqrt\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef LF():\n return list(map(float, input().split()))\n\n\ndef LI_():\n return list([int(x) - 1 for x in input().split()])\n\n\ndef II():\n return int(eval(input()))\n\n\ndef IF():\n return float(eval(input()))\n\n\ndef S():\n return input().rstrip()\n\n\ndef LS():\n return S().split()\n\n\ndef IR(n):\n return [II() for _ in range(n)]\n\n\ndef LIR(n):\n return [LI() for _ in range(n)]\n\n\ndef FR(n):\n return [IF() for _ in range(n)]\n\n\ndef LFR(n):\n return [LI() for _ in range(n)]\n\n\ndef LIR_(n):\n return [LI_() for _ in range(n)]\n\n\ndef SR(n):\n return [S() for _ in range(n)]\n\n\ndef LSR(n):\n return [LS() for _ in range(n)]\n\n\nmod = 1000000007\ninf = float(\"INF\")\n\n\ndef solve():\n n = II()\n a = LI()\n if n == 3:\n print((max(a)))\n return\n dp = [[-inf] * 3 for i in range(n + 1)]\n dp[0] = [0, 0, 0]\n dp[1][0] = a[0]\n dp[2][1] = a[1]\n for i in range(3, n + 1):\n dp[i][0] = dp[i - 2][0] + a[i - 1]\n dp[i][1] = max(dp[i - 2][1], dp[i - 3][0]) + a[i - 1]\n dp[i][2] = max(dp[i - 2][2], dp[i - 3][1], dp[i - 4][0]) + a[i - 1]\n if n & 1:\n print((max(dp[-3][0], dp[-2][1], dp[-1][2])))\n else:\n print((max(dp[-1][1], dp[-2][0])))\n return\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "def main():\n from functools import lru_cache\n import sys\n\n sys.setrecursionlimit(10**7)\n inf = 2 * 10**14 + 1\n N = int(eval(input()))\n (*a,) = list(map(int, input().split()))\n\n @lru_cache(maxsize=None)\n def recursion(cur, need):\n \"\"\"\"\"\"\n if cur >= N:\n if need == 0:\n return 0\n else:\n return -inf\n rest = N - cur\n if (rest + 1) // 2 < need:\n return -inf\n return max(a[cur] + recursion(cur + 2, need - 1), recursion(cur + 1, need))\n\n ans = recursion(0, N // 2)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 192340601, "fast_time": 59761629, "speedup": 3.2185, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_20"} +{"pair_id": "python_15779", "problem_id": "p03331", "language": "python", "slow_code": "x = int(eval(input()))\ncount = 10000\nfor a in range(1, x):\n suma = 0\n sumb = 0\n b = x - a\n while a > 0:\n suma += a % 10\n a = a // 10\n while b > 0:\n sumb += b % 10\n b = b // 10\n count = min(count, suma + sumb)\nprint(count)\n", "fast_code": "n = int(eval(input()))\nif n % 10 == 0:\n print((10))\nelse:\n print((sum(map(int, list(str(n))))))\n", "slow_time": 110311192, "fast_time": 17095953, "speedup": 6.4525, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_7"} +{"pair_id": "python_15926", "problem_id": "p03599", "language": "python", "slow_code": "A, B, C, D, E, F = list(map(int, input().split()))\nw = set()\nfor i in range(F // (100 * A) + 1):\n t = F - 100 * i\n for j in range(t // (100 * B) + 1):\n a = (A * i + B * j) * 100\n w.add(a)\nw.remove(0)\ns = set()\nt = E * F // 100\nfor i in range(t // C + 1):\n for j in range(t // D + 1):\n b = C * i + D * j\n if b < t:\n s.add(b)\nbest_concentration = -1\nbest_a = -1\nbest_b = -1\nfor a in w:\n for b in sorted(s):\n if a + b > F:\n break\n if b > E * a // 100:\n break\n concentration = 100 * b / (a + b)\n if concentration > best_concentration:\n best_concentration = concentration\n best_a = a\n best_b = b\nprint((best_a + best_b, best_b))\n", "fast_code": "A, B, C, D, E, F = list(map(int, input().split()))\n\n\ndef FS():\n ans = (100 * A, 0)\n for a in range(0, F, 100 * A):\n for b in range(0, F, 100 * B):\n for c in range(0, F, C):\n for d in range(0, F, D):\n wat, sug = (a + b), (c + d)\n if wat == 0 or wat + sug > F or 100 * sug > E * wat:\n break\n elif 100 * sug == E * wat:\n return (wat, sug)\n elif sug * ans[0] > ans[1] * wat:\n ans = (wat, sug)\n return ans\n\n\nans = FS()\nprint((sum(ans), ans[1]))\n", "slow_time": 932624651, "fast_time": 134120810, "speedup": 6.9536, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_27"} +{"pair_id": "python_14638", "problem_id": "p00789", "language": "python", "slow_code": "N = 18\ntbl = [i**2 for i in range(0, N)]\ndp = [[0 for j in range(600)] for i in range(N)]\ndp[0][0] = 1\nfor i in range(1, N):\n for n in range(300):\n dp[i][n] += dp[i - 1][n]\n for j in range(tbl[i], 300, tbl[i]):\n dp[i][n + j] += dp[i - 1][n]\nwhile True:\n n = int(eval(input()))\n if n == 0:\n break\n print((dp[N - 1][n]))\n", "fast_code": "dp = [1] * 300\nfor i in range(2, 18):\n for j in range(i**2, 300):\n dp[j] += dp[j - i**2]\nwhile True:\n n = int(eval(input()))\n if n == 0:\n break\n print((dp[n]))\n", "slow_time": 13641756806, "fast_time": 312319986, "speedup": 43.6788, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_1"} +{"pair_id": "python_13363", "problem_id": "p02363", "language": "python", "slow_code": "def warshall_floyd(graph, edges):\n N = len(graph)\n inf = Infinity()\n for i in range(N):\n for j in range(N):\n if i == j:\n graph[i][j] = 0\n else:\n graph[i][j] = inf\n for e in edges:\n graph[e.source][e.destination] = e.weight\n for k in range(N):\n for i in range(N):\n for j in range(N):\n graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j])\n for k in range(N):\n for i in range(N):\n for j in range(N):\n if inf in (graph[i][j], graph[i][k], graph[k][j]):\n continue\n if graph[i][j] > graph[i][k] + graph[k][j]:\n raise NegativeCycleError\n\n\ndef main():\n V, E = list(map(int, input().split()))\n graph = [[None] * V for _ in range(V)]\n edges = []\n for _ in range(E):\n s, t, d = list(map(int, input().split()))\n edges.append(Edge(s, t, d))\n try:\n warshall_floyd(graph, edges)\n for g in graph:\n print(\" \".join(map(str, g)))\n except NegativeCycleError:\n print(\"NEGATIVE CYCLE\")\n\n\nclass Infinity(object):\n def __eq__(self, other):\n return other is self\n\n def __lt__(self, other):\n return False\n\n def __gt__(self, other):\n return True\n\n def __add__(self, other):\n return self\n\n def __radd__(self, other):\n return self\n\n def __str__(self):\n return \"INF\"\n\n __repr__ = __str__\n\n\nclass NegativeCycleError(Exception):\n pass\n\n\nclass Edge(object):\n def __init__(self, source, destination, weight):\n self.source = source\n self.destination = destination\n self.weight = weight\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "from sys import stdin\nfrom math import isinf\n\nn, e = list(map(int, stdin.readline().split()))\nd = [[float(\"inf\")] * n for _ in range(n)]\nfor i in range(n):\n d[i][i] = 0\nfor i in range(e):\n u, v, c = list(map(int, stdin.readline().split()))\n d[u][v] = c\nfor k in range(n):\n for i in range(n):\n for j in range(n):\n if d[i][j] > d[i][k] + d[k][j]:\n d[i][j] = d[i][k] + d[k][j]\nfor i in range(n):\n if d[i][i] < 0:\n print(\"NEGATIVE CYCLE\")\n exit(0)\nfor di in d:\n print((\" \".join((\"INF\" if isinf(dij) else str(dij) for dij in di))))\n", "slow_time": 187926799, "fast_time": 92047175, "speedup": 2.0416, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_5"} +{"pair_id": "python_9817", "problem_id": "p03806", "language": "python", "slow_code": "from itertools import permutations\nimport sys\n\nsys.setrecursionlimit(10**6)\nfrom bisect import *\nfrom collections import *\nfrom heapq import *\n\n\ndef II():\n return int(sys.stdin.readline())\n\n\ndef MI():\n return map(int, sys.stdin.readline().split())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef SI():\n return sys.stdin.readline()[:-1]\n\n\ndef LLI(rows_number):\n return [LI() for _ in range(rows_number)]\n\n\nint1 = lambda x: int(x) - 1\n\n\ndef MI1():\n return map(int1, sys.stdin.readline().split())\n\n\ndef LI1():\n return list(map(int1, sys.stdin.readline().split()))\n\n\np2D = lambda x: print(*x, sep=\"\\n\")\ndij = [(1, 0), (0, 1), (-1, 0), (0, -1)]\n\n\ndef main():\n inf = 10**9\n n, ma, mb = MI()\n vv = []\n cc = []\n for _ in range(n):\n a, b, c = MI()\n vv.append(a * mb - b * ma)\n cc.append(c)\n dp = [[inf] * 8005 for _ in range(n + 1)]\n for i in range(n):\n v, c = vv[i], cc[i]\n dp[i + 1][4000 + v] = min(dp[i + 1][4000 + v], c)\n for j in range(8005):\n pre = dp[i][j]\n if pre == inf:\n continue\n dp[i + 1][j] = min(dp[i + 1][j], pre)\n dp[i + 1][j + v] = min(dp[i + 1][j + v], pre + c)\n ans = dp[-1][4000]\n if ans == inf:\n print(-1)\n else:\n print(ans)\n\n\nmain()\n", "fast_code": "import sys\n\ninput = lambda: sys.stdin.readline().rstrip()\nsys.setrecursionlimit(max(1000, 10**9))\nwrite = lambda x: sys.stdout.write(x + \"\\n\")\nn, ma, mb = list(map(int, input().split()))\nabc = [None] * n\nfor i in range(n):\n a, b, c = tuple(map(int, input().split()))\n abc[i] = (a * mb - b * ma, c)\nabc.sort()\n\n\ndef halfcomb(l):\n n = len(l)\n n1 = n // 2\n n2 = (n + 1) // 2\n l1 = []\n l2 = []\n for b in range(1, 1 << n2):\n v11, v12 = 0, 0\n v21, v22 = 0, 0\n for i in range(n2):\n if b & 1 << i:\n item = l[n1 + i]\n v21 += item[0]\n v22 += item[1]\n if b < (1 << n1) and i < n1:\n item = l[i]\n v11 += item[0]\n v12 += item[1]\n if b < (1 << n1):\n l1.append((v11, v12))\n l2.append((v21, v22))\n return l1, l2\n\n\nl1, l2 = halfcomb(abc)\nd2 = {}\nfor v, c in l2:\n if v in d2:\n d2[v] = min(d2[v], c)\n else:\n d2[v] = c\nans = float(\"inf\")\nfor v, c in l1:\n if v == 0:\n ans = min(ans, c)\nfor v, c in l2:\n if v == 0:\n ans = min(ans, c)\nfor v, c in l1:\n if -v in d2:\n ans = min(ans, c + d2[-v])\nif ans == float(\"inf\"):\n ans = -1\nprint(ans)\n", "slow_time": 340450294, "fast_time": 71119908, "speedup": 4.787, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_23"} +{"pair_id": "python_5495", "problem_id": "p02392", "language": "python", "slow_code": "import sys\n\nif __name__ == \"__main__\":\n import doctest\n\n doctest.testmod()\n a, b, c = list(map(int, sys.stdin.read().split()))\n if a < b < c:\n print(\"Yes\")\n else:\n print(\"No\")\n", "fast_code": "input = list(map(int, input().split()))\na = input[0]\nb = input[1]\nc = input[2]\nif a < b and b < c:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 3028838454, "fast_time": 17916304, "speedup": 169.0549, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_4"} +{"pair_id": "python_14209", "problem_id": "p00114", "language": "python", "slow_code": "from functools import reduce\n\n\ndef f(a, b):\n p, q = a, b\n while q != 0:\n p, q = q, p % q\n return a / p * b\n\n\nwhile 1:\n x = list(map(int, input().split()))\n if any(x) == 0:\n break\n A = []\n for i in range(0, 6, 2):\n c = 1\n while pow(x[i], c, x[i + 1]) != 1:\n c += 1\n A.append(c)\n x = reduce(lambda a, b: f(a, b), A)\n print(x)\n", "fast_code": "def gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a % b)\n\n\ndef rooptimes(ai, mi):\n x = ai % mi\n i = 1\n while x != 1:\n x = ai * x % mi\n i += 1\n return i\n\n\nwhile True:\n a = list(map(int, input().split()))\n if a.count(0) == 6:\n break\n ix = rooptimes(a[0], a[1])\n iy = rooptimes(a[2], a[3])\n iz = rooptimes(a[4], a[5])\n ixy = ix * iy // gcd(ix, iy)\n print((ixy * iz // gcd(ixy, iz)))\n", "slow_time": 1215695347, "fast_time": 198067977, "speedup": 6.1378, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_3"} +{"pair_id": "python_15115", "problem_id": "p02948", "language": "python", "slow_code": "n, m = list(map(int, input().split()))\nab = [[] for _ in range(10**5)]\nfor i in range(n):\n a, b = list(map(int, input().split()))\n a -= 1\n ab[a].append(b)\nimport heapq\n\nq = []\nheapq.heapify(q)\nans = 0\nfor i in range(m):\n if len(ab[i]) != 0:\n for j in range(len(ab[i])):\n heapq.heappush(q, -1 * ab[i][j])\n if len(q) != 0:\n ans += -1 * heapq.heappop(q)\nprint(ans)\n", "fast_code": "import heapq\n\n\nclass Heapq:\n def __init__(self, arr, desc=False):\n if desc:\n arr = [-a for a in arr]\n self.sign = -1 if desc else 1\n self.hq = arr\n heapq.heapify(self.hq)\n\n def pop(self):\n return heapq.heappop(self.hq) * self.sign\n\n def push(self, a):\n heapq.heappush(self.hq, a * self.sign)\n\n def top(self):\n return self.hq[0] * self.sign\n\n def size(self):\n return len(self.hq)\n\n\nN, M = list(map(int, input().split()))\nD = {i: [] for i in range(1, M + 1)}\nfor i in range(N):\n a, b = list(map(int, input().split()))\n if a > M:\n continue\n D[a].append(b)\nq = Heapq([], True)\nans = 0\nfor a in range(1, M + 1):\n for b in D[a]:\n q.push(b)\n if q.size() > 0:\n ans += q.pop()\nprint(ans)\n", "slow_time": 3133712263, "fast_time": 89085164, "speedup": 35.1766, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_28"} +{"pair_id": "python_12926", "problem_id": "p03549", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\np = 0.5**M\nq = 1 - p\ni = 0\nsum = 0\nwhile True:\n num = (i + 1) * (100 * (N - M) + 1900 * M) * p * (q**i)\n if num < 10 ** (-6):\n break\n sum += num\n i += 1\nprint((int(sum + 1)))\n", "fast_code": "N, M = list(map(int, input().split()))\nt = 1900 * M + 100 * (N - M)\np = 1 / ((1 / 2) ** M)\nprint((int(t * p)))\n", "slow_time": 95463640, "fast_time": 15127050, "speedup": 6.3108, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_12"} +{"pair_id": "python_6629", "problem_id": "p02770", "language": "python", "slow_code": "import sys, collections as cl, bisect as bs\n\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\nmod = 10**9 + 7\nMax = sys.maxsize\n\n\ndef l():\n return list(map(int, input().split()))\n\n\ndef m():\n return list(map(int, input().split()))\n\n\ndef onem():\n return int(eval(input()))\n\n\ndef s(x):\n a = []\n aa = x[0]\n su = 1\n for i in range(len(x) - 1):\n if aa != x[i + 1]:\n a.append([aa, su])\n aa = x[i + 1]\n su = 1\n else:\n su += 1\n a.append([aa, su])\n return a\n\n\ndef jo(x):\n return \" \".join(map(str, x))\n\n\ndef max2(x):\n return max(list(map(max, x)))\n\n\ndef In(x, a):\n k = bs.bisect_left(a, x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n\n\n\"\"\"\"\"\"\nmod = 10**9 + 7\nN = 10**5 * 2\n\n\ndef cmb(n, r):\n if r < 0 or r > n:\n return 0\n r = min(r, n - r)\n return g1[n] * g2[r] * g2[n - r] % mod\n\n\ndef p(n, r):\n if r < 0 or r > n:\n return 0\n return g1[n] * g2[n - r] % mod\n\n\ng1 = [1, 1]\ng2 = [1, 1]\ninverse = [0, 1]\nfor i in range(2, N + 1):\n g1.append((g1[-1] * i) % mod)\n inverse.append((-inverse[mod % i] * (mod // i)) % mod)\n g2.append((g2[-1] * inverse[-1]) % mod)\n\nimport fractions\nfrom functools import reduce\n\n\ndef gcd(*numbers):\n return reduce(fractions.gcd, numbers)\n\n\ndef gcd_list(numbers):\n return reduce(fractions.gcd, numbers)\n\n\ndef lcm_base(x, y):\n return (x * y) // fractions.gcd(x, y)\n\n\ndef lcm(*numbers):\n return reduce(lcm_base, numbers, 1)\n\n\ndef lcm_list(numbers):\n return reduce(lcm_base, numbers, 1)\n\n\nk, q = m()\nd = l()\nfor i in range(q):\n n, x, mm = m()\n co = 0\n po = []\n for j in range(k):\n po.append(d[j] % mm if d[j] % mm > 0 else mm)\n \"\"\"\"\"\"\n pp = sum(po) * ((n - 1) // k)\n pp += x\n for j in range((n - 1) % k):\n pp += po[j]\n co += (pp // mm) - (x // mm)\n print((n - co - 1))\n", "fast_code": "def solve():\n from itertools import islice, tee\n\n k, q = map(int, input().split())\n (*d,) = map(int, input().split())\n for g in tee(d, q):\n n, x, m = map(int, input().split())\n g = map(lambda x: x % m, g)\n g1, g2, g3 = tee(g, 3)\n rep, rest = divmod(n - 1, k)\n last = x + (sum(g1) * rep) + sum(islice(g2, 0, rest))\n eq = sum(rep + (1 if i < rest else 0) for i, gg in enumerate(g3) if gg == 0)\n ans = (n - 1) - eq - (last // m - x // m)\n yield ans\n\n\ndef main():\n print(*solve(), sep=\"\\n\")\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 57561469129, "fast_time": 70556674, "speedup": 815.8189, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_1"} +{"pair_id": "python_17403", "problem_id": "p02834", "language": "python", "slow_code": "from collections import defaultdict, deque, Counter, OrderedDict\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce, lru_cache\nfrom heapq import heappush, heappop, heapify\nimport itertools\nimport math, fractions\nimport sys, copy\n\n\ndef L():\n return sys.stdin.readline().split()\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef SL():\n return list(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI1():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef IR(n):\n return [I() for _ in range(n)]\n\n\ndef LIR(n):\n return [LI() for _ in range(n)]\n\n\ndef LIR1(n):\n return [LI1() for _ in range(n)]\n\n\ndef SR(n):\n return [SL() for _ in range(n)]\n\n\ndef LSR(n):\n return [LS() for _ in range(n)]\n\n\ndef LR(n):\n return [L() for _ in range(n)]\n\n\ndef perm(n, r):\n return math.factorial(n) // math.factorial(r)\n\n\ndef comb(n, r):\n return math.factorial(n) // (math.factorial(r) * math.factorial(n - r))\n\n\ndef make_list(n, *args, default=0):\n return (\n [make_list(*args, default=default) for _ in range(n)]\n if len(args) > 0\n else [default for _ in range(n)]\n )\n\n\ndef parent_children(start, g):\n parent, children, depth, q = (\n [-1] * len(g),\n make_list(len(g), 0),\n [-1] * len(g),\n deque([start]),\n )\n depth[start] = 0\n while q:\n i = q.popleft()\n for j in g[i]:\n if depth[j] != -1:\n parent[i] = j\n else:\n depth[j] = depth[i] + 1\n children[i].append(j), q.append(j)\n return parent, children, depth\n\n\ndef adjacency_list(N, edges):\n g = make_list(N, 0)\n for a, b in edges:\n g[a].append(b), g[b].append(a)\n return g\n\n\nsys.setrecursionlimit(1000000)\ndire, dire8 = [[1, 0], [0, 1], [-1, 0], [0, -1]], [\n [1, 0],\n [1, 1],\n [0, 1],\n [-1, 1],\n [-1, 0],\n [-1, -1],\n [0, -1],\n [1, -1],\n]\nalphabets, ALPHABETS = \"abcdefghijklmnopqrstuvwxyz\", \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nMOD, INF = 1000000007, float(\"inf\")\n\n\ndef main():\n N, u, v = LI()\n AB = LIR1(N - 1)\n max_dist = [None] * N\n g = adjacency_list(N, AB)\n parent, children, depth = parent_children(v - 1, g)\n\n def dfs(i):\n dist = max([0] + [dfs(j) for j in children[i]])\n max_dist[i] = dist\n return dist + 1\n\n mid = u - 1\n for _ in range((depth[u - 1] - 1) // 2):\n mid = parent[mid]\n dfs(mid)\n print((depth[mid] + max_dist[mid] - 1))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "def bfs(p):\n stack = [p]\n check = [-1] * n\n check[p] = 0\n while len(stack):\n v = stack.pop()\n for i in root[v]:\n if check[i] == -1:\n check[i] = check[v] + 1\n stack.append(i)\n return check\n\n\nn, u, v = list(map(int, input().split()))\nu -= 1\nv -= 1\nroot = [[] for i in range(n)]\nfor _ in range(n - 1):\n a, b = (int(x) for x in input().split())\n root[b - 1].append(a - 1)\n root[a - 1].append(b - 1)\nmove_count_u = bfs(u)\nmove_count_v = bfs(v)\nans = 0\nfor i in range(n):\n if move_count_u[i] < move_count_v[i]:\n ans = max(move_count_v[i] - 1, ans)\nprint(ans)\n", "slow_time": 140582903, "fast_time": 40643082, "speedup": 3.459, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_19"} +{"pair_id": "python_14054", "problem_id": "p02244", "language": "python", "slow_code": "from sys import stdin\nfrom itertools import permutations as per\n\n\ndef check(queen):\n for r1, c1 in queen:\n if not all(\n (r1 == r2 and c1 == c2) or (r1 + c1 != r2 + c2 and r1 - c1 != r2 - c2)\n for r2, c2 in queen\n ):\n return False\n return True\n\n\nk = int(stdin.readline())\nR, C = [[i for i in range(8)] for _ in range(2)]\nq = []\nfor _ in range(k):\n r, c = list(map(int, stdin.readline().split()))\n q.append((r, c))\n R.remove(r)\n C.remove(c)\nfor l in per(C):\n q_tmp = q[:] + [(r, c) for r, c in zip(R, l)]\n if check(q_tmp):\n for i, j in sorted(q_tmp):\n print((\".\" * j + \"Q\" + \".\" * (8 - j - 1)))\n break\n", "fast_code": "row = [False] * 8\ncol = [False] * 8\ndpos = [False] * 15\ndneg = [False] * 15\nboard = [[\".\", \".\", \".\", \".\", \".\", \".\", \".\", \".\"] for i in range(8)]\nimport sys\n\nfile_input = sys.stdin\nk = int(file_input.readline())\nfor line in file_input:\n r, c = list(map(int, line.split()))\n row[r] = True\n col[c] = True\n dpos[r + c] = True\n dneg[r - c + 7] = True\n board[r][c] = \"Q\"\n\n\ndef dfs(i=0):\n if i == 8:\n for line in board:\n print((\"\".join(line)))\n elif row[i]:\n dfs(i + 1)\n else:\n for j in range(8):\n if col[j] or dpos[i + j] or dneg[i - j + 7]:\n continue\n row[i] = True\n col[j] = True\n dpos[i + j] = True\n dneg[i - j + 7] = True\n board[i][j] = \"Q\"\n dfs(i + 1)\n row[i] = False\n col[j] = False\n dpos[i + j] = False\n dneg[i - j + 7] = False\n board[i][j] = \".\"\n\n\ndfs()\n", "slow_time": 419773437, "fast_time": 98153700, "speedup": 4.2767, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_9"} +{"pair_id": "python_9120", "problem_id": "p03837", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\nN, M = list(map(int, input().split()))\nABC = [list(map(int, input().split())) for _ in range(M)]\ng = [[0 for _ in range(N)] for _ in range(N)]\nfor a, b, c in ABC:\n g[a - 1][b - 1] = c\nfrom scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall\n\ncsg = csgraph_from_dense(g)\nd = floyd_warshall(csg, directed=False)\nans = 0\nfor a, b, c in ABC:\n if c != d[a - 1][b - 1]:\n ans += 1\nprint(ans)\n", "fast_code": "from collections import defaultdict\nimport heapq\n\n\ndef main():\n node_num, edge_num = list(map(int, input().split()))\n data = [list(map(int, input().split())) for i in range(edge_num)]\n graph_data = defaultdict(set)\n weight_data = defaultdict(int)\n for i in range(edge_num):\n a, b, c = data[i]\n graph_data[a].add(b)\n graph_data[b].add(a)\n weight_data[(a, b)] = c\n weight_data[(b, a)] = c\n\n inf = 10**5 + 1\n length_data = [[inf for i in range(node_num + 1)] for j in range(node_num + 1)]\n for i in range(1, node_num + 1):\n visit_flg = [0 for i in range(node_num + 1)]\n visit_flg[i] = 1\n length_data[i][i] = 0\n\n heap_list = []\n for ele in graph_data[i]:\n weight = weight_data[(i, ele)]\n heapq.heappush(heap_list, (weight, ele, i))\n while len(heap_list) > 0:\n now_weight, now_ele, pre_ele = heapq.heappop(heap_list)\n\n if visit_flg[now_ele]:\n continue\n visit_flg[now_ele] = 1\n length_data[i][now_ele] = (\n length_data[i][pre_ele] + weight_data[(pre_ele, now_ele)]\n )\n\n for next_ele in graph_data[now_ele]:\n if visit_flg[next_ele]:\n continue\n next_weight = weight_data[(now_ele, next_ele)] + length_data[i][now_ele]\n heapq.heappush(heap_list, (next_weight, next_ele, now_ele))\n\n ans = 0\n for i in range(edge_num):\n a, b, c = data[i]\n if c > length_data[a][b]:\n ans += 1\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 14541236116, "fast_time": 72981998, "speedup": 199.2441, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_1"} +{"pair_id": "python_691", "problem_id": "p03244", "language": "python", "slow_code": "def main():\n n, *v = list(map(int, open(0).read().split()))\n be = [0] * int(1e5)\n bo = [0] * int(1e5)\n for e, o in zip(*[iter(v)] * 2):\n be[e - 1] += 1\n bo[o - 1] += 1\n if be.index(max(be)) == bo.index(max(bo)):\n ve = max(be)\n vo = max(bo)\n be[be.index(ve)] = 0\n bo[bo.index(vo)] = 0\n print((min(n - ve - max(bo), n - vo - max(be))))\n else:\n print((n - max(be) - max(bo)))\n return\n\n\nmain()\n", "fast_code": "import collections as coll\n\nn = int(eval(input()))\nv = list(map(int, input().split()))\neven = v[0::2]\nodd = v[1::2]\noddc = coll.Counter(odd).most_common()[:2]\nevenc = coll.Counter(even).most_common()[:2]\nif len(oddc) == 1:\n oddc.append((0, 0))\nif len(evenc) == 1:\n evenc.append((0, 0))\nif oddc[0][0] != evenc[0][0]:\n print((n - oddc[0][1] - evenc[0][1]))\nelse:\n print((min(n - oddc[0][1] - evenc[1][1], n - oddc[1][1] - evenc[0][1])))\n", "slow_time": 2695635546, "fast_time": 57579385, "speedup": 46.816, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_14"} +{"pair_id": "python_6762", "problem_id": "p00467", "language": "python", "slow_code": "for e in iter(input, \"0 0\"):\n N, M = list(map(int, e.split()))\n k, p = 1, 0\n S = [int(eval(input())) for _ in [0] * N]\n for d in [int(eval(input())) for _ in [0] * M]:\n p += d if N <= p + d else d + S[p + d]\n if N <= p + 1:\n break\n k += 1\n print(k)\n", "fast_code": "def s():\n import sys\n\n r = sys.stdin.readline\n for e in iter(r, \"0 0\\n\"):\n N, M = list(map(int, e.split()))\n k, p = 1, 0\n S = [int(r()) for _ in [0] * N]\n for d in [int(r()) for _ in [0] * M]:\n p += d if N <= p + d else d + S[p + d]\n if N <= p + 1:\n break\n k += 1\n print(k)\n\n\nif \"__main__\" == __name__:\n s()\n", "slow_time": 112051390, "fast_time": 41733555, "speedup": 2.6849, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_1"} +{"pair_id": "python_18532", "problem_id": "p03409", "language": "python", "slow_code": "num = 201\n\n\ndef dfs(cur):\n global vis\n global EE\n vis[cur] = 1\n if cur == num:\n return 1\n for i in range(num + 1):\n if vis[i] == 0 and EE[cur][i] > 0 and dfs(i) > 0:\n EE[cur][i] -= 1\n EE[i][cur] += 1\n return 1\n return 0\n\n\nn = int(eval(input()))\ns = []\nss = []\nfor i in range(n):\n s.append([int(i) for i in input().split()])\nfor i in range(n):\n ss.append([int(i) for i in input().split()])\ns.sort(key=lambda x: (x[0], x[1]))\nss.sort(key=lambda x: (x[0], x[1]))\npair = []\nfor i in range(len(s)):\n right = []\n for j in range(n):\n if s[j][0] < ss[i][0] and s[j][1] < ss[i][1]:\n right.append(j)\n pair.append(right)\npair.sort(key=lambda x: len(x))\n\n\nEE = [[0 for x in range(num + 1)] for y in range(num + 11)]\nvis = [0] * (num + 1)\nfor i in range(len(pair)):\n EE[0][i + 1] = 1\n EE[i + 1][0] = 1\nfor i in range(n):\n EE[i + 101][num] = 1\nfor i in range(len(pair)):\n for j in range(len(pair[i])):\n node1, node2 = i + 1, pair[i][j] + 101\n\n EE[node1][node2] = 1\n\nflow = 0\nwhile 1:\n for i in range(0, num + 1):\n vis[i] = 0\n if dfs(0) == 0:\n break\n flow += 1\nprint(flow)\n", "fast_code": "from operator import itemgetter\n\n\ndef main():\n N = int(eval(input()))\n ab = [tuple(int(j) for j in input().split()) for i in range(N)]\n cd = [tuple(int(j) for j in input().split()) for i in range(N)]\n\n ab.sort(key=itemgetter(1), reverse=True)\n\n cd.sort(key=itemgetter(0))\n ans = 0\n for bx, by in cd:\n for rx, ry in ab:\n if rx < bx and ry < by:\n ab.remove((rx, ry))\n ans += 1\n break\n print(ans)\n return\n\n\nmain()\n", "slow_time": 579236453, "fast_time": 64637519, "speedup": 8.9613, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_29"} +{"pair_id": "python_8842", "problem_id": "p03371", "language": "python", "slow_code": "A, B, C, X, Y = list(map(int, input().split()))\nans = A * X + B * Y\nfor k in range(2 * max(X, Y) + 1):\n ans = min(ans, 2 * C * k + A * max(0, X - k) + B * max(0, Y - k))\nprint(ans)\n", "fast_code": "import math\n\nA, B, C, X, Y = list(map(int, input().split()))\ncost = []\ncost.append(A * X + B * Y)\nfor i in range(2 * min(X, Y), 2 * max(X, Y) + 1):\n cost.append(\n C * i + max(0, math.ceil(X - i / 2) * A) + max(0, math.ceil(Y - i / 2) * B)\n )\nprint((min(cost)))\n", "slow_time": 2119044393, "fast_time": 265456712, "speedup": 7.9826, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_18"} +{"pair_id": "python_3599", "problem_id": "p02934", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef S():\n return eval(input())\n\n\ndef main():\n n = I()\n l = LI()\n sm = 0\n for x in l:\n sm += 1 / x\n return 1 / sm\n\n\nprint((main()))\n", "fast_code": "def inpl():\n return list(map(int, input().split()))\n\n\nN = int(eval(input()))\nprint((1 / sum([1 / v for v in inpl()])))\n", "slow_time": 79645167, "fast_time": 21355077, "speedup": 3.7296, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_20"} +{"pair_id": "python_13834", "problem_id": "p02956", "language": "python", "slow_code": "import sys\n\nreadline = sys.stdin.readline\n\n\nclass BIT:\n\n def __init__(self, n):\n self.size = n\n self.tree = [0] * (n + 1)\n self.p = 2 ** (n.bit_length() - 1)\n self.dep = n.bit_length()\n\n def get(self, i):\n s = 0\n while i > 0:\n s += self.tree[i]\n i -= i & -i\n return s\n\n def add(self, i, x):\n while i <= self.size:\n self.tree[i] += x\n i += i & -i\n\n def bl(self, v):\n if v <= 0:\n return -1\n s = 0\n k = self.p\n for _ in range(self.dep):\n if s + k <= self.size and self.tree[s + k] < v:\n s += k\n v -= self.tree[s + k]\n k //= 2\n return s + 1\n\n\ndef compress(L):\n L2 = list(set(L))\n L2.sort()\n C = {v: k for k, v in enumerate(L2)}\n return L2, C\n\n\nMOD = 998244353\nN = int(readline())\nXY = [list(map(int, readline().split())) for _ in range(N)]\nXY.sort()\nZ = [-(10**10)]\nfor x, y in XY:\n Z.append(y)\n_, CC = compress(Z)\nXY = [(x, CC[y]) for x, y in XY]\nSS, SB, BS, BB = [None] * N, [None] * N, [None] * N, [None] * N\nT = BIT(N)\nfor i in range(N):\n k = i\n y = XY[i][1]\n l = T.get(y)\n SS[i] = l\n SB[i] = k - l\n T.add(y, 1)\nT = BIT(N)\nfor i in range(N - 1, -1, -1):\n k = N - 1 - i\n y = XY[i][1]\n l = T.get(y)\n BS[i] = l\n BB[i] = k - l\n T.add(y, 1)\nP2 = [1] * 1341398\nfor i in range(1, len(P2)):\n P2[i] = P2[i - 1] * 2 % MOD\nans = 0\nfor i in range(N):\n ss = SS[i]\n sb = SB[i]\n bs = BS[i]\n bb = BB[i]\n ans = (ans + P2[N - 1]) % MOD\n ans = (ans + P2[N - 1 - ss - bb] * (P2[ss] - 1) * (P2[bb] - 1)) % MOD\n ans = (ans + P2[N - 1 - sb - bs] * (P2[sb] - 1) * (P2[bs] - 1)) % MOD\n ans = (ans - (P2[sb] - 1) * (P2[bs] - 1) * (P2[ss] - 1) * (P2[bb] - 1)) % MOD\nprint(ans)\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**7)\nMOD = 998244353\nN = int(eval(input()))\nXY = [[int(x) for x in input().split()] for _ in range(N)]\nXY.sort()\nX, Y = list(zip(*XY))\nY_rank = {x: i for i, x in enumerate(sorted(Y), 1)}\n\n\ndef BIT_update(tree, x):\n while x <= N:\n tree[x] += 1\n x += x & (-x)\n\n\ndef BIT_sum(tree, x):\n ret = 0\n while x:\n ret += tree[x]\n x -= x & (-x)\n return ret\n\n\npow2 = [1]\nfor _ in range(N):\n pow2.append(pow2[-1] * 2 % MOD)\nanswer = 0\ntree = [0] * (N + 1)\nfor L, (x, y) in enumerate(XY):\n y = Y_rank[y]\n R = N - 1 - L\n D = y - 1\n U = N - 1 - D\n LD = BIT_sum(tree, y)\n BIT_update(tree, y)\n LU = L - LD\n RD = D - LD\n RU = R - RD\n\n cnt = pow2[N]\n cnt -= pow2[L]\n cnt -= pow2[R]\n cnt -= pow2[D]\n cnt -= pow2[U]\n cnt += pow2[LD]\n cnt += pow2[LU]\n cnt += pow2[RD]\n cnt += pow2[RU]\n cnt -= 1\n answer += cnt\nanswer %= MOD\nprint(answer)\n", "slow_time": 123554763668, "fast_time": 110527029, "speedup": 1117.8692, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_4"} +{"pair_id": "python_13690", "problem_id": "p03774", "language": "python", "slow_code": "from scipy.spatial.distance import cdist\nimport numpy as np\n\nn, m = list(map(int, input().split()))\nst = [list(map(int, input().split())) for _ in range(n)]\ncp = [list(map(int, input().split())) for _ in range(m)]\n\n\ncd = cdist(st, cp, \"cityblock\")\nidx = np.argmin(cd, axis=1)\nfor i in idx:\n print((i + 1))\n", "fast_code": "import numpy as np\n\nn, m = map(int, input().split())\nab = []\nfor _ in range(n):\n a, b = map(int, input().split())\n ab.append((a, b))\nresult = np.zeros([m, n], dtype=np.int64)\ncd = []\nfor i in range(m):\n c, d = map(int, input().split())\n for j, (a, b) in enumerate(ab):\n result[i, j] = abs(a - c) + abs(b - d)\nprint(*result.argmin(axis=0) + 1, sep=\"\\n\")\n", "slow_time": 29997139149, "fast_time": 50967546, "speedup": 588.5537, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_9"} +{"pair_id": "python_16193", "problem_id": "p03721", "language": "python", "slow_code": "import sys\n\nr = [0] * 100000\nn, k = [int(x) for x in sys.stdin.readline().split()]\nfor i in range(n):\n a, b = [int(x) for x in sys.stdin.readline().split()]\n r[a - 1] += b\nc = 0\nfor i, j in enumerate(r):\n c += j\n if c >= k:\n print((i + 1))\n break\n", "fast_code": "n, k = list(map(int, input().split()))\nli = []\nfor _ in range(n):\n a, b = list(map(int, input().split()))\n li.append([a, b])\nli.sort()\nfor a, b in li:\n k -= b\n if k <= 0:\n print(a)\n break\n", "slow_time": 225902069, "fast_time": 28481628, "speedup": 7.9315, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_25"} +{"pair_id": "python_6335", "problem_id": "p03719", "language": "python", "slow_code": "import functools\nimport os\nimport sys\n\nsys.setrecursionlimit(10000)\nINF = float(\"inf\")\n\n\ndef inp():\n return int(eval(input()))\n\n\ndef inpf():\n return float(eval(input()))\n\n\ndef inps():\n return eval(input())\n\n\ndef inl():\n return list(map(int, input().split()))\n\n\ndef inlf():\n return list(map(float, input().split()))\n\n\ndef inls():\n return input().split()\n\n\ndef inpm(line):\n return [inp() for _ in range(line)]\n\n\ndef inpfm(line):\n return [inpf() for _ in range(line)]\n\n\ndef inpsm(line):\n return [inps() for _ in range(line)]\n\n\ndef inlm(line):\n return [inl() for _ in range(line)]\n\n\ndef inlfm(line):\n return [inlf() for _ in range(line)]\n\n\ndef inlsm(line):\n return [inls() for _ in range(line)]\n\n\ndef Yesif(cond):\n print((\"Yes\" if cond else \"No\"))\n\n\ndef YESIF(cond):\n print((\"YES\" if cond else \"NO\"))\n\n\ndef yesif(cond):\n print((\"yes\" if cond else \"no\"))\n\n\na, b, c = inl()\nYesif(a <= c <= b)\n", "fast_code": "import sys\n\n\ndef solve():\n a, b, c = list(map(int, input().split()))\n print((\"Yes\" if a <= c <= b else \"No\"))\n\n\nif __name__ == \"__main__\":\n solve()\n", "slow_time": 117754251, "fast_time": 18961634, "speedup": 6.2101, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_3"} +{"pair_id": "python_6382", "problem_id": "p02551", "language": "python", "slow_code": "class LazySegmentTree:\n def __init__(self, init_val, segfunc, ide_ele):\n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.data = [ide_ele] * 2 * self.num\n self.lazy = [None] * 2 * self.num\n for i in range(n):\n self.data[self.num + i] = init_val[i]\n for i in range(self.num - 1, 0, -1):\n self.data[i] = self.segfunc(self.data[2 * i], self.data[2 * i + 1])\n\n def gindex(self, l, r):\n l += self.num\n r += self.num\n lm = l >> (l & -l).bit_length()\n rm = r >> (r & -r).bit_length()\n while r > l:\n if l <= lm:\n yield l\n if r <= rm:\n yield r\n r >>= 1\n l >>= 1\n while l:\n yield l\n l >>= 1\n\n def propagates(self, *ids):\n for i in reversed(ids):\n v = self.lazy[i]\n if v is None:\n continue\n self.lazy[2 * i] = v\n self.lazy[2 * i + 1] = v\n self.data[2 * i] = v\n self.data[2 * i + 1] = v\n self.lazy[i] = None\n\n def update(self, l, r, x):\n (*ids,) = self.gindex(l, r)\n self.propagates(*ids)\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n self.lazy[l] = x\n self.data[l] = x\n l += 1\n if r & 1:\n self.lazy[r - 1] = x\n self.data[r - 1] = x\n r >>= 1\n l >>= 1\n for i in ids:\n self.data[i] = self.segfunc(self.data[2 * i], self.data[2 * i + 1])\n\n def query(self, l, r):\n (*ids,) = self.gindex(l, r)\n self.propagates(*ids)\n res = self.ide_ele\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.data[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.data[r - 1])\n l >>= 1\n r >>= 1\n return res\n\n\ndef segfunc(x, y):\n return min(x, y)\n\n\nide_ele = 10**9\nN, Q = list(map(int, input().split()))\nans = (N - 2) * (N - 2)\nR = [N] * (N + 1)\nW = [N] * (N + 1)\nseg_r = LazySegmentTree(R, segfunc, ide_ele)\nseg_w = LazySegmentTree(W, segfunc, ide_ele)\nfor i in range(Q):\n a, b = list(map(int, input().split()))\n if a == 1:\n t = seg_r.query(b, b + 1)\n ans -= max(0, t - 2)\n if b <= seg_w.query(1, 2):\n seg_w.update(1, t + 1, b)\n else:\n t = seg_w.query(b, b + 1)\n ans -= max(0, t - 2)\n if b <= seg_r.query(1, 2):\n seg_r.update(1, t + 1, b)\nprint(ans)\n", "fast_code": "N, Q = list(map(int, input().split()))\nN -= 2\n\nBIT = [[0 for i in range(N + 1)] for _ in range(2)]\n\n\nn = N\n\n\ndef BIT_query(idx, BIT):\n res_sum = 0\n while idx > 0:\n res_sum += BIT[idx]\n idx -= idx & (-idx)\n return res_sum\n\n\ndef BIT_update(idx, x, BIT):\n while idx <= n:\n BIT[idx] += x\n idx += idx & (-idx)\n return\n\n\nnow = N * N\nmax_x = [\n 0,\n 0,\n]\nfor _ in range(Q):\n\n s, x = list(map(int, input().split()))\n\n s -= 1\n\n x -= 1\n\n x = N + 1 - x\n\n depth = N + BIT_query(x, BIT[s])\n now -= depth\n if x > max_x[s]:\n BIT_update(N - depth + 1, max_x[s] - x, BIT[1 - s])\n\n max_x[s] = x\nprint(now)\n", "slow_time": 32691482933, "fast_time": 2484231945, "speedup": 13.1596, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_1"} +{"pair_id": "python_10153", "problem_id": "p03222", "language": "python", "slow_code": "from itertools import product\n\nH, W, K = list(map(int, input().split()))\nMOD = 10**9 + 7\ndp = [[0] * W for i in range(H + 1)]\ndp[0][0] = 1\n\n\ndef calc(w):\n if w <= 0:\n return 1\n ret = 0\n for pattern in product([0, 1], repeat=w):\n pattern = \"\".join(list(map(str, pattern)))\n if \"11\" not in pattern:\n ret += 1\n return ret\n\n\nfor h in range(H):\n for w in range(W):\n dp[h + 1][w] = (dp[h + 1][w] + dp[h][w] * calc(w - 1) * calc(W - w - 2)) % MOD\n if w + 1 < W:\n dp[h + 1][w + 1] = (\n dp[h + 1][w + 1] + dp[h][w] * calc(w - 1) * calc(W - w - 3) % MOD\n )\n if w - 1 >= 0:\n dp[h + 1][w - 1] = (\n dp[h + 1][w - 1] + dp[h][w] * calc(w - 2) * calc(W - w - 2) % MOD\n )\nprint((dp[H][K - 1] % MOD))\n", "fast_code": "A = [1, 2, 3, 5, 8, 13, 21]\nMOD = 10**9 + 7\nH, W, K = list(map(int, input().split()))\nif W == 0:\n print((1))\n exit()\ndp = [[0] * W for _ in range(H + 1)]\ndp[0][0] = 1\nfor i in range(1, H + 1):\n for j in range(i + 1):\n for k in [-1, 0, 1]:\n if not 0 <= j + k < W:\n continue\n if not 0 <= j < W:\n continue\n if k == -1:\n left = max(0, j - 1 - 1)\n right = max(0, W - j - 2)\n elif k == 0:\n left = max(0, j - 1)\n right = max(0, W - j - 2)\n elif k == 1:\n left = max(0, j - 1)\n right = max(0, W - j - 2 - 1)\n dp[i][j] += dp[i - 1][j + k] * A[left] * A[right]\n dp[i][j] %= MOD\nprint((dp[H][K - 1]))\n", "slow_time": 638943847, "fast_time": 97266259, "speedup": 6.569, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_14"} +{"pair_id": "python_14299", "problem_id": "p03737", "language": "python", "slow_code": "def generate_acronym(l1: list) -> str:\n answer = \"\"\n for i, word in enumerate(l1):\n\n answer += word[0].upper()\n return answer\n\n\nlists = list(map(str, input().split()))\nprint((generate_acronym(lists)))\n", "fast_code": "a, *_ = zip(*input().upper().split())\nprint(*a, sep=\"\")\n", "slow_time": 21557236, "fast_time": 9275400, "speedup": 2.3241, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_15"} +{"pair_id": "python_11129", "problem_id": "p03816", "language": "python", "slow_code": "import sys\nfrom collections import Counter\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\nN = INT()\nA = LIST()\nC = Counter(A)\nfor k in list(C.keys()):\n C[k] -= 1\ncnt = ceil(sum(C.values()), 2)\nans = N - cnt * 2\nprint(ans)\n", "fast_code": "n = int(eval(input()))\nl = len(set(list(map(int, input().split()))))\nprint((l - 1 if (n - l) % 2 else l))\n", "slow_time": 126232290, "fast_time": 18449968, "speedup": 6.8419, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_26"} +{"pair_id": "python_4286", "problem_id": "p03264", "language": "python", "slow_code": "k = int(eval(input()))\ncount = 0\nfor i in range(k):\n for j in range(i + 1, k):\n if (i % 2 == 0 and j % 2 == 1) or (i % 2 == 1 and j % 2 == 0):\n count += 1\nprint(count)\n", "fast_code": "a = int(eval(input())) / 2\nprint((int(a**2)))\n", "slow_time": 62556705, "fast_time": 9573211, "speedup": 6.5346, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_24"} +{"pair_id": "python_9425", "problem_id": "p02675", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nimport bisect\n\nINF = 10**13\nMOD = 10**9 + 7\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef gcd(x, y):\n return x if y == 0 else gcd(y, x % y)\n\n\ndef lcm(x, y):\n return (x * y) // gcd(x, y)\n\n\ndef I():\n return int(input())\n\n\ndef LI():\n return [int(x) for x in input().split()]\n\n\ndef RI(N):\n return [int(input()) for _ in range(N)]\n\n\ndef LRI(N):\n return [[int(x) for x in input().split()] for _ in range(N)]\n\n\ndef LS():\n return input().split()\n\n\ndef RS(N):\n return [input() for _ in range(N)]\n\n\ndef LRS(N):\n return [input().split() for _ in range(N)]\n\n\ndef PL(L):\n print(*L, sep=\"\\n\")\n\n\ndef YesNo(B):\n print(\"Yes\" if B else \"No\")\n\n\ndef YESNO(B):\n print(\"YES\" if B else \"NO\")\n\n\nN = input()\nn = int(N[-1])\nif n in [2, 4, 5, 7, 9]:\n print(\"hon\")\nelif n in [0, 1, 6, 8]:\n print(\"pon\")\nelse:\n print(\"bon\")\n", "fast_code": "import sys\n\nsr = lambda: sys.stdin.readline().rstrip()\nir = lambda: int(sr())\nlr = lambda: list(map(int, sr().split()))\nN = sr()[-1]\nif N == \"3\":\n answer = \"bon\"\nelif N in \"0168\":\n answer = \"pon\"\nelse:\n answer = \"hon\"\nprint(answer)\n", "slow_time": 116219356, "fast_time": 27500661, "speedup": 4.2261, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_26"} +{"pair_id": "python_3314", "problem_id": "p03695", "language": "python", "slow_code": "n = int(eval(input()))\nA = list(map(int, input().split()))\ncnt = 0\nB = []\nfor i in range(n):\n if 1 <= A[i] <= 399:\n B.append(0)\n elif 400 <= A[i] <= 799:\n B.append(1)\n elif 800 <= A[i] <= 1199:\n B.append(2)\n elif 1200 <= A[i] <= 1599:\n B.append(3)\n elif 1600 <= A[i] <= 1999:\n B.append(4)\n elif 2000 <= A[i] <= 2399:\n B.append(5)\n elif 2400 <= A[i] <= 2799:\n B.append(6)\n elif 2800 <= A[i] <= 3199:\n B.append(7)\n else:\n\n cnt += 1\n\nif len(B) == 0 and cnt != 0:\n print((1, cnt))\nelse:\n print((len(set(B)), len(set(B)) + cnt))\n", "fast_code": "eval(input())\nsuper_coders_cnt = 0\ncoders = set()\nfor r in map(int, input().split()):\n if r >= 3200:\n super_coders_cnt += 1\n else:\n coders.add(r // 400)\nprint((max(1, len(coders)), len(coders) + super_coders_cnt))\n", "slow_time": 70446936, "fast_time": 25553878, "speedup": 2.7568, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_2"} +{"pair_id": "python_12512", "problem_id": "p03674", "language": "python", "slow_code": "MOD = 10**9 + 7\n\n\ndef mod_pow(x, n):\n if x == 0:\n return 1\n res = 1\n while n > 0:\n if n & 1:\n res = (res * x) % MOD\n x = (x * x) % MOD\n n >>= 1\n return res\n\n\nfact, invfact = [0] * (10**5 + 2), [0] * (10**5 + 2)\nfact[0], invfact[0] = 1, 1\nfor i in range(1, 10**5 + 2):\n fact[i] = (fact[i - 1] * i) % MOD\n invfact[i] = mod_pow(fact[i], MOD - 2) % MOD\n\n\ndef comb(n, r):\n if n < r or n == 0 or r == 0:\n return 0\n return (((fact[n] * invfact[r]) % MOD) * invfact[n - r]) % MOD\n\n\nfrom collections import defaultdict\n\nn = int(eval(input()))\na = list(map(int, input().split()))\nd = defaultdict(int)\nfor i, ele in enumerate(a):\n if d[ele] == 0:\n d[ele] = i + 1\n else:\n l = d[ele]\n r = i + 1\nprint(n)\nfor k in range(2, n + 2):\n print(((comb(n + 1, k) - comb(l - 1 + n - r + 1, k - 1)) % MOD))\n", "fast_code": "class ModComb:\n def __init__(self, MAX, mod=10**9 + 7):\n fac = [1, 1]\n finv = [1, 1]\n inv = [0, 1]\n for i in range(2, MAX):\n fac.append(fac[i - 1] * i % mod)\n inv.append(mod - inv[mod % i] * (mod // i) % mod)\n finv.append(finv[i - 1] * inv[i] % mod)\n self.fac, self.finv, self.mod = fac, finv, mod\n\n def nCk(self, n, k):\n if n < k or n < 0 or k < 0:\n return 0\n fac, finv, mod = self.fac, self.finv, self.mod\n return fac[n] * (finv[k] * finv[n - k] % mod) % mod\n\n\nmod = 10**9 + 7\nN, *A = list(map(int, open(0).read().split()))\nmc = ModComb(210000, mod=mod)\nused = {}\nleft, right = 0, 0\nfor i, a in enumerate(A):\n if a in used:\n right = i\n left = used[a]\n break\n used[a] = i\nm = left + N - right\nfor k in range(1, N + 2):\n print(((mc.nCk(N + 1, k) - mc.nCk(m, k - 1)) % mod))\n", "slow_time": 142154156092, "fast_time": 20922270310, "speedup": 6.7944, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_20"} +{"pair_id": "python_6656", "problem_id": "p04014", "language": "python", "slow_code": "import sys\n\nn = int(eval(input()))\ns = int(eval(input()))\n\n\ndef f(b, n):\n if n < b:\n return n\n else:\n return f(b, n // b) + n % b\n\n\nif s == n:\n print((n + 1))\n sys.exit(0)\nif n < s:\n print((-1))\n sys.exit(0)\nans = None\nfor i in range(2, n):\n if i * i > n:\n break\n if f(i, n) == s:\n ans = i\n break\nfor i in range(1, n):\n if i * i > n:\n break\n if (n - s) % i == 0:\n b = (n - s) // i + 1\n if f(b, n) == s:\n if ans is None:\n ans = (n - s) // i + 1\n else:\n ans = min((ans, (n - s) // i + 1))\nif ans is None:\n print((-1))\nelse:\n print(ans)\n", "fast_code": "def primeFactor(N):\n i, n, ret, d, sq = 2, N, {}, 2, 99\n while i <= sq:\n k = 0\n while n % i == 0:\n n, k, ret[i] = n // i, k + 1, k + 1\n if k > 0 or i == 97:\n sq = int(n ** (1 / 2) + 0.5)\n if i < 4:\n i = i * 2 - 1\n else:\n i, d = i + d, d ^ 6\n if n > 1:\n ret[n] = 1\n return ret\n\n\ndef divisors(N):\n pf = primeFactor(N)\n ret = [1]\n for p in pf:\n ret_prev = ret\n ret = []\n for i in range(pf[p] + 1):\n for r in ret_prev:\n ret.append(r * (p**i))\n return sorted(ret)\n\n\ndef f(b, n):\n re = 0\n while n:\n re += n % b\n n //= b\n return re\n\n\nN = int(eval(input()))\nS = int(eval(input()))\nif N < S:\n print((-1))\nelif N == S:\n print((N + 1))\nelse:\n for b in divisors(N - S):\n b += 1\n if f(b, N) == S:\n print(b)\n break\n else:\n print((-1))\n", "slow_time": 2618861164, "fast_time": 96826499, "speedup": 27.0469, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_4"} +{"pair_id": "python_8902", "problem_id": "p02571", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nS = LS2()\nT = LS2()\ns = len(S)\nt = len(T)\nans = 10**5\nfor i in range(s - t + 1):\n count = 0\n for j in range(t):\n if T[j] != S[i + j]:\n count += 1\n ans = min(ans, count)\nprint(ans)\n", "fast_code": "S = input().strip()\nT = input().strip()\nk = len(T)\ndmin = len(S)\nfor i in range(len(S) - k + 1):\n cnt = 0\n for j in range(k):\n if S[i + j] != T[j]:\n cnt += 1\n dmin = min(dmin, cnt)\nprint(dmin)\n", "slow_time": 72337825, "fast_time": 27555234, "speedup": 2.6252, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_28"} +{"pair_id": "python_18463", "problem_id": "p02676", "language": "python", "slow_code": "def N():\n return int(input())\n\n\ndef NM():\n return map(int, input().split())\n\n\ndef L():\n return list(NM())\n\n\ndef LN(n):\n return [N() for i in range(n)]\n\n\ndef LL(n):\n return [L() for i in range(n)]\n\n\ndef YesNo(x):\n print(\"Yes\") if x == True else print(\"No\")\n\n\nk = N()\ns = input()\nif len(s) <= k:\n print(s)\nelse:\n print(s[:k] + \"...\")\n", "fast_code": "import sys\n\nK = int(input())\nS = input()\nprint(S) if len(S) <= K else print(S[:K] + \"...\")\n", "slow_time": 49635108, "fast_time": 13052300, "speedup": 3.8028, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_9"} +{"pair_id": "python_14615", "problem_id": "p01314", "language": "python", "slow_code": "if __name__ == \"__main__\":\n while True:\n n = int(eval(input()))\n if n == 0:\n break\n nline = [i for i in range(1, n + 1)]\n count = 0\n for i in range(n):\n for j in range(i + 1, n):\n if sum(nline[i:j]) > n:\n break\n if sum(nline[i:j]) == n:\n count += 1\n print(count)\n", "fast_code": "import sys\n\nif sys.version_info[0] >= 3:\n raw_input = input\ntry:\n while True:\n n = int(input())\n if n == 0:\n break\n r = 0\n i = 1\n while 1:\n n -= i\n if n < i:\n break\n i += 1\n if n % i == 0:\n r += 1\n print(r)\nexcept EOFError:\n pass\n", "slow_time": 246187152, "fast_time": 28743098, "speedup": 8.5651, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_5"} +{"pair_id": "python_14349", "problem_id": "p03185", "language": "python", "slow_code": "class Lichaotree:\n\n def __init__(self, X):\n self.N = len(X)\n self.N0 = 2 ** (self.N - 1).bit_length()\n self.comp = {v: k for k, v in enumerate(X)}\n self.inf = 10**12\n self.X = X + [self.inf] * (self.N0 - self.N)\n self.data = [None] * (2 * self.N0)\n self.size = [0] * self.N0 + [1] * self.N0\n for i in range(self.N0 - 1, 0, -1):\n self.size[i] = 2 * self.size[2 * i]\n self.start = [0] * (2 * self.N0)\n for i in range(1, 2 * self.N0):\n if i == i & (-i):\n continue\n self.start[i] = self.start[i - 1] + self.size[i]\n\n def f(self, line, x):\n return line[0] * x + line[1]\n\n def _update(self, k, line):\n if self.data[k] is None:\n self.data[k] = line\n return\n l = self.start[k]\n r = l + self.size[k]\n while True:\n if self.data[k] is None:\n self.data[k] = line\n return\n m = (l + r) // 2\n lx = self.X[l]\n mx = self.X[m]\n rx = self.X[r - 1]\n gl = self.f(self.data[k], lx) > self.f(line, lx)\n gm = self.f(self.data[k], mx) > self.f(line, mx)\n gr = self.f(self.data[k], rx) > self.f(line, rx)\n if gl and gr:\n self.data[k] = line\n return\n if not gl and not gr:\n return\n if gm:\n self.data[k], line = line, self.data[k]\n gl = not gl\n if gl:\n r = m\n k = 2 * k\n else:\n l = m\n k = 2 * k + 1\n\n def query(self, x):\n k = self.comp[x] + self.N0\n s = self.inf\n while k > 0:\n if self.data[k]:\n s = min(s, self.f(self.data[k], x))\n k = k >> 1\n return s\n\n def addline(self, line):\n self._update(1, line)\n\n def addlineseg(self, l, r, line):\n\n L = l + self.N0\n R = r + self.N0\n while L < R:\n if R & 1:\n R -= 1\n self._update(R, line)\n if L & 1:\n self._update(L, line)\n L += 1\n L >>= 1\n R >>= 1\n\n\nN, C = list(map(int, input().split()))\nH = list(map(int, input().split()))\nT = Lichaotree(H)\ndp = [10**19] * N\ndp[0] = 0\nT.addline((-2 * H[0], H[0] ** 2))\nfor i in range(1, N):\n mi = T.query(H[i])\n dp[i] = mi + C + H[i] ** 2\n T.addline((-2 * H[i], H[i] ** 2 + dp[i]))\nprint((dp[-1]))\n", "fast_code": "def fi(i, x):\n a, b = lines[i]\n return a * x + b\n\n\ndef find(x):\n def f(i):\n return fi(i + 1, x) > fi(i, x)\n\n mn, mx = -1, len(lines) - 1\n idx = (mn + mx) // 2\n while mx - mn > 1:\n if f(idx):\n mx, idx = idx, (mn + idx) // 2\n continue\n mn, idx = idx, (mx + idx) // 2\n return fi(idx + 1, x)\n\n\ndef insert(a, b):\n e, f = lines[-1]\n while len(lines) - 1:\n (c, d), (e, f) = (e, f), lines[-2]\n if (c - e) * (b - d) < (d - f) * (a - c):\n break\n lines.pop()\n lines.append((a, b))\n\n\nN, C = list(map(int, input().split()))\nhs = list(map(int, input().split()))\nlines = [(-2 * hs[0], hs[0] ** 2)]\nfor h in hs[1:]:\n r = find(h) + h**2 + C\n insert(-2 * h, r + h**2)\nprint(r)\n", "slow_time": 204801603, "fast_time": 85742731, "speedup": 2.3886, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_4"} +{"pair_id": "python_14567", "problem_id": "p00150", "language": "python", "slow_code": "r = 10001\nsqrt = int(r**0.5)\np = [1] * r\ntwin = [0] * r\np[0] = 0\np[1::2] = [0 for x in range(1, r, 2)]\nfor i in range(2, r, 2):\n if p[i]:\n p[2 * i + 1 :: i + 1] = [0 for x in range(2 * i + 1, r, i + 1)]\n if p[i - 2]:\n twin[i : i + 300] = [i + 1 for x in range(i, i + 300)]\nwhile True:\n n = int(input())\n if n == 0:\n break\n print(twin[n - 1] - 2, twin[n - 1])\n", "fast_code": "MAX = 10000\nSQRT = 100\nprime = [True for i in range(MAX)]\n\n\ndef sieve():\n for i in range(4, MAX, 2):\n prime[i] = False\n for i in range(3, SQRT, 2):\n if prime[i] is True:\n for j in range(i * i, MAX, i):\n prime[j] = False\n\n\nsieve()\nwhile True:\n n = int(eval(input()))\n if n == 0:\n break\n if (n & 1) == 0:\n n -= 1\n while not prime[n] or not prime[n - 2]:\n n -= 2\n print((n - 2, n))\n", "slow_time": 1637634757, "fast_time": 265822159, "speedup": 6.1606, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_0"} +{"pair_id": "python_4896", "problem_id": "p03598", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\ninf = 1 << 60\nmod = 1000000007\nni = lambda: int(ns())\nnin = lambda y: [ni() for _ in range(y)]\nna = lambda: list(map(int, stdin.readline().split()))\nnan = lambda y: [na() for _ in range(y)]\nnf = lambda: float(ns())\nnfn = lambda y: [nf() for _ in range(y)]\nnfa = lambda: list(map(float, stdin.readline().split()))\nnfan = lambda y: [nfa() for _ in range(y)]\nns = lambda: stdin.readline().rstrip()\nnsn = lambda y: [ns() for _ in range(y)]\nncl = lambda y: [list(ns()) for _ in range(y)]\nnas = lambda: stdin.readline().split()\nn, k = nin(2)\nx = na()\nans = 0\nfor i in range(n):\n ans += min(abs(x[i] - k) * 2, abs(x[i]) * 2)\nprint(ans)\n", "fast_code": "n = int(eval(input()))\nk = int(eval(input()))\nx = list(map(int, input().split()))\nans = 0\nfor xi in x:\n ans += min(xi, k - xi) * 2\nprint(ans)\n", "slow_time": 100447964, "fast_time": 24528117, "speedup": 4.0952, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_16"} +{"pair_id": "python_10048", "problem_id": "p03222", "language": "python", "slow_code": "H, W, K = list(map(int, input().split()))\nMOD = 10**9 + 7\nif W == 1:\n print((1))\n exit()\npossible = []\nfor i in range(1 << (W - 1)):\n b = bin(i)[2:]\n flag = 1\n for j in range(len(b) - 1):\n if b[j] == b[j + 1] == \"1\":\n flag = 0\n if flag:\n possible.append(int(b, 2))\n\n\ndef amida(b):\n ret = [i for i in range(W)]\n for i in range(W - 1):\n if b >> i & 1:\n ret[i], ret[i + 1] = ret[i + 1], ret[i]\n return ret\n\n\nans = [0 for i in range(W)]\nans[0] = 1\nfor _ in range(H):\n new_ans = [0 for i in range(W)]\n for b in possible:\n for i in range(W):\n new_ans[i] = (new_ans[i] + ans[amida(b)[i]]) % MOD\n ans = new_ans\nprint((ans[K - 1]))\n", "fast_code": "MOD = 10**9 + 7\nH, W, K = list(map(int, input().split()))\nfibs = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n\n\ndef getFib(i):\n return fibs[i + 2]\n\n\nnumLs, numCs, numRs = [0] * W, [0] * W, [0] * W\nfor j in range(W):\n numCs[j] = getFib(j - 1) * getFib(W - 1 - j - 1)\n numLs[j] = getFib(j - 2) * getFib(W - 1 - j - 1)\n numRs[j] = getFib(j - 1) * getFib(W - 1 - j - 2)\ndp = [[0] * W for _ in range(H + 1)]\ndp[0][0] = 1\nfor i in range(H):\n for j in range(W):\n dp[i + 1][j] += dp[i][j] * numCs[j]\n if j > 0:\n dp[i + 1][j - 1] += dp[i][j] * numLs[j]\n if j < W - 1:\n dp[i + 1][j + 1] += dp[i][j] * numRs[j]\n for j in range(W):\n dp[i + 1][j] %= MOD\nprint((dp[H][K - 1]))\n", "slow_time": 593484533, "fast_time": 79770414, "speedup": 7.4399, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_6"} +{"pair_id": "python_18247", "problem_id": "p02831", "language": "python", "slow_code": "a, b = list(map(int, input().split()))\ngcd = 0\nfor i in range(max(a, b), 0, -1):\n if a % i == 0 and b % i == 0:\n gcd = i\n break\nprint((a * b // gcd))\n", "fast_code": "import math\n\n\ndef lcm(x, y):\n return (x * y) // math.gcd(x, y)\n\n\na, b = list(map(int, input().split()))\nprint((lcm(a, b)))\n", "slow_time": 1631239856, "fast_time": 16639944, "speedup": 98.0316, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_4"} +{"pair_id": "python_6151", "problem_id": "p00033", "language": "python", "slow_code": "N = int(eval(input()))\nfor testCase in range(N):\n A = list(map(int, input().split()))\n ok = False\n for i in range(2**10):\n x = []\n y = []\n for j in range(10):\n if i & (1 << j):\n x.append(A[j])\n else:\n y.append(A[j])\n if x == sorted(x) and y == sorted(y):\n ok = True\n if ok:\n print(\"YES\")\n else:\n print(\"NO\")\n", "fast_code": "N = eval(input())\nfor i in range(N):\n b, c = 0, 0\n for j in map(int, input().split()):\n if b < j:\n b = j\n elif c < j:\n c = j\n else:\n break\n else:\n print(\"YES\")\n continue\n print(\"NO\")\n", "slow_time": 2055994527, "fast_time": 25938345, "speedup": 79.2647, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_7"} +{"pair_id": "python_2905", "problem_id": "p02582", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n S = input().rstrip()\n if S == \"RRR\":\n print((3))\n elif S == \"RRS\":\n print((2))\n elif S == \"SRR\":\n print((2))\n elif S == \"SSS\":\n print((0))\n else:\n print((1))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "print((max(list(map(len, input().split(\"S\"))))))\n", "slow_time": 28799282, "fast_time": 8797320, "speedup": 3.2736, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_24"} +{"pair_id": "python_1627", "problem_id": "p02990", "language": "python", "slow_code": "N, K = list(map(int, input().split()))\nmod = 10**9 + 7\ninv = [pow(i, mod - 2, mod) for i in range(1, N + 1)]\ntable = []\ninv_table = []\ntmp = 1\ninv_tmp = 1\nfor i in range(N):\n tmp *= i + 1\n tmp %= mod\n table.append(tmp)\n inv_tmp *= inv[i]\n inv_tmp %= mod\n inv_table.append(inv_tmp)\n\n\ndef cmb(n, k):\n if n == 0:\n return 1\n if k == 0:\n return 1\n if n == k:\n return 1\n ans = table[n - 1]\n ans *= inv_table[k - 1]\n ans *= inv_table[n - k - 1]\n return ans % mod\n\n\nfor i in range(1, K + 1):\n ans = 0\n tmp = cmb(K - 1, i - 1)\n if N - K < i - 1:\n print(ans)\n continue\n else:\n tmp_N = N - K - (i - 1)\n if tmp_N > 0:\n ans += cmb(tmp_N + i, i) * tmp\n else:\n ans += tmp\n print((ans % mod))\n", "fast_code": "import math\n\nN, K = list(map(int, input().split()))\nR = N - K\nif R == 0:\n print((1))\n for _ in range(1, K):\n print((0))\n exit()\nif K == 1:\n print((R + 1))\n exit()\n\n\nfor i in range(1, K + 1):\n if i > R + 1:\n print((0))\n continue\n if i == 1:\n print((R + 1))\n continue\n\n if i >= 2:\n position = R_1 = math.factorial(R + 1) // (\n math.factorial(i) * math.factorial(R + 1 - i)\n )\n boal = math.factorial(K - 1) // (math.factorial(i - 1) * math.factorial(K - i))\n print(((position * boal) % (7 + 10**9)))\n", "slow_time": 319829547, "fast_time": 63154173, "speedup": 5.0643, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_16"} +{"pair_id": "python_13621", "problem_id": "p02362", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nfrom sys import stdin\n\n\nclass UnionFindSet:\n def __init__(self, nodes):\n self.fa = {}\n for n in nodes:\n self.fa[n] = n\n\n def find(self, x):\n if self.fa[x] == x:\n return x\n else:\n self.fa[x] = self.find(self.fa[x])\n return self.fa[x]\n\n def union(self, x, y):\n fx = self.find(x)\n fy = self.find(y)\n if fx == fy:\n return fx\n else:\n self.fa[fx] = fy\n return fy\n\n\n\"\"\"\"\"\"\n\n\ndef kruscal(graph):\n \"kruscal minimum spanning tree algorithm\"\n ufset = UnionFindSet(graph[\"nodes\"])\n ret = 0\n for x, y, w in sorted(graph[\"edges\"], key=lambda x: x[-1]):\n fx = ufset.find(x)\n fy = ufset.find(y)\n if fx != fy:\n ret += w\n ufset.union(fx, fy)\n else:\n pass\n return ret\n\n\ndef dijkstra(graph, root):\n \"dijkstra algorithm for single source shortest algorithm\"\n dis, vis = {}, {}\n for n in graph[\"nodes\"]:\n dis[n] = 10**9\n vis[n] = False\n heap = []\n dis[root] = 0\n heappush(heap, (0, root))\n while heap:\n _, n = heappop(heap)\n vis[n] = True\n for y, w in graph[\"adj\"][n]:\n if not vis[y] and dis[n] + w < dis[y]:\n dis[y] = dis[n] + w\n heappush(heap, (dis[y], y))\n return dis\n\n\ndef belmanFord(graph, root):\n dis = {}\n for n in graph[\"nodes\"]:\n dis[n] = 10**9\n dis[root] = 0\n\n for _ in range(len(graph[\"nodes\"]) - 1):\n for x, y, w in graph[\"edges\"]:\n if dis[x] + w < dis[y]:\n dis[y] = dis[x] + w\n connect = set([root])\n que = deque([root])\n while que:\n n = que.popleft()\n for y, _ in graph[\"adj\"][n]:\n if not y in connect:\n connect.add(y)\n que.append(y)\n dis[\"negcicle\"] = False\n for x, y, w in graph[\"edges\"]:\n if dis[x] + w < dis[y] and x in connect:\n dis[\"negcicle\"] = True\n dis[\"con\"] = connect\n return dis\n\n\nif __name__ == \"__main__\":\n V, E, root = list(map(int, stdin.readline().strip().split()))\n graph = {}\n graph[\"nodes\"] = [i for i in range(V)]\n graph[\"edges\"] = []\n graph[\"adj\"] = defaultdict(list)\n for _ in range(E):\n x, y, w = list(map(int, stdin.readline().strip().split()))\n graph[\"edges\"].append((x, y, w))\n graph[\"adj\"][x].append((y, w))\n dis = belmanFord(graph, root)\n if dis[\"negcicle\"]:\n print(\"NEGATIVE CYCLE\")\n else:\n for n in graph[\"nodes\"]:\n print(dis[n] if dis[n] < 10**9 and n in dis[\"con\"] else \"INF\")\n", "fast_code": "import math\n\n\ndef main():\n nvertices, nedges, s = list(map(int, input().split()))\n E = []\n for i in range(nedges):\n u, v, w = list(map(int, input().split()))\n E.append((u, v, w))\n INF = float(\"inf\")\n weights = [INF] * nvertices\n weights[s] = 0\n for i in range(nvertices - 1):\n for u, v, w in E:\n if weights[v] > weights[u] + w:\n weights[v] = weights[u] + w\n for u, v, w in E:\n if weights[v] > weights[u] + w:\n print(\"NEGATIVE CYCLE\")\n return\n for w in weights:\n if math.isinf(w):\n print(\"INF\")\n else:\n print(w)\n\n\nmain()\n", "slow_time": 189538126, "fast_time": 49104636, "speedup": 3.8599, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_2"} +{"pair_id": "python_860", "problem_id": "p03556", "language": "python", "slow_code": "import functools\nimport itertools\nimport numpy as np\nimport sys\n\nMAX_INT = int(10e10)\nMIN_INT = -MAX_INT\nmod = 1000000007\nsys.setrecursionlimit(1000000)\n\n\ndef IL():\n return list(map(int, input().split()))\n\n\ndef SL():\n return input().split()\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef S():\n return eval(input())\n\n\nN = I()\nans = [pow(i, 2) for i in range(100000) if pow(i, 2) <= N]\nprint((ans[-1]))\n", "fast_code": "n = int(eval(input()))\nfor i in range(n, 0, -1):\n if float(i**0.5).is_integer():\n print(i)\n break\n", "slow_time": 7046061345, "fast_time": 868435773, "speedup": 8.1135, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_26"} +{"pair_id": "python_3445", "problem_id": "p02955", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\n\n\ndef read_int():\n return int(input())\n\n\ndef read_int_n():\n return list(map(int, input().split()))\n\n\ndef read_float():\n return float(input())\n\n\ndef read_float_n():\n return list(map(float, input().split()))\n\n\ndef read_str():\n return input().strip()\n\n\ndef read_str_n():\n return list(map(str, input().split()))\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n error_print(e - s, \"sec\")\n return ret\n\n return wrap\n\n\ndef divisor(n):\n for i in range(1, int(n**0.5) + 1):\n if n % i == 0:\n yield i\n if i != n // i:\n yield n // i\n\n\n@mt\ndef slv(N, K, A):\n S = sum(A)\n D = [n for n in divisor(S)]\n D.sort()\n ans = 0\n for d in D:\n r = []\n for a in A:\n r.append(a % d)\n r.sort()\n rr = [d - n for n in r]\n sr = [0]\n srr = [0]\n for i in range(N):\n sr.append(sr[-1] + r[i])\n srr.append(srr[-1] + rr[i])\n for i in range(N):\n e = sr[i + 1] - sr[0]\n f = srr[N] - srr[i + 1]\n if e == f and e <= K:\n ans = max(ans, d)\n break\n return ans\n\n\ndef main():\n N, K = read_int_n()\n A = read_int_n()\n print(slv(N, K, A))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "n, k = list(map(int, input().split()))\na = [int(x) for x in input().split()]\ns = sum(a)\ncandidates = set()\nfor i in range(1, int(s**0.5) + 1):\n if s % i == 0:\n candidates.add(i)\n candidates.add(s // i)\nans = 0\nfor cdd in candidates:\n div_cdd = [0] * n\n for i in range(n):\n div_cdd[i] = a[i] % cdd\n div_cdd = sorted(div_cdd)\n\n idx = n - sum(div_cdd) // cdd\n need = 0\n for i in range(idx):\n need += div_cdd[i]\n ans = max(ans, cdd) if need <= k else ans\nprint(ans)\n", "slow_time": 163270483, "fast_time": 58661726, "speedup": 2.7833, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_18"} +{"pair_id": "python_14501", "problem_id": "p02669", "language": "python", "slow_code": "from collections import defaultdict\n\n\ndef solve(*args: str) -> str:\n t = int(args[0])\n NABCD = [tuple(map(int, nabcd.split())) for nabcd in args[1:]]\n ret = []\n for n, a, b, c, d in NABCD:\n ABC = ((2, a), (3, b), (5, c))\n dp = defaultdict(lambda: n * d)\n stack = [(n, 0)]\n while stack:\n rem, cost = stack.pop()\n if min(dp[0], dp[rem]) <= cost:\n continue\n dp[rem] = cost\n dp[0] = min(dp[0], cost + rem * d)\n if 0 < rem:\n for x, y in ABC:\n l, h = rem // x, -(-rem // x)\n stack.append((l, d * abs(l * x - rem) + cost + y * (0 < l)))\n stack.append((h, d * abs(h * x - rem) + cost + y))\n ret.append(str(dp[0]))\n return \"\\n\".join(ret)\n\n\nif __name__ == \"__main__\":\n print((solve(*(open(0).read().splitlines()))))\n", "fast_code": "from heapq import heappop, heappush\n\nT = int(input())\nans = []\nfor _ in range(T):\n N, A, B, C, D = map(int, input().split())\n Q = [(0, N)]\n\n S = set()\n an = D * N\n while Q:\n cost, num = heappop(Q)\n if num in S:\n continue\n an = min(an, cost + num * D)\n if num == 1:\n break\n S.add(num)\n q, r = divmod(num, 2)\n if r < 2:\n heappush(Q, (cost + A + r * D, q))\n if r > 0:\n heappush(Q, (cost + A + (2 - r) * D, q + 1))\n q, r = divmod(num, 3)\n if r < 2:\n heappush(Q, (cost + B + r * D, q))\n if r > 1:\n heappush(Q, (cost + B + (3 - r) * D, q + 1))\n q, r = divmod(num, 5)\n if r < 3:\n heappush(Q, (cost + C + r * D, q))\n if r > 2:\n heappush(Q, (cost + C + (5 - r) * D, q + 1))\n ans.append(an)\nprint(*ans, sep=\"\\n\")\n", "slow_time": 156062328242, "fast_time": 21687309533, "speedup": 7.196, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_10"} +{"pair_id": "python_4864", "problem_id": "p04015", "language": "python", "slow_code": "N, A = list(map(int, input().split()))\nx = [int(i) for i in input().split()]\nans = 0\ndp = [[[0] * (50 * N + 1) for j in range(N + 1)] for k in range(N + 1)]\ndp[0][0][0] = 1\nfor j in range(1, N + 1):\n for k in range(N + 1):\n for s in range(50 * N + 1):\n dp[j][k][s] = dp[j - 1][k][s]\n if s >= x[j - 1]:\n dp[j][k][s] += dp[j - 1][k - 1][s - x[j - 1]]\nfor k in range(1, N + 1):\n ans += dp[N][k][k * A]\nprint(ans)\n", "fast_code": "\"\"\"\"\"\"\n\nN, A = list(map(int, input().split()))\nX = list(map(int, input().split()))\nsumX = sum(X)\ndp = [[[0] * (sumX + 1) for _ in range(N + 1)] for _ in range(N + 1)]\nfor j in range(N + 1):\n dp[0][j][0] = 1\nfor i in range(1, N + 1):\n for j in range(1, N + 1):\n x = X[j - 1]\n for k in range(1, sumX + 1):\n dp[i][j][k] += dp[i][j - 1][k]\n if k - x >= 0:\n dp[i][j][k] += dp[i - 1][j - 1][k - x]\nans = 0\nfor i in range(1, N + 1):\n target = A * i\n if target <= sumX:\n ans += dp[i][-1][target]\nprint(ans)\n", "slow_time": 89724549521, "fast_time": 4789553056, "speedup": 18.7334, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_9"} +{"pair_id": "python_13702", "problem_id": "p03774", "language": "python", "slow_code": "from scipy.spatial.distance import cdist\nimport numpy as np\n\nn, m = list(map(int, input().split()))\nst = [list(map(int, input().split())) for _ in range(n)]\ncp = [list(map(int, input().split())) for _ in range(m)]\n\n\ncd = cdist(st, cp, \"cityblock\")\nidx = np.argmin(cd, axis=1)\nfor i in idx:\n print((i + 1))\n", "fast_code": "n, m = list(map(int, input().split()))\nab = []\nfor _ in range(n):\n a, b = (int(x) for x in input().split())\n ab.append([a, b])\ncd = []\nfor _ in range(m):\n c, d = (int(x) for x in input().split())\n cd.append([c, d])\nfor a, b in ab:\n ans = 10000000000000000000000\n for k, c in enumerate(cd):\n memo = abs(a - c[0]) + abs(b - c[1])\n if memo < ans:\n ans = memo\n ansnum = k\n print((ansnum + 1))\n", "slow_time": 29997139149, "fast_time": 59510865, "speedup": 504.0616, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_6"} +{"pair_id": "python_18078", "problem_id": "p03476", "language": "python", "slow_code": "import math\n\n\ndef is_prime(n):\n if n == 1:\n return False\n for k in range(2, int(math.sqrt(n)) + 1):\n if n % k == 0:\n return False\n return True\n\n\nQ = int(eval(input()))\nans = [0] * (10**5 + 1)\nprime = [0] * (10**5 + 1)\nfor i in range(1, 10**5 + 1):\n if is_prime(i):\n prime[i] = 1\n if prime[(i + 1) // 2] == 1:\n ans[i] = ans[i - 1] + 1\n continue\n ans[i] = ans[i - 1]\ndisp_ans = 0\nfor i in range(Q):\n l, r = list(map(int, input().split()))\n print((ans[r] - ans[l - 1]))\n", "fast_code": "import sys\nimport heapq\nimport bisect\n\nmod = 10**9 + 7\ndd = ((-1, 0), (1, 0), (0, -1), (0, 1))\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n return sys.stdin.readline()[:-1]\n\n\ndef IR(n):\n return [I() for _ in range(n)]\n\n\ndef GCD(a, b):\n while b != 0:\n a, b = b, a % b\n return a\n\n\ndef LCM(a, b):\n return a * b // GCD(a, b)\n\n\ndef Eratosthenes(N):\n r = [True] * (N + 1)\n r[0] = False\n r[1] = False\n i = 2\n while i * i <= N:\n if r[i]:\n j = i\n while i * j <= N:\n r[i * j] = False\n j += 1\n i += 1\n return r\n\n\ndef main():\n prime = Eratosthenes(10**5)\n prime_2017 = [False] * (10**5 + 1)\n for i in range(3, 10**5 + 1, 2):\n if prime[i]:\n prime_2017[i] = prime[(i + 1) // 2]\n cnt = [0] * (10**5 + 1)\n nxt = 0\n for i in range(1, 10**5 + 1):\n if prime_2017[i]:\n nxt += 1\n cnt[i] = nxt\n Q = I()\n for _ in range(Q):\n l, r = LI()\n print((cnt[r] - cnt[l - 1]))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 64444325168, "fast_time": 11018403136, "speedup": 5.8488, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_23"} +{"pair_id": "python_11089", "problem_id": "p03816", "language": "python", "slow_code": "from collections import defaultdict\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return list(map(list, sys.stdin.readline().split()))\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = I()\n return l\n\n\ndef LIR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = LI()\n return l\n\n\ndef SR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = S()\n return l\n\n\ndef LSR(n):\n l = [None for i in range(n)]\n for i in range(n):\n l[i] = SR()\n return l\n\n\nmod = 1000000007\n\n\n\"\"\"\"\"\"\n\nn = I()\na = LI()\nd = defaultdict(int)\nfor i in a:\n d[i] += 1\nl = list(d.keys())\nk = 0\nfor i in l:\n k ^= ~(d[i] % 2)\n d[i] = 1\nans = sum(list(d.values()))\nans -= 1 if k % 2 else 0\nprint(ans)\n", "fast_code": "N = int(eval(input()))\nK = len(set(input().split()))\nprint((K + K % 2 - 1))\n", "slow_time": 111635076, "fast_time": 14126027, "speedup": 7.9028, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_3"} +{"pair_id": "python_878", "problem_id": "p03329", "language": "python", "slow_code": "N = int(eval(input()))\narray = []\ncnt6 = 0\nwhile 6**cnt6 <= N:\n array.append(6**cnt6)\n cnt6 += 1\ncnt9 = 0\nwhile 9**cnt9 <= N:\n array.append(9**cnt9)\n cnt9 += 1\na = sorted(list(set(array)))\n\ndp = [i for i in range(N + 1)]\n\nn = 6\nfor n in a:\n for i in range(N + 1):\n if i + n <= N:\n dp[i + n] = min(dp[i] + 1, dp[i + n])\nprint((dp[N]))\n", "fast_code": "import bisect as bi\n\nli6 = [6**i for i in range(7)]\nli9 = [9**i for i in range(6)]\n\n\ndef s69(n):\n if n < 6:\n return n\n else:\n s6 = li6[bi.bisect(li6, n) - 1]\n s9 = li9[bi.bisect(li9, n) - 1]\n return min(n // s6 + s69(n % s6), 1 + s69(n - s9))\n\n\nprint((s69(int(eval(input())))))\n", "slow_time": 469811420, "fast_time": 30328375, "speedup": 15.4908, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_13"} +{"pair_id": "python_7610", "problem_id": "p03835", "language": "python", "slow_code": "import sys\nfrom io import StringIO\nimport unittest\n\n\nclass TestClass(unittest.TestCase):\n def assertIO(self, input, output):\n stdout, stdin = sys.stdout, sys.stdin\n sys.stdout, sys.stdin = StringIO(), StringIO(input)\n resolve()\n sys.stdout.seek(0)\n out = sys.stdout.read()[:-1]\n sys.stdout, sys.stdin = stdout, stdin\n self.assertEqual(out, output)\n\n def test_入力例_1(self):\n input = \"\"\"\"\"\"\n output = \"\"\"\"\"\"\n self.assertIO(input, output)\n\n def test_入力例_2(self):\n input = \"\"\"\"\"\"\n output = \"\"\"\"\"\"\n self.assertIO(input, output)\n\n\ndef resolve():\n K, S = list(map(int, input().split()))\n ans = 0\n for i in range(K + 1):\n for j in range(K + 1):\n if 0 <= S - i - j <= K:\n ans += 1\n print(ans)\n\n\nif __name__ == \"__main__\":\n\n resolve()\n", "fast_code": "k, s = list(map(int, input().split()))\ncount = 0\nfor x in range(min(s + 1, k + 1)):\n for y in range(min(s + 1 - x, k + 1)):\n if 0 <= s - x - y <= k:\n count += 1\nprint(count)\n", "slow_time": 255881830, "fast_time": 49581919, "speedup": 5.1608, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_8"} +{"pair_id": "python_13931", "problem_id": "p03762", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\nN, M = MAP()\nA = LIST()\nB = LIST()\n\nlsm = rsm = 0\nfor i in range(N):\n lsm += A[i] * (N - i - 1)\n rsm += A[i] * i\n lsm %= MOD\n rsm %= MOD\nh = rsm - lsm\nlsm = rsm = 0\nfor i in range(M):\n lsm += B[i] * (M - i - 1)\n rsm += B[i] * i\n lsm %= MOD\n rsm %= MOD\nw = rsm - lsm\nans = h * w % MOD\nprint(ans)\n", "fast_code": "n, m = list(map(int, input().split()))\nx = [0] + list(map(int, input().split()))\ny = [0] + list(map(int, input().split()))\nmod = 10**9 + 7\na1, a2 = 0, 0\nfor k in range(1, n + 1):\n a1 += (k * 2 - n - 1) * x[k]\nfor k in range(1, m + 1):\n a2 += (k * 2 - m - 1) * y[k]\nprint(((a1 * a2) % mod))\n", "slow_time": 134610848, "fast_time": 37649327, "speedup": 3.5754, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_8"} +{"pair_id": "python_389", "problem_id": "p03160", "language": "python", "slow_code": "import string\nimport sys\nfrom itertools import chain, dropwhile, takewhile\n\n\ndef read(\n f, *shape, it=chain.from_iterable(sys.stdin), whitespaces=set(string.whitespace)\n):\n def read_word():\n w = lambda c: c in whitespaces\n nw = lambda c: c not in whitespaces\n return f(\"\".join(takewhile(nw, dropwhile(w, it))))\n\n if not shape:\n return read_word()\n elif len(shape) == 1:\n return [read_word() for _ in range(shape[0])]\n elif len(shape) == 2:\n return [[read_word() for _ in range(shape[1])] for _ in range(shape[0])]\n\n\ndef arr(*shape, fill_value=0):\n if len(shape) == 1:\n return [fill_value] * shape[fill_value]\n elif len(shape) == 2:\n return [[fill_value] * shape[1] for _ in range(shape[0])]\n\n\ndef dbg(**kwargs):\n print(\n \", \".join(\"{} = {}\".format(k, repr(v)) for k, v in kwargs.items()),\n file=sys.stderr,\n )\n\n\ndef main():\n n = read(int)\n hs = read(int, n)\n dp = arr(n)\n dp[1] = abs(hs[1] - hs[0])\n for i in range(2, n):\n dp[i] = min(\n dp[i - 1] + abs(hs[i] - hs[i - 1]), dp[i - 2] + abs(hs[i] - hs[i - 2])\n )\n print(dp[-1])\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N = int(eval(input()))\nh = list(map(int, input().split()))\ndp = [100010] * N\ndp[0] = 0\nfor i in range(1, N):\n dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]))\nprint((dp[N - 1]))\n", "slow_time": 121786768, "fast_time": 31505269, "speedup": 3.8656, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_6"} +{"pair_id": "python_18388", "problem_id": "p02612", "language": "python", "slow_code": "import sys\n\n\ndef Ii():\n return int(sys.stdin.readline())\n\n\ndef Mi():\n return list(map(int, sys.stdin.buffer.readline().split()))\n\n\ndef Li():\n return list(map(int, sys.stdin.buffer.readline().split()))\n\n\nn = Ii()\na = n % 1000\nif a == 0:\n print((0))\nelse:\n print((1000 - a))\n", "fast_code": "print((-int(eval(input())) % 1000))\n", "slow_time": 30368641, "fast_time": 8372547, "speedup": 3.6272, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_1"} +{"pair_id": "python_18394", "problem_id": "p02612", "language": "python", "slow_code": "N = int(eval(input()))\nB = N // 1000\nif N <= 1000:\n print((1000 - N))\nelif N % 1000 == 0:\n print((0))\nelif N > 1000:\n print((((B + 1) * 1000) - N))\n", "fast_code": "n = int(eval(input()))\nprint((-(-n // 1000) * 1000 - n))\n", "slow_time": 21022932, "fast_time": 10342155, "speedup": 2.0327, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_5"} +{"pair_id": "python_4317", "problem_id": "p03264", "language": "python", "slow_code": "k = int(eval(input()))\ncount = 0\nfor i in range(k):\n for j in range(i + 1, k):\n if (i % 2 == 0 and j % 2 == 1) or (i % 2 == 1 and j % 2 == 0):\n count += 1\nprint(count)\n", "fast_code": "k = int(eval(input()))\neven = k // 2\nodd = k - even\nprint((even * odd))\n", "slow_time": 62556705, "fast_time": 11380501, "speedup": 5.4968, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_29"} +{"pair_id": "python_3474", "problem_id": "p02922", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef S():\n return eval(input())\n\n\ndef main():\n a, b = LI()\n c = 1\n ans = 0\n while True:\n if c >= b:\n return ans\n ans += 1\n c -= 1\n c += a\n\n\nprint((main()))\n", "fast_code": "import math\n\na, b = list(map(int, input().split()))\nprint((math.ceil((b - 1) / (a - 1))))\n", "slow_time": 80117443, "fast_time": 12551538, "speedup": 6.3831, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_17"} +{"pair_id": "python_5511", "problem_id": "p03251", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(10000)\n\n\ndef read_int():\n return int(input())\n\n\ndef read_int_n():\n return list(map(int, input().split()))\n\n\ndef read_float():\n return float(input())\n\n\ndef read_float_n():\n return list(map(float, input().split()))\n\n\ndef read_str():\n return input().strip()\n\n\ndef read_str_n():\n return list(map(str, input().split()))\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n error_print(e - s, \"sec\")\n return ret\n\n return wrap\n\n\n@mt\ndef slv(N, M, X, Y, x, y):\n mx = max(x)\n my = min(y)\n error_print(mx, my)\n if mx < my and (my > X and mx < Y):\n return \"No War\"\n return \"War\"\n\n\ndef main():\n N, M, X, Y = read_int_n()\n x = read_int_n()\n y = read_int_n()\n print(slv(N, M, X, Y, x, y))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "i = lambda: list(map(int, input().split()))\nn, m, x, y = i()\nprint((\"No \" * (max(list(i()) + [x]) < min(list(i()) + [y])) + \"War\"))\n", "slow_time": 87179202, "fast_time": 16240764, "speedup": 5.3679, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_11"} +{"pair_id": "python_8064", "problem_id": "p03078", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(100000)\n\n\ndef read_int():\n return int(input())\n\n\ndef read_int_n():\n return list(map(int, input().split()))\n\n\ndef read_float():\n return float(input())\n\n\ndef read_float_n():\n return list(map(float, input().split()))\n\n\ndef read_str():\n return input().strip()\n\n\ndef read_str_n():\n return list(map(str, input().split()))\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n error_print(e - s, \"sec\")\n return ret\n\n return wrap\n\n\n@mt\ndef slv(A, B, C, K):\n A.sort(reverse=True)\n B.sort(reverse=True)\n C.sort(reverse=True)\n\n def s(i, j, k):\n return A[i] + B[j] + C[k]\n\n used = set()\n cand = []\n if 1 < len(A):\n heapq.heappush(cand, (-s(1, 0, 0), (1, 0, 0)))\n used.add((1, 0, 0))\n if 1 < len(B):\n heapq.heappush(cand, (-s(0, 1, 0), (0, 1, 0)))\n used.add((0, 1, 0))\n if 1 < len(C):\n heapq.heappush(cand, (-s(0, 0, 1), (0, 0, 1)))\n used.add((0, 0, 1))\n print(s(0, 0, 0))\n for _ in range(K - 1):\n v, i = heapq.heappop(cand)\n print(-v)\n ti = (i[0] + 1, i[1], i[2])\n if ti[0] < len(A) and ti not in used:\n heapq.heappush(cand, (-s(*ti), ti))\n used.add(ti)\n ti = (i[0], i[1] + 1, i[2])\n if ti[1] < len(B) and ti not in used:\n heapq.heappush(cand, (-s(*ti), ti))\n used.add(ti)\n ti = (i[0], i[1], i[2] + 1)\n if ti[2] < len(C) and ti not in used:\n heapq.heappush(cand, (-s(*ti), ti))\n used.add(ti)\n\n\ndef main():\n\n X, Y, Z, K = read_int_n()\n A = read_int_n()\n B = read_int_n()\n C = read_int_n()\n (slv(A, B, C, K))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "X, Y, Z, K = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\nA.sort(reverse=True)\nB.sort(reverse=True)\nC.sort(reverse=True)\nans = []\nfor i in range(X):\n for j in range(Y):\n if (i + 1) * (j + 1) > K:\n break\n for k in range(Z):\n if (i + 1) * (j + 1) * (k + 1) <= K:\n ans.append(A[i] + B[j] + C[k])\n else:\n break\nprint(*sorted(ans, reverse=True)[:K], sep=\"\\n\")\n", "slow_time": 223697403, "fast_time": 88065762, "speedup": 2.5401, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_10"} +{"pair_id": "python_6447", "problem_id": "p03332", "language": "python", "slow_code": "class Combination:\n \"\"\"\"\"\"\n\n def __init__(self, n, MOD):\n self.fact = [1]\n for i in range(1, n + 1):\n self.fact.append(self.fact[-1] * i % MOD)\n self.inv_fact = [pow(self.fact[i], MOD - 2, MOD) for i in range(n + 1)]\n self.MOD = MOD\n\n def factorial(self, k):\n \"\"\"\"\"\"\n return self.fact[k]\n\n def inverse_factorial(self, k):\n \"\"\"\"\"\"\n return self.inv_fact[k]\n\n def combination(self, k, r):\n \"\"\"\"\"\"\n return (self.fact[k] * self.inv_fact[k - r] * self.inv_fact[r]) % self.MOD\n\n\nn, a, b, k = list(map(int, input().split()))\nMOD = 998244353\ncomb = Combination(n, MOD)\nans = 0\nfor i in range(n + 1):\n if not (k - a * i >= 0 and (k - a * i) % b == 0 and (k - a * i) // b <= n):\n continue\n else:\n ai = i\n bi = (k - a * i) // b\n ans += comb.combination(n, ai) * comb.combination(n, bi)\n ans %= MOD\nprint(ans)\n", "fast_code": "import numpy as np\n\nMOD = 998244353\n\n\nclass Factorial:\n def __init__(self, n, mod):\n self.f = [1]\n self.mod = mod\n for j in range(1, n + 1):\n self.f.append(self.f[-1] * j % mod)\n self.i = [pow(self.f[-1], mod - 2, mod)]\n for j in range(n, 0, -1):\n self.i.append(self.i[-1] * j % mod)\n self.i.reverse()\n\n def factorial(self, j):\n return self.f[j]\n\n def ifactorial(self, j):\n return self.i[j]\n\n def comb(self, n, k):\n return (\n self.f[n] * self.i[n - k] % self.mod * self.i[k] % self.mod if n >= k else 0\n )\n\n\ndef gcd(a, b):\n if a > b:\n a, b = b, a\n if b % a == 0:\n return a\n return gcd(b % a, a)\n\n\nN, A, B, K = list(map(int, input().split()))\nif A < B:\n A, B = B, A\n\nn = min((K + A - 1) // A, N) + 1\nlcm = A * B // gcd(A, B)\nstep = lcm // A\nc = Factorial(N + 1, MOD).comb\n\n\ndef calc(a, b):\n if a > b:\n a, b = b, a\n return (c(N, a) * c(N, b)) % MOD\n\n\ndef count(a, b):\n if a <= N and b <= N:\n return calc(a, b)\n return 0\n\n\ndef maike_satrt(step):\n for i in range(step):\n if (K - A * i) % B == 0:\n return i\n\n\nstart = maike_satrt(step)\n\nans = 0\nfor a in range(start, n, step):\n if A * a > K:\n break\n\n b = (K - A * a) // B\n\n ans += count(a, b)\n ans %= MOD\nprint(ans)\n", "slow_time": 33876778491, "fast_time": 2955702274, "speedup": 11.4615, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_4"} +{"pair_id": "python_222", "problem_id": "p03240", "language": "python", "slow_code": "n = int(eval(input()))\narr = []\nfor i in range(n):\n x, y, h = list(map(int, input().split()))\n arr.append([x, y, h])\nfor i in range(101):\n for j in range(101):\n for k in range(n):\n if arr[k][2] > 0:\n len1 = abs(arr[k][0] - i) + abs(arr[k][1] - j)\n ch = len1 + arr[k][2]\n break\n else:\n continue\n for k in range(n):\n lenk = abs(arr[k][0] - i) + abs(arr[k][1] - j)\n if max(ch - lenk, 0) == arr[k][2]:\n if k == n - 1:\n print((\"{} {} {}\".format(i, j, ch)))\n else:\n continue\n else:\n break\n", "fast_code": "N = int(eval(input()))\nxyh = [list(map(int, input().split())) for i in range(N)]\n\nheight = None\nfound = False\nfor cx in range(0, 101):\n for cy in range(0, 101):\n candidate = 0\n for x, y, h in xyh:\n if h == 0:\n continue\n dx = abs(x - cx)\n dy = abs(y - cy)\n candidate = dx + dy + h\n break\n found = True\n for x, y, h in xyh:\n _h = max(candidate - abs(x - cx) - abs(y - cy), 0)\n if h != _h:\n found = False\n break\n if found is True:\n break\n if found is True:\n break\nheight = candidate if candidate is not None else 0\nprint((cx, cy, height))\n", "slow_time": 8014549402, "fast_time": 1191604347, "speedup": 6.7258, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_8"} +{"pair_id": "python_15641", "problem_id": "p02712", "language": "python", "slow_code": "N = int(eval(input()))\nsum = 0\nfor i in range(1, N + 1):\n if i % 3 == 0:\n continue\n elif i % 5 == 0:\n continue\n else:\n sum += i\nprint(sum)\n", "fast_code": "n = int(eval(input()))\nSum = 0.5 * n * (1 + n)\n\nSum3_5 = 0.5 * (int(n / 3) * (3 + 3 * int(n / 3)) + int(n / 5) * (5 + 5 * int(n / 5)))\nSum15 = 0.5 * (int(n / 15) * (15 + int(n / 15) * 15))\n\nprint((int(Sum - Sum3_5 + Sum15)))\n", "slow_time": 29113501804, "fast_time": 26924401, "speedup": 1081.3055, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_11"} +{"pair_id": "python_7410", "problem_id": "p02912", "language": "python", "slow_code": "import heapq\nimport math\n\n\ndef _heappush_max(heap, item):\n heap.append(item)\n heapq._siftdown_max(heap, 0, len(heap) - 1)\n\n\ndef _heappop_max(heap):\n \"\"\"\"\"\"\n lastelt = heap.pop()\n if heap:\n returnitem = heap[0]\n heap[0] = lastelt\n heapq._siftup_max(heap, 0)\n return returnitem\n return lastelt\n\n\n\"\"\"\"\"\"\nN, M = list(map(int, input().split()))\na = [int(i) for i in input().split()]\nheapq._heapify_max(a)\nfor j in range(M):\n _heappush_max(a, _heappop_max(a) // 2)\nprint((sum(a)))\n", "fast_code": "def calc(N, M, A):\n if N == 1:\n return A[0] // (2**M)\n A.sort(key=lambda a: -a)\n B = [A]\n for _ in range(M):\n i = 0\n m = B[0][0] if B[0] else -1\n for j in range(1, len(B)):\n if B[j] and B[j][0] > m:\n i = j\n m = B[j][0]\n p = B[i].pop(0) // 2\n if len(B) == i + 1:\n B += [[]]\n B[i + 1] += [p]\n if not (B[0]):\n B.pop(0)\n return sum([sum(b) for b in B])\n\n\nN, M = tuple([int(s) for s in input().split(\" \")])\nA = [int(s) for s in input().split()]\nprint((calc(N, M, A)))\n", "slow_time": 374983248, "fast_time": 75792722, "speedup": 4.9475, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_12"} +{"pair_id": "python_16049", "problem_id": "p03599", "language": "python", "slow_code": "a, b, c, d, e, f = list(map(int, input().split()))\nwater = []\nfor i in range(31):\n for j in range(31):\n if a * i + b * j <= f // 100:\n water.append(a * i + b * j)\nwater.pop(water.index(0))\nwater = list(set(water))\nresult = [[0, 0, 0]]\nfor w in water:\n for i in range(301):\n for j in range(301):\n sugar = c * i + d * j\n if sugar <= w * e and sugar + w * 100 <= f:\n result.append(\n [100 * sugar / (sugar + w * 100), (sugar + w * 100), sugar]\n )\nresult.sort(reverse=True)\nprint((result[0][1], result[0][2]))\n", "fast_code": "A, B, C, D, E, F = list(map(int, input().split()))\nws = set()\nfor a in range(F + 1):\n if a * 100 * A > F:\n break\n for b in range(F + 1):\n if a * 100 * A + b * 100 * B > F:\n break\n ws.add(a * 100 * A + b * 100 * B)\nss = set()\nfor c in range(F + 1):\n if c * C > F:\n break\n for d in range(F + 1):\n if c * C + d * D > F:\n break\n ss.add(c * C + d * D)\nos = -1\now = 999\nfor w in ws:\n if w == 0:\n continue\n for s in ss:\n if s + w > F:\n continue\n if w * E < s * 100:\n continue\n if os * (s + w) < s * (os + ow):\n os, ow = s, w\nprint((os + ow, os))\n", "slow_time": 20317356372, "fast_time": 3949896717, "speedup": 5.1438, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_11"} +{"pair_id": "python_2874", "problem_id": "p02264", "language": "python", "slow_code": "import time as ti\n\n\nclass MyQueue(object):\n \"\"\"\"\"\"\n\n def __init__(self):\n \"\"\"\"\"\"\n self.length = 50010\n self.queue = [0] * self.length\n\n self.head = 0\n self.tail = 0\n\n def enqueue(self, process):\n \"\"\"\"\"\"\n self.queue[self.tail] = process\n\n self.tail = (self.tail + 1) % self.length\n\n def dequeue(self):\n \"\"\"\"\"\"\n\n self.queue[self.head] = 0\n self.head = (self.head + 1) % self.length\n\n def is_empty(self):\n \"\"\"\"\"\"\n if self.head == self.tail:\n return True\n else:\n return False\n\n def is_full(self):\n \"\"\"\"\"\"\n if self.tail - self.head >= len(self.queue):\n return True\n else:\n return False\n\n\nclass Process(object):\n \"\"\"\"\"\"\n\n def __init__(self, name=\"\", time=0):\n \"\"\"\"\"\"\n self.name = name\n self.time = time\n\n def forward_time(self, time):\n \"\"\"\"\"\"\n self.time -= time\n return self.time\n\n\ndef time_forward(\n my_queue,\n interval,\n current_time,\n):\n \"\"\"\"\"\"\n value = my_queue.queue[my_queue.head].forward_time(interval)\n if value <= 0:\n current_time += interval + value\n print(my_queue.queue[my_queue.head].name, current_time)\n my_queue.dequeue()\n elif value > 0:\n current_time += interval\n\n my_queue.enqueue(my_queue.queue[my_queue.head])\n my_queue.dequeue()\n return current_time\n\n\nmy_queue = MyQueue()\nn, q = [int(x) for x in input().split()]\ncounter = 0\nwhile counter < n:\n name, time = input().split()\n my_queue.enqueue(Process(name, int(time)))\n counter += 1\n\ncurrent_time = 0\nwhile not my_queue.is_empty():\n current_time = time_forward(my_queue, q, current_time)\n", "fast_code": "import sys\nfrom collections import deque\n\ns = sys.stdin.readlines()\nq = int(s[0].split()[1])\nf = lambda x, y: (x, int(y))\nd = deque(f(*e.split()) for e in s[1:])\nt, a = 0, []\nwhile d:\n k, v = d.popleft()\n if v > q:\n v -= q\n t += q\n d.append([k, v])\n else:\n t += v\n a += [f\"{k} {t}\"]\nprint(*a, sep=\"\\n\")\n", "slow_time": 138359857, "fast_time": 43578246, "speedup": 3.175, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_1"} +{"pair_id": "python_14131", "problem_id": "p02741", "language": "python", "slow_code": "def main():\n A = [\n 1,\n 1,\n 1,\n 2,\n 1,\n 2,\n 1,\n 5,\n 2,\n 2,\n 1,\n 5,\n 1,\n 2,\n 1,\n 14,\n 1,\n 5,\n 1,\n 5,\n 2,\n 2,\n 1,\n 15,\n 2,\n 2,\n 5,\n 4,\n 1,\n 4,\n 1,\n 51,\n ]\n K = int(eval(input()))\n print((A[K - 1]))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "print((ord(\"\u0004\u0001\u000e 3\u0001\u0002 \u0005 \u000f \u0005\"[int(eval(input())) % 14])))\n", "slow_time": 18739211, "fast_time": 5922161, "speedup": 3.1643, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_6"} +{"pair_id": "python_17231", "problem_id": "p02555", "language": "python", "slow_code": "from itertools import accumulate\n\nS = int(eval(input()))\nmod = 10**9 + 7\nif S == 1 or S == 2:\n print((0))\n exit()\ndp = [0] * (S + 1)\ndp[0] = 1\nans = 0\nfor i in range(S):\n cum = list(accumulate(dp))\n for j in range(S, 2, -1):\n dp[j] = cum[j - 3] % mod\n dp[0] = dp[1] = dp[2] = 0\n ans = (ans + dp[S]) % mod\nprint(ans)\n", "fast_code": "MOD = 10**9 + 7\n\n\ndef main():\n S = int(eval(input()))\n if S < 3:\n print((0))\n return\n dp = [0] * (S + 1)\n dp[3] = 1\n for i in range(4, S + 1):\n dp[i] = dp[i - 1] + dp[i - 3]\n dp[i] %= MOD\n print((dp[S]))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 2797213779, "fast_time": 36820384, "speedup": 75.9692, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_7"} +{"pair_id": "python_1600", "problem_id": "p02990", "language": "python", "slow_code": "from math import factorial\n\nN, K = [int(_) for _ in input().split()]\n\nMOD = 10**9 + 7\nkaijo = [0] * (N + 1)\nkaijo[0] = kaijo[1] = 1\nfor i in range(2, N + 1):\n kaijo[i] = (kaijo[i - 1] * i) % MOD\ngyaku = [0] * (N + 1)\ngyaku[0] = gyaku[1] = 1\nfor i in range(2, N + 1):\n\n gyaku[i] = pow(kaijo[i], MOD - 2, MOD)\n\n\ndef calc(n, k):\n\n return factorial(n) // (factorial(n - k) * factorial(k))\n\n\ndef solve():\n for i in range(1, K + 1):\n n = N - K + 1\n k = i\n if k <= n:\n print(((calc(n, k) * calc(K - 1, i - 1)) % MOD))\n else:\n print((0))\n\n\nsolve()\n", "fast_code": "import sys\n\nreadline = sys.stdin.readline\nfrom math import factorial\n\nMOD = 10**9 + 7\n\n\ndef main():\n N, K = list(map(int, readline().rstrip().split()))\n f1 = factorial(N - K + 1)\n f2 = factorial(K - 1)\n f3 = 1\n for i in range(1, K + 1):\n if N - K + 1 - i < 0:\n print((0))\n continue\n ans = f2 // (f3 * factorial(K - i))\n f3 *= i\n ans *= f1 // (f3 * factorial(N - K + 1 - i))\n print((ans % MOD))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 317255639, "fast_time": 53921245, "speedup": 5.8837, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_5"} +{"pair_id": "python_6688", "problem_id": "p03275", "language": "python", "slow_code": "import sys\nfrom itertools import accumulate\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\nclass BIT:\n def __init__(self, init_value):\n self.n = len(init_value)\n self.tree = [0] * (self.n + 1)\n for i in range(1, self.n + 1):\n x = init_value[i - 1]\n while i <= self.n:\n self.tree[i] += x\n i += i & (-i)\n\n def update(self, i, x):\n while i <= self.n:\n self.tree[i] += x\n i += i & (-i)\n return\n\n def query(self, i):\n res = 0\n while i > 0:\n res += self.tree[i]\n i -= i & (-i)\n return res\n\n\nN = I()\nA = LI()\n\n\ndef f(x):\n B = [0] + [1 if A[i] >= x else -1 for i in range(N)]\n B = list(accumulate(B))\n B = [b + N + 1 for b in B]\n\n bit = BIT([0] * (2 * N + 2))\n count = 0\n for i in range(N + 1):\n b = B[i]\n count += bit.query(b)\n bit.update(b, 1)\n if count >= (N * (N + 1) + 3) // 4:\n return True\n return False\n\n\nok = 1\nng = 10**9 + 1\nwhile ok + 1 < ng:\n mid = (ok + ng) // 2\n if f(mid):\n ok = mid\n else:\n ng = mid\nprint(ok)\n", "fast_code": "N = int(eval(input()))\nA = [int(_) for _ in input().split()]\n\n\ndef sub_problem(x):\n S = [0] * (N + 1)\n for i in range(N):\n S[i + 1] = S[i] + 1 if A[i] >= x else S[i] - 1\n geta = abs(min(S)) + 1\n for i in range(N + 1):\n S[i] += geta\n forward = 0\n size = max(S)\n bit = [0] * (size + 1)\n for s in S:\n i = s\n while i > 0:\n forward += bit[i]\n i -= i & -i\n i = s\n while i <= size:\n bit[i] += 1\n i += i & -i\n return forward >= (M + 1) // 2\n\n\nM = N * (N + 1) // 2\nsorted_A = sorted(A)\ninf = 0\nsup = N\nwhile sup - inf > 1:\n mid = (sup + inf) // 2\n x = sorted_A[mid]\n if sub_problem(x):\n inf = mid\n else:\n sup = mid\nprint((sorted_A[inf]))\n", "slow_time": 119661320, "fast_time": 40472668, "speedup": 2.9566, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_3"} +{"pair_id": "python_15540", "problem_id": "p02695", "language": "python", "slow_code": "from copy import deepcopy\n\nN, M, Q = list(map(int, input().split()))\na, b, c, d = [], [], [], []\nfor i in range(Q):\n tmp = list(map(int, input().split()))\n a.append(tmp[0])\n b.append(tmp[1])\n c.append(tmp[2])\n d.append(tmp[3])\nans = 0\n\n\ndef dfs(A):\n global ans\n if len(A) == N + 1:\n now = 0\n for i in range(Q):\n if A[b[i]] - A[a[i]] == c[i]:\n now += d[i]\n ans = max(ans, now)\n return\n A.append(A[-1])\n while A[-1] <= M:\n dfs(deepcopy(A))\n A[-1] += 1\n\n\ndfs([1])\nprint(ans)\n", "fast_code": "from collections import deque\n\n\ndef calc(nums):\n ret = 0\n for a, b, c, d in req:\n if nums[b - 1] - nums[a - 1] == c:\n ret += d\n return ret\n\n\nn, m, q = list(map(int, input().split()))\nreq = [list(map(int, input().split())) for _ in range(q)]\nans = 0\nque = deque()\n\nfor i in range(1, m + 1):\n que.append([i])\nwhile que:\n seq = que.pop()\n if len(seq) == n:\n score = calc(seq)\n ans = max(ans, score)\n else:\n for i in range(seq[-1], m + 1):\n seq_next = seq + [i]\n que.append(seq_next)\nprint(ans)\n", "slow_time": 6825521871, "fast_time": 1245298365, "speedup": 5.481, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_15"} +{"pair_id": "python_12702", "problem_id": "p02703", "language": "python", "slow_code": "def main():\n import heapq\n\n def dijkstra(graph, s, cd, c):\n dist = [[float(\"inf\")] * 2505 for _ in range(n)]\n q = []\n dist[s][c] = 0\n heapq.heappush(q, (0, s, c))\n while q:\n d, p, c = heapq.heappop(q)\n if dist[p][c] < d:\n continue\n for nn, nc, nt in graph[p]:\n if c >= nc and dist[nn][c - nc] > d + nt:\n dist[nn][c - nc] = d + nt\n heapq.heappush(q, (d + nt, nn, c - nc))\n if c + cd[p][0] < 2500:\n if dist[p][c + cd[p][0]] > d + cd[p][1]:\n dist[p][c + cd[p][0]] = d + cd[p][1]\n heapq.heappush(q, (d + cd[p][1], p, c + cd[p][0]))\n else:\n if dist[p][2500] > d + cd[p][1]:\n dist[p][2500] = d + cd[p][1]\n heapq.heappush(q, (d + cd[p][1], p, 2500))\n for i in dist[1:]:\n print((min(i)))\n\n n, m, s = list(map(int, input().split()))\n E = [[] for i in range(n)]\n la = []\n for i in range(m):\n u, v, a, b = list(map(int, input().split()))\n u -= 1\n v -= 1\n la.append(a)\n E[u].append((v, a, b))\n E[v].append((u, a, b))\n cd = [list(map(int, input().split())) for i in range(n)]\n dijkstra(E, 0, cd, min(s, 2500))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\ninput = lambda: sys.stdin.readline().rstrip()\nsys.setrecursionlimit(max(1000, 10**9))\nwrite = lambda x: sys.stdout.write(x + \"\\n\")\nn, m, s = list(map(int, input().split()))\ncd = [None] * n\nfrom collections import defaultdict\n\nns = defaultdict(set)\nnns = defaultdict(set)\nuvab = [None] * m\nfor i in range(m):\n u, v, a, b = list(map(int, input().split()))\n u -= 1\n v -= 1\n uvab[i] = (u, v, a, b)\n ns[u].add((a, b, v))\n ns[v].add((a, b, u))\nfor i in range(n):\n cd[i] = list(map(int, input().split()))\nms = max(item[2] for item in uvab) * (n - 1)\nfor u in range(n):\n for ss in range(ms + 1):\n for a, b, v in ns[u]:\n if ss >= a:\n nns[u, ss].add((b, (v, ss - a)))\n c, d = cd[u]\n if ss + c <= ms:\n nns[u, ss].add((d, (u, ss + c)))\nns = nns\n\n\ndef dijkstra(start):\n import heapq\n\n vals = {}\n h = [(0, start)]\n vals[start] = 0\n while h:\n val, u = heapq.heappop(h)\n for d, v in ns[u]:\n if v not in vals or vals[v] > val + d:\n vals[v] = val + d\n heapq.heappush(h, (vals[v], v))\n return vals\n\n\ns = min(s, ms)\nvals = dijkstra((0, s))\nans = [None] * (n - 1)\nfor u in range(1, n):\n ans[u - 1] = min(vals[u, s] for s in range(ms + 1))\nwrite(\"\\n\".join(map(str, ans)))\n", "slow_time": 4949677909, "fast_time": 955969372, "speedup": 5.1777, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_12"} +{"pair_id": "python_14322", "problem_id": "p03025", "language": "python", "slow_code": "N, A, B, C = list(map(int, input().split()))\nmod = 10**9 + 7\n\n\nFACT = [1]\nfor i in range(1, 2 * 10**5 + 1):\n FACT.append(FACT[-1] * i % mod)\nFACT_INV = [pow(FACT[-1], mod - 2, mod)]\nfor i in range(2 * 10**5, 0, -1):\n FACT_INV.append(FACT_INV[-1] * i % mod)\nFACT_INV = FACT_INV[::-1]\n\n\ndef Combi(N, K):\n return FACT[N] * FACT_INV[N - K] * FACT_INV[K] % mod\n\n\nANS = 0\nSUM = A + B\nA_n = pow(A, N, mod) * pow(pow(SUM, mod - 2, mod), N, mod) % mod\nB_n = pow(B, N, mod) * pow(pow(SUM, mod - 2, mod), N, mod) % mod\nSUMINV = pow(SUM, mod - 2, mod)\nfor i in range(N):\n ANS = (\n ANS\n + (A_n * pow(B, i, mod) + B_n * pow(A, i, mod))\n * Combi(N - 1 + i, i)\n * pow(SUMINV, i, mod)\n * (N + i)\n ) % mod\nprint((ANS * 100 * pow(100 - C, mod - 2, mod) % mod))\n", "fast_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n res = list(sys.stdin.readline())\n if res[-1] == \"\\n\":\n return res[:-1]\n return res\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef solve():\n n, a, b, c = LI()\n inv_100 = pow(100, mod - 2, mod)\n a = a * inv_100 % mod\n b = b * inv_100 % mod\n c = (1 - c * inv_100) % mod\n c = pow(c, mod - 2, mod)\n fact = [1]\n N = 2 * n\n for i in range(1, N + 1):\n fact.append(fact[-1] * i % mod)\n inv = [None] * (N + 1)\n inv[N] = pow(fact[N], mod - 2, mod)\n for i in range(N)[::-1]:\n inv[i] = inv[i + 1] * (i + 1) % mod\n ans = 0\n fa, fb, fc = pow(b, n, mod), pow(a, n, mod), pow(c, n + 1, mod)\n for i in range(n):\n ans += inv[i] * fact[n + i] * fc * (fb + fa) % mod\n ans %= mod\n fa *= a\n fb *= b\n fc *= c\n if fa >= mod:\n fa %= mod\n if fb >= mod:\n fb %= mod\n if fc >= mod:\n fc %= mod\n print((ans * inv[n - 1] % mod))\n return\n\n\nif __name__ == \"__main__\":\n solve()\n", "slow_time": 32980310839, "fast_time": 251518847, "speedup": 131.1246, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_7"} +{"pair_id": "python_16070", "problem_id": "p03599", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\nA, B, C, D, E, F = MAP()\nA *= 100\nB *= 100\n\nlimit = E / (100 + E)\n\ndp = list2d(F + 1, F + 1, 0)\ndp[0][0] = 1\nfor i in range(F + 1):\n for j in range(F + 1):\n\n if i + j > F:\n break\n\n if dp[i][j]:\n if i + A <= F:\n dp[i + A][j] = 1\n if i + B <= F:\n dp[i + B][j] = 1\n if j + C <= F:\n dp[i][j + C] = 1\n if j + D <= F:\n dp[i][j + D] = 1\nans1 = ans2 = 0\nmx = -1\nfor a in range(F + 1):\n for b in range(F + 1):\n if a == b == 0:\n continue\n if a + b > F:\n break\n if dp[a][b]:\n x = b / (a + b)\n\n if x > limit:\n continue\n\n if mx < x:\n mx = x\n ans1 = a + b\n ans2 = b\nprint((ans1, ans2))\n", "fast_code": "def solve():\n A, B, C, D, E, F = list(map(int, input().split()))\n memo = {}\n for a in range(31):\n for b in range(31):\n for c in range(101):\n for d in range(101):\n w = (100 * A) * a + (100 * B) * b\n s = C * c + D * d\n if w == 0:\n break\n if w + s > F:\n break\n else:\n if w / 100 * E >= s:\n density = 100 * s / (w + s)\n memo[a, b, c, d] = density\n max_v = max(memo.values())\n for k, v in list(memo.items()):\n if v == max_v:\n print(\n (\n (100 * A) * k[0] + (100 * B) * k[1] + C * k[2] + D * k[3],\n C * k[2] + D * k[3],\n )\n )\n break\n\n\nif __name__ == \"__main__\":\n solve()\n", "slow_time": 470367340297, "fast_time": 12808802269, "speedup": 36.7222, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_19"} +{"pair_id": "python_11524", "problem_id": "p02621", "language": "python", "slow_code": "N = 10**7\n\n\nfor i in range(N):\n pass\n\na = int(eval(input()))\nprint((a + a**2 + a**3))\n", "fast_code": "s = input()\ns = int(s)\nprint(s + s**2 + s**3)\n", "slow_time": 202512920251, "fast_time": 8069517, "speedup": 25096.0399, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_20"} +{"pair_id": "python_8721", "problem_id": "p03371", "language": "python", "slow_code": "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nINF = 1 << 60\n\n\ndef main():\n A, B, C, X, Y = list(map(int, readline().split()))\n ans = INF\n for k in range(0, 2 * max(X, Y) + 1, 2):\n i = max(0, X - k // 2)\n j = max(0, Y - k // 2)\n if ans > A * i + B * j + C * k:\n ans = A * i + B * j + C * k\n print(ans)\n return\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "\"\"\"\"\"\"\n\n\"\"\"\"\"\"\nA, B, C, X, Y = list(map(int, input().split()))\nif A + B > 2 * C:\n ans1 = max(X, Y) * C * 2\n if X > Y:\n ans2 = Y * C * 2 + abs(X - Y) * A\n else:\n ans2 = X * C * 2 + abs(X - Y) * B\n print((min(ans1, ans2)))\nelse:\n ans1 = X * A + Y * B\n print(ans1)\n", "slow_time": 798774011, "fast_time": 32104618, "speedup": 24.8803, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_2"} +{"pair_id": "python_3536", "problem_id": "p02922", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef S():\n return eval(input())\n\n\ndef main():\n a, b = LI()\n c = 1\n ans = 0\n while True:\n if c >= b:\n return ans\n ans += 1\n c -= 1\n c += a\n\n\nprint((main()))\n", "fast_code": "a, b = list(map(int, input().split()))\nc = \"必要な電源タップ数は\"\nd = \"個です。\"\ncount = 0\ntotal = 1\nwhile True:\n\n if total >= b:\n break\n total += a - 1\n count += 1\nprint(count)\n", "slow_time": 80117443, "fast_time": 20130768, "speedup": 3.9799, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_26"} +{"pair_id": "python_13743", "problem_id": "p02385", "language": "python", "slow_code": "import itertools\n\n\ndef roll(dice, commands):\n for command in commands:\n if command == \"N\":\n dice[0], dice[1], dice[5], dice[4] = dice[1], dice[5], dice[4], dice[0]\n elif command == \"W\":\n dice[0], dice[3], dice[5], dice[2] = dice[2], dice[0], dice[3], dice[5]\n\n\ndef solve():\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n for i in range(4):\n for j in range(4):\n for commands in itertools.permutations(\"N\" * i + \"W\" * j):\n a = A[::]\n roll(a, commands)\n if B == a:\n return True\n return False\n\n\nif __name__ == \"__main__\":\n print((\"Yes\" if solve() else \"No\"))\n", "fast_code": "x = list(map(int, input().split()))\ny = list(map(int, input().split()))\nz = [0, 1, 2]\nfor i in range(6):\n order = [0, 0, 0]\n for j in range(3):\n if {x[j], x[-j - 1]} != {y[z[j]], y[-z[j] - 1]}:\n break\n if x[j] == y[z[j]]:\n order[j] = 1\n if x[j] == x[-j - 1]:\n order[j] = 2\n else:\n if 2 in order or (i < 3) == sum(order) % 2:\n print(\"Yes\")\n break\n z = [z[2], z[0], z[1]]\n if i == 2:\n z = [z[0], z[2], z[1]]\nelse:\n print(\"No\")\n", "slow_time": 474595466, "fast_time": 59631250, "speedup": 7.9588, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_17"} +{"pair_id": "python_2328", "problem_id": "p03486", "language": "python", "slow_code": "import sys\n\n\ndef main():\n s, t = sys.stdin.read().split()\n n, m = len(s), len(t)\n s = sorted(s)\n t = list(reversed(sorted(t)))\n if n < m:\n for i in range(n):\n if s[i] < t[i]:\n ans = \"Yes\"\n break\n elif s[i] > t[i]:\n ans = \"No\"\n break\n else:\n ans = \"Yes\"\n else:\n for i in range(m):\n if s[i] < t[i]:\n ans = \"Yes\"\n break\n elif s[i] > t[i]:\n ans = \"No\"\n break\n else:\n ans = \"No\"\n print(ans)\n\n\nif __name__ == \"__main__\":\n\n main()\n", "fast_code": "s = sorted(list(input().strip()))\nt = sorted(list(input().strip()), reverse=True)\nif s < t:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 48030642, "fast_time": 16226644, "speedup": 2.96, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_18"} +{"pair_id": "python_13947", "problem_id": "p03762", "language": "python", "slow_code": "import sys\nfrom itertools import accumulate\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\nN, M = MAP()\nA = LIST()\nB = LIST()\n\nA2 = []\nfor i in range(N - 1):\n A2.append(A[i + 1] - A[i])\nB2 = []\nfor i in range(M - 1):\n B2.append(B[i + 1] - B[i])\nA2 = [0] + list(accumulate(A2))\nB2 = [0] + list(accumulate(B2))\n\nlsm = rsm = 0\nfor i in range(N):\n lsm += A2[i] * (N - i - 1)\n rsm += A2[i] * i\n lsm %= MOD\n rsm %= MOD\nh = rsm - lsm\nlsm = rsm = 0\nfor i in range(M):\n lsm += B2[i] * (M - i - 1)\n rsm += B2[i] * i\n lsm %= MOD\n rsm %= MOD\nw = rsm - lsm\nans = h * w % MOD\nprint(ans)\n", "fast_code": "MOD = 10**9 + 7\nn, m = list(map(int, input().split()))\nX = list(map(int, input().split()))\nY = list(map(int, input().split()))\nX.sort()\nY.sort()\nxx, yy = 0, 0\nfor i in range(n):\n xx += X[i] * i\n xx -= X[i] * (n - i - 1)\nfor i in range(m):\n yy += Y[i] * i\n yy -= Y[i] * (m - i - 1)\nprint((xx * yy % MOD))\n", "slow_time": 159803774, "fast_time": 40431050, "speedup": 3.9525, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_22"} +{"pair_id": "python_15100", "problem_id": "p03038", "language": "python", "slow_code": "import sys\n\ns2nn = lambda s: [int(c) for c in s.split(\" \")]\nss2nn = lambda ss: [int(s) for s in ss]\nss2nnn = lambda ss: [s2nn(s) for s in ss]\ni2s = lambda: sys.stdin.readline().rstrip()\ni2n = lambda: int(i2s())\ni2nn = lambda: s2nn(i2s())\nii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]\nii2sss = lambda n: [list(sys.stdin.readline().rstrip()) for _ in range(n)]\nii2nn = lambda n: ss2nn(ii2ss(n))\nii2nnn = lambda n: ss2nnn(ii2ss(n))\n\n\ndef main():\n N, M = i2nn()\n A = i2nn()\n BC = ii2nnn(M)\n\n A.sort()\n\n BC.sort(key=lambda v: v[1])\n BC.reverse()\n\n i = 0\n j = 0\n k = 0\n while i < N and j < M:\n b, c = BC[j]\n while i < N and k < b:\n A[i] = max(A[i], c)\n i += 1\n k += 1\n j += 1\n k = 0\n n = sum(A)\n print(n)\n\n\nmain()\n", "fast_code": "n, m = list(map(int, input().split()))\ncards = sorted(list(map(int, input().split())))\nope = [list(map(int, input().split())) for i in range(m)]\nope.sort(key=lambda x: x[1], reverse=True)\ni, j, k = 0, 0, 0\nwhile i < n and j < m and cards[i] < ope[j][1]:\n cards[i] = ope[j][1]\n i += 1\n k += 1\n if k >= ope[j][0]:\n j += 1\n k = 0\nprint((sum(cards)))\n", "slow_time": 74366880, "fast_time": 35306915, "speedup": 2.1063, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_2"} +{"pair_id": "python_4242", "problem_id": "p03264", "language": "python", "slow_code": "k = int(eval(input()))\ncount = 0\nfor i in range(k):\n for j in range(i + 1, k):\n if (i % 2 == 0 and j % 2 == 1) or (i % 2 == 1 and j % 2 == 0):\n count += 1\nprint(count)\n", "fast_code": "print((int(eval(input())) ** 2 >> 2))\n", "slow_time": 62556705, "fast_time": 8078783, "speedup": 7.7433, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_7"} +{"pair_id": "python_14864", "problem_id": "p02623", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**9)\n\n\ndef int1(x):\n return int(x) - 1\n\n\ndef II():\n return int(eval(input()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef MI1():\n return list(map(int1, input().split()))\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef LI1():\n return list(map(int1, input().split()))\n\n\ndef LLI(rows_number):\n return [LI() for _ in range(rows_number)]\n\n\ndef MS():\n return input().split()\n\n\ndef LS():\n return list(eval(input()))\n\n\ndef LLS(rows_number):\n return [LS() for _ in range(rows_number)]\n\n\ndef printlist(lst, k=\" \"):\n print((k.join(list(map(str, lst)))))\n\n\nINF = float(\"inf\")\n\n\nfrom itertools import (\n combinations as comb,\n combinations_with_replacement as comb_w,\n accumulate,\n product,\n permutations,\n)\n\n\nfrom bisect import bisect_right, bisect_left\n\n\ndef solve():\n N, M, K = MI()\n A = LI()\n B = LI()\n A = [0] + list(accumulate(A))\n B = [0] + list(accumulate(B))\n ans = 0\n for i, a in enumerate(A):\n if a > K:\n break\n idx = bisect_right(B, K - a) - 1\n ans = max(ans, i + idx)\n print(ans)\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "import itertools as it, bisect as bs\n\nf = lambda: list(map(int, input().split()))\ng = lambda: [0] + [*it.accumulate(f())]\nn, m, k = f()\nA, B = g(), g()\na, j = 0, m\nfor i in range(n + 1):\n t = bs.bisect(B, k - A[i])\n if t:\n a = max(a, i + t - 1)\nprint(a)\n", "slow_time": 100466791, "fast_time": 30403476, "speedup": 3.3045, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_18"} +{"pair_id": "python_2891", "problem_id": "p02559", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom fractions import Fraction\nfrom functools import lru_cache, reduce\nfrom itertools import (\n combinations,\n combinations_with_replacement,\n product,\n permutations,\n accumulate,\n)\nfrom operator import add, mul, sub, itemgetter, attrgetter\nimport sys\n\nreadline = sys.stdin.readline\nINF = 2**62 - 1\n\n\ndef read_int():\n return int(readline())\n\n\ndef read_int_n():\n return list(map(int, readline().split()))\n\n\ndef read_float():\n return float(readline())\n\n\ndef read_float_n():\n return list(map(float, readline().split()))\n\n\ndef read_str():\n return readline().strip()\n\n\ndef read_str_n():\n return readline().strip().split()\n\n\ndef ep(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.perf_counter()\n ret = f(*args, **kwargs)\n e = time.perf_counter()\n ep(e - s, \"sec\")\n return ret\n\n return wrap\n\n\nclass SegmentTree:\n def __init__(self, array, operator, identity_element):\n _len = len(array)\n self.__op = operator\n self.__size = 1 << (_len - 1).bit_length()\n self.__tree = (\n [identity_element] * self.__size\n + array\n + [identity_element] * (self.__size - _len)\n )\n self.__ie = identity_element\n for i in range(self.__size - 1, 0, -1):\n self.__tree[i] = operator(self.__tree[i * 2], self.__tree[i * 2 + 1])\n\n def update(self, i, v):\n i += self.__size\n self.__tree[i] = v\n while i:\n i //= 2\n self.__tree[i] = self.__op(self.__tree[i * 2], self.__tree[i * 2 + 1])\n\n def query(self, l, r):\n \"\"\"\"\"\"\n l += self.__size\n r += self.__size\n ret = self.__ie\n while l < r:\n if l & 1:\n ret = self.__op(ret, self.__tree[l])\n l += 1\n if r & 1:\n r -= 1\n ret = self.__op(ret, self.__tree[r])\n l //= 2\n r //= 2\n return ret\n\n def __getitem__(self, key):\n return self.__tree[key + self.__size]\n\n\n@mt\ndef slv(N, A, Q):\n st = SegmentTree(A, add, 0)\n ans = []\n for q in Q:\n if q[0] == 0:\n _, p, x = q\n st.update(p, st[p] + x)\n else:\n _, l, r = q\n ans.append(st.query(l, r))\n return ans\n\n\ndef main():\n N, Q = read_int_n()\n A = read_int_n()\n Q = [read_int_n() for _ in range(Q)]\n print(*slv(N, A, Q), sep=\"\\n\")\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\nn, q = list(map(int, input().split()))\nBIT = [0] * n\n\n\ndef ADD(x, y):\n while x <= n:\n BIT[x - 1] += y\n x += x & (-x)\n\n\ndef SUM(l):\n ret = 0\n while l >= 1:\n ret += BIT[l - 1]\n l -= l & (-l)\n return ret\n\n\nIN = list(map(int, input().split()))\nfor i in range(n):\n ADD(i + 1, IN[i])\nfor i in range(q):\n t, a, b = list(map(int, input().split()))\n if t == 0:\n ADD(a + 1, b)\n else:\n print((SUM(b) - SUM(a)))\n", "slow_time": 205458585, "fast_time": 58638171, "speedup": 3.5038, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_25"} +{"pair_id": "python_1975", "problem_id": "p02821", "language": "python", "slow_code": "import numpy\n\nn, m = [int(i) for i in input().split()]\nA = [int(i) for i in input().split()]\nsup_A = 10**5\nB = [0] * (1 << 18)\nfor a in A:\n B[a] += 1\nC = numpy.fft.fft(B)\nD = numpy.fft.ifft(C * C)\nans = 0\ncnt = 0\nfor i in range(2 * sup_A, -1, -1):\n d = int(D[i].real + 0.5)\n if cnt + d >= m:\n ans += (m - cnt) * i\n break\n cnt += d\n ans += i * d\nprint(ans)\n", "fast_code": "from bisect import bisect_left\nfrom bisect import bisect_right\n\nn, m = list(map(int, input().split()))\na = list(map(int, input().split()))\na = sorted(a)\na_count = [0] * 100010\na_sum = [0] * 100010\nfor i in range(n):\n a_count[a[i]] += 1\n a_sum[a[i]] += a[i]\nfor i in range(100005, -1, -1):\n a_count[i] += a_count[i + 1]\n a_sum[i] += a_sum[i + 1]\n\n\ndef chk(x):\n case = 0\n for i in range(n):\n if 0 <= x - a[i] <= 10**5 + 5:\n case += a_count[x - a[i]]\n elif x - a[i] < 0:\n case += n\n if case >= m:\n ch = True\n else:\n ch = False\n return ch\n\n\nl = 2 * a[-1] + 1\nr = 1\nwhile abs(r - l) > 1:\n kk = (r + l) // 2\n if chk(kk):\n r = kk\n else:\n l = kk\nans = 0\nsm = sum(a)\nl = r\ncase = 0\nfor i in range(n):\n num = n - bisect_right(a, l - a[i] - 1)\n case += num\n ans += num * a[i] * 2\nans -= (case - m) * l\nprint(ans)\n", "slow_time": 48440866844, "fast_time": 8899954914, "speedup": 5.4428, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_29"} +{"pair_id": "python_13424", "problem_id": "p03298", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\nfrom collections import *\n\nN = int(eval(input()))\ns = input()[:-1]\ncnt = defaultdict(int)\nfor S in range(1 << N):\n red, blue = [], []\n for i in range(N):\n if (S >> i) & 1:\n red.append(s[i])\n else:\n blue.append(s[i])\n cnt[(\"\".join(red), \"\".join(blue))] += 1\ns = s[::-1]\nans = 0\nfor S in range(1 << N):\n red, blue = [], []\n for i in range(N):\n if (S >> i) & 1:\n red.append(s[i])\n else:\n blue.append(s[i])\n ans += cnt[(\"\".join(blue), \"\".join(red))]\nprint(ans)\n", "fast_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n res = list(sys.stdin.readline())\n if res[-1] == \"\\n\":\n return res[:-1]\n return res\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef A():\n return\n\n\ndef B():\n return\n\n\ndef C():\n n = I()\n s = S()\n for i in range(2 * n):\n s[i] = ord(s[i]) - 96\n k = 27\n m = 1 << n\n p = [1 << j for j in range(n)]\n d = defaultdict(lambda: 0)\n l = [(0, 0)]\n for i in s[:n][::-1]:\n l = [(x[0] * k + i, x[1]) for x in l] + [(x[0], x[1] * k + i) for x in l]\n for i in l:\n d[i] += 1\n ans = 0\n l = [(0, 0)]\n for i in s[n:]:\n l = [(x[0] * k + i, x[1]) for x in l] + [(x[0], x[1] * k + i) for x in l]\n for i in l:\n ans += d[i]\n print(ans)\n return\n\n\ndef D():\n return\n\n\ndef E():\n return\n\n\ndef F():\n return\n\n\nif __name__ == \"__main__\":\n C()\n", "slow_time": 1235050271, "fast_time": 377172094, "speedup": 3.2745, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_16"} +{"pair_id": "python_17117", "problem_id": "p02555", "language": "python", "slow_code": "from itertools import accumulate\n\nS = int(eval(input()))\nmod = 10**9 + 7\nif S == 1 or S == 2:\n print((0))\n exit()\ndp = [0] * (S + 1)\ndp[0] = 1\nans = 0\nfor i in range(S):\n cum = list(accumulate(dp))\n for j in range(S, 2, -1):\n dp[j] = cum[j - 3] % mod\n dp[0] = dp[1] = dp[2] = 0\n ans = (ans + dp[S]) % mod\nprint(ans)\n", "fast_code": "s = int(eval(input()))\na = [0] * 2001\na[3] = 1\nfor i in range(4, s + 1):\n a[i] = a[i - 3] + a[i - 1]\nmod = 10**9 + 7\nprint((a[s] % mod))\n", "slow_time": 2797213779, "fast_time": 26198895, "speedup": 106.7684, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_9"} +{"pair_id": "python_1943", "problem_id": "p02821", "language": "python", "slow_code": "import sys\nimport math\nfrom collections import defaultdict\n\nsys.setrecursionlimit(10**7)\n\n\ndef input():\n return sys.stdin.readline()[:-1]\n\n\nmod = 10**9 + 7\n\n\ndef I():\n return int(eval(input()))\n\n\ndef II():\n return list(map(int, input().split()))\n\n\ndef III():\n return list(map(int, input().split()))\n\n\ndef Line(N, num):\n if N <= 0:\n return [[] for _ in range(num)]\n elif num == 1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return list(map(list, list(zip(*read_all))))\n\n\nimport numpy as np\n\n\ndef FFT(a, b):\n bit = (len(a) + len(b)).bit_length() + 1\n L = 2**bit\n fa, fb = np.fft.rfft(a, L), np.fft.rfft(b, L)\n c = np.rint(np.fft.irfft(fa * fb, L)).astype(np.int64)\n return c[: len(a) + len(b) - 1]\n\n\nN, M = II()\nA = III()\nh = [0] * (max(A))\nfor a in A:\n h[a - 1] += 1\nconv = np.append([0, 0], FFT(h, h))\nans = 0\ncount = 0\nfor k in range(2, 2 * max(A) + 1)[::-1]:\n if conv[k]:\n num = min(M - count, conv[k])\n count += num\n ans += k * num\n if count == M:\n break\nprint(ans)\n", "fast_code": "from itertools import accumulate\n\nn, m = list(map(int, input().split()))\na = list(map(int, input().split()))\na.sort(reverse=True)\nb = [0] * (2 * a[0] + 1)\nfor i in range(n):\n b[a[i]] += 1\nb = list(accumulate(b[::-1]))[::-1]\ns = list(accumulate([0] + a))\nok = 0\nng = 2 * a[0] + 1\nwhile ng - ok > 1:\n mid = (ng + ok) // 2\n cnt = 0\n for i in range(n):\n cnt += b[max(0, mid - a[i])]\n if cnt >= m:\n ok = mid\n else:\n ng = mid\ncnt = 0\nans = 0\nfor i in range(n):\n t = min(b[max(0, ng - a[i])], m - cnt)\n ans += s[t] + a[i] * t\n cnt += t\nans += (m - cnt) * ok\nprint(ans)\n", "slow_time": 694693232, "fast_time": 88054756, "speedup": 7.8893, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_0"} +{"pair_id": "python_6461", "problem_id": "p03332", "language": "python", "slow_code": "MOD = 998244353\nMAX = int(3e5 + 1)\n\n\ndef div(a, b):\n return a * pow(b, MOD - 2, MOD) % MOD\n\n\nFACT = [1] * (MAX + 1)\nfor i in range(1, MAX + 1):\n FACT[i] = (i * FACT[i - 1]) % MOD\nINV = [1] * (MAX + 1)\nINV[MAX] = div(1, FACT[MAX])\nfor i in range(MAX, 0, -1):\n INV[i - 1] = (INV[i] * i) % MOD\n\n\ndef main():\n N, A, B, K = list(map(int, input().split()))\n ans = 0\n\n for x in range(N + 1):\n By = K - x * A\n if By >= 0 and By % B == 0 and By <= B * N:\n y = By // B\n tmp1 = FACT[N] * INV[x] * INV[N - x] % MOD\n tmp2 = FACT[N] * INV[y] * INV[N - y] % MOD\n ans = (ans + tmp1 * tmp2) % MOD\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "def main():\n class Factorial:\n def __init__(self, n, mod):\n self.f = [1]\n self.mod = mod\n for j in range(1, n + 1):\n self.f.append(self.f[-1] * j % mod)\n self.i = [pow(self.f[-1], mod - 2, mod)]\n for j in range(n, 0, -1):\n self.i.append(self.i[-1] * j % mod)\n self.i.reverse()\n\n def factorial(self, j):\n return self.f[j]\n\n def ifactorial(self, j):\n return self.i[j]\n\n def comb(self, n, k):\n return (\n self.f[n] * self.i[n - k] % self.mod * self.i[k] % self.mod\n if n >= k\n else 0\n )\n\n N, A, B, K = list(map(int, input().split()))\n MOD = 998244353\n c = Factorial(N + 1, MOD).comb\n ans = 0\n for a in range(N + 1):\n b = (K - (A * a)) // B\n if A * a + B * b == K and 0 <= b <= N:\n ans += (c(N, a) * c(N, b)) % MOD\n ans %= MOD\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 37432130329, "fast_time": 5123412031, "speedup": 7.3061, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_18"} +{"pair_id": "python_6639", "problem_id": "p03803", "language": "python", "slow_code": "import sys, math\nfrom functools import lru_cache\nfrom itertools import accumulate\n\nsys.setrecursionlimit(10**9)\nMOD = 10**9 + 7\n\n\ndef input():\n return sys.stdin.readline()[:-1]\n\n\ndef mi():\n return list(map(int, input().split()))\n\n\ndef ii():\n return int(eval(input()))\n\n\ndef i2(n):\n tmp = [list(mi()) for i in range(n)]\n return [list(i) for i in zip(*tmp)]\n\n\nA, B = mi()\nif A == B:\n print(\"Draw\")\nelif A == 1:\n print(\"Alice\")\nelif B == 1:\n print(\"Bob\")\nelse:\n if A > B:\n print(\"Alice\")\n else:\n print(\"Bob\")\n", "fast_code": "a, b = list(map(int, input().split()))\nprint(([\"Draw\", [\"Bob\", \"Alice\"][(a - 2) % 13 > (b - 2) % 13]][a != b]))\n", "slow_time": 58300100, "fast_time": 14930108, "speedup": 3.9049, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_6"} +{"pair_id": "python_376", "problem_id": "p03164", "language": "python", "slow_code": "def main():\n N, W = list(map(int, input().split()))\n\n dp = [10**9 + 1 for _ in range(10**5 + 1)]\n for _ in range(N):\n w, v = list(map(int, input().split()))\n for val in range(10**5, 1, -1):\n if val - v < 1:\n break\n dp[val] = min(dp[val], dp[val - v] + w)\n if dp[v] > w:\n dp[v] = w\n ans = 0\n for v, w in enumerate(dp):\n if w <= W:\n ans = max(ans, v)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\nN, W = LI()\nwv = [LI() for _ in range(N)]\nV = N * 10**3\ndp = [[float(\"INF\")] * (V + 1) for _ in range(N + 1)]\ndp[0][0] = 0\nfor i in range(1, N + 1):\n w, v = wv[i - 1]\n for j in range(V + 1):\n if j - v >= 0:\n dp[i][j] = min(dp[i][j], dp[i - 1][j - v] + w)\n dp[i][j] = min(dp[i][j], dp[i - 1][j])\nprint((max([i for i in range(V + 1) if dp[-1][i] <= W])))\n", "slow_time": 28625540407, "fast_time": 5389440474, "speedup": 5.3114, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_17"} +{"pair_id": "python_3191", "problem_id": "p02724", "language": "python", "slow_code": "s = int(eval(input()))\ncount1 = -1\ncount2 = -1\nwhile s >= 0:\n s = s - 500\n count1 = count1 + 1\ns = s + 500\nif s == 0:\n yasashisa = count1 * 1000\n print(yasashisa)\nelse:\n while s >= 0:\n s = s - 5\n count2 = count2 + 1\n yasashisa = count1 * 1000 + count2 * 5\n print(yasashisa)\n", "fast_code": "X = int(eval(input()))\nans = 1000 * (X // 500)\nX -= 500 * (X // 500)\nans += 5 * (X // 5)\nprint(ans)\n", "slow_time": 2799708692, "fast_time": 13230338, "speedup": 211.6128, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_22"} +{"pair_id": "python_12423", "problem_id": "p03674", "language": "python", "slow_code": "class ModComb:\n def __init__(self, MAX, mod=10**9 + 7):\n fac = [1, 1]\n finv = [1, 1]\n inv = [0, 1]\n for i in range(2, MAX):\n fac.append(fac[i - 1] * i % mod)\n inv.append(mod - inv[mod % i] * (mod // i) % mod)\n finv.append(finv[i - 1] * inv[i] % mod)\n self.fac, self.finv, self.mod = fac, finv, mod\n\n def nCk(self, n, k):\n if n < k or n < 0 or k < 0:\n return 0\n fac, finv, mod = self.fac, self.finv, self.mod\n return fac[n] * (finv[k] * finv[n - k] % mod) % mod\n\n\nmod = 10**9 + 7\nN, *A = list(map(int, open(0).read().split()))\nmc = ModComb(210000, mod=mod)\nused = {}\nleft, right = 0, 0\nfor i, a in enumerate(A):\n if a in used:\n right = i\n left = used[a]\n break\n used[a] = i\nm = left + N - right\nfor k in range(1, N + 2):\n print(((mc.nCk(N + 1, k) - mc.nCk(m, k - 1)) % mod))\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nMOD = 10**9 + 7\nduplicate_x = None\nchecked = set()\nfor a in A:\n if a in checked:\n duplicate_x = a\n checked.add(a)\nx_l_index = A.index(duplicate_x)\nx_r_index = N + 1 - A[::-1].index(duplicate_x) - 1\n\nfactorial = [1, 1]\ninverse = [1, 1]\ninvere_base = [0, 1]\nfor i in range(2, N + 2):\n factorial.append((factorial[-1] * i) % MOD)\n invere_base.append((-invere_base[MOD % i] * (MOD // i)) % MOD)\n inverse.append((inverse[-1] * invere_base[-1]) % MOD)\n\n\ndef nCr(n, r):\n if not 0 <= r <= n:\n return 0\n return factorial[n] * inverse[r] * inverse[n - r] % MOD\n\n\nfor k in range(1, N + 1 + 1):\n print(\n (\n (\n nCr(N + 1, k)\n - nCr(max(0, x_l_index) + max(N + 1 - x_r_index - 1, 0), k - 1)\n )\n % MOD\n )\n )\n", "slow_time": 20922270310, "fast_time": 42689339, "speedup": 490.1053, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_23"} +{"pair_id": "python_14292", "problem_id": "p03609", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nX, t = MI()\nprint((max(0, X - t)))\n", "fast_code": "x, t = list(map(int, input().split()))\nA = x - t\nif A >= 0:\n print(A)\nelse:\n print((0))\n", "slow_time": 52898444, "fast_time": 13844568, "speedup": 3.8209, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_14"} +{"pair_id": "python_7738", "problem_id": "p02707", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**6)\n\nint1 = lambda x: int(x) - 1\n\n\ndef II():\n return int(eval(input()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef MI1():\n return list(map(int1, input().split()))\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef LI1():\n return list(map(int1, input().split()))\n\n\ndef LLI(rows_number):\n return [LI() for _ in range(rows_number)]\n\n\nINF = float(\"inf\")\n\n\ndef solve():\n n = II()\n A = LI()\n ans = [0] * n\n for i, a in enumerate(A):\n ans[a - 1] += 1\n for a in ans:\n print(a)\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "a = int(eval(input()))\nb = [0] * a\nfor c in map(int, input().split()):\n b[c - 1] = b[c - 1] + 1\nprint((\"\\n\".join(map(str, b))))\n", "slow_time": 73219551, "fast_time": 21048204, "speedup": 3.4787, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_15"} +{"pair_id": "python_536", "problem_id": "p03221", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\nP = []\nY = []\narr = [[] for j in range(10**5 + 1)]\nfor i in range(M):\n listA = list(map(int, input().split()))\n P.append(listA[0])\n Y.append(listA[1])\n arr[listA[0]].append(listA[1])\nfor i in range(N + 1):\n arr[i].sort()\nfor i in range(M):\n\n left = 0\n right = len(arr[P[i]]) - 1\n while left <= right:\n mid = (left + right) // 2\n if arr[P[i]][mid] == Y[i]:\n k = mid\n break\n elif arr[P[i]][mid] > Y[i]:\n right = mid - 1\n else:\n left = mid + 1\n print((str(P[i]).rjust(6, \"0\") + str(k + 1).rjust(6, \"0\")))\n", "fast_code": "def main():\n from collections import defaultdict\n\n dd = defaultdict(str)\n n, m = list(map(int, input().split()))\n keys = []\n atcoder = [[] for _ in range(n)]\n for i in range(m):\n p, y = list(map(int, input().split()))\n key_p = str(p).zfill(6)\n key_y = str(y).zfill(10)\n keys.append(key_p + key_y)\n p -= 1\n atcoder[p].append(y)\n for i in range(n):\n atcoder[i].sort()\n key_i = str(i + 1).zfill(6)\n for index, j in enumerate(atcoder[i]):\n key_index = str(index + 1).zfill(6)\n key_j = str(j).zfill(10)\n dd[key_i + key_j] = key_i + key_index\n for k in keys:\n print((dd[k]))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 2260230442, "fast_time": 50472956, "speedup": 44.781, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_25"} +{"pair_id": "python_14824", "problem_id": "p03575", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nfrom itertools import permutations, accumulate\nimport sys\nimport math\nimport bisect\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n res = list(sys.stdin.readline())\n if res[-1] == \"\\n\":\n return res[:-1]\n return res\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef solve():\n def root(x):\n if par[x] == x:\n return x\n par[x] = root(par[x])\n return par[x]\n\n def unite(x, y):\n x = root(x)\n y = root(y)\n if rank[x] < rank[y]:\n par[x] = y\n else:\n par[y] = x\n if rank[x] == rank[y]:\n rank[x] += 1\n\n n, m = LI()\n v = LIR(m)\n for i in range(m):\n v[i][0] -= 1\n v[i][1] -= 1\n ans = 0\n for i in range(m):\n par = [i for i in range(n)]\n rank = [0] * n\n s = 1\n for j in range(m):\n if i == j:\n continue\n a, b = v[j]\n if root(a) != root(b):\n s += 1\n if s >= n:\n break\n unite(a, b)\n else:\n ans += 1\n print(ans)\n return\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "N, M = list(map(int, input().split()))\nedges = [list(map(int, input().split())) for i in range(M)]\nans = 0\nfor x in edges:\n l = list(range(N))\n for y in edges:\n if y != x:\n l = [l[y[0] - 1] if l[i] == l[y[1] - 1] else l[i] for i in range(N)]\n if len(set(l)) != 1:\n ans += 1\nprint(ans)\n", "slow_time": 157135134, "fast_time": 43890459, "speedup": 3.5802, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_13"} +{"pair_id": "python_7069", "problem_id": "p02732", "language": "python", "slow_code": "c = [0] * 8**6\n_, a = open(0)\n(*a,) = list(map(int, a.split()))\nfor i in a:\n c[i] += 1\ns = sum(i * ~-i // 2 for i in c)\nprint((\" \".join(str(s - c[i] + 1) for i in a)))\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nC = {}\nfor i in range(N):\n if A[i] not in C:\n C[A[i]] = 0\n C[A[i]] += 1\nK = 0\nfor j in C:\n K += (C[j] * (C[j] - 1)) // 2\nfor k in range(N):\n j = A[k]\n print((K - C[j] + 1))\n", "slow_time": 8948614458, "fast_time": 37354088, "speedup": 239.5619, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_3"} +{"pair_id": "python_15608", "problem_id": "p02712", "language": "python", "slow_code": "import sys\nimport math\nimport os\nimport itertools\nimport string\nimport heapq\nimport _collections\nfrom collections import Counter\nfrom collections import defaultdict\nfrom functools import lru_cache\nimport bisect\nimport re\nimport queue\nfrom decimal import *\n\n\nclass Scanner:\n @staticmethod\n def int():\n return int(sys.stdin.readline().rstrip())\n\n @staticmethod\n def string():\n return sys.stdin.readline().rstrip()\n\n @staticmethod\n def map_int():\n return [int(x) for x in Scanner.string().split()]\n\n @staticmethod\n def string_list(n):\n return [eval(input()) for i in range(n)]\n\n @staticmethod\n def int_list_list(n):\n return [Scanner.map_int() for i in range(n)]\n\n @staticmethod\n def int_cols_list(n):\n return [int(eval(input())) for i in range(n)]\n\n\nclass Math:\n @staticmethod\n def gcd(a, b):\n if b == 0:\n return a\n return Math.gcd(b, a % b)\n\n @staticmethod\n def lcm(a, b):\n return (a * b) // Math.gcd(a, b)\n\n @staticmethod\n def divisor(n):\n res = []\n i = 1\n for i in range(1, int(n**0.5) + 1):\n if n % i == 0:\n res.append(i)\n if i != n // i:\n res.append(n // i)\n return res\n\n @staticmethod\n def round_up(a, b):\n return -(-a // b)\n\n @staticmethod\n def is_prime(n):\n if n < 2:\n return False\n if n == 2:\n return True\n if n % 2 == 0:\n return False\n d = int(n**0.5) + 1\n for i in range(3, d + 1, 2):\n if n % i == 0:\n return False\n return True\n\n\ndef pop_count(x):\n x = x - ((x >> 1) & 0x5555555555555555)\n x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)\n x = (x + (x >> 4)) & 0x0F0F0F0F0F0F0F0F\n x = x + (x >> 8)\n x = x + (x >> 16)\n x = x + (x >> 32)\n return x & 0x0000007F\n\n\nMOD = int(1e09) + 7\nINF = int(1e15)\n\n\ndef solve():\n N = Scanner.int()\n ans = 0\n for i in range(1, N + 1):\n if i % 3 == 0 or i % 5 == 0:\n continue\n ans += i\n print(ans)\n\n\ndef main():\n\n solve()\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N = int(eval(input()))\ntotal = int(1 / 2 * N * (N + 1))\nwa3 = (N // 3 * (N // 3 + 1)) // 2 * 3\nwa5 = (N // 5 * (N // 5 + 1)) // 2 * 5\nwa15 = (N // 15 * (N // 15 + 1)) // 2 * 15\nprint((total - wa3 - wa5 + wa15))\n", "slow_time": 16198743553, "fast_time": 24507251, "speedup": 660.9776, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_20"} +{"pair_id": "python_6340", "problem_id": "p03563", "language": "python", "slow_code": "r = int(eval(input()))\ng = int(eval(input()))\nprint((r + (g - r) * 2))\n", "fast_code": "print(-int(input()) + (int(input()) << 1))\n", "slow_time": 15362331, "fast_time": 7622600, "speedup": 2.0154, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_1"} +{"pair_id": "python_18580", "problem_id": "p03409", "language": "python", "slow_code": "num = 201\n\n\ndef dfs(cur):\n global vis\n global EE\n vis[cur] = 1\n if cur == num:\n return 1\n for i in range(num + 1):\n if vis[i] == 0 and EE[cur][i] > 0 and dfs(i) > 0:\n EE[cur][i] -= 1\n EE[i][cur] += 1\n return 1\n return 0\n\n\nn = int(eval(input()))\ns = []\nss = []\nfor i in range(n):\n s.append([int(i) for i in input().split()])\nfor i in range(n):\n ss.append([int(i) for i in input().split()])\ns.sort(key=lambda x: (x[0], x[1]))\nss.sort(key=lambda x: (x[0], x[1]))\npair = []\nfor i in range(len(s)):\n right = []\n for j in range(n):\n if s[j][0] < ss[i][0] and s[j][1] < ss[i][1]:\n right.append(j)\n pair.append(right)\npair.sort(key=lambda x: len(x))\n\n\nEE = [[0 for x in range(num + 1)] for y in range(num + 11)]\nvis = [0] * (num + 1)\nfor i in range(len(pair)):\n EE[0][i + 1] = 1\n EE[i + 1][0] = 1\nfor i in range(n):\n EE[i + 101][num] = 1\nfor i in range(len(pair)):\n for j in range(len(pair[i])):\n node1, node2 = i + 1, pair[i][j] + 101\n\n EE[node1][node2] = 1\n\nflow = 0\nwhile 1:\n for i in range(0, num + 1):\n vis[i] = 0\n if dfs(0) == 0:\n break\n flow += 1\nprint(flow)\n", "fast_code": "import heapq\n\nN = int(eval(input()))\nred = []\nfor i in range(N):\n x, y = list(map(int, input().split()))\n heapq.heappush(red, (-y, x))\nblue = []\nfor i in range(N):\n x, y = list(map(int, input().split()))\n heapq.heappush(blue, (x, y))\nans = 0\nfor i in range(N):\n tmp = []\n bx, by = heapq.heappop(blue)\n flag = True\n while flag:\n mry, rx = heapq.heappop(red)\n if bx > rx and by > -mry:\n ans += 1\n flag = False\n if len(tmp) > 0:\n for mry, rx in tmp:\n heapq.heappush(red, (mry, rx))\n else:\n tmp.append((mry, rx))\n if len(red) == 0:\n if len(tmp) > 0:\n for mry, rx in tmp:\n heapq.heappush(red, (mry, rx))\n break\nprint(ans)\n", "slow_time": 579236453, "fast_time": 78392535, "speedup": 7.3889, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_3"} +{"pair_id": "python_10599", "problem_id": "p02982", "language": "python", "slow_code": "n, d = list(map(int, input().split()))\nX = [list(map(int, input().split())) for _ in range(n)]\n\n\ndef dist_squere(x, y):\n d = 0\n for i, j in zip(x, y):\n d += (i - j) ** 2\n return d\n\n\nsquares = set([i * i for i in range(10000)])\n\n\ndef is_square(x):\n return x in squares\n\n\nfrom itertools import combinations\n\nans = 0\nfor x, y in combinations(X, 2):\n if is_square(dist_squere(x, y)):\n ans += 1\nprint(ans)\n", "fast_code": "n, d = list(map(int, input().split()))\nX = []\nfor _ in range(n):\n X.append([int(x) for x in input().split()])\nans = 0\nfor i in range(n - 1):\n for j in range(i + 1, n):\n s = sum((X[i][d] - X[j][d]) ** 2 for d in range(d))\n if any(k**2 == s for k in range(1000)):\n ans += 1\nprint(ans)\n", "slow_time": 242815463, "fast_time": 46598768, "speedup": 5.2108, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_22"} +{"pair_id": "python_14317", "problem_id": "p03972", "language": "python", "slow_code": "import itertools\nimport os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nIINF = 10**18\nMOD = 10**9 + 7\n\n\nclass UnionFind:\n def __init__(self, size=None, nodes=None):\n \"\"\"\"\"\"\n assert size is not None or nodes is not None\n if size is not None:\n self._parents = [i for i in range(size)]\n self._ranks = [0 for _ in range(size)]\n self._sizes = [1 for _ in range(size)]\n else:\n self._parents = {k: k for k in nodes}\n self._ranks = {k: 0 for k in nodes}\n self._sizes = {k: 1 for k in nodes}\n\n def unite(self, x, y):\n \"\"\"\"\"\"\n x = self.root(x)\n y = self.root(y)\n if x == y:\n return\n\n if self._ranks[x] > self._ranks[y]:\n\n self._parents[y] = x\n self._sizes[x] += self._sizes[y]\n else:\n\n self._parents[x] = y\n self._sizes[y] += self._sizes[x]\n if self._ranks[x] == self._ranks[y]:\n self._ranks[y] += 1\n\n def root(self, x):\n \"\"\"\"\"\"\n if self._parents[x] == x:\n return x\n self._parents[x] = self.root(self._parents[x])\n return self._parents[x]\n\n def size(self, x):\n \"\"\"\"\"\"\n return self._sizes[self.root(x)]\n\n\nW, H = list(map(int, sys.stdin.readline().split()))\nP = [int(sys.stdin.readline()) for _ in range(W)]\nQ = [int(sys.stdin.readline()) for _ in range(H)]\n\n\ndef test():\n edges = []\n vs = []\n for h, w in itertools.product(list(range(H + 1)), list(range(W + 1))):\n if w < W:\n edges.append((P[w], (w, h), (w + 1, h)))\n if h < H:\n edges.append((Q[h], (w, h), (w, h + 1)))\n for h, w in itertools.product(list(range(H + 1)), list(range(W + 1))):\n vs.append((w, h))\n edges.sort()\n\n uf = UnionFind(nodes=vs)\n ret = 0\n for s, v, u in edges:\n if uf.root(v) != uf.root(u):\n uf.unite(v, u)\n ret += s\n return ret\n\n\nhs = P.copy()\n\nvs = Q.copy()\nhs.sort(reverse=True)\nvs.sort(reverse=True)\nans = 0\nv_nodes = W + 1\nh_nodes = H + 1\nwhile hs or vs:\n if not vs or (hs and hs[-1] < vs[-1]):\n\n ans += hs.pop() * h_nodes\n v_nodes -= 1\n else:\n\n ans += vs.pop() * v_nodes\n h_nodes -= 1\nprint(ans)\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\nW, H = list(map(int, input().split()))\nP = [int(eval(input())) for _ in range(W)] + [float(\"inf\")]\nQ = [int(eval(input())) for _ in range(H)] + [float(\"inf\")]\nP.sort(reverse=True)\nQ.sort(reverse=True)\nans = 0\nW += 1\nH += 1\nwhile True:\n if W == H == 1:\n break\n elif Q[-1] < P[-1] or (Q[-1] == P[-1] and W <= H):\n ans += W * Q[-1]\n H -= 1\n Q.pop()\n elif Q[-1] > P[-1] or (Q[-1] == P[-1] and W > H):\n ans += H * P[-1]\n W -= 1\n P.pop()\nprint(ans)\n", "slow_time": 217485236, "fast_time": 70538556, "speedup": 3.0832, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_1"} +{"pair_id": "python_9287", "problem_id": "p02792", "language": "python", "slow_code": "n = int(eval(input()))\nans = 0\nfor i in range(1, n + 1):\n a = str(i)[0]\n b = str(i)[-1]\n for digit in range(1, 7):\n if digit == 1:\n if a == b:\n ans += 1\n elif b != \"0\":\n mn = int(b + \"0\" * (digit - 2) + a)\n mx = int(b + \"9\" * (digit - 2) + a)\n if mn > n:\n break\n if mx <= n:\n ans += 10 ** (digit - 2)\n else:\n ns = str(n)\n for j in range(1, len(ns) - 1):\n ans += int(ns[j]) * 10 ** (max(digit - 2 - j, 0))\n if ns[-1] >= a:\n ans += 1\n break\nprint(ans)\n", "fast_code": "from itertools import product\n\n\ndef solve(string):\n d = len(string)\n if d == 1:\n return string\n s0, ss, sn = int(string[0]), int(string[1:-1] or 0), int(string[-1])\n t = [[0] * 10] + [[int(\"1\" * (d - 2) or 0)] * 10 for _ in range(9)]\n for i in range(1, 10):\n t[i][i] += 1\n for i, j in product(list(range(1, s0)), list(range(10))):\n t[i][j] += 10 ** (d - 2)\n for j in range(sn + 1):\n t[s0][j] += ss + 1\n for j in range(sn + 1, 10):\n t[s0][j] += ss\n return str(sum(t[i][j] * t[j][i] for i, j in product(list(range(1, 10)), repeat=2)))\n\n\nif __name__ == \"__main__\":\n import sys\n\n print((solve(sys.stdin.read().strip())))\n", "slow_time": 516156800, "fast_time": 78728098, "speedup": 6.5562, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_26"} +{"pair_id": "python_5219", "problem_id": "p02729", "language": "python", "slow_code": "n, m = list(map(int, input().split()))\na = []\nfor i in range(1, n + 1):\n a.append(2 * i)\nfor j in range(1, m + 1):\n a.append(2 * j - 1)\ncounter = 0\nfor i in range(len(a) - 1):\n for j in range(i + 1, len(a)):\n if (a[i] + a[j]) % 2 == 0:\n counter += 1\nprint(counter)\n", "fast_code": "N, M = list(map(int, input().split()))\nans = N * (N - 1) // 2 + M * (M - 1) // 2\nprint(ans)\n", "slow_time": 809200323, "fast_time": 12713743, "speedup": 63.6477, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_11"} +{"pair_id": "python_11452", "problem_id": "p03504", "language": "python", "slow_code": "n, C = list(map(int, input().split()))\nL = [tuple(map(int, input().split())) for _ in range(n)]\nm = 2 * 10**5 + 2\nS = [0] * m\nfor x in range(1, C + 1):\n T = [0] * m\n for s, t, c in L:\n if c == x:\n\n T[2 * s - 1] += 1\n T[2 * t] -= 1\n for i in range(1, m):\n T[i] += T[i - 1]\n for i in range(m):\n if T[i] > 0:\n S[i] += 1\nprint((max(S)))\n", "fast_code": "import functools\n\nN, C = list(map(int, input().split()))\nP = [[0 for c in range(C)] for i in range(10**5 + 1)]\nT = 0\nfor i in range(N):\n s, t, c = list(map(int, input().split()))\n T = max(t, T)\n for j in range(s - 1, t):\n P[j][c - 1] = 1\nans = 0\nfor p in P[: T + 1]:\n ans = max(sum(p), ans)\nprint(ans)\n", "slow_time": 88725171847, "fast_time": 12772200429, "speedup": 6.9467, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_27"} +{"pair_id": "python_3259", "problem_id": "p03354", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = float(\"inf\")\nMOD = 10**9 + 7\n\n\nclass UnionFind:\n \"\"\"\"\"\"\n\n def __init__(self, n):\n self.n = n\n\n self.par = [i for i in range(n + 1)]\n\n self.rank = [0] * (n + 1)\n\n self.size = [1] * (n + 1)\n\n self.tree = [True] * (n + 1)\n\n def find(self, x):\n \"\"\"\"\"\"\n\n if self.par[x] == x:\n return x\n else:\n\n self.par[x] = self.find(self.par[x])\n return self.par[x]\n\n def union(self, x, y):\n \"\"\"\"\"\"\n\n x = self.find(x)\n y = self.find(y)\n\n if x == y:\n self.tree[x] = False\n return\n if not self.tree[x] or not self.tree[y]:\n self.tree[x] = self.tree[y] = False\n\n if self.rank[x] < self.rank[y]:\n self.par[x] = y\n self.size[y] += self.size[x]\n else:\n self.par[y] = x\n self.size[x] += self.size[y]\n\n if self.rank[x] == self.rank[y]:\n self.rank[x] += 1\n\n def same(self, x, y):\n \"\"\"\"\"\"\n return self.find(x) == self.find(y)\n\n def get_size(self, x):\n \"\"\"\"\"\"\n return self.size[self.find(x)]\n\n def is_tree(self, x):\n \"\"\"\"\"\"\n return self.tree[self.find(x)]\n\n def len(self):\n \"\"\"\"\"\"\n res = set()\n for i in range(self.n + 1):\n res.add(self.find(i))\n\n return len(res) - 1\n\n\nN, M = MAP()\nP = [p - 1 for p in LIST()]\nuf = UnionFind(N)\nfor i in range(M):\n a, b = MAP()\n a -= 1\n b -= 1\n uf.union(P[a], P[b])\ncnt = 0\nfor i in range(N):\n p = P[i]\n if uf.same(p, i):\n cnt += 1\nprint(cnt)\n", "fast_code": "def solve():\n n, m = list(map(int, input().split()))\n plst = list(map(int, input().split()))\n pare_inds = [i for i in range(n)]\n\n def find(x):\n p = pare_inds[x]\n if p == x:\n return x\n a = find(p)\n pare_inds[x] = a\n return a\n\n for i in range(m):\n x, y = list(map(int, input().split()))\n x, y = x - 1, y - 1\n r_x, r_y = find(x), find(y)\n pare_inds[y] = r_x\n pare_inds[r_y] = r_x\n ans = 0\n for i in range(n):\n if find(i) == find(plst[i] - 1):\n ans += 1\n print(ans)\n\n\nsolve()\n", "slow_time": 247598194, "fast_time": 62879954, "speedup": 3.9376, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_1"} +{"pair_id": "python_841", "problem_id": "p02642", "language": "python", "slow_code": "n = int(eval(input()))\nA = sorted(map(int, input().split()))\nU = 10**6\nline = [1] * (U + 1)\nans = set()\ndepricated = set()\ncnt = [0] * (U + 1)\nfor a in A:\n cnt[a] += 1\n if cnt[a] == 2 and line[a]:\n depricated.add(a)\n continue\n if 2 < cnt[a]:\n continue\n if line[a]:\n ans.add(a)\n for p in range(2 * a, U + 1, a):\n line[p] = 0\nprint((len(ans - depricated)))\n", "fast_code": "from math import *\nfrom copy import *\nfrom heapq import *\nfrom string import *\nfrom random import *\nfrom bisect import *\nfrom sys import (\n stdin,\n)\nfrom sys import maxsize\nfrom operator import *\nfrom itertools import *\nfrom decimal import Decimal\nfrom collections import Counter\nfrom collections import defaultdict\n\n\"\"\"\"\"\"\n\n\ndef solve(l):\n n = len(l)\n ans, maxx = 0, max(l)\n done = [0] * (maxx + 1)\n l.sort()\n ans = 0\n d = dict(Counter(l))\n for i in l:\n zz = 2\n while i * zz <= maxx:\n done[i * zz] = 1\n zz += 1\n for i in l:\n if not done[i] and d[i] == 1:\n ans += 1\n return ans\n\n\nN = int(stdin.readline())\nl = list(map(int, stdin.readline().rstrip().split()))\nans = solve(l)\nprint(ans)\n", "slow_time": 24452317730, "fast_time": 75729886, "speedup": 322.8886, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_27"} +{"pair_id": "python_10968", "problem_id": "p02640", "language": "python", "slow_code": "x, y = list(map(int, input().split()))\nfor i in range(0, 101):\n for j in range(0, 101):\n if i + j == x and i * 2 + j * 4 == y:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "fast_code": "x, y = list(map(int, input().split()))\nprint((\"NYoe s\"[(2 * x <= y <= 4 * x) > y % 2 :: 2]))\n", "slow_time": 502995557, "fast_time": 12951138, "speedup": 38.8379, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_16"} +{"pair_id": "python_1644", "problem_id": "p02990", "language": "python", "slow_code": "MAX = 3000\nMOD = 1000000007\nfactrial = [0] * MAX\ninverse = [0] * MAX\nfactrial_inverse = [0] * MAX\n\n\ndef COMinit():\n global factrial, inverse, factrial_inverse\n factrial[0] = 1\n factrial[1] = 1\n inverse[1] = 1\n factrial_inverse[0] = 1\n factrial_inverse[1] = 1\n for i in range(2, MAX):\n factrial[i] = factrial[i - 1] * i % MOD\n inverse[i] = MOD - inverse[MOD % i] * (MOD // i) % MOD\n factrial_inverse[i] = factrial_inverse[i - 1] * inverse[i] % MOD\n\n\ndef COM(n, k):\n global factrial, inverse, factrial_inverse\n if n < k:\n return 0\n if n < 0 or k < 0:\n return 0\n return factrial[n] * (factrial_inverse[k] * factrial_inverse[n - k] % MOD) % MOD\n\n\nCOMinit()\nN, K = list(map(int, input().split()))\nfor i in range(1, K + 1):\n print((COM(N - K + 1, i) * COM(K - 1, i - 1) % MOD))\n", "fast_code": "N, K = list(map(int, input().split()))\nn = max(K, N - K + 1)\nfac = [0] * (n + 1)\nfac[0] = 1\nfor i in range(n):\n fac[i + 1] = fac[i] * (i + 1) % 1000000007\n\n\ndef mcomb(n, k):\n if n == 0 and k == 0:\n return 1\n if n < k or k < 0:\n return 0\n return (\n fac[n]\n * pow(fac[n - k], 1000000005, 1000000007)\n * pow(fac[k], 1000000005, 1000000007)\n % 1000000007\n )\n\n\nresult = []\nfor i in range(1, K + 1):\n result.append(mcomb(K - 1, i - 1) * mcomb(N - K + 1, i) % 1000000007)\nprint((\"\\n\".join(str(i) for i in result)))\n", "slow_time": 540743413, "fast_time": 79708021, "speedup": 6.7841, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_20"} +{"pair_id": "python_2986", "problem_id": "p02994", "language": "python", "slow_code": "import copy\n\nN, L = list(map(int, input().split()))\nflaver = []\nfor i in range(1, N + 1):\n flaver.append(L + i - 1)\nflaver_sum = sum(flaver)\nfor i in range(len(flaver)):\n c_flaver = copy.deepcopy(flaver)\n del c_flaver[i]\n if i == 0:\n tmp_min = abs(flaver_sum - sum(c_flaver))\n index = i\n if abs(flaver_sum - sum(c_flaver)) < tmp_min:\n tmp_min = abs(flaver_sum - sum(c_flaver))\n index = i\ndel flaver[index]\nprint((sum(flaver)))\n", "fast_code": "N, L = list(map(int, input().split()))\nl = list([L + x - 1 for x in range(1, N + 1)])\nprint((sum(l) - min(l, key=abs)))\n", "slow_time": 61092239, "fast_time": 20562455, "speedup": 2.9711, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_15"} +{"pair_id": "python_7456", "problem_id": "p03545", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nA = list(map(int, sys.stdin.readline().rstrip()))\nfrom itertools import product\n\nX = [\"+\", \"-\"]\nfor a in product(X, repeat=3):\n b = A[0]\n for i in range(3):\n if a[i] == \"+\":\n b += A[i + 1]\n else:\n b -= A[i + 1]\n if b == 7:\n print(\n (str(A[0]) + a[0] + str(A[1]) + a[1] + str(A[2]) + a[2] + str(A[3]) + \"=7\")\n )\n break\n", "fast_code": "import sys\n\nA = list(map(int, sys.stdin.readline().rstrip()))\nfrom itertools import product\n\nX = [\"+\", \"-\"]\nfor a in product(X, repeat=3):\n b = A[0]\n for i in range(3):\n if a[i] == \"+\":\n b += A[i + 1]\n else:\n b -= A[i + 1]\n if b == 7:\n print(\n (str(A[0]) + a[0] + str(A[1]) + a[1] + str(A[2]) + a[2] + str(A[3]) + \"=7\")\n )\n break\n", "slow_time": 83854575, "fast_time": 39250104, "speedup": 2.1364, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_26"} +{"pair_id": "python_14070", "problem_id": "p02244", "language": "python", "slow_code": "from sys import stdin\n\nN = 8\nFREE = -1\nNOT_FREE = 1\nrow = [FREE] * N\ncol = [FREE] * N\ndpos = [FREE] * (2 * N - 1)\ndneg = [FREE] * (2 * N - 1)\nX = [[False] * N for _ in range(N)]\nn = int(stdin.readline())\nfor _ in range(0, n):\n r, c = list(map(int, stdin.readline().split()))\n X[r][c] = True\n\n\ndef printBoard():\n for i in range(0, N):\n for j in range(0, N):\n if X[i][j] != 0 and row[i] != j:\n return\n for i in range(0, N):\n print((\".\" * row[i] + \"Q\" + \".\" * (8 - row[i] - 1)))\n\n\ndef recursive(i):\n if i == N:\n printBoard()\n return\n for j in range(0, N):\n if (\n NOT_FREE == col[j]\n or NOT_FREE == dpos[i + j]\n or NOT_FREE == dneg[i - j + N - 1]\n ):\n continue\n row[i] = j\n col[j] = dpos[i + j] = dneg[i - j + N - 1] = NOT_FREE\n recursive(i + 1)\n row[i] = col[j] = dpos[i + j] = dneg[i - j + N - 1] = FREE\n\n\nrecursive(0)\n", "fast_code": "row = [True] * 8\ncol = [True] * 8\ndpos = [True] * 15\ndneg = [True] * 15\nboard = [[\".\", \".\", \".\", \".\", \".\", \".\", \".\", \".\"] for i in range(8)]\nimport sys\n\nfile_input = sys.stdin\nk = int(file_input.readline())\nfor line in file_input:\n r, c = map(int, line.split())\n row[r] = \"INIT\"\n col[c] = \"INIT\"\n dpos[r + c] = False\n dneg[r + (7 - c)] = False\n board[r][c] = \"Q\"\n\n\ndef dfs(i=0):\n if i == 8:\n for line in board:\n print(*line, sep=\"\")\n return\n if row[i] == \"INIT\":\n dfs(i + 1)\n elif row[i]:\n for j in range(8):\n if col[j] == \"INIT\":\n pass\n elif col[j] and dpos[i + j] and dneg[i + (7 - j)]:\n row[i] = False\n col[j] = False\n dpos[i + j] = False\n dneg[i + (7 - j)] = False\n board[i][j] = \"Q\"\n dfs(i + 1)\n row[i] = True\n col[j] = True\n dpos[i + j] = True\n dneg[i + (7 - j)] = True\n board[i][j] = \".\"\n\n\ndfs()\n", "slow_time": 803032199, "fast_time": 113884500, "speedup": 7.0513, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_8"} +{"pair_id": "python_7809", "problem_id": "p03108", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nfrom itertools import permutations, accumulate\nimport sys\nimport math\nimport bisect\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n res = list(sys.stdin.readline())\n if res[-1] == \"\\n\":\n return res[:-1]\n return res\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef solve():\n def root(x):\n if par[x] == x:\n return par[x]\n s[par[x]] += s[x]\n s[x] = 0\n par[x] = root(par[x])\n return par[x]\n\n def unite(x, y):\n x = root(x)\n y = root(y)\n if rank[x] < rank[y]:\n par[x] = y\n s[y] += s[x]\n s[x] = 0\n else:\n par[y] = x\n s[x] += s[y]\n s[y] = 0\n if rank[x] == rank[y]:\n rank[x] += 1\n\n n, m = LI()\n v = []\n for i in range(m):\n a, b = LI()\n a -= 1\n b -= 1\n v.append((a, b))\n par = [i for i in range(n)]\n rank = [0] * n\n s = [1] * n\n su = n * (n - 1) >> 1\n ans = [su]\n for i, j in v[1:][::-1]:\n ri = root(i)\n rj = root(j)\n if ri != rj:\n su -= s[ri] * s[rj]\n unite(i, j)\n ans.append(su)\n for i in ans[::-1]:\n print(i)\n return\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "r = lambda x: x if u[x] < 0 else r(u[x])\n(n, m), _, *e = [map(int, t.split()) for t in open(0).readlines()]\nu = [-1] * -~n\nt = n * ~-n // 2\na = [t]\nfor x, y in e[::-1]:\n x, y = sorted((r(x), r(y)))\n if x != y:\n t -= u[x] * u[y]\n u[x] += u[y]\n u[y] = x\n a += [t]\nprint(*a[::-1], sep=\"\\n\")\n", "slow_time": 140164952, "fast_time": 46457023, "speedup": 3.0171, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_2"} +{"pair_id": "python_6569", "problem_id": "p03332", "language": "python", "slow_code": "def cmb(n, r, mod):\n if r < 0 or r > n:\n return 0\n r = min(r, n - r)\n return g1[n] * g2[r] * g2[n - r] % mod\n\n\nmod = 998244353\nN = 10**6\ng1 = [1, 1]\ng2 = [1, 1]\ninverse = [0, 1]\nfor i in range(2, N + 1):\n g1.append((g1[-1] * i) % mod)\n inverse.append((-inverse[mod % i] * (mod // i)) % mod)\n g2.append((g2[-1] * inverse[-1]) % mod)\nN, A, B, K = list(map(int, input().split()))\nans = 0\nfor i in range(N + 1):\n if (K - A * i) % B != 0:\n continue\n j = (K - A * i) // B\n m = cmb(N, i, mod) * cmb(N, j, mod) % mod\n ans += m\n ans %= mod\nprint(ans)\n", "fast_code": "class Combination:\n \"\"\"\"\"\"\n\n def __init__(self, n, MOD):\n self.fact = [1]\n for i in range(1, n + 1):\n self.fact.append(self.fact[-1] * i % MOD)\n self.inv_fact = [pow(self.fact[i], MOD - 2, MOD) for i in range(n + 1)]\n self.MOD = MOD\n\n def factorial(self, k):\n \"\"\"\"\"\"\n return self.fact[k]\n\n def inverse_factorial(self, k):\n \"\"\"\"\"\"\n return self.inv_fact[k]\n\n def combination(self, k, r):\n \"\"\"\"\"\"\n return (self.fact[k] * self.inv_fact[k - r] * self.inv_fact[r]) % self.MOD\n\n\nn, a, b, k = list(map(int, input().split()))\nMOD = 998244353\ncomb = Combination(n, MOD)\nans = 0\nfor i in range(n + 1):\n if not (k - a * i >= 0 and (k - a * i) % b == 0 and (k - a * i) // b <= n):\n continue\n else:\n ai = i\n bi = (k - a * i) // b\n ans += comb.combination(n, ai) * comb.combination(n, bi)\n ans %= MOD\nprint(ans)\n", "slow_time": 161389270959, "fast_time": 33876778491, "speedup": 4.764, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_19"} +{"pair_id": "python_11657", "problem_id": "p02760", "language": "python", "slow_code": "al = [input().split() for _ in range(3)]\nn = int(eval(input()))\nfor _ in range(n):\n b = eval(input())\n for i in range(3):\n for j in range(3):\n if al[i][j] == b:\n al[i][j] = \"0\"\nif al[0][0] == \"0\" and al[0][1] == \"0\" and al[0][2] == \"0\":\n print(\"Yes\")\nelif al[1][0] == \"0\" and al[1][1] == \"0\" and al[1][2] == \"0\":\n print(\"Yes\")\nelif al[2][0] == \"0\" and al[2][1] == \"0\" and al[2][2] == \"0\":\n print(\"Yes\")\nelif al[0][0] == \"0\" and al[1][0] == \"0\" and al[2][0] == \"0\":\n print(\"Yes\")\nelif al[0][1] == \"0\" and al[1][1] == \"0\" and al[2][1] == \"0\":\n print(\"Yes\")\nelif al[0][2] == \"0\" and al[1][2] == \"0\" and al[2][2] == \"0\":\n print(\"Yes\")\nelif al[0][0] == \"0\" and al[1][1] == \"0\" and al[2][2] == \"0\":\n print(\"Yes\")\nelif al[0][2] == \"0\" and al[1][1] == \"0\" and al[2][0] == \"0\":\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "a = open(0).read().split()\nprint(\n (\n \"YNeos\"[\n all(\n t - set(map(a.index, a[9:]))\n for t in (\n {0, 3, 6},\n {0, 4, 8},\n {2, 4, 6},\n {2, 5, 8},\n {3, 4, 5},\n {6, 7, 8},\n )\n ) :: 2\n ]\n )\n)\n", "slow_time": 98929853, "fast_time": 40880572, "speedup": 2.42, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_4"} +{"pair_id": "python_13395", "problem_id": "p02790", "language": "python", "slow_code": "a, b = list(map(str, input().split()))\na_int = int(a)\nb_int = int(b)\nans = []\nsa = \"\"\nsb = \"\"\nfor _ in range(b_int):\n sa += a\nfor _ in range(a_int):\n sb += b\nans.append(sa)\nans.append(sb)\nans.sort()\nprint((ans[0]))\n", "fast_code": "a, b = input().split()\nprint((min(a * int(b), b * int(a))))\n", "slow_time": 29614079, "fast_time": 10102751, "speedup": 2.9313, "source": "python_benchmark", "slow_submission_id": "sol_9", "fast_submission_id": "sol_1"} +{"pair_id": "python_5389", "problem_id": "p02417", "language": "python", "slow_code": "import sys\n\naz = [\n \"a\",\n \"b\",\n \"c\",\n \"d\",\n \"e\",\n \"f\",\n \"g\",\n \"h\",\n \"i\",\n \"j\",\n \"k\",\n \"l\",\n \"m\",\n \"n\",\n \"o\",\n \"p\",\n \"q\",\n \"r\",\n \"s\",\n \"t\",\n \"u\",\n \"v\",\n \"w\",\n \"x\",\n \"y\",\n \"z\",\n]\nsum_az = [0 for x in range(26)]\nfor x in sys.stdin.read().lower():\n for i in range(26):\n for j in range(len(x)):\n if x[j] == az[i]:\n sum_az[i] += 1\nfor i in range(26):\n print((\"%s : %d\" % (az[i], sum_az[i])))\n", "fast_code": "from collections import Counter\nimport string\n\ncounter = Counter()\nwhile True:\n try:\n s = input().lower()\n counter += Counter(s)\n except EOFError:\n break\nfor c in string.ascii_lowercase:\n count = counter[c]\n print(f\"{c} : {count}\")\n", "slow_time": 102357861, "fast_time": 36536303, "speedup": 2.8015, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_13"} +{"pair_id": "python_10538", "problem_id": "p02657", "language": "python", "slow_code": "import numpy as np\nimport scipy as sp\nimport math\n\na, b = list(map(str, input().split()))\na = int(a)\nb = int(float(b) * 100.001)\nans = int(a * b // 100)\nprint(ans)\n", "fast_code": "import math\n\na, b = [float(x) for x in input().split()]\na = int(a)\nb = int(b * 100)\nprint((int(math.floor(a * b) // 100)))\n", "slow_time": 601968667, "fast_time": 13252273, "speedup": 45.4238, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_8"} +{"pair_id": "python_3435", "problem_id": "p02556", "language": "python", "slow_code": "input = __import__(\"sys\").stdin.readline\n\n\ndef getdist(a, b):\n return abs(a[0] - b[0]) + abs(a[1] - b[1])\n\n\nn = int(eval(input()))\ns = []\nfor _ in range(n):\n s.append([*list(map(int, input().split()))])\nans = 0\nsx = sorted(s)\nsy = sorted(s, key=lambda x: x[1])\nans = max(ans, getdist(sx[-1], sx[-2]))\nans = max(ans, getdist(sx[0], sx[1]))\nans = max(ans, getdist(sy[-1], sy[-2]))\nans = max(ans, getdist(sy[0], sy[1]))\n\n\ndef ff1(x):\n return x[0] + x[1]\n\n\ndef ff2(x):\n return x[0] - x[1]\n\n\nf1 = sorted(s, key=ff1)\nf2 = sorted(s, key=ff2)\nans = max(ans, getdist(f1[0], f1[-1]))\nans = max(ans, getdist(f1[0], f1[1]))\nans = max(ans, getdist(f1[-1], f1[-2]))\nans = max(ans, getdist(f2[0], f2[-1]))\nans = max(ans, getdist(f2[0], f2[1]))\nans = max(ans, getdist(f2[-1], f2[-2]))\n\n\ndef ff1(x):\n return abs(x[0] + x[1])\n\n\ndef ff2(x):\n return abs(x[0] - x[1])\n\n\nf1 = sorted(s, key=ff1)\nf2 = sorted(s, key=ff2)\nans = max(ans, getdist(f1[0], f1[-1]))\nans = max(ans, getdist(f1[0], f1[1]))\nans = max(ans, getdist(f1[-1], f1[-2]))\nans = max(ans, getdist(f2[0], f2[-1]))\nans = max(ans, getdist(f2[0], f2[1]))\nans = max(ans, getdist(f2[-1], f2[-2]))\nprint(ans)\n", "fast_code": "import sys\n\nN = int(eval(input()))\nx, y = [], []\nfor i in range(N):\n x_i, y_i = list(map(int, input().split()))\n x.append(x_i)\n y.append(y_i)\n\nmax_z = -sys.maxsize\nmin_z = sys.maxsize\nmax_w = -sys.maxsize\nmin_w = sys.maxsize\nfor x_i, y_i in zip(x, y):\n z_i = x_i + y_i\n max_z = max(max_z, z_i)\n min_z = min(min_z, z_i)\n w_i = x_i - y_i\n max_w = max(max_w, w_i)\n min_w = min(min_w, w_i)\nans = max(max_z - min_z, max_w - min_w)\n\nprint(ans)\n", "slow_time": 146157102, "fast_time": 49946737, "speedup": 2.9263, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_22"} +{"pair_id": "python_8606", "problem_id": "p02848", "language": "python", "slow_code": "import sys\nimport math\nimport collections\nimport itertools\nfrom inspect import currentframe\n\nINF = 10**10\nMOD = 10**9 + 7\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef gcd(x, y):\n return y if x % y == 0 else gcd(y, x % y)\n\n\ndef lcm(x, y):\n return (x * y) // gcd(x, y)\n\n\ndef I():\n return int(input())\n\n\ndef MI():\n return map(int, input().split())\n\n\ndef LI():\n return [int(x) for x in input().split()]\n\n\ndef RI(N):\n return [int(input()) for _ in range(N)]\n\n\ndef LRI(N):\n return [[int(x) for x in input().split()] for _ in range(N)]\n\n\ndef chkprint(*args):\n names = {id(v): k for k, v in currentframe().f_back.f_locals.items()}\n print(\", \".join(names.get(id(arg), \"???\") + \" = \" + repr(arg) for arg in args))\n\n\nN = I()\nS = input()\nalp = [\n \"A\",\n \"B\",\n \"C\",\n \"D\",\n \"E\",\n \"F\",\n \"G\",\n \"H\",\n \"I\",\n \"J\",\n \"K\",\n \"L\",\n \"M\",\n \"N\",\n \"O\",\n \"P\",\n \"Q\",\n \"R\",\n \"S\",\n \"T\",\n \"U\",\n \"V\",\n \"W\",\n \"X\",\n \"Y\",\n \"Z\",\n]\nfor s in S:\n print(alp[(alp.index(s) + N) % 26], end=\"\")\n", "fast_code": "N = int(input())\nS = input()\nalphabet = \"ZABCDEFGHIJKLMNOPQRSTUVWXY\"\nalphabet_num = {st: num for num, st in enumerate(alphabet)}\nalphabet_list = [st for st in alphabet]\nfor s in S:\n num = (alphabet_num[s] + N) % 26\n print(alphabet_list[num], end=\"\")\n", "slow_time": 118302228, "fast_time": 32472930, "speedup": 3.6431, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_18"} +{"pair_id": "python_5061", "problem_id": "p03292", "language": "python", "slow_code": "A1, A2, A3 = list(map(int, input().split()))\nA = [A1, A2, A3]\nA.append(A1)\n\n\ndef A_(i):\n if A[i] - A[i + 1] >= 0:\n return A[i] - A[i + 1]\n else:\n return A[i + 1] - A[i]\n\n\nB = [A_(i) for i in range(3)]\nB.append(A_(0))\nB.append(A_(1))\n\n\ndef sum(j):\n return B[j] + B[j + 1]\n\n\nC = [sum(j) for j in range(3)]\nprint((min(C)))\n", "fast_code": "a, _, b = sorted(map(int, input().split()))\nprint((b - a))\n", "slow_time": 50363139, "fast_time": 9736665, "speedup": 5.1725, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_14"} +{"pair_id": "python_4015", "problem_id": "p02361", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nfrom enum import Enum\nfrom heapq import heappush, heappop\n\n\nclass Sssp(object):\n \"\"\"\"\"\"\n\n class Status(Enum):\n \"\"\"\"\"\"\n\n white = 1\n gray = 2\n black = 3\n\n def __init__(self, V, data):\n num_of_nodes = V\n self.color = [Sssp.Status.white] * num_of_nodes\n self.d = [float(\"inf\")] * num_of_nodes\n self.p = [-1] * num_of_nodes\n self.adj = [[] for _ in range(num_of_nodes)]\n self.make_adj(data)\n\n def make_adj(self, data):\n\n for f, t, c in data:\n self.adj[f].insert(0, (t, c))\n\n def dijkstra(self, start):\n self.d[start] = 0\n pq = []\n heappush(pq, (0, start))\n while pq:\n cost, u = heappop(pq)\n self.color[u] = Sssp.Status.black\n if self.d[u] < cost:\n continue\n for v, cost in self.adj[u]:\n if self.color[v] == Sssp.Status.black:\n continue\n if self.d[v] > self.d[u] + cost:\n self.d[v] = self.d[u] + cost\n heappush(pq, (self.d[v], v))\n self.color[v] = Sssp.Status.gray\n\n\ndef solve(V, r, data):\n WHITE = 0\n GRAY = 1\n BLACK = 2\n num_of_nodes = V\n color = [WHITE] * num_of_nodes\n d = [float(\"inf\")] * num_of_nodes\n adj = [[] for _ in range(num_of_nodes)]\n for f, t, c in data:\n adj[f].insert(0, (t, c))\n\n d[r] = 0\n pq = []\n heappush(pq, (0, r))\n while pq:\n cost, u = heappop(pq)\n color[u] = BLACK\n if d[u] < cost:\n continue\n for v, cost in adj[u]:\n if color[v] == BLACK:\n continue\n if d[v] > d[u] + cost:\n d[v] = d[u] + cost\n heappush(pq, (d[v], v))\n color[v] = GRAY\n\n for i in range(V):\n if d[i] == float(\"inf\"):\n print(\"INF\")\n else:\n print((\"{}\".format(d[i])))\n\n\nif __name__ == \"__main__\":\n\n V, E, r = [int(x) for x in input().split(\" \")]\n data = []\n for i in range(E):\n data.append(list(map(int, input().split(\" \"))))\n\n solve(V, r, data)\n", "fast_code": "v, e, r = list(map(int, input().split()))\nd = [float(\"INF\")] * v\nd[r] = 0\nedges = []\nfor i in range(e):\n s, t, c = list(map(int, input().split()))\n edges.append([s, t, c])\nfor i in range(v):\n count = 0\n for s, v, c in edges:\n if d[v] > d[s] + c:\n count += 1\n d[v] = d[s] + c\n if count == 0:\n break\nfor i in d:\n if i == float(\"inf\"):\n print(\"INF\")\n else:\n print(i)\n", "slow_time": 206184223, "fast_time": 49326907, "speedup": 4.18, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_29"} +{"pair_id": "python_7462", "problem_id": "p03835", "language": "python", "slow_code": "k, s = list(map(int, input().split()))\ncnt = 0\nfor i in range(k + 1):\n for j in range(k + 1):\n if s >= i + j >= s - k:\n cnt += 1\nprint(cnt)\n", "fast_code": "K, S = list(map(int, input().split()))\ncount = 0\nfor x in range(K + 1):\n yz = S - x\n if yz < 0:\n break\n elif yz <= K:\n count += yz + 1\n elif yz <= 2 * K:\n count += K - (yz - K) + 1\nprint(count)\n", "slow_time": 301802361, "fast_time": 25092343, "speedup": 12.0277, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_26"} +{"pair_id": "python_4096", "problem_id": "p03170", "language": "python", "slow_code": "N, K = list(map(int, input().split()))\na = list(map(int, input().split()))\ndp = [False] * (K + 1)\nfor i in range(K + 1):\n for ai in a:\n if i - ai >= 0:\n dp[i] |= not dp[i - ai]\nif dp[K]:\n print(\"First\")\nelse:\n print(\"Second\")\n", "fast_code": "def main():\n N, K, *A = list(map(int, open(0).read().split()))\n dp = [False] * (K + 1)\n for i in range(K):\n if dp[i]:\n continue\n for a in A:\n if i + a > K:\n break\n dp[i + a] = True\n print((\"First\" if dp[-1] else \"Second\"))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 1163946391, "fast_time": 334630587, "speedup": 3.4783, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_17"} +{"pair_id": "python_15785", "problem_id": "p03331", "language": "python", "slow_code": "N = int(eval(input()))\nimport numpy as np\n\na = np.arange(N)\na = np.delete(a, 0)\nb = N - a\nnum_arr = []\nfor i in range(len(a)):\n factor_a = [int(x) for x in list(str(a[i]))]\n factor_b = [int(x) for x in list(str(b[i]))]\n num_arr.append(sum(factor_a) + sum(factor_b))\nprint((min(num_arr)))\n", "fast_code": "n = int(eval(input()))\nif n % 10 == 0:\n print((10))\nelse:\n print((sum(map(int, list(str(n))))))\n", "slow_time": 171375954, "fast_time": 17095953, "speedup": 10.0244, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_7"} +{"pair_id": "python_6071", "problem_id": "p02890", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nMOD = 10**9 + 7\ninput = lambda: sys.stdin.readline().rstrip()\n\n\ndef bin_sort(A, n_min=None, n_max=None):\n if n_min is None:\n n_min = min(A)\n if n_max is None:\n n_max = max(A)\n bin = [0] * (n_max - n_min + 1)\n for a in A:\n bin[a - n_min] += 1\n B = []\n for i in range(n_min, n_max + 1):\n B += [i] * bin[i - n_min]\n return B\n\n\ndef resolve():\n n = int(eval(input()))\n A = [0] * n\n for a in map(int, input().split()):\n A[a - 1] += 1\n A = bin_sort(A, 0, n)\n S = [0] * (n + 1)\n for i in range(n):\n S[i + 1] = S[i] + A[i]\n\n p = n\n i = n\n for k in range(1, n + 1):\n while 1:\n while 1:\n if i <= 0 or A[i - 1] < p:\n break\n i -= 1\n if S[i] + p * (n - i) >= k * p:\n break\n p -= 1\n print(p)\n\n\nresolve()\n", "fast_code": "from collections import Counter\n\nN = int(eval(input()))\nC = sorted(list(Counter(list(map(int, input().split()))).values()))\nrest = N\nremoved = 0\nfor K in range(1, N + 1):\n d = K - removed\n while C and C[-1] > rest // d:\n rest -= C[-1]\n C.pop()\n removed += 1\n d -= 1\n print((rest // d))\n", "slow_time": 86475726, "fast_time": 40356203, "speedup": 2.1428, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_1"} +{"pair_id": "python_14052", "problem_id": "p02261", "language": "python", "slow_code": "class Card:\n def __init__(self, card):\n self.card = card\n self.mark = card[0]\n self.number = card[1]\n\n def __lt__(self, other):\n if not isinstance(other, Card):\n return NotImplemented\n return self.number < other.number\n\n def __eq__(self, other):\n if not isinstance(other, Card):\n return NotImplemented\n return self.mark == other.mark and self.number == other.number\n\n def __repr__(self):\n return \"{}{}\".format(self.mark, self.number)\n\n\ndef BubbleSort(target):\n ls = target.copy()\n flag = 1\n while flag:\n flag = 0\n for i in range(len(ls) - 1, 0, -1):\n if ls[i] < ls[i - 1]:\n ls[i], ls[i - 1] = ls[i - 1], ls[i]\n flag = 1\n print((\" \".join(map(str, ls))))\n return sorted(ls)\n\n\ndef SelectSort(target):\n ls = target.copy()\n for i in range(len(ls)):\n minj = i\n for j in range(i + 1, len(ls)):\n if ls[j] < ls[minj]:\n minj = j\n if ls[i] != ls[minj]:\n ls[i], ls[minj] = ls[minj], ls[i]\n print((\" \".join(map(str, ls))))\n return sorted(ls)\n\n\ndef judge(original, sorted_list):\n if original == sorted_list:\n print(\"Stable\")\n else:\n print(\"Not stable\")\n\n\n_ = int(eval(input()))\nl2 = [Card(i) for i in input().split()]\nl2_sort = sorted(l2)\nbubble = BubbleSort(l2)\njudge(l2_sort, bubble)\nselect = SelectSort(l2)\njudge(l2_sort, select)\n", "fast_code": "def bubble_sort(A, n):\n for i in range(n):\n for j in range(n - 1, i, -1):\n if A[j][1] < A[j - 1][1]:\n A[j], A[j - 1] = A[j - 1], A[j]\n print((\" \".join(A)))\n\n\ndef selection_sort(A, n):\n for i in range(n):\n minj = i\n for j in range(i, n):\n if A[j][1] < A[minj][1]:\n minj = j\n if i != minj:\n A[i], A[minj] = A[minj], A[i]\n print((\" \".join(A)))\n\n\nif __name__ == \"__main__\":\n n = int(eval(input()))\n A = list(input().split())\n B = A[:]\n bubble_sort(A, n)\n print(\"Stable\")\n selection_sort(B, n)\n print((\"Stable\" if A == B else \"Not stable\"))\n", "slow_time": 139371990, "fast_time": 69149926, "speedup": 2.0155, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_17"} +{"pair_id": "python_16973", "problem_id": "p02804", "language": "python", "slow_code": "N_MAX = 10**6\nMOD = 10**9 + 7\nfac, finv, inv = [0] * N_MAX, [0] * N_MAX, [0] * N_MAX\n\n\ndef com_init():\n fac[0], fac[1] = 1, 1\n finv[0], finv[1] = 1, 1\n inv[1] = 1\n for i in range(2, N_MAX):\n fac[i] = fac[i - 1] * i % MOD\n inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD\n finv[i] = finv[i - 1] * inv[i] % MOD\n\n\ndef com(n, k):\n if n < k:\n return 0\n if n < 0 or k < 0:\n return 0\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD\n\n\nn, k = list(map(int, input().split()))\nal = list(map(int, input().split()))\ncom_init()\nal.sort()\nans_max = 0\nans_min = 0\nfor i, a in enumerate(al):\n ans_max += a * com(i, k - 1)\n ans_max %= MOD\n ans_min += a * com(n - 1 - i, k - 1)\n ans_min %= MOD\nprint(((ans_max - ans_min) % MOD))\n", "fast_code": "P = 10**9 + 7\nN = 100001\ninv = [0] + [1]\nfinv = [1] + [1]\nfac = [1] + [1]\nfor i in range(2, N):\n inv += [inv[P % i] * (P - int(P / i)) % P]\n fac += [(fac[i - 1] * i) % P]\n finv += [(finv[i - 1] * inv[i]) % P]\n\n\ndef comb(a, b):\n if a < b:\n return -1\n return (fac[a] * ((finv[b] * finv[a - b]) % P)) % P\n\n\nn, k = list(map(int, input().split()))\na = list(map(int, input().split()))\na = sorted(a, key=lambda x: x, reverse=False)\nans = 0\n\nfor i in range(len(a)):\n tmp = comb(n - 1 - i, k - 1)\n if tmp < 0:\n continue\n if a[i] < 0:\n ans = (ans + (abs(a[i]) * tmp) % P) % P\n else:\n ans = (ans - (abs(a[i]) * tmp) % P + P) % P\n\nfor i in range(len(a)):\n tmp = comb(n - 1 - i, k - 1)\n if tmp < 0:\n continue\n if a[n - 1 - i] < 0:\n ans = (ans - (abs(a[n - 1 - i]) * tmp) % P + P) % P\n else:\n ans = (ans + (abs(a[n - 1 - i]) * tmp) % P) % P\nprint(ans)\n", "slow_time": 181158031493, "fast_time": 44280687267, "speedup": 4.0911, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_25"} +{"pair_id": "python_4675", "problem_id": "p04015", "language": "python", "slow_code": "from collections import defaultdict, deque, Counter, OrderedDict\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce, lru_cache\nfrom heapq import heappush, heappop, heapify\nimport itertools\nimport math, fractions\nimport sys, copy\n\n\ndef L():\n return sys.stdin.readline().split()\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef SL():\n return list(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef LI1():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef R(n):\n return [sys.stdin.readline().strip() for _ in range(n)]\n\n\ndef LR(n):\n return [L() for _ in range(n)]\n\n\ndef IR(n):\n return [I() for _ in range(n)]\n\n\ndef LIR(n):\n return [LI() for _ in range(n)]\n\n\ndef LIR1(n):\n return [LI1() for _ in range(n)]\n\n\ndef SLR(n):\n return [SL() for _ in range(n)]\n\n\ndef LSR(n):\n return [LS() for _ in range(n)]\n\n\ndef perm(n, r):\n return math.factorial(n) // math.factorial(r)\n\n\ndef comb(n, r):\n return math.factorial(n) // (math.factorial(r) * math.factorial(n - r))\n\n\ndef make_list(n, *args, default=0):\n return (\n [make_list(*args, default=default) for _ in range(n)]\n if args\n else [default for _ in range(n)]\n )\n\n\ndire = [[1, 0], [0, 1], [-1, 0], [0, -1]]\ndire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]\nalphabets = \"abcdefghijklmnopqrstuvwxyz\"\nALPHABETS = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nMOD = 1000000007\nINF = float(\"inf\")\nsys.setrecursionlimit(1000000)\n\n\ndef main():\n N, A = LI()\n X = LI()\n Y = [xi - A for xi in X]\n z = max(A, max(X))\n dp = make_list(N + 1, 2 * z * N + 1)\n dp[0][z * N] = 1\n for i in range(1, N + 1):\n for s in range(2 * z * N + 1):\n if 0 <= s - Y[i - 1] <= 2 * z * N:\n dp[i][s] = dp[i - 1][s] + dp[i - 1][s - Y[i - 1]]\n else:\n dp[i][s] = dp[i - 1][s]\n print((dp[-1][z * N] - 1))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\nfrom collections import defaultdict\n\n\ndef main():\n N, A, *xlst = list(map(int, sys.stdin.read().split()))\n x_p = []\n x_n = []\n x_z = 0\n xlst.sort()\n for i in xlst:\n if A < i:\n x_p.append(i - A)\n elif i < A:\n x_n.append(A - i)\n else:\n x_z += 1\n x_p_sum = defaultdict(int, {0: 1})\n x_n_sum = defaultdict(int, {0: 1})\n for i in range(len(x_p)):\n for j in sorted(x_p_sum, reverse=1):\n x_p_sum[j + x_p[i]] += x_p_sum[j]\n for i in range(len(x_n)):\n for j in sorted(x_n_sum, reverse=1):\n x_n_sum[j + x_n[i]] += x_n_sum[j]\n res = 0\n for i in x_n_sum:\n if i in x_p_sum:\n res += x_n_sum[i] * x_p_sum[i]\n res *= 1 << x_z\n res -= 1\n print(res)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 488085549, "fast_time": 65300721, "speedup": 7.4744, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_29"} +{"pair_id": "python_2591", "problem_id": "p02660", "language": "python", "slow_code": "import sys\nfrom functools import reduce\nimport math\nfrom collections import defaultdict\nfrom math import sqrt\n\n\ndef is_prime(n):\n for i in range(2, int(sqrt(n))):\n if n % i == 0:\n return False\n return True\n\n\ndef prime_factors(n):\n primes = defaultdict(int)\n i = 2\n mx = sqrt(n)\n while n != 1:\n if n % i == 0:\n n = n // i\n primes[i] += 1\n elif i >= mx:\n if len(primes) == 0:\n primes[i] += 1\n elif is_prime(n):\n primes[i] += 1\n break\n else:\n i += 1\n return primes\n\n\ndef solve_n(x):\n return (-1 + sqrt(1 + 4 * 2 * x)) / 2\n\n\ndef solve(N: int):\n fs = prime_factors(N)\n count = 0\n for key, value in list(fs.items()):\n val = solve_n(value)\n count += math.floor(val)\n print(count)\n return\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n\n tokens = iterate_tokens()\n N = int(next(tokens))\n solve(N)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import numpy as np\nimport sys\n\n\ndef xnxn(n=0):\n \"\"\"\"\"\"\n if n == 0:\n temp = list(map(int, input().split()))\n if len(temp) == 1:\n return temp[0]\n elif len(temp) > 1:\n return temp\n else:\n temp = [list(map(int, input().split())) for _ in range(n)]\n return temp\n\n\ndef sp_xnxn(n=0):\n \"\"\"\"\"\"\n if n == 0:\n return [int(k) for k in xsxs()]\n else:\n return [[int(k) for k in xsxs()] for _ in range(n)]\n\n\ndef xsxs(n=0):\n \"\"\"\"\"\"\n if n == 0:\n temp = list(input().split())\n if len(temp) == 1:\n return temp[0]\n elif len(temp) > 1:\n return temp\n else:\n return [list(input().split()) for _ in range(n)]\n\n\ndef sp_xsxs(n=0):\n \"\"\"\"\"\"\n if n == 0:\n return [s for s in xsxs()]\n else:\n return [[s for s in xsxs()] for _ in range(n)]\n\n\ndef p_num(a):\n if a == 1:\n return [[a, 1]]\n else:\n tmp = 2\n ans = []\n while tmp < np.sqrt(a) + 1:\n n = 0\n p = [tmp]\n while a % tmp == 0:\n a = int(a / tmp)\n\n n += 1\n c = 1\n if n != 0:\n p.append(n)\n ans.append(p)\n tmp += 1\n c = 0\n if c == 0 and a != 1:\n ans.append([a, 1])\n return ans\n\n\nn = xnxn()\nif n == 1:\n print((0))\n sys.exit()\nelse:\n a = p_num(n)\n c = 0\n for num in a:\n i = 1\n while num[1] - i > -1:\n num[1] -= i\n i += 1\n c += 1\n print(c)\n", "slow_time": 4797853731, "fast_time": 791363973, "speedup": 6.0628, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_14"} +{"pair_id": "python_5880", "problem_id": "p03039", "language": "python", "slow_code": "from collections import defaultdict\n\nmod = 10**9 + 7\nmemo = defaultdict(int)\n\n\ndef cmb(n, r):\n if (n, r) in memo:\n return memo[(n, r)]\n if n < r or r < 0:\n return 0\n if r > n - r:\n return cmb(n, n - r)\n res = f[n] * pow(f[n - r], mod - 2, mod) * pow(f[r], mod - 2, mod) % mod\n memo[(n, r)] = res\n return res\n\n\nn, m, k = list(map(int, input().split()))\nf = [1]\nfor i in range(1, 2 * 10**5 + 1):\n f.append(f[-1] * i % mod)\nans = 0\nfor d in range(1, m):\n ans += d * (m - d) * n**2\n ans %= mod\nfor d in range(1, n):\n ans += d * (n - d) * m**2\n ans %= mod\nans *= cmb(n * m - 2, k - 2)\nans %= mod\nprint(ans)\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\n\n\ndef I():\n return int(eval(input()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef main():\n mod = 10**9 + 7\n N, M, K = MI()\n\n def sum2(x):\n return ((x * (x + 1)) // 2) % mod\n\n def calc(i, j):\n temp = 0\n temp = sum2(M - j - 1)\n temp = (temp + ((sum2(M - j - 1) + sum2(j)) * (N - i - 1))) % mod\n temp = (temp + sum2(N - i - 1) * M) % mod\n return temp\n\n S = 0\n for i in range(N):\n for j in range(M):\n S = (S + calc(i, j)) % mod\n rem = (N * M) - 2\n\n def cmb(n, r, mod):\n if (r < 0) or (n < r):\n return 0\n r = min(r, n - r)\n return (fact[n] * factinv[r] * factinv[n - r]) % mod\n\n fact = [1, 1]\n factinv = [1, 1]\n inv = [0, 1]\n for i in range(2, rem + 1):\n fact.append((fact[-1] * i) % mod)\n inv.append((-inv[mod % i] * (mod // i)) % mod)\n factinv.append((factinv[-1] * inv[-1]) % mod)\n\n S = (S * cmb(rem, K - 2, mod)) % mod\n print(S)\n\n\nmain()\n", "slow_time": 16316171922, "fast_time": 3886560076, "speedup": 4.1981, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_9"} +{"pair_id": "python_6758", "problem_id": "p02938", "language": "python", "slow_code": "L, R = list(map(int, input().split()))\nmod = 10**9 + 7\n\n\ndef f(L, R):\n if L > R:\n return 0\n R = bin(R)[2:]\n N = len(R)\n ret = f(L, int(\"0\" + \"1\" * (N - 1), 2))\n L = bin(L)[2:]\n if len(L) != N:\n L = \"1\" + \"0\" * (N - 1)\n for i in range(N):\n if R[i] == \"0\":\n continue\n R2 = R[:i] + \"0\" + \"?\" * (N - i - 1)\n if i == 0:\n R2 = R\n for j in range(N):\n if L[j] == \"1\" and j != 0:\n continue\n L2 = L[:j] + \"1\" + \"?\" * (N - j - 1)\n if j == 0:\n L2 = L\n if L2[0] == \"0\":\n break\n tmp = 1\n for r, l in zip(R2[1:], L2[1:]):\n if r == \"0\" and l == \"1\":\n tmp *= 0\n break\n if r == \"?\" and l == \"?\":\n tmp = tmp * 3 % mod\n if r == \"?\" and l == \"0\":\n tmp = tmp * 2 % mod\n if r == \"1\" and l == \"?\":\n tmp = tmp * 2 % mod\n ret += tmp\n ret %= mod\n return ret\n\n\nprint((f(L, R)))\n", "fast_code": "L, R = list(map(int, input().split()))\nMOD = 10**9 + 7\nl = \"{:060b}\".format(L)[::-1]\nr = \"{:060b}\".format(R)[::-1]\nmemo = [\n [[[-1 for l in range(2)] for k in range(2)] for j in range(2)] for i in range(60)\n]\n\n\ndef f(pos, flagX, flagY, flagZ):\n if pos == -1:\n return 1\n if memo[pos][flagX][flagY][flagZ] != -1:\n return memo[pos][flagX][flagY][flagZ]\n ret = 0\n\n if flagX or l[pos] == \"0\":\n ret += f(pos - 1, flagX, 1 if r[pos] == \"1\" else flagY, flagZ)\n\n if (flagX or l[pos] == \"0\") and (flagY or r[pos] == \"1\") and flagZ:\n ret += f(pos - 1, flagX, flagY, flagZ)\n\n if flagY or r[pos] == \"1\":\n ret += f(pos - 1, 1 if l[pos] == \"0\" else flagX, flagY, 1)\n ret %= MOD\n memo[pos][flagX][flagY][flagZ] = ret\n return ret\n\n\nans = f(59, 0, 0, 0)\nprint(ans)\n", "slow_time": 23510247972, "fast_time": 136169383, "speedup": 172.6544, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_0"} +{"pair_id": "python_10936", "problem_id": "p02570", "language": "python", "slow_code": "def LI():\n return list(map(int, input().split()))\n\n\ndef II():\n return int(input())\n\n\ndef yes():\n return print(\"Yes\")\n\n\ndef no():\n return print(\"No\")\n\n\nINF = float(\"inf\")\nfrom collections import deque, defaultdict, Counter\nfrom heapq import heappop, heappush\nfrom itertools import product, combinations\nfrom functools import reduce, lru_cache\nfrom math import pi, gcd\nfrom decimal import Decimal\n\n\nclass Combination:\n \"\"\"\"\"\"\n\n def __init__(self, n_max, mod=10**9 + 7):\n self.mod = mod\n self.modinv = self.make_modinv_list(n_max)\n self.fac, self.facinv = self.make_factorial_list(n_max)\n\n def __call__(self, n, r):\n return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n - r] % self.mod\n\n def make_factorial_list(self, n):\n\n fac = [1]\n facinv = [1]\n for i in range(1, n + 1):\n fac.append(fac[i - 1] * i % self.mod)\n facinv.append(facinv[i - 1] * self.modinv[i] % self.mod)\n return fac, facinv\n\n def make_modinv_list(self, n):\n\n modinv = [0] * (n + 1)\n modinv[1] = 1\n for i in range(2, n + 1):\n modinv[i] = self.mod - self.mod // i * modinv[self.mod % i] % self.mod\n return modinv\n\n\nclass Unionfind:\n def __init__(self, N):\n self.p = list(range(N))\n self.rank = [0] * N\n self.size = [1] * N\n\n def root(self, x):\n if self.p[x] != x:\n self.p[x] = self.root(self.p[x])\n return self.p[x]\n\n def same(self, x, y):\n return self.root(x) == self.root(y)\n\n def unite(self, x, y):\n u = self.root(x)\n v = self.root(y)\n if u == v:\n return\n if self.rank[u] < self.rank[v]:\n self.p[u] = v\n self.size[v] += self.size[u]\n self.size[u] = 0\n else:\n self.p[v] = u\n self.size[u] += self.size[v]\n self.size[v] = 0\n if self.rank[u] == self.rank[v]:\n self.rank[u] += 1\n\n def count(self, x):\n return self.size[self.root(x)]\n\n\nd, t, s = LI()\nif d <= t * s:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "def get_input() -> tuple:\n \"\"\"\"\"\"\n D, T, S = list(map(int, input().split()))\n return D, T, S\n\n\ndef main(D: int, T: int, S: int) -> None:\n \"\"\"\"\"\"\n\n ans = str()\n if D <= S * T:\n ans = \"Yes\"\n else:\n ans = \"No\"\n\n print(ans)\n\n\nif __name__ == \"__main__\":\n\n D, T, S = get_input()\n\n main(D, T, S)\n", "slow_time": 146040359, "fast_time": 31880727, "speedup": 4.5808, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_9"} +{"pair_id": "python_14650", "problem_id": "p03649", "language": "python", "slow_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\n\n\ndef is_possible(C):\n res = 0\n for x in A:\n if x + C - N >= 0:\n res += (x + C - N) // (N + 1) + 1\n\n return int(res <= C)\n\n\nl = 0\nr = 10**30\nis_possible(1234567894848)\nwhile r - l > 1:\n M = (l + r) // 2\n if is_possible(M) > 0:\n r = M\n else:\n l = M\nfor i in range(10**5, -1, -1):\n if is_possible(r - i):\n print((r - i))\n break\n", "fast_code": "n = int(eval(input()))\na = list(map(int, input().split()))\ni = 0\nans = 0\nwhile max(a) >= n:\n if a[i] >= n:\n cnt = a[i] // n\n ans += cnt\n a[i] -= n * cnt\n for j in range(n):\n if j == i:\n continue\n a[j] += cnt\n i = (i + 1) % n\nprint(ans)\n", "slow_time": 100457990677, "fast_time": 834262859, "speedup": 120.4153, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_4"} +{"pair_id": "python_16455", "problem_id": "p03796", "language": "python", "slow_code": "N = int(eval(input()))\nfrom math import factorial\n\ndiv = int(1e9 + 7)\nans = factorial(N) % div\nprint(ans)\n", "fast_code": "mod = int(1e9 + 7)\nn = int(eval(input()))\npower = 1\nfor i in range(1, n + 1):\n power = power * i % mod\nprint(power)\n", "slow_time": 27008058263, "fast_time": 2833968541, "speedup": 9.5301, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_28"} +{"pair_id": "python_5515", "problem_id": "p03251", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(10000)\n\n\ndef read_int():\n return int(input())\n\n\ndef read_int_n():\n return list(map(int, input().split()))\n\n\ndef read_float():\n return float(input())\n\n\ndef read_float_n():\n return list(map(float, input().split()))\n\n\ndef read_str():\n return input().strip()\n\n\ndef read_str_n():\n return list(map(str, input().split()))\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n error_print(e - s, \"sec\")\n return ret\n\n return wrap\n\n\n@mt\ndef slv(N, M, X, Y, x, y):\n mx = max(x)\n my = min(y)\n error_print(mx, my)\n if mx < my and (my > X and mx < Y):\n return \"No War\"\n return \"War\"\n\n\ndef main():\n N, M, X, Y = read_int_n()\n x = read_int_n()\n y = read_int_n()\n print(slv(N, M, X, Y, x, y))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "(*_, X, Y), x, y = eval(\"map(int,input().split()),\" * 3)\nprint((\"No\" * (max(X, *x) < min(Y, *y)), \"War\"))\n", "slow_time": 87179202, "fast_time": 18836950, "speedup": 4.6281, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_1"} +{"pair_id": "python_14857", "problem_id": "p02900", "language": "python", "slow_code": "def gcd(x, y):\n if x < y:\n x, y = y, x\n while y > 0:\n x, y = y, x % y\n return x\n\n\nINFTY = 10**6\nP = [1 for i in range(INFTY + 1)]\nP[0] = 0\nP[1] = 0\nfor i in range(2, int((INFTY + 1) ** 0.5) + 1):\n for j in range(i * i, INFTY + 1, i):\n P[j] = 0\nQ = []\nfor i in range(INFTY):\n if P[i] == 1:\n Q.append(i)\nA, B = list(map(int, input().split()))\nx = gcd(A, B)\ncnt = 1\nfor y in Q:\n if x % y == 0:\n cnt += 1\n while x % y == 0:\n x = x // y\nif x > 1:\n cnt += 1\nprint(cnt)\n", "fast_code": "import sys\n\nsr = lambda: sys.stdin.readline().rstrip()\nir = lambda: int(sr())\nlr = lambda: list(map(int, sr().split()))\nA, B = lr()\n\n\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n return a\n\n\nprimes = prime_factorize(min(A, B))\nanswer = set()\nfor p in primes:\n if A % p == 0 and B % p == 0:\n answer.add(p)\nprint((len(answer) + 1))\n", "slow_time": 293177338513, "fast_time": 55456862, "speedup": 5286.5836, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_17"} +{"pair_id": "python_16989", "problem_id": "p03700", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom fractions import Fraction\nfrom functools import lru_cache, reduce\nfrom itertools import (\n combinations,\n combinations_with_replacement,\n product,\n permutations,\n accumulate,\n)\nfrom operator import add, mul, sub, itemgetter, attrgetter\nimport sys\n\nreadline = sys.stdin.readline\nINF = 2**62 - 1\n\n\ndef read_int():\n return int(readline())\n\n\ndef read_int_n():\n return list(map(int, readline().split()))\n\n\ndef read_float():\n return float(readline())\n\n\ndef read_float_n():\n return list(map(float, readline().split()))\n\n\ndef read_str():\n return readline().strip()\n\n\ndef read_str_n():\n return readline().strip().split()\n\n\ndef ep(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.perf_counter()\n ret = f(*args, **kwargs)\n e = time.perf_counter()\n ep(e - s, \"sec\")\n return ret\n\n return wrap\n\n\nclass Bisect:\n def __init__(self, func):\n self.__func = func\n\n def bisect_left(self, x, lo, hi):\n while lo < hi:\n mid = (lo + hi) // 2\n if self.__func(mid) < x:\n lo = mid + 1\n else:\n hi = mid\n return lo\n\n def bisect_right(self, x, lo, hi):\n while lo < hi:\n mid = (lo + hi) // 2\n if x < self.__func(mid):\n hi = mid\n else:\n lo = mid + 1\n return lo\n\n\n@mt\ndef slv(N, A, B, H):\n c = A - B\n\n def f(n):\n m = n\n for h in H:\n h -= n * B\n if h > 0:\n m -= -(-h // c)\n return 1 if m >= 0 else 0\n\n return Bisect(f).bisect_left(1, 0, 10**9)\n\n\ndef main():\n N, A, B = read_int_n()\n H = [read_int() for _ in range(N)]\n print(slv(N, A, B, H))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "_, a, b, *H = list(map(int, open(0).read().split()))\nl, r = 0, 10**9\nwhile r - l > 1:\n m = (l + r) // 2\n if -sum(min(0, (h - m * b) // (b - a)) for h in H) > m:\n l = m\n else:\n r = m\nprint(r)\n", "slow_time": 170369562, "fast_time": 56893284, "speedup": 2.9945, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_2"} +{"pair_id": "python_13120", "problem_id": "p02783", "language": "python", "slow_code": "import sys\nimport socket\n\nhostname = socket.gethostname()\nif hostname == \"F451C\":\n sys.stdin = open(\"a1.in\")\n\n\ndef read_int_list():\n return list(map(int, input().split()))\n\n\ndef read_str_list():\n return input().split()\n\n\ndef read_int():\n return int(eval(input()))\n\n\ndef read_str():\n return eval(input())\n\n\ndef main_0():\n H, A = read_int_list()\n res = 0\n for i in range(10001):\n H = H - A\n res += 1\n if H <= 0:\n break\n print(res)\n\n\ndef main_1():\n H, A = read_int_list()\n res = H // A\n if H % A != 0:\n res += 1\n print(res)\n\n\ndef main():\n H, A = read_int_list()\n res = 0\n while H > 0:\n H -= A\n res += 1\n print(res)\n\n\nmain()\n", "fast_code": "def inputlist():\n return [int(k) for k in input().split()]\n\n\nH, A = inputlist()\nif H % A == 0:\n print((H // A))\nelse:\n print(((H // A) + 1))\n", "slow_time": 135296255, "fast_time": 18042889, "speedup": 7.4986, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_9"} +{"pair_id": "python_2215", "problem_id": "p02585", "language": "python", "slow_code": "import sys\n\nreadline = sys.stdin.readline\nreadall = sys.stdin.read\nns = lambda: readline().rstrip()\nni = lambda: int(readline().rstrip())\nnm = lambda: map(int, readline().split())\nnl = lambda: list(map(int, readline().split()))\nprn = lambda x: print(*x, sep=\"\\n\")\n\n\ndef solve():\n n, k = nm()\n p = nl()\n _c = nl()\n c = [0] * n\n for i in range(n):\n p[i] -= 1\n c[i] = _c[p[i]]\n m = 31\n MIN = -(1 << 63)\n vertex = list()\n score = list()\n vertex.append(p)\n score.append(c)\n for a in range(1, m + 1):\n p_ath = [0] * n\n c_ath = [0] * n\n for i in range(n):\n p_ath[i] = vertex[a - 1][vertex[a - 1][i]]\n c_ath[i] = score[a - 1][i] + score[a - 1][vertex[a - 1][i]]\n vertex.append(p_ath)\n score.append(c_ath)\n prv = [[MIN, 0] for _ in range(n)]\n nxt = [[MIN, MIN] for _ in range(n)]\n for b in range(m, -1, -1):\n for i in range(n):\n if (k >> b) & 1:\n nxt[vertex[b][i]][0] = max(\n nxt[vertex[b][i]][0], prv[i][0] + score[b][i]\n )\n nxt[vertex[b][i]][1] = max(\n nxt[vertex[b][i]][1], prv[i][1] + score[b][i]\n )\n nxt[i][0] = max(nxt[i][0], prv[i][0], prv[i][1])\n else:\n nxt[vertex[b][i]][0] = max(\n nxt[vertex[b][i]][0], prv[i][0] + score[b][i]\n )\n nxt[i][0] = max(nxt[i][0], prv[i][0])\n nxt[i][1] = max(nxt[i][1], prv[i][1])\n prv, nxt = nxt, prv\n ans = max(max(x) for x in prv)\n if ans == 0:\n ans = max(c)\n print(ans)\n return\n\n\nsolve()\n", "fast_code": "N, K = list(map(int, input().split()))\nP = list([int(x) - 1 for x in input().split()])\nC = list(map(int, input().split()))\nans = -float(\"inf\")\nfor start in range(N):\n cur = P[start]\n scores = [C[cur]]\n for _ in range(K):\n if cur == start:\n break\n cur = P[cur]\n scores.append(C[cur] + scores[-1])\n for goal in range(len(scores)):\n no_loop_sum = scores[goal]\n remain_hops = K - goal - 1\n if scores[-1] > 0:\n loops = remain_hops // len(scores)\n else:\n loops = 0\n ans = max(ans, no_loop_sum + scores[-1] * loops)\nprint(ans)\n", "slow_time": 231578340, "fast_time": 71739336, "speedup": 3.2281, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_8"} +{"pair_id": "python_9318", "problem_id": "p02792", "language": "python", "slow_code": "N = int(eval(input()))\n\n\ndef cnt(i, j):\n ret = 0\n si = str(i)\n for n in range(1, N + 1):\n if n % 10 != j:\n continue\n if str(n)[0] != si:\n continue\n ret += 1\n return ret\n\n\nans = 0\nfor i in range(10):\n for j in range(10):\n ans += cnt(i, j) * cnt(j, i)\nprint(ans)\n", "fast_code": "from collections import defaultdict\n\n\ndef main():\n N = int(eval(input()))\n combs = [(S[0], S[-1]) for S in map(str, list(range(1, N + 1)))]\n d = defaultdict(int)\n for pre, suf in combs:\n d[(pre, suf)] += 1\n d[(suf, pre)]\n ans = 0\n for key, val in list(d.items()):\n pre, suf = key\n ans += val * d[(suf, pre)]\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 1958045613, "fast_time": 131778554, "speedup": 14.8586, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_22"} +{"pair_id": "python_5286", "problem_id": "p02729", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\nball_numbers = [2 * i for i in range(N)]\nball_numbers.extend([2 * i + 1 for i in range(M)])\ncount = 0\nfor i, num1 in enumerate(ball_numbers):\n for j, num2 in enumerate(ball_numbers):\n if i == j:\n continue\n if (num1 + num2) % 2 == 0:\n count += 1\nprint((count // 2))\n", "fast_code": "a, b = list(map(int, input().split()))\nimport itertools\n\na1 = len(list(itertools.combinations(list(range(a)), 2)))\nb1 = len(list(itertools.combinations(list(range(b)), 2)))\nprint((a1 + b1))\n", "slow_time": 1766878550, "fast_time": 272958752, "speedup": 6.4731, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_18"} +{"pair_id": "python_13694", "problem_id": "p03774", "language": "python", "slow_code": "from scipy.spatial.distance import cdist\nimport numpy as np\n\nn, m = list(map(int, input().split()))\nst = [list(map(int, input().split())) for _ in range(n)]\ncp = [list(map(int, input().split())) for _ in range(m)]\n\n\ncd = cdist(st, cp, \"cityblock\")\nidx = np.argmin(cd, axis=1)\nfor i in idx:\n print((i + 1))\n", "fast_code": "N, M = list(map(int, input().split()))\nn = [list(map(int, input().split())) for _ in range(N)]\nm = [list(map(int, input().split())) for _ in range(M)]\nresult = []\nfor i in range(len(n)):\n result = []\n for j in range(len(m)):\n result.append(abs(n[i][0] - m[j][0]) + abs(n[i][1] - m[j][1]))\n print((result.index(min(result)) + 1))\n", "slow_time": 29997139149, "fast_time": 53884023, "speedup": 556.6982, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_21"} +{"pair_id": "python_4214", "problem_id": "p02709", "language": "python", "slow_code": "import sys\nimport numpy as np\n\n\ndef f(n, a_):\n a = []\n for i, ai in enumerate(a_):\n a.append([1 + i, ai])\n a.sort(key=lambda x: x[1], reverse=True)\n dp = np.zeros((n + 1, n + 1), np.int64)\n dp[1, 1] = a[0][1] * (n - a[0][0])\n dp[1, 0] = a[0][1] * (a[0][0] - 1)\n for i in range(2, n + 1):\n dp[i, 0] = dp[i - 1, 0] + a[i - 1][1] * abs((a[i - 1][0] - 1 - (i - 1)))\n dp[i, i] = dp[i - 1, i - 1] + a[i - 1][1] * abs((n - a[i - 1][0] - (i - 1)))\n\n l = dp[i - 1, 1:i] + [\n a[i - 1][1] * abs((a[i - 1][0] - 1 - j)) for j in range(i - 2, -1, -1)\n ]\n\n r = dp[i - 1, : i - 1] + [\n a[i - 1][1] * abs((n - a[i - 1][0] - j)) for j in range(i - 1)\n ]\n dp[i, 1:i] = np.maximum(l, r)\n return max(dp[n])\n\n\nif __name__ == \"__main__\":\n input = sys.stdin.readline\n n = int(eval(input()))\n a_ = list(map(int, input().split()))\n print((f(n, a_)))\n", "fast_code": "N = int(eval(input()))\nD = []\nfor i, a in enumerate(map(int, input().split())):\n D.append((a << 11) + i)\nD.sort(reverse=True)\ndp = [0] * (N + 1)\nfor i, d in enumerate(D, start=1):\n x, a = d % (1 << 11), d >> 11\n for j in reversed(list(range(0, i + 1))):\n dp[j] = max(\n (dp[j - 1] + a * (x - (j - 1))) * (j - 1 >= 0),\n (dp[j] + a * (N - (i - j) - x)) * (j <= i - 1),\n )\nprint((max(dp)))\n", "slow_time": 120871673, "fast_time": 56490914, "speedup": 2.1397, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_21"} +{"pair_id": "python_15412", "problem_id": "p02695", "language": "python", "slow_code": "N, M, Q = list(map(int, input().split()))\nabcd = [list(map(int, input().split())) for _ in range(Q)]\nm = M - 1\n\n\ndef f(s):\n if len(s) == N:\n return [s]\n result = []\n if s == \"\":\n r = 0\n else:\n r = int(s[-1])\n for i in range(r, m + 1):\n result.extend(f(s + str(i)))\n return result\n\n\nresult = 0\nV = f(\"\")\nfor s in V:\n A = [int(c) + 1 for c in s]\n t = 0\n for a, b, c, d in abcd:\n if A[b - 1] - A[a - 1] == c:\n t += d\n result = max(result, t)\nprint(result)\n", "fast_code": "target = []\n\n\ndef dfs(A):\n if len(A) == N:\n tmp = 0\n for a, b, c, d in arr:\n if A[b - 1] - A[a - 1] == c:\n tmp += d\n target.append(tmp)\n return\n start = 1\n if len(A) != 0:\n start = A[-1]\n for v in range(start, M + 1):\n A.append(v)\n dfs(A)\n A.pop()\n\n\nN, M, Q = list(map(int, input().split()))\narr = [list(map(int, input().split())) for _ in range(Q)]\ndfs([])\nprint((max(target)))\n", "slow_time": 2405983235, "fast_time": 549239550, "speedup": 4.3806, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_17"} +{"pair_id": "python_6745", "problem_id": "p02289", "language": "python", "slow_code": "import sys\n\n\ndef maxHeapify(A, i):\n l = i * 2 + 1\n r = i * 2 + 2\n if l < n:\n largest = l\n if r < n and A[r] > A[l]:\n largest = r\n if A[largest] > A[i]:\n A[i], A[largest] = A[largest], A[i]\n maxHeapify(A, largest)\n\n\ndef insert(S, k):\n global n\n S[n] = k\n n += 1\n i = n - 1\n p = (i - 1) // 2\n while i > 0 and S[i] > S[p]:\n S[i], S[p] = S[p], S[i]\n i = p\n p = (i - 1) // 2\n\n\ndef extractMax(S):\n global n\n if n == 1:\n n -= 1\n return S[0]\n ans = S[0]\n n -= 1\n S[0] = S[n]\n i = 0\n while True:\n l = i * 2 + 1\n r = i * 2 + 2\n if l >= n:\n break\n largest = l\n if r < n and A[r] > A[l]:\n largest = r\n if A[largest] > A[i]:\n A[i], A[largest] = A[largest], A[i]\n i = largest\n else:\n break\n return ans\n\n\nA = [0] * 2000000\nS = []\nn = 0\nfor s in sys.stdin:\n if s[2] == \"s\":\n insert(A, int(s[7:]))\n elif s[2] == \"t\":\n S.append(extractMax(A))\n else:\n break\nprint((\"\\n\".join(map(str, S))))\n", "fast_code": "import sys\nfrom heapq import heappush, heappop\n\nH = []\nO = []\nfor e in sys.stdin:\n if \"i\" == e[0]:\n heappush(H, -int(e[7:]))\n elif \"t\" == e[2]:\n O += [-heappop(H)]\n else:\n print((\"\\n\".join(map(str, O))))\n", "slow_time": 170032903, "fast_time": 24530562, "speedup": 6.9315, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_4"} +{"pair_id": "python_1451", "problem_id": "p03612", "language": "python", "slow_code": "import sys\nfrom collections import deque\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef main():\n N = int(eval(input()))\n P = [0] + list(map(int, input().split()))\n same = deque()\n for i in range(1, N + 1):\n if i == P[i]:\n same.append(i)\n if not same:\n print((0))\n return\n ans = 0\n x = same.popleft()\n if not same:\n print((1))\n return\n while same:\n if same[0] - x == 1:\n same.popleft()\n ans += 1\n if same:\n x = same.popleft()\n if not same:\n ans += 1\n break\n else:\n ans += 1\n x = same.popleft()\n if not same:\n ans += 1\n break\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "n = int(eval(input()))\na = list(map(int, input().split()))\nans = 0\nfor i in range(n - 1):\n if a[i] == i + 1:\n a[i], a[i + 1] = a[i + 1], a[i]\n ans += 1\nif a[-1] == n:\n ans += 1\nprint(ans)\n", "slow_time": 64178025, "fast_time": 28554657, "speedup": 2.2476, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_14"} +{"pair_id": "python_17124", "problem_id": "p02555", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\ndef per(n, r, mod=10**9 + 7):\n per = 1\n for i in range(r):\n per = per * (n - i) % mod\n return per\n\n\ndef com(n, r, mod=10**9 + 7):\n bunshi = per(n, r, mod)\n bunbo = 1\n for i in range(1, r + 1):\n bunbo = bunbo * i % mod\n return bunshi * pow(bunbo, -1, mod) % mod\n\n\ndef main():\n s = int(eval(input()))\n ans = 0\n for i in range(1, (s // 3) + 1):\n k = s - 3 * i\n ans += com(k + i - 1, i - 1)\n\n print((ans % (10**9 + 7)))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "s = int(eval(input()))\nMOD = 10**9 + 7\nC = [0] * (s + 1)\nC[0] = 1\nfor n in range(3, s + 1):\n C[n] = (C[n - 1] + C[n - 3]) % MOD\nprint((C[s]))\n", "slow_time": 205270561, "fast_time": 27847693, "speedup": 7.3712, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_18"} +{"pair_id": "python_10767", "problem_id": "p03767", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef A():\n n = I()\n a = LI()\n a.sort(key=lambda x: -x)\n ans = 0\n for i in range(n):\n ans += a[2 * i + 1]\n print(ans)\n return\n\n\ndef B():\n def dfs(d, x, c):\n if d <= dp[x]:\n return\n dp[x] = d\n if not f[x]:\n f[x] = c\n for y in v[x]:\n dfs(d - 1, y, c)\n\n n, m = LI()\n f = [0] * n\n v = [[] for i in range(n)]\n for i in range(m):\n a, b = LI()\n a -= 1\n b -= 1\n v[a].append(b)\n v[b].append(a)\n dp = defaultdict(lambda: -1)\n q = I()\n l = LIR(q)\n l = l[::-1]\n for x, d, c in l:\n x -= 1\n dfs(d, x, c)\n for i in f:\n print(i)\n return\n\n\ndef C():\n n = I()\n return\n\n\ndef D():\n n = I()\n return\n\n\ndef E():\n n = I()\n return\n\n\ndef F():\n n = I()\n return\n\n\nif __name__ == \"__main__\":\n A()\n", "fast_code": "def slove():\n import sys\n\n input = sys.stdin.readline\n n = int(input().rstrip(\"\\n\"))\n a = list(map(int, input().rstrip(\"\\n\").split()))\n a.sort(reverse=True)\n print((sum(a[1 : n * 2 : 2])))\n\n\nif __name__ == \"__main__\":\n slove()\n", "slow_time": 173061558, "fast_time": 28066028, "speedup": 6.1662, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_27"} +{"pair_id": "python_14406", "problem_id": "p02669", "language": "python", "slow_code": "check = dict()\nN, z, d = 0, [], 0\n\n\ndef dfs_sub(n, ttf, cha):\n global check, d\n\n check[0] = min(check[n] + n * d, check[0])\n\n x1, x2 = n // ttf, n % ttf\n if x1 in check:\n if check[x1] > check[n] + x2 * d + cha:\n check[x1] = check[n] + x2 * d + cha\n dfs(x1)\n else:\n check[x1] = check[n] + x2 * d + cha\n dfs(x1)\n\n x1, x2 = n // ttf + 1, ttf - n % ttf\n if x1 in check:\n if check[x1] > check[n] + x2 * d + cha:\n check[x1] = check[n] + x2 * d + cha\n dfs(x1)\n else:\n check[x1] = check[n] + x2 * d + cha\n dfs(x1)\n\n\ndef dfs(n):\n global b\n for i, j in zip([2, 3, 5], b):\n dfs_sub(n, i, j)\n\n\nt = int(eval(input()))\nfor i in range(t):\n N, *b, d = list(map(int, input().split()))\n z = list(zip([2, 3, 5], b))\n check = {N: 0, 0: N * d}\n dfs(N)\n print((check[0]))\n", "fast_code": "T = int(eval(input()))\nwhile T > 0:\n N, A, B, C, D = list(map(int, input().split()))\n memo = {}\n\n def d(n):\n if n == 0:\n return 0\n if n == 1:\n return D\n if n in memo:\n return memo[n]\n ret = n * D\n if n % 2 == 0:\n ret = min(ret, A + d(n // 2))\n else:\n ret = min(\n ret,\n (n % 2) * D + A + d(n // 2),\n (2 - n % 2) * D + A + d((n + (2 - n % 2)) // 2),\n )\n if n % 3 == 0:\n ret = min(ret, B + d(n // 3))\n else:\n ret = min(\n ret,\n (n % 3) * D + B + d(n // 3),\n (3 - n % 3) * D + B + d((n + (3 - n % 3)) // 3),\n )\n if n % 5 == 0:\n ret = min(ret, C + d(n // 5))\n else:\n ret = min(\n ret,\n (n % 5) * D + C + d(n // 5),\n (5 - n % 5) * D + C + d((n + (5 - n % 5)) // 5),\n )\n memo[n] = ret\n return ret\n\n print((d(N)))\n T -= 1\n", "slow_time": 402246833030, "fast_time": 14346083168, "speedup": 28.0388, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_23"} +{"pair_id": "python_2637", "problem_id": "p02660", "language": "python", "slow_code": "n = int(eval(input()))\na = p = 1\nwhile p < 6**8:\n c = t = 0\n p += 1\n while n % p < 1:\n n //= p\n x = c == t\n t += x\n c += 1 - t * x\n a += x\nprint((a - (n < 2)))\n", "fast_code": "import sys\n\nN = int(sys.stdin.readline().rstrip())\n\n\ndef make_divisors(n):\n divisors = []\n for i in range(1, int(n**0.5) + 1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i:\n divisors.append(n // i)\n divisors.sort()\n return divisors\n\n\ndef prime_factorize(n):\n a = []\n while n % 2 == 0:\n a.append(2)\n n //= 2\n f = 3\n while f * f <= n:\n if n % f == 0:\n a.append(f)\n n //= f\n else:\n f += 2\n if n != 1:\n a.append(n)\n a = set(a)\n if len(a) == 1:\n return True\n else:\n return False\n\n\ndivisors = make_divisors(N)\nans = 0\nfor d in divisors:\n if prime_factorize(d) and N % d == 0:\n N //= d\n ans += 1\nprint(ans)\n", "slow_time": 119229729407, "fast_time": 4531388536, "speedup": 26.312, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_24"} +{"pair_id": "python_5920", "problem_id": "p03693", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef solve():\n r, g, b = LI()\n s = r * 100 + g * 10 + b\n if s % 4 == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n return\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "r, g, b = list(map(int, input().split()))\nrgb = 100 * r + 10 * g + b\nprint((\"YES\" if rgb % 4 == 0 else \"NO\"))\n", "slow_time": 90554878, "fast_time": 13947746, "speedup": 6.4924, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_18"} +{"pair_id": "python_3318", "problem_id": "p03695", "language": "python", "slow_code": "n = int(eval(input()))\nl = list(map(int, input().split()))\nd = {}\nfor i in range(n):\n if 1 <= l[i] <= 399:\n a = 0\n elif 400 <= l[i] <= 799:\n a = 1\n elif 800 <= l[i] <= 1199:\n a = 2\n elif 1200 <= l[i] <= 1599:\n a = 3\n elif 1600 <= l[i] <= 1999:\n a = 4\n elif 2000 <= l[i] <= 2399:\n a = 5\n elif 2400 <= l[i] <= 2799:\n a = 6\n elif 2800 <= l[i] <= 3199:\n a = 7\n else:\n a = 8\n if a in d:\n d[a] += 1\n else:\n d[a] = 1\nif not (8 in d):\n print((len(list(d.keys())), len(list(d.keys()))))\nelse:\n if len(list(d.keys())) == 1:\n print((len(list(d.keys())), len(list(d.keys())) - 1 + d[8]))\n else:\n print((len(list(d.keys())) - 1, len(list(d.keys())) - 1 + d[8]))\n", "fast_code": "eval(input())\nsuper_coders_cnt = 0\ncoders = set()\nfor r in map(int, input().split()):\n if r >= 3200:\n super_coders_cnt += 1\n else:\n coders.add(r // 400)\nprint((max(1, len(coders)), len(coders) + super_coders_cnt))\n", "slow_time": 84169651, "fast_time": 25553878, "speedup": 3.2938, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_2"} +{"pair_id": "python_11443", "problem_id": "p03504", "language": "python", "slow_code": "from itertools import accumulate\n\nN, C = list(map(int, input().split()))\nG = [[0] * (10**5 + 1) for i in range(C)]\nfor i in range(N):\n s, t, c = list(map(int, input().split()))\n c = c - 1\n G[c][s - 1] += 1\n G[c][t] -= 1\nfor i in range(C):\n G[i] = list(accumulate(G[i]))\nans = 0\nfor i in range(10**5 + 1):\n tmp = 0\n for c in range(C):\n tmp += min(1, G[c][i])\n ans = max(ans, tmp)\nprint(ans)\n", "fast_code": "def main():\n N, C = list(map(int, input().split()))\n\n R = [[0] * (10**5) for _ in range(C)]\n for _ in range(N):\n s, t, c = list(map(int, input().split()))\n\n R[c - 1][s - 1 : t] = [1] * (t - (s - 1))\n ans = max(list(map(sum, list(zip(*R)))))\n \"\"\"\"\"\"\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 52568666211, "fast_time": 9027760146, "speedup": 5.823, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_8"} +{"pair_id": "python_10363", "problem_id": "p02706", "language": "python", "slow_code": "int1 = lambda x: int(x) - 1\n\n\ndef II():\n return int(eval(input()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef MI1():\n return list(map(int1, input().split()))\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef LLI(rows_number):\n return [LI() for _ in range(rows_number)]\n\n\ndef solve():\n n, m = MI()\n A = LI()\n sm = sum(A)\n if n - sm >= 0:\n print((n - sm))\n else:\n print((-1))\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "n, m = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = sum(a)\nprint((max(-1, n - b)))\n", "slow_time": 45502445, "fast_time": 13378902, "speedup": 3.4011, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_5"} +{"pair_id": "python_15912", "problem_id": "p03112", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import sqrt, hypot, factorial, pi, sin, cos, radians, log10\n\nif sys.version_info.minor >= 5:\n from math import gcd\nelse:\n from fractions import gcd\nfrom heapq import heappop, heappush, heapify, heappushpop\nfrom bisect import bisect_left, bisect_right\nfrom itertools import permutations, combinations, product, accumulate\nfrom operator import itemgetter, mul, xor\nfrom copy import copy, deepcopy\nfrom functools import reduce, partial\nfrom fractions import Fraction\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom datetime import date\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef round(x):\n return int((x * 2 + 1) // 2)\n\n\ndef fermat(x, y, MOD):\n return x * pow(y, MOD - 2, MOD) % MOD\n\n\ndef lcm(x, y):\n return (x * y) // gcd(x, y)\n\n\ndef lcm_list(nums):\n return reduce(lcm, nums, 1)\n\n\ndef gcd_list(nums):\n return reduce(gcd, nums, nums[0])\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST():\n return list(map(int, input().split()))\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = float(\"inf\")\nMOD = 10**9 + 7\nA, B, Q = MAP()\nS = [-INF] * (A + 2)\nfor i in range(A):\n S[i + 1] = INT()\nT = [-INF] * (B + 2)\nfor i in range(B):\n T[i + 1] = INT()\nS[-1] = T[-1] = INF\nfor i in range(Q):\n dist1 = dist2 = dist3 = dist4 = INF\n x = INT()\n\n idx1 = bisect_right(S, x) - 1\n\n idx2 = bisect_left(S, x)\n idx3 = bisect_right(T, x) - 1\n idx4 = bisect_left(T, x)\n\n dist1 = x - S[idx1]\n\n if dist1 != INF:\n dist1 += min(abs(S[idx1] - T[idx3]), abs(S[idx1] - T[idx4]))\n dist2 = S[idx2] - x\n if dist2 != INF:\n dist2 += min(abs(S[idx2] - T[idx3]), abs(S[idx2] - T[idx4]))\n dist3 = x - T[idx3]\n if dist3 != INF:\n dist3 += min(abs(T[idx3] - S[idx1]), abs(T[idx3] - S[idx2]))\n dist4 = T[idx4] - x\n if dist4 != INF:\n dist4 += min(abs(T[idx4] - S[idx1]), abs(T[idx4] - S[idx2]))\n print((min(dist1, dist2, dist3, dist4)))\n", "fast_code": "import sys\nimport bisect\n\ninput = sys.stdin.readline\na, b, q = list(map(int, input().split()))\nans = 10**100\ns = [-ans] + [int(eval(input())) for i in range(a)] + [ans]\nt = [-ans] + [int(eval(input())) for i in range(b)] + [ans]\nx = [int(eval(input())) for i in range(q)]\nans = 10**100\nfor i in range(q):\n ans = 10**100\n s_idx = bisect.bisect_left(s, x[i])\n t_idx = bisect.bisect_left(t, x[i])\n s_idx -= 1\n t_idx -= 1\n\n for j in s[s_idx + 0], s[s_idx + 1]:\n for k in t[t_idx + 0], t[t_idx + 1]:\n ans = min(ans, abs(x[i] - j) + abs(j - k), abs(x[i] - k) + abs(j - k))\n print(ans)\n", "slow_time": 209429987, "fast_time": 81283677, "speedup": 2.5765, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_17"} +{"pair_id": "python_11253", "problem_id": "p03504", "language": "python", "slow_code": "N, C = list(map(int, input().split()))\nfrom collections import defaultdict\n\nCbef = defaultdict(int)\ntime = defaultdict(int)\nTV = [tuple(map(int, input().split())) for i in range(N)]\nTV.sort(key=lambda x: x[0])\nfor s, t, c in TV:\n if Cbef[c] == s:\n time[s] += 1\n time[t] -= 1\n Cbef[c] = t\n else:\n time[s - 1] += 1\n time[t] -= 1\n Cbef[c] = t\nans = 0\nnow = time[0]\nans = now\nfor i in range(1, 10**5 + 1):\n now += time[i]\n ans = max(ans, now)\nprint(ans)\n", "fast_code": "def func():\n tvs = []\n for i in range(num):\n tvs.append((-1, -1))\n for i in range(len(bans)):\n now = bans[i][0]\n can = bans[i][2]\n\n for j, tv in enumerate(tvs):\n if tv[1] == -1 or (tv[1] == can and tv[0] <= now) or tv[0] <= now - 1:\n del tvs[j]\n tvs.append((bans[i][1], can))\n break\n else:\n return False\n return True\n\n\nn, C = list(map(int, input().split()))\nbans = []\nfor i in range(n):\n bans.append(tuple(map(int, input().split())))\nbans.sort(key=lambda x: x[0])\nfor num in range(1, 1024):\n if func():\n print(num)\n break\n", "slow_time": 15465425866, "fast_time": 67308564, "speedup": 229.7691, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_21"} +{"pair_id": "python_14566", "problem_id": "p00150", "language": "python", "slow_code": "r = 10001\nsqrt = int(r**0.5)\np = [1] * r\ntwin = [0] * r\np[0] = 0\np[1::2] = [0 for x in range(1, r, 2)]\nfor i in range(2, r, 2):\n if p[i]:\n p[2 * i + 1 :: i + 1] = [0 for x in range(2 * i + 1, r, i + 1)]\n if p[i - 2]:\n twin[i : i + 300] = [i + 1 for x in range(i, i + 300)]\nwhile True:\n n = int(input())\n if n == 0:\n break\n print(twin[n - 1] - 2, twin[n - 1])\n", "fast_code": "import bisect as bs\n\n\ndef prime(m):\n N = list(range(1, m + 1, 2))\n N[0] = 2\n for i in range(1, int(m**0.5) + 1):\n x = N[i]\n if x:\n N[i + x :: x] = [0] * len(N[i + x :: x])\n return [_f for _f in N if _f]\n\n\nP = prime(10000)\nx = [P[i] for i in range(1, len(P)) if P[i] - P[i - 1] == 2]\nwhile 1:\n n = eval(input())\n if n == 0:\n break\n a = x[bs.bisect_right(x, n) - 1]\n print(a - 2, a)\n", "slow_time": 1637634757, "fast_time": 128294719, "speedup": 12.7646, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_3"} +{"pair_id": "python_13356", "problem_id": "p03636", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\ns = LS2()\nprint((s[0] + str(len(s) - 2) + s[-1]))\n", "fast_code": "a, *b, c = input()\nprint(a, len(b), c, sep=\"\")\n", "slow_time": 47248268, "fast_time": 9042859, "speedup": 5.2249, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_15"} +{"pair_id": "python_206", "problem_id": "p03240", "language": "python", "slow_code": "N = int(eval(input()))\nXYH = [list(map(int, input().split())) for i in range(N)]\nXYH.sort(key=lambda x: x[2], reverse=1)\nfor Cx in range(101):\n for Cy in range(101):\n H = XYH[0][2] + abs(XYH[0][0] - Cx) + abs(XYH[0][1] - Cy)\n cnt = 0\n for X, Y, h in XYH:\n if h == max(H - abs(X - Cx) - abs(Y - Cy), 0):\n cnt += 1\n if cnt == N:\n print((Cx, Cy, H))\n break\n", "fast_code": "n = int(input())\nXYH = []\nfor _ in range(n):\n x, y, h = map(int, input().split())\n if h != 0:\n XYH.append([x, y, h])\nflag = False\nans = XYH[0]\nfor i in range(101):\n for j in range(101):\n tempH = abs(XYH[0][0] - i) + abs(XYH[0][1] - j) + XYH[0][2]\n for x, y, h in XYH[1:]:\n if abs(x - i) + abs(y - j) + h != tempH:\n flag = False\n break\n else:\n flag = True\n if flag:\n ans = [i, j, tempH]\n break\n if flag:\n break\nprint(*ans, sep=\" \")\n", "slow_time": 9772291562, "fast_time": 633486853, "speedup": 15.4262, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_26"} +{"pair_id": "python_6988", "problem_id": "p03713", "language": "python", "slow_code": "h, w = list(map(int, input().split()))\nif h % 3 == 0 or w % 3 == 0:\n print((0))\nelse:\n x = []\n for i in range(1, w):\n sub = []\n sub.append([h * i, h * ((w - i) // 2), h * (w - i) - h * ((w - i) // 2)])\n sub.append(\n [h * i, h * ((w - i) // 2 + 1), h * (w - i) - h * ((w - i) // 2 + 1)]\n )\n sub.append([h * i, (w - i) * (h // 2), h * (w - i) - (w - i) * (h // 2)])\n sub.append(\n [h * i, (w - i) * (h // 2 + 1), h * (w - i) - (w - i) * (h // 2 + 1)]\n )\n for j in sub:\n x.append(max(j) - min(j))\n for i in range(1, h):\n sub = []\n sub.append([w * i, w * ((h - i) // 2), w * (h - i) - w * ((h - i) // 2)])\n sub.append(\n [w * i, w * ((h - i) // 2 + 1), w * (h - i) - w * ((h - i) // 2 + 1)]\n )\n sub.append([w * i, (h - i) * (w // 2), w * (h - i) - (h - i) * (w // 2)])\n sub.append(\n [w * i, (h - i) * (w // 2 + 1), w * (h - i) - (h - i) * (w // 2 + 1)]\n )\n for j in sub:\n x.append(max(j) - min(j))\n print((min(x)))\n", "fast_code": "def answer(H, W, ans):\n global ans_list\n for x in range(1, W):\n y1 = H // 2\n S1 = [H * x, (W - x) * y1, (W - x) * (H - y1)]\n ans_list.append(max(S1) - min(S1))\n y2 = (W - x) // 2\n S2 = [H * x, H * y2, H * (W - x - y2)]\n ans_list.append(max(S2) - min(S2))\n\n\nif __name__ == \"__main__\":\n H, W = [int(i) for i in input().split()]\n ans_list = []\n answer(H, W, ans_list)\n answer(W, H, ans_list)\n print((min(ans_list)))\n", "slow_time": 214288553809, "fast_time": 52133236023, "speedup": 4.1104, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_1"} +{"pair_id": "python_16294", "problem_id": "p03721", "language": "python", "slow_code": "n, k = list(map(int, input().split()))\nd = [0 for i in range(100010)]\nfor i in range(n):\n a, b = list(map(int, input().split()))\n d[a] += b\nfor j, e in enumerate(d):\n k -= e\n if k <= 0:\n print(j)\n break\n", "fast_code": "n, k = list(map(int, input().split()))\nab = []\nfor i in range(n):\n aa, bb = list(map(int, input().split()))\n ab.append([aa, bb])\nab.sort(key=lambda x: x[0])\na, b = [], []\nfor aa, bb in ab:\n a.append(aa)\n b.append(bb)\nfrom itertools import accumulate\n\nc = list(accumulate(b))\nidx = -1\nfor i in range(n):\n if i == 0:\n if 0 <= k <= c[i]:\n idx = i\n break\n continue\n if c[i - 1] < k <= c[i]:\n idx = i\n break\nprint((a[idx]))\n", "slow_time": 1372992318, "fast_time": 55349935, "speedup": 24.8057, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_11"} +{"pair_id": "python_13810", "problem_id": "p02401", "language": "python", "slow_code": "import sys\nimport operator\nfrom math import floor\n\n\ndef string_to_list_spliter():\n lst = [i for i in sys.stdin.readline().split()]\n return lst\n\n\ndef main():\n ops = {\n \"+\": operator.add,\n \"-\": operator.sub,\n \"*\": operator.mul,\n \"/\": operator.truediv,\n }\n\n while True:\n lst = string_to_list_spliter()\n if lst[1] == \"?\":\n break\n elif lst[1] == \"+\":\n print((ops[lst[1]](int(lst[0]), int(lst[2]))))\n elif lst[1] == \"-\":\n print((ops[lst[1]](int(lst[0]), int(lst[2]))))\n elif lst[1] == \"*\":\n print((ops[lst[1]](int(lst[0]), int(lst[2]))))\n elif lst[1] == \"/\":\n print((floor(ops[lst[1]](int(lst[0]), int(lst[2])))))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "while 1:\n x = input()\n i = x.split()\n if i[1] == \"?\":\n break\n print(eval(x))\n", "slow_time": 73681624, "fast_time": 24064415, "speedup": 3.0618, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_19"} +{"pair_id": "python_5472", "problem_id": "p02951", "language": "python", "slow_code": "def main():\n a, b, c = (int(i) for i in input().split())\n d = a - b\n print((max(0, c - d)))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "print((max(0, eval(\"-\" + input().replace(\" \", \"+\")))))\n", "slow_time": 21612627, "fast_time": 10452475, "speedup": 2.0677, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_0"} +{"pair_id": "python_6619", "problem_id": "p02770", "language": "python", "slow_code": "import sys, collections as cl, bisect as bs\n\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\nmod = 10**9 + 7\nMax = sys.maxsize\n\n\ndef l():\n return list(map(int, input().split()))\n\n\ndef m():\n return list(map(int, input().split()))\n\n\ndef onem():\n return int(eval(input()))\n\n\ndef s(x):\n a = []\n aa = x[0]\n su = 1\n for i in range(len(x) - 1):\n if aa != x[i + 1]:\n a.append([aa, su])\n aa = x[i + 1]\n su = 1\n else:\n su += 1\n a.append([aa, su])\n return a\n\n\ndef jo(x):\n return \" \".join(map(str, x))\n\n\ndef max2(x):\n return max(list(map(max, x)))\n\n\ndef In(x, a):\n k = bs.bisect_left(a, x)\n if k != len(a) and a[k] == x:\n return True\n else:\n return False\n\n\n\"\"\"\"\"\"\nmod = 10**9 + 7\nN = 10**5 * 2\n\n\ndef cmb(n, r):\n if r < 0 or r > n:\n return 0\n r = min(r, n - r)\n return g1[n] * g2[r] * g2[n - r] % mod\n\n\ndef p(n, r):\n if r < 0 or r > n:\n return 0\n return g1[n] * g2[n - r] % mod\n\n\ng1 = [1, 1]\ng2 = [1, 1]\ninverse = [0, 1]\nfor i in range(2, N + 1):\n g1.append((g1[-1] * i) % mod)\n inverse.append((-inverse[mod % i] * (mod // i)) % mod)\n g2.append((g2[-1] * inverse[-1]) % mod)\n\nimport fractions\nfrom functools import reduce\n\n\ndef gcd(*numbers):\n return reduce(fractions.gcd, numbers)\n\n\ndef gcd_list(numbers):\n return reduce(fractions.gcd, numbers)\n\n\ndef lcm_base(x, y):\n return (x * y) // fractions.gcd(x, y)\n\n\ndef lcm(*numbers):\n return reduce(lcm_base, numbers, 1)\n\n\ndef lcm_list(numbers):\n return reduce(lcm_base, numbers, 1)\n\n\nk, q = m()\nd = l()\nfor i in range(q):\n n, x, mm = m()\n co = 0\n po = []\n for j in range(k):\n po.append(d[j] % mm if d[j] % mm > 0 else mm)\n \"\"\"\"\"\"\n pp = sum(po) * ((n - 1) // k)\n pp += x\n for j in range((n - 1) % k):\n pp += po[j]\n co += (pp // mm) - (x // mm)\n print((n - co - 1))\n", "fast_code": "import numpy as np\n\nk, q = list(map(int, input().split()))\nd = np.array(list(map(int, input().split()))).astype(np.int64)\nqueries = [tuple(map(int, input().split())) for _ in range(q)]\nfor n, x, m in queries:\n d_mod = d % m\n quotient, rem = divmod(n - 1, k)\n rem_d_mod = d_mod[:rem]\n print(\n (\n n\n - 1\n - (x % m + quotient * np.sum(d_mod) + np.sum(rem_d_mod)) // m\n - quotient * np.count_nonzero(d_mod == 0)\n - np.count_nonzero(rem_d_mod == 0)\n )\n )\n", "slow_time": 57561469129, "fast_time": 56145435, "speedup": 1025.2208, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_5"} +{"pair_id": "python_5319", "problem_id": "p03997", "language": "python", "slow_code": "from collections import deque\nfrom heapq import heapify, heappop, heappush, heappushpop\nfrom copy import copy, deepcopy\nfrom itertools import product, permutations, combinations, combinations_with_replacement\nfrom collections import defaultdict, Counter\nfrom bisect import bisect_left, bisect_right\n\n\nfrom functools import reduce\nfrom pprint import pprint\n\nINF = float(\"inf\")\n\n\ndef myinput():\n return list(map(int, input().split()))\n\n\ndef mylistinput(n):\n return [list(myinput()) for _ in range(n)]\n\n\ndef mycol(data, col):\n return [row[col] for row in data]\n\n\ndef mysort(data, col, reverse_flag):\n data.sort(key=lambda x: x[col], reverse=reverse_flag)\n return data\n\n\ndef mymax(data):\n M = -1 * float(\"inf\")\n for i in range(len(data)):\n m = max(data[i])\n M = max(M, m)\n return M\n\n\ndef mymin(data):\n m = float(\"inf\")\n for i in range(len(data)):\n M = min(data[i])\n m = min(m, M)\n return m\n\n\ndef mycount(ls, x):\n\n l = bisect_left(ls, x)\n r = bisect_right(ls, x)\n return r - l\n\n\ndef myoutput(ls, space=True):\n if space:\n if len(ls) == 0:\n print(\" \")\n elif type(ls[0]) == str:\n print((\" \".join(ls)))\n elif type(ls[0]) == int:\n print((\" \".join(map(str, ls))))\n else:\n print(\"Output Error\")\n else:\n if len(ls) == 0:\n print(\"\")\n elif type(ls[0]) == str:\n print((\"\".join(ls)))\n elif type(ls[0]) == int:\n print((\"\".join(map(str, ls))))\n else:\n print(\"Output Error\")\n\n\na = int(eval(input()))\nb = int(eval(input()))\nh = int(eval(input()))\nans = (a + b) * h / 2\nprint((int(ans)))\n", "fast_code": "a = int(eval(input()))\nb = int(eval(input()))\nh = int(eval(input()))\ns = int((a + b) * h / 2)\nprint(s)\n", "slow_time": 157783046, "fast_time": 21435157, "speedup": 7.3609, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_3"} +{"pair_id": "python_2207", "problem_id": "p02989", "language": "python", "slow_code": "from collections import Counter\n\nN = int(eval(input()))\nd = Counter(list(map(int, input().split())))\nans = 0\nl, r = 0, N\nfor K in range(10**5 + 1):\n if l == r:\n ans += 1\n l += d[K]\n r -= d[K]\nprint(ans)\n", "fast_code": "from bisect import bisect_left\n\nN = int(eval(input()))\nd = list(map(int, input().split()))\nd.sort()\nto_take = N // 2\ncnt = 0\nfor x in range(d[0], d[-1] + 1):\n idx = bisect_left(d, x)\n\n if idx == to_take:\n cnt += 1\nprint(cnt)\n", "slow_time": 22724424392, "fast_time": 4404972353, "speedup": 5.1588, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_23"} +{"pair_id": "python_8950", "problem_id": "p02641", "language": "python", "slow_code": "import sys\n\nX, N = list(map(int, input().split()))\np = list(map(int, input().split()))\nmin_dif = 10000\noutput = 10000\nfor i in range(10000):\n if (5000 - i in p) == False:\n if abs(X - (5000 - i)) <= min_dif:\n min_dif = abs(X - (5000 - i))\n output = 5000 - i\nprint(output)\n", "fast_code": "X, N = list(map(int, input().split(\" \")))\nif N == 0:\n print(X)\nelse:\n ls = list(map(int, input().split(\" \")))\n diff, rst = -1, 0\n for i in range(101, -1, -1):\n if i not in ls:\n if diff == -1:\n diff = abs(X - i)\n rst = i\n else:\n diff = min(diff, abs(X - i))\n if diff == abs(X - i):\n rst = i\n print(rst)\n", "slow_time": 1753973423, "fast_time": 53096639, "speedup": 33.0336, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_14"} +{"pair_id": "python_7506", "problem_id": "p03835", "language": "python", "slow_code": "k, s = list(map(int, input().split()))\ncnt = 0\nfor i in range(k + 1):\n for j in range(k + 1):\n if s >= i + j >= s - k:\n cnt += 1\nprint(cnt)\n", "fast_code": "k, s = list(map(int, input().split()))\ncnt = 0\nminX = max(s - 2 * k, 0)\nmaxX = min(s, k)\nfor x in range(minX, maxX + 1):\n rest = s - x\n if k >= rest:\n cnt += rest + 1\n else:\n cnt += 2 * k - rest + 1\nprint(cnt)\n", "slow_time": 301802361, "fast_time": 26629185, "speedup": 11.3335, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_18"} +{"pair_id": "python_233", "problem_id": "p03061", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools\nimport random\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 10**9 + 7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef LF():\n return [float(x) for x in sys.stdin.readline().split()]\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef F():\n return float(sys.stdin.readline())\n\n\ndef S():\n return input()\n\n\ndef pf(s):\n return print(s, flush=True)\n\n\nclass Prime:\n def __init__(self, n):\n self.M = m = int(math.sqrt(n)) + 10\n self.A = a = [True] * m\n a[0] = a[1] = False\n self.T = t = []\n for i in range(2, int(math.sqrt(m)) + 1):\n if not a[i]:\n continue\n t.append(i)\n for j in range(i * i, m, i):\n a[j] = False\n\n def is_prime(self, n):\n return self.A[n]\n\n def division(self, n):\n d = collections.defaultdict(int)\n for c in self.T:\n while n % c == 0:\n d[c] += 1\n n //= c\n if n < 2:\n break\n if n > 1:\n d[n] += 1\n return d.items()\n\n def sowa(self, n):\n r = 1\n for k, v in self.division(n):\n t = 1\n for i in range(1, v + 1):\n t += math.pow(k, i)\n r *= t\n return r\n\n\ndef main():\n n = I()\n a = sorted(LI())\n pr = Prime(10**9)\n p = collections.defaultdict(int)\n for b in a:\n r = [1]\n for k, v in pr.division(b):\n for c in r[:]:\n for i in range(1, v + 1):\n r.append(c * (k**i))\n for k in r:\n p[k] += 1\n r = 1\n for k, v in p.items():\n if v >= n - 1 and r < k:\n r = k\n return r\n\n\nprint(main())\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nA.sort()\nmin_ptn = A[1]\nfor i in range(min_ptn, 0, -1):\n count = 0\n for a in A:\n if a % i != 0:\n count += 1\n if count > 1:\n break\n if count < 2:\n print(i)\n break\n", "slow_time": 1034266124, "fast_time": 29880947, "speedup": 34.6129, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_1"} +{"pair_id": "python_17865", "problem_id": "p02628", "language": "python", "slow_code": "N, K = list(map(int, input().split()))\nP = list(map(int, input().split()))\n\n\ndef bubblesort(l):\n for index in range(len(l) - 1, 0, -1):\n for low in range(index):\n if l[low] > l[low + 1]:\n tmp = l[low + 1]\n l[low + 1] = l[low]\n l[low] = tmp\n return l\n\n\nbubblesort(P)\nsum = 0\nfor i in range(K):\n sum = sum + P[i]\nprint(sum)\n", "fast_code": "N, K = list(map(int, input().split()))\np = sorted(map(int, input().split()))\nprint((sum(p[0:K])))\n", "slow_time": 41282946, "fast_time": 15650862, "speedup": 2.6377, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_4"} +{"pair_id": "python_16923", "problem_id": "p02804", "language": "python", "slow_code": "P = 10**9 + 7\nN = 100001\ninv = [0] + [1]\nfinv = [1] + [1]\nfac = [1] + [1]\nfor i in range(2, N):\n inv += [inv[P % i] * (P - int(P / i)) % P]\n fac += [(fac[i - 1] * i) % P]\n finv += [(finv[i - 1] * inv[i]) % P]\n\n\ndef comb(a, b):\n if a < b:\n return -1\n return (fac[a] * ((finv[b] * finv[a - b]) % P)) % P\n\n\nn, k = list(map(int, input().split()))\na = list(map(int, input().split()))\na = sorted(a, key=lambda x: x, reverse=False)\nans = 0\n\nfor i in range(len(a)):\n tmp = comb(n - 1 - i, k - 1)\n if tmp < 0:\n continue\n if a[i] < 0:\n ans = (ans + (abs(a[i]) * tmp) % P) % P\n else:\n ans = (ans - (abs(a[i]) * tmp) % P + P) % P\n\nfor i in range(len(a)):\n tmp = comb(n - 1 - i, k - 1)\n if tmp < 0:\n continue\n if a[n - 1 - i] < 0:\n ans = (ans - (abs(a[n - 1 - i]) * tmp) % P + P) % P\n else:\n ans = (ans + (abs(a[n - 1 - i]) * tmp) % P) % P\nprint(ans)\n", "fast_code": "class Combination:\n \"\"\"\"\"\"\n\n def __init__(self, N, MOD=10**9 + 7):\n self.MOD = MOD\n self.fact, self.inv = self._make_factorial_list(N)\n\n def __call__(self, n, k):\n if k < 0 or k > n or n <= 0:\n return 0\n res = self.fact[n] * self.inv[k] % self.MOD\n res = res * self.inv[n - k] % self.MOD\n return res\n\n def _make_factorial_list(self, N):\n fact = [1] * (N + 1)\n inv = [1] * (N + 1)\n MOD = self.MOD\n for i in range(1, N + 1):\n fact[i] = (fact[i - 1] * i) % MOD\n inv[N] = pow(fact[N], MOD - 2, MOD)\n for i in range(N, 0, -1):\n inv[i - 1] = (inv[i] * i) % MOD\n return fact, inv\n\n\nif __name__ == \"__main__\":\n N, K = list(map(int, input().split()))\n A = list(map(int, input().split()))\n mod = 10**9 + 7\n comb = Combination(N, mod)\n ans = 0\n A.sort()\n for i in range(N - K + 1):\n Amax = A[-i - 1]\n Amin = A[i]\n ans += (Amax - Amin) * comb(N - i - 1, K - 1)\n ans %= mod\n print(ans)\n", "slow_time": 44280687267, "fast_time": 98115412, "speedup": 451.3122, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_5"} +{"pair_id": "python_9268", "problem_id": "p02558", "language": "python", "slow_code": "from networkx.utils import UnionFind\n\nN, Q = list(map(int, input().split()))\nuf = UnionFind()\nfor i in range(Q):\n t, u, v = list(map(int, input().split()))\n if t:\n print((1 if uf[u] == uf[v] else 0))\n else:\n uf.union(u, v)\n", "fast_code": "class UnionFind:\n __slots__ = [\"N\", \"root\", \"rank\"]\n\n def __init__(self, N):\n \"\"\"\"\"\"\n self.N = N\n self.root = [-1] * N\n\n def __repr__(self):\n return \"\\n\".join(\"{}: {}\".format(r, self.members(r)) for r in self.roots())\n\n def find(self, x):\n \"\"\"\"\"\"\n while self.root[x] >= 0:\n x = self.root[x]\n return x\n\n def union(self, x, y):\n \"\"\"\"\"\"\n\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n elif self.root[y] < self.root[x]:\n x, y = y, x\n self.root[x] += self.root[y]\n self.root[y] = x\n\n def same(self, x, y):\n \"\"\"\"\"\"\n return self.find(x) == self.find(y)\n\n def count(self, x):\n \"\"\"\"\"\"\n return -self.root[self.find(x)]\n\n def members(self, x):\n \"\"\"\"\"\"\n _root = self.find(x)\n return [i for i in range(self.N) if self.find == _root]\n\n def roots(self):\n \"\"\"\"\"\"\n return [i for i, x in enumerate(self.root) if x < 0]\n\n def group_count(self):\n \"\"\"\"\"\"\n return len(self.roots())\n\n def all_group_members(self):\n \"\"\"\"\"\"\n return {r: self.members(r) for r in self.roots()}\n\n\nimport sys\n\ninput = sys.stdin.readline\nn, q = list(map(int, input().split()))\nuf = UnionFind(n)\nres = []\nfor i in range(q):\n t, u, v = list(map(int, input().split()))\n if t:\n res.append(int(uf.same(u, v)))\n else:\n uf.union(u, v)\nprint((\"\\n\".join(map(str, res))))\n", "slow_time": 18058265902, "fast_time": 151800405, "speedup": 118.9606, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_17"} +{"pair_id": "python_3552", "problem_id": "p03077", "language": "python", "slow_code": "import math\n\nn = int(eval(input()))\na = int(eval(input()))\nb = int(eval(input()))\nc = int(eval(input()))\nd = int(eval(input()))\ne = int(eval(input()))\nk = min(a, min(b, min(c, min(d, e))))\ns = math.ceil(n / k)\nwhile s * k < n:\n s += 1\nprint((5 + s - 1))\n", "fast_code": "n, *a = eval(\"int(input()),\" * 6)\nprint((4 - -n // min(a)))\n", "slow_time": 46839472, "fast_time": 20357921, "speedup": 2.3008, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_24"} +{"pair_id": "python_5687", "problem_id": "p03039", "language": "python", "slow_code": "MAX = 2 * 10**5 + 100\nMOD = 10**9 + 7\nfact = [0] * MAX\ninv = [0] * MAX\nfinv = [0] * MAX\nfact[0] = 1\nfact[1] = 1\nfinv[0] = 1\nfinv[1] = 1\ninv[1] = 1\nfor i in range(2, MAX):\n fact[i] = fact[i - 1] * i % MOD\n inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD\n finv[i] = finv[i - 1] * inv[i] % MOD\n\n\ndef C(n, r):\n if n < r:\n return 0\n if n < 0 or r < 0:\n return 0\n return fact[n] * (finv[r] * finv[n - r] % MOD) % MOD\n\n\nN, M, K = list(map(int, input().split()))\nans = 0\nfor d in range(1, N):\n ans += d * (N - d) * M**2\n ans %= MOD\nfor d in range(1, M):\n ans += d * (M - d) * N**2\n ans %= MOD\nans *= C(N * M - 2, K - 2)\nans %= MOD\nprint(ans)\n", "fast_code": "def comb(n, k):\n x, y = 1, 1\n k = min(k, n - k)\n for i in range(k):\n x *= n - i\n x %= MOD\n y *= i + 1\n y %= MOD\n return x * pow(y, MOD - 2, MOD) % MOD\n\n\ndef modinv(a):\n b = MOD\n x, lastx = (0, 1)\n y, lasty = (1, 0)\n while b != 0:\n q = a // b\n a, b = (b, a % b)\n x, lastx = (lastx - q * x, x)\n y, lasty = (lasty - q * y, y)\n return lastx % MOD\n\n\nMOD = 10**9 + 7\nN, M, K = list(map(int, input().split()))\nx = 0\nfor i in range(1, N):\n x = x + i * (N - i)\nx = (x * M * M) % MOD\ny = 0\nfor j in range(1, M):\n y = y + j * (M - j)\ny = (y * N * N) % MOD\nans = comb(N * M - 2, K - 2) * (x + y) % MOD\nprint(ans)\n", "slow_time": 56558753131, "fast_time": 156817854, "speedup": 360.6653, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_24"} +{"pair_id": "python_7277", "problem_id": "p02881", "language": "python", "slow_code": "n = int(eval(input()))\na = [1, n]\nfor i in range(1, int(n**0.5) + 1):\n j = n // i\n if n % i == 0 and a[0] + a[1] > i + j:\n a = [i, j]\nprint((a[0] - 1 + a[1] - 1))\n", "fast_code": "n = int(eval(input()))\nprint((min(a + (n // a) - 2 for a in range(1, int(n**0.5) + 1) if n % a == 0)))\n", "slow_time": 606509772, "fast_time": 191385250, "speedup": 3.1691, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_6"} +{"pair_id": "python_17493", "problem_id": "p02615", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(1 << 25)\nread = sys.stdin.readline\nra = range\nenu = enumerate\n\n\ndef exit(*argv, **kwarg):\n print(*argv, **kwarg)\n sys.exit()\n\n\ndef mina(*argv, sub=1):\n return list(map(lambda x: x - sub, argv))\n\n\ndef a_int():\n return int(read())\n\n\ndef ints():\n return list(map(int, read().split()))\n\n\ndef read_col(H):\n \"\"\"\"\"\"\n ret = []\n for _ in range(H):\n ret.append(list(map(int, read().split())))\n return tuple(map(list, zip(*ret)))\n\n\ndef read_tuple(H):\n \"\"\"\"\"\"\n ret = []\n for _ in range(H):\n ret.append(tuple(map(int, read().split())))\n return ret\n\n\ndef read_matrix(H):\n \"\"\"\"\"\"\n ret = []\n for _ in range(H):\n ret.append(list(map(int, read().split())))\n return ret\n\n\nMOD = 10**9 + 7\nINF = 2**31\n\nfrom collections import defaultdict, Counter, deque\nfrom operator import itemgetter, xor, add\nfrom itertools import product, permutations, combinations\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce\nfrom math import gcd\n\n\ndef lcm(a, b):\n\n g = gcd(a, b)\n return a // g * b\n\n\nN = a_int()\nA = ints()\nA.sort(reverse=True)\nans = A[0]\ncnt = 1\nfor a in A[1:]:\n if cnt == N - 1:\n break\n ans += a\n cnt += 1\n if cnt == N - 1:\n break\n ans += a\n cnt += 1\nprint(ans)\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nA.sort(reverse=True)\n\nans = A[0]\nfor i in range(2, N):\n ans += A[i // 2]\nprint(ans)\n", "slow_time": 122798898, "fast_time": 22740635, "speedup": 5.4, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_17"} +{"pair_id": "python_2893", "problem_id": "p02559", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom fractions import Fraction\nfrom functools import lru_cache, reduce\nfrom itertools import (\n combinations,\n combinations_with_replacement,\n product,\n permutations,\n accumulate,\n)\nfrom operator import add, mul, sub, itemgetter, attrgetter\nimport sys\n\nreadline = sys.stdin.readline\nINF = 2**62 - 1\n\n\ndef read_int():\n return int(readline())\n\n\ndef read_int_n():\n return list(map(int, readline().split()))\n\n\ndef read_float():\n return float(readline())\n\n\ndef read_float_n():\n return list(map(float, readline().split()))\n\n\ndef read_str():\n return readline().strip()\n\n\ndef read_str_n():\n return readline().strip().split()\n\n\ndef ep(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.perf_counter()\n ret = f(*args, **kwargs)\n e = time.perf_counter()\n ep(e - s, \"sec\")\n return ret\n\n return wrap\n\n\nclass SegmentTree:\n def __init__(self, array, operator, identity_element):\n _len = len(array)\n self.__op = operator\n self.__size = 1 << (_len - 1).bit_length()\n self.__tree = (\n [identity_element] * self.__size\n + array\n + [identity_element] * (self.__size - _len)\n )\n self.__ie = identity_element\n for i in range(self.__size - 1, 0, -1):\n self.__tree[i] = operator(self.__tree[i * 2], self.__tree[i * 2 + 1])\n\n def update(self, i, v):\n i += self.__size\n self.__tree[i] = v\n while i:\n i //= 2\n self.__tree[i] = self.__op(self.__tree[i * 2], self.__tree[i * 2 + 1])\n\n def query(self, l, r):\n \"\"\"\"\"\"\n l += self.__size\n r += self.__size\n ret = self.__ie\n while l < r:\n if l & 1:\n ret = self.__op(ret, self.__tree[l])\n l += 1\n if r & 1:\n r -= 1\n ret = self.__op(ret, self.__tree[r])\n l //= 2\n r //= 2\n return ret\n\n def __getitem__(self, key):\n return self.__tree[key + self.__size]\n\n\n@mt\ndef slv(N, A, Q):\n st = SegmentTree(A, add, 0)\n ans = []\n for q in Q:\n if q[0] == 0:\n _, p, x = q\n st.update(p, st[p] + x)\n else:\n _, l, r = q\n ans.append(st.query(l, r))\n return ans\n\n\ndef main():\n N, Q = read_int_n()\n A = read_int_n()\n Q = [read_int_n() for _ in range(Q)]\n print(*slv(N, A, Q), sep=\"\\n\")\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "def main():\n def f(i, x):\n while i <= n:\n b[i] += x\n i += i & -i\n\n def g(i):\n s = 0\n while i:\n s += b[i]\n i -= i & -i\n return s\n\n (n, q, *w), a, *t = [list(map(int, t.split())) for t in open(0)]\n b = [0] * -~n\n *list(map(f, list(range(1, n + 1)), a)),\n for q, l, r in t:\n if q:\n w += (g(r) - g(l),)\n else:\n f(l + 1, r)\n print((\" \".join(map(str, w))))\n\n\nmain()\n", "slow_time": 205458585, "fast_time": 69937380, "speedup": 2.9378, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_26"} +{"pair_id": "python_349", "problem_id": "p03164", "language": "python", "slow_code": "def main():\n import sys, copy\n\n N, W = list(map(int, sys.stdin.readline().split()))\n L = tuple([tuple(map(int, sys.stdin.readline().split())) for _ in range(N)])\n\n dp = [[10**11 + 1 for _ in range(10**5 + 1)] for _ in range(N)]\n dp[0][L[0][1]] = L[0][0]\n\n for i in range(1, N):\n\n dp[i] = copy.copy(dp[i - 1])\n w, v = L[i][0], L[i][1]\n\n dp[i][v] = min(w, dp[i][v])\n\n for j in range(10**5 + 1 - v):\n if dp[i - 1][j] != 0:\n dp[i][v + j] = min(dp[i][v + j], w + dp[i - 1][j])\n ans = 0\n for v1, w1 in enumerate(dp[-1]):\n if w1 <= W:\n if ans < v1:\n ans = v1\n\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "\"\"\"\"\"\"\n\nINF = 2000000000\nn, W = list(map(int, input().split()))\nw = [0] * n\nv = [0] * n\nfor i in range(n):\n w[i], v[i] = list(map(int, input().split()))\nV = sum(v)\ndp = [[INF for i in range(V + 1)] for j in range(n + 1)]\n\ndp[0][0] = 0\nfor i in range(n):\n for j in range(V + 1):\n if j < v[i]:\n dp[i + 1][j] = dp[i][j]\n else:\n dp[i + 1][j] = min(dp[i][j], dp[i][j - v[i]] + w[i])\nans = 0\nfor i in range(V + 1):\n if dp[n][i] <= W:\n ans = i\nprint(ans)\n", "slow_time": 34612782525, "fast_time": 109898705, "speedup": 314.9517, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_24"} +{"pair_id": "python_13853", "problem_id": "p02929", "language": "python", "slow_code": "import sys\nfrom collections import defaultdict, deque, Counter\nimport math\n\n\nfrom bisect import bisect_left, bisect_right\nimport heapq\n\ninput = sys.stdin.readline\ngetS = lambda: input().strip()\ngetN = lambda: int(eval(input()))\ngetList = lambda: list(map(int, input().split()))\ngetZList = lambda: [int(x) - 1 for x in input().split()]\nINF = 10**20\nMOD = 10**9 + 7\ndivide = lambda x: pow(x, MOD - 2, MOD)\n\n\ndef nck(n, k, kaijyo):\n return (npk(n, k, kaijyo) * divide(kaijyo[k])) % MOD\n\n\ndef npk(n, k, kaijyo):\n if k == 0 or k == n:\n return n % MOD\n return (kaijyo[n] * divide(kaijyo[n - k])) % MOD\n\n\ndef kaijyo(n):\n ret = [1]\n for i in range(1, n + 1):\n ret.append((ret[-1] * i) % MOD)\n return ret\n\n\ndef solve():\n n = getN()\n S = getS()\n rev = 0\n ans = 1\n for c in S:\n if c == \"W\":\n if rev == 0:\n print((0))\n return\n if rev % 2 == 0:\n ans *= rev\n ans %= MOD\n rev -= 1\n else:\n rev += 1\n else:\n if rev % 2 == 1:\n ans *= rev\n ans %= MOD\n rev -= 1\n else:\n rev += 1\n\n if rev == 0:\n print(((ans * kaijyo(n)[-1]) % MOD))\n else:\n print((0))\n\n\ndef main():\n n = getN()\n for _ in range(n):\n solve()\n\n\nif __name__ == \"__main__\":\n\n solve()\n", "fast_code": "n, s = open(0)\nn = int(n)\na = l = s[0] < \"W\" > s[-2]\nr = f = 0\nfor b, c in zip(s, s[1:-1]):\n f ^= b == c\n a = a * (max(1, n)) * (l - r) ** f % (10**9 + 7)\n n -= 1\n r += f\n l += f ^ 1\nprint((a * (l == r)))\n", "slow_time": 124307619, "fast_time": 40082015, "speedup": 3.1013, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_6"} +{"pair_id": "python_6211", "problem_id": "p00040", "language": "python", "slow_code": "dict = [\n \"a\",\n \"b\",\n \"c\",\n \"d\",\n \"e\",\n \"f\",\n \"g\",\n \"h\",\n \"i\",\n \"j\",\n \"k\",\n \"l\",\n \"m\",\n \"n\",\n \"o\",\n \"p\",\n \"q\",\n \"r\",\n \"s\",\n \"t\",\n \"u\",\n \"v\",\n \"w\",\n \"x\",\n \"y\",\n \"z\",\n]\nlsalpha = [1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25]\n\n\ndef decode(alpha, beta, code):\n msg = \"\"\n for chara in code:\n if chara != \" \":\n f = dict.index(chara)\n for i in range(26):\n if (alpha * i + beta) % 26 == f:\n dechara = dict[i]\n break\n msg += dechara\n else:\n msg += \" \"\n return msg\n\n\nn = int(input())\nfor roop in range(n):\n code = input()\n for alpha in lsalpha:\n flag = 0\n for beta in range(26):\n msg = decode(alpha, beta, code)\n if msg.count(\"that\") > 0 or msg.count(\"this\") > 0:\n flag = 1\n break\n if flag == 1:\n break\n print(msg)\n", "fast_code": "A2Z = \"abcdefghijklmnopqrstuvwxyz\"\n\n\ndef affine(msg, a, b):\n s = \"\"\n for c in msg:\n s += A2Z[(A2Z.index(c) * a + b) % 26] if \"a\" <= c <= \"z\" else c\n return s\n\n\ndef rot(msg, a):\n a = a % 26\n L = A2Z[a:] + A2Z[:a]\n s = \"\"\n for c in msg:\n s += L[A2Z.index(c)] if \"a\" <= c <= \"z\" else c\n return s\n\n\ndef checkkey(s):\n c0 = \"t\"\n for i in range(26):\n a = 0\n x = affine(s, i, 0)\n c = A2Z.index(x[0])\n if c != 19:\n a = (19 - c) % 26\n x = rot(x, a)\n if x in [\"this\", \"that\"]:\n return i, a\n return -1, -1\n\n\nn = eval(input())\nwhile n:\n n -= 1\n s = input()\n for w in s.split():\n if len(w) == 4:\n a, b = checkkey(w)\n if a != -1:\n break\n print(affine(s, a, b))\n", "slow_time": 2828867283, "fast_time": 96575987, "speedup": 29.2916, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_1"} +{"pair_id": "python_6586", "problem_id": "p02364", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys\nfrom operator import attrgetter\n\n\nclass Edge(object):\n __slots__ = (\"source\", \"target\", \"weight\")\n\n def __init__(self):\n self.weight = float(\"inf\")\n self.source, self.target = None, None\n\n\nclass UnionFind(object):\n __slots__ = (\"size\", \"tree_height_rank_list\", \"ancestor_list\")\n\n def __init__(self, size):\n self.size = int(size)\n self.tree_height_rank_list = [0] * self.size\n self.ancestor_list = [i for i in range(self.size)]\n\n def _find(self, x):\n if x != self.ancestor_list[x]:\n self.ancestor_list[x] = self._find(self.ancestor_list[x])\n return self.ancestor_list[x]\n\n def same(self, x, y):\n return self._find(x) == self._find(y)\n\n def _link(self, x, y):\n if self.tree_height_rank_list[x] > self.tree_height_rank_list[y]:\n self.ancestor_list[y] = x\n else:\n self.ancestor_list[x] = y\n if self.tree_height_rank_list[x] == self.tree_height_rank_list[y]:\n self.tree_height_rank_list[y] += 1\n\n def union(self, x, y):\n self._link(self._find(x), self._find(y))\n\n\ndef generate_edge_table(v_table):\n for index, each in enumerate(v_table):\n source, target, weight = list(map(int, each))\n init_edge_table[index].source = source\n init_edge_table[index].target = target\n init_edge_table[index].weight = weight\n return init_edge_table\n\n\ndef graph_Kruskal():\n total_cost = 0\n edge_table.sort(key=attrgetter(\"weight\"))\n\n union_find_case = UnionFind(size=vertices + 1)\n for edge in edge_table:\n if not union_find_case.same(edge.source, edge.target):\n total_cost += edge.weight\n union_find_case.union(edge.source, edge.target)\n return total_cost\n\n\nif __name__ == \"__main__\":\n _input = sys.stdin.readlines()\n vertices, edges = list(map(int, _input[0].split()))\n v_info = [x.split() for x in _input[1:]]\n init_edge_table = [Edge() for _ in range(edges)]\n edge_table = generate_edge_table(v_info)\n print((graph_Kruskal()))\n", "fast_code": "import heapq\nfrom collections import defaultdict\n\nINF = float(\"inf\")\nV, E = list(map(int, input().split()))\nAdj_list = defaultdict(set)\nfor i in range(E):\n s, t, w = list(map(int, input().split()))\n Adj_list[s].add((t, w))\n Adj_list[t].add((s, w))\n\n\ndef prim(x):\n d = [INF] * x\n d[0] = 0\n isVisited = [False] * x\n hq = [(0, 0)]\n while hq:\n u = heapq.heappop(hq)[1]\n isVisited[u] = True\n for v, c in Adj_list[u]:\n if not isVisited[v] and d[v] > c:\n d[v] = c\n heapq.heappush(hq, (c, v))\n return sum(d)\n\n\nprint((prim(V)))\n", "slow_time": 114703884, "fast_time": 47581029, "speedup": 2.4107, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_5"} +{"pair_id": "python_5935", "problem_id": "p03693", "language": "python", "slow_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n return list(sys.stdin.readline())[:-1]\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef solve():\n r, g, b = LI()\n ans = [\"YES\", \"NO\"]\n print((ans[((g << 1) + b) & 3 > 0]))\n return\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "import sys\n\nr, g, b = sys.stdin.readline().split()\n\n\ndef main():\n return \"NO\" if int(g + b) % 4 else \"YES\"\n\n\nif __name__ == \"__main__\":\n ans = main()\n print(ans)\n", "slow_time": 89960780, "fast_time": 18071941, "speedup": 4.9779, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_20"} +{"pair_id": "python_4450", "problem_id": "p03136", "language": "python", "slow_code": "import sys\n\ns2nn = lambda s: [int(c) for c in s.split(\" \")]\nss2nn = lambda ss: [int(s) for s in ss]\nss2nnn = lambda ss: [s2nn(s) for s in ss]\ni2s = lambda: sys.stdin.readline().rstrip()\ni2n = lambda: int(i2s())\ni2nn = lambda: s2nn(i2s())\nii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]\nii2nn = lambda n: ss2nn(ii2ss(n))\nii2nnn = lambda n: ss2nnn(ii2ss(n))\n\n\ndef main():\n N = i2n()\n L = i2nn()\n L.sort()\n l1 = sum(L[:-1])\n l2 = L[-1]\n if l1 > l2:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nmain()\n", "fast_code": "N = int(eval(input()))\nL = [int(i) for i in input().split()]\nif 2 * max(L) - sum(L) < 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 75579739, "fast_time": 22097682, "speedup": 3.4203, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_23"} +{"pair_id": "python_8596", "problem_id": "p03338", "language": "python", "slow_code": "import collections, sys\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\nN = I()\nS = S()\nans = 0\nfor i in range(N):\n set_top = set()\n set_bottom = set()\n for s in collections.Counter(S[:i]):\n set_top.add(s)\n for s in collections.Counter(S[i:]):\n set_bottom.add(s)\n ans = max(ans, len(set_top & set_bottom))\nprint(ans)\n", "fast_code": "import sys\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\nN = I()\nS = S()\nans = 0\nfor i in range(N):\n ans = max(ans, len(set(S[:i]) & set(S[i:])))\nprint(ans)\n", "slow_time": 101999671, "fast_time": 38919019, "speedup": 2.6208, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_20"} +{"pair_id": "python_14646", "problem_id": "p03649", "language": "python", "slow_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\n\n\ndef is_possible(C):\n res = 0\n for x in A:\n if x + C - N >= 0:\n res += (x + C - N) // (N + 1) + 1\n\n return int(res <= C)\n\n\nl = 0\nr = 10**30\nis_possible(1234567894848)\nwhile r - l > 1:\n M = (l + r) // 2\n if is_possible(M) > 0:\n r = M\n else:\n l = M\nfor i in range(10**5, -1, -1):\n if is_possible(r - i):\n print((r - i))\n break\n", "fast_code": "n = int(eval(input()))\na = list(map(int, input().split()))\na.sort()\nans = 0\nwhile a[-1] >= n:\n k = -(-(a[-1] + 1) // n) - 1\n ans += k\n for i in range(n - 1):\n a[i] += k\n a[-1] -= n * k\n a.sort()\nprint(ans)\n", "slow_time": 100457990677, "fast_time": 631870484, "speedup": 158.9851, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_2"} +{"pair_id": "python_18047", "problem_id": "p03476", "language": "python", "slow_code": "import math\n\n\ndef is_prime(n):\n if n == 1:\n return False\n for k in range(2, int(math.sqrt(n)) + 1):\n if n % k == 0:\n return False\n return True\n\n\nQ = int(eval(input()))\ncnt = [0] * (10**5 + 1)\nfor i in range(1, 10**5 + 1):\n if i % 2 == 0:\n cnt[i] = cnt[i - 1]\n continue\n if is_prime(i) and is_prime((i + 1) // 2):\n cnt[i] = cnt[i - 1] + 1\n else:\n cnt[i] = cnt[i - 1]\nfor _ in range(Q):\n l, r = list(map(int, input().split()))\n print((cnt[r] - cnt[l - 1]))\n", "fast_code": "import sys\nfrom itertools import accumulate\n\nreadline = sys.stdin.readline\nread = sys.stdin.read\n\n\ndef main():\n q, *lr = list(map(int, read().split()))\n n = 10**5\n ansl = []\n sieve = [1] * (n + 1)\n sieve[0], sieve[1] = 0, 0\n for i in range(2, n):\n if sieve[i]:\n sieve[2 * i :: i] = [0 for _ in range(2 * i, n + 1, i)]\n ans = [0] * (n + 1)\n for i in range(3, n):\n if sieve[i] == 1 and sieve[(i + 1) // 2] == 1:\n\n ans[i] = ans[i - 1] + 1\n else:\n ans[i] = ans[i - 1]\n\n for l, r in zip(*[iter(lr)] * 2):\n print((ans[r] - ans[l - 1]))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 64142625764, "fast_time": 9979165437, "speedup": 6.4277, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_22"} +{"pair_id": "python_7112", "problem_id": "p02689", "language": "python", "slow_code": "import sys\n\n\ndef solve(N: int, M: int, H: \"List[int]\", A: \"List[int]\", B: \"List[int]\"):\n l = [[] for i in range(N)]\n for i in range(M):\n l[A[i] - 1].append(B[i])\n l[B[i] - 1].append(A[i])\n nl = [list(set(x)) for x in l]\n cnt = 0\n for i, v in enumerate(nl):\n h = [H[j - 1] for j in v]\n if not h or H[i] > max(h):\n cnt += 1\n print(cnt)\n return\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n\n tokens = iterate_tokens()\n N = int(next(tokens))\n M = int(next(tokens))\n H = [int(next(tokens)) for _ in range(N)]\n A = [int()] * (M)\n B = [int()] * (M)\n for i in range(M):\n A[i] = int(next(tokens))\n B[i] = int(next(tokens))\n solve(N, M, H, A, B)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "n, m = list(map(int, input().split()))\nh = list(map(int, input().split()))\nr = []\nt = [\"W\"] * n\nfor i in range(m):\n a, b = list(map(int, input().split()))\n if h[a - 1] >= h[b - 1]:\n t[b - 1] = \"L\"\n if h[a - 1] <= h[b - 1]:\n t[a - 1] = \"L\"\nprint((t.count(\"W\")))\n", "slow_time": 92480184, "fast_time": 33800587, "speedup": 2.7361, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_9"} +{"pair_id": "python_1781", "problem_id": "p03608", "language": "python", "slow_code": "N, M, NR = list(map(int, input().split()))\nR = list([int(x) - 1 for x in input().split()])\nimport numpy as np\nfrom scipy.sparse.csgraph import floyd_warshall\n\nG = np.zeros((N, N))\nfor _ in range(M):\n a, b, c = list(map(int, input().split()))\n G[a - 1, b - 1] = c\nfloyd_warshall(G, directed=False, overwrite=True)\n\n\ndef it2():\n from itertools import permutations\n\n for p in permutations(R):\n pp = iter(p)\n next(pp)\n yield sum(G[a, b] for a, b in zip(p, pp))\n\n\nprint((int(min(it2()))))\n", "fast_code": "from heapq import heapify, heappop, heappush\nfrom itertools import permutations\n\n\ndef dijkstra(G: \"Array[Array[int]]\", size: int, start: int) -> list:\n dist = [float(\"inf\")] * size\n queue = [(0, start)]\n unchecked = size - 1\n heapify(queue)\n while queue:\n cost, v = heappop(queue)\n if cost > dist[v]:\n continue\n dist[v] = cost\n for next_cost, u in G[v]:\n if cost + next_cost < dist[u]:\n heappush(queue, (cost + next_cost, u))\n unchecked -= 1\n if not unchecked:\n break\n return dist\n\n\ndef main():\n global G, N\n N, M, R, *RABC = list(map(int, open(0).read().split()))\n visit, ABC = RABC[:R], RABC[R:]\n G = [[] for _ in range(N + 1)]\n for v, u, cost in zip(*[iter(ABC)] * 3):\n G[v].append((cost, u)), G[u].append((cost, v))\n dist = {v: dijkstra(G, N + 1, v) for v in visit}\n ans = float(\"inf\")\n for perm in permutations(visit):\n cur = sum(dist[v][u] for v, u in zip(perm, perm[1:]))\n ans = min(ans, cur)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 16546352342, "fast_time": 79257828, "speedup": 208.7662, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_4"} +{"pair_id": "python_14132", "problem_id": "p02741", "language": "python", "slow_code": "def solve():\n print(\n (\n [\n 1,\n 1,\n 1,\n 2,\n 1,\n 2,\n 1,\n 5,\n 2,\n 2,\n 1,\n 5,\n 1,\n 2,\n 1,\n 14,\n 1,\n 5,\n 1,\n 5,\n 2,\n 2,\n 1,\n 15,\n 2,\n 2,\n 5,\n 4,\n 1,\n 4,\n 1,\n 51,\n ][int(eval(input())) - 1]\n )\n )\n return 0\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "k = int(eval(input()))\ns = \"1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51\"\nl = s.split(\",\")\nprint((int(l[k - 1])))\n", "slow_time": 18088788, "fast_time": 8476631, "speedup": 2.134, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_12"} +{"pair_id": "python_6716", "problem_id": "p00053", "language": "python", "slow_code": "s = [0]\nM = 10**6\np = [1] * M\nS = 0\nfor i in range(2, M):\n if p[i]:\n for j in range(i * i, M, i):\n p[j] = 0\n S += i\n s.append(S)\nwhile 1:\n n = eval(input())\n if n == 0:\n break\n print(s[n])\n", "fast_code": "import math\n\nr = 105000\nsqrt = int(math.sqrt(r))\np = [1] * r\np[0] = 0\nfor i in range(1, sqrt):\n if p[i]:\n for j in range(2 * i + 1, r, i + 1):\n p[j] = 0\nprime = [0 for i in range(11000)]\nj = 0\nfor i in range(len(p)):\n if p[i]:\n prime[j] = i + 1\n j += 1\nwhile True:\n n = int(input())\n if not n:\n break\n print(sum(prime[:n]))\n", "slow_time": 126327816139, "fast_time": 12853613312, "speedup": 9.8282, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_3"} +{"pair_id": "python_8599", "problem_id": "p02848", "language": "python", "slow_code": "import sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import (\n ceil,\n sqrt,\n hypot,\n factorial,\n pi,\n sin,\n cos,\n tan,\n asin,\n acos,\n atan,\n radians,\n degrees,\n log2,\n)\nfrom itertools import (\n accumulate,\n permutations,\n combinations,\n combinations_with_replacement,\n product,\n groupby,\n)\nfrom operator import itemgetter, mul\nfrom copy import deepcopy\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom bisect import bisect, bisect_left\nfrom heapq import heappush, heappop\nfrom functools import reduce\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef INT():\n return int(input())\n\n\ndef MAP():\n return map(int, input().split())\n\n\ndef LIST():\n return list(map(int, input().split()))\n\n\ndef ZIP(n):\n return zip(*(MAP() for _ in range(n)))\n\n\nimport numpy as np\n\nsys.setrecursionlimit(10**9)\nINF = float(\"inf\")\nmod = 10**9 + 7\nN = INT()\nS = input()\nA = [chr(65 + (ord(S[i]) - 65 + N) % 26) for i in range(len(S))]\nprint(*A, sep=\"\")\n", "fast_code": "s = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nn = int(input())\nx = input()\na = ord(\"A\")\nprint(\"\".join([s[(ord(c) - a + n) % 26] for c in x]))\n", "slow_time": 87110553, "fast_time": 19283145, "speedup": 4.5174, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_2"} +{"pair_id": "python_2248", "problem_id": "p03281", "language": "python", "slow_code": "n = int(eval(input()))\nl = []\ncount = 0\nfor h in range(n):\n for i in range(h + 1):\n if (h + 1) % (i + 1) == 0 and (h + 1) % 2 != 0:\n l.append(h + 1)\n if len(l) == 8:\n count += 1\n if len(l) != 8:\n l.clear()\nprint(count)\n", "fast_code": "n = int(eval(input()))\nans = 0\nfor i in range(1, n + 1, 2):\n cnt = 0\n for j in range(1, n + 1, 2):\n if j > i:\n break\n if i % j == 0:\n cnt += 1\n if cnt == 8:\n ans += 1\nprint(ans)\n", "slow_time": 118569525, "fast_time": 50752450, "speedup": 2.3362, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_15"} +{"pair_id": "python_15009", "problem_id": "p03212", "language": "python", "slow_code": "def DFS(n):\n if len(n) >= 3 and len(set(list(n)) & {\"3\", \"5\", \"7\"}) == 3:\n A.append(int(n))\n if len(n) < 10:\n for i in (\"3\", \"5\", \"7\"):\n DFS(n + i)\n\n\nn = int(eval(input()))\nA = []\nfor i in (\"3\", \"5\", \"7\"):\n DFS(i)\nA.sort()\ncnt = 0\nwhile 1:\n if A[cnt] <= n:\n cnt += 1\n else:\n break\nprint(cnt)\n", "fast_code": "n = int(eval(input()))\n\n\ndef dfs(val, A):\n if val > n:\n return\n A.append(val)\n dfs(10 * val + 3, A)\n dfs(10 * val + 5, A)\n dfs(10 * val + 7, A)\n\n\nA = []\ndfs(3, A)\ndfs(5, A)\ndfs(7, A)\ncnt = 0\nfor v in A:\n if len(set(list(str(v)))) == 3:\n cnt += 1\nprint(cnt)\n", "slow_time": 31175985341, "fast_time": 2090473783, "speedup": 14.9134, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_1"} +{"pair_id": "python_1803", "problem_id": "p02821", "language": "python", "slow_code": "N, M = list(map(int, input().split()))\nA = list(map(int, input().split()))\nA.sort(reverse=True)\nLB = A[-1] * 2\nUB = A[0] * 2\n\ncgs = [0] * (UB + 1)\nfor a in A:\n cgs[a] += 1\nfor i in range(UB, 0, -1):\n cgs[i - 1] += cgs[i]\n\n\ndef is_ok(n):\n m = 0\n for a in A:\n m += cgs[max(n - a, 0)]\n return m >= M\n\n\nok = LB\nng = UB + 1\nwhile ng - ok > 1:\n m = (ok + ng) // 2\n if is_ok(m):\n ok = m\n else:\n ng = m\n\ncps = A[:]\nfor i in range(1, N):\n cps[i] += cps[i - 1]\nresult = 0\nfor a in A:\n t = cgs[max(ok - a, 0)]\n if t != 0:\n result += a * t + cps[t - 1]\n M -= t\nresult += ok * M\nprint(result)\n", "fast_code": "import numpy as np\nimport sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n N, M = list(map(int, input().split()))\n A = np.array(sorted([int(i) for i in input().split()]))\n left = 0\n right = A[-1] * 2 + 5\n while right - left > 1:\n x = (left + right) // 2\n count = N**2 - np.searchsorted(A, x - A).sum()\n if count >= M:\n left = x\n else:\n right = x\n bound = np.searchsorted(A, left - A)\n count = N**2 - bound.sum()\n diff = count - M\n ans = ((N - bound) * A * 2).sum() - diff * left\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 295175780, "fast_time": 50593692, "speedup": 5.8342, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_14"} +{"pair_id": "python_16355", "problem_id": "p03309", "language": "python", "slow_code": "import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef list4d(a, b, c, d, e):\n return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST(N=None):\n return list(MAP()) if N is None else [INT() for i in range(N)]\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\nN = INT()\nA = LIST()\n\n\ndef check(m):\n sm = 0\n for i, a in enumerate(A):\n sm += abs(a - (m + i + 1))\n return sm\n\n\nlow = -(10**9)\nhi = 10**9\nwhile low + 2 < hi:\n m1 = (low * 2 + hi) // 3\n m2 = (low + hi * 2) // 3\n res1 = check(m1)\n res2 = check(m2)\n\n if res1 <= res2:\n hi = m2\n else:\n low = m1\nprint((min(check(m1), check(m2))))\n", "fast_code": "def calc_sadness(b):\n ans = 0\n for a in A:\n ans += abs(a - b)\n return ans\n\n\nN = int(eval(input()))\nA = []\nfor idx, a in enumerate(map(int, input().split())):\n A.append(a - idx - 1)\nA.sort()\nif N % 2 == 0:\n b = [A[N // 2]]\nelse:\n b = [A[N // 2 - 1], A[N // 2]]\nprint((min(list(map(calc_sadness, b)))))\n", "slow_time": 198949924, "fast_time": 40546462, "speedup": 4.9067, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_5"} +{"pair_id": "python_3065", "problem_id": "p02724", "language": "python", "slow_code": "s = int(eval(input()))\ncount1 = -1\ncount2 = -1\nwhile s >= 0:\n s = s - 500\n count1 = count1 + 1\ns = s + 500\nif s == 0:\n yasashisa = count1 * 1000\n print(yasashisa)\nelse:\n while s >= 0:\n s = s - 5\n count2 = count2 + 1\n yasashisa = count1 * 1000 + count2 * 5\n print(yasashisa)\n", "fast_code": "X = int(eval(input()))\nprint(((X // 500) * 1000 + (X % 500) // 5 * 5))\n", "slow_time": 2799708692, "fast_time": 10495253, "speedup": 266.7595, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_13"} +{"pair_id": "python_1029", "problem_id": "p03329", "language": "python", "slow_code": "from bisect import bisect_right\n\nn = int(eval(input()))\nMX = 100010\ndp = [float(\"inf\") for _ in range(MX)]\ndp[0] = 0\npow_6, pow_9 = [6], [9]\nwhile True:\n flg = False\n if pow_6[-1] * 6 <= MX:\n pow_6.append(pow_6[-1] * 6)\n flg = True\n if pow_9[-1] * 9 <= MX:\n pow_9.append(pow_9[-1] * 9)\n flg = True\n if flg == False:\n break\nfor i in range(1, MX):\n tmp = [1]\n if i >= 6:\n x = bisect_right(pow_6, i)\n tmp.append(pow_6[x - 1])\n if i >= 9:\n y = bisect_right(pow_9, i)\n tmp.append(pow_9[y - 1])\n for t in tmp:\n dp[i] = min(dp[i], dp[i - t] + 1)\nprint((dp[n]))\n", "fast_code": "def main():\n N = int(eval(input()))\n cand = [1]\n dp = [float(\"inf\")] * (N + 5)\n tmp = 6\n cnt = 1\n while tmp**cnt <= N:\n cand.append(tmp**cnt)\n cnt += 1\n tmp = 9\n cnt = 1\n while tmp**cnt <= N:\n cand.append(tmp**cnt)\n cnt += 1\n cand.sort()\n dp[0] = 0\n for i in range(N + 1):\n for c in cand:\n if i + c <= N:\n dp[i + c] = min(dp[i + c], dp[i] + 1)\n print((dp[N]))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 45292776361, "fast_time": 181974205, "speedup": 248.8967, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_26"} +{"pair_id": "python_16609", "problem_id": "p03147", "language": "python", "slow_code": "import numpy as np\n\nn = int(eval(input()))\nh = np.array([0] + list(map(int, input().split())))\nr = 0\nwhile np.any(h > 0):\n r += np.sum(np.logical_and(h[1:] > 0, h[:-1] <= 0))\n h -= 1\nprint(r)\n", "fast_code": "N = int(eval(input()))\nh = list(map(int, input().split()))\ns = h[0]\nfor i in range(1, N):\n s += max(0, h[i] - h[i - 1])\nprint(s)\n", "slow_time": 360471067, "fast_time": 22446470, "speedup": 16.0591, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_18"} +{"pair_id": "python_14564", "problem_id": "p00150", "language": "python", "slow_code": "MAX = 10001\nSQRT = 100\nprime = [True for i in range(MAX)]\n\n\ndef sieve():\n for i in range(4, MAX, 2):\n prime[i] = False\n for i in range(3, SQRT, 2):\n if prime[i] is True:\n for j in range(i * i, MAX, i):\n prime[j] = False\n\n\nsieve()\ntbl = [0] * MAX\nans = 0\nfor i in range(5, MAX, 2):\n if prime[i] and prime[i - 2]:\n ans = i\n tbl[i] = ans\nwhile True:\n n = int(eval(input()))\n if n == 0:\n break\n if (n & 1) == 0:\n n -= 1\n print((tbl[n] - 2, tbl[n]))\n", "fast_code": "import bisect as bs\n\n\ndef prime(m):\n N = list(range(1, m + 1, 2))\n N[0] = 2\n for i in range(1, int(m**0.5) + 1):\n x = N[i]\n if x:\n N[i + x :: x] = [0] * len(N[i + x :: x])\n return [_f for _f in N if _f]\n\n\nP = prime(10000)\nx = [P[i] for i in range(1, len(P)) if P[i] - P[i - 1] == 2]\nwhile 1:\n n = eval(input())\n if n == 0:\n break\n a = x[bs.bisect_right(x, n) - 1]\n print(a - 2, a)\n", "slow_time": 475453396, "fast_time": 128294719, "speedup": 3.7059, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_3"} +{"pair_id": "python_9025", "problem_id": "p03837", "language": "python", "slow_code": "import os\nimport sys\nimport numpy as np\nfrom scipy.sparse.csgraph import csgraph_from_dense, dijkstra\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nIINF = 10**18\nN, M = list(map(int, sys.stdin.readline().split()))\nABC = [list(map(int, sys.stdin.readline().split())) for _ in range(M)]\nD = np.zeros((N, N))\nfor a, b, c in ABC:\n D[a - 1][b - 1] = c\nmin_dist = dijkstra(csgraph_from_dense(D), directed=False)\nprint(((min_dist < D).sum()))\n", "fast_code": "INFTY = 10**5 + 10\nN, M = list(map(int, input().split()))\nL = [list(map(int, input().split())) for _ in range(M)]\nG = {i: [] for i in range(1, N + 1)}\ndist = [[INFTY for _ in range(N + 1)] for _ in range(N + 1)]\nfor j in range(M):\n a, b, c = L[j]\n G[a].append(b)\n G[b].append(a)\n dist[a][b] = c\n dist[b][a] = c\nfor k in range(1, N + 1):\n for i in range(1, N + 1):\n for j in range(1, N + 1):\n dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])\ncnt = 0\nfor j in range(M):\n a, b, c = L[j]\n if dist[a][b] < c:\n cnt += 1\nprint(cnt)\n", "slow_time": 14555060473, "fast_time": 49666937, "speedup": 293.0533, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_8"} +{"pair_id": "python_10580", "problem_id": "p02982", "language": "python", "slow_code": "from numpy import *\n\nn, *x = [int32(t.split()) for t in open(0)]\nprint((sum(j == int(j) for i in x for j in map(linalg.norm, i - x)) - n[0] >> 1))\n", "fast_code": "N, D = list(map(int, input().split()))\nX = [list(map(int, input().split())) for _ in range(N)]\n\n\ndef nasu(x, y):\n t = 0\n for i in range(D):\n t += (X[x][i] - X[y][i]) ** 2\n t **= 1 / 2\n if t == int(t):\n return 1\n else:\n return 0\n\n\nans = 0\nfor i in range(N - 1):\n for j in range(i + 1, N):\n ans += nasu(i, j)\nprint(ans)\n", "slow_time": 7103541835, "fast_time": 32469045, "speedup": 218.7789, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_4"} +{"pair_id": "python_6253", "problem_id": "p00022", "language": "python", "slow_code": "n = eval(input())\nwhile n:\n R = [eval(input()) for i in range(n)]\n x = R\n s = max(x)\n while n - 1:\n R = R[1:]\n x = [a + b for a, b in zip(x[:-1], R)]\n s = max(s, max(x))\n n -= 1\n print(s)\n n = eval(input())\n", "fast_code": "while 1:\n n = eval(input())\n if n == 0:\n break\n r = [int(input()) for i in range(n)]\n for i in range(1, n):\n r[i] = max(r[i - 1] + r[i], r[i])\n print(max(r))\n", "slow_time": 95884060, "fast_time": 40663914, "speedup": 2.358, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_7"} +{"pair_id": "python_10956", "problem_id": "p02389", "language": "python", "slow_code": "import sys\nfrom functools import reduce\n\nfor line in sys.stdin:\n nums = list([int(x) for x in line.split()])\n menseki = reduce(lambda x, y: x * y, nums)\n syuu = reduce(lambda x, y: x + y, nums) * 2\n print((str(menseki) + \" \" + str(syuu)))\n", "fast_code": "a, b = list(map(int, input().split()))\narea = a * b\nperimeter = 2 * (a + b)\nprint((area, perimeter))\n", "slow_time": 28665851, "fast_time": 13169340, "speedup": 2.1767, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_14"} +{"pair_id": "python_14087", "problem_id": "p02244", "language": "python", "slow_code": "from functools import lru_cache\n\ncc = [[\".\" for i in range(8)] for j in range(8)]\n\n\ndef check(cc, a, b):\n ss = list(zip(*cc))\n if \"Q\" in cc[a]:\n return False\n if \"Q\" in ss[b]:\n return False\n d = []\n for i in range(8):\n for j in range(8):\n try:\n if j + (a - i) == b:\n d.append(cc[i][j])\n if j - (a - i) == b:\n d.append(cc[i][j])\n if j + (i - a) == b:\n d.append(cc[i][j])\n if j - (i - a) == b:\n d.append(cc[i][j])\n except IndexError:\n continue\n if \"Q\" in d:\n return False\n return True\n\n\ndef chess(s, queen):\n if queen == 8:\n return s\n for i in range(8):\n for j in range(8):\n if check(s, i, j):\n sol = s\n sol[i][j] = \"Q\"\n if chess(sol, queen + 1) != [[]]:\n return sol\n else:\n sol[i][j] = \".\"\n return [[]]\n\n\nk = int(eval(input()))\nfor i in range(k):\n a, b = input().split()\n cc[int(a)][int(b)] = \"Q\"\nans = chess(cc, k)\nprint((\"\\n\".join(list([\"\".join(x) for x in ans]))))\n", "fast_code": "from sys import stdin\nfrom itertools import permutations as per\n\n\ndef check(queen):\n for r1, c1 in queen:\n if not all(\n (r1 == r2 and c1 == c2) or (r1 + c1 != r2 + c2 and r1 - c1 != r2 - c2)\n for r2, c2 in queen\n ):\n return False\n return True\n\n\nk = int(stdin.readline())\nR, C = [[i for i in range(8)] for _ in range(2)]\nq = []\nfor _ in range(k):\n r, c = list(map(int, stdin.readline().split()))\n q.append((r, c))\n R.remove(r)\n C.remove(c)\nfor l in per(C):\n q_tmp = q[:] + [(r, c) for r, c in zip(R, l)]\n if check(q_tmp):\n for i, j in sorted(q_tmp):\n print((\".\" * j + \"Q\" + \".\" * (8 - j - 1)))\n break\n", "slow_time": 35812672713, "fast_time": 419773437, "speedup": 85.3143, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_1"} +{"pair_id": "python_5435", "problem_id": "p03288", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**9)\nINF = 10**18\nMOD = 10**9 + 7\ninput = lambda: sys.stdin.readline().rstrip()\nYesNo = lambda b: bool([print(\"Yes\")] if b else print(\"No\"))\nYESNO = lambda b: bool([print(\"YES\")] if b else print(\"NO\"))\nint1 = lambda x: int(x) - 1\nR = int(input())\nif R >= 2800:\n print(\"AGC\")\nelif R >= 1200:\n print(\"ARC\")\nelse:\n print(\"ABC\")\n", "fast_code": "print((\"A\" + \"BRG\"[(int(eval(input())) + 400) // 1600] + \"C\"))\n", "slow_time": 41475856, "fast_time": 10479567, "speedup": 3.9578, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_5"} +{"pair_id": "python_17968", "problem_id": "p03476", "language": "python", "slow_code": "import bisect\n\na = [True] * 100001\na[0] = False\na[1] = False\np = []\nfor i in range(2, 100001):\n if a[i]:\n for j in range(i * 2, 100001, i):\n a[j] = False\n if i % 2 != 0 and a[(i + 1) // 2]:\n p.append(i)\nq = int(eval(input()))\nfor i in range(q):\n l, r = list(map(int, input().split()))\n print((bisect.bisect_right(p, r) - bisect.bisect_left(p, l)))\n", "fast_code": "import math\nfrom itertools import accumulate\n\n\ndef is_prime(n):\n if n == 1:\n return 0\n for k in range(2, int(math.sqrt(n)) + 1):\n if n % k == 0:\n return 0\n return 1\n\n\nQ = int(eval(input()))\nL = [0] * Q\nR = [0] * Q\nfor i in range(Q):\n L[i], R[i] = list(map(int, input().split()))\nmin_L = min(L)\nmax_R = max(R)\ncheck = []\nfor i in range(min_L, max_R + 1):\n if i % 2 == 1:\n flg = is_prime(i) and is_prime((i + 1) / 2)\n else:\n flg = 0\n check.append(flg)\n\ncheck = [0] + check\ncheck = list(accumulate(check))\nfor i in range(Q):\n print((check[R[i] - min_L + 1] - check[L[i] - min_L]))\n", "slow_time": 15667270276, "fast_time": 333117450, "speedup": 47.0323, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_18"} +{"pair_id": "python_4827", "problem_id": "p04015", "language": "python", "slow_code": "def main():\n N, A = tuple(map(int, input().split()))\n X = tuple(map(int, input().split()))\n\n dp = [[[0] * (N * 50 + 1) for _ in range(N + 1)] for _ in range(N + 1)]\n dp[0][0][0] = 1\n for i in range(N):\n for j in range(N):\n for k in range(N * 50 + 1):\n if dp[i][j][k]:\n dp[i + 1][j][k] += dp[i][j][k]\n dp[i + 1][j + 1][k + X[i]] += dp[i][j][k]\n ans = sum(dp[N][i][i * A] for i in range(1, N + 1))\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "def main():\n N, A = list(map(int, input().split()))\n x = list(map(int, input().split()))\n x.insert(0, 0)\n dp = [[[0 for _ in range(N * A + 1)] for _ in range(N + 1)] for _ in range(N + 1)]\n for i in range(N + 1):\n dp[i][0][0] = 1\n for i in range(1, N + 1):\n for j in range(1, i + 1):\n for k in range(1, N * A + 1):\n dp[i][j][k] = dp[i - 1][j][k]\n if k >= x[i]:\n dp[i][j][k] += dp[i - 1][j - 1][k - x[i]]\n ans = 0\n for j in range(1, N + 1):\n ans += dp[N][j][A * j]\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 8149055426, "fast_time": 1196690512, "speedup": 6.8097, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_8"} +{"pair_id": "python_16583", "problem_id": "p02845", "language": "python", "slow_code": "_, a = open(0)\nc = 1\nd = [3] + [0] * 10**6\nfor a in map(int, a.split()):\n c = c * d[a] % (10**9 + 7)\n d[a] -= 1\n d[a + 1] += 1\nprint(c)\n", "fast_code": "import itertools\nimport sys\nfrom collections import Counter\n\nsys.setrecursionlimit(10**9)\nM = 1000000007\nN = int(sys.stdin.readline())\nleft = list(map(int, sys.stdin.read().split()))\ncounter = Counter(left)\n\n\ndef dp(t, ns):\n cached = t.get(ns)\n if cached is not None:\n return cached\n remaining = sum(ns)\n assert remaining > 0\n last_cnt = left[remaining - 1] + 1\n n1, n2, n3 = ns\n res = 0\n if last_cnt == n1:\n res += dp(t, tuple(sorted([n1 - 1, n2, n3])))\n res %= M\n if last_cnt == n2:\n res += dp(t, tuple(sorted([n1, n2 - 1, n3])))\n res %= M\n if last_cnt == n3:\n res += dp(t, tuple(sorted([n1, n2, n3 - 1])))\n res %= M\n\n t[ns] = res\n return res\n\n\ndef solve():\n h = [0, 0, 0]\n for i in range(N):\n k = counter[i]\n if k == 3:\n h[0] = h[1] = h[2] = i + 1\n elif k == 2:\n h[0] = h[1] = i + 1\n elif k == 1:\n h[0] = i + 1\n else:\n break\n if sum(h) != N:\n return 0\n t = dict()\n t[0, 0, 0] = 1\n res = dp(t, tuple(sorted(h)))\n return (res * len(set(itertools.permutations(h)))) % M\n\n\nprint((solve()))\n", "slow_time": 815333677, "fast_time": 102769915, "speedup": 7.9336, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_21"} +{"pair_id": "python_6296", "problem_id": "p03419", "language": "python", "slow_code": "def calc0(N, M):\n cell = [[0 for i in range(M)] for j in range(N)]\n for i in range(M):\n for j in range(N):\n for y in range(-1, 2):\n for x in range(-1, 2):\n xx = i + x\n yy = j + y\n if 0 <= xx < M and 0 <= yy < N:\n cell[yy][xx] ^= 1\n r = 0\n for i in range(M):\n for j in range(N):\n if cell[j][i]:\n r += 1\n return r\n\n\ndef calc(N, M):\n if N == 1 and M == 1:\n return 1\n if N >= 2 and M >= 2:\n return (N - 2) * (M - 2)\n if N == 1:\n return M - 2\n return N - 2\n\n\nN, M = [int(_) for _ in input().split()]\nprint((calc(N, M)))\n", "fast_code": "n, m = list(map(int, input().split()))\nif 2 <= n:\n n -= 2\nif 2 <= m:\n m -= 2\nprint((n * m))\n", "slow_time": 72088785, "fast_time": 13981662, "speedup": 5.156, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_10"} +{"pair_id": "python_13640", "problem_id": "p02362", "language": "python", "slow_code": "import array\nimport collections\n\nG_INF = 2**31\n\n\nclass GraphError(Exception):\n pass\n\n\nclass GraphSearchError(GraphError):\n def __init__(self, reason):\n self.reason = reason\n\n def __str__(self):\n return str(reason)\n\n\nclass ShortestPathFasterAlgorithm(object):\n def __init__(self, number_of_vertices, adjacency_list, costs, start):\n self.max_v = number_of_vertices\n self.adj = adjacency_list\n self.costs = costs\n self.start = start\n self.dist = None\n self.visits = None\n\n def initialize(self):\n self.dist = collections.defaultdict(lambda: G_INF)\n self.dist[self.start] = 0\n self.visits = collections.defaultdict(int)\n\n def single_source_shortest_path(self):\n self.initialize()\n q = collections.deque()\n q.append(self.start)\n while q:\n u = q.popleft()\n self.visits[u] += 1\n if self.visits[u] >= self.max_v:\n if self.max_v == 1:\n return [0]\n raise GraphSearchError(\"A negative cycle was detected.\")\n for v in self.adj[u]:\n new_length = self.dist[u] + self.costs[(u, v)]\n if new_length < self.dist[v]:\n self.dist[v] = new_length\n if v not in q:\n q.append(v)\n return self.dist\n\n\ndef main():\n max_v, max_e, start = list(map(int, input().split()))\n adjacency_list = collections.defaultdict(lambda: array.array(\"L\"))\n costs = collections.defaultdict(lambda: G_INF)\n for _ in range(max_e):\n s, t, d = list(map(int, input().split()))\n adjacency_list[s].append(t)\n costs[(s, t)] = d\n spfa = ShortestPathFasterAlgorithm(max_v, adjacency_list, costs, start)\n try:\n dist = spfa.single_source_shortest_path()\n for v in range(max_v):\n result = dist[v]\n if result < G_INF:\n print(result)\n else:\n print(\"INF\")\n except GraphSearchError as gse:\n print(\"NEGATIVE CYCLE\")\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\nfile_input = sys.stdin\nV, E, r = map(int, file_input.readline().split())\nedges = []\nfor line in file_input:\n edges.append(tuple(map(int, line.split())))\n\ndistance = [float(\"inf\")] * V\ndistance[r] = 0\nnotUpdated = True\nfor i in range(V - 1):\n notUpdated = True\n for s, t, w in edges:\n temp_d = distance[s] + w\n if temp_d < distance[t]:\n distance[t] = temp_d\n notUpdated = False\n if notUpdated:\n break\n\nif notUpdated:\n print(*map(lambda x: str(x).upper(), distance), sep=\"\\n\")\nelse:\n flag = True\n for s, t, w in edges:\n temp_d = distance[s] + w\n if temp_d < distance[t]:\n print(\"NEGATIVE CYCLE\")\n flag = False\n break\n if flag:\n print(*map(lambda x: str(x).upper(), distance), sep=\"\\n\")\n", "slow_time": 134643964, "fast_time": 59115609, "speedup": 2.2776, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_10"} +{"pair_id": "python_6761", "problem_id": "p00444", "language": "python", "slow_code": "import sys\n\ncoins = [1, 5, 10, 50, 100, 500]\nfor i in sys.stdin:\n if int(i) == 0:\n break\n n = 1000 - int(i)\n c = [i for i in range(n + 1)]\n for i in range(len(coins)):\n coin = coins[i]\n if coin <= n:\n c[coin] = 1\n coins.append(coin)\n for coin in coins:\n for p in range(coin + 1, n + 1):\n minc = c[p]\n if minc == 1:\n continue\n c[p] = c[p - coin] + 1 if minc > c[p - coin] + 1 else minc\n print((c[n]))\n", "fast_code": "import sys\n\ncoins = [500, 100, 50, 10, 5, 1]\nfor i in sys.stdin:\n if int(i) == 0:\n break\n n = 1000 - int(i)\n cnt = 0\n while n != 0:\n for i in range(len(coins)):\n if n >= coins[i]:\n n = n - coins[i]\n break\n cnt += 1\n print(cnt)\n", "slow_time": 2345161326, "fast_time": 29209863, "speedup": 80.2866, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_1"} +{"pair_id": "python_5626", "problem_id": "p03039", "language": "python", "slow_code": "from collections import defaultdict\n\nmod = 10**9 + 7\nmemo = defaultdict(int)\n\n\ndef cmb(n, r):\n if (n, r) in memo:\n return memo[(n, r)]\n if n < r or r < 0:\n return 0\n if r > n - r:\n return cmb(n, n - r)\n res = f[n] * pow(f[n - r], mod - 2, mod) * pow(f[r], mod - 2, mod) % mod\n memo[(n, r)] = res\n return res\n\n\nn, m, k = list(map(int, input().split()))\nf = [1]\nfor i in range(1, 2 * 10**5 + 1):\n f.append(f[-1] * i % mod)\nans = 0\nfor d in range(1, m):\n ans += d * (m - d) * n**2\n ans %= mod\nfor d in range(1, n):\n ans += d * (n - d) * m**2\n ans %= mod\nans *= cmb(n * m - 2, k - 2)\nans %= mod\nprint(ans)\n", "fast_code": "\"\"\"\"\"\"\n\n\ndef inv(x):\n return pow(x, MOD - 2, MOD)\n\n\ndef cmb(n, r):\n r = min(r, n - r)\n if r == 0:\n return 1\n if r == 1:\n return n\n f = 1\n for k in range(n, n - r, -1):\n f = (f * k) % MOD\n\n d = 1\n for k in range(2, r + 1):\n d = (d * k) % MOD\n\n return (f * inv(d)) % MOD\n\n\nMOD = 10**9 + 7\nN, M, K = list(map(int, input().split()))\nans = 0\nfor i in range(M):\n ans += i * (M - i) * N**2\nfor i in range(N):\n ans += i * (N - i) * M**2\npat = cmb(N * M - 2, K - 2)\nans = (ans * pat) % MOD\nprint(ans)\n", "slow_time": 16316171922, "fast_time": 136678666, "speedup": 119.3761, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_1"} +{"pair_id": "python_6067", "problem_id": "p03008", "language": "python", "slow_code": "import bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict, deque\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\nfrom operator import add, mul, sub\n\nsys.setrecursionlimit(100000)\ninput = sys.stdin.readline\n\n\ndef read_int():\n return int(input())\n\n\ndef read_int_n():\n return list(map(int, input().split()))\n\n\ndef read_float():\n return float(input())\n\n\ndef read_float_n():\n return list(map(float, input().split()))\n\n\ndef read_str():\n return input().strip()\n\n\ndef read_str_n():\n return list(map(str, input().split()))\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n error_print(e - s, \"sec\")\n return ret\n\n return wrap\n\n\n@mt\ndef slv(N, GSB):\n def f(N, gsb):\n dp = [[0] * (N + 1) for _ in range(4)]\n for i in range(3):\n v = gsb[1][i] - gsb[0][i]\n a = gsb[0][i]\n if v > 0:\n for w in range(N + 1):\n dp[i + 1][w] = dp[i][w]\n if w >= a:\n dp[i + 1][w] = max(dp[i][w], dp[i + 1][w - a] + v)\n else:\n dp[i + 1] = dp[i]\n return dp[3][N] + N\n\n tmp = f(N, GSB)\n\n GSB[0], GSB[1] = GSB[1], GSB[0]\n return f(tmp, GSB)\n\n\ndef main():\n N = read_int()\n GSB = [read_int_n() for _ in range(2)]\n print(slv(N, GSB))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\nn = int(eval(input()))\nA = tuple(map(int, input().split()))\nB = tuple(map(int, input().split()))\n\n\ndef f(n):\n dp = list(range(n + 1))\n for a, b in zip(A, B):\n if b <= a:\n continue\n for i in range(n + 1):\n if i - a >= 0:\n dp[i] = max(dp[i], dp[i - a] + b)\n return max(dp)\n\n\nm = f(n)\nA, B = B, A\nans = f(m)\nprint(ans)\n", "slow_time": 158385503, "fast_time": 52459115, "speedup": 3.0192, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_19"} +{"pair_id": "python_7186", "problem_id": "p02683", "language": "python", "slow_code": "import numpy as np\n\nN, M, X = list(map(int, input().split()))\nC = []\nA = []\nfor i in range(N):\n c = 0\n a = []\n c, *a = list(map(int, input().split()))\n C.append(c)\n A.append(a)\nA = np.array(A)\ninf = float(\"inf\")\nres = inf\nfor bit in range(1 << N):\n Cost = 0\n Wise = np.zeros(M)\n for i in range(N):\n if (bit >> i) & 1:\n Cost += C[i]\n Wise += A[i]\n Wise = Wise.tolist()\n\n if min(Wise) >= X and Cost <= res:\n res = Cost\nif res == inf:\n print(\"-1\")\nelse:\n print(res)\n\"\"\"\"\"\"\n", "fast_code": "import sys\nimport math\nimport decimal\nimport itertools\nfrom itertools import product\nfrom functools import reduce\n\n\ndef input():\n return sys.stdin.readline()[:-1]\n\n\ndef main():\n N, M, X = list(map(int, input().split()))\n A = [list(map(int, input().split())) for _ in range(N)]\n inf = 10**18\n\n ans = inf\n for i in product([0, 1], repeat=N):\n ok = True\n for m in range(1, M + 1):\n s = 0\n for n in range(N):\n if i[n] == 1:\n s += A[n][m]\n if s < X:\n ok = False\n break\n if ok:\n money = 0\n for n in range(N):\n if i[n] == 1:\n money += A[n][0]\n ans = min(ans, money)\n if ans == inf:\n print((-1))\n else:\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 854153208, "fast_time": 171032725, "speedup": 4.9941, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_24"} +{"pair_id": "python_11966", "problem_id": "p02716", "language": "python", "slow_code": "n = int(eval(input()))\narr = list(map(int, input().split()))\nacum1 = [0]\nacum2 = [0]\nfor i in range(n):\n if i % 2 == 0:\n acum1.append(acum1[-1] + arr[i])\n acum2.append(acum2[-1] + 0)\n else:\n acum1.append(acum1[-1] + 0)\n acum2.append(acum2[-1] + arr[i])\nif n % 2 == 0:\n ans = max(acum1[n - 1] - acum1[0], acum2[n] - acum2[1])\n for i in range(1, n + 1, 2):\n if i + 3 > n:\n continue\n tmp = (acum1[i] - acum1[0]) + (acum2[n] - acum2[i + 2])\n ans = max(ans, tmp)\nelse:\n ans = max(acum1[n - 2] - acum1[0], acum2[n - 1] - acum2[1], acum1[n] - acum1[2])\n for i in range(1, n + 1, 2):\n if i + 3 > n - 1:\n continue\n tmp = (acum1[i] - acum1[0]) + (acum2[n - 1] - acum2[i + 2])\n ans = max(ans, tmp)\n for i in range(2, n + 1, 2):\n if i + 3 > n:\n continue\n tmp = (acum2[i] - acum2[1]) + (acum1[n] - acum1[i + 2])\n ans = max(ans, tmp)\n for i in range(1, n + 1, 2):\n if i + 4 > n:\n continue\n tmp = (acum1[i] - acum1[0]) + (acum1[n] - acum1[i + 3])\n ans = max(ans, tmp)\n acummax = [-(10**18)]\n for i in range(1, n + 1):\n if i + 2 > n:\n acummax.append(-(10**18))\n else:\n if i % 2 == 0:\n acummax.append(acum2[i] + acum1[n] - acum1[i + 2])\n else:\n acummax.append(-(10**18))\n for i in range(n - 1, -1, -1):\n acummax[i] = max(acummax[i], acummax[i + 1])\n for i in range(1, n + 1, 2):\n if i + 6 > n:\n continue\n tmp = (acum1[i] - acum1[0] - acum2[i + 2]) + acummax[i + 3]\n ans = max(ans, tmp)\nprint(ans)\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nINF = 10**18\ndp0 = 0\ndp1 = -INF\ndp2 = -INF\nfor i, a in enumerate(A):\n if i % 2 == 0:\n dp1 = max(dp1, dp0)\n dp0 += a\n dp2 += a\n else:\n dp2 = max(dp2, dp1)\n dp1 += a\nif N % 2 == 1:\n print((max(dp1, dp2)))\nelse:\n print((max(dp0, dp1)))\n", "slow_time": 152776680, "fast_time": 41511520, "speedup": 3.6803, "source": "python_benchmark", "slow_submission_id": "sol_24", "fast_submission_id": "sol_1"} +{"pair_id": "python_17350", "problem_id": "p02555", "language": "python", "slow_code": "def resolve():\n MOD = 10**9 + 7\n N = int(eval(input()))\n dp = [0] * (N + 1)\n dp[0] = 1\n for n in range(N + 1):\n for i in range(3, N + 1):\n dp[n] += dp[n - i]\n dp[n] %= MOD\n print((dp[N]))\n\n\nif __name__ == \"__main__\":\n resolve()\n", "fast_code": "s = int(eval(input()))\nx = s // 3\n\n\ndef cmb(n, r):\n if n - r < r:\n r = n - r\n if r == 0:\n return 1\n if r == 1:\n return n\n numerator = [n - r + k + 1 for k in range(r)]\n denominator = [k + 1 for k in range(r)]\n for p in range(2, r + 1):\n pivot = denominator[p - 1]\n if pivot > 1:\n offset = (n - r) % p\n for k in range(p - 1, r, p):\n numerator[k - offset] /= pivot\n denominator[k] /= pivot\n result = 1\n for k in range(r):\n if numerator[k] > 1:\n result *= int(numerator[k])\n return result\n\n\nans = 0\nfor i in range(x):\n Box = i + 1\n Nokori = s - 3 * Box\n ans_ = cmb(Nokori + Box - 1, Box - 1)\n ans += ans_\nprint((ans % (10**9 + 7)))\n", "slow_time": 2132701628, "fast_time": 405576047, "speedup": 5.2585, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_8"} +{"pair_id": "python_12764", "problem_id": "p02703", "language": "python", "slow_code": "from scipy.sparse import *\n\n(n, m, s, *D), *t = [list(map(int, t.split())) for t in open(0)]\nR, C = [], []\nfor u, v, a, b in t[:m]:\n for i in range(2501 - a):\n R += (i + a) * 51 + u, (i + a) * 51 + v\n C += i * 51 + v, i * 51 + u\n D += b, b\nfor i, (c, d) in enumerate(t[m:], 1):\n for j in range(2501 - c):\n R += (j * 51 + i,)\n C += ((j + c) * 51 + i,)\n D += (d,)\nd = csgraph.dijkstra(csr_matrix((D, (R, C)), [8**6] * 2), 1, min(2500, s) * 51 + 1)\nfor i in range(2, n + 1):\n print((int(min(d[i::51]))))\n", "fast_code": "def main():\n import heapq\n\n n, m, s = list(map(int, input().split()))\n if s >= 2500:\n s = 2499\n edges = [[] for _ in range(n)]\n for _ in range(m):\n from_, to, cost, time = list(map(int, input().split()))\n edges[from_ - 1].append((to - 1, cost, time))\n edges[to - 1].append((from_ - 1, cost, time))\n banks = []\n for i in range(n):\n coin, time = list(map(int, input().split()))\n banks.append((coin, time))\n INF = float(\"INF\")\n DP = [[INF] * 2500 for _ in range(n)]\n DP[0][s] = 0\n ans = [INF] * n\n\n def push_todo(node, coin, time):\n if coin < 0:\n return\n if time >= DP[node][coin]:\n return\n heapq.heappush(todo, (time, node, coin))\n DP[node][coin] = time\n\n def charge(node, current_coin, current_time):\n coin, time = banks[node]\n new_coin = current_coin + coin\n if new_coin >= 2500:\n new_coin = 2499\n push_todo(node, new_coin, current_time + time)\n\n todo = [(0, 0, s)]\n while todo:\n current_time, node, current_coin = heapq.heappop(todo)\n if current_time > DP[node][current_coin]:\n continue\n if current_time < ans[node]:\n ans[node] = current_time\n charge(node, current_coin, current_time)\n for to, cost, time in edges[node]:\n push_todo(to, current_coin - cost, current_time + time)\n for a in ans[1:]:\n print(a)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 28226146294, "fast_time": 5170756056, "speedup": 5.4588, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_7"} +{"pair_id": "python_14296", "problem_id": "p03609", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nX, t = MI()\nprint((max(0, X - t)))\n", "fast_code": "def main():\n x, t = list(map(int, input().split()))\n print((max(0, x - t)))\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 52898444, "fast_time": 16647787, "speedup": 3.1775, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_5"} +{"pair_id": "python_14338", "problem_id": "p03025", "language": "python", "slow_code": "class Combination:\n \"\"\"\"\"\"\n\n def __init__(self, n, MOD):\n self.fact = [1]\n for i in range(1, n + 1):\n self.fact.append(self.fact[-1] * i % MOD)\n self.inv_fact = [0] * (n + 1)\n self.inv_fact[n] = pow(self.fact[n], MOD - 2, MOD)\n for i in reversed(list(range(n))):\n self.inv_fact[i] = self.inv_fact[i + 1] * (i + 1) % MOD\n self.MOD = MOD\n\n def factorial(self, k):\n \"\"\"\"\"\"\n return self.fact[k]\n\n def inverse_factorial(self, k):\n \"\"\"\"\"\"\n return self.inv_fact[k]\n\n def permutation(self, k, r):\n \"\"\"\"\"\"\n if k < r:\n return 0\n return (self.fact[k] * self.inv_fact[k - r]) % self.MOD\n\n def combination(self, k, r):\n \"\"\"\"\"\"\n if k < r:\n return 0\n return (self.fact[k] * self.inv_fact[k - r] * self.inv_fact[r]) % self.MOD\n\n\nn, a, b, c = list(map(int, input().split()))\nMOD = 10**9 + 7\ncomb = Combination(10**6, MOD)\npa = a * pow(a + b, MOD - 2, MOD) % MOD\npb = b * pow(a + b, MOD - 2, MOD) % MOD\nec = 100 * pow(100 - c, MOD - 2, MOD) % MOD\nans1 = 0\ntmp = pow(pa, n, MOD)\nfor i in range(n):\n ans1 += tmp * pow(pb, i, MOD) * comb.combination(n - 1 + i, i) * (n + i) * ec\n ans1 %= MOD\nans2 = 0\ntmp = pow(pb, n, MOD)\nfor i in range(n):\n ans2 += tmp * pow(pa, i, MOD) * comb.combination(n - 1 + i, i) * (n + i) * ec\n ans2 %= MOD\nprint(((ans1 + ans2) % MOD))\n", "fast_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n res = list(sys.stdin.readline())\n if res[-1] == \"\\n\":\n return res[:-1]\n return res\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef solve():\n def comb(a, b):\n return fact[a] * fact[a - b] * inv[b] % mod\n\n n, a, b, c = LI()\n inv_100 = pow(100, mod - 2, mod)\n a = a * inv_100 % mod\n b = b * inv_100 % mod\n c = (1 - c * inv_100) % mod\n c = pow(c, mod - 2, mod)\n fact = [1]\n N = 200000\n for i in range(1, N + 1):\n fact.append(fact[-1] * i % mod)\n inv = [None] * (N + 1)\n inv[N] = pow(fact[N], mod - 2, mod)\n for i in range(N)[::-1]:\n inv[i] = inv[i + 1] * (i + 1) % mod\n ans = 0\n pa = pow(a, n, mod)\n pb = pow(b, n, mod)\n for i in range(n):\n ans += (\n inv[n - 1]\n * inv[i]\n * fact[n + i]\n * pow(c, n + i + 1, mod)\n * (pa * pow(b, i, mod) + pb * pow(a, i, mod))\n % mod\n )\n ans %= mod\n print(ans)\n return\n\n\nif __name__ == \"__main__\":\n solve()\n", "slow_time": 113802903802, "fast_time": 23352294045, "speedup": 4.8733, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_6"} +{"pair_id": "python_6747", "problem_id": "p02289", "language": "python", "slow_code": "import sys\n\n\ndef maxHeapify(A, i):\n l = i * 2 + 1\n r = i * 2 + 2\n if l < n:\n largest = l\n if r < n and A[r] > A[l]:\n largest = r\n if A[largest] > A[i]:\n A[i], A[largest] = A[largest], A[i]\n maxHeapify(A, largest)\n\n\ndef insert(S, k):\n global n\n S[n] = k\n n += 1\n i = n - 1\n p = (i - 1) // 2\n while i > 0 and S[i] > S[p]:\n S[i], S[p] = S[p], S[i]\n i = p\n p = (i - 1) // 2\n\n\ndef extractMax(S):\n global n\n if n == 1:\n n -= 1\n return S[0]\n ans = S[0]\n n -= 1\n S[0] = S[n]\n i = 0\n while True:\n l = i * 2 + 1\n r = i * 2 + 2\n if l >= n:\n break\n largest = l\n if r < n and A[r] > A[l]:\n largest = r\n if A[largest] > A[i]:\n A[i], A[largest] = A[largest], A[i]\n i = largest\n else:\n break\n return ans\n\n\nA = [0] * 2000000\nS = []\nn = 0\nfor s in sys.stdin:\n if s[2] == \"s\":\n insert(A, int(s[7:]))\n elif s[2] == \"t\":\n S.append(extractMax(A))\n else:\n break\nprint((\"\\n\".join(map(str, S))))\n", "fast_code": "from sys import stdin\n\nreadline = stdin.readline\nimport heapq\n\n\ndef main():\n heap = []\n while True:\n line = readline()\n if line[2] == \"t\":\n print((heapq.heappop(heap)[1]))\n elif line[2] == \"s\":\n n = int(line.split()[1])\n heapq.heappush(heap, (-n, n))\n else:\n break\n\n\nmain()\n", "slow_time": 170032903, "fast_time": 30127926, "speedup": 5.6437, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_0"} +{"pair_id": "python_10051", "problem_id": "p03222", "language": "python", "slow_code": "def check(pat):\n for i in range(W - 2):\n mask = 0b11 << i\n if pat & mask == mask:\n return False\n return True\n\n\ndef simulate(a1, pat):\n if a1 != W - 1 and pat & 1 << a1 != 0:\n return a1 + 1\n elif a1 != 0 and pat & 1 << a1 - 1 != 0:\n return a1 - 1\n else:\n return a1\n\n\nH, W, K = list(map(int, input().split()))\ndp = [[0] * W for h in range(H + 1)]\ndp[0][0] = 1\nfor h in range(1, H + 1):\n for pat in range(2 ** (W - 1)):\n for w in range(W):\n if check(pat):\n dp[h][simulate(w, pat)] += dp[h - 1][w]\n dp[h][simulate(w, pat)] %= 1000000007\nprint((dp[H][K - 1]))\n", "fast_code": "MOD = 10**9 + 7\nH, W, K = list(map(int, input().split()))\nfibs = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n\n\ndef getFib(i):\n return fibs[i + 2]\n\n\nnumLs, numCs, numRs = [0] * W, [0] * W, [0] * W\nfor j in range(W):\n numCs[j] = getFib(j - 1) * getFib(W - 1 - j - 1)\n numLs[j] = getFib(j - 2) * getFib(W - 1 - j - 1)\n numRs[j] = getFib(j - 1) * getFib(W - 1 - j - 2)\ndp = [[0] * W for _ in range(H + 1)]\ndp[0][0] = 1\nfor i in range(H):\n for j in range(W):\n dp[i + 1][j] += dp[i][j] * numCs[j]\n if j > 0:\n dp[i + 1][j - 1] += dp[i][j] * numLs[j]\n if j < W - 1:\n dp[i + 1][j + 1] += dp[i][j] * numRs[j]\n for j in range(W):\n dp[i + 1][j] %= MOD\nprint((dp[H][K - 1]))\n", "slow_time": 1071172743, "fast_time": 79770414, "speedup": 13.4282, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_6"} +{"pair_id": "python_1151", "problem_id": "p02889", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\nN, M, L = (int(i) for i in input().split())\nimport numpy as np\nfrom scipy.sparse.csgraph import floyd_warshall\nfrom scipy.sparse import csr_matrix\n\ngraph = [[0] * N for i in range(N)]\nfor i in range(M):\n a, b, c = (int(i) for i in input().split())\n graph[a - 1][b - 1] = c\n graph[b - 1][a - 1] = c\ngraph = csr_matrix(graph)\nd = floyd_warshall(csgraph=graph, directed=False)\nnew_graph = [[0] * N for i in range(N)]\nfor i in range(N):\n for j in range(N):\n if d[i][j] <= L:\n new_graph[i][j] = 1\n new_graph[j][i] = 1\ngraph = csr_matrix(new_graph)\nd = floyd_warshall(csgraph=graph, directed=False)\nQ = int(eval(input()))\nfor i in range(Q):\n s, t = (int(i) for i in input().split())\n if d[s - 1][t - 1] == float(\"inf\"):\n print(\"-1\")\n else:\n print((int(d[s - 1][t - 1] - 1)))\n", "fast_code": "def wf(l, n):\n for i in range(n):\n for j in range(n):\n for k in range(n):\n l[j][k] = min(l[j][k], l[j][i] + l[i][k])\n return l\n\n\ndef main():\n n, m, l = list(map(int, input().split()))\n l1 = [[10**15 for i in range(n)] for i in range(n)]\n for _ in range(m):\n a, b, c = list(map(int, input().split()))\n l1[a - 1][b - 1] = c\n l1[b - 1][a - 1] = c\n l1 = wf(l1, n)\n l2 = [[10**4 for i in range(n)] for i in range(n)]\n for i in range(n):\n for j in range(n):\n if l1[i][j] <= l:\n l2[i][j] = 1\n l2 = wf(l2, n)\n q = int(eval(input()))\n lq = []\n for _ in range(q):\n lq.append(list(map(int, input().split())))\n for sq in lq:\n res = l2[sq[0] - 1][sq[1] - 1]\n if res == 10**4:\n print((-1))\n else:\n print((res - 1))\n\n\nmain()\n", "slow_time": 25162650789, "fast_time": 131266833, "speedup": 191.6908, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_4"} +{"pair_id": "python_14104", "problem_id": "p02244", "language": "python", "slow_code": "from itertools import product\nfrom copy import deepcopy, copy\n\n\nclass QueenMAP:\n def __init__(self):\n self.yoko = set()\n self.tate = set()\n self.naname1 = set()\n self.naname2 = set()\n self.MAP = [[\".\"] * 8 for _ in range(8)]\n\n def add(self, y, x):\n self.MAP[y][x] = \"Q\"\n self.yoko.add(y)\n self.tate.add(x)\n self.naname1.add(y - x)\n self.naname2.add(x + y)\n\n def check(self, y, x):\n if (\n y in self.yoko\n or x in self.tate\n or (y - x) in self.naname1\n or (x + y) in self.naname2\n ):\n return False\n return True\n\n def allcheck(self):\n for i in range(8):\n if not \"Q\" in self.MAP[i]:\n return False\n return True\n\n\ndef nuri(m, a, b):\n for i in range(8):\n m[a][i] = \"1\"\n m[i][b] = \"1\"\n if a + b < 8:\n y = a + b\n x = 0\n l = a + b + 1\n else:\n y = 7\n x = a + b - 7\n l = 15 - a - b\n for i in range(l):\n m[y - i][x + i] = \"1\"\n if a <= b:\n ny = 0\n nx = b - a\n l = 8 - (b + a)\n else:\n ny = a - b\n nx = 0\n l = 8 - (a - b)\n for i in range(l):\n m[ny + i][nx + i] = \"1\"\n return m\n\n\ndef solve(MAP0, MAP, n):\n dp = [(deepcopy(MAP0), deepcopy(MAP), n)]\n while dp:\n m0, m, cnt = dp.pop()\n if cnt == 8:\n flg = True\n for r in range(8):\n if \"\".join(map(str, m0[r])).find(\"0\"):\n flg = False\n break\n if flg:\n return m\n for i in range(8):\n for j in range(8):\n if m0[i][j] == \"0\":\n dp.append((nuri(deepcopy(m0), i, j), deepcopy(m), cnt + 1))\n return m\n\n\ndef MAIN():\n f = lambda M: \"\\n\".join(\"\".join(map(str, m)) for m in M)\n QM = QueenMAP()\n n = int(eval(input()))\n for _ in range(n):\n a, b = list(map(int, input().split()))\n QM.add(a, b)\n dp = [(deepcopy(QM), n)]\n while dp:\n Q, cnt = dp.pop()\n if cnt == 8:\n if Q.allcheck():\n print((f(Q.MAP)))\n break\n continue\n cnt += 1\n for i in range(8):\n for j in range(8):\n if Q.check(i, j):\n CQ = deepcopy(Q)\n CQ.add(i, j)\n dp.append((CQ, cnt))\n\n\nMAIN()\n", "fast_code": "from sys import stdin\n\nN = 8\nFREE = -1\nNOT_FREE = 1\nrow = [FREE] * N\ncol = [FREE] * N\ndpos = [FREE] * (2 * N - 1)\ndneg = [FREE] * (2 * N - 1)\nX = [[False] * N for _ in range(N)]\nn = int(stdin.readline())\nfor _ in range(0, n):\n r, c = list(map(int, stdin.readline().split()))\n X[r][c] = True\n\n\ndef printBoard():\n for i in range(0, N):\n for j in range(0, N):\n if X[i][j] != 0 and row[i] != j:\n return\n for i in range(0, N):\n print((\".\" * row[i] + \"Q\" + \".\" * (8 - row[i] - 1)))\n\n\ndef recursive(i):\n if i == N:\n printBoard()\n return\n for j in range(0, N):\n if (\n NOT_FREE == col[j]\n or NOT_FREE == dpos[i + j]\n or NOT_FREE == dneg[i - j + N - 1]\n ):\n continue\n row[i] = j\n col[j] = dpos[i + j] = dneg[i - j + N - 1] = NOT_FREE\n recursive(i + 1)\n row[i] = col[j] = dpos[i + j] = dneg[i - j + N - 1] = FREE\n\n\nrecursive(0)\n", "slow_time": 22183403059, "fast_time": 803032199, "speedup": 27.6245, "source": "python_benchmark", "slow_submission_id": "sol_5", "fast_submission_id": "sol_0"} +{"pair_id": "python_12513", "problem_id": "p03674", "language": "python", "slow_code": "n = int(eval(input()))\nA = list(map(int, input().split()))\nmod = 10**9 + 7\nd = {}\nfor i in range(n + 1):\n if A[i] not in d:\n d[A[i]] = i\n else:\n l = d[A[i]]\n r = i\n break\n\n\ndef cmb1(n, r, mod):\n if r < 0 or r > n:\n return 0\n r = min(r, n - r)\n return g1[n] * g2[r] * g2[n - r] % mod\n\n\nmod = 10**9 + 7\nN = 10**6\ng1 = [1, 1]\ng2 = [1, 1]\ninverse = [0, 1]\nfor i in range(2, N + 1):\n g1.append((g1[-1] * i) % mod)\n inverse.append((-inverse[mod % i] * (mod // i)) % mod)\n g2.append((g2[-1] * inverse[-1]) % mod)\nfor k in range(1, n + 2):\n ans = cmb1(n + 1, k, mod) - cmb1(l + n - r, k - 1, mod)\n print((ans % mod))\n", "fast_code": "class ModComb:\n def __init__(self, MAX, mod=10**9 + 7):\n fac = [1, 1]\n finv = [1, 1]\n inv = [0, 1]\n for i in range(2, MAX):\n fac.append(fac[i - 1] * i % mod)\n inv.append(mod - inv[mod % i] * (mod // i) % mod)\n finv.append(finv[i - 1] * inv[i] % mod)\n self.fac, self.finv, self.mod = fac, finv, mod\n\n def nCk(self, n, k):\n if n < k or n < 0 or k < 0:\n return 0\n fac, finv, mod = self.fac, self.finv, self.mod\n return fac[n] * (finv[k] * finv[n - k] % mod) % mod\n\n\nmod = 10**9 + 7\nN, *A = list(map(int, open(0).read().split()))\nmc = ModComb(210000, mod=mod)\nused = {}\nleft, right = 0, 0\nfor i, a in enumerate(A):\n if a in used:\n right = i\n left = used[a]\n break\n used[a] = i\nm = left + N - right\nfor k in range(1, N + 2):\n print(((mc.nCk(N + 1, k) - mc.nCk(m, k - 1)) % mod))\n", "slow_time": 157681417612, "fast_time": 20922270310, "speedup": 7.5365, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_20"} +{"pair_id": "python_2588", "problem_id": "p02660", "language": "python", "slow_code": "def factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-(n**0.5) // 1)) + 1):\n if temp % i == 0:\n cnt = 0\n while temp % i == 0:\n cnt += 1\n temp //= i\n arr.append([i, cnt])\n if temp != 1:\n arr.append([temp, 1])\n if arr == []:\n arr.append([n, 1])\n return arr\n\n\ndef readinput():\n n = int(eval(input()))\n return n\n\n\ndef possibleCnt(n):\n cnt = 0\n resu = n\n for i in range(1, n + 1):\n if resu >= i:\n cnt += 1\n resu -= i\n\n return cnt\n\n\ndef main(n):\n ansList = factorization(n)\n\n count = 0\n for l in ansList:\n if l[0] != 1:\n count += possibleCnt(l[1])\n return count\n\n\nif __name__ == \"__main__\":\n n = readinput()\n ans = main(n)\n print(ans)\n", "fast_code": "import numpy as np\nimport sys\n\n\ndef xnxn(n=0):\n \"\"\"\"\"\"\n if n == 0:\n temp = list(map(int, input().split()))\n if len(temp) == 1:\n return temp[0]\n elif len(temp) > 1:\n return temp\n else:\n temp = [list(map(int, input().split())) for _ in range(n)]\n return temp\n\n\ndef sp_xnxn(n=0):\n \"\"\"\"\"\"\n if n == 0:\n return [int(k) for k in xsxs()]\n else:\n return [[int(k) for k in xsxs()] for _ in range(n)]\n\n\ndef xsxs(n=0):\n \"\"\"\"\"\"\n if n == 0:\n temp = list(input().split())\n if len(temp) == 1:\n return temp[0]\n elif len(temp) > 1:\n return temp\n else:\n return [list(input().split()) for _ in range(n)]\n\n\ndef sp_xsxs(n=0):\n \"\"\"\"\"\"\n if n == 0:\n return [s for s in xsxs()]\n else:\n return [[s for s in xsxs()] for _ in range(n)]\n\n\ndef p_num(a):\n if a == 1:\n return [[a, 1]]\n else:\n tmp = 2\n ans = []\n while tmp < np.sqrt(a) + 1:\n n = 0\n p = [tmp]\n while a % tmp == 0:\n a = int(a / tmp)\n\n n += 1\n c = 1\n if n != 0:\n p.append(n)\n ans.append(p)\n tmp += 1\n c = 0\n if c == 0 and a != 1:\n ans.append([a, 1])\n return ans\n\n\nn = xnxn()\nif n == 1:\n print((0))\n sys.exit()\nelse:\n a = p_num(n)\n c = 0\n for num in a:\n i = 1\n while num[1] - i > -1:\n num[1] -= i\n i += 1\n c += 1\n print(c)\n", "slow_time": 3527132862, "fast_time": 791363973, "speedup": 4.457, "source": "python_benchmark", "slow_submission_id": "sol_12", "fast_submission_id": "sol_14"} +{"pair_id": "python_16976", "problem_id": "p03291", "language": "python", "slow_code": "import sys\n\nstdin = sys.stdin\nsys.setrecursionlimit(10**7)\n\n\ndef li():\n return list(map(int, stdin.readline().split()))\n\n\ndef li_():\n return [int(x) - 1 for x in stdin.readline().split()]\n\n\ndef lf():\n return list(map(float, stdin.readline().split()))\n\n\ndef ls():\n return stdin.readline().split()\n\n\ndef ns():\n return stdin.readline().rstrip()\n\n\ndef lc():\n return list(ns())\n\n\ndef ni():\n return int(stdin.readline())\n\n\ndef nf():\n return float(stdin.readline())\n\n\ns = ns()\nt = len(s)\na__ = [0] * (t + 1)\nab_ = [0] * (t + 1)\nabc = [0] * (t + 1)\nMOD = 10**9 + 7\nq = 0\nfor i, si in enumerate(s):\n if si == \"A\":\n a__[i + 1] = a__[i] + pow(3, q, MOD)\n ab_[i + 1] = ab_[i]\n abc[i + 1] = abc[i]\n elif si == \"B\":\n a__[i + 1] = a__[i]\n ab_[i + 1] = ab_[i] + a__[i]\n abc[i + 1] = abc[i]\n elif si == \"C\":\n a__[i + 1] = a__[i]\n ab_[i + 1] = ab_[i]\n abc[i + 1] = abc[i] + ab_[i]\n elif si == \"?\":\n a__[i + 1] = 3 * a__[i] + pow(3, q, MOD)\n ab_[i + 1] = 3 * ab_[i] + a__[i]\n abc[i + 1] = 3 * abc[i] + ab_[i]\n q += 1\n a__[i + 1] %= MOD\n ab_[i + 1] %= MOD\n abc[i + 1] %= MOD\nprint((abc[t]))\n", "fast_code": "mod = 10**9 + 7\ndp = [0, 0, 0, 1]\nfor s in input()[::-1]:\n tmp = dp[:]\n dp[3] = tmp[3] * 3 if s == \"?\" else tmp[3]\n dp[3] %= mod\n for j in range(2, -1, -1):\n dp[j] = (\n tmp[j] * 3 + tmp[j + 1]\n if s == \"?\"\n else tmp[j] + tmp[j + 1] if s == \"ABC\"[j] else tmp[j]\n )\n dp[j] %= mod\nprint(dp[0] % (10**9 + 7))\n", "slow_time": 131275853, "fast_time": 50114864, "speedup": 2.6195, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_20"} +{"pair_id": "python_6750", "problem_id": "p03801", "language": "python", "slow_code": "from collections import defaultdict\nimport sys\n\n\nclass BIT:\n def __init__(self, number):\n self.n = number\n self.list = [0] * (number + 1)\n\n def add(self, i, x):\n while i <= self.n:\n self.list[i] += x\n i += i & -i\n\n def search(self, i):\n s = 0\n while i > 0:\n s += self.list[i]\n i -= i & -i\n return s\n\n def suma(self, i, j):\n return self.search(j) - self.search(i - 1)\n\n\nN = int(eval(input()))\nA = [int(i) for i in input().split()]\nC = sorted(set(A))\nndd = defaultdict(int)\nfor i in range(len(C)):\n ndd[i + 1] = C[i]\ndd = defaultdict(int)\nfor i in range(len(C)):\n dd[C[i]] = i + 1\n\nvisit = [0] * N\nvisit[0] = 1\ns = A[0]\nH = []\nH.append(s)\nfor i in range(1, N):\n if s < A[i]:\n s = A[i]\n H.append(s)\n visit[i] = 1\nBITI = BIT(N + 1)\nBITI2 = BIT(N + 1)\nj = len(H) - 1\nl = dd[H[j]]\nnum = sum(A)\nT = [0] * N\nans = 0\nfor i in range(N - 1, -1, -1):\n if l == dd[A[0]]:\n break\n BITI.add(dd[A[i]], A[i])\n BITI2.add(dd[A[i]], 1)\n if dd[A[i]] == l and visit[i] == 1:\n T[i] = (\n BITI.suma(dd[H[j - 1]], N + 1)\n - BITI2.suma(dd[H[j - 1]], N + 1) * H[j - 1]\n - ans\n )\n ans += T[i]\n\n j -= 1\n l = dd[H[j]]\nx = num - sum(T)\nT[0] = x\n\nfor t in T:\n print(t)\n", "fast_code": "import os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\nsys.setrecursionlimit(2147483647)\nINF = float(\"inf\")\nIINF = 10**18\nMOD = 10**9 + 7\nN = int(sys.stdin.readline())\nA = list(map(int, sys.stdin.readline().split()))\nXY = [(a, i) for i, a in enumerate(A)]\nXY.sort(reverse=True)\n\nans = [0] * N\nmin_y = IINF\nfor i, (x, y) in enumerate(XY):\n min_y = min(min_y, y)\n x2 = XY[i + 1][0] if i + 1 < N else 0\n ans[min_y] += (x - x2) * (i + 1)\nprint(*ans, sep=\"\\n\")\n", "slow_time": 155042231, "fast_time": 57634411, "speedup": 2.6901, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_1"} +{"pair_id": "python_15351", "problem_id": "p02780", "language": "python", "slow_code": "n, k = list(map(int, input().split()))\narr = list(map(int, input().split()))\ntable = {}\nans = 0\nfor i in range(1, 1000 + 1):\n table[i] = (i + 1) * 0.5\nif n == 1:\n print((table[arr[0]]))\n exit()\nlis = [0 for _ in range(n)]\nlis[0] = table[arr[0]]\nfor i in range(n - 1):\n if i + 1 < k:\n lis[i + 1] = lis[i] + table[arr[i + 1]]\n else:\n lis[i + 1] = lis[i] + table[arr[i + 1]] - table[arr[i - k + 1]]\n ans = max(ans, lis[i + 1])\nprint(ans)\n", "fast_code": "from collections import deque\n\nN, K = list(map(int, input().split()))\nP = list(map(int, input().split()))\nAry = deque([])\nans, res, cnt = 0, 0, 0\nk = 0\nfor i in range(N):\n cnt += 1\n k = (P[i] + 1) / 2\n Ary.append(k)\n res += k\n if cnt < K:\n continue\n if ans < res:\n ans = res\n res -= Ary.popleft()\nprint(ans)\n", "slow_time": 91479968, "fast_time": 25175494, "speedup": 3.6337, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_3"} +{"pair_id": "python_9031", "problem_id": "p03837", "language": "python", "slow_code": "n, m = list(map(int, input().split()))\nd = [[float(\"inf\") for i in range(n)] for i in range(n)]\nr = [list(map(int, input().split())) for i in range(m)]\nfrom scipy.sparse.csgraph import floyd_warshall\n\nfor u, v, c in r:\n u, v = u - 1, v - 1\n d[u][v] = d[v][u] = c\nd = floyd_warshall(d).tolist()\ncnt = 0\nfor u, v, c in r:\n u, v = u - 1, v - 1\n if d[u][v] != c:\n cnt += 1\nprint(cnt)\n", "fast_code": "import heapq\n\nn, m = list(map(int, input().split()))\ngraph = [set() for _ in range(n)]\nside = dict()\nans = [0 for _ in range(m + 1)]\nfor i in range(m):\n a, b, c = list(map(int, input().split()))\n t = (a - 1, b - 1, c)\n side[i] = t\n graph[a - 1].add(i)\n graph[b - 1].add(i)\nfor j in range(n):\n D = [\n (0, 0, j, m),\n ]\n heapq.heapify(D)\n done = [True for _ in range(n)]\n while D:\n d = heapq.heappop(D)\n if done[d[2]]:\n done[d[2]] = False\n ans[d[3]] = 1\n for i in graph[d[2]]:\n a, b, c = side[i]\n if b == d[2]:\n a, b = b, a\n if done[b]:\n heapq.heappush(D, (d[0] + c, ans[i], b, i))\nprint((m - (sum(ans) - 1)))\n", "slow_time": 14535365898, "fast_time": 50189083, "speedup": 289.6121, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_28"} +{"pair_id": "python_9264", "problem_id": "p02558", "language": "python", "slow_code": "from networkx.utils import UnionFind\n\nN, Q = list(map(int, input().split()))\nuf = UnionFind()\nfor i in range(Q):\n t, u, v = list(map(int, input().split()))\n if t:\n print((1 if uf[u] == uf[v] else 0))\n else:\n uf.union(u, v)\n", "fast_code": "class UnionFind:\n \"\"\"\"\"\"\n\n __slots__ = [\"_data_size\", \"_first_idx\", \"_parents\"]\n\n def __init__(self, data_size: int, is_zero_origin: bool = True) -> None:\n self._data_size = data_size\n self._first_idx = 0 if is_zero_origin else 1\n self._parents = [-1] * (data_size + self._first_idx)\n\n def _find(self, x: int) -> int:\n if self._parents[x] < 0:\n return x\n self._parents[x] = self._find(self._parents[x])\n return self._parents[x]\n\n def is_connected(self, x: int, y: int) -> bool:\n \"\"\"\"\"\"\n return self._find(x) == self._find(y)\n\n def unite(self, x: int, y: int) -> None:\n \"\"\"\"\"\"\n x, y = self._find(x), self._find(y)\n if x == y:\n return\n if self._parents[x] > self._parents[y]:\n x, y = y, x\n self._parents[x] += self._parents[y]\n self._parents[y] = x\n\n\ndef unionfind():\n\n N, Q, *TUV = list(map(int, open(0).read().split()))\n tree = UnionFind(N)\n res = []\n for t, u, v in zip(*[iter(TUV)] * 3):\n if t:\n res.append(int(tree.is_connected(u, v)))\n else:\n tree.unite(u, v)\n print((\"\\n\".join(map(str, res))))\n\n\nif __name__ == \"__main__\":\n unionfind()\n", "slow_time": 18058265902, "fast_time": 116057229, "speedup": 155.5979, "source": "python_benchmark", "slow_submission_id": "sol_19", "fast_submission_id": "sol_9"} +{"pair_id": "python_5217", "problem_id": "p02729", "language": "python", "slow_code": "a, b = list(map(int, input().split()))\nimport itertools\n\na1 = len(list(itertools.combinations(list(range(a)), 2)))\nb1 = len(list(itertools.combinations(list(range(b)), 2)))\nprint((a1 + b1))\n", "fast_code": "N, M = list(map(int, input().split()))\nans = N * (N - 1) // 2 + M * (M - 1) // 2\nprint(ans)\n", "slow_time": 272958752, "fast_time": 12713743, "speedup": 21.4696, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_11"} +{"pair_id": "python_8493", "problem_id": "p03448", "language": "python", "slow_code": "A = int(eval(input()))\nB = int(eval(input()))\nC = int(eval(input()))\nX = int(eval(input()))\n_500 = 500\n_100 = 100\n_50 = 50\ncount = 0\nfor a in range(A + 1):\n for b in range(B + 1):\n for c in range(C + 1):\n if X - (a * _500 + b * _100 + c * _50) == 0:\n count = count + 1\nprint(count)\n", "fast_code": "def main():\n a = int(eval(input()))\n b = int(eval(input()))\n c = int(eval(input()))\n x = int(eval(input()))\n ans = 0\n for i in range(a + 1):\n I = i * 500\n if I > x:\n break\n for j in range(b + 1):\n J = j * 100\n if I + J > x:\n break\n for k in range(c + 1):\n K = k * 50\n if I + J + K == x:\n ans += 1\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 7957260660, "fast_time": 1402096297, "speedup": 5.6753, "source": "python_benchmark", "slow_submission_id": "sol_16", "fast_submission_id": "sol_24"} +{"pair_id": "python_3417", "problem_id": "p02556", "language": "python", "slow_code": "input = __import__(\"sys\").stdin.readline\n\n\ndef getdist(a, b):\n return abs(a[0] - b[0]) + abs(a[1] - b[1])\n\n\nn = int(eval(input()))\ns = []\nfor _ in range(n):\n s.append([*list(map(int, input().split()))])\nans = 0\nsx = sorted(s)\nsy = sorted(s, key=lambda x: x[1])\nans = max(ans, getdist(sx[-1], sx[-2]))\nans = max(ans, getdist(sx[0], sx[1]))\nans = max(ans, getdist(sy[-1], sy[-2]))\nans = max(ans, getdist(sy[0], sy[1]))\n\n\ndef ff1(x):\n return x[0] + x[1]\n\n\ndef ff2(x):\n return x[0] - x[1]\n\n\nf1 = sorted(s, key=ff1)\nf2 = sorted(s, key=ff2)\nans = max(ans, getdist(f1[0], f1[-1]))\nans = max(ans, getdist(f1[0], f1[1]))\nans = max(ans, getdist(f1[-1], f1[-2]))\nans = max(ans, getdist(f2[0], f2[-1]))\nans = max(ans, getdist(f2[0], f2[1]))\nans = max(ans, getdist(f2[-1], f2[-2]))\n\n\ndef ff1(x):\n return abs(x[0] + x[1])\n\n\ndef ff2(x):\n return abs(x[0] - x[1])\n\n\nf1 = sorted(s, key=ff1)\nf2 = sorted(s, key=ff2)\nans = max(ans, getdist(f1[0], f1[-1]))\nans = max(ans, getdist(f1[0], f1[1]))\nans = max(ans, getdist(f1[-1], f1[-2]))\nans = max(ans, getdist(f2[0], f2[-1]))\nans = max(ans, getdist(f2[0], f2[1]))\nans = max(ans, getdist(f2[-1], f2[-2]))\nprint(ans)\n", "fast_code": "import sys\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\nN = I()\nA, B = [], []\nfor i in range(N):\n x, y = MI()\n A.append(x + y)\n B.append(x - y)\nprint((max(max(A) - min(A), max(B) - min(B))))\n", "slow_time": 146157102, "fast_time": 34955603, "speedup": 4.1812, "source": "python_benchmark", "slow_submission_id": "sol_28", "fast_submission_id": "sol_12"} +{"pair_id": "python_2274", "problem_id": "p02700", "language": "python", "slow_code": "from math import floor, ceil, sqrt, factorial, log\nfrom collections import Counter, deque\nfrom functools import reduce\n\n\ndef S():\n return eval(input())\n\n\ndef I():\n return int(eval(input()))\n\n\ndef MS():\n return list(map(str, input().split()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef FLI():\n return [int(i) for i in input().split()]\n\n\ndef LS():\n return list(MS())\n\n\ndef LI():\n return list(MI())\n\n\ndef LLS():\n return [list(map(str, l.split())) for l in eval(input())]\n\n\ndef LLI():\n return [list(map(int, l.split())) for l in eval(input())]\n\n\ndef LLSN(n: int):\n return [LS() for _ in range(n)]\n\n\ndef LLIN(n: int):\n return [LI() for _ in range(n)]\n\n\nA, B, C, D = MI()\nx = -(-A // D)\ny = -(-C // B)\nif x >= y:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "fast_code": "A, B, C, D = list(map(int, input().split()))\nprint((\"No\" if -A // D > -C // B else \"Yes\"))\n", "slow_time": 100220167, "fast_time": 12330251, "speedup": 8.128, "source": "python_benchmark", "slow_submission_id": "sol_6", "fast_submission_id": "sol_1"} +{"pair_id": "python_4308", "problem_id": "p03264", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nK = I()\na = K // 2\nb = K - a\nprint((a * b))\n", "fast_code": "K = int(eval(input()))\nprint(((K // 2) * ((K + 1) // 2)))\n", "slow_time": 49070072, "fast_time": 10503148, "speedup": 4.6719, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_25"} +{"pair_id": "python_244", "problem_id": "p03061", "language": "python", "slow_code": "import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools\nimport random\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 10**9 + 7\ndd = [(-1, 0), (0, 1), (1, 0), (0, -1)]\nddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef LI_():\n return [int(x) - 1 for x in sys.stdin.readline().split()]\n\n\ndef LF():\n return [float(x) for x in sys.stdin.readline().split()]\n\n\ndef LS():\n return sys.stdin.readline().split()\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef F():\n return float(sys.stdin.readline())\n\n\ndef S():\n return input()\n\n\ndef pf(s):\n return print(s, flush=True)\n\n\nclass Prime:\n def __init__(self, n):\n self.M = m = int(math.sqrt(n)) + 10\n self.A = a = [True] * m\n a[0] = a[1] = False\n self.T = t = []\n for i in range(2, int(math.sqrt(m)) + 1):\n if not a[i]:\n continue\n t.append(i)\n for j in range(i * i, m, i):\n a[j] = False\n\n def is_prime(self, n):\n return self.A[n]\n\n def division(self, n):\n d = collections.defaultdict(int)\n for c in self.T:\n while n % c == 0:\n d[c] += 1\n n //= c\n if n < 2:\n break\n if n > 1:\n d[n] += 1\n return d.items()\n\n def sowa(self, n):\n r = 1\n for k, v in self.division(n):\n t = 1\n for i in range(1, v + 1):\n t += math.pow(k, i)\n r *= t\n return r\n\n\ndef main():\n n = I()\n a = sorted(LI())\n pr = Prime(10**9)\n p = collections.defaultdict(int)\n for b in a:\n r = [1]\n for k, v in pr.division(b):\n for c in r[:]:\n for i in range(1, v + 1):\n r.append(c * (k**i))\n for k in r:\n p[k] += 1\n r = 1\n for k, v in p.items():\n if v >= n - 1 and r < k:\n r = k\n return r\n\n\nprint(main())\n", "fast_code": "N = int(eval(input()))\nA = [int(i) for i in input().split()]\n\n\ndef gcd(x, y):\n if x < y:\n x, y = y, x\n if y == 0:\n return x\n return gcd(x % y, y)\n\n\nL = [0]\nR = [0]\nfor i in range(N):\n L.append(gcd(A[i], L[i]))\n R.append(gcd(A[-i - 1], R[i]))\nR.reverse()\nM = []\nfor i in range(0, N):\n M.append(gcd(L[i], R[i + 1]))\nprint((max(M)))\n", "slow_time": 1034266124, "fast_time": 51394366, "speedup": 20.1241, "source": "python_benchmark", "slow_submission_id": "sol_17", "fast_submission_id": "sol_27"} +{"pair_id": "python_595", "problem_id": "p02793", "language": "python", "slow_code": "import sys\nimport math\nfrom bisect import bisect_right as br\nfrom bisect import bisect_left as bl\n\nsys.setrecursionlimit(2147483647)\nfrom heapq import heappush, heappop, heappushpop\nfrom collections import defaultdict\nfrom itertools import accumulate\nfrom collections import Counter\nfrom collections import deque\nfrom operator import itemgetter\nfrom itertools import permutations\n\nmod = 10**9 + 7\ninf = float(\"inf\")\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().split()))\n\n\ndef factorization(n):\n arr = []\n temp = n\n for i in range(2, int(-(-(n**0.5) // 1)) + 1):\n if temp % i == 0:\n cnt = 0\n while temp % i == 0:\n cnt += 1\n temp //= i\n arr.append((i, cnt))\n if temp != 1:\n arr.append((temp, 1))\n if arr == []:\n arr.append((n, 1))\n return arr\n\n\nn = I()\na = LI()\nlst = [0] * (10**6 + 1)\nfor i in a:\n l = factorization(i)\n for j, k in l:\n lst[j] = max(lst[j], k)\nt = 1\nfor i in range(1, 10**6 + 1):\n if lst[i] != 0:\n t = t * (i ** lst[i]) % mod\nans = 0\nfor i in a:\n ans += t * pow(i, mod - 2, mod) % mod\n ans %= mod\nprint(ans)\n", "fast_code": "from functools import reduce\n\nMOD = 10**9 + 7\n\n\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n\ndef lcm(x, y):\n return (x * y) // gcd(x, y)\n\n\ndef gcd_list(numbers):\n return reduce(gcd, numbers)\n\n\ndef lcm_list(numbers):\n return reduce(lcm, numbers)\n\n\nn = int(eval(input()))\na = list(map(int, input().split()))\nlcm_ = lcm_list(a)\nb = list([lcm_ // x for x in a])\nans = 0\nfor i in range(len(b)):\n ans += b[i]\nprint((ans % MOD))\n", "slow_time": 23832997042, "fast_time": 32080020, "speedup": 742.9234, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_21"} +{"pair_id": "python_10523", "problem_id": "p02657", "language": "python", "slow_code": "import numpy as np\nimport scipy as sp\nimport math\n\na, b = list(map(str, input().split()))\na = int(a)\nb = int(float(b) * 100.001)\nans = int(a * b // 100)\nprint(ans)\n", "fast_code": "a, b = list(map(float, input().split()))\nprint((int(a * b // 1)))\n", "slow_time": 601968667, "fast_time": 7679828, "speedup": 78.3831, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_15"} +{"pair_id": "python_6675", "problem_id": "p00100", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys\n\n\ndef solve(data):\n result = []\n total_sales = [0 for _ in range(4000 + 1)]\n for id, unit_price, quantity in data:\n total_sales[id] += unit_price * quantity\n if total_sales[id] >= 1000000:\n if id not in result:\n result.append(id)\n\n return result\n\n\ndef main(args):\n\n while True:\n num = int(eval(input()))\n if num == 0:\n break\n data = []\n for _ in range(num):\n data.append([int(x) for x in input().split(\" \")])\n result = solve(data)\n if result:\n for ele in result:\n print(ele)\n else:\n print(\"NA\")\n\n\nif __name__ == \"__main__\":\n main(sys.argv[1:])\n", "fast_code": "while True:\n n = int(eval(input()))\n if n == 0:\n break\n d = dict()\n sep = []\n for _ in range(n):\n i, p, q = list(map(int, input().split()))\n if i in d:\n d[i] += p * q\n else:\n d[i] = p * q\n sep.append(i)\n tmp = list([x for x in list(d.items()) if x[1] >= 1000000])\n if len(tmp):\n tmp = {t[0]: t[1] for t in tmp}\n for s in sep:\n if s in tmp:\n print(s)\n else:\n print(\"NA\")\n", "slow_time": 212744608, "fast_time": 64682813, "speedup": 3.289, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_3"} +{"pair_id": "python_3661", "problem_id": "p02786", "language": "python", "slow_code": "import sys\nimport math\nimport os\nimport itertools\nimport string\nimport heapq\nimport _collections\nfrom collections import Counter\nfrom collections import defaultdict\nfrom collections import deque\nfrom functools import lru_cache\nimport bisect\nimport re\nimport queue\nimport copy\nimport decimal\n\n\nclass Scanner:\n @staticmethod\n def int():\n return int(sys.stdin.readline().rstrip())\n\n @staticmethod\n def string():\n return sys.stdin.readline().rstrip()\n\n @staticmethod\n def map_int():\n return [int(x) for x in Scanner.string().split()]\n\n @staticmethod\n def string_list(n):\n return [Scanner.string() for i in range(n)]\n\n @staticmethod\n def int_list_list(n):\n return [Scanner.map_int() for i in range(n)]\n\n @staticmethod\n def int_cols_list(n):\n return [Scanner.int() for i in range(n)]\n\n\ndef solve():\n N = Scanner.int()\n ans = 0\n tmp = 1\n while N > 1:\n ans += tmp\n tmp *= 2\n N //= 2\n ans += tmp\n print(ans)\n\n\ndef main():\n\n solve()\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "h = int(eval(input()))\ncnt = 0\nwhile h > 0:\n if h == 1:\n cnt += 1\n break\n else:\n h //= 2\n cnt += 1\nprint((2**cnt - 1))\n", "slow_time": 97773077, "fast_time": 19218319, "speedup": 5.0875, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_8"} +{"pair_id": "python_15027", "problem_id": "p03212", "language": "python", "slow_code": "n = int(eval(input()))\nln = len(str(n))\nsft = \"7530\"\ncnt = 0\n\n\ndef dfs(ln, s):\n global cnt\n if ln == 0:\n if \"7\" in s and \"5\" in s and \"3\" in s:\n if \"0\" in str(int(s)):\n return\n if n >= int(s):\n cnt += 1\n return\n for e in sft:\n dfs(ln - 1, s + e)\n\n\ndfs(ln, \"\")\nprint(cnt)\n", "fast_code": "N = int(eval(input()))\n\n\ndef dfs(s):\n if int(s) > N:\n return 0\n ans = 1 if all(s.count(c) > 0 for c in \"753\") else 0\n for c in \"753\":\n ans += dfs(s + c)\n return ans\n\n\nprint((dfs(\"0\")))\n", "slow_time": 16700374702, "fast_time": 2507015389, "speedup": 6.6615, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_4"} +{"pair_id": "python_11845", "problem_id": "p03150", "language": "python", "slow_code": "import re\nfrom sys import stdin\n\nN = stdin.readline().rstrip()\nfor i in range(7):\n mae = \"keyence\"[0 : i + 1]\n ato = \"keyence\"[i + 1 : 8]\n if re.search(\".*keyencekeyence\", N):\n if (re.sub(\".*keyencekeyence\", \"\", N) == \"\") == True:\n print(\"YES\")\n break\n if re.search(\"keyencekeyence.*\", N):\n if (re.sub(\"keyencekeyence.*\", \"\", N) == \"\") == True:\n print(\"YES\")\n break\n if (re.sub(\".*keyence\", \"\", N) == \"\") == True:\n print(\"YES\")\n break\n if (re.sub(\"keyence.*\", \"\", N) == \"\") == True:\n print(\"YES\")\n break\n if re.match(\"%s.*%s\" % (mae, ato), N):\n if (re.sub(\"%s.*%s\" % (mae, ato), \"\", N) == \"\") == True:\n print(\"YES\")\n break\nif i == 6:\n print(\"NO\")\n", "fast_code": "S = input().strip()\nN = len(S)\nx = \"keyence\"\nn = len(x)\nif N < n:\n flag = 0\nelse:\n flag = 0\n for i in range(7):\n for j in range(1, 8):\n if S[:i] + S[-j:] == x:\n flag = 1\n break\n if flag == 1:\n break\nif flag == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "slow_time": 137922673, "fast_time": 36687895, "speedup": 3.7594, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_21"} +{"pair_id": "python_11512", "problem_id": "p02621", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\na = I()\nprint((a + a**2 + a**3))\n", "fast_code": "s = int(input())\nprint(s + s**2 + s**3)\n", "slow_time": 44676795, "fast_time": 7277371, "speedup": 6.1391, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_29"} +{"pair_id": "python_13583", "problem_id": "p03260", "language": "python", "slow_code": "from collections import defaultdict, deque\nimport sys, heapq, bisect, math, itertools, string, queue, datetime\n\nsys.setrecursionlimit(10**8)\nINF = float(\"inf\")\nmod = 10**9 + 7\neps = 10**-7\n\n\ndef inpl():\n return list(map(int, input().split()))\n\n\ndef inpls():\n return list(input().split())\n\n\nA, B = inpl()\nif (A * B) % 2 == 0:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "fast_code": "a, b = list(map(int, input().split()))\nif a * b % 2:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "slow_time": 21432741, "fast_time": 7530657, "speedup": 2.8461, "source": "python_benchmark", "slow_submission_id": "sol_8", "fast_submission_id": "sol_16"} +{"pair_id": "python_3799", "problem_id": "p03564", "language": "python", "slow_code": "N = int(eval(input()))\nK = int(eval(input()))\nmin_m = 10**10\nfor i in range(2**N):\n m = 1\n for n in range(N):\n if i & (1 << n):\n m *= 2\n else:\n m += K\n min_m = min(min_m, m)\nprint(min_m)\n", "fast_code": "n = int(eval(input()))\nk = int(eval(input()))\nr = 1\nfor _ in [0] * n:\n r += min(r, k)\nprint(r)\n", "slow_time": 620758240, "fast_time": 19514063, "speedup": 31.8108, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_18"} +{"pair_id": "python_12061", "problem_id": "p00008", "language": "python", "slow_code": "while True:\n try:\n n = int(eval(input()))\n except:\n break\n ans = 0\n for a in range(10):\n for b in range(10):\n for c in range(10):\n d = n - (a + b + c)\n ans += 0 <= d <= 9\n print(ans)\n", "fast_code": "import sys\n\na = [0] * 51\nfor i in range(19):\n a[i] = a[36 - i] = (i + 3) * (i + 2) * (i + 1) // 6 - max(\n 2 * (i - 9) * (i - 8) * (i - 7) // 3, 0\n )\nfor e in sys.stdin:\n print((a[int(e)]))\n", "slow_time": 251710823, "fast_time": 26712620, "speedup": 9.4229, "source": "python_benchmark", "slow_submission_id": "sol_22", "fast_submission_id": "sol_3"} +{"pair_id": "python_9810", "problem_id": "p03806", "language": "python", "slow_code": "import fractions\n\nn, ma, mb = list(map(int, input().split()))\na = [0] * (n + 1)\nb = [0] * (n + 1)\nc = [0] * (n + 1)\nfor i in range(1, n + 1):\n a[i], b[i], c[i] = list(map(int, input().split()))\n\ndp = [[[10**15 for i in range(n + 1)] for j in range(401)] for k in range(401)]\ndp[0][0][0] = 0\nsa = [0] * (n + 1)\nsb = [0] * (n + 1)\nfor i in range(1, n + 1):\n for j in range(401):\n for k in range(401):\n if j < a[i] or k < b[i]:\n dp[k][j][i] = dp[k][j][i - 1]\n else:\n dp[k][j][i] = min(dp[k][j][i - 1], dp[k - b[i]][j - a[i]][i - 1] + c[i])\ni = 1\nans = 10**15\nwhile True:\n if i * ma > 400 or i * mb > 400:\n break\n ans = min(ans, dp[i * mb][i * ma][n])\n i += 1\nif ans == 10**15:\n ans = -1\nprint(ans)\n\"\"\"\"\"\"\n", "fast_code": "import sys\n\nINF = float(\"inf\")\nn, ma, mb = list(map(int, sys.stdin.readline().split()))\na, b, c = [], [], []\nfor _ in range(n):\n ai, bi, ci = list(map(int, sys.stdin.readline().split()))\n a.append(ai)\n b.append(bi)\n c.append(ci)\n\n\ndef main():\n sa = sum(a)\n sb = sum(b)\n res = [[[INF] * (sb + 1) for _ in range(sa + 1)] for _ in range(n + 1)]\n res[0][0][0] = 0\n for i in range(n):\n for j in range(sa + 1):\n for k in range(sb + 1):\n if j >= a[i] and k >= b[i]:\n res[i + 1][j][k] = min(\n res[i][j - a[i]][k - b[i]] + c[i], res[i][j][k]\n )\n else:\n res[i + 1][j][k] = res[i][j][k]\n ans = INF\n for i in range(1, min(sa // ma, sb // mb) + 1):\n ans = min(ans, res[n][ma * i][mb * i])\n if ans == INF:\n return -1\n else:\n return ans\n\n\nif __name__ == \"__main__\":\n ans = main()\n print(ans)\n", "slow_time": 77612704184, "fast_time": 63742024, "speedup": 1217.6065, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_22"} +{"pair_id": "python_16545", "problem_id": "p03274", "language": "python", "slow_code": "import sys\nimport math\nimport bisect\nimport queue\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\ndef solve(X, K):\n N = len(X)\n cumsum = [0 for _ in range(N)]\n for i in range(1, N):\n cumsum[i] = abs(X[i] - X[i - 1]) + cumsum[i - 1]\n idx_zero = bisect.bisect_left(X, 0)\n ret = 1000000005\n for i in range(0, N):\n if X[i] >= 0:\n break\n res = -X[i]\n k = idx_zero - i\n if (k < K) and (idx_zero + K - k - 1 < N):\n res += cumsum[idx_zero + K - k - 1] - cumsum[i]\n ret = min(ret, res)\n return ret\n\n\nif __name__ == \"__main__\":\n N, K = list(map(int, input().split()))\n X = list(map(int, input().split()))\n res = 1000000005\n if min(X) >= 0:\n print((X[K - 1]))\n elif max(X) <= 0:\n X = X[::-1]\n print((-X[K - 1]))\n else:\n res = min(res, solve(X, K))\n X = [-x for x in X]\n res = min(res, solve(X[::-1], K))\n print(res)\n", "fast_code": "n, k = list(map(int, input().split()))\nx = list(map(int, input().split()))\narr = []\nfor i in range(n - k + 1):\n arr.append(\n min(\n (abs(x[i]) + abs(x[i] - x[i + k - 1])),\n abs(x[i + k - 1]) + abs(x[i] - x[i + k - 1]),\n )\n )\nprint((min(arr)))\n", "slow_time": 92211709, "fast_time": 32423230, "speedup": 2.844, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_1"} +{"pair_id": "python_5982", "problem_id": "p03566", "language": "python", "slow_code": "n = int(eval(input()))\nT = list(map(int, input().split()))\nV = list(map(int, input().split()))\ndp = [[-1] * 102 for _ in range(sum(T) + 1)]\ndp[0][0] = 0\nnt = 0\npt = T[0]\n\ndelta = [-1, 0, 1]\nfor i in range(sum(T)):\n if pt == i:\n nt += 1\n pt += T[nt]\n for j in range(101):\n if j > V[nt] or dp[i][j] == -1:\n break\n for d in delta:\n nj = j + d\n if 0 <= nj <= V[nt]:\n if d != 0 or j == V[nt]:\n dp[i + 1][nj] = max(dp[i + 1][nj], dp[i][j] + (j + nj) / 2)\n else:\n dp[i + 1][nj] = max(dp[i + 1][nj], dp[i][j] + j + 0.25)\nprint((dp[-1][0]))\n", "fast_code": "from sys import stdin\n\n\ndef solve(ts, vs):\n if len(ts) == 0:\n return 0.0\n time = sum(ts)\n limit = min(vs)\n if time / 2.0 <= limit:\n return (time / 2.0) ** 2\n\n if limit == 0:\n\n vzero = [i for i in range(len(vs)) if vs[i] == 0][0]\n return solve(ts[:vzero], vs[:vzero]) + solve(ts[vzero + 1 :], vs[vzero + 1 :])\n\n ts[0] -= 1\n ts[-1] -= 1\n\n if ts[-1] == 0:\n ts = ts[:-1]\n vs = vs[:-1]\n if ts[0] == 0:\n ts = ts[1:]\n vs = vs[1:]\n\n vs = [v - 1 for v in vs]\n\n dist = time - 2 + 1\n return dist + solve(ts, vs)\n\n\ndef splitToInt(line):\n words = line.strip().split()\n return [int(w) for w in words]\n\n\nN = int(stdin.readline())\nts = splitToInt(stdin.readline())\nvs = splitToInt(stdin.readline())\nif len(ts) != N or len(vs) != N:\n raise\nprint(solve(ts, vs))\n", "slow_time": 4557267717, "fast_time": 97227414, "speedup": 46.8723, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_5"} +{"pair_id": "python_16042", "problem_id": "p03599", "language": "python", "slow_code": "a, b, c, d, e, f = list(map(int, input().split()))\nwater = []\nfor i in range(31):\n for j in range(31):\n if a * i + b * j <= f // 100:\n water.append(a * i + b * j)\nwater.pop(water.index(0))\nwater = list(set(water))\nresult = [[0, 0, 0]]\nfor w in water:\n for i in range(301):\n for j in range(301):\n sugar = c * i + d * j\n if sugar <= w * e and sugar + w * 100 <= f:\n result.append(\n [100 * sugar / (sugar + w * 100), (sugar + w * 100), sugar]\n )\nresult.sort(reverse=True)\nprint((result[0][1], result[0][2]))\n", "fast_code": "A, B, C, D, E, F = list(map(int, input().split()))\nws = set()\ni = j = 0\nwhile True:\n j = 0\n if B * i > F // 100:\n break\n while True:\n w = B * i + A * j\n if w > F // 100:\n break\n ws.add(w)\n j += 1\n i += 1\nws = list(ws)\nws.sort()\nss = set()\ni = j = 0\nwhile True:\n j = 0\n if D * i > F:\n break\n while True:\n s = D * i + C * j\n if s > F:\n break\n ss.add(s)\n j += 1\n i += 1\nss = list(ss)\nss.sort()\nlimit = E / (100 + E)\nwater = A * 100\nsugar = rate = 0\nfor w in ws:\n w = w * 100\n if w == 0:\n continue\n if w > F:\n break\n for s in ss:\n if w + s > F:\n break\n r = s / (w + s)\n if r > limit:\n break\n if r > rate:\n rate = r\n water = w\n sugar = s\nprint((water + sugar, sugar))\n", "slow_time": 20317356372, "fast_time": 3182487779, "speedup": 6.3841, "source": "python_benchmark", "slow_submission_id": "sol_20", "fast_submission_id": "sol_22"} +{"pair_id": "python_12206", "problem_id": "p00008", "language": "python", "slow_code": "import sys\n\nfor e in sys.stdin:\n e = int(e)\n x = list(range(10))\n print((sum([1 for a in x for b in x for c in x for d in x if a + b + c + d == e])))\n", "fast_code": "import sys\n\ntable = {}\n\n\ndef memorize(f):\n global table\n\n def func(*args):\n if not args in table:\n table[args] = f(*args)\n return table[args]\n\n return func\n\n\n@memorize\ndef dfs(a, b):\n if a == 0:\n return 1\n elif b == 0 or a < 0:\n return 0\n return sum([dfs(a - i, b - 1) for i in range(10)])\n\n\nfor i in sys.stdin.readlines():\n print(dfs(int(i.strip()), 4))\n", "slow_time": 607385976, "fast_time": 124200677, "speedup": 4.8904, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_1"} +{"pair_id": "python_14121", "problem_id": "p02741", "language": "python", "slow_code": "def main():\n A = [\n 1,\n 1,\n 1,\n 2,\n 1,\n 2,\n 1,\n 5,\n 2,\n 2,\n 1,\n 5,\n 1,\n 2,\n 1,\n 14,\n 1,\n 5,\n 1,\n 5,\n 2,\n 2,\n 1,\n 15,\n 2,\n 2,\n 5,\n 4,\n 1,\n 4,\n 1,\n 51,\n ]\n N = int(eval(input()))\n print((A[N - 1]))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "print((b\"\u0004\u0001\u000e 3\u0001\u0002 \u0005 \u000f \u0005\"[int(eval(input())) % 14]))\n", "slow_time": 18736070, "fast_time": 5394967, "speedup": 3.4729, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_7"} +{"pair_id": "python_565", "problem_id": "p02793", "language": "python", "slow_code": "import sys\nfrom collections import defaultdict, Counter\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10**9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n N, *A = list(map(int, read().split()))\n N_MAX = 10**6\n min_factor = list(range(N_MAX + 1))\n min_factor[2::2] = [2] * (N_MAX // 2)\n for i in range(3, int(N_MAX**0.5) + 2, 2):\n if min_factor[i] != i:\n continue\n for j in range(i * i, N_MAX + 1, 2 * i):\n if min_factor[j] > i:\n min_factor[j] = i\n\n def prime_factorize_fast(n):\n a = Counter()\n while n != 1:\n f = min_factor[n]\n p = 0\n while min_factor[n] == f:\n p += 1\n n //= f\n a[f] = p\n return a\n\n lcm_prime = Counter()\n for a in A:\n for p, n in list(prime_factorize_fast(a).items()):\n if lcm_prime[p] < n:\n lcm_prime[p] = n\n l = 1\n for p, n in list(lcm_prime.items()):\n l = l * pow(p, n, MOD) % MOD\n ans = 0\n for a in A:\n ans = (ans + pow(a, MOD - 2, MOD)) % MOD\n ans = ans * l % MOD\n print(ans)\n return\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n\ndef lcm(a, b):\n return a * b // gcd(a, b)\n\n\nn = int(eval(input()))\na = list(map(int, input().split()))\nans = 0\nmod = 10**9 + 7\nl = a[0]\nfor i in range(1, n):\n l = lcm(l, a[i])\nfor i in a:\n ans += l * pow(i, mod - 2, mod) % mod\n ans %= mod\nprint(ans)\n", "slow_time": 15406033946, "fast_time": 27034767, "speedup": 569.8601, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_19"} +{"pair_id": "python_12157", "problem_id": "p00008", "language": "python", "slow_code": "import sys\n\na = [0] * 51\nx = list(range(10))\nfor i in range(51):\n a[i] = sum([1 for p in x for q in x for r in x for s in x if p + q + r + s == i])\nfor e in sys.stdin:\n print((a[int(e)]))\n", "fast_code": "import sys\n\nA = list(range(10))\nfor n in map(int, sys.stdin):\n x = 0\n for a in A:\n d = n - a\n if 0 > d or d > 27:\n continue\n for b in A:\n e = d - b\n if 0 > e or e > 18:\n continue\n for c in A:\n if (e - c) in A:\n x += 1\n print(x)\n", "slow_time": 14930700146, "fast_time": 76834423, "speedup": 194.3231, "source": "python_benchmark", "slow_submission_id": "sol_27", "fast_submission_id": "sol_20"} +{"pair_id": "python_5299", "problem_id": "p03997", "language": "python", "slow_code": "from collections import deque\nfrom heapq import heapify, heappop, heappush, heappushpop\nfrom copy import copy, deepcopy\nfrom itertools import product, permutations, combinations, combinations_with_replacement\nfrom collections import defaultdict, Counter\nfrom bisect import bisect_left, bisect_right\n\n\nfrom functools import reduce\nfrom pprint import pprint\n\nINF = float(\"inf\")\n\n\ndef myinput():\n return list(map(int, input().split()))\n\n\ndef mylistinput(n):\n return [list(myinput()) for _ in range(n)]\n\n\ndef mycol(data, col):\n return [row[col] for row in data]\n\n\ndef mysort(data, col, reverse_flag):\n data.sort(key=lambda x: x[col], reverse=reverse_flag)\n return data\n\n\ndef mymax(data):\n M = -1 * float(\"inf\")\n for i in range(len(data)):\n m = max(data[i])\n M = max(M, m)\n return M\n\n\ndef mymin(data):\n m = float(\"inf\")\n for i in range(len(data)):\n M = min(data[i])\n m = min(m, M)\n return m\n\n\ndef mycount(ls, x):\n\n l = bisect_left(ls, x)\n r = bisect_right(ls, x)\n return r - l\n\n\ndef myoutput(ls, space=True):\n if space:\n if len(ls) == 0:\n print(\" \")\n elif type(ls[0]) == str:\n print((\" \".join(ls)))\n elif type(ls[0]) == int:\n print((\" \".join(map(str, ls))))\n else:\n print(\"Output Error\")\n else:\n if len(ls) == 0:\n print(\"\")\n elif type(ls[0]) == str:\n print((\"\".join(ls)))\n elif type(ls[0]) == int:\n print((\"\".join(map(str, ls))))\n else:\n print(\"Output Error\")\n\n\na = int(eval(input()))\nb = int(eval(input()))\nh = int(eval(input()))\nans = (a + b) * h / 2\nprint((int(ans)))\n", "fast_code": "a = int(eval(input()))\nb = int(eval(input()))\nc = int(eval(input()))\nprint(((a + b) * c // 2))\n", "slow_time": 157783046, "fast_time": 20080806, "speedup": 7.8574, "source": "python_benchmark", "slow_submission_id": "sol_18", "fast_submission_id": "sol_4"} +{"pair_id": "python_16085", "problem_id": "p03317", "language": "python", "slow_code": "from collections import Counter\nfrom math import *\n\nN, K = [int(x) for x in input().strip().split()]\nA = [int(x) for x in input().strip().split()]\nA.sort()\nc = Counter(A)\nminc = c[A[0]]\nres = len(A) - minc\nprint((ceil(res / (K - 1))))\n", "fast_code": "N, K = list(map(int, input().split()))\nprint(((N - 2) // (K - 1) + 1))\n", "slow_time": 21694584, "fast_time": 5990806, "speedup": 3.6213, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_23"} +{"pair_id": "python_17499", "problem_id": "p02615", "language": "python", "slow_code": "import sys\nimport math\nfrom bisect import bisect_left\nfrom bisect import bisect_right\nfrom collections import defaultdict\nfrom heapq import heappop, heappush\nimport itertools\nimport random\nfrom collections import deque\nfrom decimal import *\nimport queue\n\ninput = sys.stdin.readline\n\n\ndef inputInt():\n return int(eval(input()))\n\n\ndef inputMap():\n return list(map(int, input().split()))\n\n\ndef inputList():\n return list(map(int, input().split()))\n\n\ndef inputStr():\n return input()[:-1]\n\n\ninf = float(\"inf\")\nmod = 1000000007\n\n\ndef main():\n N = inputInt()\n A = inputList()\n A.sort()\n A = A[::-1]\n ans = 0\n maxs = 0\n cnt = 0\n fst = True\n ansans = []\n pgt = queue.Queue()\n for i, val in enumerate(A):\n if i == 0:\n pgt.put(val)\n else:\n tmp = pgt.get()\n ansans.append(tmp)\n pgt.put(val)\n if tmp == val:\n pgt.put(val)\n else:\n pgt.put(val)\n\n print((sum(ansans)))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "n = int(eval(input()))\na = sorted(map(int, input().split()), reverse=True)\nans, que, cnt = 0, [a[0]], 0\nfor i in a[1:]:\n ans += que[cnt]\n que += [i, i]\n cnt += 1\nprint(ans)\n", "slow_time": 95233537, "fast_time": 26493943, "speedup": 3.5945, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_2"} +{"pair_id": "python_16580", "problem_id": "p02845", "language": "python", "slow_code": "_, a = open(0)\nc = 1\nd = [3] + [0] * 10**6\nfor a in map(int, a.split()):\n c = c * d[a] % (10**9 + 7)\n d[a] -= 1\n d[a + 1] += 1\nprint(c)\n", "fast_code": "N = int(eval(input()))\nA = list(map(int, input().split()))\nc = [-1, -1, -1]\nsum = 1\ntmp = 0\nfor a in A:\n sum = sum * c.count(a - 1) % 1000000007\n if a - 1 == c[0]:\n c[0] += 1\n tmp = c.count(c[0] - 1) + 1\n elif a - 1 == c[1]:\n c[1] += 1\n tmp = c.count(c[1] - 1) + 1\n elif a - 1 == c[2]:\n c[2] += 1\n tmp = c.count(c[2] - 1) + 1\nprint(sum)\n", "slow_time": 815333677, "fast_time": 43777284, "speedup": 18.6246, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_25"} +{"pair_id": "python_580", "problem_id": "p02793", "language": "python", "slow_code": "N = int(eval(input()))\n(*A,) = list(map(int, input().split()))\nM = 10**3\nP = []\nisp = [True] * M\nfor n in range(2, M):\n if isp[n] == False:\n continue\n P.append(n)\n for m in range(n * n, M, n):\n isp[m] = False\nfrom collections import defaultdict\n\nD = [defaultdict(int) for _ in range(N)]\nfor i in range(N):\n a = A[i]\n for p in P:\n while a > 1:\n if a % p == 0:\n D[i][p] += 1\n a //= p\n else:\n break\n else:\n break\n if a > 1:\n D[i][a] += 1\nd = defaultdict(int)\nfor i in range(N):\n for k, v in list(D[i].items()):\n d[k] = max(d[k], v)\nMOD = 10**9 + 7\n\n\nclass Mint:\n def __init__(self, value=0):\n self.value = value % MOD\n if self.value < 0:\n self.value += MOD\n\n @staticmethod\n def get_value(x):\n return x.value if isinstance(x, Mint) else x\n\n def inverse(self):\n a, b = self.value, MOD\n u, v = 1, 0\n while b:\n t = a // b\n b, a = a - t * b, b\n v, u = u - t * v, v\n if u < 0:\n u += MOD\n return u\n\n def __repr__(self):\n return str(self.value)\n\n def __eq__(self, other):\n return self.value == other.value\n\n def __neg__(self):\n return Mint(-self.value)\n\n def __hash__(self):\n return hash(self.value)\n\n def __bool__(self):\n return self.value != 0\n\n def __iadd__(self, other):\n self.value += Mint.get_value(other)\n if self.value >= MOD:\n self.value -= MOD\n return self\n\n def __add__(self, other):\n new_obj = Mint(self.value)\n new_obj += other\n return new_obj\n\n __radd__ = __add__\n\n def __isub__(self, other):\n self.value -= Mint.get_value(other)\n if self.value < 0:\n self.value += MOD\n return self\n\n def __sub__(self, other):\n new_obj = Mint(self.value)\n new_obj -= other\n return new_obj\n\n def __rsub__(self, other):\n new_obj = Mint(Mint.get_value(other))\n new_obj -= self\n return new_obj\n\n def __imul__(self, other):\n self.value = self.value * Mint.get_value(other) % MOD\n return self\n\n def __mul__(self, other):\n new_obj = Mint(self.value)\n new_obj *= other\n return new_obj\n\n __rmul__ = __mul__\n\n def __ifloordiv__(self, other):\n other = other if isinstance(other, Mint) else Mint(other)\n self *= other.inverse()\n return self\n\n def __floordiv__(self, other):\n new_obj = Mint(self.value)\n new_obj //= other\n return new_obj\n\n def __rfloordiv__(self, other):\n new_obj = Mint(Mint.get_value(other))\n new_obj //= self\n return new_obj\n\n\ngcd = Mint(1)\nfor k, v in list(d.items()):\n gcd *= pow(k, v, MOD)\nprint((sum([gcd // a for a in A])))\n", "fast_code": "import sys\nfrom math import gcd\n\nsys.setrecursionlimit(10**7)\ninput = sys.stdin.readline\nf_inf = float(\"inf\")\nmod = 10**9 + 7\n\n\ndef lcm(a, b):\n return a * b // gcd(a, b)\n\n\ndef resolve():\n n = int(eval(input()))\n A = list(map(int, input().split()))\n L = 1\n for a in A:\n L = lcm(L, a)\n res = 0\n for a in A:\n res += L * pow(a, mod - 2, mod)\n res %= mod\n print(res)\n\n\nif __name__ == \"__main__\":\n resolve()\n", "slow_time": 211446927, "fast_time": 29358966, "speedup": 7.2021, "source": "python_benchmark", "slow_submission_id": "sol_10", "fast_submission_id": "sol_0"} +{"pair_id": "python_2344", "problem_id": "p03807", "language": "python", "slow_code": "import sys\n\n\ndef debug(x, table):\n for name, val in table.items():\n if x is val:\n print(\"DEBUG:{} -> {}\".format(name, val), file=sys.stderr)\n return None\n\n\ndef solve():\n N = int(input())\n A = [int(i) for i in input().split()]\n num_ev = 0\n num_od = 0\n for a in A:\n if a % 2 == 0:\n num_ev += 1\n else:\n num_od += 1\n if num_od % 2 == 1:\n print(\"NO\")\n return None\n else:\n num_ev += num_od // 2\n if num_ev >= 1:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n solve()\n", "fast_code": "N = int(eval(input()))\nprint((\"YES\" if sum(map(int, input().split())) % 2 == 0 else \"NO\"))\n", "slow_time": 51540011, "fast_time": 14852239, "speedup": 3.4702, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_0"} +{"pair_id": "python_14286", "problem_id": "p03609", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nX, t = MI()\nprint((max(0, X - t)))\n", "fast_code": "x, t = list(map(int, input().split()))\nprint((0 if x <= t else x - t))\n", "slow_time": 52898444, "fast_time": 11240715, "speedup": 4.706, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_3"} +{"pair_id": "python_15372", "problem_id": "p03325", "language": "python", "slow_code": "import sys\n\n\nimport math\n\n\ndef main():\n n, *a = (int(x) for x in sys.stdin.read().split())\n total_count = 0\n for i in range(n):\n current = a[i]\n count = 0\n for _ in range(math.floor(math.log(10**9, 2)) + 1):\n if current % 2 == 0:\n current //= 2\n count += 1\n else:\n break\n total_count += count\n print(total_count)\n\n\nif __name__ == \"__main__\":\n\n main()\n", "fast_code": "N = int(eval(input()))\nk = 0\nfor a in map(int, input().split()):\n while a % 2 == 0:\n k += 1\n a //= 2\nprint(k)\n", "slow_time": 40888841, "fast_time": 19286645, "speedup": 2.1201, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_20"} +{"pair_id": "python_6730", "problem_id": "p00775", "language": "python", "slow_code": "while True:\n R, N = list(map(int, input().split()))\n if not (R | N):\n break\n geta = 20\n buildings = [0] * (geta * 2)\n for _ in range(N):\n xl, xr, h = list(map(int, input().split()))\n for i in range(xl + geta, xr + geta):\n buildings[i] = max(buildings[i], h)\n left, right = 0, 20\n for _ in range(100):\n mid = (left + right) / 2\n flag = True\n for i in range(-R + geta, R + geta):\n if i < geta:\n y = pow(R * R - (i - geta + 1) * (i - geta + 1), 0.5)\n flag &= buildings[i] >= y - R + mid\n else:\n y = pow(R * R - (i - geta) * (i - geta), 0.5)\n flag &= buildings[i] >= y - R + mid\n if flag:\n left = mid\n else:\n right = mid\n print((\"{:.20f}\".format(left)))\n", "fast_code": "while True:\n R, N = list(map(int, input().split()))\n if not (R | N):\n break\n geta = 20\n buildings = [0] * (geta * 2)\n for _ in range(N):\n xl, xr, h = list(map(int, input().split()))\n for i in range(xl + geta, xr + geta):\n buildings[i] = max(buildings[i], h)\n ans = 20\n for i in range(-R + geta, R + geta):\n if i < geta:\n buildings[i] -= pow(R * R - (i - geta + 1) * (i - geta + 1), 0.5) - R\n else:\n buildings[i] -= pow(R * R - (i - geta) * (i - geta), 0.5) - R\n ans = min(ans, buildings[i])\n print(ans)\n", "slow_time": 536358030, "fast_time": 74753886, "speedup": 7.175, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_3"} +{"pair_id": "python_859", "problem_id": "p03556", "language": "python", "slow_code": "import functools\nimport itertools\nimport numpy as np\nimport sys\n\nMAX_INT = int(10e10)\nMIN_INT = -MAX_INT\nmod = 1000000007\nsys.setrecursionlimit(1000000)\n\n\ndef IL():\n return list(map(int, input().split()))\n\n\ndef SL():\n return input().split()\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef S():\n return eval(input())\n\n\nN = I()\nans = [pow(i, 2) for i in range(100000) if pow(i, 2) <= N]\nprint((ans[-1]))\n", "fast_code": "import math\n\ni = int(eval(input()))\nr = math.sqrt(i)\nir = int(r)\nprint((ir * ir))\n", "slow_time": 7046061345, "fast_time": 14440448, "speedup": 487.9392, "source": "python_benchmark", "slow_submission_id": "sol_25", "fast_submission_id": "sol_29"} +{"pair_id": "python_5376", "problem_id": "p02417", "language": "python", "slow_code": "a = [0] * 26\nw = \"abcdefghijklmnopqrstuvwxyz\"\ntry:\n while True:\n s = list(input().upper())\n for i in s:\n if i == \"A\":\n a[0] += 1\n elif i == \"B\":\n a[1] += 1\n elif i == \"C\":\n a[2] += 1\n elif i == \"D\":\n a[3] += 1\n elif i == \"E\":\n a[4] += 1\n elif i == \"F\":\n a[5] += 1\n elif i == \"G\":\n a[6] += 1\n elif i == \"H\":\n a[7] += 1\n elif i == \"I\":\n a[8] += 1\n elif i == \"J\":\n a[9] += 1\n elif i == \"K\":\n a[10] += 1\n elif i == \"L\":\n a[11] += 1\n elif i == \"M\":\n a[12] += 1\n elif i == \"N\":\n a[13] += 1\n elif i == \"O\":\n a[14] += 1\n elif i == \"P\":\n a[15] += 1\n elif i == \"Q\":\n a[16] += 1\n elif i == \"R\":\n a[17] += 1\n elif i == \"S\":\n a[18] += 1\n elif i == \"T\":\n a[19] += 1\n elif i == \"U\":\n a[20] += 1\n elif i == \"V\":\n a[21] += 1\n elif i == \"W\":\n a[22] += 1\n elif i == \"X\":\n a[23] += 1\n elif i == \"Y\":\n a[24] += 1\n elif i == \"Z\":\n a[25] += 1\nexcept EOFError:\n pass\nfor i in range(26):\n print(w[i : i + 1], \":\", str(a[i]))\n", "fast_code": "import sys\n\nstrs = sys.stdin.readlines()\nfor c in range(ord(\"a\"), ord(\"z\") + 1):\n count = 0\n for str in strs:\n count += str.lower().count(chr(c))\n print((\"{0} : {1}\".format(chr(c), count)))\n", "slow_time": 119568489, "fast_time": 31227814, "speedup": 3.8289, "source": "python_benchmark", "slow_submission_id": "sol_23", "fast_submission_id": "sol_0"} +{"pair_id": "python_6642", "problem_id": "p03803", "language": "python", "slow_code": "import sys, math\nfrom functools import lru_cache\nfrom itertools import accumulate\n\nsys.setrecursionlimit(10**9)\nMOD = 10**9 + 7\n\n\ndef input():\n return sys.stdin.readline()[:-1]\n\n\ndef mi():\n return list(map(int, input().split()))\n\n\ndef ii():\n return int(eval(input()))\n\n\ndef i2(n):\n tmp = [list(mi()) for i in range(n)]\n return [list(i) for i in zip(*tmp)]\n\n\nA, B = mi()\nif A == B:\n print(\"Draw\")\nelif A == 1:\n print(\"Alice\")\nelif B == 1:\n print(\"Bob\")\nelse:\n if A > B:\n print(\"Alice\")\n else:\n print(\"Bob\")\n", "fast_code": "A, B = list(map(int, input().split()))\n\nif A == B:\n print(\"Draw\")\n\nelif A == 1 or B != 1 and A > B:\n print(\"Alice\")\n\nelse:\n print(\"Bob\")\n", "slow_time": 58300100, "fast_time": 18091113, "speedup": 3.2226, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_15"} +{"pair_id": "python_13061", "problem_id": "p02783", "language": "python", "slow_code": "h, a = list(map(int, input().split()))\ni = 0\nwhile i < 10**4:\n i += 1\n h = h - a\n if h <= 0:\n print(i)\n break\n", "fast_code": "import math\n\nH, A = list(map(int, input().split()))\n\n\nprint((math.ceil(H / A)))\n", "slow_time": 231756707, "fast_time": 10475887, "speedup": 22.1229, "source": "python_benchmark", "slow_submission_id": "sol_2", "fast_submission_id": "sol_20"} +{"pair_id": "python_306", "problem_id": "p02899", "language": "python", "slow_code": "import sys\n\ninput = sys.stdin.readline\n\n\ndef I():\n return int(eval(input()))\n\n\ndef MI():\n return list(map(int, input().split()))\n\n\ndef LI():\n return list(map(int, input().split()))\n\n\ndef main():\n mod = 10**9 + 7\n N = I()\n A = LI()\n L = []\n for i in range(N):\n L.append([A[i], i])\n L.sort()\n ans = []\n for i in range(N):\n ans.append(L[i][1] + 1)\n print((\" \".join(map(str, ans))))\n\n\nmain()\n", "fast_code": "n = int(input())\na = list(map(int, input().split()))\nlist = [0] * n\nfor i in range(n):\n list[a[i] - 1] = i + 1\nfor i in range(n):\n print(list[i], end=\" \")\n", "slow_time": 40415943, "fast_time": 17437364, "speedup": 2.3178, "source": "python_benchmark", "slow_submission_id": "sol_15", "fast_submission_id": "sol_19"} +{"pair_id": "python_735", "problem_id": "p03945", "language": "python", "slow_code": "import sys\n\ns = sys.stdin.readline().rstrip()\n\n\ndef main():\n prev = \"$\"\n cnt = -1\n for c in s:\n cnt += c != prev\n prev = c\n print(cnt)\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "print((sum(map(input().count, [\"WB\", \"BW\"]))))\n", "slow_time": 19210495, "fast_time": 8142059, "speedup": 2.3594, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_19"} +{"pair_id": "python_736", "problem_id": "p03436", "language": "python", "slow_code": "import sys\nimport queue\n\nsys.setrecursionlimit(1000000)\n\n\ndef s(m, v, q):\n if q.empty():\n return -1\n k, i, j = q.get()\n if i == len(m) - 1 and j == len(m[i]) - 1:\n return k\n if i > 0 and m[i - 1][j] == \".\" and (i - 1, j) not in v:\n q.put((k + 1, i - 1, j))\n v.add((i - 1, j))\n if i < len(m) - 1 and m[i + 1][j] == \".\" and (i + 1, j) not in v:\n q.put((k + 1, i + 1, j))\n v.add((i + 1, j))\n if j > 0 and m[i][j - 1] == \".\" and (i, j - 1) not in v:\n q.put((k + 1, i, j - 1))\n v.add((i, j - 1))\n if j < len(m[i]) - 1 and m[i][j + 1] == \".\" and (i, j + 1) not in v:\n q.put((k + 1, i, j + 1))\n v.add((i, j + 1))\n return s(m, v, q)\n\n\nh, w = list(map(int, input().split()))\nm = [input() for _ in range(h)]\nq = queue.PriorityQueue()\nq.put((1, 0, 0))\nv = set((0, 0))\nc = s(m, v, q)\nif c == -1:\n print(-1)\nelse:\n print(h * w - c - sum([r.count(\"#\") for r in m]))\n", "fast_code": "import sys\n\ninput = sys.stdin.readline\nfrom collections import deque\n\n\ndef bfs() -> None:\n q = [(0, 0)]\n while q:\n x, y = q.pop(0)\n for dx, dy in dxy:\n nx, ny = x + dx, y + dy\n if 0 <= nx < H and 0 <= ny < W and S[nx][ny] == \".\" and dist[nx][ny] == 0:\n q.append((nx, ny))\n dist[nx][ny] = dist[x][y] + 1\n\n\ndef main():\n global H, W, S, dist, dxy\n H, W = tuple(map(int, input().split()))\n S = tuple(input().rstrip() for _ in range(H))\n dist = [[0] * W for _ in range(H)]\n dist[0][0] = 1\n dxy = [(1, 0), (-1, 0), (0, 1), (0, -1)]\n bfs()\n white, x = sum(s.count(\".\") for s in S), dist[-1][-1]\n ans = white - x if x else -1\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "slow_time": 279149914, "fast_time": 138807605, "speedup": 2.0111, "source": "python_benchmark", "slow_submission_id": "sol_7", "fast_submission_id": "sol_27"} +{"pair_id": "python_6759", "problem_id": "p02938", "language": "python", "slow_code": "L, R = list(map(int, input().split()))\nmod = 10**9 + 7\n\n\ndef f(L, R):\n if L > R:\n return 0\n R = bin(R)[2:]\n N = len(R)\n ret = f(L, int(\"0\" + \"1\" * (N - 1), 2))\n L = bin(L)[2:]\n if len(L) != N:\n L = \"1\" + \"0\" * (N - 1)\n for i in range(N):\n if R[i] == \"0\":\n continue\n R2 = R[:i] + \"0\" + \"?\" * (N - i - 1)\n if i == 0:\n R2 = R\n for j in range(N):\n if L[j] == \"1\" and j != 0:\n continue\n L2 = L[:j] + \"1\" + \"?\" * (N - j - 1)\n if j == 0:\n L2 = L\n tmp = 1\n for r, l in zip(R2, L2):\n if r == \"0\" and l == \"1\":\n tmp *= 0\n break\n elif r == \"?\" and l == \"?\":\n tmp = tmp * 3 % mod\n elif r == \"?\" and l == \"0\":\n tmp = tmp * 2 % mod\n elif r == \"1\" and l == \"?\":\n tmp = tmp * 2 % mod\n ret += tmp\n ret %= mod\n return ret\n\n\nprint((f(L, R)))\n", "fast_code": "L, R = list(map(int, input().split()))\nMOD = 10**9 + 7\nl = \"{:060b}\".format(L)[::-1]\nr = \"{:060b}\".format(R)[::-1]\nmemo = [\n [[[-1 for l in range(2)] for k in range(2)] for j in range(2)] for i in range(60)\n]\n\n\ndef f(pos, flagX, flagY, flagZ):\n if pos == -1:\n return 1\n if memo[pos][flagX][flagY][flagZ] != -1:\n return memo[pos][flagX][flagY][flagZ]\n ret = 0\n\n if l[pos] == \"0\" or flagX:\n ret += f(pos - 1, flagX, 1 if flagY or r[pos] == \"1\" else 0, flagZ)\n\n if (l[pos] == \"0\" or flagX) and (r[pos] == \"1\" or flagY) and flagZ:\n ret += f(pos - 1, flagX, flagY, flagZ)\n\n if r[pos] == \"1\" or flagY:\n ret += f(pos - 1, 1 if l[pos] == \"0\" or flagX else 0, flagY, 1)\n ret %= MOD\n memo[pos][flagX][flagY][flagZ] = ret\n return ret\n\n\nans = f(59, 0, 0, 0)\nprint(ans)\n", "slow_time": 21118709522, "fast_time": 137450137, "speedup": 153.6463, "source": "python_benchmark", "slow_submission_id": "sol_3", "fast_submission_id": "sol_1"} +{"pair_id": "python_2252", "problem_id": "p03862", "language": "python", "slow_code": "N, X = (int(x) for x in input().split())\nA = [int(x) for x in input().split()]\ndiffs = []\nfor i in range(N - 1):\n diffs.append(A[i] + A[i + 1] - X)\nret = 0\nfor i in range(N - 1):\n tmp = min(diffs[i], A[i + 1])\n ret += tmp\n diffs[i] -= tmp\n if i + 1 < len(diffs):\n diffs[i + 1] -= min(tmp, diffs[i + 1])\n ret += diffs[i]\nprint((max(0, ret)))\n", "fast_code": "N, x = list(map(int, input().split()))\nA = list(map(int, input().split()))\npre = 0\nans = 0\nfor a in A:\n eat = max(0, pre + a - x)\n pre = a - eat\n ans += eat\nprint(ans)\n", "slow_time": 48021229, "fast_time": 23000113, "speedup": 2.0879, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_14"} +{"pair_id": "python_14584", "problem_id": "p00687", "language": "python", "slow_code": "while 1:\n n, a, b = list(map(int, input().split()))\n if n == a == b == 0:\n break\n c = 0\n d = [1] + [0] * 2000000\n for i in range(0, n + 1):\n if d[i]:\n d[i + a] = d[i + b] = 1\n else:\n c += 1\n print(c)\n", "fast_code": "while 1:\n n, a, b = list(map(int, input().split()))\n if n == 0:\n break\n dp = [0] * (n + max(a, b) + 1)\n dp[a] = dp[b] = 1\n for i in range(n + 1):\n if dp[i]:\n dp[i + a] = dp[i + b] = 1\n print(n - sum(dp[: n + 1]))\n", "slow_time": 6644536519, "fast_time": 38149502, "speedup": 174.171, "source": "python_benchmark", "slow_submission_id": "sol_4", "fast_submission_id": "sol_1"} +{"pair_id": "python_2262", "problem_id": "p02898", "language": "python", "slow_code": "from collections import Counter, defaultdict, deque\nfrom heapq import heappop, heappush, heapify\nimport sys, bisect, math, itertools, fractions, pprint\n\nsys.setrecursionlimit(10**8)\nmod = 10**9 + 7\nINF = float(\"inf\")\n\n\ndef inp():\n return int(sys.stdin.readline())\n\n\ndef inpl():\n return list(map(int, sys.stdin.readline().split()))\n\n\nn, k = inpl()\na = inpl()\nres = 0\nfor x in a:\n if x >= k:\n res += 1\nprint(res)\n", "fast_code": "n, k = list(map(int, input().split()))\na = list(map(int, input().split()))\nprint((sum(i >= k for i in a)))\n", "slow_time": 38674270, "fast_time": 18629817, "speedup": 2.0759, "source": "python_benchmark", "slow_submission_id": "sol_21", "fast_submission_id": "sol_19"} +{"pair_id": "python_732", "problem_id": "p03244", "language": "python", "slow_code": "def main():\n n, *v = list(map(int, open(0).read().split()))\n be = [0] * int(1e5)\n bo = [0] * int(1e5)\n for e, o in zip(*[iter(v)] * 2):\n be[e - 1] += 1\n bo[o - 1] += 1\n if be.index(max(be)) == bo.index(max(bo)):\n ve = max(be)\n vo = max(bo)\n be[be.index(ve)] = 0\n bo[bo.index(vo)] = 0\n print((min(n - ve - max(bo), n - vo - max(be))))\n else:\n print((n - max(be) - max(bo)))\n return\n\n\nmain()\n", "fast_code": "def count_char_occurrence(seq):\n\n ret = {}\n for char in seq:\n if char in ret:\n ret[char] += 1\n else:\n ret[char] = 1\n return ret\n\n\ndef accum_char_frequency(seq):\n \"\"\"\"\"\"\n frequencies = count_char_occurrence(seq)\n ret = {}\n for char, count in list(frequencies.items()):\n if count in ret:\n ret[count].append(char)\n else:\n ret[count] = [char]\n return ret\n\n\ndef main():\n _ = eval(input())\n seq = list(map(int, input().split()))\n odd = seq[::2]\n even = seq[1::2]\n if len(set(seq)) == 1:\n print((len(even)))\n return\n no_freq_odd = accum_char_frequency(odd)\n freq_odd = sorted(list(no_freq_odd.items()), reverse=True)\n no_freq_even = accum_char_frequency(even)\n freq_even = sorted(list(no_freq_even.items()), reverse=True)\n if (\n len(freq_odd[0][1]) == 1\n and len(freq_even[0][1]) == 1\n and freq_odd[0][1] == freq_even[0][1]\n ):\n min_change_even = len(seq)\n if len(freq_even) != 1:\n min_change_even = (len(odd) - freq_odd[0][0]) + (\n len(even) - freq_even[1][0]\n )\n min_change_odd = len(seq)\n if len(freq_odd) != 1:\n min_change_odd = (len(odd) - freq_odd[1][0]) + (len(even) - freq_even[0][0])\n print((min(min_change_even, min_change_odd)))\n return\n else:\n min_change = (len(odd) - freq_odd[0][0]) + (len(even) - freq_even[0][0])\n print(min_change)\n return\n\n\nmain()\n", "slow_time": 2695635546, "fast_time": 116755726, "speedup": 23.0878, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_20"} +{"pair_id": "python_6742", "problem_id": "p03395", "language": "python", "slow_code": "from scipy.sparse.csgraph import dijkstra\n\n\ndef make_graph(m, subset):\n matrix = [[0] * (m + 1) for _ in range(m + 1)]\n for k in subset:\n for s in range(k, m + 1):\n matrix[s][s % k] = 1\n return dijkstra(matrix)\n\n\ndef solve(n, aaa, bbb):\n for a, b in zip(aaa, bbb):\n if a < b:\n return -1\n m = max(aaa)\n subset = set(range(1, m + 1))\n sp = make_graph(m, subset)\n if any(sp[a, b] > 50 for a, b in zip(aaa, bbb)):\n return -1\n for k in range(m, 0, -1):\n subset.remove(k)\n sp = make_graph(m, subset)\n if any(sp[a, b] > 50 for a, b in zip(aaa, bbb)):\n subset.add(k)\n return sum(1 << k for k in subset)\n\n\nn = int(eval(input()))\naaa = list(map(int, input().split()))\nbbb = list(map(int, input().split()))\nprint((solve(n, aaa, bbb)))\n", "fast_code": "from collections import deque\n\n\ndef BFS_dist(n, E, i0=0):\n Q = deque([i0])\n D = [-1] * n\n D[i0] = 0\n while Q:\n x = Q.popleft()\n for c in E[x]:\n if D[c] == -1:\n D[c] = D[x] + 1\n Q.append(c)\n return D\n\n\nN = int(eval(input()))\nA = [int(a) for a in input().split()]\nB = [int(a) for a in input().split()]\nM = 51\nX = [[] for _ in range(M)]\nfor i in range(1, M):\n for j in range(1, i + 1):\n X[i].append([i % j, 2**j])\n\n\ndef chk(S):\n M = 51\n X = [[] for _ in range(M)]\n for j in S:\n for i in range(j, M):\n X[i].append(i % j)\n DI = []\n for i in range(M):\n DI.append(BFS_dist(M, X, i))\n for i in range(N):\n if DI[A[i]][B[i]] < 0:\n return 0\n return 1\n\n\nL1 = [i for i in range(1, 51)]\nL2 = []\nif chk(L1) == 0:\n print((-1))\nelse:\n while L1:\n while True:\n if chk(L1 + L2):\n if len(L1) == 0:\n break\n L1.pop()\n else:\n L2.append(L1[-1] + 1 if L1 else 1)\n L1 = [i for i in range(1, L2[-1])]\n break\n if len(L1) == 0:\n break\n print((sum([1 << l for l in L2])))\n", "slow_time": 26289887743, "fast_time": 5434327839, "speedup": 4.8377, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_5"} +{"pair_id": "python_2326", "problem_id": "p04000", "language": "python", "slow_code": "H, W, N = list(map(int, input().split()))\nB = set([])\nfor i in range(N):\n a, b = list(map(int, input().split()))\n a -= 1\n b -= 1\n B.add((a, b))\n\nBB = list(B)\nans = [0 for _ in range(10)]\nfor i in range(N):\n cnt = 0\n temp = 0\n x, y = BB[i]\n\n for sx in range(max(0, x - 2), min(x, H - 3) + 1):\n for sy in range(max(0, y - 2), min(y, W - 3) + 1):\n temp = 0\n for p in range(3):\n for q in range(3):\n if (sx + p, sy + q) in B:\n temp += 1\n\n ans[temp] += 1\nfor i in range(1, 10):\n ans[i] = ans[i] // i\nans[0] = (H - 2) * (W - 2) - sum(ans[1:])\nfor t in ans:\n print(t)\n", "fast_code": "h, w, n = map(int, input().split())\nfrom itertools import product as pr\nfrom collections import Counter as co\n\nans = [(h - 2) * (w - 2)] + [0] * 9\nio = [tuple(map(int, input().split())) for i in range(n)]\nfor k, v in co(\n co(\n [\n (a - x) * w + b - y\n for x, y in pr(range(3), repeat=2)\n for a, b in io\n if h - 1 > a - x > 0 < b - y < w - 1\n ]\n ).values()\n).items():\n ans[k] = v\n ans[0] -= v\nprint(*ans, sep=\"\\n\")\n", "slow_time": 154443997, "fast_time": 77073047, "speedup": 2.0039, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_9"} +{"pair_id": "python_1154", "problem_id": "p02889", "language": "python", "slow_code": "from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall\n\nINF = 1001001001\nN, M, L = list(map(int, input().split()))\nfuel = [[INF] * N for _ in range(N)]\nfor i in range(M):\n A, B, C = list(map(int, input().split()))\n A -= 1\n B -= 1\n fuel[A][B] = C\n fuel[B][A] = C\nfor i in range(N):\n fuel[i][i] = 0\nfuel = floyd_warshall(csgraph_from_dense(fuel))\n\n\ndist = [[INF] * N for _ in range(N)]\nfor i in range(N):\n for j in range(N):\n if i == j:\n dist[i][j] = 0\n elif fuel[i][j] <= L:\n dist[i][j] = 1\ndist = floyd_warshall(csgraph_from_dense(dist))\n\n\nQ = int(eval(input()))\nfor i in range(Q):\n s, t = list(map(int, input().split()))\n s -= 1\n t -= 1\n if dist[s][t] == INF:\n print((-1))\n else:\n print((int(dist[s][t]) - 1))\n", "fast_code": "def wf(l, n):\n for i in range(n):\n for j in range(n):\n for k in range(n):\n l[j][k] = min(l[j][k], l[j][i] + l[i][k])\n return l\n\n\ndef main():\n n, m, l = list(map(int, input().split()))\n l1 = [[10**15 for i in range(n)] for i in range(n)]\n for _ in range(m):\n a, b, c = list(map(int, input().split()))\n l1[a - 1][b - 1] = c\n l1[b - 1][a - 1] = c\n l1 = wf(l1, n)\n l2 = [[10**4 for i in range(n)] for i in range(n)]\n for i in range(n):\n for j in range(n):\n if l1[i][j] <= l:\n l2[i][j] = 1\n l2 = wf(l2, n)\n q = int(eval(input()))\n lq = []\n for _ in range(q):\n lq.append(list(map(int, input().split())))\n for sq in lq:\n res = l2[sq[0] - 1][sq[1] - 1]\n if res == 10**4:\n print((-1))\n else:\n print((res - 1))\n\n\nmain()\n", "slow_time": 25172620361, "fast_time": 131266833, "speedup": 191.7668, "source": "python_benchmark", "slow_submission_id": "sol_14", "fast_submission_id": "sol_4"} +{"pair_id": "python_13425", "problem_id": "p03298", "language": "python", "slow_code": "import sys\n\nsys.setrecursionlimit(10**7)\n\n\ndef I():\n return int(sys.stdin.readline().rstrip())\n\n\ndef MI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI():\n return list(map(int, sys.stdin.readline().rstrip().split()))\n\n\ndef LI2():\n return list(map(int, sys.stdin.readline().rstrip()))\n\n\ndef S():\n return sys.stdin.readline().rstrip()\n\n\ndef LS():\n return list(sys.stdin.readline().rstrip().split())\n\n\ndef LS2():\n return list(sys.stdin.readline().rstrip())\n\n\nN = I()\nS = LS2()\nfrom collections import defaultdict\n\nd_left = defaultdict(int)\nd_right = defaultdict(int)\nfor i in range(2**N):\n left_red = \"\"\n left_blue = \"\"\n right_red = \"\"\n right_blue = \"\"\n for j in range(N):\n if (i >> j) & 1:\n left_red += S[j]\n else:\n left_blue += S[j]\n for j in range(2 * N - 1, N - 1, -1):\n if (i >> (j - N)) & 1:\n right_red += S[j]\n else:\n right_blue += S[j]\n d_left[(left_red, left_blue)] += 1\n d_right[(right_red, right_blue)] += 1\nans = 0\nfor key in list(d_left.keys()):\n ans += d_left[key] * d_right[key]\nprint(ans)\n", "fast_code": "from collections import defaultdict, deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\n\n\ndef LI():\n return [int(x) for x in sys.stdin.readline().split()]\n\n\ndef I():\n return int(sys.stdin.readline())\n\n\ndef LS():\n return [list(x) for x in sys.stdin.readline().split()]\n\n\ndef S():\n res = list(sys.stdin.readline())\n if res[-1] == \"\\n\":\n return res[:-1]\n return res\n\n\ndef IR(n):\n return [I() for i in range(n)]\n\n\ndef LIR(n):\n return [LI() for i in range(n)]\n\n\ndef SR(n):\n return [S() for i in range(n)]\n\n\ndef LSR(n):\n return [LS() for i in range(n)]\n\n\nsys.setrecursionlimit(1000000)\nmod = 1000000007\n\n\ndef A():\n return\n\n\ndef B():\n return\n\n\ndef C():\n n = I()\n s = S()\n for i in range(2 * n):\n s[i] = ord(s[i]) - 96\n k = 27\n m = 1 << n\n p = [1 << j for j in range(n)]\n d = defaultdict(lambda: 0)\n l = [(0, 0)]\n for i in s[:n][::-1]:\n l = [(x[0] * k + i, x[1]) for x in l] + [(x[0], x[1] * k + i) for x in l]\n for i in l:\n d[i] += 1\n ans = 0\n l = [(0, 0)]\n for i in s[n:]:\n l = [(x[0] * k + i, x[1]) for x in l] + [(x[0], x[1] * k + i) for x in l]\n for i in l:\n ans += d[i]\n print(ans)\n return\n\n\ndef D():\n return\n\n\ndef E():\n return\n\n\ndef F():\n return\n\n\nif __name__ == \"__main__\":\n C()\n", "slow_time": 1531659787, "fast_time": 377172094, "speedup": 4.0609, "source": "python_benchmark", "slow_submission_id": "sol_1", "fast_submission_id": "sol_16"} +{"pair_id": "python_2906", "problem_id": "p03761", "language": "python", "slow_code": "n = int(eval(input()))\nG = []\nfor _ in range(n):\n S = list(input().strip())\n C = {}\n for i in range(len(S)):\n x = S[i]\n if x not in C:\n C[x] = 0\n C[x] += 1\n G.append(C)\nA = {}\nfor i in range(97, 123):\n flag = 0\n cmin = 50\n for C in G:\n if chr(i) not in C:\n flag = 1\n break\n cmin = min(cmin, C[chr(i)])\n if flag == 0:\n A[chr(i)] = cmin\nA = sorted(list(A.items()), key=lambda x: x[0])\nx = \"\"\nfor y in A:\n a, k = y[0], y[1]\n x += a * k\nprint(x)\n", "fast_code": "_, *s = open(0)\nprint((\"\".join(sorted(c * min(t.count(c) for t in s) for c in set(s[0])))))\n", "slow_time": 66372542, "fast_time": 30930805, "speedup": 2.1458, "source": "python_benchmark", "slow_submission_id": "sol_29", "fast_submission_id": "sol_19"} +{"pair_id": "python_1321", "problem_id": "p03037", "language": "python", "slow_code": "def myAnswer(N, M, L, R) -> int:\n total = 0\n MAXL = max(L)\n MINR = min(R)\n for i in range(1, N + 1):\n if MAXL <= i and MINR >= i:\n total += 1\n return total\n\n\ndef modelAnswer():\n tmp = 1\n\n\ndef main():\n N, M = list(map(int, input().split()))\n L = []\n R = []\n for _ in range(M):\n l, r = list(map(int, input().split()))\n L.append(l)\n R.append(r)\n print((myAnswer(N, M, L[:], R[:])))\n\n\nif __name__ == \"__main__\":\n main()\n", "fast_code": "N, M = list(map(int, input().split()))\nleft = -1\nright = 10**10\nfor _ in range(M):\n l, r = list(map(int, input().split()))\n left = max(left, l)\n right = min(right, r)\nprint((max(right - left + 1, 0)))\n", "slow_time": 1129543532, "fast_time": 19304470, "speedup": 58.512, "source": "python_benchmark", "slow_submission_id": "sol_13", "fast_submission_id": "sol_24"} +{"pair_id": "python_14167", "problem_id": "p03064", "language": "python", "slow_code": "M, s = 998244353, 0\nd = [1] + [0] * 7**6\ne = d[:]\nn = eval(input())\nfor _ in \"_\" * n:\n a = eval(input())\n s += a\n i = s\n while ~i:\n d[i] += d[i] + d[i - a] % M\n e[i] += e[i - a] % M\n i -= 1\nprint((3**n + ~s % 2 * e[s // 2] * 3 - 3 * sum(d[-~s // 2 :])) % M)\n", "fast_code": "import numpy as np\n\nmod = 998244353\nN = int(eval(input()))\na = np.array([int(eval(input())) for i in range(N)])\nsum_a = np.sum(a)\ndp = np.zeros((N + 1, sum_a + 1), dtype=np.int64)\ndp[0, 0] = 1\nfor i in range(1, N + 1):\n a_i = a[i - 1]\n dp[i, a_i:] += dp[i - 1, :-a_i]\n dp[i, :] += dp[i - 1, :] * 2\n dp[i, :] %= mod\nexc = np.sum(dp[N, (sum_a + 1) // 2 :]) % mod\nres = 3**N % mod - exc * 3\nif sum_a % 2 == 0:\n dp = np.zeros((N + 1, sum_a + 1), dtype=np.int64)\n dp[0, 0] = 1\n for i in range(1, N + 1):\n a_i = a[i - 1]\n dp[i, a_i:] += dp[i - 1, :-a_i]\n dp[i, :] += dp[i - 1, :]\n dp[i, :] %= mod\n res += dp[N, sum_a // 2] * 3\nprint((res % mod))\n", "slow_time": 418908517, "fast_time": 91997542, "speedup": 4.5535, "source": "python_benchmark", "slow_submission_id": "sol_11", "fast_submission_id": "sol_13"} +{"pair_id": "python_3043", "problem_id": "p03305", "language": "python", "slow_code": "\"\"\"\"\"\"\n\nimport sys, re\nfrom collections import deque, defaultdict, Counter\nfrom math import sqrt, hypot, factorial, pi, sin, cos, radians, log10\n\nif sys.version_info.minor >= 5:\n from math import gcd\nelse:\n from fractions import gcd\nfrom heapq import heappop, heappush, heapify, heappushpop\nfrom bisect import bisect_left, bisect_right\nfrom itertools import permutations, combinations, product, accumulate\nfrom operator import itemgetter, mul, xor\nfrom copy import copy, deepcopy\nfrom functools import reduce, partial\nfrom fractions import Fraction\nfrom string import ascii_lowercase, ascii_uppercase, digits\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef list2d(a, b, c):\n return [[c] * b for i in range(a)]\n\n\ndef list3d(a, b, c, d):\n return [[[d] * c for j in range(b)] for i in range(a)]\n\n\ndef ceil(x, y=1):\n return int(-(-x // y))\n\n\ndef round(x):\n return int((x * 2 + 1) // 2)\n\n\ndef fermat(x, y, MOD):\n return x * pow(y, MOD - 2, MOD) % MOD\n\n\ndef lcm(x, y):\n return (x * y) // gcd(x, y)\n\n\ndef lcm_list(nums):\n return reduce(lcm, nums, 1)\n\n\ndef gcd_list(nums):\n return reduce(gcd, nums, nums[0])\n\n\ndef INT():\n return int(eval(input()))\n\n\ndef MAP():\n return list(map(int, input().split()))\n\n\ndef LIST():\n return list(map(int, input().split()))\n\n\ndef Yes():\n print(\"Yes\")\n\n\ndef No():\n print(\"No\")\n\n\ndef YES():\n print(\"YES\")\n\n\ndef NO():\n print(\"NO\")\n\n\nsys.setrecursionlimit(10**9)\nINF = float(\"inf\")\nMOD = 10**9 + 7\n\n\ndef dijkstra(N: int, nodes: list, src: int) -> list:\n\n res = [float(\"inf\")] * N\n\n que = [(0, src)]\n res[src] = 0\n\n while len(que) != 0:\n\n dist, cur = heappop(que)\n\n for nxt, cost in nodes[cur]:\n\n if res[cur] + cost < res[nxt]:\n res[nxt] = res[cur] + cost\n\n heappush(que, (res[nxt], nxt))\n\n return res\n\n\nN, M, S, T = MAP()\nnodes1 = [[] for i in range(N)]\nnodes2 = [[] for i in range(N)]\nfor i in range(M):\n u, v, a, b = MAP()\n\n nodes1[u - 1].append((v - 1, a))\n nodes1[v - 1].append((u - 1, a))\n\n nodes2[u - 1].append((v - 1, b))\n nodes2[v - 1].append((u - 1, b))\nyen = dijkstra(N, nodes1, S - 1)\nsnuk = dijkstra(N, nodes2, T - 1)\nans = [0] * N\nmn = INF\n\nfor i in range(N - 1, -1, -1):\n ans[i] = mn = min(mn, yen[i] + snuk[i])\n\nfor i in range(N):\n print((1000000000000000 - ans[i]))\n", "fast_code": "import sys\n\nsys.setrecursionlimit(10**7)\nimport numpy as np\nfrom heapq import *\n\nN, M, S, T = list(map(int, input().split()))\nINF = 10**15\ngraph = [[] for _ in range(N + 1)]\nfor i in range(M):\n u, v, a, b = list(map(int, input().split()))\n graph[u].append((v, a, b))\n graph[v].append((u, a, b))\n\n\ndef dijkstra(start, mode):\n dist = [INF] * (N + 1)\n dist[start] = 0\n que = [(0, start)]\n while que:\n d, p = heappop(que)\n\n if dist[p] < d:\n continue\n for next_city, *fee in graph[p]:\n d1 = d + fee[mode]\n if dist[next_city] > d1:\n dist[next_city] = d1\n heappush(que, (d1, next_city))\n return dist\n\n\nd1 = np.array(dijkstra(S, 0))\nd2 = np.array(dijkstra(T, 1))\nd1 += d2\nanswer = 10**15 - np.minimum.accumulate(d1[::-1])[::-1][1:]\nprint((\"\\n\".join(answer.astype(str))))\n", "slow_time": 245141126, "fast_time": 100374729, "speedup": 2.4423, "source": "python_benchmark", "slow_submission_id": "sol_26", "fast_submission_id": "sol_29"} +{"pair_id": "python_6713", "problem_id": "p00053", "language": "python", "slow_code": "s = [0]\nM = 10**6\np = [1] * M\nS = 0\nfor i in range(2, M):\n if p[i]:\n for j in range(i * i, M, i):\n p[j] = 0\n S += i\n s.append(S)\nwhile 1:\n n = eval(input())\n if n == 0:\n break\n print(s[n])\n", "fast_code": "import math\n\nr = 105000\nsqrt = int(math.sqrt(r))\np = [1] * r\np[0] = 0\nfor i in range(1, sqrt):\n if p[i]:\n for j in range(2 * i + 1, r, i + 1):\n p[j] = 0\nwhile True:\n n = int(input())\n if not n:\n break\n i, num, sum = 0, 0, 0\n while num < n:\n if p[i] == 1:\n num += 1\n sum += i + 1\n i += 1\n print(sum)\n", "slow_time": 126327816139, "fast_time": 8006812925, "speedup": 15.7775, "source": "python_benchmark", "slow_submission_id": "sol_0", "fast_submission_id": "sol_2"}