{ "Scenario.codegeneration_10_0.2_eval_all.json": [ { "code_list": [ "for _ in range(int(input())):\n s = input()\n if s == \"abc\":\n print(\"YES\")\n elif s == \"acb\" or s == \"bac\" or s == \"cab\":\n print(\"YES\")\n else:\n print(\"NO\")", "t = int(input())\nfor i in range(t):\n s = input()\n if s[0] == \"a\":\n print(\"YES\")\n elif s[1] == \"a\":\n print(\"YES\")\n elif s[2] == \"a\":\n print(\"NO\")\n elif s[0] == \"b\":\n print(\"YES\")\n elif s[1] == \"b\":\n print(\"NO\")\n else:\n print(\"YES\")", "t = int(input())\nfor i in range(t):\n s = input()\n if \"ab\" in s or \"ac\" in s:\n print(\"YES\")\n else:\n print(\"NO\")", "t = int(input())\nfor i in range(t):\n s = input()\n if s == \"abc\":\n print(\"YES\")\n elif s == \"acb\" or s == \"bac\" or s == \"bca\" or s == \"cab\" or s == \"cba\":\n print(\"YES\")\n else:\n print(\"NO\")", "t = int(input())\nfor i in range(t):\n s = input()\n if s[0] == \"a\" and s[1] in [\"b\", \"c\"]:\n print(\"YES\")\n elif s[1] == \"b\" and s[2] == \"c\":\n print(\"YES\")\n else:\n print(\"NO\")", "for _ in range(int(input())):\n s = input()\n if s == \"abc\":\n print(\"YES\")\n elif s[0] == \"a\" or s[1] == \"b\" or s[2] == \"c\":\n print(\"YES\")\n else:\n print(\"NO\")", "t = int(input())\nfor i in range(t):\n s = input()\n if \"ab\" in s or \"ac\" in s:\n print(\"YES\")\n else:\n print(\"NO\")", "t = int(input())\nfor i in range(t):\n s = input()\n if s[0] == \"a\" and s[2] == \"c\":\n print(\"YES\")\n else:\n print(\"NO\")", "t = int(input())\nfor i in range(t):\n s = input()\n if \"ab\" in s or \"ac\" in s:\n print(\"YES\")\n else:\n print(\"NO\")", "t = int(input())\nfor i in range(t):\n s = input()\n if \"ab\" in s or \"ba\" in s:\n print(\"YES\")\n else:\n print(\"NO\")" ], "pass1_list": [ false, false, false, false, false, true, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "def solve(n, a):\n if 0 in a:\n a.remove(0)\n return int(\"\".join(map(str, a)))\n a.sort(reverse=True)\n if a[0] == 1:\n return int(\"\".join(map(str, a)))\n a[0] += 1\n return int(\"\".join(map(str, a)))\n\n\nt = int(input())\nfor _ in range(t):\n n = int(input())\n a = list(map(int, input().split()))\n print(solve(n, a))", "def get_max_product(arr):\n zero_count = arr.count(0)\n nine_count = arr.count(9)\n if zero_count == len(arr):\n return 0\n if zero_count > 0:\n return 9 * (len(arr) - 1 - zero_count)\n if nine_count == 0:\n return (len(arr) - 1) * 9\n return 9 * (len(arr) - 1) + 2\n\n\nt = int(input())\nfor _ in range(t):\n n = int(input())\n arr = list(map(int, input().split()))\n print(get_max_product(arr))", "def solve():\n n = int(input())\n a = list(map(int, input().split()))\n if 0 in a:\n a.remove(0)\n if a:\n print(max(a) * prod(a))\n else:\n print(0)\n else:\n print(prod(a) * 9 // (1 if 9 in a else 10))\n\n\ndef prod(a):\n p = 1\n for i in a:\n p *= i\n return p\n\n\ndef main():\n for _ in range(int(input())):\n solve()\n\n\nmain()", "from sys import stdin, stdout\n\ninput = stdin.readline\n\n\ndef solve():\n n = int(input())\n arr = list(map(int, input().split()))\n prod = 1\n for i in range(n):\n prod *= arr[i]\n ans = 0\n for i in range(n):\n if arr[i] != 0:\n arr[i] += 1\n ans = max(ans, prod // arr[i] * arr[i])\n arr[i] -= 1\n else:\n ans = max(ans, prod)\n print(ans)\n\n\ndef main():\n t = int(input())\n for _ in range(t):\n solve()\n\n\nmain()", "def solve(n, a):\n zero_present = False\n max_product = 1\n for i in a:\n if i == 0:\n zero_present = True\n max_product *= i\n if zero_present:\n return max_product - 1\n max_digit = max(a)\n return max_product * (max_digit + 1)\n\n\nt = int(input())\nfor _ in range(t):\n n = int(input())\n a = list(map(int, input().split()))\n print(solve(n, a))", "def main():\n t = int(input())\n for _ in range(t):\n n = int(input())\n a = list(map(int, input().split()))\n if 0 in a:\n a.remove(0)\n if a:\n print(max(a) * prod(a))\n else:\n print(0)\n else:\n print(prod(a) * 9)\n\n\ndef prod(a):\n p = 1\n for i in a:\n p *= i\n return p\n\n\nmain()", "t = int(input())\nfor _ in range(t):\n n = int(input())\n a = list(map(int, input().split()))\n if 0 in a:\n a.remove(0)\n if a:\n print(max(a) * (n - 1))\n else:\n print(0)\n else:\n print(max(a) * n)", "def solve():\n n = int(input())\n a = list(map(int, input().split()))\n z = a.count(0)\n if z == n:\n return 0\n if z == 0:\n return max(a) * (n - 1) + 1\n else:\n return max(a) * (n - z - 1) + 1\n\n\ndef main():\n t = int(input())\n for _ in range(t):\n print(solve())\n\n\nmain()", "def solve(n, a):\n if 0 in a:\n a.remove(0)\n return int(\"\".join(map(str, a)))\n a.sort(reverse=True)\n if a[0] == 1:\n return int(\"\".join(map(str, a)))\n if a[0] == 2:\n return int(\"\".join(map(str, a))) * 2\n return int(\"\".join(map(str, a))) * (a[0] - 1)\n\n\nt = int(input())\nfor _ in range(t):\n n = int(input())\n a = list(map(int, input().split()))\n print(solve(n, a))", "t = int(input())\nfor _ in range(t):\n n = int(input())\n a = list(map(int, input().split()))\n if 0 in a:\n a.remove(0)\n a.append(1)\n a.sort(reverse=True)\n if a[0] == 1:\n a[1] += 1\n else:\n a[0] += 1\n print(int(\"\".join(map(str, a))))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from sys import stdin\n\ninput = stdin.readline\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input().strip()\n (cnt, ans) = (0, 0)\n for i in range(n):\n if s[i] == \"B\":\n cnt += 1\n else:\n if cnt >= k:\n ans += cnt // k\n cnt = cnt % k\n else:\n ans += 1\n cnt = 0\n if cnt >= k:\n ans += cnt // k\n cnt = cnt % k\n if cnt != 0:\n ans += 1\n print(ans)", "from sys import stdin\n\ninput = stdin.readline\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input().strip()\n (cnt, ans) = (0, 0)\n for i in range(n):\n if s[i] == \"B\":\n cnt += 1\n else:\n if cnt >= k:\n ans += cnt // k\n cnt = 0\n if cnt >= k:\n ans += cnt // k\n cnt = 0\n print(ans + (1 if cnt else 0))", "from sys import stdin\n\ninput = stdin.readline\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n (b, w) = (s.count(\"B\"), s.count(\"W\"))\n if w == n:\n print(0)\n else:\n print((b + k - 1) // k)", "from sys import stdin\n\ninput = stdin.readline\n\n\ndef solve():\n n, k = map(int, input().split())\n s = input()\n b = s.count(\"B\")\n if not b:\n return 0\n if k >= n:\n return 1\n ans = b // k\n s = s.replace(\"W\", \"\")\n for i in range(k):\n if s[i:].count(\"B\") == 0:\n ans += 1\n break\n return ans\n\n\nt = int(input())\nfor _ in range(t):\n print(solve())", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input().strip()\n (b, w) = (s.count(\"B\"), s.count(\"W\"))\n if not b:\n print(0)\n continue\n if k >= n:\n print(1)\n continue\n if k == 1:\n print(b)\n continue\n ans = b // k\n s = s.replace(\"W\", \"\")\n for i in range(k):\n if s[i] == \"B\":\n ans += 1\n print(ans)", "from sys import stdin, stdout\n\ninput = stdin.readline\n\n\ndef solve():\n n, k = map(int, input().split())\n s = input().strip()\n cnt = s.count(\"B\")\n if not cnt:\n return 0\n if k >= n:\n return 1\n ans = float(\"inf\")\n for i in range(k, n + 1):\n ans = min(ans, (i - 1) // k + cnt - (i - 1) // k * (i - 1) // k)\n return ans\n\n\nfor _ in range(int(input())):\n stdout.write(f\"{solve()}\\n\")", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n (b, w) = (s.count(\"B\"), s.count(\"W\"))\n if w >= b:\n print(0)\n else:\n print((b - w) // (k - 1) + 1)", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n (b, w) = (s.count(\"B\"), s.count(\"W\"))\n if not b:\n print(0)\n else:\n print((w + b - 1) // k)", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n (b, w) = (s.count(\"B\"), s.count(\"W\"))\n if w == n:\n print(0)\n else:\n print((b + k - 1) // k)", "from sys import stdin\n\ninput = stdin.readline\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n (b, w) = (s.count(\"B\"), s.count(\"W\"))\n if w == n:\n print(0)\n elif k == 1:\n print(b)\n else:\n ans = b // k\n s = b % k\n if s != 0:\n ans += 1\n w -= k - s\n if w < 0:\n ans += -w // k\n if w % k != 0:\n ans += 1\n print(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import Counter\n\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n c = Counter(s)\n odd = 0\n for i in c:\n if c[i] % 2 != 0:\n odd += 1\n if odd <= k and k <= n - odd:\n print(\"YES\")\n else:\n print(\"NO\")", "from collections import Counter\n\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n c = Counter(s)\n odd = 0\n for i in c:\n if c[i] % 2 != 0:\n odd += 1\n if odd <= k and k <= n - odd:\n print(\"YES\")\n else:\n print(\"NO\")", "from collections import Counter\n\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n d = Counter(s)\n odd = 0\n for i in d:\n if d[i] % 2:\n odd += 1\n if odd <= k and k <= n - odd:\n print(\"YES\")\n else:\n print(\"NO\")", "from collections import Counter\n\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n d = Counter(s)\n odd = 0\n for i in d:\n if d[i] % 2:\n odd += 1\n if odd <= k and k <= n - odd:\n print(\"YES\")\n else:\n print(\"NO\")", "from collections import Counter\n\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n d = Counter(s)\n odd = 0\n for i in d:\n if d[i] % 2 != 0:\n odd += 1\n if odd <= k and k <= n - odd:\n print(\"YES\")\n else:\n print(\"NO\")", "from collections import Counter\n\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n count = Counter(s)\n odd = 0\n for i in count:\n if count[i] % 2:\n odd += 1\n if odd <= k and k <= n - odd:\n print(\"YES\")\n else:\n print(\"NO\")", "from collections import Counter\n\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n c = Counter(s)\n odd = 0\n for i in c:\n if c[i] % 2:\n odd += 1\n if odd <= k and k <= n - odd:\n print(\"YES\")\n else:\n print(\"NO\")", "from collections import Counter\n\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n c = Counter(s)\n odd = 0\n for i in c:\n if c[i] % 2 != 0:\n odd += 1\n if odd <= k and odd - k % 2 == 0:\n print(\"YES\")\n else:\n print(\"NO\")", "from collections import Counter\n\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n d = Counter(s)\n odd = 0\n for i in d:\n if d[i] % 2:\n odd += 1\n if odd <= k and k <= n - odd:\n print(\"YES\")\n else:\n print(\"NO\")", "from collections import Counter\n\nfor _ in range(int(input())):\n (n, k) = map(int, input().split())\n s = input()\n c = Counter(s)\n odd = 0\n for i in c:\n if c[i] % 2 != 0:\n odd += 1\n if odd <= k and k <= n - odd:\n print(\"YES\")\n else:\n print(\"NO\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n if k == 2:\n c = 0\n for i in a:\n if i % 2 == 0:\n c += 1\n print(n - c)\n elif k == 3:\n c = 0\n for i in a:\n if i % 3 == 0:\n c += 1\n print(c)\n elif k == 4:\n c = 0\n for i in a:\n if i % 4 == 0:\n c += 1\n elif i % 2 == 0:\n c += 2\n print(c)\n else:\n c = 0\n for i in a:\n if i % 5 == 0:\n c += 1\n elif i % 2 == 0:\n c += 4\n print(c)", "from sys import stdin\n\ninput = stdin.readline\nt = int(input())\nfor _ in range(t):\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n if k == 2:\n ans = 0\n for i in a:\n if i % 2 == 0:\n ans += 1\n print(n - ans)\n elif k == 3:\n ans = 0\n for i in a:\n if i % 3 == 0:\n ans += 1\n print(ans)\n elif k == 4:\n ans = 0\n for i in a:\n if i % 4 == 0:\n ans += 1\n elif i % 2 == 0:\n ans += 2\n print(ans)\n else:\n ans = 0\n for i in a:\n if i % 5 == 0:\n ans += 1\n elif i % 2 == 0:\n ans += 3\n print(ans)", "import sys\n\ninput = sys.stdin.readline\nfor _ in range(int(input())):\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n if k == 2:\n c = 0\n for i in a:\n if i % 2 == 0:\n c += 1\n print(n - c)\n elif k == 3:\n c = 0\n for i in a:\n if i % 3 == 0:\n c += 1\n print(n - c)\n elif k == 4:\n c = 0\n for i in a:\n if i % 2 == 0 and i % 4 != 0:\n c += 1\n print(c)\n elif k == 5:\n c = 0\n for i in a:\n if i % 5 != 0:\n c += 1\n print(c)", "from sys import stdin\nfrom collections import Counter\n\ninput = stdin.readline\nt = int(input())\nfor _ in range(t):\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n c = Counter(a)\n if k == 2:\n ans = 0\n if c[2] > 0:\n ans += 1\n c[2] -= 1\n odd = 0\n for i in range(1, 11):\n if i % 2 == 1:\n odd += c[i]\n if odd % 2 == 1:\n ans += 1\n print(ans)\n elif k == 3:\n ans = 0\n if c[3] > 0:\n ans += 1\n c[3] -= 1\n if c[6] > 0:\n ans += 1\n c[6] -= 1\n if c[9] > 0:\n ans += 1\n c[9] -= 1\n rem = 0\n for i in range(1, 11):\n if i % 3 == 0:\n rem += c[i]\n if rem % 3 == 0:\n print(ans)\n else:\n print(ans + 1)\n elif k == 4:\n ans = 0\n if c[4] > 0:\n ans += 1\n c[4] -= 1\n if c[8] > 0:\n ans += 1\n c[8] -= 1\n if c[2] > 1:\n ans += 2\n c[2] -= 2\n elif c[2] == 1:\n ans += 1\n c[2] -= 1\n rem = 0\n for i in range(1, 11):\n if i % 4 == 0:\n rem += c[i]\n if rem % 2 == 0:\n print(ans)\n else:\n print(ans + 1)\n else:\n ans = 0\n if c[5] > 0:\n ans += 1\n c[5] -= 1\n if c[10] > 0:\n ans += 1\n c[10] -= 1\n if c[2] > 1:\n ans += 3\n c[2] -= 2\n elif c[2] == 1:\n ans += 1\n c[2] -= 1\n rem = 0\n for i in range(1, 11):\n if i % 5 == 0:\n rem += c[i]\n if rem % 5 == 0:\n print(ans)\n else:\n print(ans + 1)", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n, k = map(int, input().split())\n arr = list(map(int, input().split()))\n if k == 2:\n cnt = 0\n for i in arr:\n if i % 2 == 0:\n cnt += 1\n print(n - cnt)\n elif k == 3:\n cnt = 0\n for i in arr:\n if i % 3 == 0:\n cnt += 1\n print(n - cnt)\n elif k == 4:\n cnt = 0\n for i in arr:\n if i % 4 == 0:\n cnt += 1\n elif i % 2 == 0:\n cnt += 2\n print(n - cnt)\n else:\n cnt = 0\n for i in arr:\n if i % 5 == 0:\n cnt += 1\n elif i % 2 == 0:\n cnt += 4\n print(n - cnt)", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n if k == 2:\n c = 0\n for i in a:\n if i % 2 == 0:\n c += 1\n print(n - c)\n elif k == 3:\n c = 0\n for i in a:\n if i % 3 == 0:\n c += 1\n print(c)\n elif k == 4:\n c = 0\n for i in a:\n if i % 4 == 0:\n c += 1\n elif i % 4 == 3:\n c += 1\n print(c)\n else:\n c = 0\n for i in a:\n if i % 5 == 0:\n c += 1\n elif i % 5 == 2 or i % 5 == 3:\n c += 1\n elif i % 5 == 4:\n c += 2\n print(c)", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n if k == 2:\n cnt = 0\n for i in a:\n if i % 2:\n cnt += 1\n if cnt == 0:\n print(0)\n else:\n print(min(cnt, n - cnt))\n elif k == 3:\n cnt = 0\n for i in a:\n if i % 3:\n cnt += 1\n if cnt == 0:\n print(0)\n else:\n print(cnt)\n elif k == 4:\n cnt = 0\n for i in a:\n if i % 2:\n cnt += 1\n if cnt == 0:\n print(0)\n else:\n print(cnt)\n else:\n cnt = 0\n for i in a:\n if i % 5:\n cnt += 1\n if cnt == 0:\n print(0)\n else:\n print(cnt)", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n if k == 2:\n cnt = 0\n for i in a:\n if i % 2:\n cnt += 1\n if cnt == 0:\n print(0)\n elif cnt == 1:\n print(n)\n else:\n print(min(n, cnt // 2 * 2 + (cnt % 2) * (n - cnt // 2)))\n elif k == 3:\n cnt = 0\n for i in a:\n if i % 3:\n cnt += 1\n if cnt == 0:\n print(0)\n elif cnt == 1:\n print(n)\n else:\n print(min(n, cnt // 3 * 3 + (cnt % 3) * (n - cnt // 3)))\n elif k == 4:\n cnt = 0\n for i in a:\n if i % 2:\n cnt += 1\n if cnt == 0:\n print(0)\n elif cnt == 1:\n print(n)\n else:\n print(min(n, cnt // 2 * 2 + (cnt % 2) * (n - cnt // 2)))\n else:\n cnt = 0\n for i in a:\n if i % 5:\n cnt += 1\n if cnt == 0:\n print(0)\n elif cnt == 1:\n print(n)\n else:\n print(min(n, cnt // 5 * 5 + (cnt % 5) * (n - cnt // 5)))", "import sys\n\ninput = sys.stdin.readline\nfor _ in range(int(input())):\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n if k == 2:\n c = 0\n for i in a:\n if i % 2 == 0:\n c += 1\n print(n - c)\n elif k == 3:\n c = 0\n for i in a:\n if i % 3 == 0:\n c += 1\n print(n - c)\n elif k == 4:\n c = 0\n for i in a:\n if i % 4 == 0:\n c += 1\n elif i % 2 == 0:\n c += 2\n print(n - c)\n else:\n c = 0\n for i in a:\n if i % 5 == 0:\n c += 1\n elif i % 2 == 0:\n c += 4\n print(n - c)", "from sys import stdin\nfrom collections import Counter\n\ninput = stdin.readline\n\nt = int(input())\nfor _ in range(t):\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n cnt = Counter(a)\n if k == 2:\n ans = 0\n if cnt[2] > 0:\n ans += 1\n elif cnt[3] > 0:\n ans += 2\n elif cnt[5] > 0:\n ans += 1\n if cnt[7] == 0:\n ans += 1\n elif cnt[7] > 0:\n ans += 3\n elif cnt[9] > 0:\n ans += 2\n else:\n ans += 4\n print(ans)\n elif k == 3:\n ans = 0\n if cnt[3] > 0:\n ans += 1\n elif cnt[6] > 0:\n ans += 1\n if cnt[9] == 0:\n ans += 1\n elif cnt[9] > 0:\n ans += 2\n else:\n ans += 3\n print(ans)\n elif k == 4:\n ans = 0\n if cnt[2] > 0:\n ans += 1\n elif cnt[4] > 0:\n ans += 1\n elif cnt[8] > 0:\n ans += 1\n if cnt[9] == 0:\n ans += 1\n elif cnt[9] > 0:\n ans += 2\n else:\n ans += 3\n print(ans)\n else:\n ans = 0\n if cnt[5] > 0:\n ans += 1\n elif cnt[10] > 0:\n ans += 1\n elif cnt[9] > 0:\n ans += 2\n else:\n ans += 4\n print(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "t = int(input())\nfor i in range(t):\n n = int(input())\n if n % 3 == 1 or n % 3 == 2:\n print(\"First\")\n elif n % 3 == 0:\n if n % 6 == 0:\n print(\"Second\")\n else:\n print(\"First\")\n else:\n print(\"Second\")", "t = int(input())\nfor i in range(t):\n n = int(input())\n if n % 3 == 1:\n print(\"Second\")\n elif n % 3 == 2:\n print(\"First\")\n else:\n print(\"First\")", "t = int(input())\nfor i in range(t):\n n = int(input())\n if n % 3 == 1 or n % 3 == 2:\n print(\"First\")\n elif n % 3 == 0:\n print(\"Second\")", "t = int(input())\nfor i in range(t):\n n = int(input())\n if n % 3 == 1:\n print(\"Second\")\n elif n % 3 == 2:\n print(\"First\")\n else:\n print(\"First\")", "t = int(input())\nfor i in range(t):\n n = int(input())\n if n % 3 == 1 or n % 3 == 2:\n print(\"First\")\n elif n % 3 == 0:\n print(\"Second\")", "t = int(input())\nfor i in range(t):\n n = int(input())\n if n % 3 == 1:\n print(\"Second\")\n elif n % 3 == 2:\n print(\"First\")\n else:\n print(\"First\")", "t = int(input())\nfor i in range(t):\n n = int(input())\n if n % 3 == 1:\n print(\"Second\")\n elif n % 3 == 2:\n print(\"First\")\n else:\n print(\"First\")", "t = int(input())\nfor i in range(t):\n n = int(input())\n if n % 3 == 1:\n print(\"Second\")\n elif n % 3 == 2:\n print(\"First\")\n else:\n print(\"First\")", "t = int(input())\nfor i in range(t):\n n = int(input())\n if n % 3 == 1 or n % 3 == 2:\n print(\"First\")\n elif n % 3 == 0:\n print(\"Second\")", "t = int(input())\nfor i in range(t):\n n = int(input())\n if n % 3 == 1 or n % 3 == 2:\n print(\"First\")\n elif n % 3 == 0:\n print(\"Second\")" ], "pass1_list": [ false, false, true, false, true, false, false, false, true, true ], "metadata_list": [] }, { "code_list": [ "from math import ceil, floor\n\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n a_sum = sum(a)\n ans = 0\n for k in range(1, n + 1):\n if n % k != 0:\n continue\n a_k = [sum(a[i * k : (i + 1) * k]) for i in range(n // k)]\n a_k_sum = sum(a_k)\n a_k_min = min(a_k)\n a_k_max = max(a_k)\n ans = max(\n ans,\n a_k_sum - k * a_k_min + a_k_min,\n a_k_max - a_k_sum + a_k_sum - a_k_max + k * a_k_max,\n )\n print(ans)", "from sys import stdin\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n s = [0] * n\n for i in range(n):\n s[i] = s[i - 1] + a[i] if i else a[i]\n ans = 0\n for i in range(1, n):\n l = s[i - 1] - s[0]\n r = s[-1] - s[i]\n ans = max(ans, r - l)\n print(ans)", "from sys import stdin, stdout\n\ninput = stdin.readline\n\n\ndef solve():\n n = int(input())\n a = list(map(int, input().split()))\n s = [0]\n for x in a:\n s.append(s[-1] + x)\n ans = 0\n for k in range(1, n + 1):\n if n % k:\n continue\n cur = 0\n for i in range(k):\n cur += s[i + n // k] - s[i]\n ans = max(ans, cur)\n for i in range(k, n, k):\n cur -= s[i + n // k] - s[i]\n cur += s[i + n // k - 1] - s[i - 1]\n ans = max(ans, cur)\n print(ans)\n\n\ndef main():\n for _ in range(int(input())):\n solve()\n\n\nmain()", "from math import gcd\nfrom collections import defaultdict\n\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n s = [0]\n for i in a:\n s.append(s[-1] + i)\n d = defaultdict(list)\n for i in range(n):\n d[i % (i + 1)].append(s[i + 1] - s[i])\n ans = 0\n for i in range(1, n):\n if d[i]:\n d[i].sort()\n ans = max(ans, d[i][-1] - d[i][0])\n print(ans)", "from sys import stdin, stdout\n\ninput = stdin.readline\n\n\ndef solve():\n n = int(input())\n a = list(map(int, input().split()))\n s = [0]\n for x in a:\n s.append(s[-1] + x)\n ans = 0\n for k in range(1, n + 1):\n if n % k == 0:\n b = [0] * (n // k + 1)\n for i in range(k):\n b[i // k] += s[i + 1] - s[i]\n for i in range(n // k):\n ans = max(ans, b[i + 1] - b[i])\n print(ans)\n\n\ndef main():\n t = int(input())\n for _ in range(t):\n solve()\n\n\nmain()", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n = int(input())\n arr = list(map(int, input().split()))\n s = sum(arr)\n ans = 0\n for i in range(1, n // 2 + 1):\n if n % i == 0:\n temp = []\n for j in range(i):\n temp.append(sum(arr[j * (n // i) : (j + 1) * (n // i)]))\n ans = max(ans, max(temp) - min(temp))\n print(ans)", "from sys import stdin, stdout\nfrom collections import defaultdict\n\ninput = stdin.readline\n\n\ndef solve():\n n = int(input())\n arr = list(map(int, input().split()))\n s = sum(arr)\n ans = 0\n for i in range(1, n // 2 + 1):\n if n % i == 0:\n d = defaultdict(int)\n for j in range(i):\n d[j] = arr[j]\n for j in range(i, n):\n d[j % i] += arr[j]\n m1 = max(d.values())\n m2 = min(d.values())\n ans = max(ans, m1 - m2)\n print(ans)\n\n\nfor _ in range(int(input())):\n solve()", "from math import ceil\nfrom collections import defaultdict\n\nfor _ in range(int(input())):\n n = int(input())\n arr = list(map(int, input().split()))\n sums = defaultdict(int)\n for i, x in enumerate(arr):\n sums[i % (i + 1)] += x\n ans = 0\n for k in range(1, n + 1):\n mn = float(\"inf\")\n mx = float(\"-inf\")\n for i in range(k):\n if i * k >= n:\n break\n if i == 0:\n mn = mx = sums[i * k]\n else:\n mn = min(mn, sums[i * k] - sums[(i - 1) * k])\n mx = max(mx, sums[i * k] - sums[(i - 1) * k])\n ans = max(ans, mx - mn)\n print(ans)", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n s = [0]\n for i in a:\n s.append(s[-1] + i)\n ans = 0\n for i in range(1, n // 2 + 1):\n ans = max(ans, s[n // i] - s[(n % i) * (n // i)])\n print(ans)", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n = int(input())\n arr = list(map(int, input().split()))\n pre = [0]\n for i in range(n):\n pre.append(pre[-1] + arr[i])\n ans = 0\n for i in range(1, n):\n if n % i == 0:\n temp = []\n for j in range(i):\n temp.append(pre[j * (n // i)] - pre[(j - 1) * (n // i)])\n ans = max(ans, max(temp) - min(temp))\n print(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n dp_odd = [0] * n\n dp_even = [0] * n\n dp_odd[0] = a[0] if a[0] % 2 == 1 else -float(\"inf\")\n dp_even[0] = a[0] if a[0] % 2 == 0 else -float(\"inf\")\n for i in range(1, n):\n dp_odd[i] = max(dp_even[i - 1] + a[i], dp_odd[i - 1]) if a[i] % 2 == 1 else -float(\"inf\")\n dp_even[i] = max(dp_odd[i - 1] + a[i], dp_even[i - 1]) if a[i] % 2 == 0 else -float(\"inf\")\n print(max(dp_odd[-1], dp_even[-1]))", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n dp_odd = [0] * n\n dp_even = [0] * n\n dp_odd[0] = a[0] if a[0] % 2 == 1 else -float(\"inf\")\n dp_even[0] = a[0] if a[0] % 2 == 0 else -float(\"inf\")\n for i in range(1, n):\n dp_odd[i] = max(dp_even[i - 1] + a[i], dp_odd[i - 1]) if a[i] % 2 == 1 else -float(\"inf\")\n dp_even[i] = max(dp_odd[i - 1] + a[i], dp_even[i - 1]) if a[i] % 2 == 0 else -float(\"inf\")\n print(max(dp_odd[-1], dp_even[-1]))", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n dp_odd = [0] * n\n dp_even = [0] * n\n dp_odd[0] = a[0] if a[0] % 2 == 1 else -float(\"inf\")\n dp_even[0] = a[0] if a[0] % 2 == 0 else -float(\"inf\")\n for i in range(1, n):\n dp_odd[i] = max(dp_even[i - 1] + a[i], dp_odd[i - 1]) if a[i] % 2 == 1 else -float(\"inf\")\n dp_even[i] = max(dp_odd[i - 1] + a[i], dp_even[i - 1]) if a[i] % 2 == 0 else -float(\"inf\")\n print(max(dp_odd[-1], dp_even[-1]))", "from sys import stdin\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n dp_odd = [0] * n\n dp_even = [0] * n\n dp_odd[0] = a[0] if a[0] % 2 == 1 else -float(\"inf\")\n dp_even[0] = a[0] if a[0] % 2 == 0 else -float(\"inf\")\n for i in range(1, n):\n dp_odd[i] = max(dp_odd[i - 1] + a[i], dp_even[i - 1] + a[i]) if a[i] % 2 == 1 else -float(\n \"inf\")\n dp_even[i] = max(dp_even[i - 1] + a[i], dp_odd[i - 1] + a[i]) if a[i] % 2 == 0 else -float(\n \"inf\")\n print(max(dp_odd[-1], dp_even[-1]))", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n dp_odd = [0] * n\n dp_even = [0] * n\n dp_odd[0] = a[0] if a[0] % 2 == 1 else -float(\"inf\")\n dp_even[0] = a[0] if a[0] % 2 == 0 else -float(\"inf\")\n for i in range(1, n):\n dp_odd[i] = max(dp_even[i - 1] + a[i], dp_odd[i - 1]) if a[i] % 2 == 1 else -float(\"inf\")\n dp_even[i] = max(dp_odd[i - 1] + a[i], dp_even[i - 1]) if a[i] % 2 == 0 else -float(\"inf\")\n print(max(dp_odd[-1], dp_even[-1]))", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n dp_odd = [0] * n\n dp_even = [0] * n\n dp_odd[0] = a[0] if a[0] % 2 == 1 else -float(\"inf\")\n dp_even[0] = a[0] if a[0] % 2 == 0 else -float(\"inf\")\n for i in range(1, n):\n dp_odd[i] = max(dp_odd[i - 1] + a[i], dp_even[i - 1] + a[i]) if a[i] % 2 == 1 else -float(\"inf\")\n dp_even[i] = max(dp_even[i - 1] + a[i], dp_odd[i - 1] + a[i]) if a[i] % 2 == 0 else -float(\"inf\")\n print(max(dp_odd[-1], dp_even[-1]))", "from sys import stdin, stdout\n\ninput = stdin.readline\n\n\ndef solve():\n n = int(input())\n arr = list(map(int, input().split()))\n odd = [0]\n even = [0]\n for i in range(n):\n if i % 2 == 0:\n even.append(max(even[-1] + arr[i], odd[-1]))\n else:\n odd.append(max(odd[-1] + arr[i], even[-1]))\n return max(odd[-1], even[-1])\n\n\nt = int(input())\nfor _ in range(t):\n stdout.write(str(solve()) + \"\\n\")", "from sys import stdin\n\ninput = stdin.readline\n\n\ndef solve():\n n = int(input())\n a = list(map(int, input().split()))\n odd = [0] * n\n even = [0] * n\n odd[0] = a[0] if a[0] % 2 else -float(\"inf\")\n even[0] = a[0] if a[0] % 2 == 0 else -float(\"inf\")\n for i in range(1, n):\n odd[i] = max(odd[i - 1], even[i - 1]) + a[i]\n even[i] = max(even[i - 1], odd[i - 1]) + a[i]\n return max(odd[-1], even[-1])\n\n\nfor _ in range(int(input())):\n print(solve())", "from sys import stdin\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n dp_odd = [0] * n\n dp_even = [0] * n\n dp_odd[0] = a[0] if a[0] % 2 == 1 else -float(\"inf\")\n dp_even[0] = a[0] if a[0] % 2 == 0 else -float(\"inf\")\n for i in range(1, n):\n dp_odd[i] = max(dp_even[i - 1] + a[i], dp_odd[i - 1]) if a[i] % 2 == 1 else -float(\"inf\")\n dp_even[i] = max(dp_odd[i - 1] + a[i], dp_even[i - 1]) if a[i] % 2 == 0 else -float(\"inf\")\n print(max(dp_odd[-1], dp_even[-1]))", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n dp_odd = [0] * n\n dp_even = [0] * n\n dp_odd[0] = a[0] if a[0] % 2 == 1 else -float(\"inf\")\n dp_even[0] = a[0] if a[0] % 2 == 0 else -float(\"inf\")\n for i in range(1, n):\n dp_odd[i] = max(dp_even[i - 1] + a[i], dp_odd[i - 1]) if a[i] % 2 == 1 else -float(\"inf\")\n dp_even[i] = max(dp_odd[i - 1] + a[i], dp_even[i - 1]) if a[i] % 2 == 0 else -float(\"inf\")\n print(max(dp_odd[-1], dp_even[-1]))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import Counter\n\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n c = Counter(a)\n ans = 0\n for i in c:\n ans += c[i] * (c[i] - 1) // 2\n print(ans)", "from collections import Counter\n\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n c = Counter(a)\n ans = 0\n for i in c:\n ans += c[i] * (c[i] - 1) // 2\n print(ans)", "from collections import Counter\n\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n c = Counter(a)\n ans = 0\n for i in c:\n ans += c[i] * (c[i] - 1) // 2\n print(ans)", "from collections import Counter\n\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n c = Counter(a)\n ans = 0\n for i in c:\n ans += c[i] * (c[i] - 1) // 2\n print(ans)", "from collections import Counter\n\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n c = Counter(a)\n ans = 0\n for i in c:\n ans += c[i] * (c[i] - 1) // 2\n print(ans)", "def gcd(a, b):\r\n while b:\r\n (a, b) = (b, a % b)\r\n return a\r\n\r\n\r\ndef f(a, b):\r\n return a == b or gcd(a, b) != 1\r\n\r\n\r\ndef main():\r\n t = int(input())\r\n for _ in range(t):\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n ans = 0\r\n for i in range(n):\r\n for j in range(i + 1, n):\r\n if f(a[i], a[j]):\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nmain()\r", "from collections import Counter\n\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n c = Counter(a)\n ans = 0\n for i in c:\n ans += c[i] * (c[i] - 1) // 2\n print(ans)", "from collections import Counter\n\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n c = Counter(a)\n ans = 0\n for i in c:\n if i == 0:\n ans += c[i] * (c[i] - 1) // 2\n elif i == 1:\n ans += c[i] * (c[i] - 1)\n else:\n ans += c[i] * (c[2 * i] + c[i // 2])\n print(ans)", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\ndef solve(n, a):\r\n d = {}\r\n for i in a:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n ans = 0\r\n for i in d:\r\n ans += d[i] * (d[i] - 1) // 2\r\n return ans\r\n\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n print(solve(n, a))\r", "from collections import Counter\n\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int, input().split()))\n c = Counter(a)\n ans = 0\n for i in c:\n ans += c[i] * (c[i] - 1) // 2\n print(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countSeniors(self, details: List[str]) -> int:\n count = 0\n for detail in details:\n age = int(detail[11:13])\n if age > 60:\n count += 1\n return count", "class Solution:\n def countSeniors(self, details: List[str]) -> int:\n count = 0\n for detail in details:\n age = int(detail[11:13])\n if age > 60:\n count += 1\n return count", "class Solution:\n def countSeniors(self, details: List[str]) -> int:\n count = 0\n for detail in details:\n age = int(detail[11:13])\n if age > 60:\n count += 1\n return count", "class Solution:\n def countSeniors(self, details: List[str]) -> int:\n count = 0\n for detail in details:\n age = int(detail[11:13])\n if age > 60:\n count += 1\n return count", "class Solution:\n def countSeniors(self, details: List[str]) -> int:\n count = 0\n for detail in details:\n age = int(detail[11:13])\n if age > 60:\n count += 1\n return count", "class Solution:\n def countSeniors(self, details: List[str]) -> int:\n count = 0\n for detail in details:\n age = int(detail[11:13])\n if age > 60:\n count += 1\n return count", "class Solution:\n def countSeniors(self, details: List[str]) -> int:\n count = 0\n for detail in details:\n age = int(detail[11:13])\n if age > 60:\n count += 1\n return count", "class Solution:\n def countSeniors(self, details: List[str]) -> int:\n count = 0\n for detail in details:\n age = int(detail[11:13])\n if age > 60:\n count += 1\n return count", "class Solution:\n def countSeniors(self, details: List[str]) -> int:\n count = 0\n for detail in details:\n age = int(detail[11:13])\n if age > 60:\n count += 1\n return count", "class Solution:\n def countSeniors(self, details: List[str]) -> int:\n count = 0\n for detail in details:\n age = int(detail[11:13])\n if age > 60:\n count += 1\n return count" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def matrixSum(self, nums: List[List[int]]) -> int:\n score = 0\n while nums:\n max_num = max(row[-1] for row in nums)\n score += max_num\n for row in nums:\n row.pop()\n return score", "class Solution:\n def matrixSum(self, nums: List[List[int]]) -> int:\n score = 0\n while nums:\n max_num = max(row[-1] for row in nums)\n score += max_num\n for row in nums:\n row.pop()\n return score", "class Solution:\n def matrixSum(self, nums: List[List[int]]) -> int:\n score = 0\n while nums:\n max_num = max(row[-1] for row in nums)\n score += max_num\n for row in nums:\n row.pop()\n return score", "class Solution:\n def matrixSum(self, nums: List[List[int]]) -> int:\n score = 0\n while nums:\n max_num = max(row[-1] for row in nums)\n score += max_num\n for row in nums:\n row.pop()\n return score", "class Solution:\n def matrixSum(self, nums: List[List[int]]) -> int:\n score = 0\n while nums:\n max_num = max(row[-1] for row in nums)\n score += max_num\n for row in nums:\n row.pop()\n return score", "class Solution:\n def matrixSum(self, nums: List[List[int]]) -> int:\n score = 0\n while nums:\n max_num = max(row[-1] for row in nums)\n score += max_num\n for row in nums:\n row.pop()\n return score", "class Solution:\n def matrixSum(self, nums: List[List[int]]) -> int:\n score = 0\n while nums:\n max_num = max(row[-1] for row in nums)\n score += max_num\n for row in nums:\n row.pop()\n return score", "class Solution:\n def matrixSum(self, nums: List[List[int]]) -> int:\n score = 0\n while nums:\n max_num = max(row[-1] for row in nums)\n score += max_num\n for row in nums:\n row.pop()\n return score", "class Solution:\n def matrixSum(self, nums: List[List[int]]) -> int:\n score = 0\n while nums:\n max_num = max(row[-1] for row in nums)\n score += max_num\n for row in nums:\n row.pop()\n return score", "class Solution:\n def matrixSum(self, nums: List[List[int]]) -> int:\n score = 0\n while nums:\n max_num = max(row[-1] for row in nums)\n for row in nums:\n row.pop()\n score += max_num\n return score" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumOr(self, nums: List[int], k: int) -> int:\n def calc(x, k):\n for _ in range(k):\n x = x * 2\n return x\n\n nums.sort(key=lambda x: calc(x, k), reverse=True)\n res = 0\n for i in range(len(nums)):\n res |= nums[i]\n k -= 1\n if k < 0:\n break\n return res", "class Solution:\n def maximumOr(self, nums: List[int], k: int) -> int:\n def calculate_max_or(nums, k):\n max_or = 0\n for num in nums:\n max_or |= num\n return max_or\n\n def apply_operation(nums, index, k):\n if k > 0:\n nums[index] *= 2\n k -= 1\n return nums, k\n\n def backtrack(nums, k, max_or):\n if k == 0:\n return max_or\n max_or = 0\n for i in range(len(nums)):\n nums, k = apply_operation(nums, i, k)\n max_or = max(max_or, backtrack(nums, k, calculate_max_or(nums, 0)))\n nums, k = apply_operation(nums, i, k + 1)\n return max_or\n\n return backtrack(nums, k, 0)", "class Solution:\n def maximumOr(self, nums: List[int], k: int) -> int:\n def count_zeros(num):\n cnt = 0\n while num % 2 == 0:\n cnt += 1\n num //= 2\n return cnt\n\n nums.sort(key=count_zeros, reverse=True)\n result = 0\n for num in nums:\n result |= num\n if count_zeros(result) >= k:\n break\n k -= count_zeros(num)\n return result", "class Solution:\n def maximumOr(self, nums: List[int], k: int) -> int:\n def calc(x, k):\n for _ in range(k):\n x = x * 2\n return x\n\n nums.sort(key=lambda x: calc(x, k), reverse=True)\n res = 0\n for num in nums:\n res |= num\n return res", "class Solution:\n def maximumOr(self, nums: List[int], k: int) -> int:\n def calc(x, k):\n cnt = 0\n while k > 0 and x % 2 == 0:\n x *= 2\n k -= 1\n cnt += 1\n return x, cnt\n\n n = len(nums)\n if k >= n:\n res = 0\n for num in nums:\n res |= num\n while k > 0 and res % 2 == 0:\n res *= 2\n k -= 1\n return res\n\n nums.sort(reverse=True)\n res = 0\n for i in range(n):\n x, cnt = calc(nums[i], k)\n res |= x\n k -= cnt\n if k == 0:\n break\n return res", "class Solution:\n def maximumOr(self, nums: List[int], k: int) -> int:\n def count_zeros(num):\n return num.bit_length() - 1\n\n max_or = 0\n for num in nums:\n max_or |= num\n\n for num in nums:\n zeros = count_zeros(num)\n if zeros <= k:\n max_or |= 1 << k - zeros\n\n return max_or", "class Solution:\n def maximumOr(self, nums: List[int], k: int) -> int:\n def count_zeros(num):\n count = 0\n while num & 1 == 0:\n count += 1\n num >>= 1\n return count\n\n nums.sort(key=count_zeros, reverse=True)\n\n result = 0\n for num in nums:\n result |= num\n if count_zeros(num) <= k:\n break\n\n return result << max(0, k - count_zeros(result))", "class Solution:\n def maximumOr(self, nums: List[int], k: int) -> int:\n def calc(target, num):\n count = 0\n while num < target:\n num *= 2\n count += 1\n return count\n\n nums.sort(reverse=True)\n target = 0\n for num in nums:\n target |= num\n if k >= calc(target, num):\n target = (target - num) | (num * 2)\n k -= calc(target, num)\n if k == 0:\n break\n return target", "class Solution:\n def maximumOr(self, nums: List[int], k: int) -> int:\n def calculate_max_or(nums, k):\n n = len(nums)\n # Initialize max_or with the bitwise OR of the first k+1 elements\n max_or = 0\n for i in range(min(k+1, n)):\n max_or |= nums[i]\n\n # Iterate through the remaining elements\n for i in range(k+1, n):\n # If the current element has a higher bit than max_or, we must include it\n if nums[i] > max_or:\n max_or = (max_or << 1) | nums[i]\n # Otherwise, we can double the current max_or k times\n else:\n max_or <<= k\n return max_or\n\n # Sort the array in descending order\n nums.sort(reverse=True)\n # Initialize max_or with the value when no operations are applied\n max_or = calculate_max_or(nums, 0)\n # Apply operations and update max_or\n for i in range(1, min(k, len(nums)) + 1):\n max_or = max(max_or, calculate_max_or(nums, i))\n return max_or", "class Solution:\n def maximumOr(self, nums: List[int], k: int) -> int:\n def count_zeros(num):\n return num.bit_length() - 1\n\n max_or = 0\n zeros_needed = k\n\n for num in nums:\n zeros = count_zeros(num)\n if zeros <= zeros_needed:\n max_or |= 1 << zeros\n zeros_needed -= zeros\n\n return max_or" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxStrength(self, nums: List[int]) -> int:\n pos = [num for num in nums if num > 0]\n neg = [num for num in nums if num < 0]\n if not pos:\n return max(nums)\n if not neg:\n return max(nums) * len(nums)\n ans = 0\n for i in range(len(neg) + 1):\n for j in range(len(pos) + 1):\n if i + j == 0:\n continue\n ans = max(ans, max(neg[-i:] if i else [0]) * max(pos[-j:] if j else [0]) * i * j)\n return ans", "class Solution:\n def maxStrength(self, nums: List[int]) -> int:\n from itertools import product\n\n all_subsets = list(product([-1, 1], repeat=len(nums)))\n max_strength = 0\n for subset in all_subsets:\n strength = 1\n for index, sign in enumerate(subset):\n strength *= nums[index] * sign\n max_strength = max(max_strength, abs(strength))\n\n return max_strength", "class Solution:\n def maxStrength(self, nums: List[int]) -> int:\n from itertools import product\n\n all_subsets = list(product([0, 1], repeat=len(nums)))\n max_strength = 0\n\n for subset in all_subsets:\n strength = 1\n for i, is_included in enumerate(subset):\n if is_included:\n strength *= nums[i]\n max_strength = max(max_strength, abs(strength))\n\n return max_strength", "class Solution:\n def maxStrength(self, nums: List[int]) -> int:\n from itertools import product\n\n all_subsets = list(product([-1, 1], repeat=len(nums)))\n strengths = [\n abs(prod) for prod in [sum(x * y for x, y in zip(nums, subset)) for subset in all_subsets]\n ]\n return max(strengths)", "class Solution:\n def maxStrength(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[0] * (1 << n) for _ in range(n)]\n for i in range(n):\n dp[i][1 << i] = nums[i]\n\n for mask in range(1 << n):\n for i in range(n):\n if mask & (1 << i):\n for j in range(n):\n if i != j and mask & (1 << j):\n dp[j][mask] = max(dp[j][mask], dp[j][mask ^ (1 << i)] * nums[i])\n\n ans = 0\n for mask in range(1 << n):\n ans = max(ans, abs(dp[0][mask]))\n return ans", "class Solution:\n def maxStrength(self, nums: List[int]) -> int:\n pos = [num for num in nums if num > 0]\n neg = [num for num in nums if num < 0]\n if not pos:\n return max(nums)\n if not neg:\n return max(nums) * len(nums)\n ans = 0\n for i in range(len(neg) + 1):\n for j in range(len(pos) + 1):\n if i + j == 0:\n continue\n ans = max(ans, max(neg[-i:] if i else [0]) * max(pos[-j:] if j else [0]) * i * j)\n return ans", "class Solution:\n def maxStrength(self, nums: List[int]) -> int:\n from itertools import product\n\n all_subsets = list(product([0, 1], repeat=len(nums)))\n max_strength = 0\n for subset in all_subsets:\n strength = 1\n for index, is_included in enumerate(subset):\n if is_included:\n strength *= nums[index]\n max_strength = max(max_strength, abs(strength))\n\n return max_strength", "class Solution:\n def maxStrength(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [0] * (1 << n)\n for i in range(1 << n):\n dp[i] = float('-inf')\n\n for i in range(n):\n dp[1 << i] = nums[i]\n\n for i in range(1 << n):\n for j in range(n):\n if dp[i] != float('-inf') and dp[i | (1 << j)] < dp[i] * nums[j]:\n dp[i | (1 << j)] = dp[i] * nums[j]\n\n ans = float('-inf')\n for i in range(1 << n):\n ans = max(ans, dp[i])\n\n return ans", "class Solution:\n def maxStrength(self, nums: List[int]) -> int:\n pos = [num for num in nums if num > 0]\n neg = [num for num in nums if num < 0]\n if not pos or not neg:\n return max(nums) ** len(nums)\n\n dp = [[0] * (len(neg) + 1) for _ in range(len(pos) + 1)]\n for i in range(len(pos) - 1, -1, -1):\n for j in range(len(neg)):\n dp[i][j] = max(dp[i][j], dp[i + 1][j], dp[i][j + 1], pos[i] * neg[j])\n\n return max(dp[0][0], max(pos) ** len(pos) * max(neg) ** len(neg))", "class Solution:\n def maxStrength(self, nums: List[int]) -> int:\n from itertools import product\n\n all_subsets = list(product([0, 1], repeat=len(nums)))\n max_strength = 0\n\n for subset in all_subsets:\n strength = 1\n for i, is_included in enumerate(subset):\n if is_included:\n strength *= nums[i]\n max_strength = max(max_strength, abs(strength))\n\n return max_strength" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minExtraChar(self, s: str, dictionary: list[str]) -> int:\n dp = [float('inf')] * (len(s) + 1)\n dp[0] = 0\n\n for i in range(len(s)):\n for word in dictionary:\n if s[i - len(word) + 1: i + 1] == word:\n dp[i + 1] = min(dp[i + 1], dp[i - len(word) + 1] + (len(word) - 1) * (s[i] != word[0]))\n\n return dp[-1]", "class Solution:\n def minExtraChar(self, s: str, dictionary: list[str]) -> int:\n dp = [float('inf')] * (len(s) + 1)\n dp[0] = 0\n\n for i in range(len(s)):\n for word in dictionary:\n if s[i - len(word) + 1: i + 1] == word:\n dp[i + 1] = min(dp[i + 1], dp[i - len(word) + 1] + (len(word) - 1) * (s[i] != word[0]))\n\n return dp[-1]", "class Solution:\n def minExtraChar(self, s: str, dictionary: list[str]) -> int:\n dp = [float('inf')] * (len(s) + 1)\n dp[0] = 0\n for i in range(len(s)):\n for word in dictionary:\n if s[i - len(word) + 1: i + 1] == word:\n dp[i + 1] = min(dp[i + 1], dp[i - len(word) + 1] + (len(word) == 1))\n return dp[-1]", "class Solution:\n def minExtraChar(self, s: str, dictionary: list[str]) -> int:\n dp = [float('inf')] * (len(s) + 1)\n dp[0] = 0\n\n for i in range(len(s) + 1):\n for word in dictionary:\n if i + len(word) <= len(s) and s[i:i + len(word)] == word:\n dp[i + len(word)] = min(dp[i + len(word)], dp[i] + 1)\n\n return dp[-1]", "class Solution:\n def minExtraChar(self, s: str, dictionary: list[str]) -> int:\n dp = [float('inf')] * (len(s) + 1)\n dp[0] = 0\n for i in range(len(s)):\n for word in dictionary:\n if s[i - len(word) + 1:i + 1] == word:\n dp[i + 1] = min(dp[i + 1], dp[i - len(word) + 1] + (len(word) - 1) * (s[i] != word[0]))\n return dp[-1]", "class Solution:\n def minExtraChar(self, s: str, dictionary: list[str]) -> int:\n dp = [float('inf')] * (len(s) + 1)\n dp[0] = 0\n\n for i in range(len(s)):\n for word in dictionary:\n if s[i - len(word) + 1:i + 1] == word:\n dp[i + 1] = min(dp[i + 1], dp[i - len(word) + 1] + (len(word) == 1))\n\n return dp[-1]", "class Solution:\n def minExtraChar(self, s: str, dictionary: list[str]) -> int:\n dp = [float('inf')] * (len(s) + 1)\n dp[0] = 0\n\n for i in range(len(s)):\n for word in dictionary:\n if s[i - len(word) + 1: i + 1] == word:\n dp[i + 1] = min(dp[i + 1], dp[i - len(word) + 1] + (len(word) - 1) * (s[i] != word[-1]))\n\n return dp[-1]", "class Solution:\n def minExtraChar(self, s: str, dictionary: list[str]) -> int:\n dp = [float('inf')] * (len(s) + 1)\n dp[0] = 0\n\n for i in range(len(s)):\n for word in dictionary:\n if word in s[i:]:\n j = i + len(word)\n dp[j] = min(dp[j], dp[i] + (j - i) - len(word))\n\n return dp[-1]", "class Solution:\n def minExtraChar(self, s: str, dictionary: list[str]) -> int:\n dp = [float('inf')] * (len(s) + 1)\n dp[0] = 0\n\n for i in range(len(s)):\n for word in dictionary:\n if s[i - len(word) + 1: i + 1] == word:\n dp[i + 1] = min(dp[i + 1], dp[i - len(word) + 1] + (len(word) - 1) * (s[i] != word[0]))\n\n return dp[-1]", "class Solution:\n def minExtraChar(self, s: str, dictionary: list[str]) -> int:\n dp = [float('inf')] * (len(s) + 1)\n dp[0] = 0\n\n for i in range(len(s)):\n for word in dictionary:\n if len(word) <= i + 1:\n continue\n if all(s[j] == word[k] for j, k in enumerate(range(i + 1 - len(word), i + 1))):\n dp[i + 1] = min(dp[i + 1], dp[i - len(word) + 1] + 1)\n\n return dp[-1]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def buyChoco(self, prices: List[int], money: int) -> int:\n prices.sort()\n for i in range(len(prices)):\n for j in range(i + 1, len(prices)):\n if money - prices[i] - prices[j] >= 0:\n return money - prices[i] - prices[j]\n return money", "class Solution:\n def buyChoco(self, prices: List[int], money: int) -> int:\n prices.sort()\n for i in range(len(prices)):\n for j in range(i + 1, len(prices)):\n if money - prices[i] - prices[j] >= 0:\n return money - prices[i] - prices[j]\n return money", "class Solution:\n def buyChoco(self, prices: List[int], money: int) -> int:\n prices.sort()\n for i in range(len(prices)):\n for j in range(i + 1, len(prices)):\n if money - prices[i] - prices[j] >= 0:\n return money - prices[i] - prices[j]\n return money", "class Solution:\n def buyChoco(self, prices: List[int], money: int) -> int:\n prices.sort()\n for i in range(len(prices)):\n for j in range(i + 1, len(prices)):\n if money - prices[i] - prices[j] >= 0:\n return money - prices[i] - prices[j]\n return money", "class Solution:\n def buyChoco(self, prices: List[int], money: int) -> int:\n prices.sort()\n for i in range(len(prices)):\n for j in range(i + 1, len(prices)):\n if money - prices[i] - prices[j] >= 0:\n return money - prices[i] - prices[j]\n return money", "class Solution:\n def buyChoco(self, prices: List[int], money: int) -> int:\n prices.sort()\n for i in range(len(prices)):\n for j in range(i + 1, len(prices)):\n if money - prices[i] - prices[j] >= 0:\n return money - prices[i] - prices[j]\n return money", "class Solution:\n def buyChoco(self, prices: List[int], money: int) -> int:\n prices.sort()\n for i in range(len(prices)):\n for j in range(i + 1, len(prices)):\n if money >= prices[i] + prices[j]:\n return money - prices[i] - prices[j]\n return money", "class Solution:\n def buyChoco(self, prices: List[int], money: int) -> int:\n prices.sort()\n for i in range(len(prices)):\n for j in range(i + 1, len(prices)):\n if money - prices[i] - prices[j] >= 0:\n return money - prices[i] - prices[j]\n return money", "class Solution:\n def buyChoco(self, prices: List[int], money: int) -> int:\n prices.sort()\n for i in range(len(prices)):\n for j in range(i + 1, len(prices)):\n if money - prices[i] - prices[j] >= 0:\n return money - prices[i] - prices[j]\n return money", "class Solution:\n def buyChoco(self, prices: List[int], money: int) -> int:\n prices.sort()\n for i in range(len(prices)):\n for j in range(i + 1, len(prices)):\n if money - prices[i] - prices[j] >= 0:\n return money - prices[i] - prices[j]\n return money" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def count(self, num1: str, num2: str, min_sum: int, max_sum: int) -> int:\n mod = 10**9 + 7\n max_digit_sum = 0\n min_digit_sum = 0\n for i in range(len(num1), len(num2) + 1):\n max_digit_sum = max_digit_sum * 10 + 9\n if i == len(num1):\n min_digit_sum = max_digit_sum\n else:\n min_digit_sum = min_digit_sum * 10 + int(num1[i - len(num1)])\n \n count = 0\n for i in range(len(num1), len(num2) + 1):\n if min_sum <= min_digit_sum <= max_sum:\n count = (count + max_digit_sum - min_digit_sum + 1) % mod\n if min_sum <= max_digit_sum <= max_sum:\n count = (count + 1) % mod\n if i < len(num2):\n max_digit_sum = max_digit_sum // 10\n min_digit_sum = min_digit_sum // 10\n return count", "class Solution:\n def count(self, num1: str, num2: str, min_sum: int, max_sum: int) -> int:\n mod = 10**9 + 7\n max_digit_sum = 0\n min_digit_sum = 0\n for i in range(len(num1)):\n max_digit = int(num2[i]) if i < len(num2) else 0\n min_digit = int(num1[i]) if i < len(num1) else 9\n max_digit_sum += max_digit\n min_digit_sum += min_digit\n \n count = 0\n for digit_sum in range(min_sum, max_sum + 1):\n max_good = max_digit_sum - digit_sum\n min_good = min_digit_sum - digit_sum\n if max_good >= 0 and min_good <= 0:\n count += 1\n \n return count % mod", "class Solution:\n def count(self, num1: str, num2: str, min_sum: int, max_sum: int) -> int:\n mod = 10**9 + 7\n max_digit_sum = 0\n min_digit_sum = 0\n for i in range(len(num1), len(num2) + 1):\n max_digit_sum = max_digit_sum * 10 + 9\n if i <= len(num2):\n min_digit_sum = min_digit_sum * 10 + int(num2[-(i + 1)])\n else:\n min_digit_sum = min_digit_sum * 10 + 0\n \n count = 0\n for i in range(len(num1), len(num2) + 1):\n if min_sum <= min_digit_sum <= max_sum:\n count = (count + max_digit_sum - min_digit_sum + 1) % mod\n if min_sum <= max_digit_sum <= max_sum:\n count = (count + max_digit_sum - max_digit_sum + 1) % mod\n max_digit_sum //= 10\n if i <= len(num2):\n min_digit_sum //= 10\n \n return count", "class Solution:\n def count(self, num1: str, num2: str, min_sum: int, max_sum: int) -> int:\n mod = 10**9 + 7\n max_digit_sum = 0\n min_digit_sum = 0\n for i in range(len(num1)):\n max_digit = int(num2[i]) if i < len(num2) else 0\n min_digit = int(num1[i]) if i < len(num1) else 9\n max_digit_sum += max_digit\n min_digit_sum += min_digit\n \n max_count = max_digit_sum - min_sum + 1\n min_count = min_digit_sum - min_sum + 1\n \n if min_count <= 0 or min_digit_sum > max_sum:\n min_count = 0\n if max_digit_sum > max_sum:\n max_count = 0\n \n return (max_count - min_count + mod) % mod", "class Solution:\n def count(self, num1: str, num2: str, min_sum: int, max_sum: int) -> int:\n mod = 10**9 + 7\n max_digit_sum = 0\n min_digit_sum = 0\n for digit in num1:\n max_digit_sum += int(digit)\n for digit in num2:\n min_digit_sum += int(digit)\n\n if max_digit_sum < min_sum or min_digit_sum > max_sum:\n return 0\n\n def calculate_sum(n):\n sum = 0\n for digit in n:\n sum += int(digit)\n return sum\n\n def count_numbers_in_range(low, high):\n if low > high:\n return 0\n if low == high:\n return 1\n\n mid = (low + high) // 2\n left_sum = calculate_sum(str(mid - 1))\n right_sum = calculate_sum(str(mid))\n\n if left_sum < min_sum and right_sum >= min_sum:\n offset = min_sum - right_sum\n elif left_sum >= min_sum and right_sum < min_sum:\n offset = min_sum - left_sum\n else:\n offset = 0\n\n if right_sum > max_sum and left_sum <= max_sum:\n offset -= right_sum - max_sum\n elif right_sum <= max_sum and left_sum > max_sum:\n offset -= left_sum - max_sum\n else:\n offset -= 0\n\n return (count_numbers_in_range(low, mid - 1)\n + count_numbers_in_range(mid + 1, high)\n + (mid - low + 1 - offset) % mod) % mod\n\n return count_numbers_range(int(num1), int(num2)) % mod", "class Solution:\n def count(self, num1: str, num2: str, min_sum: int, max_sum: int) -> int:\n mod = 10**9 + 7\n max_digit_sum = 0\n min_digit_sum = 0\n for digit in num1:\n max_digit_sum += int(digit)\n for digit in num2:\n min_digit_sum += int(digit)\n\n if max_digit_sum < min_sum or min_digit_sum > max_sum:\n return 0\n\n max_len = len(num1)\n min_len = len(num2)\n if len(num1) < len(num2):\n max_len = len(num2)\n min_len = len(num1)\n\n dp = [[0] * (max_sum + 1) for _ in range(max_len + 1)]\n for i in range(min_len, max_len + 1):\n dp[i][0] = 1\n\n for i in range(1, max_len + 1):\n for j in range(1, max_sum + 1):\n dp[i][j] = (dp[i][j - 1] + dp[i - 1][j - 9]) % mod\n\n result = 0\n for i in range(min_len, max_len + 1):\n result = (result + dp[i][max_sum] - dp[i][min_sum - 1]) % mod\n\n return result", "class Solution:\n def count(self, num1: str, num2: str, min_sum: int, max_sum: int) -> int:\n mod = 10**9 + 7\n max_digit_sum = 0\n min_digit_sum = 0\n for digit in num1:\n max_digit_sum += int(digit)\n for digit in num2:\n min_digit_sum += int(digit)\n\n if max_digit_sum < min_sum or min_digit_sum > max_sum:\n return 0\n\n max_len = len(num1)\n min_len = len(num2)\n if len(num1) < len(num2):\n max_len = len(num2)\n min_len = len(num1)\n\n dp = [[0] * (max_sum + 1) for _ in range(max_len + 1)]\n for i in range(min_len, max_len + 1):\n dp[i][0] = 1\n\n for i in range(1, max_len + 1):\n for j in range(1, max_sum + 1):\n dp[i][j] = (dp[i][j - 1] + dp[i - 1][j - 1] * 9) % mod\n if i == 1:\n dp[i][j] -= int(num1[0] > str(j - 1))\n dp[i][j] += int(num2[0] >= str(j))\n else:\n dp[i][j] -= int(num1[i - 1] > str(j - 1))\n dp[i][j] += int(num2[i - 1] >= str(j))\n dp[i][j] %= mod\n\n ans = 0\n for j in range(min_sum, max_sum + 1):\n ans = (ans + dp[max_len][j]) % mod\n\n return ans", "class Solution:\n def count(self, num1: str, num2: str, min_sum: int, max_sum: int) -> int:\n mod = 10**9 + 7\n max_digit_sum = 0\n min_digit_sum = 0\n for digit in num1:\n max_digit_sum += int(digit)\n for digit in num2:\n min_digit_sum += int(digit)\n\n if max_digit_sum < min_sum or min_digit_sum > max_sum:\n return 0\n\n dp = [0] * 10\n dp[0] = 1\n for digit in num1:\n new_dp = [0] * 10\n for i in range(10):\n for j in range(10):\n if i + j <= 9:\n new_dp[i + j] += dp[i]\n else:\n carry = i + j - 9\n new_dp[carry] += dp[i]\n dp = new_dp\n\n ans = 0\n for digit in num2:\n ans = (ans + dp[int(digit) - '0']) % mod\n\n return ans", "class Solution:\n def count(self, num1: str, num2: str, min_sum: int, max_sum: int) -> int:\n mod = 10**9 + 7\n max_digit_sum = 0\n min_digit_sum = 0\n for digit in num1:\n max_digit_sum += int(digit)\n for digit in num2:\n min_digit_sum += int(digit)\n\n if max_digit_sum < min_sum or min_digit_sum > max_sum:\n return 0\n\n max_len = len(num1)\n min_len = len(num2)\n if len(num1) < len(num2):\n max_len = len(num2)\n min_len = len(num1)\n\n dp = [[0] * (max_sum + 1) for _ in range(max_len + 1)]\n dp[0][0] = 1\n\n for i in range(1, max_len + 1):\n for j in range(min_sum, max_sum + 1):\n for d in range(10):\n if j - d >= min_sum:\n dp[i][j] += dp[i - 1][j - d]\n dp[i][j] %= mod\n\n ans = 0\n for i in range(min_len, max_len + 1):\n for j in range(min_sum, max_sum + 1):\n ans += dp[i][j]\n ans %= mod\n\n return ans", "class Solution:\n def count(self, num1: str, num2: str, min_sum: int, max_sum: int) -> int:\n mod = 10**9 + 7\n max_digit_sum = 0\n min_digit_sum = 0\n for i in range(len(num1)):\n max_digit = int(num1[i])\n min_digit = int(num2[i]) if i < len(num2) else 0\n max_digit_sum += max_digit\n min_digit_sum += min_digit\n\n if min_digit_sum > max_sum or max_digit_sum < min_sum:\n return 0\n\n dp = [0] * 10\n dp[0] = 1\n digit_sums = [0]\n for digit in num1:\n for i in range(9, int(digit) - 1, -1):\n dp[i] = 0\n for i in range(int(digit)):\n dp[i] = (dp[i] + dp[i - int(digit)]) % mod\n digit_sums.append(int(digit))\n for i in range(10):\n digit_sums[-1] += dp[i] * i\n\n ans = 0\n for i in range(min_sum, max_sum + 1):\n for j in range(len(digit_sums) - 1):\n if digit_sums[j] == i:\n ans = (ans + dp[i - 1]) % mod\n break\n\n return ans" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def distinctDifferenceArray(self, nums: List[int]) -> List[int]:\n n = len(nums)\n diff = [0] * n\n distinct_prefix = set()\n distinct_suffix = set(nums)\n\n for i in range(n):\n distinct_suffix.remove(nums[i])\n diff[i] = len(distinct_prefix) - len(distinct_suffix)\n distinct_prefix.add(nums[i])\n\n return diff", "class Solution:\n def distinctDifferenceArray(self, nums: List[int]) -> List[int]:\n n = len(nums)\n diff = [0] * n\n distinct_prefix = set()\n distinct_suffix = set(nums)\n\n for i in range(n):\n distinct_suffix.remove(nums[i])\n diff[i] = len(distinct_prefix) - len(distinct_suffix)\n distinct_prefix.add(nums[i])\n\n return diff", "class Solution:\n def distinctDifferenceArray(self, nums: List[int]) -> List[int]:\n n = len(nums)\n diff = [0] * n\n distinct_prefix = set()\n distinct_suffix = set(nums)\n \n for i in range(n):\n distinct_suffix.remove(nums[i])\n diff[i] = len(distinct_prefix) - len(distinct_suffix)\n distinct_prefix.add(nums[i])\n \n return diff", "class Solution:\n def distinctDifferenceArray(self, nums: List[int]) -> List[int]:\n n = len(nums)\n diff = [0] * n\n distinct_prefix = set()\n distinct_suffix = set(nums)\n \n for i in range(n):\n distinct_suffix.remove(nums[i])\n diff[i] = len(distinct_prefix) - len(distinct_suffix)\n distinct_prefix.add(nums[i])\n \n return diff", "class Solution:\n def distinctDifferenceArray(self, nums: List[int]) -> List[int]:\n n = len(nums)\n diff = [0] * n\n distinct_prefix = set()\n distinct_suffix = set(nums)\n\n for i in range(n):\n distinct_suffix.remove(nums[i])\n diff[i] = len(distinct_prefix) - len(distinct_suffix)\n distinct_prefix.add(nums[i])\n\n return diff", "class Solution:\n def distinctDifferenceArray(self, nums: List[int]) -> List[int]:\n n = len(nums)\n diff = [0] * n\n distinct_prefix = set()\n distinct_suffix = set(nums)\n\n for i in range(n):\n distinct_suffix.remove(nums[i])\n diff[i] = len(distinct_prefix) - len(distinct_suffix)\n distinct_prefix.add(nums[i])\n\n return diff", "class Solution:\n def distinctDifferenceArray(self, nums: List[int]) -> List[int]:\n n = len(nums)\n diff = [0] * n\n distinct_prefix = set()\n distinct_suffix = set(nums)\n\n for i in range(n):\n distinct_suffix.remove(nums[i])\n diff[i] = len(distinct_prefix) - len(distinct_suffix)\n distinct_prefix.add(nums[i])\n\n return diff", "class Solution:\n def distinctDifferenceArray(self, nums: List[int]) -> List[int]:\n n = len(nums)\n diff = [0] * n\n distinct_prefix = set()\n distinct_suffix = set(nums)\n \n for i in range(n):\n distinct_suffix.remove(nums[i])\n diff[i] = len(distinct_prefix) - len(distinct_suffix)\n distinct_prefix.add(nums[i])\n \n return diff", "class Solution:\n def distinctDifferenceArray(self, nums: List[int]) -> List[int]:\n n = len(nums)\n diff = [0] * n\n distinct_prefix = set()\n distinct_suffix = set(nums)\n\n for i in range(n):\n distinct_suffix.remove(nums[i])\n diff[i] = len(distinct_prefix) - len(distinct_suffix)\n distinct_prefix.add(nums[i])\n\n return diff", "class Solution:\n def distinctDifferenceArray(self, nums: List[int]) -> List[int]:\n n = len(nums)\n diff = [0] * n\n distinct_prefix = set()\n distinct_suffix = set(nums)\n\n for i in range(n):\n distinct_suffix.remove(nums[i])\n diff[i] = len(distinct_prefix) - len(distinct_suffix)\n distinct_prefix.add(nums[i])\n\n return diff" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def colorTheArray(self, n: int, queries: List[List[int]]) -> List[int]:\n nums = [0] * n\n count = 0\n answer = []\n\n for query in queries:\n index, color = query\n nums[index] = color\n if index > 0 and nums[index - 1] == color:\n count += 1\n if index < n - 1 and nums[index + 1] == color:\n count += 1\n answer.append(count)\n\n return answer", "class Solution:\n def colorTheArray(self, n: int, queries: List[List[int]]) -> List[int]:\n nums = [0] * n\n count = 0\n answer = []\n\n for index, color in queries:\n nums[index] = color\n if index > 0 and nums[index - 1] == color:\n count += 1\n if index < n - 1 and nums[index + 1] == color:\n count += 1\n\n answer.append(count)\n\n return answer", "class Solution:\n def colorTheArray(self, n: int, queries: List[List[int]]) -> List[int]:\n nums = [0] * n\n count = 0\n answer = []\n\n for query in queries:\n index, color = query\n nums[index] = color\n if index > 0 and nums[index - 1] == color:\n count += 1\n if index < n - 1 and nums[index + 1] == color:\n count += 1\n answer.append(count)\n\n return answer", "class Solution:\n def colorTheArray(self, n: int, queries: List[List[int]]) -> List[int]:\n nums = [0] * n\n count = 0\n answer = []\n\n for query in queries:\n index, color = query\n nums[index] = color\n if index > 0 and nums[index - 1] == color:\n count += 1\n if index < n - 1 and nums[index + 1] == color:\n count += 1\n answer.append(count)\n\n return answer", "class Solution:\n def colorTheArray(self, n: int, queries: List[List[int]]) -> List[int]:\n nums = [0] * n\n count = 0\n answer = []\n\n for query in queries:\n index, color = query\n nums[index] = color\n if index > 0 and nums[index - 1] == color:\n count += 1\n if index < n - 1 and nums[index + 1] == color:\n count += 1\n answer.append(count)\n\n return answer", "class Solution:\n def colorTheArray(self, n: int, queries: List[List[int]]) -> List[int]:\n nums = [0] * n\n count = 0\n answer = []\n\n for query in queries:\n index, color = query\n nums[index] = color\n if index > 0 and nums[index - 1] == color:\n count += 1\n if index < n - 1 and nums[index + 1] == color:\n count += 1\n answer.append(count)\n\n return answer", "class Solution:\n def colorTheArray(self, n: int, queries: List[List[int]]) -> List[int]:\n nums = [0] * n\n answer = [0] * len(queries)\n count = 0\n\n for i, query in enumerate(queries):\n index, color = query\n nums[index] = color\n if index > 0 and nums[index - 1] == color:\n count += 1\n if index < n - 1 and nums[index + 1] == color:\n count += 1\n answer[i] = count\n\n return answer", "class Solution:\n def colorTheArray(self, n: int, queries: List[List[int]]) -> List[int]:\n nums = [0] * n\n count = 0\n answer = []\n\n for query in queries:\n index, color = query\n nums[index] = color\n if index > 0 and nums[index - 1] == color:\n count += 1\n if index < n - 1 and nums[index + 1] == color:\n count += 1\n answer.append(count)\n\n return answer", "class Solution:\n def colorTheArray(self, n: int, queries: List[List[int]]) -> List[int]:\n nums = [0] * n\n answer = [0] * len(queries)\n count = 0\n\n for i, query in enumerate(queries):\n index, color = query\n nums[index] = color\n\n if index > 0 and nums[index - 1] == color:\n count += 1\n if index < n - 1 and nums[index + 1] == color:\n count += 1\n\n answer[i] = count\n\n return answer", "class Solution:\n def colorTheArray(self, n: int, queries: List[List[int]]) -> List[int]:\n nums = [0] * n\n count = 0\n answer = []\n\n for query in queries:\n index, color = query\n nums[index] = color\n if index > 0 and nums[index - 1] == color:\n count += 1\n if index < n - 1 and nums[index + 1] == color:\n count += 1\n answer.append(count)\n\n return answer" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def sumOfPower(self, nums: List[int]) -> int:\n MOD = 10**9 + 7\n total_sum = 0\n max_val = max(nums)\n nums.sort()\n\n for i in range(len(nums)):\n total_sum += (max_val**2) * nums[i]\n total_sum %= MOD\n\n return total_sum", "class Solution:\n def sumOfPower(self, nums: List[int]) -> int:\n MOD = 10**9 + 7\n total_sum = 0\n max_val = max(nums)\n min_val = min(nums)\n for num in nums:\n total_sum += num * num * (len(nums) - 1)\n total_sum %= MOD\n total_sum += max_val * max_val * (nums.count(min_val) - 1)\n return total_sum % MOD", "class Solution:\n def sumOfPower(self, nums: List[int]) -> int:\n MOD = 10**9 + 7\n total_sum = 0\n max_val = max(nums)\n min_val = min(nums)\n for num in nums:\n total_sum += num * num * (len(nums) - 1)\n total_sum %= MOD\n total_sum += max_val * max_val * (len(nums) - 1) * (len(nums) - 1)\n total_sum %= MOD\n total_sum -= min_val * min_val\n return total_sum % MOD", "class Solution:\n def sumOfPower(self, nums: List[int]) -> int:\n MOD = 10**9 + 7\n nums.sort()\n ans = 0\n n = len(nums)\n\n for i in range(n):\n ans = (ans + (nums[i] * nums[i] * (n - i) % MOD) * (i + 1) % MOD) % MOD\n\n return ans", "class Solution:\n def sumOfPower(self, nums: List[int]) -> int:\n MOD = 10**9 + 7\n nums.sort()\n ans = 0\n n = len(nums)\n\n for i in range(n):\n product = 1\n for j in range(i, n):\n product = (product * nums[j]) % MOD\n ans = (ans + product * nums[j]) % MOD\n\n return ans", "class Solution:\n def sumOfPower(self, nums: List[int]) -> int:\n MOD = 10**9 + 7\n total_sum = 0\n max_val = max(nums)\n \n for num in nums:\n total_sum = (total_sum + num * max_val * max_val) % MOD\n \n return total_sum", "class Solution:\n def sumOfPower(self, nums: List[int]) -> int:\n MOD = 10**9 + 7\n total_sum = 0\n max_val = max(nums)\n \n for num in nums:\n total_sum = (total_sum + num * max_val * max_val) % MOD\n \n return total_sum", "class Solution:\n def sumOfPower(self, nums: List[int]) -> int:\n MOD = 10**9 + 7\n total_sum = 0\n max_val = max(nums)\n min_val = min(nums)\n for num in nums:\n total_sum += num * num * (len(nums) - nums.count(num)) % MOD\n total_sum %= MOD\n total_sum += (len(nums) * max_val * min_val * (min_val - 1)) % MOD\n return total_sum % MOD", "class Solution:\n def sumOfPower(self, nums: List[int]) -> int:\n MOD = 10**9 + 7\n total_sum = 0\n max_val = max(nums)\n nums.sort()\n\n for i in range(len(nums)):\n total_sum += (max_val ** 2) * nums[i]\n total_sum %= MOD\n\n return total_sum", "class Solution:\n def sumOfPower(self, nums: List[int]) -> int:\n MOD = 10**9 + 7\n total_sum = 0\n max_val = max(nums)\n nums.sort()\n\n for i in range(len(nums)):\n total_sum += (max_val**2) * nums[i] * (len(nums) - i)\n total_sum %= MOD\n\n return total_sum" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def semiOrderedPermutation(self, nums: List[int]) -> int:\n n = len(nums)\n pos = [0] * (n + 1)\n for i, num in enumerate(nums):\n pos[num] = i\n\n operations = 0\n for i in range(n):\n if nums[i] != i + 1:\n if i + 1 == n or pos[i + 1] > pos[n]:\n nums[pos[n]], nums[i] = nums[i], nums[pos[n]]\n pos[n], pos[i + 1] = pos[i + 1], i\n operations += 1\n else:\n nums[pos[i + 1]], nums[i] = nums[i], nums[pos[i + 1]]\n pos[i + 1], pos[i + 1] = i, pos[i + 1]\n operations += 1\n\n return operations", "class Solution:\n def semiOrderedPermutation(self, nums: List[int]) -> int:\n n = len(nums)\n pos = [0] * (n + 1)\n for i, num in enumerate(nums):\n pos[num] = i\n\n steps = 0\n for i in range(1, n):\n if pos[i] > pos[i - 1]:\n continue\n j = i\n while j < n and pos[j] < pos[i - 1]:\n j += 1\n nums[pos[i - 1]], nums[pos[j - 1]] = nums[pos[j - 1]], nums[pos[i - 1]]\n pos[i - 1], pos[j - 1] = pos[j - 1], pos[i - 1]\n steps += j - i\n return steps", "class Solution:\n def semiOrderedPermutation(self, nums: List[int]) -> int:\n n = len(nums)\n pos = [0] * (n + 1)\n for i, num in enumerate(nums):\n pos[num] = i\n\n operations = 0\n for i in range(1, n):\n if pos[i] > pos[i - 1]:\n continue\n j = i\n while pos[j] < pos[j - 1]:\n j += 1\n for k in range(j, i, -1):\n pos[k], pos[k - 1] = pos[k - 1], pos[k]\n operations += j - i\n return operations", "class Solution:\n def semiOrderedPermutation(self, nums: List[int]) -> int:\n n = len(nums)\n pos = [0] * (n + 1)\n for i, num in enumerate(nums):\n pos[num] = i\n\n steps = 0\n for i in range(1, n):\n if pos[i] > pos[i - 1]:\n continue\n j = i\n while j + 1 <= n and pos[j] > pos[j + 1]:\n j += 1\n for k in range(j, i, -1):\n pos[k], pos[k - 1] = pos[k - 1], pos[k]\n steps += j - i + 1\n\n if pos[n] < pos[n - 1]:\n steps += 1\n\n return steps", "class Solution:\n def semiOrderedPermutation(self, nums: List[int]) -> int:\n n = len(nums)\n pos = [0] * (n + 1)\n for i, num in enumerate(nums):\n pos[num] = i\n\n steps = 0\n for i in range(1, n):\n if nums[i - 1] < nums[i]:\n continue\n j = i\n while j > 0 and nums[j - 1] > j:\n j -= 1\n if j != i - 1:\n steps += i - j - 1\n nums[j:i] = reversed(nums[j:i])\n\n if nums[-1] == n:\n return steps\n else:\n return steps + 1", "class Solution:\n def semiOrderedPermutation(self, nums: List[int]) -> int:\n n = len(nums)\n pos = [0] * (n + 1)\n for i, num in enumerate(nums):\n pos[num] = i\n\n steps = 0\n for i in range(1, n):\n if pos[i] > pos[i - 1]:\n continue\n else:\n steps += 1\n j = i\n while j < n and pos[j] < pos[i - 1]:\n j += 1\n nums[pos[i - 1]], nums[pos[j - 1]] = nums[pos[j - 1]], nums[pos[i - 1]]\n pos[i - 1], pos[j - 1] = pos[j - 1], pos[i - 1]\n\n return steps", "class Solution:\n def semiOrderedPermutation(self, nums: List[int]) -> int:\n n = len(nums)\n pos = [0] * (n + 1)\n for i, num in enumerate(nums):\n pos[num] = i\n\n operations = 0\n for i in range(1, n):\n if pos[i] > pos[i - 1]:\n continue\n j = i\n while pos[j] < pos[j - 1]:\n j += 1\n for k in range(j, i, -1):\n pos[k], pos[k - 1] = pos[k - 1], pos[k]\n operations += j - i\n return operations", "class Solution:\n def semiOrderedPermutation(self, nums: List[int]) -> int:\n n = len(nums)\n pos = [0] * (n + 1)\n for i, num in enumerate(nums):\n pos[num] = i\n\n operations = 0\n for i in range(1, n):\n if pos[i] > pos[i - 1]:\n continue\n j = i\n while j > 0 and pos[j] < pos[j - 1]:\n pos[j], pos[j - 1] = pos[j - 1], pos[j]\n operations += 1\n j -= 1\n\n if pos[n] > pos[n - 1]:\n operations += 1\n\n return operations", "class Solution:\n def semiOrderedPermutation(self, nums: List[int]) -> int:\n n = len(nums)\n pos = [0] * (n + 1)\n for i, num in enumerate(nums):\n pos[num] = i\n\n dp = [float('inf')] * n\n dp[0] = 0\n for i in range(1, n):\n for j in range(i):\n if nums[j] < i + 1:\n dp[i] = min(dp[i], dp[j] + abs(i - pos[i + 1]))\n elif nums[j] > i + 1:\n dp[i] = min(dp[i], dp[j] + abs(i - j) + abs(i - pos[i + 1]))\n\n return dp[n - 1]", "class Solution:\n def semiOrderedPermutation(self, nums: List[int]) -> int:\n n = len(nums)\n pos = [0] * (n + 1)\n for i, num in enumerate(nums):\n pos[num] = i\n\n operations = 0\n for i in range(1, n):\n if pos[i] > pos[i - 1]:\n continue\n j = i\n while j > 0 and pos[j] < pos[j - 1]:\n j -= 1\n for k in range(j, i):\n pos[k], pos[k + 1] = pos[k + 1], pos[k]\n operations += i - j\n return operations" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def longestSemiRepetitiveSubstring(self, s: str) -> int:\n n = len(s)\n max_len = 1\n for i in range(n):\n for j in range(i + 1, n):\n if s[i] == s[j] and s[i - 1] != s[j - 1]:\n tmp = j - i + 1\n if tmp > max_len:\n max_len = tmp\n elif s[i] != s[j]:\n tmp = j - i + 1\n if tmp > max_len:\n max_len = tmp\n return max_len", "class Solution:\n def longestSemiRepetitiveSubstring(self, s: str) -> int:\n n = len(s)\n max_len = 1\n for i in range(n):\n for j in range(i + 1, n):\n if s[i] == s[j] and s[i:j].count(s[i]) == 2:\n continue\n temp_str = s[i:j]\n if temp_str.count(temp_str[0]) <= 1 and temp_str.count(temp_str[-1]) <= 1:\n max_len = max(max_len, j - i)\n return max_len", "class Solution:\n def longestSemiRepetitiveSubstring(self, s: str) -> int:\n n = len(s)\n max_len = 1\n for i in range(n):\n for j in range(i + 1, n):\n if s[i] == s[j] and s[i:j].count(s[i]) == 2:\n continue\n temp_str = s[i:j]\n if temp_str.count(temp_str[0]) <= 1 and temp_str.count(temp_str[-1]) <= 1:\n max_len = max(max_len, j - i)\n return max_len", "class Solution:\n def longestSemiRepetitiveSubstring(self, s: str) -> int:\n n = len(s)\n max_len = 1\n for i in range(n):\n for j in range(i + 1, n):\n if s[i] == s[j]:\n temp_str = s[i:j+1]\n if self.is_semi_repetitive(temp_str):\n max_len = max(max_len, len(temp_str))\n return max_len\n \n def is_semi_repetitive(self, s: str) -> bool:\n for i in range(len(s) - 1):\n if s[i] == s[i + 1] and (i == 0 or s[i - 1] != s[i]):\n return True\n elif s[i] == s[i + 1] and s[i - 1] == s[i]:\n return False\n return True", "class Solution:\n def longestSemiRepetitiveSubstring(self, s: str) -> int:\n max_length = 1\n current_length = 1\n\n for i in range(1, len(s)):\n if s[i] == s[i - 1]:\n if current_length == 1:\n current_length += 1\n else:\n current_length = 1\n elif current_length + 1 <= max_length:\n current_length = 1\n else:\n max_length = current_length + 1\n current_length = 1\n\n return max(max_length, current_length)", "class Solution:\n def longestSemiRepetitiveSubstring(self, s: str) -> int:\n max_length = 1\n curr_length = 1\n\n for i in range(1, len(s)):\n if s[i] == s[i - 1]:\n if i == 1 or s[i] != s[i - 2]:\n curr_length += 1\n else:\n max_length = max(max_length, curr_length)\n curr_length = 1\n else:\n max_length = max(max_length, curr_length)\n curr_length = 1\n\n return max(max_length, curr_length)", "class Solution:\n def longestSemiRepetitiveSubstring(self, s: str) -> int:\n max_length = 0\n for i in range(len(s)):\n for j in range(i + 1, len(s) + 1):\n substring = s[i:j]\n if self.is_semi_repetitive(substring):\n max_length = max(max_length, len(substring))\n return max_length\n\n def is_semi_repetitive(self, s: str) -> bool:\n last_char = None\n repeat_found = False\n for char in s:\n if char == last_char:\n if repeat_found:\n return False\n repeat_found = True\n last_char = char\n return True", "class Solution:\n def longestSemiRepetitiveSubstring(self, s: str) -> int:\n n = len(s)\n max_len = 1\n for i in range(n):\n for j in range(i + 1, n):\n if s[i] == s[j] and s[i:j].count(s[i]) == 2:\n temp_str = s[i:j + 1]\n if temp_str.count(temp_str[0:2]) == 2:\n max_len = max(max_len, len(temp_str))\n else:\n max_len = max(max_len, len(temp_str) - 1)\n else:\n max_len = max(max_len, j - i + 1)\n return max_len", "class Solution:\n def longestSemiRepetitiveSubstring(self, s: str) -> int:\n n = len(s)\n max_len = 1\n for i in range(n):\n for j in range(i + 1, n):\n if s[i] == s[j]:\n temp_str = s[i:j+1]\n if self.is_semi_repetitive(temp_str):\n max_len = max(max_len, len(temp_str))\n return max_len\n\n def is_semi_repetitive(self, s: str) -> bool:\n for i in range(len(s) - 1):\n if s[i] == s[i + 1] and (i == 0 or s[i - 1] != s[i]):\n return True\n return False", "class Solution:\n def longestSemiRepetitiveSubstring(self, s: str) -> int:\n max_length = 1\n curr_length = 1\n\n for i in range(1, len(s)):\n if s[i] == s[i - 1]:\n if i == 1 or s[i] != s[i - 2]:\n curr_length += 1\n else:\n curr_length = 1\n\n max_length = max(max_length, curr_length)\n\n return max_length" ], "pass1_list": [ false, false, false, false, false, false, true, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def circularGameLosers(self, n: int, k: int) -> List[int]:\n visited = [False] * (n + 1)\n current, steps = 1, 0\n \n while True:\n visited[current] = True\n steps += 1\n current = (current + k * steps) % n\n if visited[current]:\n break\n \n return [i for i in range(1, n + 1) if not visited[i]]", "class Solution:\n def circularGameLosers(self, n: int, k: int) -> List[int]:\n visited = [False] * (n + 1)\n current, steps = 1, 0\n while not visited[current]:\n visited[current] = True\n steps += 1\n current = (current + k * steps) % n\n return [i for i in range(1, n + 1) if not visited[i]]", "class Solution:\n def circularGameLosers(self, n: int, k: int) -> List[int]:\n visited = [False] * (n + 1)\n current, steps = 1, 0\n while not visited[current]:\n visited[current] = True\n steps += 1\n current = (current + k * steps) % n\n return [i for i in range(1, n + 1) if not visited[i]]", "class Solution:\n def circularGameLosers(self, n: int, k: int) -> List[int]:\n visited = [False] * (n + 1)\n current, steps = 1, 0\n \n while not visited[current]:\n visited[current] = True\n steps += 1\n current = (current + k * steps) % n\n \n return [i for i in range(1, n + 1) if not visited[i]]", "class Solution:\n def circularGameLosers(self, n: int, k: int) -> List[int]:\n visited = [False] * (n + 1)\n current, steps = 1, 0\n \n while not visited[current]:\n visited[current] = True\n steps += 1\n current = (current + k * steps) % n\n \n return [i + 1 for i in range(n) if not visited[i + 1]]", "class Solution:\n def circularGameLosers(self, n: int, k: int) -> List[int]:\n visited = [False] * (n + 1)\n current, steps = 1, 0\n \n while True:\n visited[current] = True\n steps += 1\n current = (current + k * steps) % n\n if visited[current]:\n break\n \n return [i for i in range(1, n + 1) if not visited[i]]", "class Solution:\n def circularGameLosers(self, n: int, k: int) -> List[int]:\n visited = [False] * (n + 1)\n current, steps = 1, 0\n while not visited[current]:\n visited[current] = True\n steps += 1\n current = (current + k * steps) % n\n return [i for i in range(1, n + 1) if not visited[i]]", "class Solution:\n def circularGameLosers(self, n: int, k: int) -> List[int]:\n visited = [False] * (n + 1)\n current, steps = 1, 0\n \n while not visited[current]:\n visited[current] = True\n steps += 1\n current = (current + k * steps) % n\n \n return [i for i in range(1, n + 1) if not visited[i]]", "class Solution:\n def circularGameLosers(self, n: int, k: int) -> List[int]:\n visited = [False] * (n + 1)\n current, steps = 1, 0\n while not visited[current]:\n visited[current] = True\n steps += 1\n current = (current + k * steps) % n\n return [i for i in range(1, n + 1) if not visited[i]]", "class Solution:\n def circularGameLosers(self, n: int, k: int) -> List[int]:\n visited = [False] * (n + 1)\n current, steps = 1, 0\n while not visited[current]:\n visited[current] = True\n steps += 1\n current = (current + k * steps) % n\n return [i for i in range(1, n + 1) if not visited[i]]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def doesValidArrayExist(self, derived: List[int]) -> bool:\n n = len(derived)\n count_ones = derived.count(1)\n # If the number of 1's is not even, return false\n if count_ones % 2 != 0:\n return False\n # If the number of elements is odd and the first and last elements are 1, return false\n if n % 2 != 0 and derived[0] == 1 and derived[-1] == 1:\n return False\n return True", "class Solution:\n def doesValidArrayExist(self, derived: List[int]) -> bool:\n xor_sum = 0\n for val in derived:\n xor_sum ^= val\n return xor_sum == 0", "class Solution:\n def doesValidArrayExist(self, derived: List[int]) -> bool:\n xor_sum = 0\n for val in derived:\n xor_sum ^= val\n return xor_sum == 0", "class Solution:\n def doesValidArrayExist(self, derived: List[int]) -> bool:\n xor_sum = 0\n for val in derived:\n xor_sum ^= val\n return xor_sum == 0", "class Solution:\n def doesValidArrayExist(self, derived: List[int]) -> bool:\n xor_sum = 0\n for val in derived:\n xor_sum ^= val\n return xor_sum == 0", "class Solution:\n def doesValidArrayExist(self, derived: List[int]) -> bool:\n n = len(derived)\n count_ones = derived.count(1)\n\n # if n is even, there should be exactly one 1 in derived\n # if n is odd, there should be exactly two 1s in derived\n return (n % 2 == 0 and count_ones == 1) or (n % 2 == 1 and count_ones == 2)", "class Solution:\n def doesValidArrayExist(self, derived: List[int]) -> bool:\n xor_sum = 0\n for val in derived:\n xor_sum ^= val\n return xor_sum == 0", "class Solution:\n def doesValidArrayExist(self, derived: List[int]) -> bool:\n xor_sum = 0\n for val in derived:\n xor_sum ^= val\n return xor_sum == 0", "class Solution:\n def doesValidArrayExist(self, derived: List[int]) -> bool:\n xor_sum = 0\n for val in derived:\n xor_sum ^= val\n return xor_sum == 0", "class Solution:\n def doesValidArrayExist(self, derived: List[int]) -> bool:\n xor_sum = 0\n for val in derived:\n xor_sum ^= val\n return xor_sum == 0" ], "pass1_list": [ true, true, true, true, true, false, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minLength(self, s: str) -> int:\n while 'AB' in s or 'CD' in s:\n if 'AB' in s:\n s = s.replace(\"AB\", \"\")\n if 'CD' in s:\n s = s.replace(\"CD\", \"\")\n return len(s)", "class Solution:\n def minLength(self, s: str) -> int:\n while 'AB' in s or 'CD' in s:\n if 'AB' in s:\n s = s.replace(\"AB\", \"\")\n if 'CD' in s:\n s = s.replace(\"CD\", \"\")\n return len(s)", "class Solution:\n def minLength(self, s: str) -> int:\n while 'AB' in s or 'CD' in s:\n if 'AB' in s:\n s = s.replace(\"AB\", \"\")\n if 'CD' in s:\n s = s.replace(\"CD\", \"\")\n return len(s)", "class Solution:\n def minLength(self, s: str) -> int:\n while 'AB' in s or 'CD' in s:\n if 'AB' in s:\n s = s.replace(\"AB\", \"\")\n if 'CD' in s:\n s = s.replace(\"CD\", \"\")\n return len(s)", "class Solution:\n def minLength(self, s: str) -> int:\n while 'AB' in s or 'CD' in s:\n if 'AB' in s:\n s = s.replace(\"AB\", \"\")\n if 'CD' in s:\n s = s.replace(\"CD\", \"\")\n return len(s)", "class Solution:\n def minLength(self, s: str) -> int:\n while 'AB' in s or 'CD' in s:\n if 'AB' in s:\n s = s.replace(\"AB\", \"\")\n if 'CD' in s:\n s = s.replace(\"CD\", \"\")\n return len(s)", "class Solution:\n def minLength(self, s: str) -> int:\n while 'AB' in s or 'CD' in s:\n if 'AB' in s:\n s = s.replace(\"AB\", \"\")\n if 'CD' in s:\n s = s.replace(\"CD\", \"\")\n return len(s)", "class Solution:\n def minLength(self, s: str) -> int:\n while 'AB' in s or 'CD' in s:\n if 'AB' in s:\n s = s.replace(\"AB\", \"\")\n if 'CD' in s:\n s = s.replace(\"CD\", \"\")\n return len(s)", "class Solution:\n def minLength(self, s: str) -> int:\n while 'AB' in s or 'CD' in s:\n if 'AB' in s:\n s = s.replace(\"AB\", \"\")\n if 'CD' in s:\n s = s.replace(\"CD\", \"\")\n return len(s)", "class Solution:\n def minLength(self, s: str) -> int:\n while 'AB' in s or 'CD' in s:\n if 'AB' in s:\n s = s.replace(\"AB\", \"\")\n if 'CD' in s:\n s = s.replace(\"CD\", \"\")\n return len(s)" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def punishmentNumber(self, n: int) -> int:\n def is_punishment(num):\n sum_ = 0\n temp = num\n while temp:\n digit = temp % 10\n sum_ += digit\n temp //= 10\n return num == sum_\n\n total = 0\n for i in range(1, n + 1):\n square = i * i\n if is_punishment(square):\n total += square\n return total", "class Solution:\n def punishmentNumber(self, n: int) -> int:\n def is_punishment(num):\n sum_ = 0\n str_num = str(num * num)\n for c in str_num:\n sum_ += int(c)\n return sum_ == num\n\n ans = 0\n for i in range(1, n + 1):\n if is_punishment(i):\n ans += i * i\n return ans", "class Solution:\n def punishmentNumber(self, n: int) -> int:\n def is_punishment(num: int) -> bool:\n sum_ = 0\n temp = num * num\n while temp:\n digit = temp % 10\n sum_ += digit\n temp //= 10\n return sum_ == num\n\n return sum(i * i for i in range(1, n + 1) if is_punishment(i))", "class Solution:\n def punishmentNumber(self, n: int) -> int:\n def is_punishment(num):\n sum_ = 0\n temp = num * num\n while temp:\n digit = temp % 10\n sum_ += digit\n temp //= 10\n return sum_ == num\n\n return sum(i * i for i in range(1, n + 1) if is_punishment(i))", "class Solution:\n def punishmentNumber(self, n: int) -> int:\n def is_punishment(num):\n sum_ = 0\n temp = num\n while temp:\n digit = temp % 10\n sum_ += digit\n temp //= 10\n return num == sum_\n\n return sum(i * i for i in range(1, n + 1) if is_punishment(i * i))", "class Solution:\n def punishmentNumber(self, n: int) -> int:\n def is_punishment(num):\n sum_ = 0\n temp = num * num\n while temp:\n digit = temp % 10\n sum_ += digit\n temp //= 10\n return sum_ == num\n\n return sum(i * i for i in range(1, n + 1) if is_punishment(i))", "class Solution:\n def punishmentNumber(self, n: int) -> int:\n def is_punishment(num: int) -> bool:\n sum_ = 0\n temp = num * num\n while temp:\n digit = temp % 10\n sum_ += digit\n temp //= 10\n return sum_ == num\n\n return sum(i * i for i in range(1, n + 1) if is_punishment(i))", "class Solution:\n def punishmentNumber(self, n: int) -> int:\n def is_punishment(num):\n sum_ = 0\n temp = num * num\n while temp:\n digit = temp % 10\n sum_ += digit\n temp //= 10\n return sum_ == num\n\n ans = 0\n for i in range(1, n + 1):\n if is_punishment(i):\n ans += i * i\n return ans", "class Solution:\n def punishmentNumber(self, n: int) -> int:\n def is_punishment(num):\n sum_ = 0\n temp = num * num\n while temp:\n digit = temp % 10\n sum_ += digit\n temp //= 10\n return sum_ == num\n\n ans = sum(i * i for i in range(1, n + 1) if is_punishment(i))\n return ans", "class Solution:\n def punishmentNumber(self, n: int) -> int:\n def is_punishment(num):\n sum = 0\n temp = num * num\n while temp:\n digit = temp % 10\n sum += digit\n temp //= 10\n return num == sum\n\n ans = 0\n for i in range(1, n + 1):\n if is_punishment(i):\n ans += i * i\n return ans" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def paintWalls(self, cost: List[int], time: List[int]) -> int:\n n = len(cost)\n dp = [[0] * (n + 1) for _ in range(501)]\n\n for i in range(1, n + 1):\n for j in range(501):\n if i == 1:\n dp[j][i] = cost[i - 1] if j >= time[i - 1] else float('inf')\n else:\n dp[j][i] = min(dp[j][i - 1], cost[i - 1] + dp[j - time[i - 1]][i - 1]) if j >= time[i - 1] else dp[j][i - 1]\n\n return dp[500][n]", "class Solution:\n def paintWalls(self, cost: List[int], time: List[int]) -> int:\n n = len(cost)\n dp = [[0] * (n + 1) for _ in range(n + 1)]\n\n for i in range(1, n + 1):\n dp[i][i - 1] = cost[i - 1]\n\n for gap in range(1, n):\n for i in range(1, n - gap + 1):\n j = i + gap\n dp[i][j] = float('inf')\n for k in range(i, j):\n wait_time = max(time[k - 1], dp[i][k - 1] + dp[k + 1][j] - (k - i))\n dp[i][j] = min(dp[i][j], wait_time + cost[k])\n\n return dp[1][n - 1]", "class Solution:\n def paintWalls(self, cost: List[int], time: List[int]) -> int:\n n = len(cost)\n dp = [[float('inf')] * (n + 1) for _ in range(n + 1)]\n dp[0][0] = 0\n\n for i in range(n):\n for j in range(i, -1, -1):\n if j == -1:\n dp[i + 1][i + 1] = min(dp[i + 1][i + 1], dp[i][j] + cost[i])\n else:\n dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + cost[i])\n if time[j] <= i:\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n\n return dp[n][n]", "class Solution:\n def paintWalls(self, cost: List[int], time: List[int]) -> int:\n n = len(cost)\n dp = [[0] * (n + 1) for _ in range(501)]\n\n for i in range(1, n + 1):\n for j in range(501):\n if i == 1:\n dp[j][i] = cost[i - 1] if j >= time[i - 1] else float('inf')\n else:\n dp[j][i] = min(dp[j][i - 1], cost[i - 1] + dp[j - time[i - 1]][i - 1]) if j >= time[i - 1] else dp[j][i - 1]\n\n return dp[500][n]", "class Solution:\n def paintWalls(self, cost: List[int], time: List[int]) -> int:\n n = len(cost)\n dp = [[0] * (n + 1) for _ in range(501)]\n\n for i in range(1, n + 1):\n for j in range(1, i + 1):\n if i == j:\n dp[i][j] = min(dp[i - 1][j - 1] + cost[i - 1], dp[i - 1][j - 1] + time[i - 1])\n else:\n dp[i][j] = min(dp[i - 1][j - 1] + cost[i - 1], dp[i][j - 1] + time[i - 1])\n\n return dp[n][n]", "class Solution:\n def paintWalls(self, cost: List[int], time: List[int]) -> int:\n n = len(cost)\n dp = [[0] * (n + 1) for _ in range(501)]\n\n for i in range(1, n + 1):\n for j in range(501):\n if i == 1:\n dp[j][i] = cost[i - 1] if j >= time[i - 1] else float('inf')\n else:\n dp[j][i] = min(dp[j][i - 1], dp[j - time[i - 1]][i - 1] + cost[i - 1])\n\n return min(dp[-1])", "class Solution:\n def paintWalls(self, cost: List[int], time: List[int]) -> int:\n n = len(cost)\n dp = [[0] * (n + 1) for _ in range(501)]\n\n for i in range(1, n + 1):\n for j in range(501):\n if i == 1:\n dp[j][i] = cost[i - 1] if j >= time[i - 1] else float('inf')\n else:\n dp[j][i] = min(dp[j][i - 1], dp[j - time[i - 1]][i - 1] + cost[i - 1])\n\n return min(dp[-1])", "class Solution:\n def paintWalls(self, cost: List[int], time: List[int]) -> int:\n n = len(cost)\n dp = [[0] * (n + 1) for _ in range(n + 1)]\n\n for i in range(1, n + 1):\n dp[i][0] = dp[i - 1][0] + cost[i - 1]\n dp[i][i] = max(dp[i][i - 1], dp[i - 1][i] + cost[i - 1])\n for j in range(1, i):\n dp[i][j] = max(dp[i - 1][j] + cost[i - 1], dp[i - 1][j - 1] + (0 if time[i - 1] <= j else cost[i - 1]))\n\n return max(dp[n][0], dp[n][1])", "class Solution:\n def paintWalls(self, cost: List[int], time: List[int]) -> int:\n n = len(cost)\n dp = [[0] * (n + 1) for _ in range(n + 1)]\n\n for i in range(1, n + 1):\n dp[i][0] = dp[i - 1][0] + cost[i - 1]\n dp[i][i] = max(dp[i][i - 1], dp[i - 1][i] + cost[i - 1])\n for j in range(1, i):\n dp[i][j] = max(dp[i - 1][j] + cost[i - 1], dp[i - 1][j - 1] + (0 if time[i - 1] <= j else cost[i - 1]))\n\n return dp[n][0]", "class Solution:\n def paintWalls(self, cost: List[int], time: List[int]) -> int:\n n = len(cost)\n dp = [[0] * (n + 1) for _ in range(501)]\n\n for i in range(1, n + 1):\n for j in range(501):\n if i == 1:\n dp[j][i] = cost[i - 1] if j >= time[i - 1] else float('inf')\n else:\n dp[j][i] = min(dp[j][i - 1], cost[i - 1] + dp[j - time[i - 1]][i - 1]) if j >= time[i - 1] else dp[j][i - 1]\n\n return dp[500][n]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minCost(self, nums: List[int], x: int) -> int:\n n = len(nums)\n total_cost = sum(nums)\n min_cost = total_cost\n \n for i in range(n):\n temp_cost = nums[i] + min(nums[(i+1):] + nums[:i+1])\n min_cost = min(min_cost, temp_cost + (n-1) * x)\n \n return min_cost", "class Solution:\n def minCost(self, nums: List[int], x: int) -> int:\n n = len(nums)\n total_cost = sum(nums)\n min_cost = total_cost\n \n for i in range(n):\n temp_cost = 0\n for j in range(n):\n temp_cost += min(nums[(i+j)%n], nums[j])\n min_cost = min(min_cost, temp_cost + x*(j//n))\n \n return min_cost", "class Solution:\n def minCost(self, nums: List[int], x: int) -> int:\n n = len(nums)\n total_cost = sum(nums)\n min_cost = total_cost\n \n for i in range(n):\n temp_cost = nums[i] + min(nums[(i + 1) % n], nums[(i - 1 + n) % n]) * (n - 1)\n for j in range(1, n):\n temp_cost += min(nums[(i + j) % n], nums[(i - j + n) % n]) * 2 * (n - j) - (n - j) * x\n min_cost = min(min_cost, temp_cost)\n \n return min_cost", "class Solution:\n def minCost(self, nums: List[int], x: int) -> int:\n n = len(nums)\n total_cost = sum(nums)\n min_cost = total_cost\n \n for i in range(n):\n cost = nums[i] + min(nums[(i + 1) % n], nums[(i - 1 + n) % n])\n total_cost = total_cost - nums[i] + cost + (n - 1) * x\n min_cost = min(min_cost, total_cost)\n \n return min_cost", "class Solution:\n def minCost(self, nums: List[int], x: int) -> int:\n n = len(nums)\n total_cost = sum(nums)\n min_cost = total_cost\n \n for i in range(n):\n temp_cost = nums[i] + min(nums[(i+1):] + nums[:i+1])\n min_cost = min(min_cost, temp_cost + (n-1) * x)\n \n return min_cost", "class Solution:\n def minCost(self, nums: List[int], x: int) -> int:\n n = len(nums)\n total_cost = sum(nums)\n min_cost = total_cost\n \n for i in range(n):\n temp_cost = 0\n for j in range(n):\n temp_cost += min(nums[(i+j)%n], nums[j])\n min_cost = min(min_cost, temp_cost + x*(j//n))\n \n return min_cost", "class Solution:\n def minCost(self, nums: List[int], x: int) -> int:\n n = len(nums)\n total_cost = sum(nums)\n min_cost = total_cost\n \n for i in range(n):\n temp_cost = nums[i]\n for j in range(i + 1, n):\n temp_cost += min(nums[j], x + nums[(j - 1) % n])\n min_cost = min(min_cost, temp_cost)\n \n return min_cost", "class Solution:\n def minCost(self, nums: List[int], x: int) -> int:\n n = len(nums)\n total_cost = sum(nums)\n min_cost = total_cost\n \n for i in range(n):\n cost = nums[(i + 1) % n] + min(nums[i], x - nums[i]) * n\n for j in range(n):\n if j != i:\n cost += min(nums[j], (j - i - 1) % n * x, (i + 1 - j) % n * x)\n min_cost = min(min_cost, cost)\n \n return min_cost", "class Solution:\n def minCost(self, nums: List[int], x: int) -> int:\n n = len(nums)\n total_cost = sum(nums)\n min_cost = total_cost\n \n for i in range(n):\n temp_cost = 0\n for j in range(n):\n temp_cost += min(nums[(i+j) % n], nums[j])\n min_cost = min(min_cost, temp_cost + x * (j // n))\n \n return min_cost", "class Solution:\n def minCost(self, nums: List[int], x: int) -> int:\n n = len(nums)\n total_cost = sum(nums)\n min_cost = total_cost\n \n for i in range(n):\n temp_cost = 0\n for j in range(n):\n temp_cost += min(nums[(i+j)%n], nums[j])\n min_cost = min(min_cost, temp_cost + x*(j//n))\n \n return min_cost" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumSum(self, n: int, k: int) -> int:\n def is_k_avoiding(arr, k):\n s = set(arr)\n for num in arr:\n if k - num in s:\n return False\n return True\n\n arr = list(range(1, n + 1))\n if is_k_avoiding(arr, k):\n return sum(arr)\n\n min_sum = float(\"inf\")\n for i in range(n):\n for j in range(i + 1, n + 1):\n new_arr = list(range(1, i)) + list(range(j + 1, n + 1))\n if is_k_avoiding(new_arr, k):\n min_sum = min(min_sum, sum(new_arr))\n\n return min_sum", "class Solution:\n def minimumSum(self, n: int, k: int) -> int:\n def is_k_avoiding(arr: list[int]) -> bool:\n s = set(arr)\n for num in arr:\n if k - num in s:\n return False\n return True\n\n def calculate_sum(arr: list[int]) -> int:\n return sum(arr)\n\n arr = list(range(1, n + 1))\n while not is_k_avoiding(arr):\n arr.sort()\n for i in range(n - 2, -1, -1):\n if arr[i] + arr[i + 1] == k:\n arr[i] += 1\n break\n\n return calculate_sum(arr)", "class Solution:\n def minimumSum(self, n: int, k: int) -> int:\n def is_k_avoiding(arr, k):\n s = set(arr)\n for num in arr:\n if k - num in s:\n return False\n return True\n\n arr = list(range(1, n + 1))\n if is_k_avoiding(arr, k):\n return sum(arr)\n\n min_sum = float(\"inf\")\n for i in range(n):\n for j in range(i + 1, n + 1):\n new_k = k - (i + j)\n if new_k > 0 and new_k <= j:\n continue\n new_arr = list(range(1, i)) + list(range(j + 1, n + 1))\n if is_k_avoiding(new_arr, k):\n min_sum = min(min_sum, sum(new_arr))\n\n return min_sum", "class Solution:\n def minimumSum(self, n: int, k: int) -> int:\n def is_k_avoiding(arr, k):\n s = set(arr)\n for num in arr:\n if k - num in s:\n return False\n return True\n\n arr = list(range(1, n + 1))\n if is_k_avoiding(arr, k):\n return sum(arr)\n\n min_sum = float('inf')\n for i in range(n):\n for j in range(i + 1, n + 1):\n new_arr = list(range(1, i)) + list(range(i + 1, j)) + list(range(j + 1, n + 1))\n if is_k_avoiding(new_arr, k):\n min_sum = min(min_sum, sum(new_arr))\n\n return min_sum", "class Solution:\n def minimumSum(self, n: int, k: int) -> int:\n def is_k_avoiding(arr: list[int]) -> bool:\n s = set(arr)\n for num in s:\n if k - num in s:\n return False\n return True\n\n def calculate_sum(arr: list[int]) -> int:\n return sum(arr)\n\n arr = list(range(1, n + 1))\n while not is_k_avoiding(arr):\n arr = [num + 1 for num in arr]\n\n return calculate_sum(arr)", "class Solution:\n def minimumSum(self, n: int, k: int) -> int:\n def is_k_avoiding(arr: list[int]) -> bool:\n s = set(arr)\n for num in s:\n if k - num in s and num != k - num:\n return False\n return True\n \n arr = list(range(1, n + 1))\n while not is_k_avoiding(arr):\n arr = [num + 1 for num in arr]\n return sum(arr)", "class Solution:\n def minimumSum(self, n: int, k: int) -> int:\n def is_k_avoiding(arr: list[int]) -> bool:\n s = set(arr)\n for num in s:\n if k - num in s:\n return False\n return True\n\n arr = list(range(1, n + 1))\n while not is_k_avoiding(arr):\n arr = [num + 1 for num in arr]\n\n return sum(arr)", "class Solution:\n def minimumSum(self, n: int, k: int) -> int:\n def is_k_avoiding(arr, k):\n s = set(arr)\n for num in arr:\n if k - num in s:\n return False\n return True\n\n arr = list(range(1, n + 1))\n while not is_k_avoiding(arr, k):\n arr = [num + 1 for num in arr]\n\n return sum(arr)", "class Solution:\n def minimumSum(self, n: int, k: int) -> int:\n def is_k_avoiding(arr: list[int]) -> bool:\n s = set(arr)\n for num in s:\n if k - num in s and num != k - num:\n return False\n return True\n\n def dfs(path: list[int], k: int) -> int:\n if len(path) == n:\n return sum(path)\n min_sum = float('inf')\n for i in range(1, 51):\n if i not in path and (k - i not in path or k - i == i):\n path.append(i)\n min_sum = min(min_sum, dfs(path, k))\n path.pop()\n return min_sum\n\n return dfs([], k)", "class Solution:\n def minimumSum(self, n: int, k: int) -> int:\n def is_k_avoiding(arr, k):\n s = set(arr)\n for num in arr:\n if k - num in s:\n return False\n return True\n\n arr = list(range(1, n + 1))\n if is_k_avoiding(arr, k):\n return sum(arr)\n\n min_sum = float(\"inf\")\n for i in range(n):\n for j in range(i + 1, n + 1):\n new_k = k - (i + j)\n if new_k > 0 and new_k <= j:\n continue\n new_arr = list(range(1, i)) + list(range(j + 1, n + 1))\n if is_k_avoiding(new_arr, k):\n min_sum = min(min_sum, sum(new_arr))\n\n return min_sum" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def theMaximumAchievableX(self, num: int, t: int) -> int:\n return num + t", "class Solution:\n def theMaximumAchievableX(self, num: int, t: int) -> int:\n return num + t", "class Solution:\n def theMaximumAchievableX(self, num: int, t: int) -> int:\n return num + t", "class Solution:\n def theMaximumAchievableX(self, num: int, t: int) -> int:\n return num + t", "class Solution:\n def theMaximumAchievableX(self, num: int, t: int) -> int:\n return num + t", "class Solution:\n def theMaximumAchievableX(self, num: int, t: int) -> int:\n return num + t", "class Solution:\n def theMaximumAchievableX(self, num: int, t: int) -> int:\n return num + t", "class Solution:\n def theMaximumAchievableX(self, num: int, t: int) -> int:\n return num + t", "class Solution:\n def theMaximumAchievableX(self, num: int, t: int) -> int:\n return num + t", "class Solution:\n def theMaximumAchievableX(self, num: int, t: int) -> int:\n return num + t" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def makeSmallestPalindrome(self, s: str) -> str:\n n = len(s)\n i = n - 1\n j = 0\n res = [0] * (n + 1)\n\n for k in range(n):\n while i > j and s[i] != s[j]:\n i -= 1\n if s[i] == s[j]:\n res[k] = s[i]\n i -= 1\n j += 1\n else:\n res[k] = chr(ord('a') + j)\n\n return \"\".join(res[n - 1:0:-1] + res[n:])", "class Solution:\n def makeSmallestPalindrome(self, s: str) -> str:\n n = len(s)\n i = n // 2\n s = list(s)\n for j in range(n // 2):\n if s[i - j - 1] != s[n - j - 1]:\n if i - j - 1 > n - j - 1:\n s[i - j - 1] = chr(ord('a') + (ord(s[n - j - 1]) - ord('a')))\n else:\n s[n - j - 1] = chr(ord('a') + (ord(s[i - j - 1]) - ord('a')))\n return ''.join(s[: n // 2][::-1] + s[n // 2:])", "class Solution:\n def makeSmallestPalindrome(self, s: str) -> str:\n n = len(s)\n i = n - 1\n j = 0\n ops = 0\n res = [0] * n\n\n for k in range(n // 2):\n if s[i] == s[j]:\n res[j] = s[j]\n i -= 1\n j += 1\n else:\n if s[i + 1] == s[j]:\n ops += 1\n res[j] = s[i + 1]\n i -= 1\n else:\n ops += 1\n res[j] = 'a'\n j += 1\n\n if n % 2 != 0:\n res[n // 2] = s[n // 2]\n\n for k in range(n // 2, n):\n res[k] = s[i]\n i -= 1\n\n return \"\".join(res)", "class Solution:\n def makeSmallestPalindrome(self, s: str) -> str:\n n = len(s)\n i = n - 1\n j = 0\n ops = 0\n res = [0] * n\n\n for k in range(n + 1) // 2:\n if s[i] == s[j]:\n res[j] = s[j]\n i -= 1\n j += 1\n else:\n if s[i + 1] == s[j]:\n ops += 1\n res[j] = s[i + 1]\n i -= 1\n j += 1\n elif s[i] == s[j + 1]:\n ops += 1\n res[j] = s[j + 1]\n j += 1\n else:\n ops += 1\n res[j] = chr(ord('a') + min(ord(s[i + 1]) - ord('a'), ord(s[j]) - ord('a')))\n i -= 1\n j += 1\n\n return \"\".join(res)", "class Solution:\n def makeSmallestPalindrome(self, s: str) -> str:\n n = len(s)\n i = n - 1\n j = 0\n res = [0] * (n + 1)\n\n for k in range(n):\n if s[i] == s[j]:\n res[k] = s[i]\n i -= 1\n j += 1\n else:\n res[k] = s[j]\n j += 1\n\n res = ''.join(res)\n return res[::-1] + res[n:]", "class Solution:\n def makeSmallestPalindrome(self, s: str) -> str:\n n = len(s)\n i = n - 1\n\n for j in range(n // 2):\n if s[j] != s[i]:\n if i == j:\n s = s[:j] + 'a' + s[j + 1:]\n else:\n s = s[:j] + chr(ord(s[i]) - 1) + s[j + 1:]\n break\n i -= 1\n\n s += s[::-1][1:]\n return s", "class Solution:\n def makeSmallestPalindrome(self, s: str) -> str:\n n = len(s)\n i = n - 1\n j = 0\n res = ['#'] * (2 * n + 1)\n\n while i >= 0 and j < n:\n if s[i] == s[j]:\n res[i + j + 1] = s[i]\n i -= 1\n j += 1\n else:\n k = j - 1\n while k >= i:\n res[i + j + 1] = min(s[k], s[i])\n if res[i + j + 1] == s[k]:\n k -= 1\n else:\n i -= 1\n break\n j += 1\n\n return \"\".join(res[1:])", "class Solution:\n def makeSmallestPalindrome(self, s: str) -> str:\n n = len(s)\n i = n - 1\n j = 0\n res = [''] * n\n\n for k in range(n):\n if i > j:\n res[k] = s[i]\n i -= 1\n else:\n res[k] = s[j]\n j += 1\n\n res_str = ''.join(res)\n i = n - 1\n j = n - 1\n\n while i >= 0 and j >= 0 and res_str[i] == res_str[j]:\n i -= 1\n j -= 1\n\n i += 1\n res = [''] * n\n c = 'a'\n\n for k in range(i, j + 1):\n if res_str[k] < c:\n c = res_str[k]\n\n for k in range(i, j + 1):\n res[k] = c\n c = chr(ord(c) + 1)\n\n for k in range(n):\n if i > j:\n res[k] = s[i - 1]\n i -= 1\n else:\n res[k] = s[j - 1]\n j -= 1\n\n return ''.join(res)", "class Solution:\n def makeSmallestPalindrome(self, s: str) -> str:\n n = len(s)\n i = n // 2\n s = list(s)\n while i >= 0:\n if s[i - 1] == s[n - i]:\n i -= 1\n else:\n if s[i - 1] > s[n - i]:\n s[i - 1] = chr(ord(s[n - i]) - (ord(s[i - 1]) - ord(s[n - i])))\n else:\n s[n - i] = chr(ord(s[i - 1]) - (ord(s[n - i]) - ord(s[i - 1])))\n break\n return ''.join(s[i - 1:n - i : -1] + s[i:])", "class Solution:\n def makeSmallestPalindrome(self, s: str) -> str:\n n = len(s)\n i = n // 2\n s = list(s)\n for j in range(n // 2):\n if s[i - j - 1] != s[n - j - 1]:\n if j > 0 and s[i - j] != s[n - j - 1]:\n s[i - j - 1] = s[n - j - 1]\n else:\n s[n - j - 1] = s[i - j - 1]\n return \"\".join(s[:i:-1] + s)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumCost(self, s: str) -> int:\n n = len(s)\n left_cost = [0] * n\n right_cost = [0] * n\n left, right = 0, 0\n\n for i in range(n):\n if s[i] == '0':\n left += 1\n else:\n right += 1\n\n left_cost[i] = left\n right_cost[i] = right\n\n min_cost = float('inf')\n for i in range(n):\n cost = left_cost[i] + right_cost[n - 1 - i] + i + 1\n min_cost = min(min_cost, cost)\n\n return min_cost", "class Solution:\n def minimumCost(self, s: str) -> int:\n n = len(s)\n left_cost = [0] * n\n right_cost = [0] * n\n\n for i in range(n):\n if s[i] == '0':\n left_cost[i] = i + 1 if i == 0 else left_cost[i - 1] + 1\n right_cost[i] = n - i if i == n - 1 else right_cost[i + 1] + 1\n else:\n left_cost[i] = left_cost[i - 1]\n right_cost[i] = right_cost[i + 1]\n\n min_cost = left_cost[-1]\n for i in range(n - 1):\n min_cost = min(min_cost, left_cost[i] + right_cost[i + 1])\n\n return min_cost", "class Solution:\n def minimumCost(self, s: str) -> int:\n n = len(s)\n left_cost = [0] * n\n right_cost = [0] * n\n left, right = 0, 0\n\n for i in range(n):\n if s[i] == '0':\n left += 1\n else:\n right += 1\n left_cost[i] = left\n right_cost[i] = right\n\n ans = float('inf')\n for i in range(n):\n ans = min(ans, left_cost[i] + right_cost[i] + i + 1)\n ans = min(ans, left_cost[i] + (n - right_cost[i] - 1) + n - i)\n\n return ans", "class Solution:\n def minimumCost(self, s: str) -> int:\n n = len(s)\n left_cost = [0] * n\n right_cost = [0] * n\n\n for i in range(n):\n if s[i] == '0':\n left_cost[i] = i + 1 if i == 0 else left_cost[i - 1] + 1\n right_cost[i] = n - i if i == n - 1 else right_cost[i + 1] + 1\n else:\n left_cost[i] = left_cost[i - 1]\n right_cost[i] = right_cost[i + 1]\n\n min_cost = left_cost[-1]\n for i in range(n - 1):\n min_cost = min(min_cost, left_cost[i] + right_cost[i + 1])\n\n return min_cost", "class Solution:\n def minimumCost(self, s: str) -> int:\n n = len(s)\n left_cost = [0] * n\n right_cost = [0] * n\n left, right = 0, 0\n\n for i in range(n):\n if s[i] == '0':\n left_cost[i] = left\n left += 1\n else:\n left_cost[i] = left\n\n if s[n - 1 - i] == '1':\n right_cost[n - 1 - i] = right\n right += 1\n else:\n right_cost[n - 1 - i] = right\n\n ans = n\n for i in range(n):\n ans = min(ans, left_cost[i] + right_cost[i] + i + 1)\n\n return ans", "class Solution:\n def minimumCost(self, s: str) -> int:\n n = len(s)\n left_cost = [0] * n\n right_cost = [0] * n\n for i in range(n):\n if s[i] == '0':\n left_cost[i] = i + 1 if i == 0 else left_cost[i - 1] + 1\n right_cost[i] = n - i if i == n - 1 else right_cost[i + 1] + 1\n else:\n left_cost[i] = left_cost[i - 1]\n right_cost[i] = right_cost[i + 1]\n min_cost = left_cost[-1]\n for i in range(n - 1):\n min_cost = min(min_cost, left_cost[i] + right_cost[i + 1])\n return min_cost", "class Solution:\n def minimumCost(self, s: str) -> int:\n n = len(s)\n left_cost = [0] * n\n right_cost = [0] * n\n total_cost = 0\n\n for i in range(n):\n if s[i] == '0':\n left_cost[i] = left_cost[i - 1] + 1 if i > 0 else 1\n right_cost[i] = right_cost[i - 1]\n else:\n left_cost[i] = left_cost[i - 1]\n right_cost[i] = right_cost[i - 1] + 1 if i > 0 else 1\n\n total_cost += min(left_cost[i], right_cost[i])\n\n return total_cost", "class Solution:\n def minimumCost(self, s: str) -> int:\n n = len(s)\n left_cost = [0] * n\n right_cost = [0] * n\n left, right = 0, 0\n\n for i in range(n):\n if s[i] == '0':\n left += 1\n left_cost[i] = left\n else:\n left = 0\n\n for i in range(n - 1, -1, -1):\n if s[i] == '1':\n right += 1\n right_cost[i] = right\n else:\n right = 0\n\n min_cost = float('inf')\n for i in range(n):\n cost = i + 1 + (n - i - 1) - left_cost[i] - right_cost[i]\n min_cost = min(min_cost, cost)\n\n return min_cost", "class Solution:\n def minimumCost(self, s: str) -> int:\n n = len(s)\n left_cost = [0] * n\n right_cost = [0] * n\n left, right = 0, 0\n\n for i in range(n):\n if s[i] == '0':\n left_cost[i] = left\n left += 1\n else:\n right_cost[i] = right\n right += 1\n\n ans = n\n for i in range(n):\n ans = min(ans, left_cost[i] + right + (n - i - 1))\n ans = min(ans, right_cost[i] + left + i)\n\n return ans", "class Solution:\n def minimumCost(self, s: str) -> int:\n n = len(s)\n left_cost = [0] * n\n right_cost = [0] * n\n\n for i in range(n):\n if s[i] == '0':\n left_cost[i] = i + 1 if i == 0 else left_cost[i - 1] + 1\n right_cost[i] = n - i if i == n - 1 else right_cost[i + 1] + 1\n else:\n left_cost[i] = left_cost[i - 1]\n right_cost[i] = right_cost[i + 1]\n\n min_cost = float('inf')\n for i in range(n):\n min_cost = min(min_cost, left_cost[i] + right_cost[i])\n\n return min_cost" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def removeTrailingZeros(self, num: str) -> str:\n while num.endswith('0') and num != '0':\n num = num[:-1]\n return num", "class Solution:\n def removeTrailingZeros(self, num: str) -> str:\n while num.endswith('0'):\n num = num[:-1]\n return num", "class Solution:\n def removeTrailingZeros(self, num: str) -> str:\n while num.endswith('0'):\n num = num[:-1]\n return num", "class Solution:\n def removeTrailingZeros(self, num: str) -> str:\n while num.endswith('0'):\n num = num[:-1]\n return num", "class Solution:\n def removeTrailingZeros(self, num: str) -> str:\n while num.endswith('0'):\n num = num[:-1]\n return num", "class Solution:\n def removeTrailingZeros(self, num: str) -> str:\n while num.endswith('0'):\n num = num[:-1]\n return num", "class Solution:\n def removeTrailingZeros(self, num: str) -> str:\n while num.endswith('0'):\n num = num[:-1]\n return num", "class Solution:\n def removeTrailingZeros(self, num: str) -> str:\n while num.endswith('0'):\n num = num[:-1]\n return num", "class Solution:\n def removeTrailingZeros(self, num: str) -> str:\n while num.endswith('0'):\n num = num[:-1]\n return num", "class Solution:\n def removeTrailingZeros(self, num: str) -> str:\n while num.endswith('0'):\n num = num[:-1]\n return num" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def isFascinating(self, n: int) -> bool:\n num = str(n) + str(n*2) + str(n*3)\n if len(num) != 9 or '0' in num:\n return False\n return sorted(num) == list('123456789')", "class Solution:\n def isFascinating(self, n: int) -> bool:\n s = str(n) + str(n * 2) + str(n * 3)\n return len(s) == len(set(s)) == 9 and '0' not in s", "class Solution:\n def isFascinating(self, n: int) -> bool:\n s = str(n) + str(n * 2) + str(n * 3)\n return len(s) == len(set(s)) == 9 and '0' not in s", "class Solution:\n def isFascinating(self, n: int) -> bool:\n num = str(n) + str(n*2) + str(n*3)\n num_set = set(num)\n return num_set == set('123456789')", "class Solution:\n def isFascinating(self, n: int) -> bool:\n s = str(n) + str(n * 2) + str(n * 3)\n return len(s) == 9 and sorted(s) == list(\"123456789\")", "class Solution:\n def isFascinating(self, n: int) -> bool:\n s = str(n) + str(n * 2) + str(n * 3)\n return len(s) == len(set(s)) == 9 and '0' not in s", "class Solution:\n def isFascinating(self, n: int) -> bool:\n s = str(n) + str(n*2) + str(n*3)\n return len(s) == 9 and sorted(s) == list(\"123456789\")", "class Solution:\n def isFascinating(self, n: int) -> bool:\n s = str(n) + str(n * 2) + str(n * 3)\n return len(s) == len(set(s)) == 9 and '0' not in s", "class Solution:\n def isFascinating(self, n: int) -> bool:\n s = str(n) + str(n*2) + str(n*3)\n return len(s) == 9 and sorted(s) == list(\"123456789\")", "class Solution:\n def isFascinating(self, n: int) -> bool:\n s = str(n) + str(n * 2) + str(n * 3)\n return len(s) == len(set(s)) == 9 and '0' not in s" ], "pass1_list": [ true, true, true, false, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimizedStringLength(self, s: str) -> int:\n stack = []\n for c in s:\n if stack and stack[-1] == c:\n stack.pop()\n else:\n stack.append(c)\n return len(stack)", "class Solution:\n def minimizedStringLength(self, s: str) -> int:\n stack = []\n for c in s:\n if stack and stack[-1] == c:\n stack.pop()\n else:\n stack.append(c)\n return len(stack)", "class Solution:\n def minimizedStringLength(self, s: str) -> int:\n stack = []\n for c in s:\n if not stack or stack[-1] != c:\n stack.append(c)\n else:\n stack.pop()\n return len(stack)", "class Solution:\n def minimizedStringLength(self, s: str) -> int:\n stack = []\n for c in s:\n if stack and stack[-1] == c:\n stack.pop()\n else:\n stack.append(c)\n return len(stack)", "class Solution:\n def minimizedStringLength(self, s: str) -> int:\n stack = []\n for c in s:\n if stack and stack[-1] == c:\n stack.pop()\n else:\n stack.append(c)\n return len(stack)", "class Solution:\n def minimizedStringLength(self, s: str) -> int:\n stack = []\n for c in s:\n if stack and stack[-1] == c:\n stack.pop()\n else:\n stack.append(c)\n return len(stack)", "class Solution:\n def minimizedStringLength(self, s: str) -> int:\n stack = []\n for c in s:\n if not stack or stack[-1] != c:\n stack.append(c)\n else:\n stack.pop()\n return len(stack)", "class Solution:\n def minimizedStringLength(self, s: str) -> int:\n stack = []\n for c in s:\n if not stack or stack[-1] != c:\n stack.append(c)\n else:\n stack.pop()\n return len(stack)", "class Solution:\n def minimizedStringLength(self, s: str) -> int:\n stack = []\n for c in s:\n if stack and stack[-1] == c:\n stack.pop()\n else:\n stack.append(c)\n return len(stack)", "class Solution:\n def minimizedStringLength(self, s: str) -> int:\n stack = []\n for c in s:\n if stack and stack[-1] == c:\n stack.pop()\n else:\n stack.append(c)\n return len(stack)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def canTraverseAllPairs(self, nums: List[int]) -> bool:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n def find_cycle(node, parent):\n if cycle and node in visited:\n return True\n visited.add(node)\n for neighbor in graph[node]:\n if neighbor != parent and find_cycle(neighbor, node):\n return True\n return False\n\n n = len(nums)\n graph = [[] for _ in range(n)]\n for i in range(n):\n for j in range(i + 1, n):\n if gcd(nums[i], nums[j]) > 1:\n graph[i].append(j)\n graph[j].append(i)\n\n cycle = False\n for i in range(n):\n visited = set()\n cycle |= find_cycle(i, -1)\n\n return cycle", "class Solution:\n def canTraverseAllPairs(self, nums: List[int]) -> bool:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n def find_connected_components(graph):\n visited = set()\n components = []\n for node in graph:\n if node not in visited:\n stack = [node]\n component = set()\n while stack:\n current = stack.pop()\n if current not in visited:\n visited.add(current)\n component.add(current)\n stack.extend(neighbor for neighbor in graph[current] if neighbor not in visited)\n components.append(component)\n return components\n\n def is_connected(graph):\n visited = set()\n for node in graph:\n if node not in visited:\n stack = [node]\n while stack:\n current = stack.pop()\n if current not in visited:\n visited.add(current)\n stack.extend(neighbor for neighbor in graph[current] if neighbor not in visited)\n return len(visited) == len(graph)\n\n n = len(nums)\n graph = [[] for _ in range(n)]\n for i in range(n):\n for j in range(i + 1, n):\n if gcd(nums[i], nums[j]) > 1:\n graph[i].append(j)\n graph[j].append(i)\n\n components = find_connected_components(graph)\n return len(components) == 1 and is_connected(graph)", "class Solution:\n def canTraverseAllPairs(self, nums: List[int]) -> bool:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n def find_cycle(node, parent):\n if cycle:\n return\n cycle[node] = True\n for neighbor in graph[node]:\n if neighbor != parent and (not cycle[neighbor]):\n find_cycle(neighbor, node)\n\n def is_cyclic(node):\n global cycle\n cycle = [False] * len(graph)\n find_cycle(node, -1)\n return any(cycle)\n\n def dfs(node, parent):\n visited[node] = True\n for neighbor in graph[node]:\n if not visited[neighbor]:\n dfs(neighbor, node)\n\n global graph, visited, cycle\n graph = [[] for _ in range(len(nums))]\n visited = [False] * len(nums)\n cycle = []\n\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if gcd(nums[i], nums[j]) > 1:\n graph[i].append(j)\n graph[j].append(i)\n\n for i in range(len(nums)):\n if not visited[i] and not is_cyclic(i):\n return False\n\n return True", "class Solution:\n def canTraverseAllPairs(self, nums: List[int]) -> bool:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n def find_cycle(node, parent, gcd_graph):\n visited.add(node)\n for next_node, gcd_value in gcd_graph[node]:\n if next_node == parent:\n continue\n if next_node in visited:\n return next_node\n cycle_node = find_cycle(next_node, node, gcd_graph)\n if cycle_node:\n return cycle_node\n return None\n\n gcd_graph = [[] for _ in range(len(nums))]\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n gcd_value = gcd(nums[i], nums[j])\n if gcd_value > 1:\n gcd_graph[i].append((j, gcd_value))\n gcd_graph[j].append((i, gcd_value))\n\n visited = set()\n cycle = None\n for i in range(len(nums)):\n if i not in visited:\n cycle = find_cycle(i, -1, gcd_graph)\n if not cycle:\n return False\n visited.add(cycle)\n\n return True", "class Solution:\n def canTraverseAllPairs(self, nums: List[int]) -> bool:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n def find_components(nums):\n components = []\n visited = set()\n\n for num in nums:\n if num not in visited:\n component = [i for i in range(len(nums)) if gcd(num, nums[i]) > 1]\n components.append(component)\n visited.update(component)\n\n return components\n\n components = find_components(nums)\n return len(components) == 1", "class Solution:\n def canTraverseAllPairs(self, nums: List[int]) -> bool:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n def find_cycle(node, parent, visited, graph):\n visited[node] = True\n for neighbor in graph[node]:\n if neighbor == parent:\n continue\n if not visited[neighbor]:\n if find_cycle(neighbor, node, visited, graph):\n return True\n return False\n\n def is_connected(node, visited, graph):\n stack = [node]\n visited[node] = True\n while stack:\n current = stack.pop()\n for neighbor in graph[current]:\n if not visited[neighbor]:\n stack.append(neighbor)\n visited[neighbor] = True\n return all(visited[i] for i in range(len(visited)))\n\n graph = [[] for _ in range(len(nums))]\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if gcd(nums[i], nums[j]) > 1:\n graph[i].append(j)\n graph[j].append(i)\n\n visited = [False] * len(nums)\n for i in range(len(nums)):\n if not visited[i]:\n if not is_connected(i, visited, graph):\n return False\n for j in range(i + 1, len(nums)):\n if not visited[j]:\n if not find_cycle(i, -1, visited, graph) or not find_cycle(j, -1, visited, graph):\n return False\n return True", "class Solution:\n def canTraverseAllPairs(self, nums: List[int]) -> bool:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n def find_connected_components(graph):\n visited = set()\n components = []\n\n for node in graph:\n if node not in visited:\n stack = [node]\n component = set()\n\n while stack:\n current = stack.pop()\n\n if current not in visited:\n visited.add(current)\n component.add(current)\n stack.extend(neighbor for neighbor in graph[current] if neighbor not in visited)\n\n components.append(component)\n\n return components\n\n def is_connected(graph):\n visited = set()\n stack = [0]\n\n while stack:\n current = stack.pop()\n\n if current not in visited:\n visited.add(current)\n stack.extend(neighbor for neighbor in graph[current] if neighbor not in visited)\n\n return len(visited) == len(graph)\n\n n = len(nums)\n graph = [[] for _ in range(n)]\n\n for i in range(n):\n for j in range(i + 1, n):\n if gcd(nums[i], nums[j]) > 1:\n graph[i].append(j)\n graph[j].append(i)\n\n components = find_connected_components(graph)\n\n return len(components) == 1 and is_connected(graph[0])", "class Solution:\n def canTraverseAllPairs(self, nums: List[int]) -> bool:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n def find_connected_components(graph):\n visited = set()\n components = []\n for node in graph:\n if node not in visited:\n stack = [node]\n component = set()\n while stack:\n current = stack.pop()\n if current not in visited:\n visited.add(current)\n component.add(current)\n stack.extend(neighbor for neighbor in graph[current] if neighbor not in visited)\n components.append(component)\n return components\n\n def is_connected(graph):\n visited = set()\n for node in graph:\n if node not in visited:\n stack = [node]\n while stack:\n current = stack.pop()\n if current not in visited:\n visited.add(current)\n stack.extend(neighbor for neighbor in graph[current] if neighbor not in visited)\n return len(visited) == len(graph)\n\n n = len(nums)\n graph = [[] for _ in range(n)]\n for i in range(n):\n for j in range(i + 1, n):\n if gcd(nums[i], nums[j]) > 1:\n graph[i].append(j)\n graph[j].append(i)\n\n components = find_connected_components(graph)\n return len(components) == 1 and is_connected(graph)", "class Solution:\n def canTraverseAllPairs(self, nums: List[int]) -> bool:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n def find_connected_components(graph):\n visited = set()\n components = []\n for node in graph:\n if node not in visited:\n stack = [node]\n component = set()\n while stack:\n current = stack.pop()\n if current not in visited:\n visited.add(current)\n component.add(current)\n stack.extend(neighbor for neighbor in graph[current] if neighbor not in visited)\n components.append(component)\n return components\n\n def is_connected(graph):\n visited = set()\n for node in graph:\n if node not in visited:\n stack = [node]\n while stack:\n current = stack.pop()\n if current not in visited:\n visited.add(current)\n stack.extend(neighbor for neighbor in graph[current] if neighbor not in visited)\n return len(visited) == len(graph)\n\n n = len(nums)\n graph = [[] for _ in range(n)]\n for i in range(n):\n for j in range(i + 1, n):\n if gcd(nums[i], nums[j]) > 1:\n graph[i].append(j)\n graph[j].append(i)\n\n components = find_connected_components(graph)\n return len(components) == 1 and is_connected(graph)", "class Solution:\n def canTraverseAllPairs(self, nums: List[int]) -> bool:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n def find_cycle(node, parent):\n if cycle:\n return\n cycle[0] = True\n for next_node in graph[node]:\n if next_node != parent:\n find_cycle(next_node, node)\n\n n = len(nums)\n graph = [[] for _ in range(n)]\n for i in range(n):\n for j in range(i + 1, n):\n if gcd(nums[i], nums[j]) > 1:\n graph[i].append(j)\n graph[j].append(i)\n\n cycle = [False]\n for i in range(n):\n find_cycle(i, -1)\n\n return not any(cycle[0] == False for nums_i in nums if nums_i > 1)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def smallestString(self, s: str) -> str:\n alphabet = \"abcdefghijklmnopqrstuvwxyz\"\n s = list(s)\n for i in range(len(s)):\n for j in range(i, len(s)):\n temp = s[i:j+1]\n temp = [alphabet[(alphabet.index(c)-1)%26] for c in temp]\n if temp < s[i:j+1]:\n s[i:j+1] = temp\n break\n return \"\".join(s)", "class Solution:\n def smallestString(self, s: str) -> str:\n alphabet = \"z\" + \"abcdefghijklmnopqrstuvwxyz\"\n s = list(s)\n min_index = 0\n min_char = s[0]\n for i, char in enumerate(s):\n if char < min_char:\n min_index = i\n min_char = char\n \n for i in range(len(s)):\n s[i] = alphabet[alphabet.index(s[i]) - 1]\n \n s[min_index] = alphabet[alphabet.index(s[min_index]) - 1]\n \n return \"\".join(s)", "class Solution:\n def smallestString(self, s: str) -> str:\n n = len(s)\n prev_char = 'z'\n result = ''\n for c in s:\n if c > prev_char:\n result += c\n prev_char = c\n else:\n result += 'a'\n prev_char = 'a'\n return result", "class Solution:\n def smallestString(self, s: str) -> str:\n alphabet = \"abcdefghijklmnopqrstuvwxyz\"\n s = list(s)\n for i in range(len(s)):\n for j in range(i, len(s)):\n temp = s[i:j+1]\n new_temp = [alphabet[(alphabet.index(c)-1)%26] for c in temp]\n new_s = s[:i] + new_temp + s[j+1:]\n s = new_s if new_s < s else s\n return \"\".join(s)", "class Solution:\n def smallestString(self, s: str) -> str:\n alphabet = \"abcdefghijklmnopqrstuvwxyz\"\n s = list(s)\n for i in range(len(s)):\n for j in range(i, len(s)):\n temp = s[i:j+1]\n temp = [alphabet[(alphabet.index(c)-1)%26] for c in temp]\n if temp < s[i:j+1]:\n s[i:j+1] = temp\n break\n return \"\".join(s)", "class Solution:\n def smallestString(self, s: str) -> str:\n alphabet = \"abcdefghijklmnopqrstuvwxyz\"\n s = list(s)\n for i in range(len(s)):\n for j in range(i, len(s)):\n temp = s[i:j+1]\n temp = [alphabet[(alphabet.index(c)-1)%26] for c in temp]\n if temp < s[i:j+1]:\n s[i:j+1] = temp\n break\n return \"\".join(s)", "class Solution:\n def smallestString(self, s: str) -> str:\n alphabet = \"z\" + \"abcdefghijklmnopqrstuvwxyz\"\n s = list(s)\n for i in range(len(s)):\n for j in range(i, len(s)):\n temp = s[i:j+1]\n temp = [alphabet[(alphabet.index(c)-1) % 26] for c in temp]\n s[i:j+1] = temp\n if \"\".join(s) < s:\n break\n return \"\".join(s)", "class Solution:\n def smallestString(self, s: str) -> str:\n n = len(s)\n prev_char = 'z'\n result = ''\n for c in s:\n if c != 'a':\n prev_char = min(prev_char, c - 1)\n result += c\n return (prev_char + result)[-n:]", "class Solution:\n def smallestString(self, s: str) -> str:\n alphabet = \"z\" + \"abcdefghijklmnopqrstuvwxyz\"\n s = list(s)\n for i in range(len(s)):\n for j in range(i, len(s)):\n temp = s[i:j+1]\n temp = [alphabet[alphabet.index(c)-1] for c in temp]\n s[i:j+1] = temp\n if \"\".join(s) < s:\n break\n if \"\".join(s) < s:\n break\n return \"\".join(s)", "class Solution:\n def smallestString(self, s: str) -> str:\n n = len(s)\n prev_char = 'z'\n result = ''\n for c in s:\n if c > prev_char:\n result += c\n prev_char = c\n else:\n result += 'a'\n prev_char = 'a'\n return result" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countBeautifulPairs(self, nums: List[int]) -> int:\n count = 0\n first_digits = [int(str(num)[0]) for num in nums]\n last_digits = [int(str(num)[-1]) for num in nums]\n\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if gcd(first_digits[i], last_digits[j]) == 1:\n count += 1\n\n return count\n\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a", "class Solution:\n def countBeautifulPairs(self, nums: List[int]) -> int:\n count = 0\n first_digits = [int(str(num)[0]) for num in nums]\n last_digits = [int(str(num)[-1]) for num in nums]\n\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if gcd(first_digits[i], last_digits[j]) == 1:\n count += 1\n\n return count\n\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a", "class Solution:\n def countBeautifulPairs(self, nums: List[int]) -> int:\n count = 0\n first_digits = set()\n last_digits = set()\n\n for num in nums:\n first_digit = int(str(num)[0])\n last_digit = int(str(num)[-1])\n first_digits.add(first_digit)\n last_digits.add(last_digit)\n\n for i in first_digits:\n for j in last_digits:\n if gcd(i, j) == 1:\n count += 1\n\n return count * len(nums) * (len(nums) - 1) // 2\n\ndef gcd(x, y):\n while y:\n x, y = y, x % y\n return x", "class Solution:\n def countBeautifulPairs(self, nums: List[int]) -> int:\n count = 0\n first_digits = [int(str(num)[0]) for num in nums]\n last_digits = [int(str(num)[-1]) for num in nums]\n\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if self.gcd(first_digits[i], last_digits[j]) == 1:\n count += 1\n\n return count\n\n def gcd(self, x, y):\n while y:\n x, y = y, x % y\n return x", "class Solution:\n def countBeautifulPairs(self, nums: List[int]) -> int:\n def get_first_digit(num):\n return int(str(num)[0])\n\n def get_last_digit(num):\n return int(str(num)[-1])\n\n count = 0\n first_digits = set()\n last_digits = set()\n\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n first_digit = get_first_digit(nums[i])\n last_digit = get_last_digit(nums[j])\n if self.is_coprime(first_digit, last_digit):\n count += 1\n\n return count\n\n def is_coprime(self, x, y):\n for i in range(2, min(x, y) + 1):\n if x % i == 0 and y % i == 0:\n return False\n return True", "class Solution:\n def countBeautifulPairs(self, nums: List[int]) -> int:\n count = 0\n first_digits = [int(str(num)[0]) for num in nums]\n last_digits = [int(str(num)[-1]) for num in nums]\n\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if self.gcd(first_digits[i], last_digits[j]) == 1:\n count += 1\n\n return count\n\n def gcd(self, a, b):\n while b:\n a, b = b, a % b\n return a", "class Solution:\n def countBeautifulPairs(self, nums: List[int]) -> int:\n count = 0\n first_digits = set()\n last_digits = set()\n\n for i in range(len(nums)):\n first_digit = str(nums[i])[0]\n last_digit = str(nums[i])[-1]\n\n if i > 0:\n first_digits.add(first_digit)\n if i < len(nums) - 1:\n last_digits.add(last_digit)\n\n for digit1 in first_digits:\n for digit2 in last_digits:\n if self.gcd(int(digit1), int(digit2)) == 1:\n count += 1\n\n return count\n\n def gcd(self, x, y):\n while y:\n x, y = y, x % y\n return x", "class Solution:\n def countBeautifulPairs(self, nums: List[int]) -> int:\n count = 0\n first_digits = [int(str(num)[0]) for num in nums]\n last_digits = [int(str(num)[-1]) for num in nums]\n\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if gcd(first_digits[i], last_digits[j]) == 1:\n count += 1\n\n return count\n\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a", "class Solution:\n def countBeautifulPairs(self, nums: List[int]) -> int:\n count = 0\n first_digits = [int(str(num)[0]) for num in nums]\n last_digits = [int(str(num)[-1]) for num in nums]\n\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if gcd(first_digits[i], last_digits[j]) == 1:\n count += 1\n\n return count\n\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a", "class Solution:\n def countBeautifulPairs(self, nums: List[int]) -> int:\n count = 0\n first_digits = [int(str(num)[0]) for num in nums]\n last_digits = [int(str(num)[-1]) for num in nums]\n\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if self.gcd(first_digits[i], last_digits[j]) == 1:\n count += 1\n\n return count\n\n def gcd(self, a, b):\n while b:\n a, b = b, a % b\n return a" ], "pass1_list": [ true, true, false, true, true, true, false, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def longestEqualSubarray(self, nums: List[int], k: int) -> int:\n n = len(nums)\n left, right = [0] * (n + 1), [0] * (n + 1)\n count, max_len = 0, 0\n\n for i in range(n):\n count += 1 if nums[i] == i + 1 else -1\n left[i + 1] = count\n\n count = 0\n for i in range(n - 1, -1, -1):\n count += 1 if nums[i] == i + 1 else -1\n right[i] = count\n\n for i in range(n):\n max_len = max(max_len, min(left[i], right[i]) + 1 + 2 * k)\n\n return max_len", "class Solution:\n def longestEqualSubarray(self, nums: List[int], k: int) -> int:\n n = len(nums)\n left, right = [0] * (n + 1), [0] * (n + 1)\n count, max_len = 0, 0\n\n for i in range(n):\n count += 1 if nums[i] == nums[i - 1] else -1\n left[i] = count\n max_len = max(max_len, left[i] if left[i] > 0 else 0)\n\n count = 0\n for i in range(n - 1, -1, -1):\n count += 1 if nums[i] == nums[i + 1] else -1\n right[i] = count\n max_len = max(max_len, right[i] if right[i] > 0 else 0)\n\n dp = [0] * (n + 1)\n for i in range(n):\n dp[i + 1] = max(dp[i] + (left[i] == right[i]), left[i], right[i])\n\n return max(dp[-1], k)", "class Solution:\n def longestEqualSubarray(self, nums: List[int], k: int) -> int:\n n = len(nums)\n count = [0] * (n + 1)\n for num in nums:\n count[num] += 1\n\n max_length = 0\n for i in range(1, n + 1):\n if count[i] > k:\n continue\n max_length = max(max_length, count[i] + k)\n\n return max_length", "class Solution:\n def longestEqualSubarray(self, nums: List[int], k: int) -> int:\n n = len(nums)\n left, right = [0] * (n + 1), [0] * (n + 1)\n count, max_len = 0, 0\n\n for i in range(n):\n count += 1 if nums[i] == i + 1 else -1\n left[i + 1] = count\n if count == 0:\n max_len = i + 1\n\n count = 0\n for i in range(n - 1, -1, -1):\n count += 1 if nums[i] == i + 1 else -1\n right[i] = count\n if count == 0:\n max_len = max(max_len, n - i - 1)\n\n max_len = max(max_len, right[0] + left[0] - 1)\n dp = [0] * (n + 1)\n dp[0] = right[0]\n\n for i in range(1, n + 1):\n dp[i] = max(dp[i - 1], right[i] + left[i] - 1)\n if i - k - 1 >= 0:\n dp[i] = max(dp[i], dp[i - k - 1] + right[i] + left[i] - 1)\n max_len = max(max_len, dp[i])\n\n return max_len", "class Solution:\n def longestEqualSubarray(self, nums: List[int], k: int) -> int:\n n = len(nums)\n left, right = [0] * n, [0] * n\n count, max_len = 0, 0\n\n for i in range(n):\n if count < k:\n left[i] = (left[i - 1] + 1) if i > 0 and nums[i] == nums[i - 1] else 1\n count += 1 if i > 0 and nums[i] != nums[i - 1] else 0\n else:\n left[i] = 1\n\n count = 0\n for i in range(n - 1, -1, -1):\n if count < k:\n right[i] = (right[i + 1] + 1) if i < n - 1 and nums[i] == nums[i + 1] else 1\n count += 1 if i < n - 1 and nums[i] != nums[i + 1] else 0\n else:\n right[i] = 1\n\n for i in range(n):\n max_len = max(max_len, left[i] + right[i] - 1)\n\n return max_len", "class Solution:\n def longestEqualSubarray(self, nums: List[int], k: int) -> int:\n n = len(nums)\n left, right = [0] * (n + 1), [0] * (n + 1)\n count, max_len = 0, 0\n\n for i in range(n):\n count += 1 if nums[i] == i + 1 else -1\n left[i + 1] = count\n if count == 0:\n max_len += 1\n\n count = 0\n for i in range(n - 1, -1, -1):\n count += 1 if nums[i] == i + 1 else -1\n right[i] = count\n\n for i in range(n):\n max_len = max(max_len, right[i] - left[i] + 1 + k)\n\n return max_len", "class Solution:\n def longestEqualSubarray(self, nums: List[int], k: int) -> int:\n n = len(nums)\n left, right = [0] * (n + 1), [0] * (n + 1)\n count, max_len = 0, 0\n\n for i in range(n):\n if count < k:\n left[i + 1] = left[i]\n if nums[i] == i + 1:\n count += 1\n left[i + 1] += 1\n else:\n left[i + 1] = left[i] - 1\n\n j = n - i - 1\n if count <= k:\n right[j] = right[j + 1]\n if nums[j] == j + 1:\n count += 1\n right[j] += 1\n else:\n right[j] = right[j + 1] + 1\n\n if i + 1 + j <= n and left[i + 1] + right[j] + count - (nums[i] == i + 1) - (nums[j] == j + 1) <= k:\n max_len = max(max_len, left[i + 1] + right[j] + 1)\n\n return max_len", "class Solution:\n def longestEqualSubarray(self, nums: List[int], k: int) -> int:\n n = len(nums)\n count = [0] * (n + 1)\n for num in nums:\n count[num] += 1\n\n max_len = 0\n for i in range(1, n + 1):\n if count[i] > 0:\n left, right = 0, n - 1\n while left < right:\n if count[left] < k and count[right] < k:\n break\n if count[left] >= k:\n count[left] -= k\n left += 1\n else:\n count[right] -= k\n right -= 1\n max_len = max(max_len, right - left + 1)\n\n return max_len", "class Solution:\n def longestEqualSubarray(self, nums: List[int], k: int) -> int:\n n = len(nums)\n left, right = [0] * (n + 1), [0] * (n + 1)\n freq = [0] * (n + 1)\n\n for i in range(n):\n freq[nums[i]] += 1\n\n for i in range(n):\n if freq[nums[i]] == 1:\n left[i + 1] = left[i] + 1\n else:\n left[i + 1] = left[i]\n\n for i in range(n - 1, -1, -1):\n if freq[nums[i]] == 1:\n right[i] = right[i + 1] + 1\n else:\n right[i] = right[i + 1]\n\n ans = 0\n for i in range(n):\n if left[i] + right[i] + k >= n:\n ans = max(ans, n - k)\n else:\n ans = max(ans, left[i] + right[i] + k)\n\n return ans", "class Solution:\n def longestEqualSubarray(self, nums: List[int], k: int) -> int:\n n = len(nums)\n left, right = [0] * n, [0] * n\n count, max_len = 0, 0\n\n for i in range(n):\n if k >= 0:\n count = (count + 1) if nums[i] == 1 else count\n left[i] = count\n else:\n left[i] = -1\n\n count = 0\n for i in range(n - 1, -1, -1):\n if k >= 0:\n count = (count + 1) if nums[i] == n else count\n right[i] = count\n else:\n right[i] = -1\n\n for i in range(n):\n if left[i] >= 0 and right[i] >= 0:\n max_len = max(max_len, left[i] + right[i] + 1 - i - 1)\n if k >= i:\n max_len = max(max_len, left[i] + right[n - k + i - 1] + k - i)\n\n return max_len" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countServers(self, n: int, logs: List[List[int]], x: int, queries: List[int]) -> List[int]:\n server_requests = [[] for _ in range(n + 1)]\n for server_id, time in logs:\n server_requests[server_id].append(time)\n\n active_servers = set(range(n + 1))\n\n for query in queries:\n lower_bound = query - x\n inactive_servers = active_servers.copy()\n for server_id in range(1, n + 1):\n if server_requests[server_id]:\n server_last_request = server_requests[server_id][-1]\n if server_last_request < lower_bound:\n inactive_servers.discard(server_id)\n else:\n active_servers.discard(server_id)\n\n result = len(inactive_servers)\n active_servers.update(inactive_servers)\n\n yield result", "class Solution:\n def countServers(self, n: int, logs: List[List[int]], x: int, queries: List[int]) -> List[int]:\n server_requests = [[] for _ in range(n + 1)]\n for server_id, time in logs:\n server_requests[server_id].append(time)\n\n active_servers = set(range(n + 1))\n result = []\n\n for query in queries:\n inactive_servers = set()\n for server_id in active_servers:\n if server_requests[server_id] and server_requests[server_id][-1] < query - x:\n inactive_servers.add(server_id)\n\n for server_id in inactive_servers:\n active_servers.remove(server_id)\n\n result.append(len(inactive_servers))\n\n return result", "class Solution:\n def countServers(self, n: int, logs: List[List[int]], x: int, queries: List[int]) -> List[int]:\n server_requests = [[] for _ in range(n + 1)]\n for server_id, time in logs:\n server_requests[server_id].append(time)\n\n active_servers = set(range(n + 1))\n\n for query in queries:\n lower_bound = query - x\n inactive_servers = active_servers.copy()\n for server_id, times in enumerate(server_requests):\n if times and times[-1] >= lower_bound:\n inactive_servers.discard(server_id)\n\n active_servers = set(range(n + 1))\n for server_id, times in enumerate(server_requests):\n if times and times[0] <= query:\n active_servers.discard(server_id)\n\n result = len(inactive_servers - active_servers)\n yield result", "class Solution:\n def countServers(self, n: int, logs: List[List[int]], x: int, queries: List[int]) -> List[int]:\n server_requests = [[] for _ in range(n + 1)]\n for server_id, time in logs:\n server_requests[server_id].append(time)\n\n active_servers = set(range(1, n + 1))\n\n for query in queries:\n lower_bound = query - x\n upper_bound = query\n\n for server_id, times in enumerate(server_requests):\n if times:\n lb = bisect_left(times, lower_bound)\n ub = bisect_right(times, upper_bound)\n if lb <= ub:\n active_servers.discard(server_id)\n else:\n active_servers.discard(server_id)\n\n result.append(len(active_servers))\n\n for server_id, times in enumerate(server_requests):\n if times:\n idx = bisect.bisect_left(times, lower_bound)\n if idx:\n active_servers.add(server_id)\n idx = bisect.bisect_right(times, upper_bound)\n if idx < len(times):\n active_servers.add(server_id)\n\n return result", "class Solution:\n def countServers(self, n: int, logs: List[List[int]], x: int, queries: List[int]) -> List[int]:\n server_requests = [[] for _ in range(n + 1)]\n for server_id, time in logs:\n server_requests[server_id].append(time)\n\n active_servers = set(range(n + 1))\n result = []\n\n for query in queries:\n lower_bound = query - x\n for server_id, times in enumerate(server_requests):\n if times and times[-1] < lower_bound:\n active_servers.discard(server_id)\n\n result.append(len(active_servers))\n active_servers = active_servers.union(set(range(n + 1)))\n\n return result", "class Solution:\n def countServers(self, n: int, logs: List[List[int]], x: int, queries: List[int]) -> List[int]:\n server_requests = [[] for _ in range(n + 1)]\n for server_id, time in logs:\n server_requests[server_id].append(time)\n\n active_servers = set(range(1, n + 1))\n\n result = []\n for query in queries:\n inactive_servers = set()\n for server_id in active_servers:\n if server_requests[server_id]:\n if server_requests[server_id][-1] < query - x:\n inactive_servers.add(server_id)\n else:\n active_servers.remove(server_id)\n\n result.append(len(inactive_servers) + (query - query % x))\n\n return result", "class Solution:\n def countServers(self, n: int, logs: List[List[int]], x: int, queries: List[int]) -> List[int]:\n server_requests = [[] for _ in range(n + 1)]\n for server_id, time in logs:\n server_requests[server_id].append(time)\n\n active_servers = set(range(n + 1))\n result = []\n\n for query in queries:\n inactive_servers = set()\n for server_id in active_servers:\n if server_requests[server_id]:\n latest_request = server_requests[server_id][0]\n if latest_request <= query - x:\n inactive_servers.add(server_id)\n else:\n active_servers.remove(server_id)\n\n server_requests[server_id].pop(0) if server_requests[server_id] and server_requests[server_id][0] <= query else None\n\n result.append(len(inactive_servers))\n\n return result", "class Solution:\n def countServers(self, n: int, logs: List[List[int]], x: int, queries: List[int]) -> List[int]:\n server_requests = [[] for _ in range(n + 1)]\n for server_id, time in logs:\n server_requests[server_id].append(time)\n\n active_servers = set(range(1, n + 1))\n result = []\n\n for query in queries:\n inactive_servers = set()\n for server_id in active_servers:\n if server_requests[server_id]:\n latest_request = server_requests[server_id][-1]\n if latest_request < query - x:\n inactive_servers.add(server_id)\n else:\n inactive_servers.add(server_id)\n\n active_servers -= inactive_servers\n result.append(len(inactive_servers))\n\n return result", "class Solution:\n def countServers(self, n: int, logs: List[List[int]], x: int, queries: List[int]) -> List[int]:\n server_requests = [[] for _ in range(n + 1)]\n for server_id, time in logs:\n server_requests[server_id].append(time)\n\n active_servers = set(range(1, n + 1))\n result = []\n\n for query in queries:\n inactive_servers = set()\n for server_id in active_servers:\n if server_requests[server_id]:\n latest_request = server_requests[server_id][-1]\n if latest_request < query - x:\n inactive_servers.add(server_id)\n else:\n inactive_servers.add(server_id)\n\n active_servers -= inactive_servers\n result.append(len(inactive_servers))\n\n return result", "class Solution:\n def countServers(self, n: int, logs: List[List[int]], x: int, queries: List[int]) -> List[int]:\n server_requests = [[] for _ in range(n + 1)]\n for server_id, time in logs:\n server_requests[server_id].append(time)\n\n active_servers = set(range(n + 1))\n\n for query in queries:\n lower_bound = query - x\n upper_bound = query\n\n inactive_servers = active_servers.copy()\n for server_id in range(1, n + 1):\n if server_requests[server_id]:\n last_request = server_requests[server_id][-1]\n if lower_bound <= last_request <= upper_bound:\n inactive_servers.discard(server_id)\n\n active_servers = set(range(n + 1))\n for server_id in inactive_servers:\n active_servers.discard(server_id)\n\n return [len(inactive_servers) for inactive_servers in [inactive_servers]]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def relocateMarbles(self, nums: List[int], moveFrom: List[int], moveTo: List[int]) -> List[int]:\n position_counts = {}\n for num in nums:\n position_counts[num] = position_counts.get(num, 0) + 1\n\n for i in range(len(moveFrom)):\n from_pos = moveFrom[i]\n to_pos = moveTo[i]\n position_counts[to_pos] = position_counts.get(to_pos, 0) + position_counts[from_pos]\n position_counts[from_pos] = 0\n\n return sorted(position_counts.keys())", "class Solution:\n def relocateMarbles(self, nums: List[int], moveFrom: List[int], moveTo: List[int]) -> List[int]:\n position_counts = {}\n for num in nums:\n position_counts[num] = position_counts.get(num, 0) + 1\n\n for i in range(len(moveFrom)):\n position_counts[moveTo[i]] = position_counts.get(moveTo[i], 0) + position_counts[moveFrom[i]]\n position_counts[moveFrom[i]] = 0\n\n return sorted(position_counts.keys())", "class Solution:\n def relocateMarbles(self, nums: List[int], moveFrom: List[int], moveTo: List[int]) -> List[int]:\n position_counts = {}\n for num in nums:\n position_counts[num] = position_counts.get(num, 0) + 1\n\n for i in range(len(moveFrom)):\n from_position = moveFrom[i]\n to_position = moveTo[i]\n position_counts[to_position] = position_counts.get(to_position, 0) + position_counts[from_position]\n position_counts[from_position] = 0\n\n return sorted(position for position, count in position_counts.items() if count > 0)", "class Solution:\n def relocateMarbles(self, nums: List[int], moveFrom: List[int], moveTo: List[int]) -> List[int]:\n position_count = {}\n for num in nums:\n position_count[num] = position_count.get(num, 0) + 1\n\n for i in range(len(moveFrom)):\n position_count[moveTo[i]] = position_count.get(moveTo[i], 0) + position_count[moveFrom[i]]\n position_count[moveFrom[i]] = 0\n\n return sorted(position_count.keys()) for position, count in position_count.items() if count > 0]", "class Solution:\n def relocateMarbles(self, nums: List[int], moveFrom: List[int], moveTo: List[int]) -> List[int]:\n position_counts = {}\n for num in nums:\n position_counts[num] = position_counts.get(num, 0) + 1\n \n for i in range(len(moveFrom)):\n position_counts[moveTo[i]] = position_counts.get(moveTo[i], 0) + position_counts[moveFrom[i]]\n position_counts[moveFrom[i]] = 0\n \n return sorted(position_counts.keys()).filter(lambda x: position_counts[x] > 0)", "class Solution:\n def relocateMarbles(self, nums: List[int], moveFrom: List[int], moveTo: List[int]) -> List[int]:\n position_counts = {}\n for num in nums:\n position_counts[num] = position_counts.get(num, 0) + 1\n\n for i in range(len(moveFrom)):\n position_counts[moveTo[i]] = position_counts.get(moveTo[i], 0) + position_counts[moveFrom[i]]\n position_counts[moveFrom[i]] = 0\n\n return sorted(position_counts.keys()) for position, count in position_counts.items() if count > 0]", "class Solution:\n def relocateMarbles(self, nums: List[int], moveFrom: List[int], moveTo: List[int]) -> List[int]:\n position_counts = {}\n for num in nums:\n position_counts[num] = position_counts.get(num, 0) + 1\n\n for i in range(len(moveFrom)):\n position_counts[moveTo[i]] = position_counts.get(moveTo[i], 0) + position_counts[moveFrom[i]]\n position_counts[moveFrom[i]] = 0\n\n return sorted(position_counts.keys())", "class Solution:\n def relocateMarbles(self, nums: List[int], moveFrom: List[int], moveTo: List[int]) -> List[int]:\n position_count = {}\n for num in nums:\n position_count[num] = position_count.get(num, 0) + 1\n\n for i in range(len(moveFrom)):\n position_count[moveTo[i]] = position_count.get(moveTo[i], 0) + position_count[moveFrom[i]]\n position_count[moveFrom[i]] = 0\n\n return sorted(position_count.keys())", "class Solution:\n def relocateMarbles(self, nums: List[int], moveFrom: List[int], moveTo: List[int]) -> List[int]:\n position_counts = {}\n for num in nums:\n position_counts[num] = position_counts.get(num, 0) + 1\n\n for i in range(len(moveFrom)):\n from_pos = moveFrom[i]\n to_pos = moveTo[i]\n position_counts[to_pos] = position_counts.get(to_pos, 0) + position_counts[from_pos]\n position_counts[from_pos] = 0\n\n occupied_positions = sorted(position for position, count in position_counts.items() if count > 0)\n return occupied_positions", "class Solution:\n def relocateMarbles(self, nums: List[int], moveFrom: List[int], moveTo: List[int]) -> List[int]:\n position_counts = {}\n for num in nums:\n position_counts[num] = position_counts.get(num, 0) + 1\n\n for i in range(len(moveFrom)):\n position_counts[moveTo[i]] = position_counts.get(moveTo[i], 0) + position_counts[moveFrom[i]]\n position_counts[moveFrom[i]] = 0\n\n return sorted(position_counts.keys()).filter(lambda x: position_counts[x] > 0)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def makeTheIntegerZero(self, num1: int, num2: int) -> int:\n if num1 == 0:\n return 0\n if num2 < 0:\n num2 = -num2\n if num1 < num2:\n return -1\n res = 0\n while num1 > 0:\n i = 0\n while 1 << i + 1 <= num1 - num2:\n i += 1\n num1 -= 1 << i + num2\n res += 1\n return res", "class Solution:\n def makeTheIntegerZero(self, num1: int, num2: int) -> int:\n if num1 == 0:\n return 0\n if num2 < 0:\n num2 = -num2\n if num1 < num2:\n return -1\n res = 0\n while num1 > 0:\n i = 0\n while 1 << i + 1 <= num1 - num2:\n i += 1\n num1 -= 1 << i\n res += 1\n return res", "class Solution:\n def makeTheIntegerZero(self, num1: int, num2: int) -> int:\n if num1 == 0:\n return 0\n if num2 < 0:\n num2 = -num2\n if num1 < num2:\n return -1\n res = 0\n while num1 > 0:\n i = 0\n while 1 << i + 1 <= num1 - num2:\n i += 1\n num1 -= 1 << i\n res += 1\n return res", "class Solution:\n def makeTheIntegerZero(self, num1: int, num2: int) -> int:\n if num1 == 0:\n return 0\n if num2 < 0:\n num2 = -num2\n if num1 < num2:\n return -1\n res = 0\n while num1 > 0:\n i = 0\n while 1 << i + 1 <= num1 - num2:\n i += 1\n num1 -= 1 << i\n res += 1\n return res", "class Solution:\n def makeTheIntegerZero(self, num1: int, num2: int) -> int:\n if num1 == 0:\n return 0\n if num2 < 0:\n num2 = -num2\n if num1 < num2:\n return -1\n res = 0\n while num1 > 0:\n bit = num1 & -num1\n if bit + num2 > num1:\n num1 -= bit\n else:\n num1 -= bit + num2\n res += 1\n return res", "class Solution:\n def makeTheIntegerZero(self, num1: int, num2: int) -> int:\n if num1 == 0:\n return 0\n if num2 < 0:\n num2 = -num2\n if num1 < num2:\n return -1\n res = 0\n while num1 > 0:\n i = 0\n while 1 << i + 1 <= num1 - num2:\n i += 1\n num1 -= 1 << i + num2\n res += 1\n return res", "class Solution:\n def makeTheIntegerZero(self, num1: int, num2: int) -> int:\n if num1 == 0:\n return 0\n if num2 < 0:\n num2 = -num2\n if num1 < num2:\n return -1\n if num1 == num2:\n return 1\n ans = 1\n while num1 > 0:\n i = 0\n while 1 << i + 1 <= num1 - num2:\n i += 1\n num1 -= 1 << i\n ans += 1\n return ans", "class Solution:\n def makeTheIntegerZero(self, num1: int, num2: int) -> int:\n if num1 == 0:\n return 0\n if num2 < 0:\n num2 = -num2\n if num1 < num2:\n return -1\n if num1 == num2:\n return 1\n ans = 1\n while num1 > 0:\n i = 0\n while 1 << i + 1 <= num1 - num2:\n i += 1\n num1 -= 1 << i\n ans += 1\n return ans", "class Solution:\n def makeTheIntegerZero(self, num1: int, num2: int) -> int:\n if num1 == 0:\n return 0\n if num2 < 0:\n num2 = -num2\n if num1 < num2:\n return -1\n res = 0\n while num1 > 0:\n i = 0\n while 1 << i + 1 <= num1 - num2:\n i += 1\n num1 -= 1 << i + num2\n res += 1\n return res", "class Solution:\n def makeTheIntegerZero(self, num1: int, num2: int) -> int:\n if num1 == 0:\n return 0\n if num2 < 0:\n num2 = -num2\n if num1 < num2:\n return -1\n res = 0\n while num1 > 0:\n i = 0\n while 1 << i + 1 <= num1 - num2:\n i += 1\n num1 -= 1 << i\n res += 1\n return res" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumSumQueries(self, nums1: List[int], nums2: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums1)\n indices = sorted(range(n), key=lambda i: (nums1[i], nums2[i]), reverse=True)\n answer = []\n\n for x, y in queries:\n for i in indices:\n if nums1[i] >= x and nums2[i] >= y:\n answer.append(nums1[i] + nums2[i])\n break\n else:\n answer.append(-1)\n\n return answer", "class Solution:\n def maximumSumQueries(self, nums1: List[int], nums2: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums1)\n indices = sorted(list(range(n)), key=lambda i: (nums1[i], nums2[i]), reverse=True)\n pq = []\n answer = []\n\n for x, y in queries:\n while pq and pq[0] < x:\n heapq.heappop(pq)\n\n idx = bisect.bisect_right(indices, -1, key=lambda i: nums1[i] < x)\n if idx == n or nums2[indices[idx - 1]] < y:\n ans = -1\n else:\n ans = nums1[indices[idx - 1]] + nums2[indices[idx - 1]]\n\n while pq and nums2[indices[-1]] >= y:\n idx = indices.pop()\n heapq.heappush(pq, nums1[idx])\n\n heapq.heappush(pq, ans)\n answer.append(heapq.nlargest(1, pq)[0])\n\n return answer", "class Solution:\n def maximumSumQueries(self, nums1: List[int], nums2: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums1)\n indices = sorted(range(n), key=lambda i: (nums1[i], nums2[i]), reverse=True)\n pq = []\n answer = []\n\n for x, y in queries:\n while pq and pq[0] < x:\n heapq.heappop(pq)\n\n idx = bisect_left(indices, -1)\n if idx < n and nums1[indices[idx]] >= x and nums2[indices[idx]] >= y:\n answer.append(nums1[indices[idx]] + nums2[indices[idx]])\n else:\n answer.append(-1)\n\n while idx < n and nums1[indices[idx]] >= x:\n heapq.heappush(pq, nums2[indices[idx]])\n idx += 1\n\n return answer", "class Solution:\n def maximumSumQueries(self, nums1: List[int], nums2: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums1)\n indices = sorted(range(n), key=lambda i: (nums1[i], nums2[i]), reverse=True)\n pq = []\n answer = []\n\n for x, y in queries:\n while pq and pq[0] < x:\n heappop(pq)\n idx = -1\n for i in indices:\n if nums1[i] >= x and nums2[i] >= y:\n if idx == -1 or nums1[i] + nums2[i] > nums1[idx] + nums2[idx]:\n idx = i\n if pq and nums2[i] < pq[0]:\n break\n if idx != -1:\n heappush(pq, nums2[idx])\n answer.append(nums1[idx] + nums2[idx])\n else:\n answer.append(-1)\n\n return answer", "class Solution:\n def maximumSumQueries(self, nums1: List[int], nums2: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums1)\n indices = sorted(range(n), key=lambda i: (nums1[i], nums2[i]), reverse=True)\n\n answer = []\n for x, y in queries:\n for j in indices:\n if nums1[j] >= x and nums2[j] >= y:\n answer.append(nums1[j] + nums2[j])\n break\n else:\n answer.append(-1)\n\n return answer", "class Solution:\n def maximumSumQueries(self, nums1: List[int], nums2: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums1)\n indices = [[] for _ in range(n)]\n for i in range(n):\n indices[nums1[i] - 1].append(i)\n \n answer = []\n for x, y in queries:\n max_sum = -1\n for idx in indices[x - 1]:\n if nums2[idx] >= y:\n max_sum = max(max_sum, nums1[idx] + nums2[idx])\n answer.append(max_sum)\n \n return answer", "class Solution:\n def maximumSumQueries(self, nums1: List[int], nums2: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums1)\n indices = sorted(range(n), key=lambda i: (nums1[i], nums2[i]), reverse=True)\n pq = []\n answer = []\n\n for x, y in queries:\n while pq and pq[0] < x:\n heappop(pq)\n idx = -1\n while pq and nums1[indices[pq[0]]] >= x and nums2[indices[pq[0]]] >= y:\n idx = indices[heappop(pq)]\n if idx != -1:\n answer.append(nums1[idx] + nums2[idx])\n else:\n answer.append(-1)\n heappush(pq, indices.index(idx))\n\n return answer", "class Solution:\n def maximumSumQueries(self, nums1: List[int], nums2: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums1)\n indices = sorted(range(n), key=lambda i: (nums1[i], nums2[i]), reverse=True)\n pq = []\n answer = []\n\n for x, y in queries:\n while pq and pq[0] < x:\n heapq.heappop(pq)\n\n idx = -1\n while pq and nums1[indices[pq[0]]] >= x and nums2[indices[pq[0]]] >= y:\n idx = indices[heapq.heappop(pq)]\n\n answer.append(idx + 1 if idx != -1 else -1)\n\n heapq.heappush(pq, indices.index(idx))\n\n return answer", "class Solution:\n def maximumSumQueries(self, nums1: List[int], nums2: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums1)\n indices = sorted(range(n), key=lambda i: (nums1[i], nums2[i]), reverse=True)\n answer = []\n\n for x, y in queries:\n for i in indices:\n if nums1[i] >= x and nums2[i] >= y:\n answer.append(nums1[i] + nums2[i])\n break\n else:\n answer.append(-1)\n\n return answer", "class Solution:\n def maximumSumQueries(self, nums1: List[int], nums2: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums1)\n indices = sorted(list(range(n)), key=lambda i: (nums1[i], nums2[i]), reverse=True)\n\n def binary_search(arr, target):\n left, right = 0, len(arr) - 1\n while left <= right:\n mid = (left + right) // 2\n if arr[mid] < target:\n left = mid + 1\n else:\n right = mid - 1\n return left\n\n answer = []\n for query in queries:\n x, y = query\n idx = binary_search(nums1, x)\n if idx < n and nums2[indices[idx]] >= y:\n answer.append(nums1[indices[idx]] + nums2[indices[idx]])\n else:\n answer.append(-1)\n\n return answer" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def sumOfSquares(self, nums: List[int]) -> int:\n n = len(nums)\n return sum(nums[i] ** 2 for i in range(1, n + 1) if n % i == 0)", "class Solution:\n def sumOfSquares(self, nums: List[int]) -> int:\n n = len(nums)\n return sum(nums[i] ** 2 for i in range(1, n + 1) if n % i == 0)", "class Solution:\n def sumOfSquares(self, nums: List[int]) -> int:\n n = len(nums)\n return sum(nums[i] ** 2 for i in range(1, n + 1) if n % i == 0)", "class Solution:\n def sumOfSquares(self, nums: List[int]) -> int:\n n = len(nums)\n return sum(nums[i] ** 2 for i in range(1, n + 1) if n % i == 0)", "class Solution:\n def sumOfSquares(self, nums: List[int]) -> int:\n n = len(nums)\n return sum(nums[i] ** 2 for i in range(1, n + 1) if n % i == 0)", "class Solution:\n def sumOfSquares(self, nums: List[int]) -> int:\n n = len(nums)\n return sum(nums[i] ** 2 for i in range(1, n + 1) if n % i == 0)", "class Solution:\n def sumOfSquares(self, nums: List[int]) -> int:\n n = len(nums)\n return sum(nums[i] ** 2 for i in range(1, n + 1) if n % i == 0)", "class Solution:\n def sumOfSquares(self, nums: List[int]) -> int:\n n = len(nums)\n return sum(nums[i] ** 2 for i in range(1, n + 1) if n % i == 0)", "class Solution:\n def sumOfSquares(self, nums: List[int]) -> int:\n n = len(nums)\n return sum(nums[i] ** 2 for i in range(1, n + 1) if i % n == 0)", "class Solution:\n def sumOfSquares(self, nums: List[int]) -> int:\n n = len(nums)\n return sum(nums[i] ** 2 for i in range(1, n + 1) if n % i == 0)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findValueOfPartition(self, nums: List[int]) -> int:\n nums.sort()\n nums1_max = nums[0]\n nums2_min = nums[-1]\n for i in range(1, len(nums)):\n if nums[i] - nums[i - 1] < nums2_min - nums1_max:\n nums1_max = nums[i - 1]\n nums2_min = nums[i]\n elif nums[i] - nums[i - 1] == nums2_min - nums1_max:\n nums1_max = max(nums1_max, nums[i])\n nums2_min = min(nums2_min, nums[i - 1])\n return nums2_min - nums1_max", "class Solution:\n def findValueOfPartition(self, nums: List[int]) -> int:\n nums.sort()\n nums1_max = nums[0]\n nums2_min = nums[-1]\n for i in range(1, len(nums)):\n candidate1 = nums[i]\n candidate2 = nums[-1 - i]\n if candidate1 - candidate2 < nums1_max - nums2_min:\n nums1_max = candidate1\n nums2_min = candidate2\n return nums1_max - nums2_min", "class Solution:\n def findValueOfPartition(self, nums: List[int]) -> int:\n nums.sort()\n nums1_max = nums[0]\n nums2_min = nums[-1]\n for i in range(1, len(nums)):\n if nums[i] - nums[i - 1] < nums2_min - nums1_max:\n nums1_max = nums[i - 1]\n nums2_min = nums[i]\n elif nums[i] - nums[i - 1] == nums2_min - nums1_max:\n nums1_max = min(nums1_max, nums[i])\n return nums2_min - nums1_max", "class Solution:\n def findValueOfPartition(self, nums: List[int]) -> int:\n nums.sort()\n nums1_max = nums[0]\n nums2_min = nums[-1]\n for i in range(1, len(nums)):\n if nums[i] - nums[i - 1] < nums2_min - nums1_max:\n nums1_max = nums[i - 1]\n nums2_min = nums[i]\n elif nums[i] - nums[i - 1] == nums2_min - nums1_max:\n nums1_max = min(nums1_max, nums[i])\n nums2_min = min(nums2_min, nums[i - 1])\n return nums2_min - nums1_max", "class Solution:\n def findValueOfPartition(self, nums: List[int]) -> int:\n nums.sort()\n nums1_max = nums[0]\n nums2_min = nums[-1]\n for i in range(1, len(nums)):\n if nums[i] - nums[i - 1] < nums2_min - nums1_max:\n nums1_max = nums[i - 1]\n nums2_min = nums[i]\n elif nums[i] - nums[i - 1] == nums2_min - nums1_max:\n nums1_max = min(nums1_max, nums[i])\n nums2_min = min(nums2_min, nums[i - 1])\n return nums2_min - nums1_max", "class Solution:\n def findValueOfPartition(self, nums: List[int]) -> int:\n nums.sort()\n nums1_max = nums[0]\n nums2_min = nums[-1]\n for i in range(1, len(nums)):\n if nums[i] - nums[i - 1] < nums2_min - nums1_max:\n nums1_max = nums[i - 1]\n nums2_min = nums[i]\n elif nums[i] - nums[i - 1] == nums2_min - nums1_max:\n nums1_max = max(nums1_max, nums[i])\n nums2_min = min(nums2_min, nums[i - 1])\n return nums2_min - nums1_max", "class Solution:\n def findValueOfPartition(self, nums: List[int]) -> int:\n nums.sort()\n nums1_max = nums[0]\n nums2_min = nums[-1]\n for i in range(1, len(nums)):\n if nums[i] - nums[i - 1] < nums2_min - nums1_max:\n nums1_max = nums[i - 1]\n nums2_min = nums[i]\n elif nums[i] - nums[i - 1] == nums2_min - nums1_max:\n nums1_max = max(nums1_max, nums[i])\n nums2_min = min(nums2_min, nums[i - 1])\n return nums2_min - nums1_max", "class Solution:\n def findValueOfPartition(self, nums: List[int]) -> int:\n nums.sort()\n nums1_max = nums[0]\n nums2_min = nums[-1]\n for i in range(1, len(nums)):\n if nums[i] - nums[i - 1] < nums2_min - nums1_max:\n nums1_max = nums[i - 1]\n nums2_min = nums[i]\n else:\n nums1_max = max(nums1_max, nums[i])\n return nums2_min - nums1_max", "class Solution:\n def findValueOfPartition(self, nums: List[int]) -> int:\n nums.sort()\n nums1_max = nums[0]\n nums2_min = nums[-1]\n for i in range(1, len(nums)):\n if nums[i] - nums[i - 1] < nums2_min - nums1_max:\n nums1_max = nums[i - 1]\n nums2_min = nums[i]\n elif nums[i] - nums[i - 1] == nums2_min - nums1_max:\n nums1_max = min(nums1_max, nums[i])\n nums2_min = min(nums2_min, nums[i - 1])\n return nums2_min - nums1_max", "class Solution:\n def findValueOfPartition(self, nums: List[int]) -> int:\n nums.sort()\n nums1_max = nums[0]\n nums2_min = nums[-1]\n for i in range(1, len(nums)):\n if nums[i] - nums[i - 1] < nums2_min - nums1_max:\n nums1_max = nums[i - 1]\n nums2_min = nums[i]\n else:\n nums1_max = max(nums1_max, nums[i])\n return nums2_min - nums1_max" ], "pass1_list": [ false, false, true, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumNumberOfStringPairs(self, words: List[str]) -> int:\n reversed_words = {word[::-1] for word in words}\n pairs = 0\n for word in words:\n if word in reversed_words:\n pairs += 1\n reversed_words.remove(word)\n return pairs", "class Solution:\n def maximumNumberOfStringPairs(self, words: List[str]) -> int:\n count = 0\n pairs = set()\n for word in words:\n reversed_word = word[::-1]\n if reversed_word in words and word < reversed_word:\n pairs.add(word + reversed_word)\n count += 1\n return count", "class Solution:\n def maximumNumberOfStringPairs(self, words: List[str]) -> int:\n count = 0\n pairs = set()\n for word in words:\n reversed_word = word[::-1]\n if reversed_word in pairs:\n count += 1\n pairs.remove(reversed_word)\n else:\n pairs.add(word)\n return count", "class Solution:\n def maximumNumberOfStringPairs(self, words: List[str]) -> int:\n count = 0\n pairs = set()\n for word in words:\n reversed_word = word[::-1]\n if reversed_word in pairs:\n count += 1\n pairs.remove(reversed_word)\n else:\n pairs.add(word)\n return count", "class Solution:\n def maximumNumberOfStringPairs(self, words: List[str]) -> int:\n count = 0\n pairs = set()\n for word in words:\n reversed_word = word[::-1]\n if reversed_word in words and word < reversed_word:\n pairs.add(word + reversed_word)\n return len(pairs)", "class Solution:\n def maximumNumberOfStringPairs(self, words: List[str]) -> int:\n count = 0\n pairs = set()\n for word in words:\n reversed_word = word[::-1]\n if reversed_word in pairs:\n count += 1\n pairs.remove(reversed_word)\n else:\n pairs.add(word)\n return count", "class Solution:\n def maximumNumberOfStringPairs(self, words: List[str]) -> int:\n count = 0\n pairs = set()\n for word in words:\n reversed_word = word[::-1]\n if reversed_word in words and word < reversed_word:\n pairs.add(word + reversed_word)\n count += 1\n return count", "class Solution:\n def maximumNumberOfStringPairs(self, words: List[str]) -> int:\n count = 0\n pairs = set()\n for word in words:\n reversed_word = word[::-1]\n if reversed_word in words and word < reversed_word:\n pairs.add(word + reversed_word)\n count += 1\n return count", "class Solution:\n def maximumNumberOfStringPairs(self, words: List[str]) -> int:\n count = 0\n pairs = set()\n for word in words:\n reversed_word = word[::-1]\n if reversed_word in words and word < reversed_word:\n pairs.add(word + reversed_word)\n count += 1\n return count", "class Solution:\n def maximumNumberOfStringPairs(self, words: List[str]) -> int:\n count = 0\n pairs = set()\n for word in words:\n reversed_word = word[::-1]\n if reversed_word in pairs:\n count += 1\n pairs.remove(reversed_word)\n else:\n pairs.add(word)\n return count" ], "pass1_list": [ false, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def specialPerm(self, nums: List[int]) -> int:\n n = len(nums)\n mod = 10**9 + 7\n nums.sort()\n dp = [[0] * n for _ in range(1 << n)]\n dp[0][0] = 1\n for mask in range(1 << n - 1):\n for i in range(n):\n if mask & (1 << i) == 0:\n continue\n for j in range(n):\n if i != j and nums[j] % nums[i] == 0:\n dp[mask | (1 << j)][j] = (dp[mask | (1 << j)][j] + dp[mask][i]) % mod\n ans = 0\n for i in range(n):\n ans = (ans + dp[(1 << n) - 1][i]) % mod\n return ans", "class Solution:\n def specialPerm(self, nums: List[int]) -> int:\n n = len(nums)\n mod = 10**9 + 7\n dp = [[0] * n for _ in range(1 << n)]\n dp[0][-1] = 1\n\n for mask in range(1 << n):\n for i in range(n):\n if mask >> i & 1:\n for j in range(i):\n if nums[j] % nums[i] == 0 or nums[i] % nums[j] == 0:\n dp[mask][i] = (dp[mask][i] + dp[mask ^ 1 << i][j]) % mod\n\n return sum(dp[(1 << n) - 1]) % mod", "class Solution:\n def specialPerm(self, nums: List[int]) -> int:\n n = len(nums)\n mod = 10**9 + 7\n nums.sort()\n dp = [1] * n\n\n for i in range(n):\n for j in range(i):\n if nums[i] % nums[j] == 0 or nums[j] % nums[i] == 0:\n dp[i] = (dp[i] + dp[j]) % mod\n\n return sum(dp) % mod", "class Solution:\n def specialPerm(self, nums: List[int]) -> int:\n n = len(nums)\n mod = 10**9 + 7\n dp = [[0] * n for _ in range(1 << n)]\n dp[0][-1] = 1\n\n for mask in range(1 << n):\n for i in range(n):\n if mask >> i & 1:\n for j in range(i + 1, n):\n if nums[j] % nums[i] == 0 or nums[i] % nums[j] == 0:\n dp[mask][j] = (dp[mask][j] + dp[mask ^ 1 << i][i]) % mod\n\n return dp[(1 << n) - 1][-1]", "class Solution:\n def specialPerm(self, nums: List[int]) -> int:\n n = len(nums)\n mod = 10**9 + 7\n nums.sort()\n dp = [[0] * n for _ in range(1 << n)]\n dp[0][0] = 1\n\n for mask in range(1 << n):\n for i in range(n):\n if mask >> i & 1:\n for j in range(i):\n if nums[j] % nums[i] == 0 or nums[i] % nums[j] == 0:\n dp[mask][i] += dp[mask ^ (1 << i)][j]\n dp[mask][i] %= mod\n\n return dp[(1 << n) - 1][-1]", "class Solution:\n def specialPerm(self, nums: List[int]) -> int:\n n = len(nums)\n mod = 10**9 + 7\n dp = [[0] * n for _ in range(1 << n)]\n dp[0][-1] = 1\n\n for mask in range(1 << n):\n for i in range(n):\n if mask >> i & 1:\n for j in range(i + 1, n):\n if nums[j] % nums[i] == 0 or nums[i] % nums[j] == 0:\n dp[mask][j] = (dp[mask][j] + dp[mask ^ 1 << i][i]) % mod\n\n return sum(dp[(1 << n) - 1]) % mod", "class Solution:\n def specialPerm(self, nums: List[int]) -> int:\n n = len(nums)\n mod = 10**9 + 7\n nums.sort()\n dp = [1] * n\n\n for i in range(n):\n for j in range(i):\n if nums[i] % nums[j] == 0 or nums[j] % nums[i] == 0:\n dp[i] = (dp[i] + dp[j]) % mod\n\n return sum(dp) % mod", "class Solution:\n def specialPerm(self, nums: List[int]) -> int:\n n = len(nums)\n mod = 10**9 + 7\n nums.sort()\n dp = [[0] * n for _ in range(1 << n)]\n dp[0][0] = 1\n for mask in range(1 << n - 1):\n for i in range(n):\n if mask & (1 << i) == 0:\n for j in range(i + 1, n):\n if nums[j] % nums[i] == 0 or nums[i] % nums[j] == 0:\n dp[mask | (1 << j)][j] += dp[mask][i]\n dp[mask | (1 << j)][j] %= mod\n return sum(dp[(1 << n) - 1]) % mod", "class Solution:\n def specialPerm(self, nums: List[int]) -> int:\n n = len(nums)\n mod = 10**9 + 7\n dp = [[0] * n for _ in range(1 << n)]\n dp[0][0] = 1\n\n for mask in range(1 << n):\n for i in range(n):\n if mask >> i & 1:\n for j in range(i + 1, n):\n if nums[j] % nums[i] == 0 or nums[i] % nums[j] == 0:\n dp[mask][j] = (dp[mask][j] + dp[mask ^ 1 << i][i]) % mod\n\n return dp[(1 << n) - 1][n - 1]", "class Solution:\n def specialPerm(self, nums: List[int]) -> int:\n n = len(nums)\n mod = 10**9 + 7\n dp = [[0] * n for _ in range(1 << n)]\n dp[0][0] = 1\n\n for mask in range(1 << n):\n for i in range(n):\n if mask >> i & 1:\n for j in range(i + 1, n):\n if nums[j] % nums[i] == 0 or nums[i] % nums[j] == 0:\n dp[mask][j] = (dp[mask][j] + dp[mask ^ 1 << i][i]) % mod\n\n return dp[(1 << n) - 1][n - 1]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def sumImbalanceNumbers(self, nums: List[int]) -> int:\n n = len(nums)\n prefix_sum = [0] * (n + 1)\n for i in range(n):\n prefix_sum[i + 1] = prefix_sum[i] + nums[i]\n\n sorted_nums = sorted(nums)\n unique_nums = sorted(set(nums))\n count = [0] * (n + 1)\n for num in nums:\n count[num] += 1\n\n imbalance = 0\n for i in range(len(unique_nums) - 1):\n num = unique_nums[i]\n next_num = unique_nums[i + 1]\n imbalance_count = count[num] * (next_num - num - 1)\n for j in range(num, next_num):\n imbalance_count -= count[j]\n imbalance += (\n prefix_sum[n] - prefix_sum[num] + num * count[num] - imbalance_count\n )\n\n return imbalance", "class Solution:\n def sumImbalanceNumbers(self, nums: List[int]) -> int:\n n = len(nums)\n prefix_sum = [0] * (n + 1)\n for i in range(n):\n prefix_sum[i + 1] = prefix_sum[i] + nums[i]\n\n sorted_nums = sorted(nums)\n imbalance_count = [0] * n\n for i in range(n - 1):\n if sorted_nums[i + 1] - sorted_nums[i] > 1:\n imbalance_count[i] = 1\n\n ans = 0\n for i in range(n):\n left = nums[:i].index(sorted_nums[i]) if sorted_nums[i] in nums[:i] else 0\n right = nums[i + 1 :].index(sorted_nums[i]) + i + 1 if sorted_nums[i] in nums[i + 1 :] else n\n ans += prefix_sum[right] - prefix_sum[left] - (i - left) * nums[left] - (right - i - 1) * nums[i]\n\n return ans", "class Solution:\n def sumImbalanceNumbers(self, nums: List[int]) -> int:\n n = len(nums)\n prefix_sum = [0] * (n + 1)\n for i in range(n):\n prefix_sum[i + 1] = prefix_sum[i] + nums[i]\n\n sorted_nums = sorted(nums)\n unique_nums = list(set(nums))\n count = [0] * (n + 1)\n\n for num in unique_nums:\n count[num] = sorted_nums.count(num)\n\n imbalance = 0\n for i in range(n):\n imbalance += (count[nums[i]] - 1) * (prefix_sum[i] - nums[i])\n\n return imbalance", "class Solution:\n def sumImbalanceNumbers(self, nums: List[int]) -> int:\n n = len(nums)\n prefix_sum = [0] * (n + 1)\n for i in range(n):\n prefix_sum[i + 1] = prefix_sum[i] + nums[i]\n\n sorted_nums = sorted(nums)\n count = [0] * n\n for i in range(n - 1):\n if sorted_nums[i + 1] - sorted_nums[i] > 1:\n count[i] = 1\n\n ans = 0\n for i in range(n):\n l = count[max(0, i - sorted_nums[i])]\n r = count[min(n - 1, i + n - sorted_nums[i] - 1)]\n ans += prefix_sum[i + 1] * (prefix_sum[-1] - prefix_sum[i + 1]) - l * prefix_sum[i] * (prefix_sum[i + 1] - prefix_sum[l + i + 1]) - r * (prefix_sum[-1] - prefix_sum[i + r + 1]) * (prefix_sum[i + 1] - prefix_sum[i])\n return ans", "class Solution:\n def sumImbalanceNumbers(self, nums: List[int]) -> int:\n n = len(nums)\n prefix_sum = [0] * (n + 1)\n for i in range(n):\n prefix_sum[i + 1] = prefix_sum[i] + nums[i]\n\n sorted_nums = sorted(nums)\n count = [0] * n\n for i in range(n - 1):\n if sorted_nums[i + 1] - sorted_nums[i] > 1:\n count[i] = 1\n\n ans = 0\n for i in range(n):\n left = count[max(0, i - nums[i] + 1):i]\n ans += sum(left) * (n - nums[i])\n ans += prefix_sum[i] - prefix_sum[max(0, i - nums[i] + 1)]\n\n return ans", "class Solution:\n def sumImbalanceNumbers(self, nums: List[int]) -> int:\n n = len(nums)\n prefix_sum = [0] * (n + 1)\n for i in range(n):\n prefix_sum[i + 1] = prefix_sum[i] + nums[i]\n\n sorted_nums = sorted(nums)\n unique_nums = list(set(sorted_nums))\n count = [0] * (n + 1)\n for num in sorted_nums:\n count[num] += 1\n\n imbalance = 0\n for i in range(len(unique_nums) - 1):\n num = unique_nums[i]\n next_num = unique_nums[i + 1]\n imbalance += (next_num - num - 1) * count[num] * (prefix_sum[n] - prefix_sum[num])\n\n return imbalance", "class Solution:\n def sumImbalanceNumbers(self, nums: List[int]) -> int:\n n = len(nums)\n prefix_sum = [0] * (n + 1)\n for i in range(n):\n prefix_sum[i + 1] = prefix_sum[i] + nums[i]\n\n sorted_nums = sorted(nums)\n count = [0] * n\n for i in range(n - 1):\n if sorted_nums[i + 1] - sorted_nums[i] > 1:\n count[i] = 1\n\n ans = 0\n for i in range(n):\n l = count[max(0, i - nums[i] + 1)]\n r = count[min(n - 1, i + n - nums[i])]\n ans += prefix_sum[i + 1] - prefix_sum[i] - prefix_sum[n] + prefix_sum[l + 1] - prefix_sum[r + 1]\n\n return ans", "class Solution:\n def sumImbalanceNumbers(self, nums: List[int]) -> int:\n n = len(nums)\n prefix_sum = [0] * (n + 1)\n for i in range(n):\n prefix_sum[i + 1] = prefix_sum[i] + nums[i]\n\n sorted_nums = sorted(nums)\n count = [0] * n\n for i in range(n - 1):\n if sorted_nums[i + 1] - sorted_nums[i] > 1:\n count[i] = 1\n\n ans = 0\n for i in range(n):\n left = count[max(0, i - sorted_nums[i])]\n right = count[min(n - 1, i + n - sorted_nums[i] - 1)]\n ans += prefix_sum[i + 1] - prefix_sum[i] - (prefix_sum[n] - prefix_sum[i + 1] - prefix_sum[i]) * (left + right)\n\n return ans", "class Solution:\n def sumImbalanceNumbers(self, nums: List[int]) -> int:\n n = len(nums)\n prefix_sum = [0] * (n + 1)\n for i in range(n):\n prefix_sum[i + 1] = prefix_sum[i] + nums[i]\n\n sorted_nums = sorted(nums)\n count = [0] * n\n for i in range(n - 1):\n if sorted_nums[i + 1] - sorted_nums[i] > 1:\n count[i] = 1\n\n ans = 0\n for i in range(n):\n left = count[max(0, i - sorted_nums[i])]\n right = count[min(n - 1, i + n - sorted_nums[i] - 1)]\n ans += prefix_sum[i + 1] * (prefix_sum[n] - prefix_sum[i + 1]) - left * prefix_sum[i] - right * (prefix_sum[n] - prefix_sum[i + 1])\n\n return ans", "class Solution:\n def sumImbalanceNumbers(self, nums: List[int]) -> int:\n n = len(nums)\n prefix_sum = [0] * (n + 1)\n for i in range(n):\n prefix_sum[i + 1] = prefix_sum[i] + nums[i]\n\n sorted_nums = sorted(nums)\n unique_nums = list(set(nums))\n count = [0] * (n + 1)\n for num in nums:\n count[num] += 1\n\n imbalance = 0\n for i in range(len(unique_nums) - 1):\n num = unique_nums[i]\n next_num = unique_nums[i + 1]\n imbalance_count = count[num] * (next_num - num - 1)\n imbalance += (prefix_sum[next_num] - prefix_sum[num] + 1) * imbalance_count\n\n return imbalance" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def longestString(self, x: int, y: int, z: int) -> int:\n def check(aa, bb, ab):\n s = \"\"\n for i in range(aa):\n s += \"AA\"\n for i in range(bb):\n s += \"BB\"\n for i in range(ab):\n s += \"AB\"\n return s\n \n max_len = 0\n for i in range(x + 1):\n for j in range(y + 1):\n for k in range(z + 1):\n if \"AAA\" not in check(i, j, k) and \"BBB\" not in check(i, j, k):\n max_len = max(max_len, 2 * (i + j) + k)\n return max_len", "class Solution:\n def longestString(self, x: int, y: int, z: int) -> int:\n def check(AA, BB, AB):\n count_A = 2 * AA + AB\n count_B = 2 * BB + AB\n s = AB * (AB > 0) + \"A\" * (count_A > 0) + \"B\" * (count_B > 0)\n return not (\"AAA\" in s or \"BBB\" in s)\n\n max_len = 0\n for AA in range(x + 1):\n for BB in range(y + 1):\n for AB in range(z + 1):\n if check(AA, BB, AB):\n max_len = max(max_len, 2 * (AA + BB) + AB)\n return max_len", "class Solution:\n def longestString(self, x: int, y: int, z: int) -> int:\n def check(aa, bb, ab):\n return (aa + bb) * 2 + ab if (aa + bb) * 2 + ab >= 14 or (aa + ab) * 2 + bb if (aa + ab) * 2 + bb >= 14 else (aa + bb) * 2 + ab if (aa + bb) % 2 == 0 else (aa + ab) * 2 + bb\n\n return max(check(x - i, y - j, z - k) for i in range(x + 1) for j in range(y + 1) for k in range(z + 1) if i + j + k <= 2 * (x + y + z) // 3)", "class Solution:\n def longestString(self, x: int, y: int, z: int) -> int:\n def check(aa, bb, ab):\n s = \"\"\n for i in range(aa):\n s += \"AA\"\n for i in range(bb):\n s += \"BB\"\n for i in range(ab):\n s += \"AB\"\n return s\n \n max_len = 0\n for i in range(x + 1):\n for j in range(y + 1):\n for k in range(z + 1):\n if \"AAA\" not in check(i, j, k) and \"BBB\" not in check(i, j, k):\n max_len = max(max_len, 2 * (i + j + k) + min(i, j) + min(i, k) + min(j, k))\n return max_len", "class Solution:\n def longestString(self, x: int, y: int, z: int) -> int:\n def check(a, b, c):\n if a > 2:\n a -= 3\n if b > 2:\n b -= 3\n return a * 2 + b * 2 + z * 2\n\n max_len = max(check(x - 1, y, z), check(x, y - 1, z), check(x, y, z - 1))\n return max_len", "class Solution:\n def longestString(self, x: int, y: int, z: int) -> int:\n def check(a, b, c):\n if a > 2:\n return False\n if b > 2:\n return False\n for i in range(len(s)):\n if i + 2 < len(s) and s[i:i+3] in {\"AAA\", \"BBB\"}:\n return False\n return True\n\n def dfs(a, b, c):\n if a < 0 or b < 0 or c < 0:\n return 0\n if a == 0 and b == 0 and c == 0:\n return 0\n if check(a, b, c):\n return 2 * a + 2 * b + c\n return max(\n dfs(a - 1, b, c),\n dfs(a, b - 1, c),\n dfs(a, b, c - 1),\n dfs(a - 1, b - 1, c + 1),\n dfs(a - 1, b, c - 1),\n dfs(a, b - 1, c + 1),\n )\n\n s = [\"AA\", \"BB\", \"AB\"]\n return dfs(x, y, z)", "class Solution:\n def longestString(self, x: int, y: int, z: int) -> int:\n def check(a, b, c):\n if a > 2 and b == 0 and c == 0:\n return False\n if b > 2 and a == 0 and c == 0:\n return False\n return True\n\n ans = 0\n for a in range(x + 1):\n for b in range(y + 1):\n for c in range(z + 1):\n if check(a, b, c):\n ans = max(ans, 2 * (a + b) + c)\n return ans", "class Solution:\n def longestString(self, x: int, y: int, z: int) -> int:\n def check(a, b, c):\n if a > 0 and b > 0 and (c + 2 * a >= 3 or c + 2 * b >= 3):\n return False\n return True\n\n def dfs(a, b, c):\n if not check(a, b, c):\n return 0\n if a == 0 and b == 0 and c == 0:\n return 0\n ans = 0\n if a > 0:\n ans = max(ans, 2 + dfs(a - 1, b, c + 1))\n if b > 0:\n ans = max(ans, 2 + dfs(a, b - 1, c + 1))\n if c > 0:\n ans = max(ans, 1 + dfs(a, b, c - 1))\n return ans\n\n return dfs(x, y, z)", "class Solution:\n def longestString(self, x: int, y: int, z: int) -> int:\n def check(a, b, c):\n if a > 0 and c > 0 and (a + c) % 2 == 0:\n return False\n if b > 0 and c > 0 and (b + c) % 2 == 0:\n return False\n return True\n\n ans = 0\n for i in range(x + 1):\n for j in range(y + 1):\n for k in range(z + 1):\n if check(i, j, k):\n ans = max(ans, 2 * (i + j) + k)\n return ans", "class Solution:\n def longestString(self, x: int, y: int, z: int) -> int:\n def check(aa, bb, ab):\n s = \"\"\n for i in range(aa):\n s += \"AA\"\n for i in range(bb):\n s += \"BB\"\n for i in range(ab):\n s += \"AB\"\n return s\n \n max_len = 0\n for i in range(x + 1):\n for j in range(y + 1):\n for k in range(z + 1):\n if \"AAA\" not in check(i, j, k) and \"BBB\" not in check(i, j, k):\n max_len = max(max_len, 2 * (i + j + k) + min(i, j) + min(i, k) + min(j, k))\n return max_len" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimizeConcatenatedLength(self, words: List[str]) -> int:\n def join(x, y):\n if x[-1] == y[0]:\n return x + y[1:]\n else:\n return x + y\n\n n = len(words)\n dp = [float('inf')] * n\n dp[0] = len(words[0])\n\n for i in range(1, n):\n for j in range(i):\n dp[i] = min(dp[i], len(words[i]) + dp[j] - (2 if words[i][0] == words[j][-1] else 0))\n dp[i] = min(dp[i], len(words[i]) + join(words[j], words[i])[1:])\n dp[i] = min(dp[i], len(join(words[i], words[j])) + dp[j] - (2 if words[i][-1] == words[j][-1] else 0))\n\n return dp[n - 1]", "class Solution:\n def minimizeConcatenatedLength(self, words: List[str]) -> int:\n def join(x, y):\n if x[-1] == y[0]:\n return x + y[1:]\n return x + y\n\n n = len(words)\n dp = [float('inf')] * n\n dp[0] = len(words[0])\n\n for i in range(1, n):\n for j in range(i):\n dp[i] = min(dp[i], dp[j] + len(words[i]) - (1 if words[j][-1] == words[i][0] else 0))\n dp[i] = min(dp[i], len(words[j]) + len(words[i]) - (1 if join(words[j], words[i]) == words[j] + words[i]))\n\n return dp[-1]", "class Solution:\n def minimizeConcatenatedLength(self, words: List[str]) -> int:\n n = len(words)\n dp = [float('inf')] * n\n dp[0] = len(words[0])\n\n for i in range(1, n):\n for j in range(i):\n first = words[i] + words[j]\n if words[i][0] == words[j][-1]:\n first = words[i] + words[j][:-1]\n second = words[j] + words[i]\n if words[j][-1] == words[i][0]:\n second = words[j] + words[i][1:]\n dp[i] = min(dp[i], len(first) + dp[j])\n dp[i] = min(dp[i], len(second) + dp[j])\n\n return dp[n - 1]", "class Solution:\n def minimizeConcatenatedLength(self, words: List[str]) -> int:\n n = len(words)\n dp = [float('inf')] * n\n dp[0] = len(words[0])\n\n for i in range(1, n):\n for j in range(i):\n first = words[i] + words[j]\n if words[i][0] == words[j][-1]:\n first = words[i] + words[j][:-1]\n second = words[j] + words[i]\n if words[j][-1] == words[i][0]:\n second = words[j] + words[i][1:]\n dp[i] = min(dp[i], dp[j] + len(first))\n dp[i] = min(dp[i], dp[j] + len(second))\n\n return dp[n - 1]", "class Solution:\n def minimizeConcatenatedLength(self, words: List[str]) -> int:\n n = len(words)\n dp = [float('inf')] * n\n\n dp[0] = len(words[0])\n\n for i in range(1, n):\n for j in range(i):\n first = words[i] + words[j]\n if first[-1] == words[j][0]:\n first = first[:-1]\n\n second = words[j] + words[i]\n if second[-1] == words[i][0]:\n second = second[:-1]\n\n dp[i] = min(dp[i], dp[j] + len(first))\n\n dp[i] = min(dp[i], len(words[i]) + dp[i - 1])\n\n return dp[n - 1]", "class Solution:\n def minimizeConcatenatedLength(self, words: List[str]) -> int:\n n = len(words)\n dp = [float('inf')] * n\n dp[0] = len(words[0])\n\n for i in range(1, n):\n for j in range(i):\n first = words[i] + words[j]\n if words[i][0] == words[j][-1]:\n first = words[i] + words[j][:-1]\n second = words[j] + words[i]\n if words[j][-1] == words[i][0]:\n second = words[j] + words[i][1:]\n dp[i] = min(dp[i], dp[j] + len(first), dp[j] + len(second))\n\n return dp[n - 1]", "class Solution:\n def minimizeConcatenatedLength(self, words: List[str]) -> int:\n n = len(words)\n dp = [float('inf')] * n\n dp[0] = len(words[0])\n\n for i in range(1, n):\n for j in range(i):\n first = words[i] + words[j]\n if words[i][0] == words[j][-1]:\n first = words[i] + words[j][:-1]\n second = words[j] + words[i]\n if words[j][-1] == words[i][0]:\n second = words[j] + words[i][1:]\n dp[i] = min(dp[i], dp[j] + len(first), dp[j] + len(second))\n\n return dp[n - 1]", "class Solution:\n def minimizeConcatenatedLength(self, words: List[str]) -> int:\n n = len(words)\n dp = [float('inf')] * n\n dp[0] = len(words[0])\n\n for i in range(1, n):\n for j in range(i):\n if words[i][0] == words[j][-1]:\n dp[i] = min(dp[i], dp[j] + len(words[i]) - 1)\n else:\n dp[i] = min(dp[i], dp[j] + len(words[i]))\n\n return dp[-1]", "class Solution:\n def minimizeConcatenatedLength(self, words: List[str]) -> int:\n def join(x, y):\n if x[-1] == y[0]:\n return x + y[1:]\n else:\n return x + y\n\n n = len(words)\n dp = [float('inf')] * n\n dp[0] = len(words[0])\n\n for i in range(1, n):\n for j in range(i):\n dp[i] = min(dp[i], dp[j] + len(words[i]) - (1 if words[j][-1] == words[i][0] else 0))\n dp[i] = min(dp[i], len(words[j]) + len(words[i]) - (1 if join(words[j], words[i]) == words[j] + words[i]))\n\n return dp[-1]", "class Solution:\n def minimizeConcatenatedLength(self, words: List[str]) -> int:\n n = len(words)\n dp = [float('inf')] * n\n dp[0] = len(words[0])\n\n for i in range(1, n):\n for j in range(i):\n if words[i][0] == words[j][-1]:\n dp[i] = min(dp[i], dp[j] + len(words[i]) - 1)\n else:\n dp[i] = min(dp[i], dp[j] + len(words[i]))\n\n return dp[n - 1]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumJumps(self, nums: List[int], target: int) -> int:\n n = len(nums)\n dp = [1] * n\n dj = [1] * n\n\n def helper(idx):\n if idx == n - 1:\n return 1\n mx, mx_j = 0, 0\n for j in range(idx + 1, n):\n if -target <= nums[j] - nums[idx] <= target:\n tmp = dj[j] + 1\n if tmp > mx:\n mx = tmp\n mx_j = j\n dp[idx] = mx\n dj[idx] = mx_j\n return mx\n\n if helper(0) == 0:\n return -1\n\n q = [0]\n while q:\n idx = q.pop()\n for j in range(idx + 1, n):\n if -target <= nums[j] - nums[idx] <= target:\n if dp[j] < dp[idx] + 1:\n dp[j] = dp[idx] + 1\n dj[j] = idx\n if j == n - 1:\n return dp[j] - 1\n q.append(j)\n return dp[n - 1] - 1", "class Solution:\n def maximumJumps(self, nums: List[int], target: int) -> int:\n n = len(nums)\n dp = [1] * n\n dj = [1] * n\n\n def helper(idx):\n if idx == n - 1:\n return 1\n mx, mx_j = 0, 0\n for j in range(idx + 1, n):\n if -target <= nums[j] - nums[idx] <= target:\n tmp = dj[j] + 1\n if tmp > mx:\n mx = tmp\n mx_j = j\n dp[idx] = mx\n dj[idx] = mx_j\n return mx\n\n if helper(0) == 0:\n return -1\n\n q = [0]\n while q:\n idx = q.pop(0)\n for i in range(idx + 1, n):\n if -target <= nums[i] - nums[idx] <= target:\n if dp[i] < dp[idx] + 1:\n dp[i] = dp[idx] + 1\n dj[i] = idx\n q.append(i)\n\n return dp[n - 1]", "class Solution:\n def maximumJumps(self, nums: List[int], target: int) -> int:\n n = len(nums)\n dp = [1] * n\n dj = [1] * n\n\n def helper(idx):\n if idx == n - 1:\n return 1\n mx, mx_j = 0, 0\n for j in range(idx + 1, n):\n if -target <= nums[j] - nums[idx] <= target:\n tmp = dj[j] + 1\n if tmp > mx:\n mx = tmp\n mx_j = j\n dp[idx] = mx\n dj[idx] = mx_j\n return mx\n\n if helper(0) == 0:\n return -1\n\n stk = [0]\n steps = 0\n while stk:\n steps += 1\n nxt = stk.pop()\n i = n - 1\n while i > nxt:\n i = dj[i]\n stk.append(i)\n\n return steps", "class Solution:\n def maximumJumps(self, nums: List[int], target: int) -> int:\n n = len(nums)\n dp = [1] * n\n dj = [1] * n\n\n def helper(index):\n if index == n - 1:\n return 1\n dp[index] = -1\n for j in range(index + 1, n):\n if -target <= nums[j] - nums[index] <= target:\n dj[j] = max(dj[j], dp[index] + 1)\n dp[j] = max(dp[j], dj[j])\n dp[index] = max(dp[index], max(dj[index + 1:]))\n return dp[index]\n\n return helper(0) if helper(0) != -1 else -1", "class Solution:\n def maximumJumps(self, nums: List[int], target: int) -> int:\n n = len(nums)\n dp = [1] * n\n dj = [1] * n\n\n def helper(idx):\n if idx == n - 1:\n return 1\n dp[idx] = -1\n for i in range(idx + 1, n):\n if -target <= nums[i] - nums[idx] <= target:\n dj[i] = max(dj[i], dj[idx] + 1)\n if dp[idx] == -1 or dp[i] < dj[i]:\n dp[i] = dj[i]\n if dp[i] == n - 1:\n break\n return dp[idx]\n\n helper(0)\n return dp[-1]", "class Solution:\n def maximumJumps(self, nums: List[int], target: int) -> int:\n n = len(nums)\n dp = [1] * n\n dj = [1] * n\n\n def helper(idx):\n if idx == n - 1:\n return 1\n mx = -1\n for j in range(idx + 1, n):\n if -target <= nums[j] - nums[idx] <= target:\n mx = max(mx, dj[j])\n dp[idx] = mx + 1 if mx != -1 else -1\n return mx + 1 if mx != -1 else -1\n\n for i in range(n - 2, -1, -1):\n mx = -1\n for j in range(i + 1, n):\n if -target <= nums[j] - nums[i] <= target:\n mx = max(mx, dp[j])\n dj[i] = mx\n\n return dp[0]", "class Solution:\n def maximumJumps(self, nums: List[int], target: int) -> int:\n n = len(nums)\n dp = [1] * n\n dj = [1] * n\n\n def helper(index):\n if index == n - 1:\n return 1\n dp[index] = -1\n for j in range(index + 1, n):\n if -target <= nums[j] - nums[index] <= target:\n dj[j] = max(dj[j], dj[index] + 1)\n if dp[j] == 0:\n dp[j] = helper(j)\n dp[index] = max(dp[index], dp[j])\n return dp[index]\n\n return helper(0)", "class Solution:\n def maximumJumps(self, nums: List[int], target: int) -> int:\n n = len(nums)\n dp = [1] * n\n dj = [1] * n\n\n def helper(idx):\n if idx == n - 1:\n return 1\n mx = -1\n for j in range(idx + 1, n):\n if -target <= nums[j] - nums[idx] <= target:\n mx = max(mx, dj[j])\n dp[idx] = mx + 1 if mx != -1 else mx\n return mx != -1\n\n for i in range(n - 2, -1, -1):\n if helper(i):\n dj[i] = max(dj[i], dj[i + 1] + 1)\n\n return dp[0] - 1", "class Solution:\n def maximumJumps(self, nums: List[int], target: int) -> int:\n n = len(nums)\n dp = [1] * n\n dj = [1] * n\n\n def helper(idx):\n if idx == n - 1:\n return 1\n mx = -1\n for j in range(idx + 1, n):\n if -target <= nums[j] - nums[idx] <= target:\n mx = max(mx, dj[j])\n dp[idx] = mx + 1 if mx != -1 else mx\n return dp[idx]\n\n for i in range(n - 2, -1, -1):\n for j in range(i + 1, n):\n if -target <= nums[j] - nums[i] <= target:\n dj[i] = max(dj[i], 1 + dj[j])\n\n return dp[0] if dp[0] != 0 else -1", "class Solution:\n def maximumJumps(self, nums: List[int], target: int) -> int:\n n = len(nums)\n dp = [-1] * n\n dp[0] = 0\n\n def helper(index):\n if index == n - 1:\n return 0\n max_jumps = -1\n for i in range(index + 1, n):\n if -target <= nums[i] - nums[index] <= target:\n if dp[i] == -1:\n dp[i] = helper(i)\n max_jumps = max(max_jumps, dp[i])\n return max_jumps + 1\n\n return helper(0)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countCompleteSubarrays(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = 0\n total_distinct = len(set(nums))\n distinct_count = Counter(nums[0])\n count += (total_distinct == len(distinct_count))\n\n for i in range(1, len(nums)):\n distinct_count[nums[i]] += 1\n total_distinct = min(total_distinct, len(distinct_count))\n count += (total_distinct == len(distinct_count))\n\n return count", "class Solution:\n def countCompleteSubarrays(self, nums: List[int]) -> int:\n from collections import Counter\n\n counter = Counter(nums)\n distinct_count = len(counter)\n total_subarrays = len(nums) * (len(nums) + 1) // 2\n complete_subarrays = 0\n\n for i in range(len(nums)):\n counter[nums[i]] -= 1\n if counter[nums[i]] == 0:\n distinct_count -= 1\n while distinct_count == len(counter):\n complete_subarrays += 1\n counter[nums[i + 1]] += 1\n if counter[nums[i + 1]] == 1:\n distinct_count += 1\n i += 1\n\n return complete_subarrays", "class Solution:\n def countCompleteSubarrays(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = 0\n total_distinct = len(set(nums))\n distinct_count = Counter(nums[0])\n count += (len(distinct_count) == total_distinct) * (len(nums) - 1)\n\n for i in range(1, len(nums)):\n distinct_count[nums[i]] += 1\n while len(distinct_count) > total_distinct:\n distinct_count[nums[i - 1]] -= 1\n if distinct_count[nums[i - 1]] == 0:\n del distinct_count[nums[i - 1]]\n count += len(distinct_count) == total_distinct\n\n return count", "class Solution:\n def countCompleteSubarrays(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = Counter(nums)\n unique_elements = len(count)\n total_subarrays = 0\n subarray_count = 0\n\n for i in range(len(nums)):\n count[nums[i]] -= 1\n if count[nums[i]] == 0:\n unique_elements -= 1\n while unique_elements == len(count):\n subarray_count += 1\n count[nums[i + 1]] += 1\n if count[nums[i + 1]] == 1:\n unique_elements += 1\n i += 1\n total_subarrays += subarray_count\n subarray_count = 0\n\n return total_subarrays", "class Solution:\n def countCompleteSubarrays(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = 0\n total_distinct = len(set(nums))\n distinct_count = Counter(nums[0])\n count += (total_distinct == len(distinct_count))\n for i in range(1, len(nums)):\n distinct_count[nums[i]] += 1\n while len(distinct_count) > total_distinct:\n distinct_count[nums[i - 1]] -= 1\n if distinct_count[nums[i - 1]] == 0:\n del distinct_count[nums[i - 1]]\n count += (total_distinct == len(distinct_count))\n return count", "class Solution:\n def countCompleteSubarrays(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = 0\n total_distinct = len(set(nums))\n distinct_count = Counter(nums[0])\n count += (len(distinct_count) == total_distinct) * (len(nums) - 1)\n\n for i in range(1, len(nums)):\n distinct_count[nums[i]] += 1\n while len(distinct_count) > total_distinct:\n distinct_count[nums[i - 1]] -= 1\n if distinct_count[nums[i - 1]] == 0:\n del distinct_count[nums[i - 1]]\n count += len(distinct_count) == total_distinct\n\n return count", "class Solution:\n def countCompleteSubarrays(self, nums: List[int]) -> int:\n from collections import Counter\n\n counter = Counter(nums)\n distinct_count = len(counter)\n total_subarrays = len(nums) * (len(nums) + 1) // 2\n count = 0\n\n for i in range(len(nums)):\n counter[nums[i]] -= 1\n if counter[nums[i]] >= 0:\n distinct_count -= 1\n while distinct_count < len(counter):\n counter[nums[i + 1]] += 1\n if counter[nums[i + 1]] > 0:\n distinct_count += 1\n i += 1\n count += total_subarrays - i - 1\n\n return count", "class Solution:\n def countCompleteSubarrays(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = 0\n total_distinct = len(set(nums))\n distinct_count = Counter(nums[0])\n count += (len(distinct_count) == total_distinct) * (len(nums) - 1)\n\n for i in range(1, len(nums)):\n distinct_count[nums[i]] += 1\n while len(distinct_count) > total_distinct:\n distinct_count[nums[i - 1]] -= 1\n if distinct_count[nums[i - 1]] == 0:\n del distinct_count[nums[i - 1]]\n count += len(distinct_count) == total_distinct\n\n return count", "class Solution:\n def countCompleteSubarrays(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = 0\n distinct_count = Counter(nums)\n distinct_elements = len(distinct_count)\n\n for i in range(len(nums)):\n j = i\n temp_dict = {}\n while j < len(nums):\n temp_dict[nums[j]] = temp_dict.get(nums[j], 0) + 1\n if len(temp_dict) == distinct_elements:\n count += 1\n j += 1\n\n return count", "class Solution:\n def countCompleteSubarrays(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = 0\n distinct_count = Counter(nums)\n distinct_elements = len(distinct_count)\n\n for i in range(len(nums)):\n distinct_count[nums[i]] -= 1\n if distinct_count[nums[i]] == 0:\n distinct_elements -= 1\n\n for j in range(i, len(nums)):\n distinct_count[nums[j]] += 1\n if distinct_count[nums[j]] == 1:\n distinct_elements += 1\n\n if distinct_elements == len(set(nums[:j+1])):\n count += 1\n\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, true, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def distanceTraveled(self, mainTank: int, additionalTank: int) -> int:\n total_distance = 0\n while mainTank > 0:\n total_distance += 50\n if additionalTank > 0:\n mainTank += additionalTank // 5\n additionalTank = additionalTank % 5\n else:\n mainTank -= 5\n return total_distance + (mainTank * 10)", "class Solution:\n def distanceTraveled(self, mainTank: int, additionalTank: int) -> int:\n total_distance = 0\n while mainTank > 0:\n total_distance += 50\n if additionalTank > 0:\n mainTank += additionalTank // 5\n additionalTank = additionalTank % 5\n else:\n mainTank -= 5\n return total_distance + (mainTank * 10)", "class Solution:\n def distanceTraveled(self, mainTank: int, additionalTank: int) -> int:\n total_distance = 0\n while mainTank > 0:\n total_distance += 50\n mainTank -= 5\n if mainTank > 0 and additionalTank > 0:\n mainTank += 1\n additionalTank -= 1\n return total_distance + (mainTank * 10)", "class Solution:\n def distanceTraveled(self, mainTank: int, additionalTank: int) -> int:\n total_distance = 0\n while mainTank > 0:\n total_distance += 5\n mainTank -= 5\n if mainTank > 0 and additionalTank > 0:\n mainTank += 1\n additionalTank -= 1\n return total_distance * 10", "class Solution:\n def distanceTraveled(self, mainTank: int, additionalTank: int) -> int:\n total_distance = 0\n while mainTank > 0:\n total_distance += 5\n mainTank -= 5\n if mainTank > 0 and additionalTank > 0:\n mainTank += 1\n additionalTank -= 1\n return total_distance * 10", "class Solution:\n def distanceTraveled(self, mainTank: int, additionalTank: int) -> int:\n total_distance = 0\n while mainTank > 0:\n total_distance += 50\n if additionalTank > 0:\n mainTank += additionalTank // 5\n additionalTank = additionalTank % 5\n else:\n mainTank -= 5\n return total_distance + (mainTank * 10)", "class Solution:\n def distanceTraveled(self, mainTank: int, additionalTank: int) -> int:\n total_distance = 0\n while mainTank > 0:\n total_distance += 5\n mainTank -= 5\n if mainTank > 0 and additionalTank > 0:\n mainTank += 1\n additionalTank -= 1\n return total_distance * 10", "class Solution:\n def distanceTraveled(self, mainTank: int, additionalTank: int) -> int:\n total_distance = 0\n while mainTank > 0:\n total_distance += 5\n mainTank -= 5\n if mainTank > 0 and additionalTank > 0:\n mainTank += 1\n additionalTank -= 1\n return total_distance * 10", "class Solution:\n def distanceTraveled(self, mainTank: int, additionalTank: int) -> int:\n total_distance = 0\n while mainTank > 0:\n total_distance += 5\n mainTank -= 5\n if mainTank > 0 and additionalTank > 0:\n mainTank += 1\n additionalTank -= 1\n return total_distance * 10", "class Solution:\n def distanceTraveled(self, mainTank: int, additionalTank: int) -> int:\n total_distance = 0\n while mainTank > 0:\n total_distance += 50\n if additionalTank > 0 and mainTank <= 4:\n mainTank = 5\n additionalTank -= 1\n else:\n mainTank -= 5\n return total_distance + mainTank * 10" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def longestAlternatingSubarray(self, nums: List[int], threshold: int) -> int:\n max_len = 0\n for i in range(len(nums)):\n if nums[i] % 2 == 0 and nums[i] <= threshold:\n for j in range(i, len(nums)):\n if nums[j] > threshold or nums[j] % 2 == nums[j - 1] % 2:\n break\n max_len = max(max_len, j - i + 1)\n return max_len", "class Solution:\n def longestAlternatingSubarray(self, nums: List[int], threshold: int) -> int:\n max_len = 0\n for i in range(len(nums)):\n if nums[i] % 2 == 0 and nums[i] <= threshold:\n for j in range(i, len(nums)):\n if nums[j] > threshold or nums[j] % 2 == nums[i] % 2:\n break\n if j + 1 == len(nums) or nums[j + 1] > threshold or nums[j + 1] % 2 == nums[j] % 2:\n max_len = max(max_len, j - i + 1)\n break\n return max_len", "class Solution:\n def longestAlternatingSubarray(self, nums: List[int], threshold: int) -> int:\n max_len = 0\n for i in range(len(nums)):\n if nums[i] % 2 == 0 and nums[i] <= threshold:\n for j in range(i, len(nums)):\n if nums[j] > threshold or nums[j] % 2 == nums[i] % 2:\n break\n if j + 1 == len(nums) or nums[j + 1] > threshold or nums[j + 1] % 2 == nums[j] % 2:\n max_len = max(max_len, j - i + 1)\n break\n return max_len", "class Solution:\n def longestAlternatingSubarray(self, nums: list[int], threshold: int) -> int:\n max_len = 0\n for i in range(len(nums)):\n if nums[i] % 2 == 0 and nums[i] <= threshold:\n for j in range(i, len(nums)):\n if nums[j] > threshold:\n break\n if j == len(nums) - 1 or nums[j] % 2 == nums[j + 1] % 2:\n max_len = max(max_len, j - i + 1)\n break\n return max_len", "class Solution:\n def longestAlternatingSubarray(self, nums: List[int], threshold: int) -> int:\n max_len = 0\n for i in range(len(nums)):\n if nums[i] % 2 == 0 and nums[i] <= threshold:\n for j in range(i, len(nums)):\n if nums[j] > threshold or nums[j] % 2 == nums[j - 1] % 2:\n break\n max_len = max(max_len, j - i + 1)\n return max_len", "class Solution:\n def longestAlternatingSubarray(self, nums: List[int], threshold: int) -> int:\n max_len = 0\n for i in range(len(nums)):\n if nums[i] % 2 == 0 and nums[i] <= threshold:\n for j in range(i, len(nums)):\n if nums[j] > threshold or nums[j] % 2 == nums[i] % 2:\n break\n if j + 1 == len(nums) or nums[j + 1] > threshold or nums[j + 1] % 2 == nums[j] % 2:\n max_len = max(max_len, j - i + 1)\n break\n return max_len", "class Solution:\n def longestAlternatingSubarray(self, nums: List[int], threshold: int) -> int:\n max_len = 0\n for i in range(len(nums)):\n if nums[i] % 2 == 0 and nums[i] <= threshold:\n for j in range(i, len(nums)):\n if nums[j] > threshold or nums[j] % 2 == nums[i] % 2:\n break\n if j + 1 < len(nums) and nums[j + 1] % 2 != nums[j] % 2 and nums[j + 1] <= threshold:\n max_len = max(max_len, j - i + 2)\n return max_len", "class Solution:\n def longestAlternatingSubarray(self, nums: List[int], threshold: int) -> int:\n max_len = 0\n for i in range(len(nums)):\n if nums[i] % 2 == 0 and nums[i] <= threshold:\n for j in range(i, len(nums)):\n if nums[j] > threshold or nums[j] % 2 == nums[j - 1] % 2:\n break\n max_len = max(max_len, j - i + 1)\n return max_len", "class Solution:\n def longestAlternatingSubarray(self, nums: List[int], threshold: int) -> int:\n max_len = 0\n for i in range(len(nums)):\n if nums[i] % 2 == 0 and nums[i] <= threshold:\n for j in range(i, len(nums)):\n if nums[j] > threshold or nums[j] % 2 == nums[i] % 2:\n break\n if j == len(nums) - 1 or nums[j + 1] > threshold or nums[j + 1] % 2 == nums[j] % 2:\n max_len = max(max_len, j - i + 1)\n break\n return max_len", "class Solution:\n def longestAlternatingSubarray(self, nums: List[int], threshold: int) -> int:\n max_len = 0\n for i in range(len(nums)):\n if nums[i] % 2 == 0 and nums[i] <= threshold:\n for j in range(i, len(nums)):\n if nums[j] > threshold or nums[j] % 2 == nums[j - 1] % 2:\n break\n max_len = max(max_len, j - i + 1)\n return max_len" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberOfGoodSubarraySplits(self, nums: List[int]) -> int:\n mod = 10**9 + 7\n ones = sum(nums)\n if ones == 0 or ones == len(nums):\n return 0\n dp = [0] * (ones + 1)\n dp[0] = 1\n prefix_zeros = 0\n for num in nums:\n if num == 1:\n dp[1:] = [sum(dp)] * (ones)\n ones -= 1\n else:\n prefix_zeros += 1\n dp[1:] = [e * prefix_zeros for e in dp[1:]]\n return sum(dp) % mod", "class Solution:\n def numberOfGoodSubarraySplits(self, nums: List[int]) -> int:\n mod = 10**9 + 7\n ones = sum(nums)\n if ones == 0 or ones == len(nums):\n return 0\n dp = [0] * (ones + 1)\n dp[0] = 1\n prefix_zeros = 0\n for num in nums:\n if num == 1:\n dp[1:] = [sum(dp)] * (ones - 1)\n dp[0] = prefix_zeros\n ones -= 1\n else:\n prefix_zeros += 1\n return sum(dp) % mod", "class Solution:\n def numberOfGoodSubarraySplits(self, nums: List[int]) -> int:\n mod = 10**9 + 7\n ones = sum(nums)\n if ones == 0 or ones == len(nums):\n return 0\n dp = [0] * (ones + 1)\n dp[0] = 1\n prefix_zeros = 0\n for num in nums:\n if num == 1:\n dp[1:] = [sum(dp)] * ones\n ones -= 1\n else:\n prefix_zeros += 1\n dp[1:] = [elem * prefix_zeros % mod for elem in dp]\n return sum(dp) % mod", "class Solution:\n def numberOfGoodSubarraySplits(self, nums: List[int]) -> int:\n mod = 10**9 + 7\n ones = sum(nums)\n if ones == 0 or ones == len(nums):\n return 0\n dp = [0] * (ones + 1)\n dp[0] = 1\n prefix_zeros = 0\n for num in nums:\n if num == 1:\n dp[1:] = [sum(dp)] * (ones - 1)\n dp[0] = 1\n ones -= 1\n else:\n prefix_zeros += 1\n dp[min(prefix_zeros, ones):] = [sum(dp)] * ones\n return sum(dp) % mod", "class Solution:\n def numberOfGoodSubarraySplits(self, nums: List[int]) -> int:\n mod = 10**9 + 7\n ones = sum(nums)\n if ones == 0 or ones == len(nums):\n return 0\n dp = [0] * (ones + 1)\n dp[0] = 1\n prefix_zeros = 0\n for num in nums:\n if num == 1:\n dp[1:] = [sum(dp)] * (ones)\n ones -= 1\n else:\n prefix_zeros += 1\n return sum(dp) % mod", "class Solution:\n def numberOfGoodSubarraySplits(self, nums: List[int]) -> int:\n mod = 10**9 + 7\n ones = sum(nums)\n if ones == 0 or ones == len(nums):\n return 0\n dp = [0] * (ones + 1)\n dp[0] = 1\n left_zeros = 0\n for num in nums:\n if num == 1:\n dp[left_zeros + 1] = (dp[left_zeros] + dp[left_zeros + 1]) % mod\n else:\n left_zeros += 1\n return sum(dp) % mod", "class Solution:\n def numberOfGoodSubarraySplits(self, nums: List[int]) -> int:\n mod = 10**9 + 7\n ones = sum(nums)\n if ones == 0 or ones > len(nums):\n return 0\n dp = [0] * (ones + 1)\n dp[0] = 1\n prefix_zeros = 0\n for num in nums:\n if num == 1:\n dp[1:] = [sum(dp[:i] + dp[i + 1:]) % mod for i in range(ones)]\n ones -= 1\n prefix_zeros = 0\n else:\n prefix_zeros += 1\n return dp[0]", "class Solution:\n def numberOfGoodSubarraySplits(self, nums: List[int]) -> int:\n mod = 10**9 + 7\n ones = sum(nums)\n if ones == 0 or ones == len(nums):\n return 0\n dp = [0] * (ones + 1)\n dp[0] = 1\n prefix_zeros = 0\n for num in nums:\n if num == 1:\n dp[1:] = [sum(dp)] * (ones)\n ones -= 1\n else:\n prefix_zeros += 1\n dp[1:] = [elem * prefix_zeros for elem in dp[1:]]\n return sum(dp) % mod", "class Solution:\n def numberOfGoodSubarraySplits(self, nums: List[int]) -> int:\n mod = 10**9 + 7\n ones = sum(nums)\n if ones == 0 or ones == len(nums):\n return 0\n dp = [0] * (ones + 1)\n dp[0] = 1\n prefix_zeros = 0\n for num in nums:\n if num == 1:\n dp[1:] = [sum(dp)] * ones\n ones -= 1\n else:\n prefix_zeros += 1\n dp[1:] = [x + y for x, y in zip(dp[1:], dp[:-1])]\n dp[0] = prefix_zeros % mod\n return sum(dp) % mod", "class Solution:\n def numberOfGoodSubarraySplits(self, nums: List[int]) -> int:\n mod = 10**9 + 7\n ones = sum(nums)\n if ones == 0 or ones > len(nums):\n return 0\n dp = [0] * (ones + 1)\n dp[0] = 1\n prefix_ones = 0\n for num in nums:\n if num == 1:\n prefix_ones += 1\n for i in range(prefix_ones, 0, -1):\n dp[i] += dp[i - 1]\n dp[i] %= mod\n return dp[prefix_ones] % mod" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def continuousSubarrays(self, nums: List[int]) -> int:\n count = 0\n n = len(nums)\n for i in range(n):\n j = i\n while j < n and abs(nums[i] - nums[j]) <= 2:\n j += 1\n count += (j - i) * (j - i - 1) // 2 + 1\n i = j - 1\n return count", "class Solution:\n def continuousSubarrays(self, nums: List[int]) -> int:\n count = 0\n n = len(nums)\n for i in range(n):\n j = i\n while j < n and abs(nums[i] - nums[j]) <= 2:\n j += 1\n count += (j - i) * (j - i - 1) // 2\n i = j - 1\n return count", "class Solution:\n def continuousSubarrays(self, nums: List[int]) -> int:\n count = 0\n n = len(nums)\n for i in range(n):\n j = i\n while j < n and abs(nums[i] - nums[j]) <= 2:\n j += 1\n count += (j - i) * (j - i - 1) // 2 + 1\n i = j - 1\n return count", "class Solution:\n def continuousSubarrays(self, nums: List[int]) -> int:\n count = 0\n n = len(nums)\n for i in range(n):\n j = i\n while j < n and abs(nums[i] - nums[j]) <= 2:\n j += 1\n count += (j - i) * (j - i - 1) // 2 + 1\n return count", "class Solution:\n def continuousSubarrays(self, nums: List[int]) -> int:\n count = 0\n n = len(nums)\n for i in range(n):\n j = i\n while j < n and abs(nums[i] - nums[j]) <= 2:\n j += 1\n count += (j - i) * (j - i - 1) // 2 + 1\n return count", "class Solution:\n def continuousSubarrays(self, nums: List[int]) -> int:\n count = 0\n n = len(nums)\n for i in range(n):\n j = i\n while j + 1 < n and abs(nums[j + 1] - nums[j]) <= 2:\n j += 1\n count += (j - i + 1) * (j - i + 2) // 2\n i = j\n return count", "class Solution:\n def continuousSubarrays(self, nums: List[int]) -> int:\n count = 0\n n = len(nums)\n for i in range(n):\n j = i\n while j + 1 < n and abs(nums[j + 1] - nums[j]) <= 2:\n j += 1\n count += (j - i + 1) * (j - i + 2) // 2\n i = j\n return count", "class Solution:\n def continuousSubarrays(self, nums: List[int]) -> int:\n count = 0\n n = len(nums)\n \n for i in range(n):\n j = i\n while j < n and abs(nums[i] - nums[j]) <= 2:\n j += 1\n count += (j - i) * (j - i + 1) // 2\n i = j - 1\n \n return count", "class Solution:\n def continuousSubarrays(self, nums: List[int]) -> int:\n count = 0\n n = len(nums)\n for i in range(n):\n j = i\n while j+1 < n and abs(nums[j+1] - nums[i]) <= 2:\n j += 1\n count += (j - i + 1) * (j - i + 2) // 2\n return count", "class Solution:\n def continuousSubarrays(self, nums: List[int]) -> int:\n count = 0\n n = len(nums)\n for i in range(n):\n j = i\n while j < n and abs(nums[i] - nums[j]) <= 2:\n j += 1\n count += (j - i) * (j - i - 1) // 2 + 1\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxNonDecreasingLength(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n dp = [0] * n\n dp1 = [0] * n\n dp2 = [0] * n\n\n for i in range(n):\n dp1[i] = dp1[i - 1] + 1 if i > 0 and nums1[i] >= nums1[i - 1] else 0\n dp2[i] = dp2[i - 1] + 1 if i > 0 and nums2[i] >= nums2[i - 1] else 0\n\n for i in range(n):\n dp[i] = max(dp[i - 1], dp1[i - 1], dp2[i - 1]) + 1 if i > 0 and nums1[i] >= nums2[i - 1] else max(dp1[i], dp2[i])\n\n return max(dp)", "class Solution:\n def maxNonDecreasingLength(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n dp = [0] * n\n dp1 = [0] * n\n dp2 = [0] * n\n\n for i in range(n):\n if i == 0:\n dp[i] = 1\n dp1[i] = 1\n dp2[i] = 1\n else:\n if nums1[i] >= nums1[i - 1] or nums1[i] >= nums2[i - 1]:\n dp[i] = dp1[i - 1] + 1\n if nums2[i] >= nums1[i - 1] or nums2[i] >= nums2[i - 1]:\n dp1[i] = dp[i - 1] + 1\n if nums2[i] >= nums2[i - 1]:\n dp2[i] = dp2[i - 1] + 1\n\n return max(dp[-1], dp1[-1], dp2[-1])", "class Solution:\n def maxNonDecreasingLength(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n dp = [0] * n\n dp1 = [0] * n\n dp2 = [0] * n\n\n for i in range(n):\n dp1[i] = dp1[i - 1] + 1 if i > 0 and nums1[i] >= nums1[i - 1] else 0\n dp2[i] = dp2[i - 1] + 1 if i > 0 and nums2[i] >= nums2[i - 1] else 0\n\n for i in range(n):\n if nums1[i] >= nums2[i]:\n dp[i] = max(dp1[i], dp[i - 1])\n else:\n dp[i] = max(dp2[i], dp[i - 1])\n\n return dp[-1]", "class Solution:\n def maxNonDecreasingLength(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n dp = [0] * n\n dp1 = [0] * n\n dp2 = [0] * n\n\n for i in range(n):\n dp1[i] = dp1[i - 1] + 1 if i > 0 and nums1[i] >= nums1[i - 1] else 0\n dp2[i] = dp2[i - 1] + 1 if i > 0 and nums2[i] >= nums2[i - 1] else 0\n\n for i in range(n):\n dp[i] = max(dp1[i], dp2[i])\n if i > 0 and nums1[i] >= nums2[i - 1]:\n dp[i] = max(dp[i], dp1[i - 1] + 1)\n if i > 0 and nums2[i] >= nums1[i - 1]:\n dp[i] = max(dp[i], dp2[i - 1] + 1)\n\n return max(dp)", "class Solution:\n def maxNonDecreasingLength(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n dp = [0] * n\n dp1 = [0] * n\n dp2 = [0] * n\n\n for i in range(n):\n dp1[i] = dp1[i - 1] + 1 if i > 0 and nums1[i] >= nums1[i - 1] else 0\n dp2[i] = dp2[i - 1] + 1 if i > 0 and nums2[i] >= nums2[i - 1] else 0\n\n for i in range(n):\n dp[i] = max(dp[i - 1], dp1[i - 1], dp2[i - 1]) + 1 if i > 0 and nums1[i] >= nums2[i - 1] else max(dp1[i], dp2[i])\n if nums2[i] >= nums1[i]:\n dp[i] = max(dp[i], max(dp[i - 1], dp1[i - 1], dp2[i - 1]) + 1)\n\n return max(dp)", "class Solution:\n def maxNonDecreasingLength(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n dp = [1] * n\n dp2 = [1] * n\n\n for i in range(1, n):\n if nums1[i] >= nums1[i - 1]:\n dp[i] = dp[i - 1] + 1\n if nums2[i] >= nums2[i - 1]:\n dp2[i] = dp2[i - 1] + 1\n\n for i in range(n):\n if nums1[i] >= nums2[i]:\n dp[i] = max(dp[i], dp2[i])\n elif nums1[i] < nums2[i]:\n dp2[i] = max(dp[i], dp2[i])\n\n return max(dp)", "class Solution:\n def maxNonDecreasingLength(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n dp = [0] * n\n dp1 = [1] * n\n dp2 = [1] * n\n\n for i in range(1, n):\n if nums1[i] >= nums1[i - 1]:\n dp1[i] += dp1[i - 1]\n if nums2[i] >= nums2[i - 1]:\n dp2[i] += dp2[i - 1]\n\n for i in range(n):\n if nums1[i] >= nums2[i]:\n dp[i] = max(dp1[i], dp[i - 1] + 1, dp2[i])\n else:\n dp[i] = max(dp1[i - 1], dp[i - 1], dp2[i])\n\n return dp[-1]", "class Solution:\n def maxNonDecreasingLength(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n dp = [0] * n\n dp1 = [0] * n\n dp2 = [0] * n\n\n for i in range(n):\n dp1[i] = dp1[i - 1] + 1 if i > 0 and nums1[i] >= nums1[i - 1] else 1\n dp2[i] = dp2[i - 1] + 1 if i > 0 and nums2[i] >= nums2[i - 1] else 1\n\n for i in range(n):\n if nums1[i] >= nums2[i]:\n dp[i] = max(dp1[i], dp[i - 1])\n else:\n dp[i] = max(dp2[i], dp[i - 1])\n\n return dp[-1]", "class Solution:\n def maxNonDecreasingLength(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n dp = [1] * n\n dp2 = [1] * n\n\n for i in range(1, n):\n if nums1[i] >= nums1[i - 1]:\n dp[i] = dp[i - 1] + 1\n if nums2[i] >= nums2[i - 1]:\n dp2[i] = dp2[i - 1] + 1\n\n ans = 0\n for i in range(n):\n ans = max(ans, dp[i] + dp2[i] - 1)\n\n return ans", "class Solution:\n def maxNonDecreasingLength(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n dp = [0] * n\n dp1 = [0] * n\n dp2 = [0] * n\n\n for i in range(n):\n dp1[i] = dp1[i - 1] + 1 if i > 0 and nums1[i] >= nums1[i - 1] else 1\n dp2[i] = dp2[i - 1] + 1 if i > 0 and nums2[i] >= nums2[i - 1] else 1\n\n for i in range(n):\n if nums1[i] >= nums2[i]:\n dp[i] = max(dp1[i], dp[i - 1])\n else:\n dp[i] = max(dp2[i], dp[i - 1])\n\n return dp[-1]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def alternatingSubarray(self, nums: List[int]) -> int:\n max_length = -1\n for i in range(len(nums) - 1):\n if abs(nums[i] - nums[i + 1]) == 1:\n max_length = max(max_length, 2)\n j = i + 2\n while j < len(nums) and abs(nums[j] - nums[j - 1]) == 1:\n max_length += 1\n j += 1\n return max_length if max_length != -1 else 0", "class Solution:\n def alternatingSubarray(self, nums: List[int]) -> int:\n max_length = -1\n for i in range(len(nums) - 1):\n if nums[i] + 1 == nums[i + 1]:\n current_length = 2\n for j in range(i + 2, len(nums)):\n if nums[j] == nums[i] and nums[j - 1] == nums[i] + 1:\n current_length += 1\n else:\n break\n max_length = max(max_length, current_length)\n return max_length if max_length > 0 else -1", "class Solution:\n def alternatingSubarray(self, nums: List[int]) -> int:\n max_length = -1\n for i in range(len(nums) - 1):\n if nums[i] + 1 == nums[i + 1]:\n current_length = 2\n for j in range(i + 2, len(nums)):\n if nums[j] != nums[j - 1] + 1:\n break\n current_length += 1\n max_length = max(max_length, current_length)\n return max_length if max_length > 0 else -1", "class Solution:\n def alternatingSubarray(self, nums: List[int]) -> int:\n max_length = -1\n current_length = 0\n prev_diff = None\n\n for i in range(1, len(nums)):\n diff = nums[i] - nums[i - 1]\n if diff == 1 or diff == -1:\n if prev_diff == diff:\n current_length += 1\n else:\n current_length = 2\n prev_diff = diff\n max_length = max(max_length, current_length)\n else:\n prev_diff = None\n current_length = 0\n\n return max_length if max_length != -1 else len(nums) - 1", "class Solution:\n def alternatingSubarray(self, nums: List[int]) -> int:\n max_length = -1\n for i in range(len(nums) - 1):\n if nums[i] + 1 == nums[i + 1]:\n current_length = 2\n for j in range(i + 2, len(nums)):\n if nums[j] != nums[j - 1] + 1:\n break\n current_length += 1\n max_length = max(max_length, current_length)\n return max_length if max_length > 0 else -1", "class Solution:\n def alternatingSubarray(self, nums: List[int]) -> int:\n max_length = -1\n for i in range(len(nums) - 1):\n if nums[i] + 1 == nums[i + 1]:\n current_length = 2\n for j in range(i + 2, len(nums)):\n if nums[j] != nums[j - 1] - 1:\n break\n current_length += 1\n max_length = max(max_length, current_length)\n return max_length if max_length > 0 else -1", "class Solution:\n def alternatingSubarray(self, nums: List[int]) -> int:\n max_length = -1\n for i in range(len(nums) - 1):\n if nums[i] + 1 == nums[i + 1]:\n current_length = 2\n for j in range(i + 2, len(nums)):\n if nums[j] == nums[i] and nums[j - 1] == nums[i] + 1:\n current_length += 1\n else:\n break\n max_length = max(max_length, current_length)\n return max_length if max_length > 0 else -1", "class Solution:\n def alternatingSubarray(self, nums: List[int]) -> int:\n max_length = -1\n for i in range(len(nums) - 1):\n if nums[i] + 1 == nums[i + 1]:\n current_length = 2\n for j in range(i + 2, len(nums)):\n if nums[j] == nums[i] + (j - i) % 2:\n current_length += 1\n else:\n break\n max_length = max(max_length, current_length)\n return max_length if max_length > 0 else -1", "class Solution:\n def alternatingSubarray(self, nums: List[int]) -> int:\n max_length = -1\n for i in range(len(nums) - 1):\n if nums[i] + 1 == nums[i + 1]:\n current_length = 2\n for j in range(i + 2, len(nums)):\n if nums[j] == nums[i] and nums[j - 1] == nums[i] + 1:\n current_length += 1\n else:\n break\n max_length = max(max_length, current_length)\n return max_length if max_length > 0 else -1", "class Solution:\n def alternatingSubarray(self, nums: List[int]) -> int:\n max_length = -1\n for i in range(len(nums) - 1):\n if nums[i] + 1 == nums[i + 1]:\n current_length = 2\n for j in range(i + 2, len(nums)):\n if nums[j] == nums[i] and nums[j - 1] == nums[i] + 1:\n current_length += 1\n else:\n break\n max_length = max(max_length, current_length)\n return max_length if max_length > 0 else -1" ], "pass1_list": [ false, false, false, false, false, false, false, true, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxArrayValue(self, nums: List[int]) -> int:\n max_val = 0\n result = 0\n for num in nums:\n max_val = max(max_val + num, num)\n result = max(result, max_val)\n return result", "class Solution:\n def maxArrayValue(self, nums: List[int]) -> int:\n max_val = 0\n for i in range(len(nums) - 1, -1, -1):\n if nums[i] > max_val:\n max_val = nums[i]\n nums[i] *= 2\n return max_val", "class Solution:\n def maxArrayValue(self, nums: List[int]) -> int:\n max_val = 0\n for i in range(len(nums) - 1, -1, -1):\n if nums[i] > max_val:\n max_val = nums[i]\n nums[i] *= 2\n return max_val", "class Solution:\n def maxArrayValue(self, nums: List[int]) -> int:\n max_val = 0\n for i in range(len(nums) - 1, -1, -1):\n if nums[i] > max_val:\n max_val = nums[i]\n nums[i] *= 2\n return max_val", "class Solution:\n def maxArrayValue(self, nums: List[int]) -> int:\n max_val = 0\n result = 0\n for num in nums:\n max_val = max(max_val + num, num)\n result = max(result, max_val)\n return result", "class Solution:\n def maxArrayValue(self, nums: List[int]) -> int:\n max_val = 0\n result = 0\n for num in nums:\n max_val = max(max_val + num, num)\n result = max(result, max_val)\n return result", "class Solution:\n def maxArrayValue(self, nums: List[int]) -> int:\n max_val = 0\n result = 0\n for num in nums:\n max_val = max(max_val + num, num)\n result = max(result, max_val)\n return result", "class Solution:\n def maxArrayValue(self, nums: List[int]) -> int:\n max_val = 0\n result = 0\n for num in nums:\n max_val = max(max_val + num, num)\n result = max(result, max_val)\n return result", "class Solution:\n def maxArrayValue(self, nums: List[int]) -> int:\n max_val = 0\n result = 0\n for num in nums:\n max_val = max(max_val + num, num)\n result = max(result, max_val)\n return result", "class Solution:\n def maxArrayValue(self, nums: List[int]) -> int:\n max_val = 0\n result = 0\n for num in nums:\n max_val = max(max_val + num, num)\n result = max(result, max_val)\n return result" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findPrimePairs(self, n: int) -> List[List[int]]:\n def is_prime(num: int) -> bool:\n if num < 2:\n return False\n for i in range(2, int(num**0.5) + 1):\n if num % i == 0:\n return False\n return True\n\n prime_pairs = []\n for x in range(1, n // 2 + 1):\n y = n - x\n if is_prime(x) and is_prime(y):\n prime_pairs.append([x, y])\n\n prime_pairs.sort(key=lambda x: x[0])\n return prime_pairs", "class Solution:\n def findPrimePairs(self, n: int) -> list[list[int]]:\n def is_prime(num: int) -> bool:\n if num < 2:\n return False\n for i in range(2, int(num**0.5) + 1):\n if num % i == 0:\n return False\n return True\n\n prime_pairs = []\n for x in range(1, n // 2 + 1):\n y = n - x\n if is_prime(x) and is_prime(y):\n prime_pairs.append([x, y])\n\n prime_pairs.sort()\n return prime_pairs", "class Solution:\n def findPrimePairs(self, n: int) -> List[List[int]]:\n def is_prime(num: int) -> bool:\n if num < 2:\n return False\n for i in range(2, int(num**0.5) + 1):\n if num % i == 0:\n return False\n return True\n\n prime_pairs = []\n for x in range(1, n // 2 + 1):\n y = n - x\n if is_prime(x) and is_prime(y):\n prime_pairs.append([x, y])\n\n prime_pairs.sort(key=lambda x: x[0])\n return prime_pairs", "class Solution:\n def findPrimePairs(self, n: int) -> List[List[int]]:\n def is_prime(num: int) -> bool:\n if num < 2:\n return False\n for i in range(2, int(num**0.5) + 1):\n if num % i == 0:\n return False\n return True\n\n prime_pairs = []\n for x in range(1, n // 2 + 1):\n y = n - x\n if is_prime(x) and is_prime(y):\n prime_pairs.append([x, y])\n\n return sorted(prime_pairs)", "class Solution:\n def findPrimePairs(self, n: int) -> List[List[int]]:\n def is_prime(num: int) -> bool:\n if num < 2:\n return False\n for i in range(2, int(num**0.5) + 1):\n if num % i == 0:\n return False\n return True\n\n prime_pairs = []\n for x in range(1, n // 2 + 1):\n y = n - x\n if is_prime(x) and is_prime(y):\n prime_pairs.append([x, y])\n\n prime_pairs.sort()\n return prime_pairs", "class Solution:\n def findPrimePairs(self, n: int) -> List[List[int]]:\n def is_prime(num: int) -> bool:\n if num <= 1:\n return False\n for i in range(2, int(num**0.5) + 1):\n if num % i == 0:\n return False\n return True\n\n prime_pairs = []\n for x in range(1, n // 2 + 1):\n y = n - x\n if is_prime(x) and is_prime(y):\n prime_pairs.append([x, y])\n\n prime_pairs.sort(key=lambda x: x[0])\n return prime_pairs", "class Solution:\n def findPrimePairs(self, n: int) -> List[List[int]]:\n def is_prime(num: int) -> bool:\n if num < 2:\n return False\n for i in range(2, int(num**0.5) + 1):\n if num % i == 0:\n return False\n return True\n\n prime_pairs = []\n for x in range(1, n // 2 + 1):\n y = n - x\n if is_prime(x) and is_prime(y):\n prime_pairs.append([x, y])\n\n return sorted(prime_pairs)", "class Solution:\n def findPrimePairs(self, n: int) -> List[List[int]]:\n def is_prime(num: int) -> bool:\n if num < 2:\n return False\n for i in range(2, int(num**0.5) + 1):\n if num % i == 0:\n return False\n return True\n\n prime_pairs = []\n for x in range(1, n // 2 + 1):\n y = n - x\n if is_prime(x) and is_prime(y):\n prime_pairs.append([x, y])\n\n return sorted(prime_pairs)", "class Solution:\n def findPrimePairs(self, n: int) -> List[List[int]]:\n def is_prime(num: int) -> bool:\n if num < 2:\n return False\n for i in range(2, int(num**0.5) + 1):\n if num % i == 0:\n return False\n return True\n\n prime_pairs = []\n for x in range(1, n // 2 + 1):\n y = n - x\n if is_prime(x) and is_prime(y):\n prime_pairs.append([x, y])\n\n prime_pairs.sort(key=lambda x: x[0])\n return prime_pairs", "class Solution:\n def findPrimePairs(self, n: int) -> List[List[int]]:\n def is_prime(num: int) -> bool:\n if num < 2:\n return False\n for i in range(2, int(num**0.5) + 1):\n if num % i == 0:\n return False\n return True\n\n pairs = []\n for x in range(1, n // 2 + 1):\n y = n - x\n if is_prime(x) and is_prime(y):\n pairs.append([x, y])\n\n return sorted(pairs)" ], "pass1_list": [ true, true, true, true, true, false, false, true, true, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberOfEmployeesWhoMetTarget(self, hours: list[int], target: int) -> int:\n count = 0\n for hour in hours:\n if hour >= target:\n count += 1\n return count", "class Solution:\n def numberOfEmployeesWhoMetTarget(self, hours: list[int], target: int) -> int:\n count = 0\n for hour in hours:\n if hour >= target:\n count += 1\n return count", "class Solution:\n def numberOfEmployeesWhoMetTarget(self, hours: list[int], target: int) -> int:\n count = 0\n for hour in hours:\n if hour >= target:\n count += 1\n return count", "class Solution:\n def numberOfEmployeesWhoMetTarget(self, hours: List[int], target: int) -> int:\n count = 0\n for hour in hours:\n if hour >= target:\n count += 1\n return count", "class Solution:\n def numberOfEmployeesWhoMetTarget(self, hours: list[int], target: int) -> int:\n count = 0\n for hour in hours:\n if hour >= target:\n count += 1\n return count", "class Solution:\n def numberOfEmployeesWhoMetTarget(self, hours: list[int], target: int) -> int:\n count = 0\n for hour in hours:\n if hour >= target:\n count += 1\n return count", "class Solution:\n def numberOfEmployeesWhoMetTarget(self, hours: list[int], target: int) -> int:\n count = 0\n for hour in hours:\n if hour >= target:\n count += 1\n return count", "class Solution:\n def numberOfEmployeesWhoMetTarget(self, hours: list[int], target: int) -> int:\n count = 0\n for hour in hours:\n if hour >= target:\n count += 1\n return count", "class Solution:\n def numberOfEmployeesWhoMetTarget(self, hours: list[int], target: int) -> int:\n count = 0\n for hour in hours:\n if hour >= target:\n count += 1\n return count", "class Solution:\n def numberOfEmployeesWhoMetTarget(self, hours: list[int], target: int) -> int:\n count = 0\n for hour in hours:\n if hour >= target:\n count += 1\n return count" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumString(self, a: str, b: str, c: str) -> str:\n def check(s, t):\n return all(x in s for x in t)\n\n def combine(s, t):\n if check(s, t):\n return s\n if check(t, s):\n return t\n for i in range(len(s)):\n if check(s[:i] + t + s[i:], t):\n return s[:i] + t + s[i:]\n for i in range(len(t)):\n if check(t[:i] + s + t[i:], s):\n return t[:i] + s + t[i:]\n return s + t\n\n ans = combine(a, b)\n ans = combine(ans, c)\n return ans", "class Solution:\n def minimumString(self, a: str, b: str, c: str) -> str:\n def check(s, t):\n return all(x in s for x in t)\n\n ans = a + b + c\n for i in range(1, len(a)):\n for j in range(1, len(b)):\n for k in range(1, len(c)):\n s = min(a[i:], b[j:], c[k:], key=len)\n if check(s, a) and check(s, b) and check(s, c):\n ans = min(ans, a[:i] + s + b[:j] + c[:k])\n return ans", "class Solution:\n def minimumString(self, a: str, b: str, c: str) -> str:\n def check(s, t):\n return all(x in s for x in (a, b, c)) and len(s) <= len(t) and (len(s) < len(t) or s < t)\n\n s = a + b + c\n for i in range(len(s)):\n for j in range(i + 1, len(s) + 1):\n t = s[i:j]\n if check(t, s):\n s = t\n return s", "class Solution:\n def minimumString(self, a: str, b: str, c: str) -> str:\n def check(s, a, b, c):\n return all(x in s for x in [a, b, c])\n \n min_len = len(a) + len(b) + len(c)\n ans = ''\n \n for i in range(1, min_len + 1):\n for s in itertools.combinations_with_replacement([a, b, c], i):\n candidate = ''.join(sorted(''.join(s)))\n if check(candidate, a, b, c):\n ans = candidate\n break\n if ans:\n break\n \n return ans", "class Solution:\n def minimumString(self, a: str, b: str, c: str) -> str:\n def check(s, a, b, c):\n return all(x in s for x in [a, b, c])\n \n min_len = max(len(a), len(b), len(c))\n for i in range(min_len, min_len + 11):\n for s in itertools.product(*([[x] * i for x in 'abc'][:3])):\n candidate = ''.join(s)\n if check(candidate, a, b, c):\n return candidate", "class Solution:\n def minimumString(self, a: str, b: str, c: str) -> str:\n def check(s, t):\n return all(x in s for x in [a, b, c]) and len(s) < len(t) or (\n len(s) == len(t) and s < t\n )\n\n ans = a + b + c\n for s in [a, b, c]:\n for t in [a, b, c]:\n if s != t:\n ans = min(ans, s + t, key=lambda x: (check(x, ans), x))\n return ans", "class Solution:\n def minimumString(self, a: str, b: str, c: str) -> str:\n def check(s, t):\n return all(x in s for x in t)\n\n def combine(s, t):\n if check(s, t):\n return s\n for i in range(len(t)):\n if check(s + t[i:], t):\n return s + t[i:]\n return s + t\n\n ans = combine(a, b)\n ans = combine(ans, c)\n return ans", "class Solution:\n def minimumString(self, a: str, b: str, c: str) -> str:\n def check(s, t):\n return all(x in s for x in t)\n\n def combine(s, t):\n if check(s, t):\n return s\n if check(t, s):\n return t\n for i in range(len(s)):\n if check(s[:i] + t + s[i:], t):\n return s[:i] + t + s[i:]\n for i in range(len(t)):\n if check(s + t[:i] + s + t[i:], t):\n return s + t[:i] + s + t[i:]\n return s + t\n\n ans = combine(a, b)\n ans = combine(ans, c)\n return ans", "class Solution:\n def minimumString(self, a: str, b: str, c: str) -> str:\n def check(s, t):\n return all(x in s for x in [a, b, c]) and len(s) == len(t)\n\n def combine(s, t):\n for i in range(len(s)):\n for j in range(len(t)):\n yield s[:i] + t[j:]\n\n def helper(s, t):\n if check(s, t):\n return s\n for u in helper(s + a, t + \"a\"):\n yield u\n for u in helper(s + b, t + \"b\"):\n yield u\n for u in helper(s + c, t + \"c\"):\n yield u\n\n ans = \"\"\n for s in helper(ans, ans):\n if not ans or len(s) < len(ans) or (len(s) == len(ans) and s < ans):\n ans = s\n return ans", "class Solution:\n def minimumString(self, a: str, b: str, c: str) -> str:\n def check(s, t):\n return all(x in s for x in t)\n\n def combine(s, t):\n if check(s, t):\n return s\n if check(t, s):\n return t\n for i in range(len(s)):\n if check(s[:i] + t + s[i:], t):\n return s[:i] + t + s[i:]\n for i in range(len(t)):\n if check(t[:i] + s + t[i:], s):\n return t[:i] + s + t[i:]\n return s + t\n\n ans = combine(a, b)\n ans = combine(ans, c)\n return ans" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def checkArray(self, nums: List[int], k: int) -> bool:\n max_val = max(nums)\n if max_val == 0:\n return True\n if k == 1:\n return False\n diff = max_val % (k - 1)\n return diff == 0", "class Solution:\n def checkArray(self, nums: List[int], k: int) -> bool:\n max_val = max(nums)\n return max_val == 0 or (max_val - 1) % k == 0", "class Solution:\n def checkArray(self, nums: List[int], k: int) -> bool:\n max_val = max(nums)\n return max_val == 0 or max_val - 1 < k // 2", "class Solution:\n def checkArray(self, nums: List[int], k: int) -> bool:\n max_val = max(nums)\n return max_val == 0 or max_val - min(nums) < k\r", "class Solution:\n def checkArray(self, nums: List[int], k: int) -> bool:\n max_val = max(nums)\n return max_val == 0 or max_val - 1 < k // 2", "class Solution:\n def checkArray(self, nums: List[int], k: int) -> bool:\n max_val = max(nums)\n return max_val == 0 or max_val - min(nums) < k\r", "class Solution:\n def checkArray(self, nums: List[int], k: int) -> bool:\n max_val = max(nums)\n return max_val == 0 or max_val - min(nums) < k\r", "class Solution:\n def checkArray(self, nums: List[int], k: int) -> bool:\n max_val = max(nums)\n if max_val == 0:\n return True\n operations_needed = nums.count(max_val)\n return operations_needed <= max_val and max_val % k == 0", "class Solution:\n def checkArray(self, nums: List[int], k: int) -> bool:\n max_val = max(nums)\n if max_val == 0:\n return True\n if k == 1:\n return False\n diff = max_val % k\n return diff == 0", "class Solution:\n def checkArray(self, nums: List[int], k: int) -> bool:\n max_val = max(nums)\n return max_val == 0 or max_val - 1 < k or k == 1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumChanges(self, s: str, k: int) -> int:\n n = len(s)\n dp = [[float('inf')] * (k + 1) for _ in range(n + 1)]\n dp[0][0] = 0\n\n for i in range(n):\n for j in range(k):\n dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + self.count_diff(s[i - j:i + 1]))\n\n return dp[n][k]\n\n def count_diff(self, s: str) -> int:\n return sum(a != b for a, b in zip(s, reversed(s)))", "class Solution:\n def minimumChanges(self, s: str, k: int) -> int:\n def is_semi_palindrome(s: str) -> bool:\n n = len(s)\n for d in range(1, n // 2 + 1):\n if n % d == 0:\n i, j = 0, d\n while j < n:\n if s[i] != s[j]:\n break\n i += 1\n j += 1\n if j == n:\n return True\n return False\n\n def count_letter_changes(s: str, k: int) -> int:\n n = len(s)\n dp = [[0] * (k + 1) for _ in range(n + 1)]\n for i in range(1, n + 1):\n for j in range(1, min(i, k) + 1):\n dp[i][j] = min(dp[i - 1][j] + (j == 1), dp[i - 1][j - 1] + (not is_semi_palindrome(s[i - j:i])))\n return dp[n][k]\n\n return count_letter_changes(s, k)", "class Solution:\n def minimumChanges(self, s: str, k: int) -> int:\n def is_semi_palindrome(sub_s: str) -> bool:\n n = len(sub_s)\n for d in range(1, n // 2 + 1):\n if n % d == 0:\n i, j = 0, d\n while j < n:\n if sub_s[i] != sub_s[j]:\n break\n i += 1\n j += 1\n if j == n:\n return True\n return False\n\n def count_letter_changes(sub_s: str) -> int:\n n = len(sub_s)\n for d in range(1, n // 2 + 1):\n if n % d == 0:\n count = 0\n i, j = 0, d\n while j < n:\n if sub_s[i] != sub_s[j]:\n count += 1\n i += 1\n j += 1\n if j == n:\n return count\n return n\n\n def solve(i: int, changes: int) -> int:\n if i == k:\n return changes\n min_changes = float(\"inf\")\n for j in range(i, k):\n sub_s = s[i * (len(s) // k) : j * (len(s) // k)]\n min_changes = min(min_changes, solve(j, changes + count_letter_changes(sub_s)))\n return min_changes\n\n return solve(1, 0)", "class Solution:\n def minimumChanges(self, s: str, k: int) -> int:\n def is_semi_palindrome(sub_s: str) -> bool:\n n = len(sub_s)\n for d in range(1, n // 2 + 1):\n if n % d == 0:\n i, j = 0, d\n while j < n:\n if sub_s[i] != sub_s[j]:\n break\n i += 1\n j += 1\n if j == n:\n return True\n return False\n\n def count_letter_changes(sub_s: str) -> int:\n n = len(sub_s)\n for d in range(1, n // 2 + 1):\n if n % d == 0:\n count = 0\n i, j = 0, d\n while j < n:\n if sub_s[i] != sub_s[j]:\n count += 1\n i += 1\n j += 1\n if j == n:\n return count\n return float('inf')\n\n def backtrack(index: int, count: int, k: int, substrings: list[str]):\n if k == len(substrings):\n return count\n for length in range(1, len(s) - index + 1):\n sub_s = s[index : index + length]\n if is_semi_palindrome(sub_s):\n substrings.append(sub_s)\n new_count = backtrack(index + length, count, k, substrings)\n substrings.pop()\n if new_count + count_letter_changes(sub_s) < count:\n count = new_count + count_letter_changes(sub_s)\n if count < 0:\n break\n return count\n\n return backtrack(0, 0, k, [])", "class Solution:\n def minimumChanges(self, s: str, k: int) -> int:\n def is_semi_palindrome(s: str) -> bool:\n n = len(s)\n for d in range(1, n // 2 + 1):\n if n % d == 0:\n i, j = 0, d\n while j < n:\n if s[i] != s[j]:\n break\n i += 1\n j += 1\n if j == n:\n return True\n return False\n\n def count_letter_changes(s: str, d: int) -> int:\n n = len(s)\n count = 0\n for i in range(d):\n for j in range(i, n, d):\n if s[j] != s[i]:\n count += 1\n return count\n\n def solve(s: str, k: int, n: int) -> int:\n if k == 1:\n return 0 if is_semi_palindrome(s) else n\n min_changes = float('inf')\n for i in range(k):\n prefix_len = n // (k - i)\n suffix_len = n - prefix_len\n prefix = s[:prefix_len]\n suffix = s[prefix_len:]\n min_changes_prefix = solve(prefix, i + 1, prefix_len) + count_letter_changes(prefix, prefix_len // (i + 1))\n min_changes_suffix = solve(suffix, k - i, suffix_len) + count_letter_changes(suffix, suffix_len // (k - i))\n min_changes = min(min_changes, min_changes_prefix + min_changes_suffix)\n return min_changes\n\n n = len(s)\n return solve(s, k, n)", "class Solution:\n def minimumChanges(self, s: str, k: int) -> int:\n n = len(s)\n dp = [[float('inf')] * (k + 1) for _ in range(n + 1)]\n dp[0][0] = 0\n\n for i in range(n):\n for j in range(k):\n for d in range(1, n // (j + 1) + 1):\n if (i + 1) % d == 0:\n cost = sum(a != b for a, b in zip(s[i - d + 1:i + 1], s[i - d + 1:i:-1]))\n dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i - d + 1][j] + cost)\n\n return dp[n][k]", "class Solution:\n def minimumChanges(self, s: str, k: int) -> int:\n def is_semi_palindrome(s: str) -> bool:\n n = len(s)\n for d in range(1, n // 2 + 1):\n if n % d == 0:\n i, j = 0, d\n while j < n:\n if s[i] != s[j]:\n break\n i += 1\n j += 1\n if j == n:\n return True\n return False\n\n def count_letter_changes(s: str, k: int) -> int:\n n = len(s)\n dp = [[0] * (k + 1) for _ in range(n + 1)]\n for i in range(1, n + 1):\n for j in range(1, min(i, k) + 1):\n dp[i][j] = min(dp[i - 1][j] + 1, dp[i - 1][j - 1] + is_semi_palindrome(s[i - j:i]) * (j - 1))\n return dp[n][k]\n\n return count_letter_changes(s, k)", "class Solution:\n def minimumChanges(self, s: str, k: int) -> int:\n def is_semi_palindrome(s: str) -> bool:\n n = len(s)\n for d in range(1, n // 2 + 1):\n if n % d == 0:\n i, j = 0, d\n while j < n:\n if s[i] != s[j]:\n break\n i += 1\n j += 1\n if j == n:\n return True\n return False\n\n def count_letter_changes(s: str, k: int) -> int:\n n = len(s)\n dp = [[0] * (k + 1) for _ in range(n + 1)]\n for i in range(1, n + 1):\n for j in range(1, min(i, k) + 1):\n dp[i][j] = min(dp[i - 1][j] + 1, dp[i - 1][j - 1] + is_semi_palindrome(s[i - j:i]))\n return dp[n][k]\n\n return count_letter_changes(s, k)", "class Solution:\n def minimumChanges(self, s: str, k: int) -> int:\n def is_semi_palindrome(sub_s: str) -> bool:\n n = len(sub_s)\n for d in range(1, n // 2 + 1):\n if n % d == 0:\n i, j = 0, d\n while j < n:\n if sub_s[i] != sub_s[j]:\n break\n i += 1\n j += 1\n if j == n:\n return True\n return False\n\n def count_letter_changes(sub_s: str) -> int:\n n = len(sub_s)\n for d in range(1, n // 2 + 1):\n if n % d == 0:\n count = 0\n i, j = 0, d\n while j < n:\n if sub_s[i] != sub_s[j]:\n count += 1\n i += 1\n j += 1\n if j == n:\n return count\n return n\n\n def solve(i: int, changes: int) -> int:\n if i == len(s):\n return 0 if changes == 0 else float('inf')\n min_changes = float('inf')\n for j in range(i, len(s) - k + i + 1):\n sub_s = s[i:j+1]\n if is_semi_palindrome(sub_s):\n min_changes = min(min_changes, solve(j + 1, changes))\n else:\n min_changes = min(min_changes, solve(j + 1, changes + count_letter_changes(sub_s)))\n return min_changes\n\n return solve(0, 0)", "class Solution:\n def minimumChanges(self, s: str, k: int) -> int:\n n = len(s)\n dp = [[float('inf')] * (k + 1) for _ in range(n + 1)]\n dp[0][0] = 0\n\n for i in range(n):\n for j in range(k):\n dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + self.count_diff(s[i:], j + 1))\n\n return dp[n][k]\n\n def count_diff(self, s: str, d: int) -> int:\n n = len(s)\n count = 0\n for i in range(d):\n for j in range(i, n, d):\n if s[i] != s[j]:\n count += 1\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def splitWordsBySeparator(self, words: List[str], separator: str) -> List[str]:\n result = []\n for word in words:\n subwords = word.split(separator)\n result.extend([s for s in subwords if s != ''])\n return result", "class Solution:\n def splitWordsBySeparator(self, words: List[str], separator: str) -> List[str]:\n result = []\n for word in words:\n subwords = word.split(separator)\n result.extend([s for s in subwords if s != ''])\n return result", "class Solution:\n def splitWordsBySeparator(self, words: List[str], separator: str) -> List[str]:\n result = []\n for word in words:\n subwords = word.split(separator)\n result.extend([s for s in subwords if s])\n return result", "class Solution:\n def splitWordsBySeparator(self, words: List[str], separator: str) -> List[str]:\n result = []\n for word in words:\n subwords = word.split(separator)\n result.extend([s for s in subwords if s != ''])\n return result", "class Solution:\n def splitWordsBySeparator(self, words: List[str], separator: str) -> List[str]:\n result = []\n for word in words:\n subwords = word.split(separator)\n result.extend([s for s in subwords if s != ''])\n return result", "class Solution:\n def splitWordsBySeparator(self, words: List[str], separator: str) -> List[str]:\n result = []\n for word in words:\n subwords = word.split(separator)\n result.extend([s for s in subwords if s != ''])\n return result", "class Solution:\n def splitWordsBySeparator(self, words: List[str], separator: str) -> List[str]:\n result = []\n for word in words:\n subwords = word.split(separator)\n result.extend([s for s in subwords if s])\n return result", "class Solution:\n def splitWordsBySeparator(self, words: List[str], separator: str) -> List[str]:\n result = []\n for word in words:\n subwords = word.split(separator)\n result.extend([s for s in subwords if s != ''])\n return result", "class Solution:\n def splitWordsBySeparator(self, words: List[str], separator: str) -> List[str]:\n result = []\n for word in words:\n subwords = word.split(separator)\n result.extend([s for s in subwords if s != ''])\n return result", "class Solution:\n def splitWordsBySeparator(self, words: List[str], separator: str) -> List[str]:\n result = []\n for word in words:\n subwords = word.split(separator)\n result.extend([s for s in subwords if s != ''])\n return result" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberOfWays(self, n: int, x: int) -> int:\n dp = [0] * (n + 1)\n dp[0] = 1\n mod = 10**9 + 7\n for i in range(1, n + 1):\n for j in range(1, i + 1):\n if i - j ** x >= 0:\n dp[i] += dp[i - j ** x]\n dp[i] %= mod\n return dp[n]", "class Solution:\n def numberOfWays(self, n: int, x: int) -> int:\n dp = [0] * (n + 1)\n dp[0] = 1\n MOD = 10**9 + 7\n for i in range(1, n + 1):\n for j in range(1, i + 1):\n if i - j ** x >= 0:\n dp[i] = (dp[i] + dp[i - j ** x]) % MOD\n return dp[n]", "class Solution:\n def numberOfWays(self, n: int, x: int) -> int:\n dp = [0] * (n + 1)\n dp[0] = 1\n MOD = 10**9 + 7\n for i in range(1, n + 1):\n for j in range(1, i + 1):\n if i - j ** x >= 0:\n dp[i] = (dp[i] + dp[i - j ** x]) % MOD\n return dp[n]", "class Solution:\n def numberOfWays(self, n: int, x: int) -> int:\n dp = [0] * (n + 1)\n dp[0] = 1\n MOD = 10**9 + 7\n for i in range(1, n + 1):\n for j in range(1, i + 1):\n if i - j ** x >= 0:\n dp[i] = (dp[i] + dp[i - j ** x]) % MOD\n return dp[n]", "class Solution:\n def numberOfWays(self, n: int, x: int) -> int:\n dp = [0] * (n + 1)\n dp[0] = 1\n MOD = 10**9 + 7\n for i in range(1, n + 1):\n for j in range(1, i + 1):\n if i - j ** x >= 0:\n dp[i] = (dp[i] + dp[i - j ** x]) % MOD\n return dp[n]", "class Solution:\n def numberOfWays(self, n: int, x: int) -> int:\n dp = [0] * (n + 1)\n dp[0] = 1\n MOD = 10**9 + 7\n for i in range(1, n + 1):\n for j in range(1, i + 1):\n if i - j ** x >= 0:\n dp[i] = (dp[i] + dp[i - j ** x]) % MOD\n return dp[n]", "class Solution:\n def numberOfWays(self, n: int, x: int) -> int:\n dp = [0] * (n + 1)\n dp[0] = 1\n mod = 10**9 + 7\n for i in range(1, n + 1):\n for j in range(1, i + 1):\n if i - j**x >= 0:\n dp[i] = (dp[i] + dp[i - j**x]) % mod\n return dp[n]", "class Solution:\n def numberOfWays(self, n: int, x: int) -> int:\n dp = [0] * (n + 1)\n dp[0] = 1\n MOD = 10**9 + 7\n for i in range(1, n + 1):\n for j in range(1, i + 1):\n if i - j ** x >= 0:\n dp[i] = (dp[i] + dp[i - j ** x]) % MOD\n return dp[n]", "class Solution:\n def numberOfWays(self, n: int, x: int) -> int:\n dp = [0] * (n + 1)\n dp[0] = 1\n MOD = 10**9 + 7\n for i in range(1, n + 1):\n for j in range(1, i + 1):\n if i - j ** x >= 0:\n dp[i] += dp[i - j ** x]\n dp[i] %= MOD\n return dp[n]", "class Solution:\n def numberOfWays(self, n: int, x: int) -> int:\n dp = [0] * (n + 1)\n dp[0] = 1\n MOD = 10**9 + 7\n for i in range(1, n + 1):\n for j in range(1, i + 1):\n if i - j ** x >= 0:\n dp[i] = (dp[i] + dp[i - j ** x]) % MOD\n return dp[n]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumBeautifulSubstrings(self, s: str) -> int:\n def is_beautiful(sub):\n if sub[0] == '0':\n return False\n val = int(sub, 2)\n return val > 0 and (val & (val - 1)) == 0\n\n power_of_5 = [1, 5, 25, 125, 625]\n power_of_5_bin = [bin(p)[2:].zfill(4) for p in power_of_5]\n\n dp = [float('inf')] * (1 << 4)\n dp[0] = 0\n\n for c in s:\n new_dp = [float('inf')] * (1 << 4)\n for mask in range(1 << 4):\n if dp[mask] != float('inf'):\n new_dp[mask] = dp[mask] + 1\n for i in range(5):\n next_mask = mask | (1 << i)\n next_sub = power_of_5_bin[i] + c\n if is_beautiful(next_sub):\n new_dp[next_mask] = min(new_dp[next_mask], dp[mask])\n dp = new_dp\n\n return min(dp[(1 << 4) - 1], 4) if dp[(1 << 4) - 1] != float('inf') else -1", "class Solution:\n def minimumBeautifulSubstrings(self, s: str) -> int:\n def is_beautiful(sub):\n if sub[0] == '0':\n return False\n num = int(sub, 2)\n return num % 5 == 0 and num > 0\n\n power_of_5 = [1, 5, 25, 125, 625]\n power_of_5_bin = [bin(p)[2:].zfill(len(s)) for p in power_of_5]\n\n dp = [float('inf')] * (len(s) + 1)\n dp[0] = 0\n\n for i in range(len(s)):\n for j in range(i + 1):\n sub = s[j:i + 1]\n if is_beautiful(sub):\n dp[i + 1] = min(dp[i + 1], dp[j] + 1)\n for p in power_of_5_bin:\n if sub.endswith(p):\n dp[i + 1] = min(dp[i + 1], dp[j + len(p)] + 1)\n\n return dp[len(s)] if dp[len(s)] != float('inf') else -1", "class Solution:\n def minimumBeautifulSubstrings(self, s: str) -> int:\n def is_beautiful(sub):\n if sub[0] == '0':\n return False\n num = int(sub, 2)\n return num > 0 and (num & (num - 1)) == 0\n\n power_of_5 = [1, 5, 25, 125, 625]\n power_of_5_bin = [bin(p)[2:].zfill(len(s)) for p in power_of_5]\n\n dp = [float('inf')] * (len(s) + 1)\n dp[0] = 0\n\n for i in range(len(s)):\n for j in range(i + 1):\n if is_beautiful(s[j:i + 1]):\n dp[i + 1] = min(dp[i + 1], dp[j] + 1)\n elif s[j:i + 1] in power_of_5_bin:\n dp[i + 1] = min(dp[i + 1], dp[j])\n\n return -1 if dp[-1] == float('inf') else dp[-1]", "class Solution:\n def minimumBeautifulSubstrings(self, s: str) -> int:\n powers_of_5 = [1, 5, 25, 125, 625]\n if s[0] == '0':\n return -1\n\n count = 0\n for power in powers_of_5:\n if len(s) >= len(bin(power)[2:]) and s[:len(bin(power)[2:])] == bin(power)[2:]:\n count += 1\n s = s[len(bin(power)[2:]):]\n\n return count if s == '' else -1", "class Solution:\n def minimumBeautifulSubstrings(self, s: str) -> int:\n def is_beautiful(sub):\n if sub[0] == '0':\n return False\n num = int(sub, 2)\n return num != 0 and (num & (num - 1)) == 0\n\n power_of_5 = [1, 5, 25, 125, 625]\n beautiful_sub = []\n count = 0\n\n for i in range(len(s)):\n for j in range(i, len(s)):\n sub = s[i:j+1]\n if is_beautiful(sub):\n beautiful_sub.append(sub)\n\n if not beautiful_sub:\n return -1\n\n ans = float('inf')\n n = len(beautiful_sub)\n for i in range(n):\n curr = 1\n for j in range(i, n):\n if int(beautiful_sub[j], 2) in power_of_5:\n curr += 1\n ans = min(ans, curr)\n\n return ans if ans != float('inf') else -1", "class Solution:\n def minimumBeautifulSubstrings(self, s: str) -> int:\n def is_beautiful(sub):\n if sub[0] == '0':\n return False\n num = int(sub, 2)\n return num % (5 ** (len(sub) - 1)) == 0\n\n power_of_5 = [1]\n for _ in range(len(s)):\n power_of_5.append(power_of_5[-1] * 5)\n\n dp = [float('inf')] * (len(s) + 1)\n dp[0] = 0\n for i in range(len(s)):\n for j in range(i, -1, -1):\n if is_beautiful(s[j:i+1]):\n dp[i+1] = min(dp[i+1], dp[j] + 1)\n\n return dp[-1] if dp[-1] != float('inf') else -1", "class Solution:\n def minimumBeautifulSubstrings(self, s: str) -> int:\n def is_beautiful(sub):\n if sub[0] == '0':\n return False\n num = int(sub, 2)\n return num % 5 == 0 and num > 0\n\n power_of_5 = [1, 5, 25, 125, 625]\n power_of_5_bin = [\"1\", \"101\", \"11111\", \"102101\", \"11111111111\"]\n\n if not any(s.startswith(p) for p in power_of_5_bin):\n return -1\n\n ans = 0\n for power in power_of_5_bin:\n while s.startswith(power):\n ans += 1\n s = s[len(power):]\n\n return ans", "class Solution:\n def minimumBeautifulSubstrings(self, s: str) -> int:\n def is_beautiful(sub):\n if sub[0] == '0':\n return False\n num = int(sub, 2)\n return num and (num & (num - 1)) == 0\n\n power_of_5 = [1, 5, 25, 125, 625]\n beautiful_substrings = [sub for sub in s if is_beautiful(sub)]\n if not beautiful_substrings:\n return -1\n\n dp = [float('inf')] * (len(beautiful_substrings) + 1)\n dp[0] = 0\n for i in range(len(beautiful_substrings)):\n for j in range(i, -1, -1):\n if int(beautiful_substrings[i], 2) in power_of_5:\n dp[i + 1] = min(dp[i + 1], dp[j] + 1)\n return dp[-1]", "class Solution:\n def minimumBeautifulSubstrings(self, s: str) -> int:\n def is_beautiful(sub):\n if sub[0] == '0':\n return False\n num = int(sub, 2)\n return num and (num & (num - 1)) == 0\n\n power_of_5 = [1, 5, 25, 125, 625]\n power_of_5_bin = [bin(i)[2:] for i in power_of_5]\n\n n = len(s)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(1, n + 1):\n for j in range(i, n + 1):\n sub = s[i - 1:j]\n if sub in power_of_5_bin:\n dp[j] = min(dp[j], 1 + dp[i - 1])\n else:\n for k in range(i, j):\n left = s[i - 1:k]\n right = s[k:j]\n if left in power_of_5_bin and is_beautiful(right):\n dp[j] = min(dp[j], 1 + dp[i - 1] + dp[k])\n\n return -1 if dp[-1] == float('inf') else dp[-1]", "class Solution:\n def minimumBeautifulSubstrings(self, s: str) -> int:\n def is_beautiful(sub):\n if sub[0] == '0':\n return False\n num = int(sub, 2)\n return num and (num & (num - 1)) == 0\n\n power_of_5 = [1, 5, 25, 125, 625]\n beautiful_substrings = [sub for sub in s if is_beautiful(sub)]\n\n if not beautiful_substrings:\n return -1\n\n dp = [float('inf')] * (len(beautiful_substrings) + 1)\n dp[0] = 0\n for i in range(len(beautiful_substrings)):\n for j in range(i, -1, -1):\n if int(beautiful_substrings[i]) <= power_of_5[j]:\n dp[j + 1] = min(dp[j + 1], dp[j] + 1)\n\n return dp[-1]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def longestValidSubstring(self, word: str, forbidden: List[str]) -> int:\n forbidden_set = set(forbidden)\n max_length = 0\n left = 0\n for right in range(len(word)):\n substring = word[left:right+1]\n if substring in forbidden_set:\n left = right + 1\n else:\n max_length = max(max_length, right - left + 1)\n return max_length", "class Solution:\n def longestValidSubstring(self, word: str, forbidden: List[str]) -> int:\n forbidden_set = set(forbidden)\n max_length = 0\n left = 0\n valid_substring = \"\"\n\n for right in range(len(word)):\n while word[left:right+1] in forbidden_set:\n left += 1\n if right - left + 1 > max_length:\n max_length = right - left + 1\n\n return max_length", "class Solution:\n def longestValidSubstring(self, word: str, forbidden: List[str]) -> int:\n forbidden_set = set(forbidden)\n max_length = 0\n left = 0\n for right in range(len(word)):\n substring = word[left:right+1]\n if substring in forbidden_set:\n left = right + 1\n else:\n max_length = max(max_length, right - left + 1)\n return max_length", "class Solution:\n def longestValidSubstring(self, word: str, forbidden: List[str]) -> int:\n forbidden_set = set(forbidden)\n max_length = 0\n left = 0\n for right in range(len(word)):\n substring = word[left:right+1]\n while substring in forbidden_set:\n left += 1\n substring = word[left:right+1]\n max_length = max(max_length, right - left + 1)\n return max_length", "class Solution:\n def longestValidSubstring(self, word: str, forbidden: List[str]) -> int:\n forbidden_set = set(forbidden)\n max_length = 0\n left = 0\n for right in range(len(word)):\n substring = word[left:right+1]\n if substring in forbidden_set:\n left = right + 1\n else:\n max_length = max(max_length, right - left + 1)\n return max_length", "class Solution:\n def longestValidSubstring(self, word: str, forbidden: List[str]) -> int:\n forbidden_set = set(forbidden)\n max_length = 0\n start = 0\n for i in range(len(word)):\n for j in range(i, len(word)):\n substring = word[i:j+1]\n if substring in forbidden_set:\n start = j + 1\n break\n max_length = max(max_length, i - start + 1)\n return max_length", "class Solution:\n def longestValidSubstring(self, word: str, forbidden: List[str]) -> int:\n forbidden_set = set(forbidden)\n max_length = 0\n left = 0\n for right in range(len(word)):\n substring = word[left:right+1]\n if substring in forbidden_set:\n left = right + 1\n else:\n max_length = max(max_length, right - left + 1)\n return max_length", "class Solution:\n def longestValidSubstring(self, word: str, forbidden: List[str]) -> int:\n forbidden_set = set(forbidden)\n max_length = 0\n left = 0\n for right in range(len(word)):\n substring = word[left:right+1]\n if substring in forbidden_set:\n left = right + 1\n else:\n max_length = max(max_length, right - left + 1)\n return max_length", "class Solution:\n def longestValidSubstring(self, word: str, forbidden: List[str]) -> int:\n forbidden_set = set(forbidden)\n max_length = 0\n left = 0\n for right in range(len(word)):\n substring = word[left:right+1]\n if substring in forbidden_set:\n left = right + 1\n else:\n max_length = max(max_length, right - left + 1)\n return max_length", "class Solution:\n def longestValidSubstring(self, word: str, forbidden: List[str]) -> int:\n forbidden_set = set(forbidden)\n max_length = 0\n left = 0\n for right in range(len(word)):\n substring = word[left:right+1]\n while substring in forbidden_set:\n left += 1\n substring = word[left:right+1]\n max_length = max(max_length, right - left + 1)\n return max_length" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def finalString(self, s: str) -> str:\n result = \"\"\n i_count = 0\n for char in s:\n if char == 'i':\n i_count += 1\n else:\n result += char\n return result[::-i_count] if i_count % 2 == 1 else result", "class Solution:\n def finalString(self, s: str) -> str:\n result = \"\"\n i_count = 0\n for c in s:\n if c == 'i':\n i_count += 1\n else:\n result += c\n return result[::-i_count]", "class Solution:\n def finalString(self, s: str) -> str:\n result = \"\"\n i_count = 0\n for char in s:\n if char == 'i':\n i_count += 1\n else:\n result += char\n return result[:len(result) - i_count] + result[len(result) - i_count:]", "class Solution:\n def finalString(self, s: str) -> str:\n result = \"\"\n i_count = 0\n for char in s:\n if char == 'i':\n i_count += 1\n else:\n result += char\n return result[:i_count] + result[i_count:][::-1]", "class Solution:\n def finalString(self, s: str) -> str:\n result = \"\"\n i_count = 0\n for char in s:\n if char == 'i':\n i_count += 1\n else:\n result += char\n return result[:len(result) - i_count] + result[len(result) - i_count:]", "class Solution:\n def finalString(self, s: str) -> str:\n result = \"\"\n i_count = 0\n for char in s:\n if char == 'i':\n i_count += 1\n else:\n result += char\n return result[:i_count * 2 // 2 :: -1] + result[i_count * 2 :: -1]", "class Solution:\n def finalString(self, s: str) -> str:\n result = \"\"\n i_count = 0\n for char in s:\n if char == 'i':\n i_count += 1\n else:\n result += char\n result = result[::-i_count]\n return result", "class Solution:\n def finalString(self, s: str) -> str:\n result = \"\"\n i_count = 0\n for char in s:\n if char == 'i':\n i_count += 1\n else:\n result += char\n return result[::-i_count] if i_count % 2 else result", "class Solution:\n def finalString(self, s: str) -> str:\n result = \"\"\n i_count = 0\n\n for char in s:\n if char == 'i':\n i_count += 1\n else:\n result += char\n\n for _ in range(i_count % 2):\n result = result[::-1]\n\n return result", "class Solution:\n def finalString(self, s: str) -> str:\n result = \"\"\n i_count = 0\n for c in s:\n if c == 'i':\n i_count += 1\n else:\n result += c\n return result[:i_count] + result[i_count:][::-1]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def sortVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n vowel_indices = [i for i, char in enumerate(s) if char in vowels]\n sorted_vowels = sorted([s[i] for i in vowel_indices])\n\n t = list(s)\n for i, index in enumerate(vowel_indices):\n t[index] = sorted_vowels[i]\n\n return \"\".join(t)", "class Solution:\n def sortVowels(self, s: str) -> str:\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"A\", \"E\", \"I\", \"O\", \"U\"]\n vowel_indices = [i for i, char in enumerate(s) if char in vowels]\n vowel_values = [s[i] for i in vowel_indices]\n vowel_values.sort()\n\n t = list(s)\n for i, idx in enumerate(vowel_indices):\n t[idx] = vowel_values[i]\n\n return \"\".join(t)", "class Solution:\n def sortVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n vowel_indices = [i for i, char in enumerate(s) if char in vowels]\n sorted_vowels = sorted([s[i] for i in vowel_indices])\n\n result = list(s)\n for i, idx in enumerate(vowel_indices):\n result[idx] = sorted_vowels[i]\n\n return \"\".join(result)", "class Solution:\n def sortVowels(self, s: str) -> str:\n vowels = \"aeiouAEIOU\"\n vowel_indices = [i for i, c in enumerate(s) if c in vowels]\n sorted_vowels = sorted([s[i] for i in vowel_indices])\n\n result = list(s)\n for i, idx in enumerate(vowel_indices):\n result[idx] = sorted_vowels[i]\n\n return \"\".join(result)", "class Solution:\n def sortVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n vowel_indices = [i for i, char in enumerate(s) if char in vowels]\n vowel_values = [s[i] for i in vowel_indices]\n vowel_values.sort()\n\n t = list(s)\n for i, index in enumerate(vowel_indices):\n t[index] = vowel_values[i]\n\n return \"\".join(t)", "class Solution:\n def sortVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n vowel_indices = [i for i, char in enumerate(s) if char in vowels]\n sorted_vowels = sorted([s[i] for i in vowel_indices])\n\n result = list(s)\n for i, index in enumerate(vowel_indices):\n result[index] = sorted_vowels[i]\n\n return \"\".join(result)", "class Solution:\n def sortVowels(self, s: str) -> str:\n vowels = \"aeiouAEIOU\"\n vowel_indices = [i for i, c in enumerate(s) if c in vowels]\n vowel_values = [s[i] for i in vowel_indices]\n vowel_values.sort()\n\n t = list(s)\n for i, idx in enumerate(vowel_indices):\n t[idx] = vowel_values[i]\n\n return \"\".join(t)", "class Solution:\n def sortVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n vowel_indices = [i for i, char in enumerate(s) if char in vowels]\n vowel_values = [s[i] for i in vowel_indices]\n vowel_values.sort()\n\n t = list(s)\n for i, index in enumerate(vowel_indices):\n t[index] = vowel_values[i]\n\n return \"\".join(t)", "class Solution:\n def sortVowels(self, s: str) -> str:\n vowels = \"aeiouAEIOU\"\n vowel_indices = [i for i, c in enumerate(s) if c in vowels]\n vowel_values = [s[i] for i in vowel_indices]\n vowel_values.sort()\n\n t = list(s)\n for i, idx in enumerate(vowel_indices):\n t[idx] = vowel_values[i]\n\n return \"\".join(t)", "class Solution:\n def sortVowels(self, s: str) -> str:\n vowels = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']\n vowel_indices = [i for i, char in enumerate(s) if char in vowels]\n vowel_values = [s[i] for i in vowel_indices]\n vowel_values.sort()\n\n t = list(s)\n for i, index in enumerate(vowel_indices):\n t[index] = vowel_values[i]\n\n return \"\".join(t)" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumIndex(self, nums: List[int]) -> int:\n n = len(nums)\n dominant = None\n count = 0\n\n for num in nums:\n if num == dominant:\n count += 1\n else:\n if dominant is None:\n dominant = num\n count = 1\n else:\n count -= 1\n\n if count * 2 <= n:\n return -1\n\n left_count = [0] * n\n right_count = [0] * n\n\n left, right = 0, 0\n\n for i in range(n):\n if nums[i] == dominant:\n left_count[i] = left\n left += 1\n\n if nums[n - 1 - i] == dominant:\n right_count[n - 1 - i] = right\n right += 1\n\n valid_split = n\n for i in range(n - 1):\n if left_count[i] * 2 > i + 1 and right_count[i + 1] * 2 > n - i - 1:\n valid_split = i\n break\n\n return valid_split", "class Solution:\n def minimumIndex(self, nums: List[int]) -> int:\n n = len(nums)\n dominant = None\n count = {}\n\n for num in nums:\n if num in count:\n count[num] += 1\n else:\n count[num] = 1\n\n if count[num] * 2 > n:\n dominant = num\n\n if dominant is None:\n return -1\n\n left_dominant = False\n right_dominant = False\n i = 0\n\n for num in nums:\n if num == dominant:\n if i <= n // 2:\n left_dominant = True\n else:\n right_dominant = True\n\n if left_dominant and right_dominant:\n return i\n\n i += 1\n\n return -1", "class Solution:\n def minimumIndex(self, nums: List[int]) -> int:\n n = len(nums)\n dominant = None\n count = 0\n\n for num in nums:\n if num == dominant:\n count += 1\n else:\n count = 1\n dominant = num\n\n if count * 2 > n:\n break\n\n if dominant is None:\n return -1\n\n left_dominant = None\n left_count = 0\n right_dominant = None\n right_count = 0\n\n for i in range(n):\n if i <= n // 2:\n if nums[i] == left_dominant:\n left_count += 1\n else:\n left_count = 1\n left_dominant = nums[i]\n\n if left_count * 2 > i + 1:\n return i\n else:\n if nums[n - 1 - i] == right_dominant:\n right_count += 1\n else:\n right_count = 1\n right_dominant = nums[n - 1 - i]\n\n if right_count * 2 > n - i:\n return n - 1 - i\n\n return -1", "class Solution:\n def minimumIndex(self, nums: List[int]) -> int:\n n = len(nums)\n dominant = None\n count = 0\n\n for num in nums:\n if num == dominant:\n count += 1\n else:\n if count * 2 > n:\n dominant = num\n count = 1\n else:\n count = 1\n\n if dominant is None:\n return -1\n\n left_dominant = None\n left_count = 0\n right_dominant = None\n right_count = 0\n\n for i in range(n):\n if i == n - 1 or nums[i] != nums[i + 1]:\n if left_count * 2 > i + 1:\n left_dominant = nums[i]\n if right_count * 2 > n - i - 1:\n right_dominant = nums[i + 1]\n\n if nums[i] == dominant:\n if i == n - 1:\n left_count += 1\n else:\n left_count += 1\n right_count += 1\n else:\n if i == n - 1:\n left_count += 1\n else:\n right_count += 1\n\n if left_dominant == right_dominant:\n return n - 1\n\n for i in range(n - 1):\n if nums[i] == left_dominant and nums[i + 1] == right_dominant:\n return i\n\n return -1", "class Solution:\n def minimumIndex(self, nums: List[int]) -> int:\n n = len(nums)\n dominant = None\n count = {}\n\n for num in nums:\n if num in count:\n count[num] += 1\n else:\n count[num] = 1\n if count[num] * 2 > n:\n dominant = num\n\n if dominant is None:\n return -1\n\n left_dominant = False\n right_dominant = False\n i = 0\n\n for num in nums:\n if num == dominant:\n if i <= n // 2:\n left_dominant = True\n else:\n right_dominant = True\n\n if left_dominant and right_dominant:\n return i\n\n i += 1\n\n return -1", "class Solution:\n def minimumIndex(self, nums: List[int]) -> int:\n n = len(nums)\n dominant = None\n count = 0\n for num in nums:\n if nums.count(num) * 2 > n:\n if dominant:\n return -1\n dominant = num\n count = nums.count(num)\n if not dominant:\n return -1\n\n left_dominant = False\n right_dominant = False\n for i in range(n - 1):\n if nums[i] == dominant:\n left_dominant = True\n else:\n if not left_dominant:\n return -1\n if nums[i + 1] == dominant:\n right_dominant = True\n else:\n if not right_dominant:\n return -1\n if left_dominant and right_dominant:\n return i\n return -1", "class Solution:\n def minimumIndex(self, nums: List[int]) -> int:\n n = len(nums)\n dominant = None\n count = {}\n \n for num in nums:\n if num in count:\n count[num] += 1\n else:\n count[num] = 1\n if count[num] * 2 > n:\n dominant = num\n \n if dominant is None:\n return -1\n \n left_dominant = False\n right_dominant = False\n i = 0\n while i < n:\n if nums[i] == dominant:\n left_dominant = True\n if left_dominant and right_dominant:\n break\n i += 1\n if i == n:\n break\n if nums[i] == dominant:\n right_dominant = True\n \n return i - 1 if left_dominant and right_dominant else -1", "class Solution:\n def minimumIndex(self, nums: List[int]) -> int:\n n = len(nums)\n dominant = None\n count = {}\n\n for num in nums:\n count[num] = count.get(num, 0) + 1\n if count[num] * 2 > n:\n dominant = num\n\n if dominant is None:\n return -1\n\n left_dominant = False\n right_dominant = False\n\n for i in range(n - 1):\n if nums[i] == dominant:\n left_dominant = True\n if nums[i + 1] == dominant:\n right_dominant = True\n\n if left_dominant and right_dominant:\n return i\n\n return -1", "class Solution:\n def minimumIndex(self, nums: List[int]) -> int:\n n = len(nums)\n dominant = None\n count = 0\n\n for num in nums:\n if num == dominant:\n count += 1\n else:\n if count * 2 > len(nums):\n dominant = num\n count = 1\n else:\n return -1\n if count * 2 > n:\n return 0\n\n for i in range(n - 1):\n if nums[i] == dominant:\n count -= 1\n if nums[i + 1] == dominant:\n count += 1\n if count * 2 <= n:\n return i\n\n return -1", "class Solution:\n def minimumIndex(self, nums: List[int]) -> int:\n n = len(nums)\n dominant = None\n count = {}\n \n for num in nums:\n if num in count:\n count[num] += 1\n else:\n count[num] = 1\n \n for num, freq in count.items():\n if freq * 2 > n:\n dominant = num\n break\n \n if dominant is None:\n return -1\n \n left_freq = 0\n for i in range(n):\n if nums[i] == dominant:\n left_freq += 1\n if i == n - 1 or nums[i+1] == dominant:\n continue\n if left_freq * 2 > i + 1 and left_freq * 2 > n - i - 1:\n return i\n \n return -1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumBeauty(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n dp = [1] * n\n for i in range(1, n):\n j = binary_search(nums, nums[i - 1] - k, i - 1)\n dp[i] = i - j if j >= 0 else i + 1\n return max(dp)\n\n def binary_search(self, nums, target, high):\n low = 0\n while low <= high:\n mid = (low + high) // 2\n if nums[mid] > target:\n high = mid - 1\n else:\n low = mid + 1\n return high", "class Solution:\n def maximumBeauty(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n dp = [1] * n\n for i in range(1, n):\n j = 0\n while j < i:\n if nums[i] - k <= nums[j]:\n dp[i] = max(dp[i], dp[j] + 1)\n j += 1\n return max(dp)", "class Solution:\n def maximumBeauty(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n dp = [1] * n\n for i in range(1, n):\n j = binary_search(nums, nums[i - 1] - k, i - 1)\n dp[i] = i - j if j >= 0 else i + 1\n return max(dp)\n\ndef binary_search(nums, target, high):\n low = 0\n while low <= high:\n mid = (low + high) // 2\n if nums[mid] > target:\n high = mid - 1\n else:\n low = mid + 1\n return low", "class Solution:\n def maximumBeauty(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n dp = [1] * n\n for i in range(1, n):\n j = 0\n while j < i:\n if nums[i] <= nums[j] + 2 * k:\n dp[i] = max(dp[i], dp[j] + 1)\n j += 1\n return max(dp)", "class Solution:\n def maximumBeauty(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n dp = [1] * n\n for i in range(1, n):\n j = 0\n while j < i:\n if nums[i] <= nums[j] + 2 * k:\n dp[i] = max(dp[i], dp[j] + 1)\n j += 1\n return max(dp)", "class Solution:\n def maximumBeauty(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n dp = [1] * n\n for i in range(1, n):\n j = binary_search(nums, nums[i] - k, i - 1, True)\n if j >= 0:\n dp[i] = dp[j] + 1\n if i > 0:\n dp[i] = max(dp[i], dp[i - 1])\n return max(dp)\n\n def binary_search(self, nums, target, high, find_lower):\n low = 0\n while low <= high:\n mid = (low + high) // 2\n if nums[mid] > target:\n high = mid - 1\n else:\n low = mid + 1\n if find_lower:\n return high\n else:\n return low", "class Solution:\n def maximumBeauty(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n dp = [1] * n\n for i in range(1, n):\n j = bisect.bisect_left(dp, i - k)\n dp[i] = max(dp[i - 1], dp[j] + 1)\n return dp[-1]", "class Solution:\n def maximumBeauty(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n dp = [1] * n\n for i in range(1, n):\n j = binary_search(nums, nums[i] - k, i - 1, True)\n if j != -1:\n dp[i] = dp[j] + 1\n if i > 0:\n dp[i] = max(dp[i], dp[i - 1])\n return max(dp)\n\n def binary_search(self, nums, target, high, find_lower):\n low = 0\n while low <= high:\n mid = (low + high) // 2\n if nums[mid] > target:\n high = mid - 1\n else:\n low = mid + 1\n if find_lower:\n return high if high >= 0 else -1\n else:\n return low", "class Solution:\n def maximumBeauty(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n dp = [1] * n\n for i in range(1, n):\n j = binary_search(nums, nums[i - 1] - k, i)\n if j < n and nums[j] == nums[i - 1] - k:\n dp[i] = dp[i - 1] + 1\n else:\n dp[i] = max(dp[i - 1], dp[j - 1] + 1) if j != 0 else 1\n return binary_search(dp, 0, n) + 1\n\n def binary_search(arr, target, left=None):\n \"\"\"Performs binary search and returns the index of the target value in the array.\n If the target value does not exist in the array, returns the insertion point.\"\"\"\n right = len(arr)\n if left is None:\n left = 0\n while left < right:\n mid = (left + right) // 2\n if arr[mid] < target:\n left = mid + 1\n else:\n right = mid\n return left", "class Solution:\n def maximumBeauty(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n dp = [1] * n\n for i in range(1, n):\n j = 0\n while j < i:\n if nums[i] <= nums[j] + 2 * k:\n dp[i] = max(dp[i], dp[j] + 1)\n j += 1\n return max(dp)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def isGood(self, nums: List[int]) -> bool:\n n = max(nums)\n return len(nums) == n and all(1 <= i <= n for i in nums) and nums.count(n) == 2", "class Solution:\n def isGood(self, nums: List[int]) -> bool:\n n = max(nums)\n return len(nums) == n + 1 and sorted(nums) == [1, 2, 3] * (n // 3) + [1, 2] * (n % 3) + [n] * (n % 3 + 1)", "class Solution:\n def isGood(self, nums: List[int]) -> bool:\n n = max(nums)\n base_n = set(range(1, n))\n return len(nums) == n + 1 and len(base_n - set(nums)) == 0", "class Solution:\n def isGood(self, nums: List[int]) -> bool:\n n = max(nums)\n base_n = set(range(1, n))\n return len(nums) == n + 1 and len(base_n - set(nums)) == 0", "class Solution:\n def isGood(self, nums: List[int]) -> bool:\n n = max(nums)\n if len(nums) != n + 1:\n return False\n nums.sort()\n for i in range(n):\n if nums[i] != i + 1:\n return False\n if nums[-1] != n:\n return False\n return True", "class Solution:\n def isGood(self, nums: List[int]) -> bool:\n n = max(nums)\n base_n = list(range(1, n)) + [n, n]\n return sorted(nums) == base_n", "class Solution:\n def isGood(self, nums: List[int]) -> bool:\n n = max(nums)\n return len(nums) == n + 1 and sorted(nums) == [1, 2, 3] * (n // 3) + [1, 2, n] * (n % 3)", "class Solution:\n def isGood(self, nums: List[int]) -> bool:\n n = max(nums)\n base_n = set(range(1, n))\n return len(nums) == n + 1 and len(base_n - set(nums)) == 0", "class Solution:\n def isGood(self, nums: List[int]) -> bool:\n n = max(nums)\n return len(nums) == n + 1 and sorted(nums) == [1, 2, 3] * (n // 3) + [1, 2, n] * (n % 3)", "class Solution:\n def isGood(self, nums: List[int]) -> bool:\n n = max(nums)\n if len(nums) != n + 1:\n return False\n nums.sort()\n for i in range(n):\n if nums[i] != i + 1:\n return False\n return nums[-2:] == [n, n]" ], "pass1_list": [ false, false, true, true, true, true, false, true, false, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxScore(self, nums: List[int], x: int) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = nums[0]\n\n for i in range(1, n):\n dp[i] = max(dp[i - 1] + nums[i], dp[max(0, i - 2)] + nums[i] - (x if nums[i] % 2 != nums[i - 1] % 2 else 0))\n\n return dp[n - 1]", "class Solution:\n def maxScore(self, nums: List[int], x: int) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = nums[0]\n for i in range(1, n):\n dp[i] = max(dp[i - 1] + nums[i], dp[max(0, i - 2)] + nums[i] - (x if nums[i] % 2 != nums[i - 1] % 2 else 0))\n return dp[n - 1]", "class Solution:\n def maxScore(self, nums: List[int], x: int) -> int:\n n = len(nums)\n odd = [0] * n\n even = [0] * n\n\n odd[0] = nums[0]\n even[0] = nums[0]\n\n for i in range(1, n):\n odd[i] = max(odd[i - 1] + nums[i], even[i - 1] - x + nums[i])\n even[i] = max(even[i - 1] + nums[i], odd[i - 1] - x + nums[i])\n\n return max(odd[n - 1], even[n - 1])", "class Solution:\n def maxScore(self, nums: List[int], x: int) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = nums[0]\n\n for i in range(1, n):\n dp[i] = max(dp[i - 1] + nums[i], dp[max(0, i - 2)] + nums[i] - (1 if nums[i - 1] % 2 != nums[i] % 2 else 0) * x)\n\n return dp[n - 1]", "class Solution:\n def maxScore(self, nums: List[int], x: int) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = nums[0]\n for i in range(1, n):\n dp[i] = max(dp[i - 1] + nums[i], dp[max(0, i - 2)] + nums[i] - (x if nums[i - 1] % 2 != nums[i] % 2 else 0))\n return dp[n - 1]", "class Solution:\n def maxScore(self, nums: List[int], x: int) -> int:\n n = len(nums)\n odd_pos = [i for i, num in enumerate(nums) if num % 2 != 0]\n even_pos = [i for i, num in enumerate(nums) if num % 2 == 0]\n\n dp = [0] * (n + 1)\n for i in range(n - 1, -1, -1):\n dp[i] = nums[i] + max(dp[i + 1], 0)\n if odd_pos and odd_pos[-1] == i:\n dp[i] = max(dp[i], dp[i + 1] - x)\n if even_pos and even_pos[-1] == i:\n dp[i] = max(dp[i], dp[i + 1])\n\n return dp[0]", "class Solution:\n def maxScore(self, nums: List[int], x: int) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = nums[0]\n for i in range(1, n):\n dp[i] = max(dp[i - 1] + nums[i], dp[max(0, i - 2)] + nums[i] - (x if nums[i] % 2 != nums[i - 1] % 2 else 0))\n return dp[n - 1]", "class Solution:\n def maxScore(self, nums: List[int], x: int) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = nums[0]\n\n for i in range(1, n):\n dp[i] = max(dp[i - 1], dp[max(0, i - 2)] + nums[i])\n if nums[i] % 2 != nums[i - 1] % 2:\n dp[i] -= x\n\n return max(dp)", "class Solution:\n def maxScore(self, nums: List[int], x: int) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = nums[0]\n for i in range(1, n):\n dp[i] = max(dp[i - 1], dp[max(0, i - 2)] + nums[i])\n if nums[i] % 2 != nums[i - 1] % 2:\n dp[i] -= x\n return dp[n - 1]", "class Solution:\n def maxScore(self, nums: List[int], x: int) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = nums[0]\n for i in range(1, n):\n dp[i] = max(dp[i - 1] + nums[i], dp[max(j for j in range(i) if nums[j] % 2 != nums[i])] + nums[i] - x)\n return dp[n - 1]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxSum(self, nums: List[int]) -> int:\n max_sum = -1\n max_digit_map = {}\n\n for num in nums:\n max_digit = max(int(digit) for digit in str(num))\n if max_digit not in max_digit_map:\n max_digit_map[max_digit] = num\n else:\n max_sum = max(max_sum, num + max_digit_map[max_digit])\n\n return max_sum if max_sum > 0 else -1", "class Solution:\n def maxSum(self, nums: List[int]) -> int:\n max_digit_map = {}\n max_sum = -1\n\n for num in nums:\n max_digit = max(int(digit) for digit in str(num))\n if max_digit not in max_digit_map:\n max_digit_map[max_digit] = num\n else:\n max_sum = max(max_sum, num + max_digit_map[max_digit])\n\n return max_sum", "class Solution:\n def maxSum(self, nums: List[int]) -> int:\n max_sum = -1\n max_digit_map = {}\n\n for num in nums:\n max_digit = str(num).rjust(5, '0')[0]\n if max_digit not in max_digit_map:\n max_digit_map[max_digit] = num\n else:\n max_sum = max(max_sum, num + max_digit_map[max_digit])\n\n return max_sum if max_sum > 0 else -1", "class Solution:\n def maxSum(self, nums: List[int]) -> int:\n max_sum = -1\n max_digit_map = {}\n\n for num in nums:\n max_digit = str(num)[0]\n if max_digit not in max_digit_map:\n max_digit_map[max_digit] = num\n else:\n max_sum = max(max_sum, num + max_digit_map[max_digit])\n\n return max_sum if max_sum > 0 else -1", "class Solution:\n def maxSum(self, nums: List[int]) -> int:\n max_sum = -1\n max_digit_map = {}\n\n for num in nums:\n max_digit = max(int(digit) for digit in str(num))\n if max_digit not in max_digit_map:\n max_digit_map[max_digit] = num\n else:\n max_sum = max(max_sum, num + max_digit_map[max_digit])\n\n return max_sum if max_sum > 0 else -1", "class Solution:\n def maxSum(self, nums: List[int]) -> int:\n max_sum = -1\n max_digit_map = {}\n\n for num in nums:\n max_digit = max(int(digit) for digit in str(num))\n if max_digit not in max_digit_map:\n max_digit_map[max_digit] = num\n else:\n max_sum = max(max_sum, num + max_digit_map[max_digit])\n\n return max_sum if max_sum != -1 else -1", "class Solution:\n def maxSum(self, nums: List[int]) -> int:\n max_sum = -1\n max_digit_map = {}\n\n for num in nums:\n max_digit = max(int(digit) for digit in str(num))\n if max_digit not in max_digit_map:\n max_digit_map[max_digit] = num\n else:\n max_sum = max(max_sum, num + max_digit_map[max_digit])\n\n return max_sum if max_sum > 0 else -1", "class Solution:\n def maxSum(self, nums: List[int]) -> int:\n max_sum = -1\n max_digit_map = {}\n\n for num in nums:\n max_digit = max(int(digit) for digit in str(num))\n if max_digit not in max_digit_map:\n max_digit_map[max_digit] = num\n else:\n max_sum = max(max_sum, num + max_digit_map[max_digit])\n\n return max_sum if max_sum != -1 else -1", "class Solution:\n def maxSum(self, nums: List[int]) -> int:\n max_digit_map = {}\n max_sum = -1\n\n for num in nums:\n max_digit = max(int(digit) for digit in str(num))\n if max_digit not in max_digit_map:\n max_digit_map[max_digit] = num\n else:\n max_sum = max(max_sum, num + max_digit_map[max_digit])\n\n return max_sum", "class Solution:\n def maxSum(self, nums: List[int]) -> int:\n max_sum = -1\n max_digit_map = {}\n\n for num in nums:\n max_digit = max(int(digit) for digit in str(num))\n if max_digit not in max_digit_map:\n max_digit_map[max_digit] = num\n else:\n max_sum = max(max_sum, num + max_digit_map[max_digit])\n\n return max_sum if max_sum > 0 else -1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countInterestingSubarrays(self, nums: List[int], modulo: int, k: int) -> int:\n cnt = 0\n count = 0\n res = 0\n\n for num in nums:\n count = 0 if num % modulo != k else count + 1\n cnt = (cnt + 1) % modulo if num % modulo == k else cnt\n res += cnt == k\n\n return res", "class Solution:\n def countInterestingSubarrays(self, nums: List[int], modulo: int, k: int) -> int:\n cnt = 0\n count = 0\n res = 0\n\n for num in nums:\n count = (count + 1) if num % modulo == k else 0\n if count % modulo == k:\n cnt += 1\n\n return cnt", "class Solution:\n def countInterestingSubarrays(self, nums: List[int], modulo: int, k: int) -> int:\n cnt = 0\n count = 0\n res = 0\n\n for num in nums:\n count = 0 if num % modulo != k else count + 1\n cnt = (cnt + 1) % modulo\n if count % modulo == k:\n res += 1\n\n return res", "class Solution:\n def countInterestingSubarrays(self, nums: List[int], modulo: int, k: int) -> int:\n cnt = 0\n count = 0\n res = 0\n\n for num in nums:\n count = 0 if num % modulo != k else count + 1\n cnt = (cnt + 1) % modulo if num % modulo == k else cnt\n res += cnt == k\n\n return res", "class Solution:\n def countInterestingSubarrays(self, nums: List[int], modulo: int, k: int) -> int:\n cnt = 0\n count = 0\n res = 0\n\n for num in nums:\n count = 0 if num % modulo != k else 1\n cnt = (cnt + 1) % modulo if num % modulo == k else cnt\n res += cnt == k\n\n return res", "class Solution:\n def countInterestingSubarrays(self, nums: List[int], modulo: int, k: int) -> int:\n cnt = 0\n count = 0\n res = 0\n\n for num in nums:\n count = 0 if num % modulo != k else 1\n cnt = (cnt + 1) % modulo if num % modulo == k else cnt\n res += cnt == k\n\n return res", "class Solution:\n def countInterestingSubarrays(self, nums: List[int], modulo: int, k: int) -> int:\n def count(nums, modulo, k):\n cnt = 0\n for num in nums:\n if num % modulo == k:\n cnt = (cnt + 1) % modulo\n return cnt\n\n n = len(nums)\n ans = 0\n for i in range(n):\n for j in range(i, n):\n if count(nums[i:j+1], modulo, k) == k:\n ans += 1\n return ans", "class Solution:\n def countInterestingSubarrays(self, nums: List[int], modulo: int, k: int) -> int:\n cnt = 0\n count = 0\n res = 0\n\n for num in nums:\n if num % modulo == k:\n count = (count + 1) % modulo\n else:\n count = 0\n\n if count == k:\n cnt += 1\n\n return cnt", "class Solution:\n def countInterestingSubarrays(self, nums: List[int], modulo: int, k: int) -> int:\n cnt = 0\n count = 0\n res = 0\n\n for num in nums:\n count = 0 if num % modulo != k else count + 1\n cnt = (cnt + 1) % modulo if num % modulo == k else cnt\n res += cnt == k\n\n return res", "class Solution:\n def countInterestingSubarrays(self, nums: List[int], modulo: int, k: int) -> int:\n cnt = 0\n count = 0\n res = 0\n\n for num in nums:\n if num % modulo == k:\n count = (count + 1) % modulo\n else:\n count = 0\n\n if count == k:\n cnt += 1\n\n return cnt" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def canSplitArray(self, nums: List[int], m: int) -> bool:\n def check(idx, remaining_splits):\n if remaining_splits == 0:\n return True\n for i in range(idx, len(nums)):\n if i == len(nums) - 1 or i == idx:\n if nums[idx] >= m or nums[i] >= m:\n if check(i + 1, remaining_splits - 1):\n return True\n elif nums[idx] + nums[i] >= m:\n if check(i + 1, remaining_splits - 1):\n return True\n return False\n\n return check(0, len(nums) - 1)", "class Solution:\n def canSplitArray(self, nums: List[int], m: int) -> bool:\n def check(idx, rem, cnt):\n if rem == 0:\n return cnt == 1\n if rem == 1:\n return True\n for i in range(idx, len(nums) - rem + 1 + (rem != 1)):\n if i > idx and nums[idx] < m:\n continue\n if i + rem - 1 < len(nums) and nums[-1] < m:\n break\n if check(i + 1, rem - (i + rem - 1 - idx), cnt + 1):\n return True\n return False\n\n return check(0, len(nums), 0)", "class Solution:\n def canSplitArray(self, nums: List[int], m: int) -> bool:\n def check(idx, rem, cnt):\n if rem == 0:\n return cnt == 1\n if rem == 1:\n return True\n for i in range(idx, len(nums) - rem + 1 + 1):\n if i + rem - 1 > len(nums) or nums[i] + check(i + 1, rem - 1, cnt + 1) >= m:\n return True\n return False\n\n return check(0, len(nums), 0)", "class Solution:\n def canSplitArray(self, nums: List[int], m: int) -> bool:\n def can_split(index, remaining_arrays, current_sum):\n if remaining_arrays == 1:\n return True\n if current_sum >= m:\n return can_split(index + 1, remaining_arrays - 1, 0)\n for i in range(index, len(nums)):\n if i == len(nums) - 1 or nums[i] + nums[i + 1] >= m:\n if can_split(i + 1, remaining_arrays, current_sum + nums[i]):\n return True\n return False\n\n return can_split(0, len(nums), 0)", "class Solution:\n def canSplitArray(self, nums: List[int], m: int) -> bool:\n def check(i, j, cnt):\n if i >= j:\n return cnt == 1\n if (nums[i] + nums[j]) // 2 >= m:\n return check(i + 1, j, cnt + 1) or check(i, j - 1, cnt + 1)\n return check(i + 1, j, cnt + 1) and check(i, j - 1, cnt + 1)\n\n return check(0, len(nums) - 1, 1)", "class Solution:\n def canSplitArray(self, nums: List[int], m: int) -> bool:\n def check(index, remaining_splits, curr_sum):\n if remaining_splits == 0:\n return True\n if curr_sum >= m:\n return check(index + 1, remaining_splits - 1, 0)\n for i in range(index, len(nums)):\n if check(i + 1, remaining_splits, curr_sum + nums[i]):\n return True\n return False\n\n return check(0, len(nums) - 1, 0)", "class Solution:\n def canSplitArray(self, nums: List[int], m: int) -> bool:\n def check(idx, rem, cnt):\n if rem == 0:\n return cnt == 1\n if rem == 1:\n return True\n for i in range(idx, len(nums) - rem + 1 + (rem > 1)):\n if i > idx and nums[idx - 1] < m:\n continue\n if nums[i - 1] >= m or check(i, rem - 1 - (i > idx), cnt + 1):\n return True\n return False\n\n return check(0, len(nums), 0)", "class Solution:\n def canSplitArray(self, nums: List[int], m: int) -> bool:\n def check(index, remaining_splits, curr_sum):\n if remaining_splits == 0:\n return True\n if curr_sum >= m:\n return check(index + 1, remaining_splits - 1, 0)\n for i in range(index, len(nums)):\n if check(i + 1, remaining_splits, curr_sum + nums[i]):\n return True\n return False\n\n return check(0, len(nums) - 1, 0)", "class Solution:\n def canSplitArray(self, nums: List[int], m: int) -> bool:\n def can_split(index, remaining_arrays):\n if remaining_arrays == 1:\n return True\n for i in range(index, len(nums)):\n if i == len(nums) - 1 or nums[i] < m:\n if can_split(i + 1, remaining_arrays - 1):\n return True\n elif nums[i] - nums[index] >= m or nums[i + 1 :].count(1) >= remaining_arrays - 1:\n return True\n return False\n\n return can_split(0, len(nums))", "class Solution:\n def canSplitArray(self, nums: List[int], m: int) -> bool:\n def check(index, remaining_splits, curr_sum):\n if remaining_splits == 0:\n return True\n if curr_sum >= m:\n return check(index + 1, remaining_splits - 1, 0)\n for i in range(index, len(nums)):\n if check(i + 1, remaining_splits, curr_sum + nums[i]):\n return True\n return False\n\n return check(0, len(nums) - 1, 0)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countPairs(self, nums: List[int], target: int) -> int:\n count = 0\n n = len(nums)\n \n for i in range(n):\n for j in range(i + 1, n):\n if nums[i] + nums[j] < target:\n count += 1\n \n return count", "class Solution:\n def countPairs(self, nums: List[int], target: int) -> int:\n count = 0\n n = len(nums)\n \n for i in range(n):\n for j in range(i + 1, n):\n if nums[i] + nums[j] < target:\n count += 1\n \n return count", "class Solution:\n def countPairs(self, nums: List[int], target: int) -> int:\n count = 0\n n = len(nums)\n \n for i in range(n):\n for j in range(i + 1, n):\n if nums[i] + nums[j] < target:\n count += 1\n \n return count", "class Solution:\n def countPairs(self, nums: List[int], target: int) -> int:\n count = 0\n n = len(nums)\n \n for i in range(n):\n for j in range(i + 1, n):\n if nums[i] + nums[j] < target:\n count += 1\n \n return count", "class Solution:\n def countPairs(self, nums: List[int], target: int) -> int:\n count = 0\n n = len(nums)\n \n for i in range(n):\n for j in range(i + 1, n):\n if nums[i] + nums[j] < target:\n count += 1\n \n return count", "class Solution:\n def countPairs(self, nums: List[int], target: int) -> int:\n count = 0\n n = len(nums)\n \n for i in range(n):\n for j in range(i + 1, n):\n if nums[i] + nums[j] < target:\n count += 1\n \n return count", "class Solution:\n def countPairs(self, nums: List[int], target: int) -> int:\n count = 0\n n = len(nums)\n \n for i in range(n):\n for j in range(i + 1, n):\n if nums[i] + nums[j] < target:\n count += 1\n \n return count", "class Solution:\n def countPairs(self, nums: List[int], target: int) -> int:\n count = 0\n n = len(nums)\n \n for i in range(n):\n for j in range(i + 1, n):\n if nums[i] + nums[j] < target:\n count += 1\n \n return count", "class Solution:\n def countPairs(self, nums: List[int], target: int) -> int:\n count = 0\n n = len(nums)\n \n for i in range(n):\n for j in range(i + 1, n):\n if nums[i] + nums[j] < target:\n count += 1\n \n return count", "class Solution:\n def countPairs(self, nums: List[int], target: int) -> int:\n count = 0\n n = len(nums)\n \n for i in range(n):\n for j in range(i + 1, n):\n if nums[i] + nums[j] < target:\n count += 1\n \n return count" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxIncreasingGroups(self, usageLimits: List[int]) -> int:\n usageLimits.sort(key=lambda x: x / (len(usageLimits) - 1))\n groups = 0\n prev_group_size = 0\n for limit in usageLimits:\n if limit <= prev_group_size:\n break\n groups += 1\n prev_group_size += 1\n return groups", "class Solution:\n def maxIncreasingGroups(self, usageLimits: List[int]) -> int:\n usageLimits.sort(key=lambda x: -x)\n group_count = 1\n group_size = 1\n\n for i in range(1, len(usageLimits)):\n if usageLimits[i] < usageLimits[i - 1]:\n group_count += 1\n group_size = 1\n else:\n group_size += 1\n\n return min(group_count + 1, usageLimits[0])", "class Solution:\n def maxIncreasingGroups(self, usageLimits: List[int]) -> int:\n n = len(usageLimits)\n counts = sorted(range(n), key=lambda i: usageLimits[i], reverse=True)\n max_groups = 1\n prev_group_size = 1\n\n for i in range(n):\n group_size = min(usageLimits[counts[i]], prev_group_size + 1)\n usageLimits[counts[i]] -= group_size\n prev_group_size = group_size\n if usageLimits[counts[i]] == 0:\n max_groups += 1\n\n return max_groups", "class Solution:\n def maxIncreasingGroups(self, usageLimits: List[int]) -> int:\n n = len(usageLimits)\n usageLimits.sort(key=lambda x: x / (n - 1))\n groups = 0\n prev_group_size = 0\n for limit in usageLimits:\n if limit >= groups:\n groups += 1\n prev_group_size = max(prev_group_size + 1, limit // (groups - 1))\n else:\n break\n return groups", "class Solution:\n def maxIncreasingGroups(self, usageLimits: List[int]) -> int:\n n = len(usageLimits)\n usageLimits.sort(key=lambda x: x / (n - 1))\n groups = 0\n prev_group_size = 0\n for limit in usageLimits:\n group_size = min(limit, n - 1)\n if group_size > prev_group_size:\n groups += 1\n prev_group_size = group_size\n limit -= group_size\n n -= 1\n return groups", "class Solution:\n def maxIncreasingGroups(self, usageLimits: List[int]) -> int:\n usageLimits.sort(key=lambda x: -x)\n max_groups = 1\n prev_group_size = 1\n\n for limit in usageLimits:\n if limit >= prev_group_size:\n max_groups += 1\n prev_group_size += 1\n\n return max_groups", "class Solution:\n def maxIncreasingGroups(self, usageLimits: List[int]) -> int:\n usageLimits.sort(key=lambda x: -x)\n group_count, group_size, n = 0, 0, len(usageLimits)\n\n for i in range(n):\n if group_size < usageLimits[i]:\n group_count += 1\n group_size = usageLimits[i]\n\n return group_count", "class Solution:\n def maxIncreasingGroups(self, usageLimits: List[int]) -> int:\n n = len(usageLimits)\n counts = sorted(usageLimits, key=lambda x: -x)\n max_groups = 1\n prev_group_size = 1\n\n for i in range(1, n):\n if counts[i] >= counts[i - 1]:\n prev_group_size += 1\n else:\n max_groups += 1\n prev_group_size = 1\n\n return max_groups", "class Solution:\n def maxIncreasingGroups(self, usageLimits: List[int]) -> int:\n n = len(usageLimits)\n usageLimits.sort(key=lambda x: -x)\n dp = [1] * n\n for i in range(n):\n for j in range(i):\n if usageLimits[j] < usageLimits[i]:\n dp[i] = max(dp[i], dp[j] + 1)\n return max(dp)", "class Solution:\n def maxIncreasingGroups(self, usageLimits: List[int]) -> int:\n usageLimits.sort(key=lambda x: x / (len(usageLimits) - 1))\n groups = 0\n prev_group_size = 0\n for limit in usageLimits:\n if limit <= prev_group_size:\n break\n groups += 1\n prev_group_size += 1\n return groups" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumSeconds(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1:\n return 0\n\n # Find the first and last occurrences of each unique value in the array\n value_positions = {}\n for i, num in enumerate(nums):\n if num not in value_positions:\n value_positions[num] = [i, i]\n else:\n value_positions[num][0] = min(value_positions[num][0], i)\n value_positions[num][1] = max(value_positions[num][1], i)\n\n # Initialize the answer to the maximum possible value\n ans = n\n\n # Check if we can equalize the array in less than n seconds\n for num, (first, last) in value_positions.items():\n # Calculate the number of seconds needed to make all elements equal to 'num'\n seconds = max(0, (last - first + 1) // 2)\n ans = min(ans, seconds)\n\n return ans", "class Solution:\n def minimumSeconds(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1:\n return 0\n \n # Find the first occurrence of the smallest element\n smallest = min(nums)\n first_smallest = nums.index(smallest)\n \n # Find the last occurrence of the smallest element\n last_smallest = len(nums) - 1 - nums[::-1].index(smallest)\n \n # Calculate the number of seconds needed to equalize the array\n return max(0, (first_smallest + last_smallest - 1) // n)", "class Solution:\n def minimumSeconds(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1:\n return 0\n \n # Calculate the frequency of each integer in the array\n freq = {}\n for num in nums:\n if num in freq:\n freq[num] += 1\n else:\n freq[num] = 1\n \n # If there are more than 2 unique integers, return infinity as it is impossible to equalize\n if len(freq) > 2:\n return float('inf')\n \n # If there are 2 unique integers, find the distance between them\n a, b = freq.keys()\n dist = abs(a - b)\n \n # Initialize the answer as the distance divided by the length of the array\n ans = dist // n\n \n # Check if we need one more operation to equalize\n if dist % n != 0:\n ans += 1\n \n return ans", "class Solution:\n def minimumSeconds(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1:\n return 0\n\n # Find the first occurrence of the smallest element\n smallest_elem = min(nums)\n first_occurrence = nums.index(smallest_elem)\n\n # Shift the array so that the smallest element is at the beginning\n nums = nums[-1:] + nums[:-1]\n\n # Find the last occurrence of the smallest element\n last_occurrence = len(nums) - 1 - nums[::-1].index(smallest_elem)\n\n # The minimum number of seconds needed is the difference between the last and first occurrences\n return last_occurrence - first_occurrence", "class Solution:\n def minimumSeconds(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1:\n return 0\n \n # Calculate the frequency of each integer in the array\n freq = {}\n for num in nums:\n if num in freq:\n freq[num] += 1\n else:\n freq[num] = 1\n \n # If there are more than 2 unique integers, return infinity as it is not possible to equalize\n if len(freq) > 2:\n return float('inf')\n \n # If there are 2 unique integers, find the distance between them\n a, b = freq.keys()\n dist = abs(a - b)\n \n # Initialize the answer as infinity\n ans = float('inf')\n \n # Check all possible \"pivots\" i.e., the index where the integers change\n for i in range(n):\n left = nums[i]\n right = nums[(i + 1) % n]\n if left != right:\n # Calculate the minimum number of seconds to equalize the array\n seconds = max(0, dist - (n - 1))\n ans = min(ans, seconds)\n \n return ans", "class Solution:\n def minimumSeconds(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1:\n return 0\n \n # Calculate the frequency of each integer in the array\n freq = {}\n for num in nums:\n if num in freq:\n freq[num] += 1\n else:\n freq[num] = 1\n \n # If there are more than 2 unique integers, return infinity as it is impossible to equalize\n if len(freq) > 2:\n return float('inf')\n \n # Find the two unique integers and their frequencies\n num1, num2 = list(freq.keys())\n f1, f2 = freq[num1], freq[num2]\n \n # If only one unique integer, return 0\n if f1 == n:\n return 0\n \n # Calculate the minimum number of seconds to equalize\n if f1 == 1:\n return f2 - f1\n elif f2 == 1:\n return f1 - f2\n else:\n return min(f1 - 1, f2 - 1)", "class Solution:\n def minimumSeconds(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1:\n return 0\n \n # Calculate the frequency of each integer in the array\n freq = {}\n for num in nums:\n if num in freq:\n freq[num] += 1\n else:\n freq[num] = 1\n \n # If there are more than 2 unique integers, return infinity as it is impossible to equalize\n if len(freq) > 2:\n return float('inf')\n \n # If there are 2 unique integers, find the distance between them\n a, b = freq.keys()\n dist = abs(a - b)\n \n # Initialize the answer as infinity\n ans = float('inf')\n \n # Check all possible differences between the integers and n to find the minimum number of seconds\n for i in range(1, n):\n if dist % i == 0:\n ans = min(ans, (n + i - 1) // i)\n \n return ans if ans != float('inf') else 0", "class Solution:\n def minimumSeconds(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1:\n return 0\n\n # Find the unique elements in the array\n unique_nums = list(set(nums))\n num_unique_nums = len(unique_nums)\n\n # If there are only two unique elements, we can solve it in a specific way\n if num_unique_nums == 2:\n count1 = nums.count(unique_nums[0])\n count2 = n - count1\n if min(count1, count2) == 1:\n return 1\n else:\n return 2\n\n # For more than two unique elements, we can use a greedy algorithm\n # Keep track of the current count of each unique element\n counts = [0] * num_unique_nums\n for num in nums:\n counts[unique_nums.index(num)] += 1\n\n # Initialize the result to a large value\n result = n\n\n # Try to equalize the array by moving left or right\n for i in range(n):\n left_num = unique_nums[i]\n right_num = unique_nums[(i + 1) % num_unique_nums]\n left_count = counts[i]\n right_count = n - left_count\n\n # Try moving left\n if left_count <= right_count:\n result = min(result, right_count)\n\n # Try moving right\n else:\n result = min(result, left_count)\n\n return result", "class Solution:\n def minimumSeconds(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1:\n return 0\n\n # Find the first occurrence of the smallest element\n smallest = min(nums)\n first_smallest = nums.index(smallest)\n\n # Find the last occurrence of the smallest element\n last_smallest = len(nums) - 1 - nums[::-1].index(smallest)\n\n # Calculate the number of seconds needed to equalize the array\n return max(0, min(first_smallest, last_smallest) - 1, n - 1 - last_smallest)", "class Solution:\n def minimumSeconds(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1:\n return 0\n \n # Count the occurrences of each unique value\n counts = {}\n for num in nums:\n if num not in counts:\n counts[num] = 0\n counts[num] += 1\n \n # If there is only one unique value, no operations are needed\n if len(counts) == 1:\n return 0\n \n # Initialize the answer as infinite\n ans = float('inf')\n \n # Check if we can equalize the array by moving left or right once\n for i in range(n):\n left_value = nums[(i - 1 + n) % n]\n right_value = nums[(i + 1) % n]\n if counts[left_value] == n - 1 or counts[right_value] == n - 1:\n ans = 1\n break\n \n # Check if we can equalize the array by moving left or right twice\n for i in range(n):\n left_value = nums[(i - 2 + n) % n]\n right_value = nums[(i + 2) % n]\n if counts.get(left_value, 0) + counts.get(right_value, 0) == n - 1:\n ans = 2\n break\n \n return ans" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countSteppingNumbers(self, low: str, high: str) -> int:\n def is_stepping(num: str) -> bool:\n for i in range(1, len(num)):\n if abs(int(num[i]) - int(num[i - 1])) != 1:\n return False\n return True\n\n def count_stepping_numbers_in_range(low: str, high: str) -> int:\n count = 0\n for i in range(len(low), len(high) + 1):\n for j in range(10 ** (i - 1), 10 ** i):\n num = str(j)\n if len(num) < i:\n num = \"0\" * (i - len(num)) + num\n if num >= low and num <= high and is_stepping(num):\n count += 1\n return count\n\n return count_stepping_numbers_in_range(low, high) % (10**9 + 7)", "class Solution:\n def countSteppingNumbers(self, low: str, high: str) -> int:\n def is_stepping(num: str) -> bool:\n for i in range(1, len(num)):\n if abs(int(num[i]) - int(num[i - 1])) != 1:\n return False\n return True\n\n def count_stepping_numbers_in_range(low: str, high: str) -> int:\n count = 0\n for num in range(int(low), int(high) + 1):\n num_str = str(num)\n if is_stepping(num_str):\n count += 1\n return count\n\n return count_stepping_numbers_in_range(low, high) % (10**9 + 7)", "class Solution:\n def countSteppingNumbers(self, low: str, high: str) -> int:\n def is_stepping(num: str) -> bool:\n num = num[1:] if num[0] == '0' else num\n prev_digit = num[0]\n for digit in num[1:]:\n if abs(int(prev_digit) - int(digit)) != 1:\n return False\n prev_digit = digit\n return True\n \n count = 0\n for num in range(int(low), int(high) + 1):\n num_str = str(num)\n if is_stepping(num_str):\n count += 1\n \n return count % (10**9 + 7)", "class Solution:\n def countSteppingNumbers(self, low: str, high: str) -> int:\n def is_stepping(num: str) -> bool:\n for i in range(1, len(num)):\n if abs(int(num[i]) - int(num[i - 1])) != 1:\n return False\n return True\n \n def count_stepping_numbers_in_range(low: str, high: str) -> int:\n count = 0\n for i in range(len(low), len(high) + 1):\n for j in range(10 ** (i - 1), 10 ** i):\n num = str(j)\n if len(num) == i and is_stepping(num) and int(low) <= j <= int(high):\n count = (count + 1) % (10**9 + 7)\n return count\n \n return count_stepping_numbers_in_range(low, high)", "class Solution:\n def countSteppingNumbers(self, low: str, high: str) -> int:\n def is_stepping(num: str) -> bool:\n for i in range(1, len(num)):\n if abs(int(num[i]) - int(num[i - 1])) != 1:\n return False\n return True\n \n def count_stepping_numbers_in_range(low: str, high: str) -> int:\n count = 0\n for i in range(len(low), len(high) + 1):\n for j in range(10 ** (i - 1), 10 ** i):\n num = str(j)\n if len(num) == i and is_stepping(num) and low <= num <= high:\n count += 1\n return count\n \n return count_stepping_numbers_in_range(low, high) % (10**9 + 7)", "class Solution:\n def countSteppingNumbers(self, low: str, high: str) -> int:\n def is_stepping(num: str) -> bool:\n for i in range(1, len(num)):\n if abs(int(num[i]) - int(num[i - 1])) != 1:\n return False\n return True\n \n def count_stepping_numbers_in_range(start: str, end: str) -> int:\n count = 0\n for i in range(len(start)):\n for j in range(i + 1):\n digit = int(start[i]) - j\n if digit >= 0:\n new_start = start[:i] + str(digit) + \"0\" * (len(start) - i - 1)\n new_end = end\n if i < len(end):\n new_end = end[:i] + str(digit + 1) + \"9\" * (len(end) - i - 1)\n count += (\n count_stepping_numbers_in_range(new_start, new_end)\n if new_start <= new_end\n else 0\n )\n return count % (10**9 + 7)\n \n return count_stepping_numbers_in_range(low, high)", "class Solution:\n def countSteppingNumbers(self, low: str, high: str) -> int:\n def is_stepping(num: str) -> bool:\n for i in range(1, len(num)):\n if abs(int(num[i]) - int(num[i - 1])) != 1:\n return False\n return True\n\n def count_stepping_numbers_in_range(low: str, high: str) -> int:\n count = 0\n for i in range(len(low), len(high) + 1):\n for j in range(10 ** (i - 1), 10 ** i):\n num = str(j)\n if len(num) < i:\n num = \"0\" * (i - len(num)) + num\n if num >= low and num <= high and is_stepping(num):\n count += 1\n return count\n\n return count_stepping_numbers_in_range(low, high) % (10**9 + 7)", "class Solution:\n def countSteppingNumbers(self, low: str, high: str) -> int:\n def is_stepping(num: str) -> bool:\n for i in range(1, len(num)):\n if abs(int(num[i]) - int(num[i - 1])) != 1:\n return False\n return True\n\n def count_stepping_numbers_in_range(low: str, high: str) -> int:\n count = 0\n for num in range(int(low), int(high) + 1):\n num_str = str(num)\n if is_stepping(num_str):\n count += 1\n return count\n\n return count_stepping_numbers_in_range(low, high) % (10**9 + 7)", "class Solution:\n def countSteppingNumbers(self, low: str, high: str) -> int:\n def is_stepping(num: str) -> bool:\n for i in range(1, len(num)):\n if abs(int(num[i]) - int(num[i - 1])) != 1:\n return False\n return True\n \n def count_stepping_numbers_in_range(low: str, high: str) -> int:\n count = 0\n for i in range(len(low), len(high) + 1):\n for j in range(10 ** (i - 1), 10 ** i):\n temp_str = str(j)\n if len(temp_str) < i:\n temp_str = \"0\" * (i - len(temp_str)) + temp_str\n if is_stepping(temp_str) and int(temp_str) >= int(low) and int(temp_str) <= int(high):\n count += 1\n return count\n \n return count_stepping_numbers_in_range(low, high) % (10**9 + 7)", "class Solution:\n def countSteppingNumbers(self, low: str, high: str) -> int:\n def is_stepping(num: str) -> bool:\n for i in range(1, len(num)):\n if abs(int(num[i]) - int(num[i - 1])) != 1:\n return False\n return True\n\n def count_stepping_numbers_in_range(low: str, high: str) -> int:\n count = 0\n for i in range(len(low), len(high) + 1):\n for j in range(10 ** (i - 1), 10 ** i):\n num = str(j)\n if len(num) < i:\n num = \"0\" * (i - len(num)) + num\n if num >= low and num <= high and is_stepping(num):\n count += 1\n return count\n\n return count_stepping_numbers_in_range(low, high) % (10**9 + 7)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumTime(self, nums1: List[int], nums2: List[int], x: int) -> int:\n def can_reach(time: int) -> bool:\n sum_nums1 = sum(\n (num1 + time * num2 for num1, num2 in zip(nums1, nums2))\n )\n return sum_nums1 <= x\n\n left, right = 0, sum(nums1) + sum(nums2) * (len(nums1) - 1)\n while left < right:\n mid = left + (right - left) // 2\n if can_reach(mid):\n right = mid\n else:\n left = mid + 1\n return left if left < len(nums1) else -1", "class Solution:\n def minimumTime(self, nums1: List[int], nums2: List[int], x: int) -> int:\n def can_reach(time: int) -> bool:\n sum_nums1 = sum(min(time, num1) + num2 * time for num1, num2 in zip(nums1, nums2))\n return sum_nums1 <= x\n\n left, right = 0, sum(num1 + num2 for num1, num2 in zip(nums1, nums2))\n if can_reach(right):\n return right\n\n while left < right:\n mid = left + (right - left) // 2\n if can_reach(mid):\n right = mid\n else:\n left = mid + 1\n\n return -1", "class Solution:\n def minimumTime(self, nums1: List[int], nums2: List[int], x: int) -> int:\n max_time = sum(nums1)\n \n for i in range(len(nums1)):\n max_time += nums2[i] * (len(nums1) - 1 - i)\n \n if sum(nums1) > x or max_time > x:\n return -1\n \n left, right = 0, max_time\n while left < right:\n mid = left + (right - left) // 2\n total_sum = sum(nums1)\n for i in range(len(nums1)):\n time_passed = mid // (i + 1)\n total_sum += nums2[i] * time_passed\n if total_sum > x:\n break\n mid -= time_passed\n if total_sum <= x:\n right = mid\n else:\n left = mid + 1\n \n return left", "class Solution:\n def minimumTime(self, nums1: List[int], nums2: List[int], x: int) -> int:\n def can_reach(time: int) -> bool:\n sum_nums1 = sum(min(time, num1) + num2 * time for num1, num2 in zip(nums1, nums2))\n return sum_nums1 <= x\n\n left, right = 0, sum(num1 + num2 for num1, num2 in zip(nums1, nums2))\n if can_reach(right):\n return right\n\n while left < right:\n mid = left + (right - left + 1) // 2\n if can_reach(mid):\n right = mid - 1\n else:\n left = mid\n\n return left if left > 0 else -1", "class Solution:\n def minimumTime(self, nums1: List[int], nums2: List[int], x: int) -> int:\n def can_reach(time: int) -> bool:\n sum_nums1 = sum(min(time, num1 + time * num2) for num1, num2 in zip(nums1, nums2))\n return sum_nums1 <= x\n\n left, right = 0, 10**6\n while left < right:\n mid = left + (right - left) // 2\n if can_reach(mid):\n right = mid\n else:\n left = mid + 1\n\n return left if left < 10**6 else -1", "class Solution:\n def minimumTime(self, nums1: List[int], nums2: List[int], x: int) -> int:\n def can_reach(time: int) -> bool:\n sum_nums1 = sum(min(time, num1 + time * num2) for num1, num2 in zip(nums1, nums2))\n return sum_nums1 <= x\n\n left, right = 0, max(nums1) * max(nums2)\n while left < right:\n mid = left + (right - left) // 2\n if can_reach(mid):\n right = mid\n else:\n left = mid + 1\n\n return left if left < max(nums1) * max(nums2) else -1", "class Solution:\n def minimumTime(self, nums1: List[int], nums2: List[int], x: int) -> int:\n def can_reach(time: int) -> bool:\n sum_nums1 = sum(min(time, num1 + time * num2) for num1, num2 in zip(nums1, nums2))\n return sum_nums1 <= x\n\n left, right = 0, sum(num1 + x * num2 for num1, num2 in zip(nums1, nums2))\n while left < right:\n mid = left + (right - left) // 2\n if can_reach(mid):\n right = mid\n else:\n left = mid + 1\n return left if left < 10**4 else -1", "class Solution:\n def minimumTime(self, nums1: List[int], nums2: List[int], x: int) -> int:\n max_time = sum(nums1) + sum(nums2) * (len(nums1) - 1)\n\n if max_time > x:\n return -1\n\n left, right = 0, max_time\n while left < right:\n mid = left + (right - left) // 2\n if self.can_reach(mid, nums1, nums2, x):\n right = mid\n else:\n left = mid + 1\n\n return left if left <= max_time else -1\n\n def can_reach(self, time: int, nums1: List[int], nums2: List[int], x: int) -> bool:\n for i in range(len(nums1)):\n temp_sum = sum(nums1) + nums2[i] * time\n if temp_sum <= x:\n return True\n nums1[i] = 0\n temp_sum = sum(nums1) + nums2[i] * (time - 1)\n if temp_sum <= x:\n return True\n\n return False", "class Solution:\n def minimumTime(self, nums1: List[int], nums2: List[int], x: int) -> int:\n n = len(nums1)\n dp = [float('inf')] * (x + 1)\n dp[0] = 0\n\n for i in range(n):\n new_dp = [float('inf')] * (x + 1)\n for j in range(x + 1):\n if j - nums1[i] - 1 >= 0:\n new_dp[j] = min(new_dp[j], dp[j - nums1[i] - 1] + 1)\n if j + nums2[i] <= x:\n new_dp[j + nums2[i]] = min(new_dp[j + nums2[i]], dp[j] + 1)\n dp = new_dp\n\n return dp[-1] if dp[-1] != float('inf') else -1", "class Solution:\n def minimumTime(self, nums1: List[int], nums2: List[int], x: int) -> int:\n def can_reach(time: int) -> bool:\n sum_nums1 = sum(min(time, num1) + num2 * time for num1, num2 in zip(nums1, nums2))\n return sum_nums1 <= x\n\n left, right = 0, sum(num1 + num2 for num1, num2 in zip(nums1, nums2))\n if can_reach(right):\n return right\n\n while left < right:\n mid = left + (right - left) // 2\n if can_reach(mid):\n right = mid\n else:\n left = mid + 1\n\n return -1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countPairs(self, coordinates: List[List[int]], k: int) -> int:\n def get_distance(p1, p2):\n return (p1[0] ^ p2[0]) + (p1[1] ^ p2[1])\n\n count = 0\n for i in range(len(coordinates)):\n for j in range(i + 1, len(coordinates)):\n if get_distance(coordinates[i], coordinates[j]) == k:\n count += 1\n\n return count", "class Solution:\n def countPairs(self, coordinates: List[List[int]], k: int) -> int:\n def get_distance(p1, p2):\n return (p1[0] ^ p2[0]) + (p1[1] ^ p2[1])\n\n count = 0\n for i in range(len(coordinates)):\n for j in range(i + 1, len(coordinates)):\n if get_distance(coordinates[i], coordinates[j]) == k:\n count += 1\n\n return count", "class Solution:\n def countPairs(self, coordinates: List[List[int]], k: int) -> int:\n def get_distance(p1, p2):\n return (p1[0] ^ p2[0]) + (p1[1] ^ p2[1])\n\n def count_pairs(p, dist):\n count = 0\n distance_count = {}\n for i in range(len(p)):\n for j in range(i + 1, len(p)):\n d = get_distance(p[i], p[j])\n distance_count[d] = distance_count.get(d, 0) + 1\n return distance_count.get(dist, 0)\n\n n = len(coordinates)\n p1 = coordinates[:n // 2]\n p2 = coordinates[n // 2:]\n\n return count_pairs(p1, k) + count_pairs(p2, k) - count_pairs(coordinates, k)", "class Solution:\n def countPairs(self, coordinates: List[List[int]], k: int) -> int:\n def get_distance(p1, p2):\n return (p1[0] ^ p2[0]) + (p1[1] ^ p2[1])\n\n count = 0\n for i in range(len(coordinates)):\n for j in range(i + 1, len(coordinates)):\n if get_distance(coordinates[i], coordinates[j]) == k:\n count += 1\n\n return count", "class Solution:\n def countPairs(self, coordinates: List[List[int]], k: int) -> int:\n def get_distance(p1, p2):\n return (p1[0] ^ p2[0]) + (p1[1] ^ p2[1])\n\n count = 0\n for i in range(len(coordinates)):\n for j in range(i + 1, len(coordinates)):\n if get_distance(coordinates[i], coordinates[j]) == k:\n count += 1\n\n return count", "class Solution:\n def countPairs(self, coordinates: List[List[int]], k: int) -> int:\n def get_distance(p1, p2):\n return (p1[0] ^ p2[0]) + (p1[1] ^ p2[1])\n\n count = 0\n for i in range(len(coordinates)):\n for j in range(i + 1, len(coordinates)):\n if get_distance(coordinates[i], coordinates[j]) == k:\n count += 1\n\n return count", "class Solution:\n def countPairs(self, coordinates: List[List[int]], k: int) -> int:\n def get_distance(p1, p2):\n return (p1[0] ^ p2[0]) + (p1[1] ^ p2[1])\n\n def count_pairs(dist):\n count = 0\n for i in range(len(coordinates)):\n for j in range(i + 1, len(coordinates)):\n if get_distance(coordinates[i], coordinates[j]) == dist:\n count += 1\n return count // 2\n\n return count_pairs(k)", "class Solution:\n def countPairs(self, coordinates: List[List[int]], k: int) -> int:\n def get_distance(p1, p2):\n return (p1[0] ^ p2[0]) + (p1[1] ^ p2[1])\n\n count = 0\n for i in range(len(coordinates)):\n for j in range(i + 1, len(coordinates)):\n if get_distance(coordinates[i], coordinates[j]) == k:\n count += 1\n\n return count", "class Solution:\n def countPairs(self, coordinates: List[List[int]], k: int) -> int:\n def get_distance(pt1, pt2):\n return (pt1[0] ^ pt2[0]) + (pt1[1] ^ pt2[1])\n\n def count_pairs(dist):\n count = 0\n for i in range(len(coordinates)):\n for j in range(i + 1, len(coordinates)):\n if get_distance(coordinates[i], coordinates[j]) == dist:\n count += 1\n return count\n\n return count_pairs(k)", "class Solution:\n def countPairs(self, coordinates: List[List[int]], k: int) -> int:\n def get_distance(p1, p2):\n return (p1[0] ^ p2[0]) + (p1[1] ^ p2[1])\n\n count = 0\n for i in range(len(coordinates)):\n for j in range(i + 1, len(coordinates)):\n if get_distance(coordinates[i], coordinates[j]) == k:\n count += 1\n\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxSum(self, nums: List[int], m: int, k: int) -> int:\n n = len(nums)\n max_sum = 0\n window_sum = 0\n freq = {}\n\n for i in range(n):\n window_sum += nums[i]\n freq[nums[i]] = freq.get(nums[i], 0) + 1\n\n if i >= k:\n if len(freq) >= m:\n max_sum = max(max_sum, window_sum)\n window_sum -= nums[i - k]\n freq[nums[i - k]] -= 1\n if freq[nums[i - k]] == 0:\n del freq[nums[i - k]]\n\n return max_sum", "class Solution:\n def maxSum(self, nums: List[int], m: int, k: int) -> int:\n window_sums = []\n max_sum = 0\n window_set = set()\n window_sum = 0\n\n for i in range(len(nums)):\n window_sum += nums[i]\n window_set.add(nums[i])\n\n if i >= k:\n window_sum -= nums[i - k]\n window_set.discard(nums[i - k])\n\n if len(window_set) >= m:\n max_sum = max(max_sum, window_sum)\n\n if i >= k - 1:\n window_sums.append(window_sum)\n\n return max_sum if max_sum else 0", "class Solution:\n def maxSum(self, nums: List[int], m: int, k: int) -> int:\n n = len(nums)\n max_sum = 0\n window_sum = 0\n mp = {}\n\n for i in range(n):\n window_sum += nums[i]\n mp[nums[i]] = mp.get(nums[i], 0) + 1\n\n if i >= k:\n mp[nums[i - k]] -= 1\n if mp[nums[i - k]] == 0:\n del mp[nums[i - k]]\n\n window_sum -= nums[i - k]\n\n if i >= k - 1 and len(mp) >= m:\n max_sum = max(max_sum, window_sum)\n\n return max_sum", "class Solution:\n def maxSum(self, nums: List[int], m: int, k: int) -> int:\n window_sums = []\n max_sum = 0\n for i in range(len(nums)):\n window_sums.append(nums[i])\n if i >= k:\n window_sums.pop(0)\n if i >= k - 1:\n if len(set(window_sums)) >= m:\n max_sum = max(max_sum, sum(window_sums))\n return max_sum", "class Solution:\n def maxSum(self, nums: List[int], m: int, k: int) -> int:\n window_sums = []\n max_sum = 0\n window_sum = 0\n freq = {}\n\n for num in nums:\n window_sum += num\n freq[num] = freq.get(num, 0) + 1\n\n if len(freq) >= m:\n window_sums.append(window_sum)\n window_sum -= nums[nums.index(num)]\n del nums[nums.index(num)]\n del freq[num]\n\n if len(window_sums) >= k:\n window_sum += nums[nums.index(window_sums[0])]\n window_sum -= window_sums.pop(0)\n freq[nums[nums.index(window_sum)]] -= 1\n del nums[nums.index(window_sum)]\n\n for i in range(len(window_sums) - k + 1):\n max_sum = max(max_sum, window_sums[i] + sum(nums))\n\n return max_sum if max_sum else 0", "class Solution:\n def maxSum(self, nums: List[int], m: int, k: int) -> int:\n n = len(nums)\n max_sum = 0\n window_sum = 0\n mp = {}\n\n for i in range(n):\n window_sum += nums[i]\n mp[nums[i]] = mp.get(nums[i], 0) + 1\n\n if i >= k:\n mp[nums[i - k]] -= 1\n if mp[nums[i - k]] == 0:\n del mp[nums[i - k]]\n\n window_sum -= nums[i - k]\n\n if i >= k - 1 and len(mp) >= m:\n max_sum = max(max_sum, window_sum)\n\n return max_sum", "class Solution:\n def maxSum(self, nums: List[int], m: int, k: int) -> int:\n n = len(nums)\n max_sum = 0\n window_sum = 0\n mp = {}\n\n for i in range(n):\n window_sum += nums[i]\n mp[nums[i]] = mp.get(nums[i], 0) + 1\n\n if i >= k:\n mp[nums[i - k]] -= 1\n if mp[nums[i - k]] == 0:\n del mp[nums[i - k]]\n\n window_sum -= nums[i - k]\n\n if i >= k - 1:\n if len(mp) >= m:\n max_sum = max(max_sum, window_sum)\n\n return max_sum", "class Solution:\n def maxSum(self, nums: List[int], m: int, k: int) -> int:\n window_sums = []\n max_sum = 0\n window_sum = 0\n mp = {}\n\n for i in range(len(nums)):\n window_sum += nums[i]\n if nums[i] not in mp:\n mp[nums[i]] = 1\n else:\n mp[nums[i]] += 1\n\n if i >= k:\n if len(mp) >= m:\n max_sum = max(max_sum, window_sum)\n window_sum -= nums[i - k]\n mp[nums[i - k]] -= 1\n if mp[nums[i - k]] == 0:\n del mp[nums[i - k]]\n\n return max_sum", "class Solution:\n def maxSum(self, nums: List[int], m: int, k: int) -> int:\n n = len(nums)\n max_sum = 0\n window_sum = 0\n mp = {}\n\n for i in range(n):\n window_sum += nums[i]\n mp[nums[i]] = mp.get(nums[i], 0) + 1\n\n if i >= k:\n mp[nums[i - k]] -= 1\n if mp[nums[i - k]] == 0:\n del mp[nums[i - k]]\n\n window_sum -= nums[i - k]\n\n if i >= k - 1:\n if len(mp) >= m:\n max_sum = max(max_sum, window_sum)\n\n return max_sum", "class Solution:\n def maxSum(self, nums: List[int], m: int, k: int) -> int:\n window_sums = []\n max_sum = 0\n window_set = set()\n window_sum = 0\n\n for i in range(len(nums)):\n window_sum += nums[i]\n window_set.add(nums[i])\n\n if i >= k:\n window_sum -= nums[i - k]\n window_set.discard(nums[i - k])\n\n if len(window_set) >= m:\n window_sums.append(window_sum)\n\n if i >= k - 1:\n max_sum = max(max_sum, window_sum)\n\n return max_sum if window_sums else 0" ], "pass1_list": [ false, true, true, false, false, true, true, false, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def accountBalanceAfterPurchase(self, purchaseAmount: int) -> int:\n rounded_amount = purchaseAmount // 10 * 10\n if purchaseAmount % 10 >= 5:\n rounded_amount += 10\n return 100 - rounded_amount", "class Solution:\n def accountBalanceAfterPurchase(self, purchaseAmount: int) -> int:\n rounded_amount = purchaseAmount // 10 * 10\n if purchaseAmount % 10 >= 5:\n rounded_amount += 10\n return 100 - rounded_amount", "class Solution:\n def accountBalanceAfterPurchase(self, purchaseAmount: int) -> int:\n rounded_amount = purchaseAmount // 10 * 10\n if purchaseAmount % 10 >= 5:\n rounded_amount += 10\n return 100 - rounded_amount", "class Solution:\n def accountBalanceAfterPurchase(self, purchaseAmount: int) -> int:\n rounded_amount = purchaseAmount // 10 * 10\n if purchaseAmount % 10 >= 5:\n rounded_amount += 10\n return 100 - rounded_amount", "class Solution:\n def accountBalanceAfterPurchase(self, purchaseAmount: int) -> int:\n rounded_amount = purchaseAmount // 10 * 10\n if purchaseAmount % 10 >= 5:\n rounded_amount += 10\n return 100 - rounded_amount", "class Solution:\n def accountBalanceAfterPurchase(self, purchaseAmount: int) -> int:\n rounded_amount = purchaseAmount // 10 * 10\n if purchaseAmount % 10 >= 5:\n rounded_amount += 10\n return 100 - rounded_amount", "class Solution:\n def accountBalanceAfterPurchase(self, purchaseAmount: int) -> int:\n rounded_amount = purchaseAmount // 10 * 10\n if purchaseAmount % 10 >= 5:\n rounded_amount += 10\n return 100 - rounded_amount", "class Solution:\n def accountBalanceAfterPurchase(self, purchaseAmount: int) -> int:\n rounded_amount = purchaseAmount // 10 * 10\n if purchaseAmount % 10 >= 5:\n rounded_amount += 10\n return 100 - rounded_amount", "class Solution:\n def accountBalanceAfterPurchase(self, purchaseAmount: int) -> int:\n rounded_amount = purchaseAmount // 10 * 10\n if purchaseAmount % 10 >= 5:\n rounded_amount += 10\n return 100 - rounded_amount", "class Solution:\n def accountBalanceAfterPurchase(self, purchaseAmount: int) -> int:\n rounded_amount = purchaseAmount // 10 * 10\n if purchaseAmount % 10 >= 5:\n rounded_amount += 10\n return 100 - rounded_amount" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def isAcronym(self, words: List[str], s: str) -> bool:\n acronym = \"\"\n for word in words:\n acronym += word[0]\n return acronym == s", "class Solution:\n def isAcronym(self, words: List[str], s: str) -> bool:\n acronym = \"\".join(word[0] for word in words)\n return acronym == s", "class Solution:\n def isAcronym(self, words: List[str], s: str) -> bool:\n acronym = \"\"\n for word in words:\n acronym += word[0]\n return acronym == s", "class Solution:\n def isAcronym(self, words: List[str], s: str) -> bool:\n acronym = \"\".join(word[0] for word in words)\n return acronym == s", "class Solution:\n def isAcronym(self, words: List[str], s: str) -> bool:\n acronym = \"\"\n for word in words:\n acronym += word[0]\n return acronym == s", "class Solution:\n def isAcronym(self, words: List[str], s: str) -> bool:\n acronym = \"\"\n for word in words:\n acronym += word[0]\n return acronym == s", "class Solution:\n def isAcronym(self, words: List[str], s: str) -> bool:\n acronym = \"\"\n for word in words:\n acronym += word[0]\n return acronym == s", "class Solution:\n def isAcronym(self, words: List[str], s: str) -> bool:\n acronym = \"\".join(word[0] for word in words)\n return acronym == s", "class Solution:\n def isAcronym(self, words: List[str], s: str) -> bool:\n acronym = \"\".join(word[0] for word in words)\n return acronym == s", "class Solution:\n def isAcronym(self, words: List[str], s: str) -> bool:\n acronym = \"\".join(word[0] for word in words)\n return acronym == s" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximizeTheProfit(self, n: int, offers: List[List[int]]) -> int:\n offers.sort(key=lambda x: (x[1], -x[2]))\n dp = [0] * n\n for start, end, gold in offers:\n for i in range(start, end + 1):\n dp[i] = max(dp[i], dp[start - 1] + gold)\n return max(dp)", "class Solution:\n def maximizeTheProfit(self, n: int, offers: List[List[int]]) -> int:\n offers.sort(key=lambda x: x[1], reverse=True)\n dp = [0] * n\n for start, end, gold in offers:\n for i in range(start, end + 1):\n dp[i] = max(dp[i], dp[start - 1] + gold)\n return max(dp)", "class Solution:\n def maximizeTheProfit(self, n: int, offers: List[List[int]]) -> int:\n offers.sort(key=lambda x: x[1], reverse=True)\n dp = [0] * n\n for start, end, gold in offers:\n for i in range(start, end + 1):\n dp[i] = max(dp[i], dp[start - 1] + gold)\n return max(dp)", "class Solution:\n def maximizeTheProfit(self, n: int, offers: List[List[int]]) -> int:\n offers.sort(key=lambda x: x[1], reverse=True)\n dp = [0] * n\n for start, end, gold in offers:\n for i in range(start, end + 1):\n dp[i] = max(dp[i], dp[start - 1] + gold)\n return max(dp)", "class Solution:\n def maximizeTheProfit(self, n: int, offers: List[List[int]]) -> int:\n offers.sort(key=lambda x: (x[1], -x[2]))\n dp = [0] * n\n for start, end, gold in offers:\n for i in range(start, end + 1):\n dp[i] = max(dp[i], dp[start - 1] + gold)\n return max(dp)", "class Solution:\n def maximizeTheProfit(self, n: int, offers: List[List[int]]) -> int:\n offers.sort(key=lambda x: (x[1], -x[2]))\n dp = [0] * n\n for start, end, gold in offers:\n for i in range(start, end + 1):\n dp[i] = max(dp[i], dp[start - 1] + gold)\n return max(dp)", "class Solution:\n def maximizeTheProfit(self, n: int, offers: List[List[int]]) -> int:\n offers.sort(key=lambda x: (x[1], -x[2]))\n dp = [0] * n\n for start, end, gold in offers:\n for i in range(start, end + 1):\n dp[i] = max(dp[i], (gold if i == start else dp[i] + gold))\n return max(dp)", "class Solution:\n def maximizeTheProfit(self, n: int, offers: List[List[int]]) -> int:\n offers.sort(key=lambda x: (x[1], -x[2]))\n dp = [0] * n\n for start, end, gold in offers:\n dp[end] = max(dp[end], dp[start] + gold)\n return max(dp)", "class Solution:\n def maximizeTheProfit(self, n: int, offers: List[List[int]]) -> int:\n offers.sort(key=lambda x: (x[1], -x[2]))\n dp = [0] * n\n for start, end, gold in offers:\n for i in range(start, end + 1):\n dp[i] = max(dp[i], dp[start - 1] + gold)\n return max(dp)", "class Solution:\n def maximizeTheProfit(self, n: int, offers: List[List[int]]) -> int:\n offers.sort(key=lambda x: (x[1], -x[2]))\n dp = [0] * n\n for start, end, gold in offers:\n for i in range(start, end + 1):\n dp[i] = max(dp[i], dp[start - 1] + gold)\n return max(dp)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countSymmetricIntegers(self, low: int, high: int) -> int:\n count = 0\n for i in range(low, high + 1):\n n = len(str(i))\n if n % 2 != 0:\n continue\n first_half = int(str(i)[:n // 2])\n second_half = int(str(i)[n // 2:])\n if first_half + second_half == i:\n count += 1\n return count", "class Solution:\n def countSymmetricIntegers(self, low: int, high: int) -> int:\n count = 0\n for i in range(low, high + 1):\n n = len(str(i))\n if n % 2 != 0:\n continue\n first_half = int(str(i)[:n // 2])\n second_half = int(str(i)[n // 2:])\n if first_half + second_half == i:\n count += 1\n return count", "class Solution:\n def countSymmetricIntegers(self, low: int, high: int) -> int:\n count = 0\n for i in range(low, high + 1):\n n = len(str(i))\n if n % 2 != 0:\n continue\n first_half = int(str(i)[:n // 2])\n second_half = int(str(i)[n // 2:])\n if first_half + second_half == i:\n count += 1\n return count", "class Solution:\n def countSymmetricIntegers(self, low: int, high: int) -> int:\n count = 0\n for i in range(low, high + 1):\n n = len(str(i))\n if n % 2 != 0:\n continue\n first_half = int(str(i)[:n // 2])\n second_half = int(str(i)[n // 2:])\n if first_half + second_half == i:\n count += 1\n return count", "class Solution:\n def countSymmetricIntegers(self, low: int, high: int) -> int:\n count = 0\n for i in range(low, high + 1):\n n = len(str(i))\n if n % 2 != 0:\n continue\n first_half = int(str(i)[:n // 2])\n second_half = int(str(i)[n // 2:])\n if first_half + second_half == i:\n count += 1\n return count", "class Solution:\n def countSymmetricIntegers(self, low: int, high: int) -> int:\n count = 0\n for i in range(low, high + 1):\n n = len(str(i))\n if n % 2 != 0:\n continue\n first_half = int(str(i)[:n // 2])\n second_half = int(str(i)[n // 2:])\n if first_half + second_half == i:\n count += 1\n return count", "class Solution:\n def countSymmetricIntegers(self, low: int, high: int) -> int:\n count = 0\n for i in range(low, high + 1):\n n = len(str(i))\n if n % 2 != 0:\n continue\n first_half = int(str(i)[:n // 2])\n second_half = int(str(i)[n // 2:])\n if first_half + second_half == i:\n count += 1\n return count", "class Solution:\n def countSymmetricIntegers(self, low: int, high: int) -> int:\n count = 0\n for i in range(low, high + 1):\n n = len(str(i))\n if n % 2 != 0:\n continue\n first_half = int(str(i)[:n // 2])\n second_half = int(str(i)[n // 2:])\n if first_half + second_half == i:\n count += 1\n return count", "class Solution:\n def countSymmetricIntegers(self, low: int, high: int) -> int:\n count = 0\n for i in range(low, high + 1):\n n = len(str(i))\n if n % 2 != 0:\n continue\n first_half = int(str(i)[:n // 2])\n second_half = int(str(i)[n // 2:])\n if first_half + second_half == i:\n count += 1\n return count", "class Solution:\n def countSymmetricIntegers(self, low: int, high: int) -> int:\n count = 0\n for i in range(low, high + 1):\n n = len(str(i))\n if n % 2 != 0:\n continue\n first_half = int(str(i)[:n // 2])\n second_half = int(str(i)[n // 2:])\n if first_half + second_half == i:\n count += 1\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def canBeEqual(self, s1: str, s2: str) -> bool:\n s1_pairs = [s1[i:i + 2] for i in range(0, len(s1), 2)]\n s2_pairs = [s2[i:i + 2] for i in range(0, len(s2), 2)]\n s1_pairs.sort()\n s2_pairs.sort()\n return s1_pairs == s2_pairs", "class Solution:\n def canBeEqual(self, s1: str, s2: str) -> bool:\n s1 = list(s1)\n s2 = list(s2)\n\n for i in range(0, 4, 2):\n s1[i], s1[i + 1] = s1[i + 1], s1[i]\n\n for i in range(0, 4, 2):\n s2[i], s2[i + 1] = s2[i + 1], s2[i]\n\n return s1 == s2", "class Solution:\n def canBeEqual(self, s1: str, s2: str) -> bool:\n s1_freq = [0] * 26\n s2_freq = [0] * 26\n\n for i in range(4):\n if i % 2 == 0:\n s1_freq[ord(s1[i]) - ord('a')] += 1\n s2_freq[ord(s2[i]) - ord('a')] += 1\n else:\n s1_freq[ord(s1[i]) - ord('a')] -= 1\n s2_freq[ord(s2[i]) - ord('a')] -= 1\n\n return s1_freq == s2_freq", "class Solution:\n def canBeEqual(self, s1: str, s2: str) -> bool:\n s1_freq = [0] * 26\n s2_freq = [0] * 26\n \n for i in range(4):\n if i % 2 == 0:\n s1_freq[ord(s1[i]) - ord('a')] += 1\n s2_freq[ord(s2[i]) - ord('a')] += 1\n else:\n s1_freq[ord(s1[i]) - ord('a')] -= 1\n s2_freq[ord(s2[i]) - ord('a')] -= 1\n \n return s1_freq == s2_freq", "class Solution:\n def canBeEqual(self, s1: str, s2: str) -> bool:\n s1_freq = [0] * 26\n s2_freq = [0] * 26\n\n for i in range(4):\n if i % 2 == 0:\n s1_freq[ord(s1[i]) - ord('a')] += 1\n s2_freq[ord(s2[i]) - ord('a')] += 1\n else:\n s1_freq[ord(s1[i]) - ord('a')] -= 1\n s2_freq[ord(s2[i]) - ord('a')] -= 1\n\n return s1_freq == s2_freq", "class Solution:\n def canBeEqual(self, s1: str, s2: str) -> bool:\n s1_pairs = [s1[i:i + 2] for i in range(0, len(s1), 2)]\n s2_pairs = [s2[i:i + 2] for i in range(0, len(s2), 2)]\n s1_pairs.sort()\n s2_pairs.sort()\n return s1_pairs == s2_pairs", "class Solution:\n def canBeEqual(self, s1: str, s2: str) -> bool:\n s1_pairs = [s1[i:i + 2] for i in range(0, len(s1), 2)]\n s2_pairs = [s2[i:i + 2] for i in range(0, len(s2), 2)]\n s1_pairs.sort()\n s2_pairs.sort()\n return s1_pairs == s2_pairs", "class Solution:\n def canBeEqual(self, s1: str, s2: str) -> bool:\n s1_freq = [0] * 26\n s2_freq = [0] * 26\n\n for i in range(4):\n if i % 2 == 0:\n s1_freq[ord(s1[i]) - ord('a')] += 1\n s2_freq[ord(s2[i]) - ord('a')] += 1\n else:\n s1_freq[ord(s1[i]) - ord('a')] -= 1\n s2_freq[ord(s2[i]) - ord('a')] -= 1\n\n return s1_freq == s2_freq", "class Solution:\n def canBeEqual(self, s1: str, s2: str) -> bool:\n s1_freq = [0] * 26\n s2_freq = [0] * 26\n\n for i in range(4):\n if i % 2 == 0:\n s1_freq[ord(s1[i]) - ord('a')] += 1\n s2_freq[ord(s2[i]) - ord('a')] += 1\n else:\n s1_freq[ord(s1[i]) - ord('a')] -= 1\n s2_freq[ord(s2[i]) - ord('a')] -= 1\n\n return s1_freq == s2_freq", "class Solution:\n def canBeEqual(self, s1: str, s2: str) -> bool:\n s1_freq = [0] * 26\n s2_freq = [0] * 26\n\n for i in range(4):\n if i % 2 == 0:\n s1_freq[ord(s1[i]) - ord('a')] += 1\n s2_freq[ord(s2[i]) - ord('a')] += 1\n else:\n s1_freq[ord(s1[i]) - ord('a')] -= 1\n s2_freq[ord(s2[i]) - ord('a')] -= 1\n\n return s1_freq == s2_freq" ], "pass1_list": [ false, false, true, true, true, false, false, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minAbsoluteDifference(self, nums: List[int], x: int) -> int:\n n = len(nums)\n result = float('inf')\n for i in range(n):\n for j in range(i + x, n):\n result = min(result, abs(nums[i] - nums[j]))\n return result", "class Solution:\n def minAbsoluteDifference(self, nums: List[int], x: int) -> int:\n n = len(nums)\n result = float('inf')\n\n for i in range(n):\n for j in range(i + x, n):\n result = min(result, abs(nums[i] - nums[j]))\n\n return result if result < float('inf') else 0", "class Solution:\n def minAbsoluteDifference(self, nums: List[int], x: int) -> int:\n n = len(nums)\n result = float('inf')\n\n for i in range(n):\n for j in range(i + x, n):\n result = min(result, abs(nums[i] - nums[j]))\n\n return result if result < float('inf') else 0", "class Solution:\n def minAbsoluteDifference(self, nums: List[int], x: int) -> int:\n n = len(nums)\n result = float('inf')\n\n for i in range(n):\n for j in range(i + x, n):\n result = min(result, abs(nums[i] - nums[j]))\n\n return result if result < float('inf') else 0", "class Solution:\n def minAbsoluteDifference(self, nums: List[int], x: int) -> int:\n n = len(nums)\n result = float('inf')\n\n for i in range(n):\n for j in range(i + x, n):\n result = min(result, abs(nums[i] - nums[j]))\n\n return result if result < float('inf') else 0", "class Solution:\n def minAbsoluteDifference(self, nums: List[int], x: int) -> int:\n n = len(nums)\n result = float('inf')\n for i in range(n):\n for j in range(i + x, n):\n result = min(result, abs(nums[i] - nums[j]))\n return result", "class Solution:\n def minAbsoluteDifference(self, nums: List[int], x: int) -> int:\n n = len(nums)\n result = float('inf')\n\n for i in range(n):\n for j in range(i + x, n):\n result = min(result, abs(nums[i] - nums[j]))\n\n return result if result < float('inf') else 0", "class Solution:\n def minAbsoluteDifference(self, nums: List[int], x: int) -> int:\n n = len(nums)\n result = float('inf')\n\n for i in range(n):\n for j in range(i + x, n):\n result = min(result, abs(nums[i] - nums[j]))\n\n return result if result < float('inf') else 0", "class Solution:\n def minAbsoluteDifference(self, nums: List[int], x: int) -> int:\n n = len(nums)\n window = sorted(nums[:x])\n min_diff = float('inf')\n for i in range(x, n):\n while window and window[0] < nums[i]:\n window.pop(0)\n if window:\n min_diff = min(min_diff, nums[i] - window[0])\n window.append(nums[i])\n if i >= x:\n window.pop(0)\n return min_diff if min_diff != float('inf') else -1", "class Solution:\n def minAbsoluteDifference(self, nums: List[int], x: int) -> int:\n n = len(nums)\n result = float('inf')\n\n for i in range(n):\n for j in range(i + x, n):\n result = min(result, abs(nums[i] - nums[j]))\n\n return result if result < float('inf') else 0" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberOfBeautifulIntegers(self, low: int, high: int, k: int) -> int:\n def is_beautiful(n, k):\n digit_sum = 0\n divisor_sum = 0\n while n > 0:\n digit = n % 10\n if digit % 2 == 0:\n digit_sum += 1\n else:\n divisor_sum += 1\n n //= 10\n return digit_sum == divisor_sum and n % k == 0\n\n count = 0\n for i in range(low, high + 1):\n if is_beautiful(i, k):\n count += 1\n return count", "class Solution:\n def numberOfBeautifulIntegers(self, low: int, high: int, k: int) -> int:\n def is_beautiful(n, k):\n digit_sum = 0\n evens = 0\n while n > 0:\n digit = n % 10\n if digit % 2 == 0:\n evens += 1\n digit_sum += 1\n n //= 10\n return n % k == 0 and digit_sum % 2 == 0 and evens == (digit_sum - evens)\n\n count = 0\n for i in range(low, high + 1):\n if is_beautiful(i, k):\n count += 1\n return count", "class Solution:\n def numberOfBeautifulIntegers(self, low: int, high: int, k: int) -> int:\n def is_beautiful(n, k):\n digit_sum = 0\n evens = 0\n while n > 0:\n digit = n % 10\n if digit % 2 == 0:\n evens += 1\n digit_sum += 1\n n //= 10\n return n % k == 0 and digit_sum % 2 == 0 and evens == (digit_sum - evens)\n\n count = 0\n for i in range(low, high + 1):\n if is_beautiful(i, k):\n count += 1\n return count", "class Solution:\n def numberOfBeautifulIntegers(self, low: int, high: int, k: int) -> int:\n def is_beautiful(n, k):\n digit_sum = 0\n evens = 0\n while n > 0:\n digit = n % 10\n if digit % 2 == 0:\n evens += 1\n digit_sum += 1\n n //= 10\n return n % k == 0 and digit_sum % 2 == 0 and evens == (digit_sum - evens)\n\n count = 0\n for i in range(low, high + 1):\n if is_beautiful(i, k):\n count += 1\n return count", "class Solution:\n def numberOfBeautifulIntegers(self, low: int, high: int, k: int) -> int:\n def is_beautiful(n: int, k: int) -> bool:\n if n % k != 0:\n return False\n str_n = str(n)\n even_count = sum(int(digit) % 2 == 0 for digit in str_n)\n odd_count = sum(int(digit) % 2 != 0 for digit in str_n)\n return even_count == odd_count\n\n count = 0\n for i in range(low, high + 1):\n if is_beautiful(i, k):\n count += 1\n return count", "class Solution:\n def numberOfBeautifulIntegers(self, low: int, high: int, k: int) -> int:\n def is_beautiful(n: int, k: int) -> bool:\n digit_sum = 0\n divisor_sum = 0\n\n while n > 0:\n digit = n % 10\n divisor_sum += digit\n if digit % 2 == 0:\n digit_sum += 1\n n //= 10\n\n return divisor_sum % k == 0 and digit_sum % 2 == 0\n\n count = 0\n for i in range(low, high + 1):\n if is_beautiful(i, k):\n count += 1\n\n return count", "class Solution:\n def numberOfBeautifulIntegers(self, low: int, high: int, k: int) -> int:\n def is_beautiful(n: int, k: int) -> bool:\n # Check if the number of even and odd digits are equal\n even_count = sum(1 for digit in str(n) if int(digit) % 2 == 0)\n odd_count = len(str(n)) - even_count\n if even_count != odd_count:\n return False\n # Check if the number is divisible by k\n if n % k != 0:\n return False\n return True\n\n count = 0\n for i in range(low, high + 1):\n if is_beautiful(i, k):\n count += 1\n return count", "class Solution:\n def numberOfBeautifulIntegers(self, low: int, high: int, k: int) -> int:\n def is_beautiful(n, k):\n digit_sum = 0\n evens = 0\n while n > 0:\n digit = n % 10\n if digit % 2 == 0:\n evens += 1\n digit_sum += 1\n n //= 10\n return n % k == 0 and digit_sum % 2 == 0 and evens == (digit_sum - evens)\n\n count = 0\n for i in range(low, high + 1):\n if is_beautiful(i, k):\n count += 1\n return count", "class Solution:\n def numberOfBeautifulIntegers(self, low: int, high: int, k: int) -> int:\n def is_beautiful(n, k):\n digit_sum = 0\n even_count = 0\n while n > 0:\n digit = n % 10\n if digit % 2 == 0:\n even_count += 1\n digit_sum += 1 if digit % 2 == 0 else -1\n n //= 10\n return digit_sum == 0 and n % k == 0\n\n count = 0\n for i in range(low, high + 1):\n if is_beautiful(i, k):\n count += 1\n return count", "class Solution:\n def numberOfBeautifulIntegers(self, low: int, high: int, k: int) -> int:\n def is_beautiful(n: int, k: int) -> bool:\n # Check if the number of even and odd digits are equal\n even_count = sum(1 for digit in str(n) if int(digit) % 2 == 0)\n odd_count = len(str(n)) - even_count\n if even_count != odd_count:\n return False\n # Check if the number is divisible by k\n if n % k != 0:\n return False\n return True\n\n count = 0\n for i in range(low, high + 1):\n if is_beautiful(i, k):\n count += 1\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def canMakeSubsequence(self, str1: str, str2: str) -> bool:\n i, j = 0, 0\n str1_next = [chr((ord(ch) - ord('a') + 1) % 26 + ord('a')) for ch in str1]\n while i < len(str1) and j < len(str2):\n if str1[i] == str2[j]:\n j += 1\n i += 1\n return j == len(str2) or (i < len(str1) and j == len(str2) - 1 and str1_next[i] == str2[-1])", "class Solution:\n def canMakeSubsequence(self, str1: str, str2: str) -> bool:\n i, j = 0, 0\n str1_next = [chr((ord(ch) - ord('a') + 1) % 26 + ord('a')) for ch in str1]\n while i < len(str1) and j < len(str2):\n if str1[i] == str2[j]:\n j += 1\n i += 1\n return j == len(str2) or (i < len(str1) and j == len(str2) - 1 and str1_next[i] == str2[-1])", "class Solution:\n def canMakeSubsequence(self, str1: str, str2: str) -> bool:\n i, j = 0, 0\n str1_next = [ord(ch) + 1 for ch in str1]\n while i < len(str1) and j < len(str2):\n if str1[i] == str2[j]:\n j += 1\n elif str1_next[i] == ord(str2[j]):\n i += 1\n j += 1\n i += 1\n return j == len(str2)", "class Solution:\n def canMakeSubsequence(self, str1: str, str2: str) -> bool:\n str1_idx, str2_idx = 0, 0\n str1_increment = False\n\n while str1_idx < len(str1) and str2_idx < len(str2):\n if str1[str1_idx] == str2[str2_idx]:\n str2_idx += 1\n elif str1[str1_idx] > str2[str2_idx]:\n if str1_increment:\n return False\n str1_increment = True\n str1_idx = max(str1_idx, str2_idx)\n str1_idx += 1\n\n return str2_idx == len(str2)", "class Solution:\n def canMakeSubsequence(self, str1: str, str2: str) -> bool:\n i, j = 0, 0\n str1_incremented = False\n\n while i < len(str1) and j < len(str2):\n if str1[i] == str2[j]:\n j += 1\n elif str1[i] < str2[j]:\n if not str1_incremented and i + 1 < len(str1) and str1[i + 1] == str2[j]:\n str1_incremented = True\n i += 1\n else:\n return False\n elif str1[i] > str2[j]:\n if not str1_incremented:\n i = 0\n str1_incremented = True\n else:\n return False\n\n return j == len(str2)", "class Solution:\n def canMakeSubsequence(self, str1: str, str2: str) -> bool:\n str1_dict = {}\n for c in str1:\n if c not in str1_dict:\n str1_dict[c] = 1\n else:\n str1_dict[c] += 1\n \n str2_dict = {}\n for c in str2:\n if c not in str2_dict:\n str2_dict[c] = 1\n else:\n str2_dict[c] += 1\n \n for c in str2:\n if c not in str1_dict or str1_dict[c] < str2_dict[c]:\n return False\n str1_dict[c] -= 1\n \n return True", "class Solution:\n def canMakeSubsequence(self, str1: str, str2: str) -> bool:\n str1_next = [chr((ord(ch) - ord('a') + 1) % 26 + ord('a')) for ch in str1]\n str1_double_next = [chr((ord(ch) - ord('a') + 2) % 26 + ord('a')) for ch in str1]\n\n i, j, k = 0, 0, 0\n while i < len(str1) and j < len(str2):\n if str1[i] == str2[j]:\n j += 1\n elif str1_next[i] == str2[j]:\n k = 1\n j += 1\n elif str1_double_next[i] == str2[j]:\n if k == 1:\n return False\n else:\n k = 1\n j += 1\n i += 1\n\n return j == len(str2)", "class Solution:\n def canMakeSubsequence(self, str1: str, str2: str) -> bool:\n str1_idx, str2_idx = 0, 0\n str1_incremented = False\n\n while str1_idx < len(str1) and str2_idx < len(str2):\n if str1[str1_idx] == str2[str2_idx]:\n str2_idx += 1\n elif str1[str1_idx] < str2[str2_idx]:\n if str1_incremented:\n return False\n str1_incremented = True\n str1_idx = max(str1_idx, str2_idx)\n str1_idx += 1\n\n return str2_idx == len(str2)", "class Solution:\n def canMakeSubsequence(self, str1: str, str2: str) -> bool:\n str1_dict = {}\n for c in str1:\n if c not in str1_dict:\n str1_dict[c] = 1\n else:\n str1_dict[c] += 1\n\n str2_dict = {}\n for c in str2:\n if c not in str2_dict:\n str2_dict[c] = 1\n else:\n str2_dict[c] += 1\n\n for c in str2:\n if c not in str1_dict or str1_dict[c] < str2_dict[c]:\n return False\n str1_dict[c] -= 1\n\n return True", "class Solution:\n def canMakeSubsequence(self, str1: str, str2: str) -> bool:\n str1_dict = {}\n for c in str1:\n if c not in str1_dict:\n str1_dict[c] = 1\n else:\n str1_dict[c] += 1\n \n for c in str2:\n if c not in str1_dict or str1_dict[c] == 0:\n if ord(c) == ord(str1[-1]) + 1 or str1_dict.get(chr((ord(c) - 1) % 26), 0) == 0:\n return False\n str1_dict[chr((ord(c) - 1) % 26)] -= 1\n else:\n str1_dict[c] -= 1\n \n return True" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def furthestDistanceFromOrigin(self, moves: str) -> int:\n max_distance = 0\n current_position = 0\n\n for move in moves:\n if move == 'R':\n current_position += 1\n elif move == 'L':\n current_position -= 1\n else:\n current_position = max(current_position + 1, current_position - 1)\n\n max_distance = max(max_distance, abs(current_position))\n\n return max_distance", "class Solution:\n def furthestDistanceFromOrigin(self, moves: str) -> int:\n max_distance = 0\n left, right = 0, 0\n \n for move in moves:\n if move == 'L':\n left += 1\n elif move == 'R':\n right += 1\n else:\n left, right = right, left\n \n max_distance = max(max_distance, abs(left - right))\n \n return max_distance", "class Solution:\n def furthestDistanceFromOrigin(self, moves: str) -> int:\n max_distance = 0\n current_distance = 0\n\n for move in moves:\n if move == 'R':\n current_distance += 1\n elif move == 'L':\n current_distance -= 1\n max_distance = max(max_distance, current_distance)\n\n return max_distance", "class Solution:\n def furthestDistanceFromOrigin(self, moves: str) -> int:\n max_distance = 0\n current_distance = 0\n\n for move in moves:\n if move == 'L':\n current_distance -= 1\n elif move == 'R':\n current_distance += 1\n max_distance = max(max_distance, abs(current_distance))\n\n return max_distance", "class Solution:\n def furthestDistanceFromOrigin(self, moves: str) -> int:\n max_distance = 0\n current_distance = 0\n\n for move in moves:\n if move == 'R':\n current_distance += 1\n elif move == 'L':\n current_distance -= 1\n else:\n current_distance = max(current_distance + 1, current_distance - 1)\n\n max_distance = max(max_distance, abs(current_distance))\n\n return max_distance", "class Solution:\n def furthestDistanceFromOrigin(self, moves: str) -> int:\n max_distance, current_distance = 0, 0\n\n for move in moves:\n if move == 'R':\n current_distance += 1\n elif move == 'L':\n current_distance -= 1\n else:\n current_distance = max(current_distance + 1, current_distance - 1)\n\n max_distance = max(max_distance, current_distance)\n\n return max_distance", "class Solution:\n def furthestDistanceFromOrigin(self, moves: str) -> int:\n max_distance, current_distance = 0, 0\n\n for move in moves:\n if move == 'R':\n current_distance += 1\n elif move == 'L':\n current_distance -= 1\n else:\n current_distance = max(current_distance + 1, current_distance - 1)\n\n max_distance = max(max_distance, current_distance)\n\n return max_distance", "class Solution:\n def furthestDistanceFromOrigin(self, moves: str) -> int:\n max_distance = 0\n current_distance = 0\n\n for move in moves:\n if move == 'L':\n current_distance -= 1\n elif move == 'R':\n current_distance += 1\n max_distance = max(max_distance, current_distance)\n\n return max_distance", "class Solution:\n def furthestDistanceFromOrigin(self, moves: str) -> int:\n max_distance = 0\n current_distance = 0\n\n for move in moves:\n if move == 'L':\n current_distance -= 1\n elif move == 'R':\n current_distance += 1\n else:\n current_distance = max(current_distance - 1, 0)\n\n max_distance = max(max_distance, abs(current_distance))\n\n return max_distance", "class Solution:\n def furthestDistanceFromOrigin(self, moves: str) -> int:\n max_distance, current_distance = 0, 0\n \n for move in moves:\n if move == 'L':\n current_distance -= 1\n elif move == 'R':\n current_distance += 1\n \n max_distance = max(max_distance, abs(current_distance))\n \n return max_distance" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberOfWays(self, s: str, t: str, k: int) -> int:\n n = len(s)\n MOD = 10**9 + 7\n\n # Compute the longest common prefix (LCP) of s and t\n lcp = 0\n for i in range(n):\n if s[i] == t[i]:\n lcp += 1\n else:\n break\n\n # Compute the number of distinct substrings of length LCP in s\n freq = [0] * 26\n for i in range(lcp):\n freq[ord(s[i]) - ord('a')] += 1\n distinct = sum(1 for f in freq if f == 1)\n\n # Compute the number of ways to move the LCP substring to the front in k moves\n if k == 1:\n return distinct\n else:\n return distinct * (k - 1) % MOD", "class Solution:\n def numberOfWays(self, s: str, t: str, k: int) -> int:\n n = len(s)\n MOD = 10**9 + 7\n\n # Compute the prefix and suffix of s and t\n pref_s = [s[i] for i in range(n)]\n suff_s = [s[-i - 1] for i in range(n)]\n pref_t = [t[i] for i in range(n)]\n suff_t = [t[-i - 1] for i in range(n)]\n\n # Compute the longest common prefix and suffix\n lcp = sum(a == b for a, b in zip(pref_s, pref_t))\n lcs = sum(a == b for a, b in zip(suff_s, suff_t))\n\n # Compute the number of distinct substrings of s\n distinct_substrings = sum(1 for i in range(n) if pref_s[i] != suff_s[n - i - 1])\n\n # Compute the number of ways to transform s into t in exactly k operations\n if k > distinct_substrings:\n return 0\n if k == 1:\n return (n - lcp) * (n - lcs) % MOD\n return (n - lcp) * (n - lcs) * pow(distinct_substrings - 1, k - 2, MOD) % MOD", "class Solution:\n def numberOfWays(self, s: str, t: str, k: int) -> int:\n n = len(s)\n MOD = 10**9 + 7\n\n # Compute the longest common prefix (LCP) of s and t\n lcp = 0\n for i in range(n):\n if s[i] == t[i]:\n lcp += 1\n else:\n break\n\n # Compute the length of the suffix of s that needs to be moved to the start\n move = n - lcp\n\n # Compute the number of ways to move the suffix of length 'move' to the start in 'k' operations\n if k == 1:\n return (move - 1) % MOD\n else:\n return (pow(move, k - 1, MOD) * (move - 1) % MOD) % MOD", "class Solution:\n def numberOfWays(self, s: str, t: str, k: int) -> int:\n n = len(s)\n MOD = 10**9 + 7\n\n # Compute the longest common prefix (LCP) of s and t\n lcp = 0\n for i in range(n):\n if s[i] == t[i]:\n lcp += 1\n else:\n break\n\n # Compute the length of the suffix of s that is the same as the prefix of t\n suffix_len = 0\n for i in range(n - lcp, n):\n if s[i] == t[0]:\n suffix_len += 1\n else:\n break\n\n # Compute the number of ways to move the suffix to the beginning in exactly k operations\n if suffix_len == 0:\n return (k - 1) % MOD if n == lcp else 0\n\n total_moves = (n - suffix_len) * k\n ways = 0\n for i in range(1, suffix_len + 1):\n if total_moves % i == 0 and total_moves // i <= n - lcp:\n ways += 1\n\n return ways % MOD", "class Solution:\n def numberOfWays(self, s: str, t: str, k: int) -> int:\n n = len(s)\n MOD = 10**9 + 7\n\n # Compute the cyclic shift needed to transform s into t\n shift = 0\n for i in range(n):\n if s[i] != t[i]:\n shift = i + 1 - (i + 1 - n) % n\n break\n\n # Compute the number of common prefixes of s and t\n common_prefix = 0\n for i in range(n):\n if s[i] != t[shift + i]:\n break\n common_prefix += 1\n\n # Compute the number of ways to shift the string k times\n if k > n - common_prefix:\n return 0\n return (n - common_prefix) * pow(k, MOD - 2, MOD) % MOD * pow(\n n - common_prefix - k, MOD - 2, MOD\n ) % MOD", "class Solution:\n def numberOfWays(self, s: str, t: str, k: int) -> int:\n n = len(s)\n MOD = 10**9 + 7\n\n # Compute the longest common prefix and suffix\n lcp = 0\n while lcp < n and s[lcp] == t[lcp]:\n lcp += 1\n lcs = 0\n while lcs < n and s[n - lcs - 1] == t[n - lcs - 1]:\n lcs += 1\n\n # Compute the number of distinct substrings in the middle\n distinct = set()\n i = lcp\n j = n - lcs\n while i < j:\n distinct.add(s[i:j])\n i += 1\n j -= 1\n\n # Compute the number of ways to arrange the middle substrings\n def factorial(x, y):\n res = 1\n for i in range(x, y + 1):\n res = res * i % MOD\n return res\n\n def inverse(x):\n return pow(x, MOD - 2, MOD)\n\n def comb(x, y):\n return factorial(x, y) * inverse(factorial(y, y)) % MOD\n\n total = factorial(len(distinct) - 1, len(distinct) + k - 1)\n for sub in distinct:\n count = 0\n for i in range(lcp, n - lcs):\n if s[lcp:i] + s[i:n - lcs] + s[n - lcs:] == sub:\n count += 1\n total = (total - comb(len(distinct) - 1, count - 1) + MOD) % MOD\n\n return total", "class Solution:\n def numberOfWays(self, s: str, t: str, k: int) -> int:\n n = len(s)\n MOD = 10**9 + 7\n\n # Compute the longest common prefix of s and t\n lcp = 0\n for i in range(n):\n if s[i] == t[i]:\n lcp += 1\n else:\n break\n\n # Compute the number of distinct substrings of length lcp in s\n freq = [0] * 26\n for i in range(lcp):\n freq[ord(s[i]) - ord('a')] += 1\n distinct = sum(1 for f in freq if f == 1)\n\n # Compute the number of ways to choose k-1 non-overlapping substrings\n # of length lcp from s, and make sure they are all distinct\n ways = 1\n for i in range(k - 1):\n ways = ways * distinct % MOD\n distinct -= 1\n\n return ways", "class Solution:\n def numberOfWays(self, s: str, t: str, k: int) -> int:\n n = len(s)\n MOD = 10**9 + 7\n\n # Compute the prefix function for string t\n prefix = [0] * n\n j = 0\n for i in range(1, n):\n while j > 0 and t[i] != t[j]:\n j = prefix[j - 1]\n if t[i] == t[j]:\n j += 1\n prefix[i] = j\n\n # Compute the number of common prefixes of length i for all i from 1 to n-1\n common = [0] * (n - 1)\n for i in range(n - 1, 0, -1):\n if prefix[i] == n - i:\n common[i - 1] = common[i] + 1\n\n # Compute the number of ways to transform s into t in exactly k operations\n dp = [0] * (n - 1)\n dp[0] = 1\n for i in range(1, n - 1):\n if common[i] == common[i - 1]:\n dp[i] = dp[i - 1]\n else:\n dp[i] = (dp[i - 1] + 1) % MOD\n\n # Compute the cumulative sum of dp array\n for i in range(1, n - 1):\n dp[i] = (dp[i] + dp[i - 1]) % MOD\n\n # Return the number of ways modulo MOD\n return dp[n - 2] if k == 1 else dp[common[n - 2]]", "class Solution:\n def numberOfWays(self, s: str, t: str, k: int) -> int:\n n = len(s)\n MOD = 10**9 + 7\n\n # Compute the longest common prefix (LCP) of s and t\n lcp = 0\n for i in range(n):\n if s[i] == t[i]:\n lcp += 1\n else:\n break\n\n # Compute the number of ways to move the LCP to the front in exactly k steps\n if lcp == 0:\n return pow(n - 1, k, MOD)\n else:\n return pow(n - lcp, k - 1, MOD)", "class Solution:\n def numberOfWays(self, s: str, t: str, k: int) -> int:\n n = len(s)\n MOD = 10**9 + 7\n\n # Compute the longest common prefix of s and t\n lcp = 0\n for i in range(n):\n if s[i] == t[i]:\n lcp += 1\n else:\n break\n\n # Compute the number of ways to move the prefix to the end\n # in exactly k steps\n if k == 1:\n return n - lcp\n else:\n return (pow(n - lcp, k - 1, MOD) - pow(lcp, k - 1, MOD) + MOD) % MOD" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minOperations(self, nums: List[int], target: int) -> int:\n dp = [float('inf')] * (target + 1)\n dp[0] = 0\n for num in nums:\n new_dp = dp.copy()\n for t in range(target, num - 1, -1):\n new_dp[t] = min(new_dp[t], dp[t - num] + 1)\n dp = new_dp\n return dp[target] if dp[target] != float('inf') else -1", "class Solution:\n def minOperations(self, nums: List[int], target: int) -> int:\n dp = [float('inf')] * (target + 1)\n dp[0] = 0\n for num in nums:\n new_dp = dp.copy()\n for t in range(target, num - 1, -1):\n new_dp[t] = min(new_dp[t], dp[t - num] + 1)\n dp = new_dp\n return dp[target] if dp[target] != float('inf') else -1", "class Solution:\n def minOperations(self, nums: List[int], target: int) -> int:\n dp = [float('inf')] * (target + 1)\n dp[0] = 0\n for num in nums:\n new_dp = dp.copy()\n for t in range(target, num - 1, -1):\n new_dp[t] = min(new_dp[t], dp[t - num] + 1)\n dp = new_dp\n return dp[target] if dp[target] != float('inf') else -1", "class Solution:\n def minOperations(self, nums: List[int], target: int) -> int:\n def dfs(idx, remaining):\n if remaining == 0:\n return 0\n if idx == len(nums):\n return -1\n ans = float('inf')\n if nums[idx] <= remaining:\n ans = min(ans, dfs(idx + 1, remaining - nums[idx]))\n new_remaining = remaining\n while nums[idx] > 1 and nums[idx] <= new_remaining:\n new_remaining -= nums[idx]\n nums[idx] //= 2\n ans = min(ans, 1 + dfs(len(nums), new_remaining))\n nums[idx] *= 2\n return ans\n\n return dfs(0, target)", "class Solution:\n def minOperations(self, nums: List[int], target: int) -> int:\n dp = [float('inf')] * (target + 1)\n dp[0] = 0\n for num in nums:\n new_dp = dp[:]\n for t in range(target, num - 1, -1):\n new_dp[t] = min(new_dp[t], dp[t - num] + 1)\n if num > 1:\n new_dp[t] = min(new_dp[t], dp[t - num // 2] + 2)\n dp = new_dp\n return dp[target] if dp[target] != float('inf') else -1", "class Solution:\n def minOperations(self, nums: List[int], target: int) -> int:\n dp = [float('inf')] * (target + 1)\n dp[0] = 0\n for num in nums:\n new_dp = dp.copy()\n for t in range(target, num - 1, -1):\n new_dp[t] = min(new_dp[t], dp[t - num] + 1)\n dp = new_dp\n return dp[target] if dp[target] != float('inf') else -1", "class Solution:\n def minOperations(self, nums: List[int], target: int) -> int:\n dp = [float('inf')] * (target + 1)\n dp[0] = 0\n for num in nums:\n new_dp = dp.copy()\n for t in range(target, num - 1, -1):\n new_dp[t] = min(new_dp[t], dp[t - num] + 1)\n dp = new_dp\n return dp[target] if dp[target] != float('inf') else -1", "class Solution:\n def minOperations(self, nums: List[int], target: int) -> int:\n def dfs(idx, remaining):\n if remaining == 0:\n return 0\n if remaining < 0:\n return float(\"inf\")\n if idx == len(nums):\n return float(\"inf\")\n\n ans = dfs(idx + 1, remaining - nums[idx])\n if nums[idx] > 1:\n ans = min(ans, 1 + dfs(idx, remaining - nums[idx] // 2) + dfs(idx + 1, remaining - nums[idx] // 2))\n\n return ans\n\n return -1 if dfs(0, target) == float(\"inf\") else dfs(0, target)", "class Solution:\n def minOperations(self, nums: List[int], target: int) -> int:\n dp = [float('inf')] * (target + 1)\n dp[0] = 0\n for num in nums:\n new_dp = dp.copy()\n for t in range(target, num - 1, -1):\n new_dp[t] = min(new_dp[t], dp[t - num] + 1)\n dp = new_dp\n return dp[target] if dp[target] != float('inf') else -1", "class Solution:\n def minOperations(self, nums: List[int], target: int) -> int:\n def dfs(idx, remaining):\n if remaining == 0:\n return 0\n if idx == len(nums):\n return -1\n ans = float('inf')\n if nums[idx] <= remaining:\n taken = dfs(idx + 1, remaining - nums[idx])\n if taken != -1:\n ans = min(ans, taken)\n not_taken = dfs(idx, remaining)\n if not_taken != -1:\n ans = min(ans, not_taken)\n divided = dfs(idx + 1, remaining)\n if divided != -1:\n ans = min(ans, 1 + divided)\n if ans == float('inf'):\n ans = -1\n return ans\n\n return dfs(0, target)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def constructProductMatrix(self, grid: List[List[int]]) -> List[List[int]]:\n n, m = len(grid), len(grid[0])\n product_matrix = [[0] * m for _ in range(n)]\n\n # Compute the product of all elements in each row and column\n row_products = [1] * n\n col_products = [1] * m\n for i in range(n):\n for j in range(m):\n row_products[i] = (row_products[i] * grid[i][j]) % 12345\n col_products[j] = (col_products[j] * grid[i][j]) % 12345\n\n # Fill in the product matrix\n for i in range(n):\n for j in range(m):\n product_matrix[i][j] = (row_products[i] * col_products[j]) % 12345\n if grid[i][j] != 0:\n product_matrix[i][j] = (product_matrix[i][j] * pow(grid[i][j], 12345 - 2, 12345)) % 12345\n\n return product_matrix", "class Solution:\n def constructProductMatrix(self, grid: List[List[int]]) -> List[List[int]]:\n n, m = len(grid), len(grid[0])\n product_matrix = [[0] * m for _ in range(n)]\n\n # Compute the product of all elements in each row and column\n row_products = [1] * n\n col_products = [1] * m\n for i in range(n):\n for j in range(m):\n row_products[i] = (row_products[i] * grid[i][j]) % 12345\n col_products[j] = (col_products[j] * grid[i][j]) % 12345\n\n # Fill in the product matrix\n for i in range(n):\n for j in range(m):\n product_matrix[i][j] = (row_products[i] * col_products[j]) % 12345\n if grid[i][j] != 0:\n product_matrix[i][j] = (product_matrix[i][j] * pow(grid[i][j], 12344, 12345)) % 12345\n\n return product_matrix", "class Solution:\n def constructProductMatrix(self, grid: List[List[int]]) -> List[List[int]]:\n n, m = len(grid), len(grid[0])\n product_matrix = [[0] * m for _ in range(n)]\n\n # Calculate the product of all elements in each row and column\n row_products = [1] * n\n col_products = [1] * m\n for i in range(n):\n for j in range(m):\n row_products[i] = (row_products[i] * grid[i][j]) % 12345\n col_products[j] = (col_products[j] * grid[i][j]) % 12345\n\n # Fill in the product matrix\n for i in range(n):\n for j in range(m):\n product_matrix[i][j] = (row_products[i] * col_products[j]) % 12345\n if grid[i][j] != 0:\n product_matrix[i][j] = (product_matrix[i][j] * pow(grid[i][j], 12344, 12345)) % 12345\n\n return product_matrix", "class Solution:\n def constructProductMatrix(self, grid: List[List[int]]) -> List[List[int]]:\n n, m = len(grid), len(grid[0])\n product_matrix = [[0] * m for _ in range(n)]\n\n # Compute the product of all elements in each row and column\n row_products = [1] * n\n col_products = [1] * m\n for i in range(n):\n for j in range(m):\n row_products[i] = (row_products[i] * grid[i][j]) % 12345\n col_products[j] = (col_products[j] * grid[i][j]) % 12345\n\n # Fill in the product matrix\n for i in range(n):\n for j in range(m):\n product_matrix[i][j] = (row_products[i] * col_products[j]) % 12345\n if grid[i][j] != 0:\n product_matrix[i][j] = (product_matrix[i][j] * pow(grid[i][j], 12344, 12345)) % 12345\n\n return product_matrix", "class Solution:\n def constructProductMatrix(self, grid: List[List[int]]) -> List[List[int]]:\n n, m = len(grid), len(grid[0])\n product_matrix = [[0] * m for _ in range(n)]\n\n # Compute row-wise and column-wise products\n row_products = [1] * n\n col_products = [1] * m\n for i in range(n):\n for j in range(m):\n row_products[i] = (row_products[i] * grid[i][j]) % 12345\n col_products[j] = (col_products[j] * grid[i][j]) % 12345\n\n # Fill in the product matrix\n for i in range(n):\n for j in range(m):\n product_matrix[i][j] = (row_products[i] * col_products[j]) % 12345\n\n return product_matrix", "class Solution:\n def constructProductMatrix(self, grid: List[List[int]]) -> List[List[int]]:\n n, m = len(grid), len(grid[0])\n product_matrix = [[0] * m for _ in range(n)]\n\n # Calculate row-wise and column-wise products\n row_products = [1] * n\n col_products = [1] * m\n for i in range(n):\n for j in range(m):\n row_products[i] = (row_products[i] * grid[i][j]) % 12345\n col_products[j] = (col_products[j] * grid[i][j]) % 12345\n\n # Fill in the product matrix\n for i in range(n):\n for j in range(m):\n product_matrix[i][j] = (row_products[i] * col_products[j]) % 12345\n\n return product_matrix", "class Solution:\n def constructProductMatrix(self, grid: List[List[int]]) -> List[List[int]]:\n n, m = len(grid), len(grid[0])\n product_matrix = [[0] * m for _ in range(n)]\n\n # Calculate row-wise and column-wise products\n row_products = [1] * n\n col_products = [1] * m\n for i in range(n):\n for j in range(m):\n row_products[i] = (row_products[i] * grid[i][j]) % 12345\n col_products[j] = (col_products[j] * grid[i][j]) % 12345\n\n # Fill in the product matrix\n for i in range(n):\n for j in range(m):\n product_matrix[i][j] = (row_products[i] * col_products[j]) % 12345\n\n return product_matrix", "class Solution:\n def constructProductMatrix(self, grid: List[List[int]]) -> List[List[int]]:\n n, m = len(grid), len(grid[0])\n product_matrix = [[0] * m for _ in range(n)]\n\n # Compute the row-wise product excluding the current element\n row_product = [1] * n\n for i in range(n):\n for j in range(m):\n product_matrix[i][j] = grid[i][j] * row_product[i] % 12345\n row_product[i] = row_product[i] * (grid[i][j] + 1) % 12345\n\n # Compute the column-wise product excluding the current element\n col_product = [1] * m\n for j in range(m):\n for i in range(n):\n product_matrix[i][j] = product_matrix[i][j] * col_product[j] % 12345\n col_product[j] = col_product[j] * (grid[i][j] + 1) % 12345\n\n return product_matrix", "class Solution:\n def constructProductMatrix(self, grid: List[List[int]]) -> List[List[int]]:\n n, m = len(grid), len(grid[0])\n product_matrix = [[0] * m for _ in range(n)]\n\n # Calculate row-wise and column-wise products\n row_products = [1] * n\n col_products = [1] * m\n for i in range(n):\n for j in range(m):\n row_products[i] = (row_products[i] * grid[i][j]) % 12345\n col_products[j] = (col_products[j] * grid[i][j]) % 12345\n\n # Fill in the product matrix\n for i in range(n):\n for j in range(m):\n product_matrix[i][j] = (row_products[i] * col_products[j]) % 12345\n\n return product_matrix", "class Solution:\n def constructProductMatrix(self, grid: List[List[int]]) -> List[List[int]]:\n n, m = len(grid), len(grid[0])\n product_matrix = [[0] * m for _ in range(n)]\n\n # Calculate the product of all elements in each row and column\n row_products = [1] * n\n col_products = [1] * m\n for i in range(n):\n for j in range(m):\n row_products[i] = (row_products[i] * grid[i][j]) % 12345\n col_products[j] = (col_products[j] * grid[i][j]) % 12345\n\n # Fill in the product matrix\n for i in range(n):\n for j in range(m):\n product_matrix[i][j] = (row_products[i] * col_products[j]) % 12345\n if grid[i][j] != 0:\n product_matrix[i][j] = (product_matrix[i][j] * pow(grid[i][j], 12344, 12345)) % 12345\n\n return product_matrix" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def getMaxFunctionValue(self, receiver: List[int], k: int) -> int:\n n = len(receiver)\n scores = [0] * n\n for i in range(n):\n current = i\n for _ in range(k):\n current = receiver[current]\n scores[i] += current\n\n return max(scores) + sum(range(n))", "class Solution:\n def getMaxFunctionValue(self, receiver: List[int], k: int) -> int:\n n = len(receiver)\n scores = [0] * n\n for i in range(n):\n idx = i\n temp_score = 0\n for j in range(k):\n temp_score += idx\n idx = receiver[idx]\n if idx == i:\n break\n scores[i] = temp_score\n\n return max(scores) + sum(range(n))", "class Solution:\n def getMaxFunctionValue(self, receiver: List[int], k: int) -> int:\n n = len(receiver)\n scores = [0] * n\n for i in range(n):\n idx = i\n temp_score = 0\n for j in range(k):\n temp_score += idx\n idx = receiver[idx]\n if idx == i:\n break\n scores[i] = temp_score\n \n return max(scores) + sum(range(n))", "class Solution:\n def getMaxFunctionValue(self, receiver: List[int], k: int) -> int:\n n = len(receiver)\n scores = [0] * n\n for i in range(n):\n idx = i\n temp_score = 0\n for _ in range(k):\n if idx == -1:\n break\n temp_score += idx\n idx = receiver[idx]\n scores[i] = temp_score\n\n return max(scores) + sum(range(n))", "class Solution:\n def getMaxFunctionValue(self, receiver: List[int], k: int) -> int:\n n = len(receiver)\n scores = [0] * n\n for i in range(n):\n id = receiver[i]\n scores[i] = i + id\n next_id = receiver[id]\n k -= 1\n while k > 0 and next_id != -1:\n scores[i] += next_id\n next_id = receiver[next_id]\n k -= 1\n max_score = max(scores)\n return max_score + min(k, n)", "class Solution:\n def getMaxFunctionValue(self, receiver: List[int], k: int) -> int:\n n = len(receiver)\n scores = [0] * n\n for i in range(n):\n current = i\n for j in range(k):\n current = receiver[current]\n scores[i] += current\n return max(scores) + sum(range(n))", "class Solution:\n def getMaxFunctionValue(self, receiver: List[int], k: int) -> int:\n n = len(receiver)\n scores = [0] * n\n for i in range(n):\n idx = i\n temp_score = 0\n for j in range(k + 1):\n temp_score += idx\n idx = receiver[idx]\n if idx == i:\n break\n scores[i] = temp_score\n\n return max(scores)", "class Solution:\n def getMaxFunctionValue(self, receiver: List[int], k: int) -> int:\n n = len(receiver)\n scores = [0] * n\n for i in range(n):\n idx = i\n temp_score = 0\n for j in range(k + 1):\n temp_score += idx\n idx = receiver[idx]\n if idx == -1:\n break\n scores[i] = temp_score\n\n return max(scores)", "class Solution:\n def getMaxFunctionValue(self, receiver: List[int], k: int) -> int:\n n = len(receiver)\n scores = [0] * n\n for i in range(n):\n current = i\n for _ in range(k):\n current = receiver[current]\n scores[i] += current\n\n return max(scores)", "class Solution:\n def getMaxFunctionValue(self, receiver: List[int], k: int) -> int:\n n = len(receiver)\n scores = [0] * n\n for i in range(n):\n current = i\n for j in range(k):\n current = receiver[current]\n scores[i] += current\n return max(scores) + k" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minOperations(self, s1: str, s2: str, x: int) -> int:\n n = len(s1)\n cost = 0\n for i in range(n):\n if s1[i] != s2[i]:\n if i < n - 1 and s1[i + 1] != s2[i + 1]:\n cost += 1\n i += 1\n else:\n for j in range(i + 1, n):\n if s1[j] != s2[j]:\n cost += x\n break\n if cost >= x:\n return -1\n break\n return cost", "class Solution:\n def minOperations(self, s1: str, s2: str, x: int) -> int:\n n = len(s1)\n cost = 0\n double_flip = 0\n single_flip = 0\n\n for i in range(n):\n if s1[i] != s2[i]:\n if i < n - 1 and s1[i + 1] != s2[i + 1]:\n double_flip += 1\n else:\n single_flip += 1\n\n return (double_flip + (single_flip // 2)) * x + (single_flip % 2) * 2 if single_flip % 2 <= 1 else -1", "class Solution:\n def minOperations(self, s1: str, s2: str, x: int) -> int:\n n = len(s1)\n cost = 0\n diff_count = 0\n\n for i in range(n):\n if s1[i] != s2[i]:\n if i < n - 1 and s1[i] != s2[i + 1] and s2[i] != s2[i + 1]:\n cost += 2 * x\n diff_count += 2\n else:\n cost += x\n diff_count += 1\n\n if diff_count % 2 == 1:\n return -1\n\n return cost + (diff_count // 2 - 1) // 2", "class Solution:\n def minOperations(self, s1: str, s2: str, x: int) -> int:\n n = len(s1)\n cost = 0\n for i in range(n):\n if s1[i] != s2[i]:\n if i < n - 1 and s1[i + 1] != s2[i + 1]:\n cost += 1\n i += 1\n else:\n for j in range(i + 1, n):\n if s1[j] != s2[j] and (j == n - 1 or s1[j + 1] == s2[j + 1]):\n cost += x\n break\n else:\n return -1\n\n return cost", "class Solution:\n def minOperations(self, s1: str, s2: str, x: int) -> int:\n n = len(s1)\n cost = 0\n for i in range(n):\n if s1[i] != s2[i]:\n if i < n - 1 and s1[i + 1] != s2[i + 1]:\n cost += 1\n i += 1\n else:\n for j in range(i + 1, n):\n if s1[j] != s2[j]:\n cost += x\n break\n if cost >= x * n:\n return -1\n break\n return cost", "class Solution:\n def minOperations(self, s1: str, s2: str, x: int) -> int:\n n = len(s1)\n cost = 0\n for i in range(n):\n if s1[i] != s2[i]:\n if i < n - 1 and s1[i + 1] != s2[i + 1]:\n cost += 1\n i += 1\n else:\n for j in range(i + 1, n):\n if s1[j] != s2[j]:\n cost += x\n break\n if cost >= x * n:\n return -1\n break\n return cost", "class Solution:\n def minOperations(self, s1: str, s2: str, x: int) -> int:\n n = len(s1)\n cost = 0\n diff_count = 0\n\n for i in range(n):\n if s1[i] != s2[i]:\n if i < n - 1 and s1[i + 1] != s2[i + 1]:\n cost += 1\n i += 1\n else:\n diff_count += 1\n\n if diff_count % 2 == 1:\n return -1\n\n return min(diff_count // 2 * x + cost, diff_count // 2 * 2 + cost)", "class Solution:\n def minOperations(self, s1: str, s2: str, x: int) -> int:\n n = len(s1)\n cost = 0\n for i in range(n):\n if s1[i] != s2[i]:\n if i < n - 1 and s1[i + 1] != s2[i + 1]:\n cost += 1\n i += 1\n else:\n for j in range(i + 1, n):\n if s1[j] != s2[j]:\n cost += x\n break\n if cost >= x * n:\n return -1\n break\n return cost", "class Solution:\n def minOperations(self, s1: str, s2: str, x: int) -> int:\n n = len(s1)\n cost = 0\n diff_count = 0\n\n for i in range(n):\n if s1[i] != s2[i]:\n if i < n - 1 and s1[i + 1] != s2[i + 1]:\n cost += 1\n diff_count += 1\n i += 1\n else:\n diff_count += 2\n\n if diff_count % 2 != 0:\n return -1\n\n return min(cost + (diff_count // 2 - 1) // 2 * x, cost + diff_count // 2 * x)", "class Solution:\n def minOperations(self, s1: str, s2: str, x: int) -> int:\n n = len(s1)\n cost = 0\n for i in range(n):\n if s1[i] != s2[i]:\n if i < n - 1 and s1[i + 1] != s2[i + 1]:\n cost += 1\n i += 1\n else:\n for j in range(i + 1, n):\n if s1[j] != s2[j]:\n cost += x\n break\n if cost == -1:\n return -1\n break\n return cost" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberOfPoints(self, nums: List[List[int]]) -> int:\n intervals = sorted(nums, key=lambda x: (x[0], -x[1]))\n\n count = 0\n prev_end = 0\n for start, end in intervals:\n if start > prev_end:\n prev_end = end\n else:\n prev_end = min(prev_end, end)\n count += (prev_end - start) + 1\n\n return count", "class Solution:\n def numberOfPoints(self, nums: List[List[int]]) -> int:\n points = set()\n for start, end in nums:\n for point in range(start, end + 1):\n points.add(point)\n return len(points)", "class Solution:\n def numberOfPoints(self, nums: List[List[int]]) -> int:\n intervals = sorted(nums, key=lambda x: (x[0], -x[1]))\n\n count = 0\n prev_end = 0\n for start, end in intervals:\n if start > prev_end:\n prev_end = end\n else:\n prev_end = min(prev_end, end)\n count += prev_end - start + 1\n return count", "class Solution:\n def numberOfPoints(self, nums: List[List[int]]) -> int:\n intervals = sorted(nums, key=lambda x: x[0])\n count = 0\n prev_end = 0\n for interval in intervals:\n start, end = interval\n if start > prev_end:\n count += start - prev_end\n prev_end = max(prev_end, end)\n return count + prev_end", "class Solution:\n def numberOfPoints(self, nums: List[List[int]]) -> int:\n intervals = sorted(nums, key=lambda x: (x[0], -x[1]))\n\n count = 0\n last_end = 0\n for start, end in intervals:\n if start > last_end:\n last_end = end\n else:\n last_end = min(last_end, end)\n count += last_end - start + 1\n return count", "class Solution:\n def numberOfPoints(self, nums: List[List[int]]) -> int:\n intervals = sorted(nums, key=lambda x: x[0])\n count = 0\n prev_end = 0\n for interval in intervals:\n start, end = interval\n if start > prev_end:\n count += start - prev_end\n prev_end = max(prev_end, end)\n return count + 1", "class Solution:\n def numberOfPoints(self, nums: List[List[int]]) -> int:\n intervals = sorted(nums, key=lambda x: (x[0], -x[1]))\n\n count = 0\n prev_end = float('-inf')\n for start, end in intervals:\n if start > prev_end:\n prev_end = end\n else:\n prev_end = min(prev_end, end)\n count += prev_end - start + 1\n\n return count", "class Solution:\n def numberOfPoints(self, nums: List[List[int]]) -> int:\n # Sort the car coordinates based on the starting point\n sorted_nums = sorted(nums, key=lambda x: x[0])\n\n # Initialize a variable to store the number of covered points\n covered_points = 0\n\n # Initialize a variable to store the latest ending point\n latest_end = 0\n\n # Iterate through the sorted car coordinates\n for i in range(len(sorted_nums)):\n # Update the latest ending point if the current car's ending point is greater\n latest_end = max(latest_end, sorted_nums[i][1])\n\n # Increment the covered points by the difference between the latest ending point and the current car's starting point\n covered_points += sorted_nums[i][0] - latest_end\n\n # Return the total number of covered points\n return covered_points + latest_end", "class Solution:\n def numberOfPoints(self, nums: List[List[int]]) -> int:\n intervals = sorted(nums, key=lambda x: x[0])\n count = 0\n prev_end = 0\n for interval in intervals:\n start, end = interval\n if start > prev_end:\n prev_end = end\n else:\n prev_end = min(prev_end, end)\n count += prev_end - start + 1\n return count", "class Solution:\n def numberOfPoints(self, nums: List[List[int]]) -> int:\n intervals = sorted(nums, key=lambda x: x[0])\n count = 0\n right_end = 0\n for interval in intervals:\n if interval[0] > right_end:\n count += interval[0] - right_end\n right_end = max(right_end, interval[1])\n return count + right_end" ], "pass1_list": [ false, true, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n operations = 0\n while k > 0:\n if nums[-1] > k:\n count += 1\n operations += count\n else:\n k -= nums[-1]\n nums.pop()\n return operations", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n operations = 0\n while k > 0:\n if nums[-1] > k:\n count += 1\n operations += count\n else:\n k -= nums[-1]\n nums.pop()\n return operations", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n operations = 0\n while k > 0:\n if nums[-1] > k:\n count += 1\n operations += count\n else:\n k -= nums[-1]\n nums.pop()\n return operations", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n operations = 0\n i = len(nums) - 1\n while k > 0:\n if nums[i] > k:\n operations += nums[i] - k\n i -= 1\n k -= 1\n i -= 1\n operations += 1\n return operations", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n operations = 0\n while k > 0:\n index = nums.index(k)\n operations += index\n k = k - 1\n nums.pop(index)\n count += 1\n return operations", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n operations = 0\n for i in range(len(nums)):\n if nums[i] <= k:\n count += 1\n if count == k:\n return operations + i + 1\n return operations + len(nums)", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n operations = 0\n while k > 0:\n if nums[-1] > k:\n count += 1\n else:\n operations += count\n k -= nums[-1]\n nums.pop()\n return operations + count", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n operations = 0\n while k > 0:\n if nums[-1] > k:\n count += 1\n operations += count\n else:\n k -= nums[-1]\n nums.pop()\n return operations", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n operations = 0\n while k > 0:\n if nums[-1] > k:\n count += 1\n operations += count\n else:\n k -= nums[-1]\n nums.pop()\n return operations", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n operations = 0\n while k > 0:\n if nums[-1] > k:\n count += 1\n operations += count\n else:\n k -= nums[-1]\n nums.pop()\n return operations" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumRightShifts(self, nums: List[int]) -> int:\n n = len(nums)\n shifts = 0\n for i in range(n):\n while nums[i] > nums[(i + 1) % n] and i != nums[i] - 1:\n nums = nums[1:] + [nums[0]]\n shifts += 1\n if i == nums[i] - 1:\n return -1\n return shifts", "class Solution:\n def minimumRightShifts(self, nums: List[int]) -> int:\n n = len(nums)\n shifts = 0\n for i in range(n):\n while nums[i] > nums[(i+1)%n] and i != n-1:\n nums[i], nums[i+1] = nums[i+1], nums[i]\n shifts += 1\n i += 1\n return shifts if nums == sorted(nums) else -1", "class Solution:\n def minimumRightShifts(self, nums: List[int]) -> int:\n n = len(nums)\n shifts = 0\n for i in range(n):\n while nums[i] > nums[(i + 1) % n] and i != nums[i] - 1:\n nums = nums[1:] + [nums[0]]\n shifts += 1\n if i == nums[i] - 1:\n return -1\n return shifts", "class Solution:\n def minimumRightShifts(self, nums: List[int]) -> int:\n n = len(nums)\n shifts = 0\n for i in range(n):\n while nums[i] > nums[(i+1)%n] and i != nums[(i+1)%n]:\n nums[i], nums[(i+1)%n] = nums[(i+1)%n], nums[i]\n shifts += 1\n return -1 if not all(nums[i] <= nums[(i+1)%n] for i in range(n)) else shifts", "class Solution:\n def minimumRightShifts(self, nums: List[int]) -> int:\n n = len(nums)\n shifts = 0\n for i in range(n):\n while nums[i] > nums[(i+1) % n] and i < n-1:\n nums[i], nums[i + 1] = nums[i + 1], nums[i]\n shifts += 1\n i = max(0, i - 1)\n return -1 if nums != sorted(nums) else shifts", "class Solution:\n def minimumRightShifts(self, nums: List[int]) -> int:\n n = len(nums)\n shifts = 0\n for i in range(n):\n while nums[i] > nums[(i + 1) % n] and i != nums[i] - 1:\n nums[(i + 1) % n], nums[i] = nums[i], nums[(i + 1) % n]\n shifts += 1\n if i == nums[i] - 1:\n if sorted(nums) != nums:\n return -1\n return shifts", "class Solution:\n def minimumRightShifts(self, nums: List[int]) -> int:\n n = len(nums)\n shifts = 0\n for i in range(n):\n while nums[i] > nums[(i + 1) % n] and i != (i + 1) % n:\n nums = nums[(i + 1):] + nums[:(i + 1)]\n shifts += 1\n return shifts if nums == sorted(nums) else -1", "class Solution:\n def minimumRightShifts(self, nums: List[int]) -> int:\n n = len(nums)\n shifts = 0\n for i in range(n):\n while nums[i] > nums[(i + 1) % n] and i != nums[i] - 1:\n nums[(i + 1) % n], nums[i] = nums[i], nums[(i + 1) % n]\n shifts += 1\n if i == nums[i] - 1:\n if sorted(nums) != nums:\n return -1\n return shifts", "class Solution:\n def minimumRightShifts(self, nums: List[int]) -> int:\n n = len(nums)\n shifts = 0\n for i in range(n):\n while nums[i] > nums[(i+1)%n] and i != (i+1)%n:\n nums[i], nums[(i+1)%n] = nums[(i+1)%n], nums[i]\n shifts += 1\n return -1 if nums != sorted(nums) else shifts", "class Solution:\n def minimumRightShifts(self, nums: List[int]) -> int:\n n = len(nums)\n shifts = 0\n for i in range(n):\n while nums[i] > nums[(i + 1) % n] and i < n - 1:\n nums[i], nums[i + 1] = nums[i + 1], nums[i]\n shifts += 1\n i += 1\n return -1 if nums != sorted(nums) else shifts" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumOperations(self, num: str) -> int:\n n = len(num)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n for j in range(i, -1, -1):\n if num[j] == '0' or (i == j and num[j] == '5' and j != 0):\n dp[j] = min(dp[j], dp[j - 1] + 1)\n elif num[j] == '5' or (num[j] == '2' and num[j - 1] == '5'):\n dp[j] = min(dp[j], dp[j - 1])\n elif j != 0:\n dp[j] = min(dp[j], dp[j - 1] + 1)\n\n return dp[n - 1]", "class Solution:\n def minimumOperations(self, num: str) -> int:\n n = len(num)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n for j in range(i, -1, -1):\n if num[j] == '0':\n dp[j + 1] = min(dp[j + 1], dp[j] + 1)\n elif int(num[j]) % 5 == 0:\n dp[j + 1] = min(dp[j + 1], dp[j] + 1)\n elif int(num[j]) % 2 == 0:\n dp[j + 1] = min(dp[j + 1], dp[j] + 2)\n else:\n dp[j + 1] = min(dp[j + 1], dp[j] + 1)\n\n return dp[n]", "class Solution:\n def minimumOperations(self, num: str) -> int:\n n = len(num)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n for j in range(i, -1, -1):\n if int(num[j]) % 5 == 0:\n dp[j + 1] = min(dp[j + 1], dp[j] + 1)\n elif int(num[j]) % 2 == 0:\n dp[j + 1] = min(dp[j + 1], dp[j] + 2)\n else:\n dp[j + 1] = min(dp[j + 1], dp[j] + 3)\n\n return dp[n]", "class Solution:\n def minimumOperations(self, num: str) -> int:\n n = len(num)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n for j in range(i, -1, -1):\n if num[j] == '0' or num[j] == '5' or num[j] == '2' or (num[j] == '7' and j != i):\n dp[j + 1] = min(dp[j + 1], dp[j] + 1)\n elif num[j] == '9' and j != i:\n dp[j + 1] = min(dp[j + 1], dp[j] + 2)\n\n return dp[n]", "class Solution:\n def minimumOperations(self, num: str) -> int:\n n = len(num)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n for j in range(i, -1, -1):\n if num[j] == '0' or (i == j and num[j] == '5' and j > 0 and num[j - 1] == '2'):\n dp[i + 1] = min(dp[i + 1], dp[j] + i - j)\n elif num[j] == '5' or (num[j] == '2' and j > 0 and num[j - 1] == '5'):\n dp[i + 1] = min(dp[i + 1], dp[j] + i - j + 1)\n\n return dp[n]", "class Solution:\n def minimumOperations(self, num: str) -> int:\n n = len(num)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n for j in range(i, -1, -1):\n if num[j] == '0' or (i == j and num[j] == '5' and j > 0 and num[j - 1] == '2'):\n dp[i + 1] = min(dp[i + 1], dp[j] + i - j)\n elif num[j] == '5' or (num[j] == '2' and j > 0 and num[j - 1] == '5'):\n dp[i + 1] = min(dp[i + 1], dp[j] + i - j + 1)\n\n return dp[n]", "class Solution:\n def minimumOperations(self, num: str) -> int:\n n = len(num)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n rem_25 = [1] * 25\n\n for i in range(n):\n digit = int(num[i])\n rem_25[digit] = 0\n\n for i in range(n):\n for j in range(25):\n if rem_25[j] == 1:\n dp[i + 1] = min(dp[i + 1], dp[i] + 1 - int(num[i] == str(j)))\n\n return dp[n]", "class Solution:\n def minimumOperations(self, num: str) -> int:\n n = len(num)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n for j in range(i, -1, -1):\n if num[j] == '0' or (i == j and num[j] == '5' and j > 0 and num[j - 1] == '2'):\n dp[i + 1] = min(dp[i + 1], dp[j] + i - j)\n elif num[j] == '5' or (num[j] == '2' and j > 0 and num[j - 1] == '5'):\n dp[i + 1] = min(dp[i + 1], dp[j] + i - j + 1)\n\n return dp[n]", "class Solution:\n def minimumOperations(self, num: str) -> int:\n n = len(num)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n for j in range(i, -1, -1):\n if num[j] == '0' or (num[j] == '5' and j + 1 < n and num[j + 1] == '0'):\n dp[j + 1] = min(dp[j + 1], dp[j] + 1)\n elif num[j] == '2' and j + 2 < n and num[j + 1] == '5' and num[j + 2] == '0':\n dp[j + 3] = min(dp[j + 3], dp[j] + 1)\n elif num[j] == '7' and j + 1 < n and num[j + 1] == '5':\n dp[j + 2] = min(dp[j + 2], dp[j] + 1)\n\n return dp[n]", "class Solution:\n def minimumOperations(self, num: str) -> int:\n n = len(num)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n for j in range(i, -1, -1):\n if num[j] != '0':\n dp[j + 1] = min(dp[j + 1], dp[j] + 1)\n if int(num[j - 2:j + 1]) % 25 == 0:\n dp[j + 1] = min(dp[j + 1], dp[j - 2])\n\n return dp[n]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumSum(self, nums: List[int]) -> int:\n def is_square(n):\n return int(n**0.5) ** 2 == n\n\n def find_max_sum(indices, nums):\n max_sum = 0\n for i in range(len(indices)):\n for j in range(i + 1, len(indices)):\n product = nums[indices[i]] * nums[indices[j]]\n if is_square(product):\n max_sum = max(max_sum, nums[indices[i]] + nums[indices[j]])\n return max_sum\n\n n = len(nums)\n indices = list(range(n))\n nums.sort(key=lambda x: -x)\n\n max_sum = sum(nums)\n for i in range(n):\n for j in range(i + 1, n):\n if not is_square(nums[i] * nums[j]):\n indices.remove(j)\n indices.remove(i)\n max_sum = max(max_sum, find_max_sum(indices, nums) + nums[i] + nums[j])\n indices.append(i)\n indices.append(j)\n\n return max_sum", "class Solution:\n def maximumSum(self, nums: List[int]) -> int:\n def is_square(n: int) -> bool:\n root = int(n ** 0.5)\n return root * root == n\n\n def factorize(n: int) -> List[int]:\n factors = []\n for i in range(1, int(n ** 0.5) + 1):\n if n % i == 0 and is_square(i) and is_square(n // i):\n factors.extend([i, n // i])\n return list(set(factors))\n\n factors = set()\n for num in nums:\n factors |= set(factorize(num))\n\n dp = [0] * (len(factors) + 1)\n for factor in factors:\n dp[factor_map[factor]] = max(dp[factor_map[factor]], num)\n\n return max(dp)", "class Solution:\n def maximumSum(self, nums: List[int]) -> int:\n def is_square(n):\n return int(n**0.5) ** 2 == n\n\n def find_max_sum(composites, primes):\n dp = [0] * (1 << len(composites))\n dp[0] = 0\n\n for mask in range(1 << len(composites)):\n for i in range(len(composites)):\n if mask & (1 << i):\n for j in range(i):\n if (mask & (1 << j)) and is_square(composites[i] * composites[j]):\n dp[mask] += composites[i] + composites[j]\n break\n if dp[mask] == 0:\n dp[mask] = max(dp[mask ^ (1 << i)] + composites[i] for i in range(len(composites)) if mask & (1 << i))\n\n return max(dp) + sum(primes)\n\n composites = []\n primes = []\n for num in nums:\n is_composite = False\n for composite in composites:\n if is_square(composite * num):\n is_composite = True\n break\n if is_composite:\n composites.append(num)\n else:\n primes.append(num)\n\n return find_max_sum(composites, primes)", "class Solution:\n def maximumSum(self, nums: List[int]) -> int:\n def is_square(n):\n return int(n**0.5) ** 2 == n\n\n def find_max_sum(nums, factor):\n dp = [0] * (len(nums) + 1)\n for num in nums:\n if num % factor == 0:\n dp[num // factor] = max(dp[num // factor], num)\n else:\n dp[num % factor] = max(dp[num % factor], num)\n max_sum = 0\n for num in dp:\n max_sum = max(max_sum, num)\n return max_sum\n\n max_sum = 0\n for num in nums:\n max_sum = max(max_sum, num)\n if is_square(num):\n factor = int(num ** 0.5)\n max_sum = max(max_sum, find_max_sum(nums, factor))\n return max_sum", "class Solution:\n def maximumSum(self, nums: List[int]) -> int:\n def is_square(n: int) -> bool:\n root = int(n ** 0.5)\n return root * root == n\n\n def factorize(n: int) -> List[int]:\n factors = []\n for i in range(1, int(n ** 0.5) + 1):\n if n % i == 0:\n if i * i != n:\n factors.extend([i, n // i])\n else:\n factors.append(i)\n return factors\n\n def max_sum(factors: List[int]) -> int:\n dp = [0] * (1 << len(factors))\n for i in range(len(factors)):\n dp[1 << i] = factors[i]\n\n for mask in range(1 << len(factors) - 1, -1, -1):\n for i in range(len(factors)):\n if mask & (1 << i) == 0:\n dp[mask] = max(dp[mask], dp[mask ^ (1 << i)] + factors[i])\n\n return dp[0]\n\n n = len(nums)\n factors = [factorize(num) for num in nums]\n dp = [0] * (1 << n)\n for i in range(n):\n dp[1 << i] = nums[i]\n\n for mask in range(1 << n - 1, -1, -1):\n for i in range(n):\n if mask & (1 << i) == 0 and all(is_square(nums[i] * nums[j]) for j in range(n) if mask & (1 << j) != 0):\n dp[mask] = max(dp[mask], dp[mask ^ (1 << i)] + nums[i])\n\n return dp[0]", "class Solution:\n def maximumSum(self, nums: List[int]) -> int:\n def is_square(n):\n return int(n**0.5) ** 2 == n\n\n def find_max_sum(i, memo, nums):\n if i == len(nums):\n return 0\n if memo[i] != -1:\n return memo[i]\n incl = nums[i] + find_max_sum(i + 1, memo, nums)\n excl = find_max_sum(i + 1, memo, nums)\n if is_square(nums[i]):\n incl = max(incl, nums[i] + find_max_sum(i + 2, memo, nums))\n memo[i] = max(incl, excl)\n return memo[i]\n\n memo = [-1] * len(nums)\n return find_max_sum(0, memo, nums)", "class Solution:\n def maximumSum(self, nums: List[int]) -> int:\n def is_square(n):\n return int(n**0.5) ** 2 == n\n\n def factorize(n):\n factors = []\n for i in range(1, int(n**0.5) + 1):\n if n % i == 0:\n if i * i != n:\n factors.extend([i, n // i])\n else:\n factors.append(i)\n return set(factors)\n\n n = len(nums)\n factor_sets = [factorize(num) for num in nums]\n dp = [0] * (1 << n)\n for i in range(n):\n dp[1 << i] = nums[i]\n\n for mask in range((1 << n) - 1, 0, -1):\n for i in range(n):\n if mask & (1 << i):\n for j in range(n):\n if i != j and mask & (1 << j):\n if factor_sets[i].issubset(factor_sets[j]) or factor_sets[j].issubset(factor_sets[i]):\n dp[mask - (1 << i)] = max(dp[mask - (1 << i)], dp[mask] + nums[i])\n break\n return max(dp)", "class Solution:\n def maximumSum(self, nums: List[int]) -> int:\n def is_square(n: int) -> bool:\n root = int(n ** 0.5)\n return root * root == n\n\n def factorize(n: int) -> List[int]:\n factors = []\n for i in range(1, int(n ** 0.5) + 1):\n if n % i == 0:\n if i * i != n:\n factors.extend([i, n // i])\n else:\n factors.append(i)\n return factors\n\n def max_sum(factors: List[int]) -> int:\n dp = [0] * (1 << len(factors))\n for i in range(len(factors)):\n dp[1 << i] = factors[i]\n\n for mask in range(1 << len(factors) - 1, -1, -1):\n for i in range(len(factors)):\n if mask & (1 << i) == 0:\n dp[mask] = max(dp[mask], dp[mask ^ (1 << i)] + factors[i])\n\n return dp[0]\n\n n = len(nums)\n factors = [factorize(num) for num in nums]\n dp = [0] * (1 << n)\n for i in range(n):\n dp[1 << i] = nums[i]\n\n for mask in range(1 << n - 1, -1, -1):\n for i in range(n):\n if mask & (1 << i) == 0:\n common_factors = set(factors[i]).intersection(set(factors[j]) for j in range(n) if mask & (1 << j) > 0)\n if any(not is_square(f) for f in common_factors):\n continue\n dp[mask] = max(dp[mask], dp[mask ^ (1 << i)] + nums[i])\n\n return dp[0]", "class Solution:\n def maximumSum(self, nums: List[int]) -> int:\n def is_square(n):\n return int(n**0.5) ** 2 == n\n\n def find_max_sum(indices, nums):\n max_sum = 0\n for i in range(len(indices)):\n for j in range(i + 1, len(indices)):\n product = nums[indices[i]] * nums[indices[j]]\n if is_square(product):\n max_sum = max(max_sum, nums[indices[i]] + nums[indices[j]])\n return max_sum\n\n n = len(nums)\n indices = list(range(n))\n nums.sort(key=lambda x: -x)\n\n max_sum = 0\n for i in range(n):\n for j in range(i + 1, n):\n product = nums[i] * nums[j]\n if is_square(product):\n max_sum = max(max_sum, nums[i] + nums[j])\n\n max_sum += sum(nums)\n\n for i in range(n):\n new_indices = indices[:i] + indices[i + 1:]\n max_sum = max(max_sum, find_max_sum(new_indices, nums))\n\n return max_sum", "class Solution:\n def maximumSum(self, nums: List[int]) -> int:\n def is_square(n: int) -> bool:\n root = int(n ** 0.5)\n return root * root == n\n\n def find_max_sum(nums: List[int], factor: int) -> int:\n dp = [0] * (len(nums) + 1)\n for num in nums:\n if num == factor:\n dp[1] = max(dp[1], num)\n elif is_square(num * factor):\n for i in range(len(dp) - 1, 0, -1):\n dp[i] = max(dp[i], dp[i - 1] + num)\n\n return max(dp)\n\n max_sum = sum(nums)\n for num in nums:\n if is_square(num):\n max_sum = max(max_sum, find_max_sum(nums, num))\n\n return max_sum" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumOddBinaryNumber(self, s: str) -> str:\n ones = s.count('1')\n if ones == 1:\n return '0' * (len(s) - 1) + '1'\n else:\n return '1' + '0' * (len(s) - 2) + '1'", "class Solution:\n def maximumOddBinaryNumber(self, s: str) -> str:\n ones = s.count('1')\n if ones == 1:\n return '0' * (len(s) - 1) + '1'\n else:\n return '1' + '0' * (len(s) - 2) + '1'", "class Solution:\n def maximumOddBinaryNumber(self, s: str) -> str:\n ones = s.count('1')\n if ones == 1:\n return '0' * (len(s) - 1) + '1'\n else:\n return '1' + '0' * (len(s) - 2) + '1'", "class Solution:\n def maximumOddBinaryNumber(self, s: str) -> str:\n ones = s.count('1')\n if ones == 1:\n return '0' * (len(s) - 1) + '1'\n else:\n return '1' + '0' * (len(s) - 2) + '1'", "class Solution:\n def maximumOddBinaryNumber(self, s: str) -> str:\n ones = s.count('1')\n if ones == 1:\n return '0' * (len(s) - 1) + '1'\n else:\n return '1' + '0' * (len(s) - 2) + '1'", "class Solution:\n def maximumOddBinaryNumber(self, s: str) -> str:\n ones = s.count('1')\n if ones == 1:\n return '0' * (len(s) - 1) + '1'\n else:\n return '1' + '0' * (len(s) - 2) + '1'", "class Solution:\n def maximumOddBinaryNumber(self, s: str) -> str:\n ones = s.count('1')\n if ones == 1:\n return '0' * (len(s) - 1) + '1'\n else:\n return '1' + '0' * (len(s) - 2) + '1'", "class Solution:\n def maximumOddBinaryNumber(self, s: str) -> str:\n ones = s.count('1')\n if ones == 1:\n return '0' * (len(s) - 1) + '1'\n else:\n return '1' + '0' * (len(s) - 2) + '1'", "class Solution:\n def maximumOddBinaryNumber(self, s: str) -> str:\n ones = s.count('1')\n if ones == 1:\n return '0' * (len(s) - 1) + '1'\n else:\n return '1' + '0' * (len(s) - 2) + '1'", "class Solution:\n def maximumOddBinaryNumber(self, s: str) -> str:\n ones = s.count('1')\n if ones == 1:\n return '0' * (len(s) - 1) + '1'\n else:\n return '1' + '0' * (len(s) - 2) + '1'" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxSubarrays(self, nums: List[int]) -> int:\n res = 1\n common_prefix = 0\n for i in range(len(nums) - 1, -1, -1):\n common_prefix = (common_prefix | nums[i]) & nums[i]\n if common_prefix == 0:\n res += 1\n common_prefix = nums[i]\n return res", "class Solution:\n def maxSubarrays(self, nums: List[int]) -> int:\n res = 1\n common_prefix_bits = 0\n max_common_prefix_bits = 0\n\n for num in nums:\n common_prefix_bits = 0\n while num > 0 and common_prefix_bits < 20:\n if num & 1:\n max_common_prefix_bits = max(\n max_common_prefix_bits, common_prefix_bits\n )\n common_prefix_bits += 1\n num >>= 1\n\n return max_common_prefix_bits + 1", "class Solution:\n def maxSubarrays(self, nums: List[int]) -> int:\n def count_bits(num):\n return bin(num).count('1')\n \n max_subarrays = 1\n common_bits = 0\n for num in nums:\n num_bits = count_bits(num)\n if num_bits < count_bits(common_bits | num):\n common_bits |= num\n max_subarrays += 1\n \n return max_subarrays", "class Solution:\n def maxSubarrays(self, nums: List[int]) -> int:\n res = 1\n count = 0\n common_prefix_bits = 0\n\n for num in nums:\n common_prefix_bits = self.countCommonPrefixBits(common_prefix_bits, num)\n count += num.bit_length() - common_prefix_bits\n res = max(res, count)\n\n return res\n\n def countCommonPrefixBits(self, common_prefix_bits, num):\n while num and common_prefix_bits < 20 and (1 << common_prefix_bits) > num:\n common_prefix_bits += 1\n return common_prefix_bits", "class Solution:\n def maxSubarrays(self, nums: List[int]) -> int:\n res = 1\n common_prefix = 0\n for num in nums:\n common_prefix |= num\n if common_prefix == 0:\n res += 1\n common_prefix = num\n return res", "class Solution:\n def maxSubarrays(self, nums: List[int]) -> int:\n res = 1\n common_prefix_bits = 0\n max_common_prefix_bits = 0\n\n for num in nums:\n common_prefix_bits = 0\n while num > 0 and common_prefix_bits < 20:\n if num & 1:\n max_common_prefix_bits = max(\n max_common_prefix_bits, common_prefix_bits\n )\n common_prefix_bits += 1\n num >>= 1\n\n return max_common_prefix_bits + 1", "class Solution:\n def maxSubarrays(self, nums: List[int]) -> int:\n res = 1\n common_prefix = 0\n for i in range(len(nums) - 1, -1, -1):\n common_prefix = (common_prefix | nums[i]) & nums[i]\n if common_prefix == 0:\n res += 1\n common_prefix = nums[i]\n return res", "class Solution:\n def maxSubarrays(self, nums: List[int]) -> int:\n res = 1\n common_prefix = 0\n for i in range(len(nums) - 1, -1, -1):\n common_prefix = (common_prefix | nums[i]) & nums[i]\n if common_prefix == 0:\n res += 1\n common_prefix = nums[i]\n return res", "class Solution:\n def maxSubarrays(self, nums: List[int]) -> int:\n res = 1\n common_prefix = 0\n for num in nums:\n common_prefix |= num\n if common_prefix == 0:\n return len(nums)\n for num in nums:\n common_prefix &= num\n if common_prefix == 0:\n res += 1\n common_prefix = num\n return res", "class Solution:\n def maxSubarrays(self, nums: List[int]) -> int:\n res = 1\n common_prefix_length = 0\n common_prefix = 0\n\n for num in nums:\n common_prefix |= num\n if common_prefix_length == 0:\n common_prefix_length = bin(common_prefix).count('1')\n else:\n common_prefix &= num\n common_prefix_length -= bin(common_prefix).count('1')\n if common_prefix_length == 0:\n res += 1\n common_prefix = num\n common_prefix_length = bin(common_prefix).count('1')\n\n return res" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minLengthAfterRemovals(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1:\n return 1\n if n == 2:\n return 0 if nums[0] < nums[1] else 1\n\n result = 1\n i, j = 0, 1\n while j < n:\n if nums[i] < nums[j]:\n i += 1\n j = i\n else:\n i = 0\n j += 1\n result += 1\n\n return result - 1", "class Solution:\n def minLengthAfterRemovals(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1 or n == 0:\n return n\n\n i = 1\n while i < n:\n if nums[i] - nums[i - 1] == 1:\n nums.pop(i)\n nums.pop(i - 1)\n else:\n i += 1\n\n return len(nums)", "class Solution:\n def minLengthAfterRemovals(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1:\n return 1\n if n == 2:\n return 0 if nums[0] < nums[1] else 1\n\n i = 1\n while i < n and nums[i] > nums[i - 1]:\n i += 1\n\n if i == n:\n return 0\n return 1", "class Solution:\n def minLengthAfterRemovals(self, nums: List[int]) -> int:\n n = len(nums)\n i = 0\n while i < n - 1 and nums[i] < nums[i + 1]:\n i += 1\n return n % 2 ^ i % 2", "class Solution:\n def minLengthAfterRemovals(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1 or n == 0:\n return n\n\n i = 1\n while i < n:\n if nums[i] - nums[i - 1] == 1:\n nums.pop(i)\n nums.pop(i - 1)\n n -= 2\n if n == 1 or n == 0:\n return n\n i = 1\n else:\n i += 1\n\n return 1", "class Solution:\n def minLengthAfterRemovals(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1 or n == 0:\n return n\n\n i = 1\n while i < n:\n if nums[i] - nums[i - 1] == 1:\n nums.pop(i)\n nums.pop(i - 1)\n n -= 2\n if i < n:\n i -= 1\n else:\n i += 1\n\n return len(nums)", "class Solution:\n def minLengthAfterRemovals(self, nums: List[int]) -> int:\n n = len(nums)\n i = 0\n while i < n - 1 and nums[i] < nums[i + 1]:\n i += 1\n return n % 2 ^ i % 2", "class Solution:\n def minLengthAfterRemovals(self, nums: List[int]) -> int:\n n = len(nums)\n i = 0\n while i < n - 1 and nums[i] < nums[i + 1]:\n i += 1\n return n % 2 ^ i % 2", "class Solution:\n def minLengthAfterRemovals(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1 or n == 0:\n return n\n\n i = 1\n while i < n:\n if nums[i] - nums[i - 1] == 1:\n i += 2\n n -= 2\n else:\n i += 1\n\n return n % 2", "class Solution:\n def minLengthAfterRemovals(self, nums: List[int]) -> int:\n n = len(nums)\n if n == 1 or n == 0:\n return n\n\n # Initialize result as the length of the input array\n result = n\n for i in range(1, n):\n # If the current element is greater than the previous element,\n # we can remove both elements.\n if nums[i] > nums[i - 1]:\n result = i\n break\n\n # Check if we can further reduce the array length by removing\n # the last two elements.\n if n > 2 and nums[-1] > nums[-2]:\n result = min(result, n - 2)\n\n return result" ], "pass1_list": [ false, false, false, false, false, false, false, false, true, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countSubMultisets(self, nums: List[int], l: int, r: int) -> int:\n MOD = 10**9 + 7\n nums_count = Counter(nums)\n sorted_nums_count = sorted(nums_count.items(), key=lambda x: x[0])\n dp = [1] + [0] * r\n for num, count in sorted_nums_count:\n new_dp = [1]\n for s in range(1, r + 1):\n if s >= num:\n new_dp.append((new_dp[-1] + dp[s - num]) % MOD)\n else:\n new_dp.append(new_dp[-1])\n dp = new_dp\n return dp[l]", "class Solution:\n def countSubMultisets(self, nums: List[int], l: int, r: int) -> int:\n MOD = 10**9 + 7\n nums_count = Counter(nums)\n values = sorted(nums_count.values())\n values.append(0)\n dp = [1] + [0] * (len(values) - 1)\n\n for idx, val in enumerate(values):\n for i in range(idx, -1, -1):\n dp[i + 1] += dp[i] * values[i]\n dp[i + 1] %= MOD\n\n total_sum = sum(nums)\n ans = 0\n for i in range(len(values)):\n for j in range(i, len(values)):\n curr_sum = total_sum - values[i] * (j - i)\n if l <= curr_sum <= r:\n ans += dp[i] * dp[j]\n ans %= MOD\n\n return ans", "class Solution:\n def countSubMultisets(self, nums: List[int], l: int, r: int) -> int:\n MOD = 10**9 + 7\n nums_count = Counter(nums)\n sorted_nums_count = sorted(nums_count.items(), key=lambda x: x[0])\n dp = [1] + [0] * r\n for num, count in sorted_nums_count:\n new_dp = [1]\n for i in range(1, r + 1):\n if i - num >= 0:\n new_dp.append(dp[i - num] * count % MOD)\n new_dp[i] = (new_dp[i] + dp[i]) % MOD\n dp = new_dp\n return dp[l]", "class Solution:\n def countSubMultisets(self, nums: List[int], l: int, r: int) -> int:\n MOD = 10**9 + 7\n nums_count = Counter(nums)\n dp = [0] * (40001)\n dp[0] = 1\n for num, count in nums_count.items():\n new_dp = [0] * len(dp)\n for i in range(len(dp)):\n for j in range(count + 1):\n new_dp[i + num * j] = (new_dp[i + num * j] + dp[i]) % MOD\n dp = new_dp\n return sum(dp[l:r+1]) % MOD", "class Solution:\n def countSubMultisets(self, nums: List[int], l: int, r: int) -> int:\n MOD = 10**9 + 7\n nums_count = Counter(nums)\n values = sorted(nums_count.values())\n dp = [1] + [0] * (len(values) - 1)\n for i in range(1, len(dp)):\n dp[i] = (dp[i - 1] * (values[i - 1] + 1)) % MOD\n\n dp_sum = [0] * (len(dp) + 1)\n dp_sum[0] = 1\n for i in range(len(dp)):\n dp_sum[i + 1] = (dp_sum[i] + dp[i]) % MOD\n\n total_sum = sum(nums_count.keys())\n ans = 0\n for i in range(len(dp)):\n if l <= total_sum - values[i] * (i + 1) <= r:\n ans = (ans + dp_sum[i]) % MOD\n\n return ans", "class Solution:\n def countSubMultisets(self, nums: List[int], l: int, r: int) -> int:\n MOD = 10**9 + 7\n nums_count = [0] + [nums.count(i) for i in range(max(nums) + 1)]\n dp = [1] + [0] * r\n for num, count in enumerate(nums_count):\n for i in range(l - num, -1, -1):\n dp[i + num] = (dp[i + num] + dp[i] * count) % MOD\n for i in range(r - num, -1, -1):\n dp[i] = (dp[i] + dp[i + num] * count) % MOD\n return dp[l]", "class Solution:\n def countSubMultisets(self, nums: List[int], l: int, r: int) -> int:\n MOD = 10**9 + 7\n nums_count = Counter(nums)\n sorted_nums_count = sorted(nums_count.items(), key=lambda x: x[0])\n dp = [1] + [0] * r\n for num, count in sorted_nums_count:\n new_dp = [1]\n for i in range(1, r + 1):\n if i - num >= 0:\n new_dp.append(dp[i - num] + new_dp[i - num])\n else:\n new_dp.append(dp[i])\n new_dp[-1] += 1\n dp = new_dp\n return dp[l] % MOD", "class Solution:\n def countSubMultisets(self, nums: List[int], l: int, r: int) -> int:\n MOD = 10**9 + 7\n nums_count = Counter(nums)\n dp = [0] * (2 * 10**4 + 1)\n dp[0] = 1\n for num, count in nums_count.items():\n new_dp = [0] * (2 * 10**4 + 1)\n for i in range(len(dp)):\n for j in range(count + 1):\n new_sum = i + (num * j)\n if new_sum <= 2 * 10**4:\n new_dp[new_sum] += dp[i]\n dp = new_dp\n return sum(dp[l:r+1]) % MOD", "class Solution:\n def countSubMultisets(self, nums: List[int], l: int, r: int) -> int:\n MOD = 10**9 + 7\n nums_count = Counter(nums)\n sorted_nums_count = sorted(nums_count.items(), key=lambda x: x[0])\n dp = [1] + [0] * r\n for num, count in sorted_nums_count:\n new_dp = [1]\n for i in range(1, r + 1):\n if i - num >= 0:\n new_dp.append(dp[i - num] + new_dp[i - num])\n else:\n new_dp.append(dp[i])\n new_dp = [x * count + 1 for x in new_dp] % MOD\n dp = new_dp\n return dp[l]", "class Solution:\n def countSubMultisets(self, nums: List[int], l: int, r: int) -> int:\n mod = 10**9 + 7\n nums_count = Counter(nums)\n sorted_nums_count = sorted(nums_count.items(), key=lambda x: x[0])\n dp = [1] + [0] * (l + 1)\n for num, freq in sorted_nums_count:\n new_dp = [1]\n for i in range(1, l + 1):\n if i >= num:\n new_dp.append((new_dp[-1] + dp[i - num]) % mod)\n else:\n new_dp.append(new_dp[-1])\n for i in range(l + 1):\n dp[i] = (dp[i] + new_dp[i] * freq) % mod\n return dp[l]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def sumIndicesWithKSetBits(self, nums: List[int], k: int) -> int:\n index_sum = 0\n for i, num in enumerate(nums):\n if bin(i + 1).count('1') == k:\n index_sum += num\n return index_sum", "class Solution:\n def sumIndicesWithKSetBits(self, nums: List[int], k: int) -> int:\n index_sum = 0\n for i in range(len(nums)):\n binary_str = bin(i)[2:] # Convert index to binary string and remove the '0b' prefix\n if binary_str.count('1') == k: # Count the number of '1's in the binary string\n index_sum += nums[i]\n return index_sum", "class Solution:\n def sumIndicesWithKSetBits(self, nums: List[int], k: int) -> int:\n index_sum = 0\n for i in range(len(nums)):\n binary_str = bin(i)[2:] # Convert index to binary string and remove the '0b' prefix\n if binary_str.count('1') == k: # Count the number of set bits\n index_sum += nums[i]\n return index_sum", "class Solution:\n def sumIndicesWithKSetBits(self, nums: List[int], k: int) -> int:\n index_sum = 0\n for i in range(len(nums)):\n binary_str = bin(i)[2:] # Convert index to binary string and remove the '0b' prefix\n if binary_str.count('1') == k: # Count the number of set bits\n index_sum += nums[i]\n return index_sum", "class Solution:\n def sumIndicesWithKSetBits(self, nums: List[int], k: int) -> int:\n index_sum = 0\n for i, num in enumerate(nums):\n if bin(i).count('1') == k:\n index_sum += num\n return index_sum", "class Solution:\n def sumIndicesWithKSetBits(self, nums: List[int], k: int) -> int:\n index_sum = 0\n for i in range(len(nums)):\n if bin(i).count('1') == k:\n index_sum += nums[i]\n return index_sum", "class Solution:\n def sumIndicesWithKSetBits(self, nums: List[int], k: int) -> int:\n index_sum = 0\n for i in range(len(nums)):\n if bin(i).count('1') == k:\n index_sum += nums[i]\n return index_sum", "class Solution:\n def sumIndicesWithKSetBits(self, nums: List[int], k: int) -> int:\n index_sum = 0\n for i in range(len(nums)):\n if bin(i).count('1') == k:\n index_sum += nums[i]\n return index_sum", "class Solution:\n def sumIndicesWithKSetBits(self, nums: List[int], k: int) -> int:\n index_sum = 0\n for i in range(len(nums)):\n if bin(i).count('1') == k:\n index_sum += nums[i]\n return index_sum", "class Solution:\n def sumIndicesWithKSetBits(self, nums: List[int], k: int) -> int:\n index_sum = 0\n for i, num in enumerate(nums):\n if bin(i).count('1') == k:\n index_sum += num\n return index_sum" ], "pass1_list": [ false, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minOperations(self, nums: List[int]) -> int:\n count_map = {}\n for num in nums:\n count_map[num] = count_map.get(num, 0) + 1\n\n operations = 0\n for count in count_map.values():\n if count % 2 == 1:\n return -1\n operations += count // 2\n if count % 3 == 0:\n operations -= count // 3\n return operations", "class Solution:\n def minOperations(self, nums: List[int]) -> int:\n count_map = {}\n for num in nums:\n count_map[num] = count_map.get(num, 0) + 1\n\n operations = 0\n for count in count_map.values():\n if count % 2 == 1:\n return -1\n operations += count // 2\n operations += count // 3\n\n return operations", "class Solution:\n def minOperations(self, nums: List[int]) -> int:\n count_map = {}\n for num in nums:\n count_map[num] = count_map.get(num, 0) + 1\n\n operations = 0\n for count in count_map.values():\n if count % 2 == 1:\n return -1\n operations += count // 2\n operations += count // 3\n\n return operations", "class Solution:\n def minOperations(self, nums: List[int]) -> int:\n count_map = {}\n for num in nums:\n count_map[num] = count_map.get(num, 0) + 1\n\n operations = 0\n for count in count_map.values():\n if count % 2 == 1:\n return -1\n if count % 4 == 2:\n operations += 1\n operations += count // 4 + count // 2\n\n return operations // 2", "class Solution:\n def minOperations(self, nums: List[int]) -> int:\n count_map = {}\n for num in nums:\n count_map[num] = count_map.get(num, 0) + 1\n\n operations = 0\n for count in count_map.values():\n if count % 2 == 1:\n return -1\n operations += count // 2\n if count >= 3:\n operations += count // 3\n return operations", "class Solution:\n def minOperations(self, nums: List[int]) -> int:\n count_map = {}\n for num in nums:\n count_map[num] = count_map.get(num, 0) + 1\n\n operations = 0\n for count in count_map.values():\n if count % 2 == 1:\n return -1\n elif count % 4 == 2:\n operations += 1\n elif count % 4 == 3:\n operations += 2\n else:\n operations += count // 4\n\n return operations", "class Solution:\n def minOperations(self, nums: List[int]) -> int:\n count_map = {}\n for num in nums:\n count_map[num] = count_map.get(num, 0) + 1\n\n operations = 0\n for count in count_map.values():\n if count % 2 == 1:\n return -1\n operations += count // 2\n operations += count // 3\n\n return operations", "class Solution:\n def minOperations(self, nums: List[int]) -> int:\n count_map = {}\n for num in nums:\n count_map[num] = count_map.get(num, 0) + 1\n\n operations = 0\n for count in count_map.values():\n if count % 2 == 1:\n return -1\n operations += count // 2\n operations += count // 3\n\n return operations", "class Solution:\n def minOperations(self, nums: List[int]) -> int:\n count_map = {}\n for num in nums:\n count_map[num] = count_map.get(num, 0) + 1\n\n operations = 0\n for count in count_map.values():\n if count % 2 == 1:\n return -1\n operations += count // 2\n operations += count // 3\n\n return operations", "class Solution:\n def minOperations(self, nums: List[int]) -> int:\n count_map = {}\n for num in nums:\n count_map[num] = count_map.get(num, 0) + 1\n\n operations = 0\n for count in count_map.values():\n if count % 2 == 1:\n return -1\n operations += count // 2\n operations += count // 3\n\n return operations" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countWays(self, nums: List[int]) -> int:\n count = 0\n for i in range(len(nums)):\n if nums[i] == 0 or nums[i] == len(nums) - 1:\n count += 1\n return count + 1", "class Solution:\n def countWays(self, nums: List[int]) -> int:\n count = 0\n freq = {}\n for num in nums:\n if num in freq:\n freq[num] += 1\n else:\n freq[num] = 1\n for key, value in freq.items():\n if key == 0 or key == len(nums):\n count += 1\n else:\n count += 2\n return count", "class Solution:\n def countWays(self, nums: List[int]) -> int:\n count = [0] * len(nums)\n for num in nums:\n count[num] += 1\n ways = 1\n for i in range(len(count)):\n if count[i] > 1:\n return 0\n if count[i] == 1:\n ways *= i + 1\n return ways", "class Solution:\n def countWays(self, nums: List[int]) -> int:\n count = [0] * len(nums)\n for num in nums:\n count[num] += 1\n ways = 1\n for i in range(len(count)):\n if count[i] > 1:\n return 0\n if count[i] == 1:\n ways *= i + 1\n return ways", "class Solution:\n def countWays(self, nums: List[int]) -> int:\n count = 0\n freq = [0] * len(nums)\n for num in nums:\n freq[num] += 1\n freq[0] -= 1\n freq[len(nums)] -= 1\n for i in range(len(nums)):\n if freq[i] > 0:\n count += 1\n return count", "class Solution:\n def countWays(self, nums: List[int]) -> int:\n count = [0] * len(nums)\n for num in nums:\n count[num] += 1\n return sum(1 for c in count if c == 0 or c == len(nums))", "class Solution:\n def countWays(self, nums: List[int]) -> int:\n count = 0\n freq = {}\n for num in nums:\n if num in freq:\n freq[num] += 1\n else:\n freq[num] = 1\n for key, value in freq.items():\n if key == 0 or key == len(nums):\n count += 1\n else:\n count += 2\n return count", "class Solution:\n def countWays(self, nums: List[int]) -> int:\n count = 0\n for i in range(len(nums)):\n if nums[i] == 0 or nums[i] == len(nums) - 1:\n count += 1\n return count", "class Solution:\n def countWays(self, nums: List[int]) -> int:\n count = [0] * len(nums)\n for num in nums:\n count[num] += 1\n ways = 1\n for i in range(len(count)):\n if count[i] > 1:\n return 0\n if count[i] == 1:\n ways *= i\n return ways", "class Solution:\n def countWays(self, nums: List[int]) -> int:\n count = [0] * len(nums)\n for num in nums:\n count[num] += 1\n ways = 1\n for i in range(len(count)):\n if count[i] > 1:\n return 0\n if count[i] == 1:\n ways *= i + 1\n return ways" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def lengthOfLongestSubsequence(self, nums: List[int], target: int) -> int:\n dp = [0] * (target + 1)\n dp[0] = 0\n ans = 0\n\n for num in nums:\n for i in range(target, num - 1, -1):\n dp[i] = max(dp[i], dp[i - num] + 1)\n ans = max(ans, dp[target])\n\n return ans if ans else -1", "class Solution:\n def lengthOfLongestSubsequence(self, nums: List[int], target: int) -> int:\n dp = [0] * (target + 1)\n dp[0] = 0\n ans = 0\n\n for num in nums:\n for i in range(target, num - 1, -1):\n dp[i] = max(dp[i], dp[i - num] + 1)\n ans = max(ans, dp[target])\n\n return ans if ans else -1", "class Solution:\n def lengthOfLongestSubsequence(self, nums: List[int], target: int) -> int:\n dp = [0] * (target + 1)\n dp[0] = 1\n max_len = 0\n\n for num in nums:\n for i in range(target, num - 1, -1):\n dp[i] = dp[i] or dp[i - num]\n if dp[target]:\n max_len = max(max_len, 1 + dp[target - num])\n\n return max_len if max_len > 0 else -1", "class Solution:\n def lengthOfLongestSubsequence(self, nums: List[int], target: int) -> int:\n dp = [0] * (target + 1)\n dp[0] = 1\n max_len = 0\n\n for num in nums:\n for i in range(target, num - 1, -1):\n dp[i] = dp[i] or dp[i - num]\n if dp[target]:\n max_len = max(max_len, 1 + dp[target - num])\n\n return max_len if max_len > 0 else -1", "class Solution:\n def lengthOfLongestSubsequence(self, nums: List[int], target: int) -> int:\n dp = [0] * (target + 1)\n dp[0] = 1\n max_len = 1\n\n for num in nums:\n for i in range(target, num - 1, -1):\n dp[i] = dp[i] or dp[i - num]\n if dp[target]:\n max_len = max(max_len, 1 + dp[target])\n\n return max_len if max_len > 0 else -1", "class Solution:\n def lengthOfLongestSubsequence(self, nums: List[int], target: int) -> int:\n dp = [0] * (target + 1)\n dp[0] = 0\n ans = 0\n\n for num in nums:\n for i in range(target, num - 1, -1):\n dp[i] = max(dp[i], dp[i - num] + 1)\n ans = max(ans, dp[target])\n\n return ans if ans else -1", "class Solution:\n def lengthOfLongestSubsequence(self, nums: List[int], target: int) -> int:\n dp = [0] * (target + 1)\n dp[0] = 0\n ans = 0\n\n for num in nums:\n for i in range(target, num - 1, -1):\n dp[i] = max(dp[i], dp[i - num] + 1)\n ans = max(ans, dp[target])\n\n return ans if ans else -1", "class Solution:\n def lengthOfLongestSubsequence(self, nums: List[int], target: int) -> int:\n dp = [0] * (target + 1)\n dp[0] = 0\n ans = 0\n\n for num in nums:\n for i in range(target, num - 1, -1):\n dp[i] = max(dp[i], dp[i - num] + 1)\n ans = max(ans, dp[target])\n\n return ans if ans else -1", "class Solution:\n def lengthOfLongestSubsequence(self, nums: List[int], target: int) -> int:\n dp = [0] * (target + 1)\n dp[0] = 0\n ans = 0\n\n for num in nums:\n for i in range(target, num - 1, -1):\n dp[i] = max(dp[i], dp[i - num] + 1)\n ans = max(ans, dp[target])\n\n return ans if ans else -1", "class Solution:\n def lengthOfLongestSubsequence(self, nums: List[int], target: int) -> int:\n dp = [0] * (target + 1)\n dp[0] = 1\n max_len = 1\n\n for num in nums:\n for i in range(target, num - 1, -1):\n dp[i] = dp[i] or dp[i - num]\n if dp[target]:\n max_len = max(max_len, 1 + dp[target])\n\n return max_len if max_len > 0 else -1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumSumOfHeights(self, maxHeights: List[int]) -> int:\n n = len(maxHeights)\n left_max = [0] * n\n right_max = [0] * n\n\n left_max[0] = maxHeights[0]\n for i in range(1, n):\n left_max[i] = max(left_max[i - 1], maxHeights[i])\n\n right_max[n - 1] = maxHeights[n - 1]\n for i in range(n - 2, -1, -1):\n right_max[i] = max(right_max[i + 1], maxHeights[i])\n\n max_sum = 0\n for i in range(n):\n height = min(left_max[i], right_max[i])\n max_sum = max(max_sum, height + maxHeights[i])\n\n return max_sum", "class Solution:\n def maximumSumOfHeights(self, maxHeights: List[int]) -> int:\n n = len(maxHeights)\n left_max = [0] * n\n right_max = [0] * n\n left_max[0] = maxHeights[0]\n for i in range(1, n):\n left_max[i] = max(left_max[i - 1], maxHeights[i])\n right_max[n - 1] = maxHeights[n - 1]\n for i in range(n - 2, -1, -1):\n right_max[i] = max(right_max[i + 1], maxHeights[i])\n max_sum = 0\n for i in range(n):\n max_sum = max(max_sum, left_max[i] + right_max[i])\n return max_sum", "class Solution:\n def maximumSumOfHeights(self, maxHeights: List[int]) -> int:\n n = len(maxHeights)\n left_max = [0] * n\n right_max = [0] * n\n\n left_max[0] = maxHeights[0]\n for i in range(1, n):\n left_max[i] = max(left_max[i - 1], maxHeights[i])\n\n right_max[n - 1] = maxHeights[n - 1]\n for i in range(n - 2, -1, -1):\n right_max[i] = max(right_max[i + 1], maxHeights[i])\n\n max_sum = 0\n for i in range(n):\n max_sum = max(max_sum, left_max[i] + right_max[i])\n\n return max_sum", "class Solution:\n def maximumSumOfHeights(self, maxHeights: List[int]) -> int:\n n = len(maxHeights)\n left_max = [0] * n\n right_max = [0] * n\n left_max[0] = maxHeights[0]\n for i in range(1, n):\n left_max[i] = max(left_max[i - 1], maxHeights[i])\n right_max[n - 1] = maxHeights[n - 1]\n for i in range(n - 2, -1, -1):\n right_max[i] = max(right_max[i + 1], maxHeights[i])\n max_sum = 0\n for i in range(n):\n max_sum = max(max_sum, left_max[i] + right_max[i] - maxHeights[i])\n return max_sum", "class Solution:\n def maximumSumOfHeights(self, maxHeights: List[int]) -> int:\n n = len(maxHeights)\n left_max = [0] * n\n right_max = [0] * n\n left_max[0] = maxheights[0]\n for i in range(1, n):\n left_max[i] = max(left_max[i - 1], maxheights[i])\n right_max[n - 1] = maxheights[n - 1]\n for i in range(n - 2, -1, -1):\n right_max[i] = max(right_max[i + 1], maxheights[i])\n ans = 0\n for i in range(n):\n ans = max(ans, left_max[i] + right_max[i] - maxheights[i])\n return ans", "class Solution:\n def maximumSumOfHeights(self, maxHeights: List[int]) -> int:\n n = len(maxHeights)\n left_max = [0] * n\n right_max = [0] * n\n sum_heights = 0\n\n left_max[0] = maxHeights[0]\n for i in range(1, n):\n left_max[i] = max(left_max[i - 1], maxHeights[i])\n\n right_max[n - 1] = maxHeights[n - 1]\n for i in range(n - 2, -1, -1):\n right_max[i] = max(right_max[i + 1], maxHeights[i])\n\n for i in range(n):\n sum_heights += min(left_max[i], right_max[i])\n\n return sum_heights", "class Solution:\n def maximumSumOfHeights(self, maxHeights: List[int]) -> int:\n n = len(maxHeights)\n left_max = [0] * n\n right_max = [0] * n\n total_sum = 0\n\n left_max[0] = maxheights[0]\n for i in range(1, n):\n left_max[i] = max(left_max[i - 1], maxheights[i])\n\n right_max[n - 1] = maxheights[n - 1]\n for i in range(n - 2, -1, -1):\n right_max[i] = max(right_max[i + 1], maxheights[i])\n\n for i in range(n):\n total_sum += min(left_max[i], right_max[i])\n\n return total_sum", "class Solution:\n def maximumSumOfHeights(self, maxHeights: List[int]) -> int:\n n = len(maxHeights)\n heights = [1] * n\n total_sum = sum(maxHeights)\n\n for i in range(1, n):\n heights[i] = max(heights[i], heights[i - 1] + 1)\n\n for i in range(n - 2, -1, -1):\n height = min(maxHeights[i], heights[i + 1] - 1)\n max_sum = max(max_sum, height * (i + 2))\n heights[i] = max(heights[i], height)\n\n return total_sum - max_sum", "class Solution:\n def maximumSumOfHeights(self, maxHeights: List[int]) -> int:\n n = len(maxHeights)\n left_max = [0] * n\n right_max = [0] * n\n\n left_max[0] = maxHeights[0]\n for i in range(1, n):\n left_max[i] = max(left_max[i - 1], maxHeights[i])\n\n right_max[n - 1] = maxHeights[n - 1]\n for i in range(n - 2, -1, -1):\n right_max[i] = max(right_max[i + 1], maxHeights[i])\n\n max_sum = 0\n for i in range(n):\n max_sum = max(max_sum, left_max[i] + right_max[i])\n\n return max_sum", "class Solution:\n def maximumSumOfHeights(self, maxHeights: List[int]) -> int:\n n = len(maxHeights)\n left_max = [0] * n\n right_max = [0] * n\n sum_heights = 0\n\n left_max[0] = maxHeights[0]\n for i in range(1, n):\n left_max[i] = max(left_max[i - 1], maxHeights[i])\n\n right_max[n - 1] = maxHeights[n - 1]\n for i in range(n - 2, -1, -1):\n right_max[i] = max(right_max[i + 1], maxHeights[i])\n\n for i in range(n):\n sum_heights += min(left_max[i], right_max[i])\n\n return sum_heights" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minSizeSubarray(self, nums: List[int], target: int) -> int:\n n = len(nums)\n acc_sum = [0]\n for num in nums:\n acc_sum.append(acc_sum[-1] + num)\n\n left = 0\n right = 0\n min_len = n + 1\n found = False\n\n while right < n + 1:\n if acc_sum[right] - acc_sum[left] == target:\n min_len = min(min_len, right - left)\n found = True\n right += 1\n left = max(left, right - min_len)\n elif acc_sum[right] - acc_sum[left] < target:\n right += 1\n else:\n left += 1\n\n if found:\n return min_len\n else:\n return -1", "class Solution:\n def minSizeSubarray(self, nums: List[int], target: int) -> int:\n n = len(nums)\n window_sum = [0] * (n + 1)\n window_sum[0] = 0\n for i in range(n):\n window_sum[i + 1] = window_sum[i] + nums[i]\n\n left = 0\n right = 0\n min_length = n + 1\n target_found = False\n\n while right < n:\n if window_sum[right + 1] - window_sum[left] == target:\n target_found = True\n min_length = min(min_length, right - left + 1)\n left += 1\n else:\n right += 1\n\n if target_found:\n return min_length\n else:\n return -1", "class Solution:\n def minSizeSubarray(self, nums: List[int], target: int) -> int:\n n = len(nums)\n window_sum = [0] * (n + 1)\n window_sum[0] = 0\n for i in range(n):\n window_sum[i + 1] = window_sum[i] + nums[i]\n\n left = 0\n right = 0\n min_length = n + 1\n target_found = False\n\n while right < n:\n if window_sum[right + 1] - window_sum[left] == target:\n target_found = True\n min_length = min(min_length, right - left + 1)\n left += 1\n else:\n right += 1\n\n if target_found:\n return min_length\n else:\n return -1", "class Solution:\n def minSizeSubarray(self, nums: List[int], target: int) -> int:\n n = len(nums)\n total_sum = sum(nums)\n if total_sum < target:\n return -1\n \n left, right = 0, 0\n window_sum = 0\n min_length = n + 1\n \n while right < n:\n window_sum += nums[right]\n while window_sum > target:\n window_sum -= nums[left]\n left += 1\n \n if window_sum == target:\n min_length = min(min_length, right - left + 1)\n right += 1\n \n return min_length if min_length <= n else -1", "class Solution:\n def minSizeSubarray(self, nums: List[int], target: int) -> int:\n n = len(nums)\n acc_sum = [0]\n for num in nums:\n acc_sum.append(acc_sum[-1] + num)\n\n left, right = 0, 0\n min_len = n + 1\n curr_sum = 0\n\n while right < n + 1:\n curr_sum += acc_sum[right] - acc_sum[left]\n right += 1\n\n while curr_sum >= target:\n min_len = min(min_len, right - left)\n curr_sum -= acc_sum[left] - acc_sum[left - 1]\n left += 1\n\n return min_len if min_len <= n else -1", "class Solution:\n def minSizeSubarray(self, nums: List[int], target: int) -> int:\n n = len(nums)\n acc_sum = [0] * (n + 1)\n acc_sum[0] = 0\n for i in range(n):\n acc_sum[i + 1] = acc_sum[i] + nums[i]\n\n left, right = 0, 0\n min_len = n + 1\n cur_sum = 0\n while right < n + 1:\n cur_sum += acc_sum[right] - acc_sum[left]\n while cur_sum >= target:\n min_len = min(min_len, right - left)\n cur_sum -= acc_sum[left] - acc_sum[left - 1]\n left += 1\n right += 1\n\n return -1 if min_len == n + 1 else min_len", "class Solution:\n def minSizeSubarray(self, nums: List[int], target: int) -> int:\n n = len(nums)\n cum_sum = [0] * (n + 1)\n for i in range(n):\n cum_sum[i + 1] = cum_sum[i] + nums[i]\n\n left, right = 0, 0\n min_len = n + 1\n curr_sum = 0\n while right < n:\n curr_sum += cum_sum[right + 1] - cum_sum[left]\n while curr_sum >= target:\n min_len = min(min_len, right - left + 1)\n curr_sum -= cum_sum[left + 1] - cum_sum[left]\n left += 1\n right += 1\n\n return -1 if min_len == n + 1 else min_len", "class Solution:\n def minSizeSubarray(self, nums: List[int], target: int) -> int:\n n = len(nums)\n total_sum = sum(nums)\n if total_sum == target:\n return n\n if total_sum > target:\n left = 0\n right = 0\n curr_sum = 0\n min_length = n + 1\n while right < n:\n curr_sum += nums[right]\n while curr_sum > target:\n curr_sum -= nums[left]\n left += 1\n if curr_sum == target:\n min_length = min(min_length, right - left + 1)\n right += 1\n return min_length if min_length <= n else -1\n else:\n return -1", "class Solution:\n def minSizeSubarray(self, nums: List[int], target: int) -> int:\n n = len(nums)\n cum_sum = [0] * (n + 1)\n for i in range(n):\n cum_sum[i + 1] = cum_sum[i] + nums[i]\n\n left, right = 0, 0\n min_length = n + 1\n curr_sum = 0\n while right < n:\n curr_sum += cum_sum[right + 1] - cum_sum[left]\n while curr_sum > target:\n curr_sum -= cum_sum[left + 1] - cum_sum[left]\n left += 1\n if curr_sum == target:\n min_length = min(min_length, right - left + 1)\n right += 1\n\n return min_length if min_length <= n else -1", "class Solution:\n def minSizeSubarray(self, nums: List[int], target: int) -> int:\n n = len(nums)\n total_sum = sum(nums)\n if total_sum == target:\n return n\n if total_sum < target:\n return -1\n left = 0\n right = 0\n curr_sum = 0\n min_length = n + 1\n while right < n:\n curr_sum += nums[right]\n while curr_sum >= target:\n min_length = min(min_length, right - left + 1)\n curr_sum -= nums[left]\n left += 1\n right += 1\n return min_length if min_length <= n else -1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def shortestBeautifulSubstring(self, s: str, k: int) -> str:\n n = len(s)\n ones_count = s.count('1')\n if ones_count < k:\n return \"\"\n\n # Initialize the min_length and min_substring\n min_length = n + 1\n min_substring = \"\"\n\n # Iterate through the string\n for i in range(n):\n current_count = 0\n current_substring = \"\"\n for j in range(i, n):\n if s[j] == '1':\n current_count += 1\n if current_count == k:\n if len(current_substring) < min_length:\n min_length = len(current_substring)\n min_substring = current_substring\n break\n current_substring += s[j]\n\n return min_substring", "class Solution:\n def shortestBeautifulSubstring(self, s: str, k: int) -> str:\n n = len(s)\n ones_count = s.count('1')\n if ones_count < k:\n return \"\"\n \n # Find the first occurrence of k ones\n start = s.find('1' * k)\n \n # If k is the total number of ones, return the substring\n if ones_count == k:\n return s[start:]\n \n # Find the last occurrence of k ones\n end = s.rfind('1' * k)\n \n # Return the lexicographically smallest substring\n return min(s[start:start+k], s[end:end+k])", "class Solution:\n def shortestBeautifulSubstring(self, s: str, k: int) -> str:\n n = len(s)\n ones_count = s.count('1')\n if ones_count < k:\n return \"\"\n if k == 1:\n return '1'\n if k == n:\n return s\n\n min_str = \"\"\n ones = 0\n for i in range(n):\n if s[i] == '1':\n ones += 1\n if ones == k:\n min_str = min(min_str, s[i - k + 1:i + 1])\n if ones > k:\n break\n\n return min_str", "class Solution:\n def shortestBeautifulSubstring(self, s: str, k: int) -> str:\n n = len(s)\n ones_count = s.count('1')\n if ones_count < k:\n return \"\"\n \n left = 0\n right = 0\n min_len = n + 1\n result = \"\"\n \n while right < n:\n if s[right] == '1':\n k -= 1\n if k == 0:\n while k == 0:\n if right - left + 1 < min_len:\n min_len = right - left + 1\n result = s[left:right+1]\n if s[left] == '1':\n k += 1\n left += 1\n right -= 1\n if left > right:\n break\n k += 1\n right += 1\n \n return result", "class Solution:\n def shortestBeautifulSubstring(self, s: str, k: int) -> str:\n n = len(s)\n ones_count = s.count('1')\n if ones_count < k:\n return \"\"\n\n # Find the first occurrence of k ones\n i = 0\n ones = 0\n for i in range(n):\n if s[i] == '1':\n ones += 1\n if ones == k:\n break\n\n # Find the last occurrence of k ones\n j = n - 1\n last_ones = 0\n while j >= i:\n if s[j] == '1':\n last_ones += 1\n if last_ones == k:\n break\n j -= 1\n\n # Return the lexicographically smallest substring\n return min(s[i:j+1], s[j:i-1:-1])", "class Solution:\n def shortestBeautifulSubstring(self, s: str, k: int) -> str:\n n = len(s)\n ones_count = s.count('1')\n if ones_count < k:\n return \"\"\n \n # Find the first occurrence of k ones\n start = s.find('1' * k)\n \n # If k is the total number of ones, return the substring\n if ones_count == k:\n return s[start:]\n \n # Find the lexicographically smallest substring\n i = start\n while i < n:\n if s[i] == '1':\n k -= 1\n if k == 0:\n break\n i += 1\n return s[start:i]", "class Solution:\n def shortestBeautifulSubstring(self, s: str, k: int) -> str:\n n = len(s)\n ones_count = s.count('1')\n if ones_count < k:\n return \"\"\n \n # Find the first occurrence of k ones\n start = s.find('1' * k)\n \n # If k is the total number of ones, return the substring\n if ones_count == k:\n return s[start:]\n \n # Find the last occurrence of k ones\n end = s.rfind('1' * k)\n \n # Loop through the substrings with k ones and find the lexicographically smallest one\n for i in range(start, end + 1):\n substr = s[i:i + (n - k)]\n if substr[k:] == '0' * (n - k):\n return substr\n \n return \"\"", "class Solution:\n def shortestBeautifulSubstring(self, s: str, k: int) -> str:\n n = len(s)\n ones_count = s.count('1')\n if ones_count < k:\n return \"\"\n \n # Find the first occurrence of k ones\n start = s.find('1' * k)\n \n # If k is the total number of ones, return the substring\n if ones_count == k:\n return s[start:]\n \n # Find the last occurrence of k ones\n end = s.rfind('1' * k)\n \n # Loop through the substrings starting from the first occurrence of k ones\n for i in range(start, end + 1):\n substr = s[i:i + k]\n ones = substr.count('1')\n if ones == k:\n return substr\n \n return \"\"", "class Solution:\n def shortestBeautifulSubstring(self, s: str, k: int) -> str:\n n = len(s)\n ones_count = s.count('1')\n if ones_count < k:\n return \"\"\n \n # Find the first occurrence of k ones\n start = s.find('1' * k)\n \n # If k is the total number of ones, return the substring\n if ones_count == k:\n return s[start:]\n \n # Find the lexicographically smallest substring\n i = start\n j = start + k\n min_substring = s[i:j]\n while j + 1 <= n:\n if s[j + 1] == '1':\n i = j - k + 1\n j = j + 1\n current_substring = s[i:j]\n if current_substring < min_substring:\n min_substring = current_substring\n else:\n j += 1\n \n return min_substring", "class Solution:\n def shortestBeautifulSubstring(self, s: str, k: int) -> str:\n n = len(s)\n ones_count = s.count('1')\n if ones_count < k:\n return \"\"\n \n # Find the first occurrence of k ones\n start = s.find('1' * k)\n \n # If k is the total number of ones, return the substring\n if ones_count == k:\n return s[start:]\n \n # Find the last occurrence of k ones\n end = s.rfind('1' * k)\n \n # Loop through the substrings with k ones and find the lexicographically smallest one\n for i in range(start, end + 1):\n substr = s[i:i + (n - k)]\n if substr[k:] == '0' * (n - k):\n return substr\n \n return \"\"" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minProcessingTime(self, processorTime: List[int], tasks: List[int]) -> int:\n tasks.sort(reverse=True)\n processorTime.sort()\n\n result = 0\n for i in range(len(processorTime)):\n result = max(result, processorTime[i] + tasks[i * 4])\n\n return result", "class Solution:\n def minProcessingTime(self, processorTime: List[int], tasks: List[int]) -> int:\n tasks.sort(reverse=True)\n processorTime.sort()\n\n result = 0\n for i in range(len(processorTime)):\n result = max(result, processorTime[i] + tasks[i * 4])\n\n return result", "class Solution:\n def minProcessingTime(self, processorTime: List[int], tasks: List[int]) -> int:\n tasks.sort(reverse=True)\n processorTime.sort()\n\n result = 0\n for i in range(len(processorTime)):\n result = max(result, processorTime[i] + tasks[i * 4])\n\n return result", "class Solution:\n def minProcessingTime(self, processorTime: List[int], tasks: List[int]) -> int:\n tasks.sort(reverse=True)\n processorTime.sort()\n\n result = 0\n for i in range(len(processorTime)):\n result = max(result, processorTime[i] + tasks[i * 4])\n\n return result", "class Solution:\n def minProcessingTime(self, processorTime: List[int], tasks: List[int]) -> int:\n tasks.sort(reverse=True)\n processorTime.sort()\n\n result = 0\n for i in range(len(processorTime)):\n result = max(result, processorTime[i] + tasks[i * 4])\n\n return result", "class Solution:\n def minProcessingTime(self, processorTime: List[int], tasks: List[int]) -> int:\n tasks.sort(reverse=True)\n processorTime.sort()\n\n result = 0\n for i in range(len(processorTime)):\n result = max(result, processorTime[i] + tasks[i * 4])\n\n return result", "class Solution:\n def minProcessingTime(self, processorTime: List[int], tasks: List[int]) -> int:\n tasks.sort(reverse=True)\n processorTime.sort()\n\n result = 0\n for i in range(len(processorTime)):\n result = max(result, processorTime[i] + tasks[i * 4])\n\n return result", "class Solution:\n def minProcessingTime(self, processorTime: List[int], tasks: List[int]) -> int:\n tasks.sort(reverse=True)\n processorTime.sort()\n\n result = 0\n for i in range(len(processorTime)):\n result = max(result, processorTime[i] + tasks[i * 4])\n\n return result", "class Solution:\n def minProcessingTime(self, processorTime: List[int], tasks: List[int]) -> int:\n tasks.sort(reverse=True)\n processorTime.sort()\n\n result = 0\n for i in range(len(processorTime)):\n result = max(result, processorTime[i] + tasks[i * 4])\n\n return result", "class Solution:\n def minProcessingTime(self, processorTime: List[int], tasks: List[int]) -> int:\n tasks.sort(reverse=True)\n processorTime.sort()\n\n result = 0\n for i in range(len(processorTime)):\n result = max(result, processorTime[i] + tasks[i * 4])\n\n return result" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxSum(self, nums: List[int], k: int) -> int:\n n = len(nums)\n if k >= n // 2:\n return sum(num ** 2 for num in sorted(nums, reverse=True)[:k]) % (10**9 + 7)\n\n nums.sort(reverse=True)\n ans = 0\n for i in range(n - 1, n - k, -1):\n ans = (ans + (nums[i] ** 2)) % (10**9 + 7)\n for j in range(i):\n nums[j] = (nums[j] | nums[i])\n return ans", "class Solution:\n def maxSum(self, nums: List[int], k: int) -> int:\n def count_bits(num):\n return bin(num).count('1')\n\n MOD = 10**9 + 7\n n = len(nums)\n nums.sort(key=count_bits)\n\n ans = 0\n for i in range(n - k + 1, n):\n ans += nums[i] * nums[i]\n ans %= MOD\n\n for i in range(n - k, n - k + 1):\n for j in range(i + 1, n):\n if count_bits(nums[i]) < count_bits(nums[j]):\n ans = max(ans, (nums[i] | nums[j]) * (nums[i] | nums[j]) + (nums[i] & nums[j]) * (nums[i] & nums[j]))\n ans %= MOD\n\n return ans", "class Solution:\n def maxSum(self, nums: List[int], k: int) -> int:\n def get_max(bit: int) -> int:\n count = collections.Counter(num & bit for num in nums)\n res = 0\n for i in range(30, -1, -1):\n if bit >> i & 1:\n res += (1 << i) ** 2 * min(count[bit], k)\n k -= min(count[bit], k)\n if not k:\n break\n return res % (10**9 + 7)\n\n return max(get_max(bit) for bit in range(1 << 30))", "class Solution:\n def maxSum(self, nums: List[int], k: int) -> int:\n n = len(nums)\n if k == 1:\n return sum(nums) % (10**9 + 7)\n\n nums.sort(reverse=True)\n\n for i in range(1, n):\n nums[i] = nums[i] | nums[i - 1]\n\n dp = [0] * (k + 1)\n dp[1] = nums[0] % (10**9 + 7)\n\n for i in range(1, n):\n for j in range(2, min(k + 1, i + 2):\n dp[j] = max(dp[j], dp[j - 1] + (nums[i] - nums[i - j + 1]) ** 2)\n\n return dp[k]", "class Solution:\n def maxSum(self, nums: List[int], k: int) -> int:\n n = len(nums)\n if k >= n // 2:\n return sum(num ** 2 for num in sorted(nums, reverse=True)[:k]) % (10**9 + 7)\n\n nums.sort(reverse=True)\n ans = 0\n for i in range(n):\n for j in range(i + 1, n):\n x = nums[i] & nums[j]\n y = nums[i] | nums[j]\n nums[j] = y\n ans = max(ans, (x ** 2 + self.maxSum(nums[j + 1:], k - 1)) % (10**9 + 7))\n return ans", "class Solution:\n def maxSum(self, nums: List[int], k: int) -> int:\n def count_bits(num):\n return bin(num).count('1')\n\n nums.sort(key=count_bits)\n k = min(k, len(nums))\n\n max_sum = 0\n for i in range(len(nums) - k + 1):\n cur_sum = 0\n for j in range(i, i + k):\n cur_sum += nums[j] ** 2\n max_sum = max(max_sum, cur_sum)\n\n return max_sum % (10**9 + 7)", "class Solution:\n def maxSum(self, nums: List[int], k: int) -> int:\n def count_bits(num):\n return bin(num).count('1')\n\n nums.sort(key=count_bits)\n\n n = len(nums)\n mod = 10**9 + 7\n ans = 0\n for i in range(n - k + 1, n):\n ans = (ans + nums[i] * nums[i]) % mod\n\n for i in range(n - k, n - k + 1):\n j = 0\n while j < i:\n nums[i] = (nums[i] | nums[j])\n nums[j] = (nums[i] & nums[j])\n j += 1\n\n for i in range(n - k, n):\n ans = max(ans, (ans + nums[i] * nums[i]) % mod)\n\n return ans", "class Solution:\n def maxSum(self, nums: List[int], k: int) -> int:\n n = len(nums)\n if k >= n // 2:\n return sum(x * x for x in sorted(nums, reverse=True)[:k]) % (10**9 + 7)\n\n nums.sort(reverse=True)\n ans = 0\n for i in range(n):\n for j in range(30, -1, -1):\n if n - 1 - i + 2 ** (j - 1) >= k:\n ans = max(ans, nums[i] * nums[i] + (n - 1 - i + 2 ** (j - 1) - k) * (2**j))\n break\n return ans % (10**9 + 7)", "class Solution:\n def maxSum(self, nums: List[int], k: int) -> int:\n def get_max(bit: int) -> int:\n count = collections.Counter(num & bit for num in nums)\n max_val = 0\n for i in range(30, -1, -1):\n if count[bit | (1 << i)] > 0:\n max_val += 2 ** i\n bit |= 1 << i\n if count[bit] == 1:\n count[bit] = 0\n else:\n count[bit] -= 1\n return max_val\n\n max_sum = 0\n for bit in range(1 << 30):\n max_sum = max(max_sum, get_max(bit))\n\n return (max_sum * k) % (10**9 + 7)", "class Solution:\n def maxSum(self, nums: List[int], k: int) -> int:\n def count_bits(num):\n return bin(num).count('1')\n \n nums.sort(key=count_bits)\n \n n = len(nums)\n k = min(k, n - k)\n \n ans = 0\n for i in range(k):\n ans += nums[i] ** 2 % (10**9 + 7)\n for i in range(n - k, n):\n ans += nums[i] ** 2 % (10**9 + 7)\n \n return ans % (10**9 + 7)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumTripletValue(self, nums: List[int]) -> int:\n n = len(nums)\n max_val = 0\n for i in range(n - 2):\n for j in range(i + 1, n - 1):\n for k in range(j + 1, n):\n max_val = max(max_val, (nums[i] - nums[j]) * nums[k])\n return max_val if max_val > 0 else 0", "class Solution:\n def maximumTripletValue(self, nums: List[int]) -> int:\n n = len(nums)\n max_val = 0\n for i in range(n - 2):\n for j in range(i + 1, n - 1):\n for k in range(j + 1, n):\n max_val = max(max_val, (nums[i] - nums[j]) * nums[k])\n return max_val if max_val > 0 else 0", "class Solution:\n def maximumTripletValue(self, nums: List[int]) -> int:\n n = len(nums)\n max_val = 0\n for i in range(n - 2):\n for j in range(i + 1, n - 1):\n for k in range(j + 1, n):\n max_val = max(max_val, (nums[i] - nums[j]) * nums[k])\n return max_val if max_val > 0 else 0", "class Solution:\n def maximumTripletValue(self, nums: List[int]) -> int:\n n = len(nums)\n max_val = 0\n for i in range(n - 2):\n for j in range(i + 1, n - 1):\n for k in range(j + 1, n):\n max_val = max(max_val, (nums[i] - nums[j]) * nums[k])\n return max_val if max_val > 0 else 0", "class Solution:\n def maximumTripletValue(self, nums: List[int]) -> int:\n n = len(nums)\n max_val = 0\n for i in range(n - 2):\n for j in range(i + 1, n - 1):\n for k in range(j + 1, n):\n max_val = max(max_val, (nums[i] - nums[j]) * nums[k])\n return max_val if max_val > 0 else 0", "class Solution:\n def maximumTripletValue(self, nums: List[int]) -> int:\n n = len(nums)\n max_val = 0\n for i in range(n - 2):\n for j in range(i + 1, n - 1):\n for k in range(j + 1, n):\n max_val = max(max_val, (nums[i] - nums[j]) * nums[k])\n return max_val if max_val > 0 else 0", "class Solution:\n def maximumTripletValue(self, nums: List[int]) -> int:\n n = len(nums)\n max_val = 0\n for i in range(n - 2):\n for j in range(i + 1, n - 1):\n for k in range(j + 1, n):\n max_val = max(max_val, (nums[i] - nums[j]) * nums[k])\n return max_val if max_val > 0 else 0", "class Solution:\n def maximumTripletValue(self, nums: List[int]) -> int:\n n = len(nums)\n max_val = 0\n for i in range(n - 2):\n for j in range(i + 1, n - 1):\n for k in range(j + 1, n):\n max_val = max(max_val, (nums[i] - nums[j]) * nums[k])\n return max_val if max_val > 0 else 0", "class Solution:\n def maximumTripletValue(self, nums: List[int]) -> int:\n n = len(nums)\n max_val = 0\n for i in range(n - 2):\n for j in range(i + 1, n - 1):\n for k in range(j + 1, n):\n max_val = max(max_val, (nums[i] - nums[j]) * nums[k])\n return max_val if max_val > 0 else 0", "class Solution:\n def maximumTripletValue(self, nums: List[int]) -> int:\n n = len(nums)\n max_val = 0\n for i in range(n - 2):\n for j in range(i + 1, n - 1):\n for k in range(j + 1, n):\n max_val = max(max_val, (nums[i] - nums[j]) * nums[k])\n return max_val if max_val > 0 else 0" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def sumCounts(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 1\n count = 1\n ans = 0\n for i in range(n):\n if i > 0 and nums[i] == nums[i - 1]:\n count += dp[i] - dp[i - 1]\n else:\n count = 1\n dp[i + 1] = dp[i] + count\n ans += (dp[i + 1] - dp[i]) * (dp[i + 1] - dp[i])\n return ans", "class Solution:\n def sumCounts(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 1\n ans = 0\n for i in range(n):\n dp[i + 1] = dp[i]\n if i > 0 and nums[i] == nums[i - 1]:\n dp[i + 1] += 1\n ans += dp[i + 1] * (n - i - dp[i + 1] + 1)\n return ans", "class Solution:\n def sumCounts(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 1\n distinct_count = 0\n ans = 0\n\n for i in range(n):\n if dp[distinct_count] == 0:\n distinct_count += 1\n dp[distinct_count] += 1\n ans += (i + 1) ** 2 * dp[distinct_count]\n if nums[i] == distinct_count:\n distinct_count += 1\n\n return ans", "class Solution:\n def sumCounts(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 1\n count = 1\n for i in range(n):\n if i == 0 or nums[i] != nums[i - 1]:\n count += 1\n dp[i + 1] = dp[i] + count\n ans = 0\n for i in range(n):\n ans += dp[i] * dp[i + 1]\n return ans", "class Solution:\n def sumCounts(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 1\n count = 1\n ans = 0\n for i in range(n):\n if i > 0 and nums[i] == nums[i - 1]:\n count += 1\n else:\n count = 1\n dp[i + 1] = dp[i] + count\n ans += (dp[i + 1]) ** 2\n return ans", "class Solution:\n def sumCounts(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 1\n count = 1\n ans = 0\n for i in range(n):\n if dp[count] < count:\n ans += count * count\n dp[count] += 1\n else:\n dp[count] = 1\n count += 1\n return ans", "class Solution:\n def sumCounts(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 1\n count = 1\n for i in range(n):\n if i > 0 and nums[i] == nums[i - 1]:\n count += dp[i]\n else:\n count = dp[i]\n dp[i + 1] = count\n return sum(x**2 for x in dp) - n", "class Solution:\n def sumCounts(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 1\n distinct_count = 0\n ans = 0\n\n for i in range(n):\n distinct_count += nums[i] != nums[i - 1] if i > 0 else 1\n dp[i + 1] = dp[i] + distinct_count\n ans += dp[i + 1] * dp[i + 1]\n\n return ans", "class Solution:\n def sumCounts(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 1\n count = 1\n ans = 0\n for i in range(n):\n if i > 0 and nums[i] == nums[i - 1]:\n count += 1\n else:\n count = 1\n dp[i + 1] = dp[i] + count\n ans += (dp[i + 1] ** 2) - (dp[i] ** 2)\n return ans", "class Solution:\n def sumCounts(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 1\n count = 1\n for i in range(n):\n if i == 0 or nums[i] != nums[i - 1]:\n count += 1\n dp[i + 1] = dp[i] + count\n ans = 0\n for i in range(n):\n ans += (dp[i + 1] - dp[i]) ** 2\n return ans" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def lastVisitedIntegers(self, words: List[str]) -> List[int]:\n stack = []\n result = []\n for word in words:\n if word != \"prev\":\n stack.append(int(word))\n else:\n if stack:\n k = len(stack) - len(result) - 1\n if k < len(stack):\n result.append(stack[- k - 1])\n else:\n result.append(-1)\n return result[::-1]", "class Solution:\n def lastVisitedIntegers(self, words: List[str]) -> List[int]:\n stack = []\n result = []\n for word in words:\n if word != \"prev\":\n stack.append(int(word))\n else:\n if stack:\n k = len(stack) - 1 - result.count(-1)\n if k > 0:\n result.append(stack[-k])\n else:\n result.append(-1)\n else:\n result.append(-1)\n return result", "class Solution:\n def lastVisitedIntegers(self, words: List[str]) -> List[int]:\n nums = []\n result = []\n for word in words:\n if word != \"prev\":\n nums.append(int(word))\n else:\n k = len(nums) - 1 - len(result)\n if k >= 0:\n result.append(nums[k])\n else:\n result.append(-1)\n return result[::-1]", "class Solution:\n def lastVisitedIntegers(self, words: List[str]) -> List[int]:\n stack = []\n result = []\n for word in words:\n if word != \"prev\":\n stack.append(int(word))\n if len(stack) > 2:\n stack.pop(0)\n else:\n if stack:\n result.append(stack[-1])\n stack[-1] = -1\n else:\n result.append(-1)\n return result", "class Solution:\n def lastVisitedIntegers(self, words: List[str]) -> List[int]:\n nums = []\n result = []\n for word in words:\n if word != \"prev\":\n nums.append(int(word))\n else:\n k = len(nums) - len(result) - 1\n if k >= 0:\n result.append(nums[-k-1])\n else:\n result.append(-1)\n return result[::-1]", "class Solution:\n def lastVisitedIntegers(self, words: List[str]) -> List[int]:\n nums = []\n result = []\n for word in words:\n if word != \"prev\":\n nums.append(int(word))\n else:\n k = len(nums) - 1 - len(result)\n if k >= 0:\n result.append(nums[k])\n else:\n result.append(-1)\n return result[::-1]", "class Solution:\n def lastVisitedIntegers(self, words: List[str]) -> List[int]:\n result = []\n stack = []\n count = 0\n\n for word in words:\n if word != \"prev\":\n stack.append(int(word))\n count += 1\n\n if word == \"prev\" and stack:\n result.append(stack.pop())\n elif word == \"prev\":\n result.append(-1)\n\n while stack:\n result.append(stack.pop())\n\n return result[::-1]", "class Solution:\n def lastVisitedIntegers(self, words: List[str]) -> List[int]:\n stack = []\n result = []\n for word in words:\n if word != \"prev\":\n stack.append(int(word))\n else:\n if stack:\n k = len(stack) - 1 - result.count(\"prev\")\n if k >= 0:\n result.append(stack[k])\n else:\n result.append(-1)\n else:\n result.append(-1)\n return result", "class Solution:\n def lastVisitedIntegers(self, words: List[str]) -> List[int]:\n nums = []\n result = []\n for word in words:\n if word != \"prev\":\n nums.append(int(word))\n else:\n k = len(nums) - 1 - len(result)\n if k >= 0:\n result.append(nums[k])\n else:\n result.append(-1)\n return result[::-1]", "class Solution:\n def lastVisitedIntegers(self, words: List[str]) -> List[int]:\n nums = []\n result = []\n for word in words:\n if word != \"prev\":\n nums.append(int(word))\n else:\n k = len(nums) - 1 - len(result)\n if k >= 0:\n result.append(nums[k])\n else:\n result.append(-1)\n return result[::-1]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minGroupsForValidAssignment(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n if num in count:\n count[num] += 1\n else:\n count[num] = 1\n\n odd_count = sum(1 for c in count.values() if c % 2 == 1)\n return min(odd_count, len(count))", "class Solution:\n def minGroupsForValidAssignment(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num, 0) + 1\n\n groups = max(count.values())\n second_max = second_max_value(count.values())\n\n return (groups - second_max) // 2 + 1\n\n\ndef second_max_value(nums):\n max_val = second_max = float(\"-inf\")\n for num in nums:\n if num > max_val:\n second_max = max_val\n max_val = num\n elif second_max < num < max_val:\n second_max = num\n\n return second_max", "class Solution:\n def minGroupsForValidAssignment(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num, 0) + 1\n\n groups = max(count.values())\n second_max = second_max_freq(count)\n\n return max(groups - second_max, 1)\n\n\ndef second_max_freq(count):\n max_freq = 0\n second_max_freq = 0\n for freq in count.values():\n if freq > max_freq:\n second_max_freq = max_freq\n max_freq = freq\n elif freq > second_max_freq and freq != max_freq:\n second_max_freq = freq\n\n return second_max_freq", "class Solution:\n def minGroupsForValidAssignment(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num, 0) + 1\n\n groups = 0\n odd_count = 0\n for val in count.values():\n if val % 2 == 1:\n odd_count += 1\n groups += 1\n groups += val // 2\n\n return groups + (odd_count - 1) // 2", "class Solution:\n def minGroupsForValidAssignment(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num, 0) + 1\n\n groups = 0\n odd_count = 0\n for val in count.values():\n if val % 2 == 1:\n odd_count += 1\n groups += val // 2\n\n return groups + odd_count // 2 + (1 if odd_count % 2 == 1 else 0)", "class Solution:\n def minGroupsForValidAssignment(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n if num in count:\n count[num] += 1\n else:\n count[num] = 1\n\n max_count = max(count.values())\n second_max_count = sorted(list(count.values()), reverse=True)[1]\n\n if max_count == second_max_count:\n return second_max_count\n else:\n return second_max_count + 1", "class Solution:\n def minGroupsForValidAssignment(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num, 0) + 1\n\n groups = max(count.values())\n second_max = second_max_value(count.values())\n\n return (groups - second_max) // 2 + 1 if groups != second_max else groups\n\n\ndef second_max_value(nums):\n max_val = second_max = float(\"-inf\")\n for num in nums:\n if num > max_val:\n second_max = max_val\n max_val = num\n elif second_max < num < max_val:\n second_max = num\n return second_max", "class Solution:\n def minGroupsForValidAssignment(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num, 0) + 1\n\n groups = max(count.values())\n second_max = second_max_value(count.values())\n\n return (groups - second_max) // 2 + 1\n\n\ndef second_max_value(arr):\n max_val = second_max = float(\"-inf\")\n for val in arr:\n if val > max_val:\n second_max = max_val\n max_val = val\n elif second_max < val < max_val:\n second_max = val\n\n return second_max", "class Solution:\n def minGroupsForValidAssignment(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num, 0) + 1\n\n groups = max(count.values())\n second_max = second_max_value(count.values())\n\n return (groups - second_max) // 2 + 1\n\n\ndef second_max_value(nums):\n max_val = second_max = float(\"-inf\")\n for num in nums:\n if num > max_val:\n second_max = max_val\n max_val = num\n elif num > second_max and num != max_val:\n second_max = num\n return second_max", "class Solution:\n def minGroupsForValidAssignment(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num, 0) + 1\n\n groups = 0\n odd_counts = 0\n for c in count.values():\n if c % 2 == 1:\n odd_counts += 1\n groups += c // 2\n\n return groups + odd_counts" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minSum(self, nums1: List[int], nums2: List[int]) -> int:\n sum1, sum2 = 0, 0\n zero_count1, zero_count2 = 0, 0\n\n for num in nums1:\n if num == 0:\n zero_count1 += 1\n else:\n sum1 += num\n\n for num in nums2:\n if num == 0:\n zero_count2 += 1\n else:\n sum2 += num\n\n if abs(zero_count1 - zero_count2) > 1:\n return -1\n\n min_sum = sum1 + sum2 + 1\n if zero_count1 == zero_count2:\n min_sum -= 1\n\n return min_sum", "class Solution:\n def minSum(self, nums1: List[int], nums2: List[int]) -> int:\n sum1 = sum(nums1)\n sum2 = sum(nums2)\n zeros_in_nums1 = nums1.count(0)\n zeros_in_nums2 = nums2.count(0)\n if (sum1 - zeros_in_nums1) > (sum2 + zeros_in_nums2) or (sum2 - zeros_in_nums2) > (sum1 + zeros_in_nums1):\n return -1\n min_sum = sum1 + sum2 + 1\n for i in range(1, min_sum // 2 + 1):\n if (sum1 + i - zeros_in_nums1) == (sum2 + min_sum // 2 - i - zeros_in_nums2):\n min_sum = sum1 + sum2 + i\n break\n return min_sum if min_sum <= 10**6 else -1", "class Solution:\n def minSum(self, nums1: List[int], nums2: List[int]) -> int:\n sum1, sum2 = 0, 0\n zero_count1, zero_count2 = 0, 0\n\n for num in nums1:\n if num == 0:\n zero_count1 += 1\n else:\n sum1 += num\n\n for num in nums2:\n if num == 0:\n zero_count2 += 1\n else:\n sum2 += num\n\n if abs(zero_count1 - zero_count2) > 1:\n return -1\n\n min_sum = sum1 + sum2 + 1\n if zero_count1 == zero_count2:\n min_sum -= 1\n\n return min_sum", "class Solution:\n def minSum(self, nums1: List[int], nums2: List[int]) -> int:\n sum1 = sum(nums1)\n sum2 = sum(nums2)\n if sum1 == sum2:\n return sum1\n zero_count1 = nums1.count(0)\n zero_count2 = nums2.count(0)\n if zero_count1 + zero_count2 == 0:\n return -1\n if zero_count1 == 0:\n min_val = min(nums2)\n if (sum1 - sum2) % zero_count2 == 0 and (sum1 - sum2) // zero_count2 >= min_val:\n return sum1\n else:\n return -1\n if zero_count2 == 0:\n min_val = min(nums1)\n if (sum2 - sum1) % zero_count1 == 0 and (sum2 - sum1) // zero_count1 >= min_val:\n return sum2\n else:\n return -1\n min_val1 = min(nums1)\n min_val2 = min(nums2)\n min_diff = abs(sum1 - sum2)\n if (sum1 - sum2) % zero_count2 != 0 or (sum1 - sum2) // zero_count2 < min_val2:\n return -1\n if (sum2 - sum1) % zero_count1 != 0 or (sum2 - sum1) // zero_count1 < min_val1:\n return -1\n return sum1 + min_diff", "class Solution:\n def minSum(self, nums1: List[int], nums2: List[int]) -> int:\n sum1, sum2 = sum(nums1), sum(nums2)\n zeros1, zeros2 = nums1.count(0), nums2.count(0)\n total_zeros = zeros1 + zeros2\n\n if total_zeros == 0:\n return sum1 if sum1 == sum2 else -1\n\n min_sum = float(\"inf\")\n diff = abs(sum1 - sum2)\n\n for i in range(total_zeros + 1):\n x = min(diff // (i + 1), diff // total_zeros)\n y = diff - x * (i + 1)\n if x > 0 and y > 0 and (x * (total_zeros - i) + y) % (total_zeros - i) == 0:\n min_sum = min(min_sum, sum1 + x * i + y * (total_zeros - i - 1))\n\n return min_sum if min_sum != float(\"inf\") else -1", "class Solution:\n def minSum(self, nums1: List[int], nums2: List[int]) -> int:\n sum1, sum2 = 0, 0\n zero_count1, zero_count2 = 0, 0\n\n for num in nums1:\n if num == 0:\n zero_count1 += 1\n else:\n sum1 += num\n for num in nums2:\n if num == 0:\n zero_count2 += 1\n else:\n sum2 += num\n\n if abs(zero_count1 - zero_count2) > 1:\n return -1\n elif zero_count1 == zero_count2:\n return sum1 + sum2\n else:\n min_sum = min(sum1, sum2) + 1\n max_sum = max(sum1, sum2) + zero_count1 + zero_count2\n\n return min_sum if min_sum <= max_sum else -1", "class Solution:\n def minSum(self, nums1: List[int], nums2: List[int]) -> int:\n sum1, sum2 = 0, 0\n zero_count1, zero_count2 = 0, 0\n\n for num in nums1:\n if num == 0:\n zero_count1 += 1\n else:\n sum1 += num\n\n for num in nums2:\n if num == 0:\n zero_count2 += 1\n else:\n sum2 += num\n\n if abs(zero_count1 - zero_count2) > 1:\n return -1\n\n min_sum = sum1 + sum2 + 1\n if zero_count1 == zero_count2:\n min_sum -= 1\n\n return min_sum", "class Solution:\n def minSum(self, nums1: List[int], nums2: List[int]) -> int:\n sum1, sum2 = sum(nums1), sum(nums2)\n zeros_num1, zeros_num2 = nums1.count(0), nums2.count(0)\n total_zeros = zeros_num1 + zeros_num2\n\n if total_zeros > (sum1 - sum2) // 1 + (sum2 - sum1) // 1:\n return -1\n\n min_sum = sum1 + sum2 + 1\n for i in range(1, total_zeros + 1):\n first_sum = sum1 + i + (total_zeros - i)\n second_sum = sum2 + total_zeros - i\n min_sum = min(min_sum, first_sum + second_sum)\n\n return min_sum", "class Solution:\n def minSum(self, nums1: List[int], nums2: List[int]) -> int:\n sum1, sum2 = 0, 0\n zero_count1, zero_count2 = 0, 0\n\n for num in nums1:\n if num == 0:\n zero_count1 += 1\n else:\n sum1 += num\n\n for num in nums2:\n if num == 0:\n zero_count2 += 1\n else:\n sum2 += num\n\n if abs(zero_count1 - zero_count2) > 1:\n return -1\n\n min_sum = sum1 + sum2 + 1\n if zero_count1 == zero_count2:\n min_sum -= 1\n\n return min_sum", "class Solution:\n def minSum(self, nums1: List[int], nums2: List[int]) -> int:\n sum1, sum2 = 0, 0\n zero_count1, zero_count2 = 0, 0\n\n for num in nums1:\n if num == 0:\n zero_count1 += 1\n else:\n sum1 += num\n\n for num in nums2:\n if num == 0:\n zero_count2 += 1\n else:\n sum2 += num\n\n if abs(zero_count1 - zero_count2) > 1:\n return -1\n\n min_sum = sum1 + sum2 + 1\n if zero_count1 == zero_count2:\n min_sum -= 1\n\n return min_sum" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def differenceOfSums(self, n: int, m: int) -> int:\n num1 = sum(i for i in range(1, n + 1) if i % m != 0)\n num2 = sum(i for i in range(1, n + 1) if i % m == 0)\n return num1 - num2", "class Solution:\n def differenceOfSums(self, n: int, m: int) -> int:\n num1 = sum(i for i in range(1, n + 1) if i % m != 0)\n num2 = sum(i for i in range(1, n + 1) if i % m == 0)\n return num1 - num2", "class Solution:\n def differenceOfSums(self, n: int, m: int) -> int:\n num1 = sum(i for i in range(1, n + 1) if i % m != 0)\n num2 = sum(i for i in range(1, n + 1) if i % m == 0)\n return num1 - num2", "class Solution:\n def differenceOfSums(self, n: int, m: int) -> int:\n num1 = sum(i for i in range(1, n + 1) if i % m != 0)\n num2 = sum(i for i in range(1, n + 1) if i % m == 0)\n return num1 - num2", "class Solution:\n def differenceOfSums(self, n: int, m: int) -> int:\n num1 = sum(i for i in range(1, n + 1) if i % m != 0)\n num2 = sum(i for i in range(1, n + 1) if i % m == 0)\n return num1 - num2", "class Solution:\n def differenceOfSums(self, n: int, m: int) -> int:\n num1 = sum(i for i in range(1, n + 1) if i % m != 0)\n num2 = sum(i for i in range(1, n + 1) if i % m == 0)\n return num1 - num2", "class Solution:\n def differenceOfSums(self, n: int, m: int) -> int:\n num1 = sum(i for i in range(1, n + 1) if i % m != 0)\n num2 = sum(i for i in range(1, n + 1) if i % m == 0)\n return num1 - num2", "class Solution:\n def differenceOfSums(self, n: int, m: int) -> int:\n num1 = sum(i for i in range(1, n + 1) if i % m != 0)\n num2 = sum(i for i in range(1, n + 1) if i % m == 0)\n return num1 - num2", "class Solution:\n def differenceOfSums(self, n: int, m: int) -> int:\n num1 = sum(i for i in range(1, n + 1) if i % m != 0)\n num2 = sum(i for i in range(1, n + 1) if i % m == 0)\n return num1 - num2", "class Solution:\n def differenceOfSums(self, n: int, m: int) -> int:\n num1 = sum(i for i in range(1, n + 1) if i % m != 0)\n num2 = sum(i for i in range(1, n + 1) if i % m == 0)\n return num1 - num2" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minChanges(self, s: str) -> int:\n n = len(s)\n zeroes = s.count('0')\n ones = n - zeroes\n\n # Initialize dp table\n dp = [[0] * (ones + 1) for _ in range(2)]\n\n # Fill dp table\n for i in range(n):\n if s[i] == '0':\n dp[0][ones].append(i)\n ones -= 1\n else:\n dp[1][ones].append(i)\n zeroes -= 1\n\n # Calculate minimum changes\n ans = float('inf')\n for i in range(zeroes + 1):\n ans = min(ans, zeroes - i + ones - dp[1][i][-1] - dp[0][i][-1])\n\n return ans", "class Solution:\n def minChanges(self, s: str) -> int:\n n = len(s)\n zero_count = s.count('0')\n one_count = n - zero_count\n\n # Initialize dp table to store minimum changes for each length of substring\n dp = [[0] * (one_count + 1) for _ in range(zero_count + 1)]\n\n # Fill dp table using bottom-up dynamic programming\n for i in range(1, zero_count + 1):\n dp[i][0] = dp[i - 1][0] + 1\n for j in range(1, one_count + 1):\n dp[0][j] = dp[0][j - 1] + 1\n\n # Iterate through the string and update dp table\n for i in range(n):\n if s[i] == '0':\n zero_count -= 1\n for j in range(one_count):\n dp[zero_count][j + 1] = min(dp[zero_count][j + 1], dp[zero_count - 1][j] + 1)\n else:\n one_count -= 1\n for j in range(zero_count):\n dp[j + 1][one_count] = min(dp[j + 1][one_count], dp[j][one_count - 1] + 1)\n\n return dp[zero_count][one_count]", "class Solution:\n def minChanges(self, s: str) -> int:\n n = len(s)\n zeroes = s.count('0')\n ones = n - zeroes\n\n # If there are an even number of 0s and 1s, we don't need to make any changes\n if (zeroes + ones) % 2 == 0:\n return 0\n\n # Otherwise, we need to change one additional character to make it beautiful\n return 1", "class Solution:\n def minChanges(self, s: str) -> int:\n n = len(s)\n zeroes = s.count('0')\n ones = n - zeroes\n\n # If there are an even number of 0s and 1s, we don't need to make any changes\n if (zeroes + ones) % 2 == 0:\n return 0\n\n # Otherwise, we need to change one additional character to make it beautiful\n return 1", "class Solution:\n def minChanges(self, s: str) -> int:\n n = len(s)\n zero_count = s.count('0')\n one_count = n - zero_count\n\n # Initialize dp table\n dp = [[0] * (one_count + 1) for _ in range(2)]\n\n for i in range(n):\n if s[i] == '0':\n dp[1][one_count] += 1\n one_count -= 1\n else:\n dp[0][one_count] += 1\n zero_count -= 1\n\n for j in range(one_count, -1, -1):\n dp[0][j] = max(dp[0][j], dp[0][j + 1])\n dp[1][j] = max(dp[1][j], dp[1][j + 1])\n\n return zero_count - max(dp[0][0], dp[1][0])", "class Solution:\n def minChanges(self, s: str) -> int:\n n = len(s)\n zeroes = s.count('0')\n ones = n - zeroes\n \n if zeroes % 2 == 1 and ones % 2 == 1:\n return 1\n elif zeroes % 2 == 1 or ones % 2 == 1:\n return min(zeroes, ones)\n else:\n return 0", "class Solution:\n def minChanges(self, s: str) -> int:\n n = len(s)\n zero_count = s.count('0')\n one_count = n - zero_count\n\n # If there are an even number of 0s and 1s, we don't need to make any changes\n if (zero_count + one_count) % 2 == 0:\n return 0\n\n # Otherwise, we need to make changes to at least one character\n return 1 if zero_count % 2 == 0 else 2", "class Solution:\n def minChanges(self, s: str) -> int:\n n = len(s)\n zeroes = s.count('0')\n ones = n - zeroes\n\n # Initialize dp table\n dp = [[0] * (ones + 1) for _ in range(2)]\n\n # Fill dp table\n for i in range(n):\n if s[i] == '0':\n dp[0][0] += 1\n dp[1][0] += 1\n else:\n dp[0][ones] += 1\n dp[1][ones - 1] += 1\n ones -= 1\n\n # Find the minimum cost\n for i in range(1, ones + 1):\n dp[0][i] = min(dp[0][i], dp[0][i - 1] + 1, dp[1][i - 1])\n dp[1][i] = min(dp[1][i], dp[1][i - 1] + 1, dp[0][i - 1])\n\n return min(dp[0][ones], dp[1][ones - 1])", "class Solution:\n def minChanges(self, s: str) -> int:\n n = len(s)\n zeroes = s.count('0')\n ones = n - zeroes\n\n # If there are an even number of 0s and 1s, we can make the string beautiful with no changes\n if (zeroes + ones) % 2 == 0:\n return 0\n\n # Otherwise, we need to change one additional character to make it beautiful\n return 1", "class Solution:\n def minChanges(self, s: str) -> int:\n n = len(s)\n zero_count = s.count('0')\n one_count = n - zero_count\n\n # If there are an even number of both 0's and 1's, we can make the string beautiful with no changes\n if zero_count % 2 == 0 and one_count % 2 == 0:\n return 0\n\n # If there are an odd number of 0's and 1's, we must change one additional character\n if zero_count % 2 and one_count % 2:\n return 1\n\n # If there are an odd number of 0's, we must change all the 1's to make the string beautiful\n if zero_count % 2:\n return one_count\n\n # If there are an odd number of 1's, we must change all the 0's to make the string beautiful\n return zero_count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumSum(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n res = float('inf')\n for i in range(1, n - 2):\n if nums[i - 1] < nums[i] and nums[i + 1] < nums[i]:\n res = min(res, nums[i - 1] + nums[i] + nums[i + 1])\n return -1 if res == float('inf') else res", "class Solution:\n def minimumSum(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n res = float(\"inf\")\n for i in range(1, n - 2):\n if nums[i] > nums[i - 1]:\n res = min(res, nums[i - 1] + nums[i] + nums[n - 1])\n if i < n - 2 and nums[i] > nums[i + 1]:\n res = min(res, nums[i + 1] + nums[i] + nums[i - 1])\n if res == float(\"inf\"):\n res = -1\n return res", "class Solution:\n def minimumSum(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n res = float(\"inf\")\n for i in range(n - 1, 1, -1):\n for j in range(i - 1, 0, -1):\n for k in range(j - 1, -1, -1):\n res = min(res, nums[i] + nums[j] + nums[k])\n if res == float(\"inf\"):\n return -1\n return res", "class Solution:\n def minimumSum(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n res = float('inf')\n for i in range(1, n - 2):\n if nums[i - 1] < nums[i] and nums[i + 1] < nums[i]:\n res = min(res, nums[i - 1] + nums[i] + nums[i + 1])\n return -1 if res == float('inf') else res", "class Solution:\n def minimumSum(self, nums: List[int]) -> int:\n n = len(nums)\n if n < 3:\n return -1\n \n nums.sort()\n \n res = float(\"inf\")\n for i in range(1, n - 1):\n j = i - 1\n k = i + 1\n while j >= 0 and k < n:\n if nums[j] < nums[i] and nums[k] < nums[i]:\n res = min(res, nums[j] + nums[i] + nums[k])\n j -= 1\n k += 1\n \n return -1 if res == float(\"inf\") else res", "class Solution:\n def minimumSum(self, nums: List[int]) -> int:\n n = len(nums)\n if n < 3:\n return -1\n \n nums.sort()\n \n res = float('inf')\n for i in range(1, n - 1):\n left = nums[i - 1]\n peak = nums[i]\n right = nums[i + 1]\n \n if left < peak and right < peak:\n res = min(res, left + peak + right)\n \n if res == float('inf'):\n return -1\n else:\n return res", "class Solution:\n def minimumSum(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n res = float(\"inf\")\n for i in range(n - 1, 1, -1):\n for j in range(i - 1, 0, -1):\n for k in range(j - 1, -1, -1):\n if nums[i] < nums[j] and nums[k] < nums[j]:\n res = min(res, nums[i] + nums[j] + nums[k])\n return -1 if res == float(\"inf\") else res", "class Solution:\n def minimumSum(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n res = -1\n for i in range(1, n - 2):\n if nums[i - 1] < nums[i] and nums[i] > nums[i + 1]:\n res = nums[i - 1] + nums[i] + nums[i + 1]\n break\n return res", "class Solution:\n def minimumSum(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n res = -1\n for i in range(1, n - 2):\n if nums[i] > nums[i - 1]:\n left = nums[i - 1]\n right = nums[i + 1]\n peak = nums[i]\n res = min(res, left + peak + right)\n return res", "class Solution:\n def minimumSum(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n res = float(\"inf\")\n for i in range(n - 1, 1, -1):\n for j in range(i - 1, 0, -1):\n for k in range(j - 1, -1, -1):\n res = min(res, nums[i] + nums[j] + nums[k])\n return res if res != float(\"inf\") else -1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findKOr(self, nums: List[int], k: int) -> int:\n count = [0] * 31\n for num in nums:\n for i in range(31):\n if num & (1 << i):\n count[i] += 1\n res = 0\n for i in range(31):\n if count[i] >= k:\n res |= 1 << i\n return res", "class Solution:\n def findKOr(self, nums: List[int], k: int) -> int:\n count = [0] * 31\n for num in nums:\n for j in range(31):\n if num & (1 << j):\n count[j] += 1\n res = 0\n for i in range(31):\n if count[i] >= k:\n res |= 1 << i\n return res", "class Solution:\n def findKOr(self, nums: List[int], k: int) -> int:\n count = [0] * 31\n for num in nums:\n for j in range(31):\n if num & (1 << j):\n count[j] += 1\n res = 0\n for i in range(31):\n if count[i] >= k:\n res |= 1 << i\n return res", "class Solution:\n def findKOr(self, nums: List[int], k: int) -> int:\n count = [0] * 31\n for num in nums:\n for j in range(31):\n if num & (1 << j):\n count[j] += 1\n res = 0\n for i in range(31):\n if count[i] >= k:\n res |= 1 << i\n return res", "class Solution:\n def findKOr(self, nums: List[int], k: int) -> int:\n count = [0] * 31\n for num in nums:\n for j in range(31):\n if num & (1 << j):\n count[j] += 1\n res = 0\n for i in range(31):\n if count[i] >= k:\n res |= 1 << i\n return res", "class Solution:\n def findKOr(self, nums: List[int], k: int) -> int:\n count = [0] * 31\n for num in nums:\n for j in range(31):\n if num & (1 << j):\n count[j] += 1\n res = 0\n for i in range(31):\n if count[i] >= k:\n res |= 1 << i\n return res", "class Solution:\n def findKOr(self, nums: List[int], k: int) -> int:\n count = [0] * 31\n for num in nums:\n for i in range(31):\n if num & (1 << i):\n count[i] += 1\n res = 0\n for i in range(31):\n if count[i] >= k:\n res |= 1 << i\n return res", "class Solution:\n def findKOr(self, nums: List[int], k: int) -> int:\n count = [0] * 31\n for num in nums:\n for j in range(31):\n if num & (1 << j):\n count[j] += 1\n res = 0\n for i in range(31):\n if count[i] >= k:\n res |= 1 << i\n return res", "class Solution:\n def findKOr(self, nums: List[int], k: int) -> int:\n count = [0] * 31\n for num in nums:\n for j in range(31):\n if num & (1 << j):\n count[j] += 1\n res = 0\n for i in range(31):\n if count[i] >= k:\n res |= 1 << i\n return res", "class Solution:\n def findKOr(self, nums: List[int], k: int) -> int:\n count = [0] * 31\n for num in nums:\n for j in range(31):\n if num & (1 << j):\n count[j] += 1\n res = 0\n for i in range(31):\n if count[i] >= k:\n res |= 1 << i\n return res" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxBalancedSubsequenceSum(self, nums: List[int]) -> int:\n stack = []\n max_sum = 0\n\n for num in nums:\n while stack and num - stack[-1] >= len(stack):\n stack.pop()\n\n stack.append(num)\n max_sum += num\n\n return max_sum", "class Solution:\n def maxBalancedSubsequenceSum(self, nums: List[int]) -> int:\n stack = []\n max_sum = 0\n\n for num in nums:\n while stack and num - stack[-1][0] >= len(stack):\n max_sum -= stack.pop()[1]\n\n stack.append((num, max_sum + num))\n max_sum = max(max_sum, num)\n\n return max_sum + stack[0][1]", "class Solution:\n def maxBalancedSubsequenceSum(self, nums: List[int]) -> int:\n dp = [0] * (len(nums) + 1)\n for num in nums:\n lower_bound = -1\n upper_bound = len(dp)\n while upper_bound - lower_bound > 1:\n mid = (lower_bound + upper_bound) // 2\n if dp[mid] - num >= mid - 1:\n lower_bound = mid\n else:\n upper_bound = mid\n dp[upper_bound] = max(dp[upper_bound], num + upper_bound - 1)\n return max(dp)", "class Solution:\n def maxBalancedSubsequenceSum(self, nums: List[int]) -> int:\n dp = [0] * (len(nums) + 1)\n for num in nums:\n dp_new = [0] * (len(nums) + 1)\n for i in range(len(dp) - 1, -1, -1):\n dp_new[i + 1] = max(dp_new[i + 1], dp[i] + num - i)\n dp_new[max(0, i + 2)] = max(dp_new[max(0, i + 2)], dp[i] + num - (i + 1))\n dp = dp_new\n return max(dp)", "class Solution:\n def maxBalancedSubsequenceSum(self, nums: List[int]) -> int:\n dp = [0] * len(nums)\n dp[0] = nums[0]\n for i in range(1, len(nums)):\n dp[i] = max(dp[i - 1], nums[i] + max(0, dp[max(0, i - 2)]))\n return max(dp)", "class Solution:\n def maxBalancedSubsequenceSum(self, nums: List[int]) -> int:\n stack = []\n max_sum = -float(\"inf\")\n\n for num in nums:\n while stack and num - stack[-1][0] >= len(stack):\n max_sum = max(max_sum, stack[-1][1])\n stack.pop()\n\n stack.append((num, num + stack[-1][1] if stack else num))\n\n return max(max_sum, stack[-1][1])", "class Solution:\n def maxBalancedSubsequenceSum(self, nums: List[int]) -> int:\n stack = []\n max_sum = -float(\"inf\")\n\n for num in nums:\n while stack and num - stack[-1][0] >= len(stack):\n max_sum = max(max_sum, stack[-1][1])\n stack.pop()\n\n stack.append((num, num + max_sum))\n\n return max_sum + stack[0][1]", "class Solution:\n def maxBalancedSubsequenceSum(self, nums: List[int]) -> int:\n dp = [float('-inf')] * len(nums)\n dp[0] = nums[0]\n\n for i in range(1, len(nums)):\n for j in range(i, -1, -1):\n if j == 0 or nums[i] - nums[j - 1] >= i - j:\n dp[i] = max(dp[i], dp[j - 1] + nums[i])\n\n return max(dp)", "class Solution:\n def maxBalancedSubsequenceSum(self, nums: List[int]) -> int:\n stack = []\n max_sum = cur_sum = 0\n\n for i, num in enumerate(nums):\n if not stack or num - stack[-1][0] >= i - stack[-1][1]:\n stack.append([num, i])\n cur_sum += num\n else:\n while stack and num - stack[-1][0] < i - stack[-1][1]:\n prev_num, prev_i = stack.pop()\n cur_sum -= prev_num\n\n stack.append([num, i])\n cur_sum += num\n\n max_sum = max(max_sum, cur_sum)\n\n return max_sum", "class Solution:\n def maxBalancedSubsequenceSum(self, nums: List[int]) -> int:\n dp = [0] * len(nums)\n dp[0] = nums[0]\n for i in range(1, len(nums)):\n dp[i] = max(dp[i - 1], nums[i] + max(0, dp[max(0, i - nums[i] - 1)]))\n return max(dp)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findChampion(self, grid: List[List[int]]) -> int:\n n = len(grid)\n in_degree = [0] * n\n\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 1:\n in_degree[j] += 1\n\n zero_in_degree = [i for i in range(n) if in_degree[i] == 0]\n return zero_in_degree[0]", "class Solution:\n def findChampion(self, grid: List[List[int]]) -> int:\n n = len(grid)\n in_degree = [0] * n\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 1:\n in_degree[j] += 1\n for i in range(n):\n if in_degree[i] == 0:\n return i", "class Solution:\n def findChampion(self, grid: List[List[int]]) -> int:\n n = len(grid)\n in_degrees = [0] * n\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 1:\n in_degrees[j] += 1\n for i in range(n):\n if in_degrees[i] == 0:\n return i", "class Solution:\n def findChampion(self, grid: List[List[int]]) -> int:\n n = len(grid)\n in_degree = [0] * n\n\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 1:\n in_degree[j] += 1\n\n for i in range(n):\n if in_degree[i] == 0:\n return i", "class Solution:\n def findChampion(self, grid: List[List[int]]) -> int:\n n = len(grid)\n in_degree = [0] * n\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 1:\n in_degree[j] += 1\n for i in range(n):\n if in_degree[i] == 0:\n return i", "class Solution:\n def findChampion(self, grid: List[List[int]]) -> int:\n n = len(grid)\n in_degrees = [0] * n\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 1:\n in_degrees[j] += 1\n for i in range(n):\n if in_degrees[i] == 0:\n return i", "class Solution:\n def findChampion(self, grid: List[List[int]]) -> int:\n n = len(grid)\n in_degrees = [0] * n\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 1:\n in_degrees[j] += 1\n for i in range(n):\n if in_degrees[i] == 0:\n return i", "class Solution:\n def findChampion(self, grid: List[List[int]]) -> int:\n n = len(grid)\n in_degree = [0] * n\n\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 1:\n in_degree[j] += 1\n\n for i in range(n):\n if in_degree[i] == 0:\n return i", "class Solution:\n def findChampion(self, grid: List[List[int]]) -> int:\n n = len(grid)\n in_degrees = [0] * n\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 1:\n in_degrees[j] += 1\n for i in range(n):\n if in_degrees[i] == 0:\n return i", "class Solution:\n def findChampion(self, grid: List[List[int]]) -> int:\n n = len(grid)\n in_degrees = [0] * n\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 1:\n in_degrees[j] += 1\n for i in range(n):\n if in_degrees[i] == 0:\n return i" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minOperations(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n max1 = max(nums1)\n max2 = max(nums2)\n if nums1[n - 1] < max1 or nums2[n - 1] < max2:\n return -1\n cnt1 = 0\n cnt2 = 0\n for i in range(n):\n if nums1[i] == max1:\n cnt1 += 1\n if nums2[i] == max2:\n cnt2 += 1\n return max(0, cnt1 + cnt2 - 2)", "class Solution:\n def minOperations(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n max1 = max(nums1)\n max2 = max(nums2)\n\n if nums1[n - 1] < max1 and nums2[n - 1] < max2:\n return -1\n\n count1 = nums1.count(max1)\n count2 = nums2.count(max2)\n\n if max1 == max2:\n if count1 == 1 and count2 == 1:\n return 0\n else:\n return min(count1, count2) - 1\n else:\n if count1 == 1 and count2 == 1:\n return 1\n elif count1 == 1 or count2 == 1:\n return 2\n else:\n return 2 if count1 + count2 <= 2 else 3", "class Solution:\n def minOperations(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n max1 = max(nums1)\n max2 = max(nums2)\n if nums1[n - 1] < max1 and nums2[n - 1] < max2:\n return -1\n cnt1, cnt2 = 0, 0\n for i in range(n):\n if nums1[i] == max1:\n cnt1 += 1\n if nums2[i] == max2:\n cnt2 += 1\n return max(0, cnt1 + cnt2 - 2)", "class Solution:\n def minOperations(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n max1 = max(nums1)\n max2 = max(nums2)\n if nums1[n - 1] < max1 and nums2[n - 1] < max2:\n return -1\n cnt1 = 0\n cnt2 = 0\n for i in range(n):\n if nums1[i] == max1:\n cnt1 += 1\n if nums2[i] == max2:\n cnt2 += 1\n return max(0, cnt1 + cnt2 - 2)", "class Solution:\n def minOperations(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n max1 = max(nums1)\n max2 = max(nums2)\n if nums1[n - 1] < max1 and nums2[n - 1] < max2:\n return -1\n count1, count2 = 0, 0\n for i in range(n):\n if nums1[i] == max1:\n count1 = i\n if nums2[i] == max2:\n count2 = i\n return min(count1, count2)", "class Solution:\n def minOperations(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n max1 = max(nums1)\n max2 = max(nums2)\n if nums1[n - 1] < max1 and nums2[n - 1] < max2:\n return -1\n cnt1, cnt2 = 0, 0\n for i in range(n):\n if nums1[i] == max1:\n cnt1 += 1\n if nums2[i] == max2:\n cnt2 += 1\n return max(0, cnt1 + cnt2 - 2)", "class Solution:\n def minOperations(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n max1 = max(nums1)\n max2 = max(nums2)\n if nums1[n - 1] < max1 or nums2[n - 1] < max2:\n return -1\n count1 = nums1.count(max1)\n count2 = nums2.count(max2)\n if max1 == max2:\n return max(count1 - 1, count2 - 1)\n else:\n return max(count1, count2) - 1", "class Solution:\n def minOperations(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n max1 = max(nums1)\n max2 = max(nums2)\n if nums1[n - 1] < max1 and nums2[n - 1] < max2:\n return -1\n count1, count2 = 0, 0\n for i in range(n):\n if nums1[i] == max1:\n count1 += 1\n if nums2[i] == max2:\n count2 += 1\n return max(0, 2 - (count1 > 0) - (count2 > 0))", "class Solution:\n def minOperations(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n max1 = max(nums1)\n max2 = max(nums2)\n if nums1[n - 1] < max1 and nums2[n - 1] < max2:\n return -1\n cnt1, cnt2 = 0, 0\n for i in range(n):\n if nums1[i] == max1:\n cnt1 += 1\n if nums2[i] == max2:\n cnt2 += 1\n return max(0, cnt1 + cnt2 - 2)", "class Solution:\n def minOperations(self, nums1: List[int], nums2: List[int]) -> int:\n n = len(nums1)\n max1 = max(nums1)\n max2 = max(nums2)\n if nums1[n - 1] < max1 or nums2[n - 1] < max2:\n return -1\n cnt1, cnt2 = 0, 0\n for i in range(n):\n if nums1[i] == max1:\n cnt1 += 1\n if nums2[i] == max2:\n cnt2 += 1\n return max(0, cnt1 + cnt2 - 2)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumXorProduct(self, a: int, b: int, n: int) -> int:\n mod = 10**9 + 7\n max_val = 0\n for i in range(1 << n):\n xor_val = a ^ i\n max_val = max(max_val, (xor_val * (b ^ i)) % mod)\n return max_val", "class Solution:\n def maximumXorProduct(self, a: int, b: int, n: int) -> int:\n mod = 10**9 + 7\n max_val = 0\n for i in range(1 << n):\n x = a ^ i\n y = b ^ i\n max_val = max(max_val, (x * y) % mod)\n return max_val", "class Solution:\n def maximumXorProduct(self, a: int, b: int, n: int) -> int:\n mod = 10**9 + 7\n max_val = 0\n for i in range(1 << n):\n xor_val = a ^ i\n max_val = max(max_val, xor_val * (b ^ i))\n return max_val % mod", "class Solution:\n def maximumXorProduct(self, a: int, b: int, n: int) -> int:\n mod = 10**9 + 7\n max_val = 0\n for i in range(1 << n):\n x = (a ^ i) * (b ^ i)\n max_val = max(max_val, x)\n return max_val % mod", "class Solution:\n def maximumXorProduct(self, a: int, b: int, n: int) -> int:\n MOD = 10**9 + 7\n max_val = 0\n for i in range(1 << n):\n xor_val = a ^ i\n max_val = max(max_val, xor_val * (b ^ i))\n return max_val % MOD", "class Solution:\n def maximumXorProduct(self, a: int, b: int, n: int) -> int:\n mod = 10**9 + 7\n max_val = 0\n for i in range(1 << n):\n xor_val = a ^ i\n max_val = max(max_val, (xor_val * (b ^ i)) % mod)\n return max_val", "class Solution:\n def maximumXorProduct(self, a: int, b: int, n: int) -> int:\n MOD = 10**9 + 7\n max_val = 0\n a_xor_b = a ^ b\n for i in range(n, -1, -1):\n mask = 1 << i\n if (a_xor_b & mask) != 0:\n max_val |= mask\n a_xor_b ^= mask\n max_val = max(max_val, (a | mask) * (b | mask) % MOD)\n return max_val % MOD", "class Solution:\n def maximumXorProduct(self, a: int, b: int, n: int) -> int:\n mod = 10**9 + 7\n max_val = 0\n for i in range(1 << n):\n x = (a ^ i) * (b ^ i)\n max_val = max(max_val, x)\n return max_val % mod", "class Solution:\n def maximumXorProduct(self, a: int, b: int, n: int) -> int:\n mod = 10**9 + 7\n max_val = 0\n for i in range(1 << n):\n xor_val = a ^ i\n max_val = max(max_val, xor_val * (b ^ i))\n return max_val % mod", "class Solution:\n def maximumXorProduct(self, a: int, b: int, n: int) -> int:\n mod = 10**9 + 7\n max_val = 0\n for i in range(n, -1, -1):\n max_val |= 1 << i\n a_xor = a ^ max_val\n b_xor = b ^ max_val\n max_val = max(max_val, (a_xor * b_xor) % mod)\n return max_val" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumStrongPairXor(self, nums: List[int]) -> int:\n max_xor = 0\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n x, y = nums[i], nums[j]\n if abs(x - y) <= min(x, y):\n max_xor = max(max_xor, x ^ y)\n return max_xor", "class Solution:\n def maximumStrongPairXor(self, nums: List[int]) -> int:\n max_xor = 0\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if abs(nums[i] - nums[j]) <= min(nums[i], nums[j]):\n max_xor = max(max_xor, nums[i] ^ nums[j])\n return max_xor", "class Solution:\n def maximumStrongPairXor(self, nums: List[int]) -> int:\n max_xor = 0\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n x, y = nums[i], nums[j]\n if abs(x - y) <= min(x, y):\n max_xor = max(max_xor, x ^ y)\n return max_xor", "class Solution:\n def maximumStrongPairXor(self, nums: List[int]) -> int:\n max_xor = 0\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n x, y = nums[i], nums[j]\n if abs(x - y) <= min(x, y):\n max_xor = max(max_xor, x ^ y)\n return max_xor", "class Solution:\n def maximumStrongPairXor(self, nums: List[int]) -> int:\n max_xor = 0\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if abs(nums[i] - nums[j]) <= min(nums[i], nums[j]):\n max_xor = max(max_xor, nums[i] ^ nums[j])\n return max_xor", "class Solution:\n def maximumStrongPairXor(self, nums: List[int]) -> int:\n max_xor = 0\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n x, y = nums[i], nums[j]\n if abs(x - y) <= min(x, y):\n max_xor = max(max_xor, x ^ y)\n return max_xor", "class Solution:\n def maximumStrongPairXor(self, nums: List[int]) -> int:\n max_xor = 0\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n x, y = nums[i], nums[j]\n if abs(x - y) <= min(x, y):\n max_xor = max(max_xor, x ^ y)\n return max_xor", "class Solution:\n def maximumStrongPairXor(self, nums: List[int]) -> int:\n max_xor = 0\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if abs(nums[i] - nums[j]) <= min(nums[i], nums[j]):\n max_xor = max(max_xor, nums[i] ^ nums[j])\n return max_xor", "class Solution:\n def maximumStrongPairXor(self, nums: List[int]) -> int:\n max_xor = 0\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n x, y = nums[i], nums[j]\n if abs(x - y) <= min(x, y):\n max_xor = max(max_xor, x ^ y)\n return max_xor", "class Solution:\n def maximumStrongPairXor(self, nums: List[int]) -> int:\n max_xor = 0\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n x, y = nums[i], nums[j]\n if abs(x - y) <= min(x, y):\n max_xor = max(max_xor, x ^ y)\n return max_xor" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findWordsContaining(self, words: List[str], x: str) -> List[int]:\n return [i for i, word in enumerate(words) if x in word]", "class Solution:\n def findWordsContaining(self, words: List[str], x: str) -> List[int]:\n return [i for i, word in enumerate(words) if x in word]", "class Solution:\n def findWordsContaining(self, words: List[str], x: str) -> List[int]:\n return [i for i, word in enumerate(words) if x in word]", "class Solution:\n def findWordsContaining(self, words: List[str], x: str) -> List[int]:\n return [i for i, word in enumerate(words) if x in word]", "class Solution:\n def findWordsContaining(self, words: List[str], x: str) -> List[int]:\n return [i for i, word in enumerate(words) if x in word]", "class Solution:\n def findWordsContaining(self, words: List[str], x: str) -> List[int]:\n return [i for i, word in enumerate(words) if x in word]", "class Solution:\n def findWordsContaining(self, words: List[str], x: str) -> List[int]:\n return [i for i, word in enumerate(words) if x in word]", "class Solution:\n def findWordsContaining(self, words: List[str], x: str) -> List[int]:\n return [i for i, word in enumerate(words) if x in word]", "class Solution:\n def findWordsContaining(self, words: List[str], x: str) -> List[int]:\n return [i for i, word in enumerate(words) if x in word]", "class Solution:\n def findWordsContaining(self, words: List[str], x: str) -> List[int]:\n return [i for i, word in enumerate(words) if x in word]" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumSteps(self, s: str) -> int:\n ones = sum(map(int, s))\n zeros = len(s) - ones\n return min(ones, zeros)", "class Solution:\n def minimumSteps(self, s: str) -> int:\n ones = sum(int(ch) for ch in s)\n zeros = len(s) - ones\n return min(ones, zeros)", "class Solution:\n def minimumSteps(self, s: str) -> int:\n ones = sum(c == '1' for c in s)\n zeros = len(s) - ones\n dp = [0] * (ones + 1)\n for i in range(1, ones + 1):\n dp[i] = i\n for j in range(i, ones):\n if s[j] == '1':\n dp[i] = min(dp[i], dp[j] + i - j)\n return dp[1] + zeros - 1", "class Solution:\n def minimumSteps(self, s: str) -> int:\n ones = sum(map(int, s))\n zeros = len(s) - ones\n return ones * zeros - ones + zeros", "class Solution:\n def minimumSteps(self, s: str) -> int:\n ones = sum(int(ch) for ch in s)\n zeros = len(s) - ones\n dp = [0] * (ones + 1)\n for i in range(1, ones + 1):\n dp[i] = i\n for j in range(i, ones):\n dp[i] = min(dp[i], dp[j] + (i - j))\n res = dp[ones]\n for i in range(1, zeros + 1):\n res += min(ones, i)\n ones -= 1\n return res", "class Solution:\n def minimumSteps(self, s: str) -> int:\n ones = sum(c == '1' for c in s)\n zeros = len(s) - ones\n dp = [float('inf')] * (ones + 1)\n dp[0] = 0\n for i in range(len(s)):\n if s[i] == '1':\n dp[ones] = min(dp[ones], zeros)\n ones -= 1\n zeros += 1\n return min(dp)", "class Solution:\n def minimumSteps(self, s: str) -> int:\n ones = sum(int(ch) for ch in s)\n zeros = len(s) - ones\n return min(ones, zeros)", "class Solution:\n def minimumSteps(self, s: str) -> int:\n ones = sum(map(int, s))\n zeros = len(s) - ones\n return min(ones, zeros)", "class Solution:\n def minimumSteps(self, s: str) -> int:\n ones = sum(int(ch) for ch in s)\n zeros = len(s) - ones\n dp = [0] * (ones + 1)\n for i in range(1, ones + 1):\n dp[i] = i\n for j in range(i, ones):\n dp[i] = min(dp[i], dp[j] + (i - j))\n idx = 0\n for i in range(len(s)):\n if s[i] == '1':\n idx += 1\n if idx == ones:\n break\n return ones - dp[ones] + zeros - idx", "class Solution:\n def minimumSteps(self, s: str) -> int:\n ones = sum(int(ch) for ch in s)\n zeros = len(s) - ones\n dp = [float('inf')] * (ones + 1)\n dp[0] = 0\n for i in range(len(s)):\n if s[i] == '1':\n dp[ones] = min(dp[ones], zeros)\n ones -= 1\n zeros += 1\n return min(dp)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxFrequencyScore(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n left, right = 0, nums[-1] - nums[0] + 1\n while left < right:\n mid = left + (right - left) // 2\n count, required, i, j = 0, 0, 0, n - 1\n while i <= j:\n while i < n - 1 and nums[i + 1] - nums[i] <= mid:\n i += 1\n while j > 0 and nums[j] - nums[j - 1] > mid:\n j -= 1\n if i <= j:\n count += 1\n required += j - i + 1\n i += 1\n j -= 1\n if count > 1:\n left = mid + 1\n else:\n right = mid\n return count if k >= required else k // required + (1 if k % required else 0)", "class Solution:\n def maxFrequencyScore(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n left, right = 0, nums[-1] - nums[0] + 1\n while left < right:\n mid = left + (right - left) // 2\n count, cur_k, i = 0, 0, 0\n for i in range(n):\n if nums[i] > mid + nums[0] or nums[i] < mid + nums[i]:\n cur_k += abs(nums[i] - (mid + nums[i]))\n if nums[i] + cur_k >= mid + nums[i]:\n count += 1\n if count >= k:\n left = mid + 1\n else:\n right = mid\n return left", "class Solution:\n def maxFrequencyScore(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n left, right = 0, nums[-1] - nums[0] + 1\n while left < right:\n mid = left + (right - left) // 2\n count, required, i, j = 0, 0, 0, n - 1\n while i <= j:\n while i < n and nums[i] <= mid:\n required += mid - nums[i]\n count += 1\n i += 1\n while j >= 0 and nums[j] > mid:\n required -= nums[j] - mid\n j -= 1\n if count * 2 > n:\n break\n if required <= k:\n left = mid + 1\n else:\n right = mid\n return left - 1", "class Solution:\n def maxFrequencyScore(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n left, right = 0, nums[-1] - nums[0] + 1\n while left < right:\n mid = left + (right - left) // 2\n count, required, i = 0, 0, 0\n for i in range(n):\n if nums[i] - i >= mid:\n count += 1\n required += mid - (nums[i] - i)\n if count > 1 and required <= k:\n left = mid + 1\n else:\n right = mid\n return count", "class Solution:\n def maxFrequencyScore(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n left, right = 0, nums[-1] - nums[0] + 1\n while left < right:\n mid = left + (right - left) // 2\n count, required, sum = 0, 0, 0\n for i in range(n):\n sum += abs(nums[i] - (nums[0] + mid))\n required = max(required, abs(nums[i] - (nums[0] + mid)))\n if sum <= k:\n count += 1\n if sum <= k:\n left = mid + 1\n else:\n right = mid\n return count", "class Solution:\n def maxFrequencyScore(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n left, right = 0, nums[-1] - nums[0] + 1\n while left < right:\n mid = left + (right - left) // 2\n cnt, sum_ = 0, 0\n for i in range(n):\n sum_ += max(0, nums[i] - (nums[0] + mid - 1))\n cnt += sum_ == 0\n if cnt <= k:\n right = mid\n else:\n left = mid + 1\n return left", "class Solution:\n def maxFrequencyScore(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n left, right = 0, nums[-1] - nums[0] + 1\n while left < right:\n mid = left + (right - left) // 2\n count, cur_k = 0, 0\n for i in range(n):\n cur_k += abs(nums[i] - (nums[0] + mid))\n if cur_k <= k:\n count = 1\n for i in range(1, n):\n if nums[i] - nums[i - 1] > 1:\n count += (nums[i] - nums[i - 1] - 1) // 2\n left = mid + 1\n else:\n right = mid\n return count", "class Solution:\n def maxFrequencyScore(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n left, right = 0, nums[-1] - nums[0] + 1\n while left < right:\n mid = left + (right - left) // 2\n count, required, sum_ = 0, 0, 0\n for i in range(n):\n sum_ += abs(nums[i] - (nums[0] + mid))\n if sum_ > k:\n break\n count += 1 if abs(nums[i] - (nums[0] + mid)) <= required else 0\n required = max(required, abs(nums[i] - (nums[0] + mid)))\n if sum_ <= k:\n count += 1\n if sum_ <= k:\n right = mid\n else:\n left = mid + 1\n return left", "class Solution:\n def maxFrequencyScore(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n left, right = 0, nums[-1] - nums[0] + 1\n while left < right:\n mid = left + (right - left) // 2\n count, cur_k, i = 0, 0, 0\n for i in range(n):\n if nums[i] - i >= mid:\n count += 1\n cur_k += mid - (nums[i] - i)\n if count > 1 and cur_k <= k:\n right = mid\n else:\n left = mid + 1\n return count", "class Solution:\n def maxFrequencyScore(self, nums: List[int], k: int) -> int:\n nums.sort()\n n = len(nums)\n left, right = 0, nums[-1] - nums[0] + 1\n while left < right:\n mid = left + (right - left) // 2\n count, cur_k = 1, 0\n for i in range(1, n):\n if nums[i] - nums[i - 1] > mid:\n cur_k += 1\n count = 1\n elif nums[i] - nums[i - 1] == mid:\n count += 1\n else:\n count = 1\n if cur_k <= k:\n left = mid + 1\n else:\n right = mid\n return left" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def distributeCandies(self, n: int, limit: int) -> int:\n dp = [[0] * (n + 1) for _ in range(3)]\n for i in range(limit + 1):\n dp[0][i] = 1\n for i in range(1, 3):\n for j in range(1, n + 1):\n for k in range(0, min(j, limit) + 1):\n dp[i][j] += dp[i - 1][j - k]\n return dp[2][n]", "class Solution:\n def distributeCandies(self, n: int, limit: int) -> int:\n dp = [[0] * (n + 1) for _ in range(3)]\n for i in range(limit + 1):\n dp[0][i] = 1\n for i in range(1, 3):\n for j in range(limit + 1):\n for k in range(j, limit + 1):\n dp[i][j + k] += dp[i - 1][j] * dp[i][k]\n return dp[2][n]", "class Solution:\n def distributeCandies(self, n: int, limit: int) -> int:\n dp = [[0] * (n + 1) for _ in range(3)]\n for i in range(limit + 1):\n dp[0][i] = 1\n for i in range(1, 3):\n for j in range(limit + 1):\n for k in range(j, limit + 1):\n dp[i][j + k] += dp[i - 1][j] * dp[i][k]\n return dp[2][n]", "class Solution:\n def distributeCandies(self, n: int, limit: int) -> int:\n dp = [[0] * (n + 1) for _ in range(3)]\n for i in range(limit + 1):\n dp[0][i] = 1\n for i in range(1, 3):\n for j in range(1, n + 1):\n for k in range(limit + 1):\n if j - k >= 0:\n dp[i][j] += dp[i - 1][j - k]\n return sum(dp[2][i] for i in range(n + 1))", "class Solution:\n def distributeCandies(self, n: int, limit: int) -> int:\n dp = [0] * (n + 1)\n dp[0] = 1\n\n for i in range(1, n + 1):\n for j in range(1, min(i, limit) + 1):\n dp[i] += dp[i - j]\n\n return dp[n]", "class Solution:\n def distributeCandies(self, n: int, limit: int) -> int:\n dp = [0] * (n + 1)\n dp[0] = 1\n for i in range(1, n + 1):\n for j in range(1, min(i, limit) + 1):\n dp[i] += dp[i - j]\n return dp[n]", "class Solution:\n def distributeCandies(self, n: int, limit: int) -> int:\n dp = [0] * (n + 1)\n dp[0] = 1\n for i in range(1, n + 1):\n for j in range(1, min(i, limit) + 1):\n dp[i] += dp[i - j]\n return dp[n]", "class Solution:\n def distributeCandies(self, n: int, limit: int) -> int:\n dp = [[0] * (n + 1) for _ in range(3)]\n for i in range(limit + 1):\n dp[0][i] = 1\n for i in range(1, 3):\n for j in range(1, n + 1):\n for k in range(limit + 1):\n if j - k >= 0:\n dp[i][j] += dp[i - 1][j - k]\n return dp[2][n]", "class Solution:\n def distributeCandies(self, n: int, limit: int) -> int:\n dp = [0] * (n + 1)\n dp[0] = 1\n for i in range(1, n + 1):\n for j in range(limit, -1, -1):\n if i - j >= 0:\n dp[i] += dp[i - j]\n return dp[n]", "class Solution:\n def distributeCandies(self, n: int, limit: int) -> int:\n dp = [[0] * (n + 1) for _ in range(3)]\n for i in range(limit + 1):\n dp[0][i] = 1\n for i in range(1, 3):\n for j in range(limit + 1):\n for k in range(j, limit + 1):\n dp[i][j + k] += dp[i - 1][j] * dp[i][k]\n return dp[2][n]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def stringCount(self, n: int) -> int:\n mod = 10**9 + 7\n dp = [[0] * (n + 1) for _ in range(4)]\n dp[0][1] = 1\n for i in range(1, n + 1):\n for j in range(3, -1, -1):\n dp[j][i] = sum(dp[k][i - 1] for k in range(4)) % mod\n if j > 0:\n dp[j - 1][i] = (dp[j - 1][i] - dp[j][i - 1] + mod) % mod\n return dp[0][n]", "class Solution:\n def stringCount(self, n: int) -> int:\n mod = 10**9 + 7\n dp = [0] * (n + 1)\n dp[0] = 1\n for i in range(1, n + 1):\n dp[i] = (dp[i - 1] * (26 - (i - 1))) % mod\n return (dp[n] - dp[n - 4] + mod) % mod", "class Solution:\n def stringCount(self, n: int) -> int:\n mod = 10**9 + 7\n dp = [0] * (n + 1)\n dp[0] = 1\n for i in range(1, n + 1):\n dp[i] = (dp[i - 1] * (26 - (i - 1))) % mod\n return (dp[n] - dp[n - 4] + mod) % mod", "class Solution:\n def stringCount(self, n: int) -> int:\n mod = 10**9 + 7\n dp = [[0] * (n + 1) for _ in range(4)]\n dp[0][1] = 1\n for i in range(1, n + 1):\n for j in range(3, -1, -1):\n dp[j][i] = sum(dp[k][i - 1] for k in range(4)) % mod\n if j > 0:\n dp[j - 1][i] = (dp[j - 1][i] - dp[j][i - 4] + mod) % mod\n return dp[0][n]", "class Solution:\n def stringCount(self, n: int) -> int:\n mod = 10**9 + 7\n dp = [0] * (n + 1)\n dp[0] = 1\n for i in range(1, n + 1):\n dp[i] = (dp[i - 1] * (26 - (i - 1))) % mod\n return (dp[n] - dp[n - 4] + mod) % mod", "class Solution:\n def stringCount(self, n: int) -> int:\n mod = 10**9 + 7\n dp = [0] * (n + 1)\n dp[0] = 1\n for i in range(1, n + 1):\n dp[i] = (dp[i - 1] * (26 - (i - 1))) % mod\n return (dp[n] - dp[n - 4] + mod) % mod", "class Solution:\n def stringCount(self, n: int) -> int:\n mod = 10**9 + 7\n dp = [0] * (n + 1)\n dp[0] = 1\n for i in range(1, n + 1):\n dp[i] = (dp[i - 1] * (26 - (i - 1))) % mod\n return (dp[n] - dp[n - 4] + mod) % mod", "class Solution:\n def stringCount(self, n: int) -> int:\n mod = 10**9 + 7\n dp = [0] * (n + 1)\n dp[0] = 1\n for i in range(1, n + 1):\n dp[i] = (dp[i - 1] * (26 - (i - 1))) % mod\n return (dp[n] - dp[n - 4] + mod) % mod", "class Solution:\n def stringCount(self, n: int) -> int:\n mod = 10**9 + 7\n dp = [0] * (n + 1)\n dp[0] = 1\n for i in range(1, n + 1):\n for j in range(i, n + 1):\n dp[j] = (dp[j] + dp[j - i] * (26 ** (i - 1))) % mod\n return (dp[n] - dp[n - 4] + mod) % mod", "class Solution:\n def stringCount(self, n: int) -> int:\n mod = 10**9 + 7\n dp = [0] * (n + 1)\n dp[0] = 1\n for i in range(1, n + 1):\n dp[i] = (dp[i - 1] * (26 - (i - 1))) % mod\n return (dp[n] - dp[n - 4] + mod) % mod" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def canMakePalindromeQueries(self, s: str, queries: List[List[int]]) -> List[bool]:\n n = len(s)\n prefix = [0] * n\n suffix = [0] * n\n\n for i in range(n):\n prefix[i] = prefix[i - 1] ^ (1 << (ord(s[i]) - ord('a')))\n suffix[i] = suffix[i + 1] ^ (1 << (ord(s[i]) - ord('a')))\n\n answer = []\n for a, b, c, d in queries:\n x = prefix[b] ^ prefix[a - 1]\n y = suffix[c + 1] ^ suffix[d]\n answer.append((x & y) == 0)\n\n return answer", "class Solution:\n def canMakePalindromeQueries(self, s: str, queries: List[List[int]]) -> List[bool]:\n n = len(s)\n prefix = [0] * n\n suffix = [0] * n\n\n for i in range(n):\n prefix[i] = self.get_count(s[:i+1])\n suffix[i] = self.get_count(s[-1-i:])\n\n answer = []\n for query in queries:\n a, b, c, d = query\n left_count = self.get_count(s[a:b+1])\n right_count = self.get_count(s[c:d+1])\n\n left_needed = prefix[d] - prefix[b] - left_count\n right_needed = suffix[n-1-a] - suffix[n-1-c] - right_count\n\n answer.append(left_needed == right_needed)\n\n return answer\n\n def get_count(self, s: str) -> int:\n count = 0\n for ch in set(s):\n count += s.count(ch) % 2\n return count", "class Solution:\n def canMakePalindromeQueries(self, s: str, queries: List[List[int]]) -> List[bool]:\n n = len(s)\n mid = n // 2\n prefix = [False] * (mid + 1)\n suffix = [False] * (mid + 1)\n\n for i in range(mid):\n if s[i] == s[mid - i - 1]:\n prefix[i + 1] = suffix[mid - i] = True\n\n answer = []\n for query in queries:\n a, b, c, d = query\n if (\n any(s[i] == s[mid + i] for i in range(a, b + 1))\n and any(s[j] == s[mid + j - 1] for j in range(c, d + 1))\n ):\n answer.append(True)\n elif (\n any(s[i] == s[mid + i - 1] for i in range(a, b + 1))\n and any(s[j] == s[2 * mid - j - 1] for j in range(c, d + 1))\n ):\n answer.append(True)\n elif (\n any(s[i] == s[2 * mid - i - 1] for i in range(a, b + 1))\n and any(s[j] == s[mid + j] for j in range(c, d + 1))\n ):\n answer.append(True)\n elif (\n any(s[i] == s[mid] for i in range(a, b + 1))\n and any(s[j] == s[mid] for j in range(c, d + 1))\n ):\n answer.append(True)\n elif (\n any(s[i] == s[mid] for i in range(a, b + 1))\n and prefix[c]\n and suffix[d - mid + 1]\n ):\n answer.append(True)\n elif (\n prefix[a]\n and suffix[b - mid + 1]\n and any(s[j] == s[mid] for j in range(c, d + 1))\n ):\n answer.append(True)\n elif (\n prefix[a]\n and suffix[b - mid + 1]\n and prefix[c]\n and suffix[d - mid + 1]\n ):\n answer.append(True)\n else:\n answer.append(False)\n\n return answer", "class Solution:\n def canMakePalindromeQueries(self, s: str, queries: List[List[int]]) -> List[bool]:\n n = len(s)\n prefix = [0] * n\n suffix = [0] * n\n\n for i in range(n):\n prefix[i] = self.get_count(s[:i+1])\n suffix[i] = self.get_count(s[n-1-i:][::-1])\n\n answer = []\n for query in queries:\n a, b, c, d = query\n left_count = self.get_count(s[a:b+1])\n right_count = self.get_count(s[c:d+1][::-1])\n\n left_palindrome = prefix[b] - prefix[a-1] - left_count\n right_palindrome = suffix[d-1] - suffix[c-n//2] - right_count\n\n answer.append(left_palindrome == 1 and right_palindrome == 1)\n\n return answer\n\n def get_count(self, s: str) -> int:\n count = 0\n for ch in set(s):\n count += s.count(ch) % 2\n return count", "class Solution:\n def canMakePalindromeQueries(self, s: str, queries: List[List[int]]) -> List[bool]:\n n = len(s)\n mid = n // 2\n prefix = [False] * (mid + 1)\n suffix = [False] * (mid + 1)\n\n for i in range(mid):\n if s[i] == s[mid - i - 1]:\n prefix[i + 1] = suffix[mid - i] = True\n\n answer = []\n for query in queries:\n a, b, c, d = query\n if not prefix[a] and not suffix[c]:\n answer.append(False)\n continue\n if not prefix[b + 1] and not suffix[d + 1]:\n answer.append(False)\n continue\n if not prefix[a] and not prefix[b + 1] and s[a:b + 1] != s[a:b + 1][::-1]:\n answer.append(False)\n continue\n if not suffix[c] and not suffix[d + 1] and s[c:d + 1] != s[c:d + 1][::-1]:\n answer.append(False)\n continue\n answer.append(True)\n\n return answer", "class Solution:\n def canMakePalindromeQueries(self, s: str, queries: List[List[int]]) -> List[bool]:\n n = len(s)\n prefix = [0] * n\n suffix = [0] * n\n\n for i in range(n):\n prefix[i] = self.get_count(s[:i+1])\n suffix[i] = self.get_count(s[i:][::-1])\n\n answer = []\n for query in queries:\n a, b, c, d = query\n left_count = prefix[b] - prefix[a]\n right_count = suffix[d] - suffix[c - 1]\n\n answer.append(left_count + right_count <= 1)\n\n return answer\n\n def get_count(self, s: str) -> int:\n count = 0\n char_count = {}\n for char in s:\n if char not in char_count:\n char_count[char] = 1\n else:\n char_count[char] += 1\n\n for count in char_count.values():\n if count % 2 != 0:\n count += 1\n\n return count", "class Solution:\n def canMakePalindromeQueries(self, s: str, queries: List[List[int]]) -> List[bool]:\n n = len(s)\n prefix = [0] * n\n suffix = [0] * n\n\n for i in range(n):\n prefix[i] = (i + 1) * (s[i] == s[i - 1]) + prefix[i - 1]\n suffix[n - 1 - i] = (i + 1) * (s[i] == s[i + 1]) + suffix[n - i]\n\n answer = []\n for a, b, c, d in queries:\n x = prefix[b] - prefix[a - 1] if a else prefix[b]\n y = suffix[d] - suffix[c - 1] if c == n // 2 else suffix[d] - suffix[c]\n\n total_chars = x + y\n total_needed = n // 2 - x if c == n // 2 else n // 2 - x - y\n\n answer.append(total_chars >= total_needed)\n\n return answer", "class Solution:\n def canMakePalindromeQueries(self, s: str, queries: List[List[int]]) -> List[bool]:\n n = len(s)\n prefix = [0] * n\n suffix = [0] * n\n\n for i in range(n):\n prefix[i] = prefix[i - 1] ^ (1 << ord(s[i]) - 97)\n suffix[i] = suffix[i + 1] ^ (1 << ord(s[i]) - 97)\n\n def is_palindrome(a, b):\n return prefix[a] ^ suffix[b + 1] ^ (1 << ord(s[a]) - 97) ^ (1 << ord(s[b]) - 97) == 0\n\n return [is_palindrome(queries[i][0], queries[i][2] - 1) for i in range(len(queries))]", "class Solution:\n def canMakePalindromeQueries(self, s: str, queries: List[List[int]]) -> List[bool]:\n n = len(s)\n prefix = [0] * n\n suffix = [0] * n\n\n for i in range(n):\n prefix[i] = (i + 1) if s[i] not in s[:i] else prefix[s[:i].rindex(s[i])]\n suffix[n - 1 - i] = (n - i) if s[n - 1 - i] not in s[n - 1 - i + 1 :] else (\n n - suffix[n - 2 - i].rindex(s[n - 1 - i]) - 1\n )\n\n return [\n max(prefix[q[1]], suffix[q[3]]) - min(prefix[q[0]], suffix[q[2]]) - 1 <= 2\n for q in queries\n ]", "class Solution:\n def canMakePalindromeQueries(self, s: str, queries: List[List[int]]) -> List[bool]:\n n = len(s)\n prefix = [0] * n\n suffix = [0] * n\n\n for i in range(n):\n prefix[i] = self.get_count(s[:i+1])\n suffix[i] = self.get_count(s[i:])\n\n answer = []\n for query in queries:\n a, b, c, d = query\n left_count = prefix[b] - prefix[a]\n right_count = suffix[c] - suffix[d]\n\n if left_count == 1 and right_count == 1 and s[a] != s[c]:\n answer.append(False)\n else:\n answer.append(True)\n\n return answer\n\n def get_count(self, s: str) -> int:\n count = 0\n for i in range(len(s)):\n if s[i] not in s[:i]:\n count += 1\n\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findIntersectionValues(self, nums1: List[int], nums2: List[int]) -> List[int]:\n set1 = set(nums1)\n set2 = set(nums2)\n count1 = sum(1 for i in nums1 if i in set2)\n count2 = sum(1 for i in nums2 if i in set1)\n return [count1, count2]", "class Solution:\n def findIntersectionValues(self, nums1: List[int], nums2: List[int]) -> List[int]:\n set1 = set(nums1)\n set2 = set(nums2)\n return [sum(1 for i in nums1 if i in set2), sum(1 for i in nums2 if i in set1)]", "class Solution:\n def findIntersectionValues(self, nums1: List[int], nums2: List[int]) -> List[int]:\n set1 = set(nums1)\n set2 = set(nums2)\n return [sum(1 for i in nums1 if i in set2), sum(1 for i in nums2 if i in set1)]", "class Solution:\n def findIntersectionValues(self, nums1: List[int], nums2: List[int]) -> List[int]:\n set1 = set(nums1)\n set2 = set(nums2)\n count1 = sum(1 for num in nums1 if num in set2)\n count2 = sum(1 for num in nums2 if num in set1)\n return [count1, count2]", "class Solution:\n def findIntersectionValues(self, nums1: List[int], nums2: List[int]) -> List[int]:\n set1 = set(nums1)\n set2 = set(nums2)\n count1 = sum(1 for num in nums1 if num in set2)\n count2 = sum(1 for num in nums2 if num in set1)\n return [count1, count2]", "class Solution:\n def findIntersectionValues(self, nums1: List[int], nums2: List[int]) -> List[int]:\n set1 = set(nums1)\n set2 = set(nums2)\n count1 = sum(1 for num in nums1 if num in set2)\n count2 = sum(1 for num in nums2 if num in set1)\n return [count1, count2]", "class Solution:\n def findIntersectionValues(self, nums1: List[int], nums2: List[int]) -> List[int]:\n set1 = set(nums1)\n set2 = set(nums2)\n return [sum(1 for i in nums1 if i in set2), sum(1 for i in nums2 if i in set1)]", "class Solution:\n def findIntersectionValues(self, nums1: List[int], nums2: List[int]) -> List[int]:\n set1 = set(nums1)\n set2 = set(nums2)\n count1 = sum(1 for i in nums1 if i in set2)\n count2 = sum(1 for i in nums2 if i in set1)\n return [count1, count2]", "class Solution:\n def findIntersectionValues(self, nums1: List[int], nums2: List[int]) -> List[int]:\n set1 = set(nums1)\n set2 = set(nums2)\n return [sum(1 for i in nums1 if i in set2), sum(1 for i in nums2 if i in set1)]", "class Solution:\n def findIntersectionValues(self, nums1: List[int], nums2: List[int]) -> List[int]:\n set1 = set(nums1)\n set2 = set(nums2)\n return [sum(1 for num in nums1 if num in set2), sum(1 for num in nums2 if num in set1)]" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findMinimumOperations(self, s1: str, s2: str, s3: str) -> int:\n def min_ops(s1, s2):\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] != s2[j]:\n break\n i += 1\n j += 1\n return len(s1) - i + len(s2) - j\n\n if s1[0] != s2[0] or s1[0] != s3[0] or s2[0] != s3[0]:\n return -1\n\n return min(min_ops(s1, s2) + min_ops(s1, s3), min_ops(s1, s2) + min_ops(s2, s3), min_ops(s1, s3) + min_ops(s2, s3))", "class Solution:\n def findMinimumOperations(self, s1: str, s2: str, s3: str) -> int:\n def min_operations(s1, s2):\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] != s2[j]:\n break\n i += 1\n j += 1\n return len(s1) - i + len(s2) - j\n\n if s1[0] != s2[0] or s1[0] != s3[0] or s2[0] != s3[0]:\n return -1\n return min(min_operations(s1, s2) + min_operations(s2, s3), min_operations(s1, s3) + min_operations(s3, s2), min_operations(s1, s2) + min_operations(s1, s3))", "class Solution:\n def findMinimumOperations(self, s1: str, s2: str, s3: str) -> int:\n def min_operations(s1, s2):\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] != s2[j]:\n break\n i += 1\n j += 1\n return len(s1) - i + len(s2) - j\n\n if s1[0] != s2[0] or s1[0] != s3[0] or s2[0] != s3[0]:\n return -1\n\n return min(min_operations(s1, s2) + min_operations(s2, s3), min_operations(s1, s3) + min_operations(s2, s3), min_operations(s1, s2) + min_operations(s1, s3))", "class Solution:\n def findMinimumOperations(self, s1: str, s2: str, s3: str) -> int:\n def min_ops(s1, s2):\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] != s2[j]:\n break\n i += 1\n j += 1\n return len(s1) - i + len(s2) - j\n\n ops12 = min_ops(s1, s2)\n ops13 = min_ops(s1, s3)\n ops23 = min_ops(s2, s3)\n\n if min(ops12, ops13, ops23) == len(min(s1, s2, s3, key=len)):\n return max(ops12, ops13, ops23)\n return -1", "class Solution:\n def findMinimumOperations(self, s1: str, s2: str, s3: str) -> int:\n def min_operations(s1, s2):\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] != s2[j]:\n break\n i += 1\n j += 1\n return len(s1) - i + len(s2) - j\n\n if s1[0] != s2[0] or s1[0] != s3[0] or s2[0] != s3[0]:\n return -1\n\n return min(min_operations(s1, s2) + min_operations(s2, s3),\n min_operations(s1, s3) + min_operations(s3, s2),\n min_operations(s1, s2) + min_operations(s1, s3))", "class Solution:\n def findMinimumOperations(self, s1: str, s2: str, s3: str) -> int:\n def min_operations(s1, s2):\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] != s2[j]:\n break\n i += 1\n j += 1\n return len(s1) - i + len(s2) - j\n\n if s1[0] != s2[0] or s1[0] != s3[0] or s2[0] != s3[0]:\n return -1\n\n return min(\n min(\n min_operations(s1, s2) + min_operations(s1, s3),\n min_operations(s2, s1) + min_operations(s2, s3),\n ),\n min_operations(s3, s1) + min_operations(s3, s2),\n )", "class Solution:\n def findMinimumOperations(self, s1: str, s2: str, s3: str) -> int:\n def min_ops(s1, s2):\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] != s2[j]:\n break\n i += 1\n j += 1\n return len(s1) - i + len(s2) - j\n\n if s1[0] != s2[0] or s1[0] != s3[0] or s2[0] != s3[0]:\n return -1\n\n return min(min_ops(s1, s2) + min_ops(s2, s3), min_ops(s1, s3) + min_ops(s1, s2), min_ops(s2, s3) + min_ops(s1, s3))", "class Solution:\n def findMinimumOperations(self, s1: str, s2: str, s3: str) -> int:\n def min_ops(s1, s2):\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] != s2[j]:\n break\n i += 1\n j += 1\n return len(s1) - i + len(s2) - j\n\n if s1[0] != s2[0] or s1[0] != s3[0] or s2[0] != s3[0]:\n return -1\n\n return min(min_ops(s1, s2) + min_ops(s2, s3), min_ops(s1, s3) + min_ops(s3, s2), min_ops(s1, s2) + min_ops(s1, s3))", "class Solution:\n def findMinimumOperations(self, s1: str, s2: str, s3: str) -> int:\n def min_ops(s1, s2):\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] != s2[j]:\n break\n i += 1\n j += 1\n return len(s1) - i + len(s2) - j\n\n if s1[0] != s2[0] or s1[0] != s3[0] or s2[0] != s3[0]:\n return -1\n return min(min_ops(s1, s2), min_ops(s1, s3), min_ops(s2, s3))", "class Solution:\n def findMinimumOperations(self, s1: str, s2: str, s3: str) -> int:\n def min_ops(s1, s2):\n i, j = 0, 0\n while i < len(s1) and j < len(s2):\n if s1[i] != s2[j]:\n break\n i += 1\n j += 1\n return len(s1) - i + len(s2) - j\n\n if s1[0] != s2[0] or s1[0] != s3[0] or s2[0] != s3[0]:\n return -1\n\n return min(min_ops(s1, s2) + min_ops(s1, s3), min_ops(s1, s2) + min_ops(s2, s3), min_ops(s1, s3) + min_ops(s2, s3))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumCoins(self, prices: List[int]) -> int:\n dp = [0] * len(prices)\n dp[0] = prices[0]\n for i in range(1, len(prices)):\n dp[i] = min(dp[i - 1], prices[i]) + min(prices[i], dp[max(0, i - prices[i])])\n return dp[-1]", "class Solution:\n def minimumCoins(self, prices: List[int]) -> int:\n dp = [0] * len(prices)\n dp[0] = prices[0]\n\n for i in range(1, len(prices)):\n dp[i] = min(dp[i - 1], prices[i]) + min(dp[max(0, i - prices[i])], prices[i])\n\n return min(dp)", "class Solution:\n def minimumCoins(self, prices: List[int]) -> int:\n n = len(prices)\n dp = [0] * n\n dp[0] = prices[0]\n\n for i in range(1, n):\n dp[i] = min(dp[i - 1], prices[i] + (i * (i + 1)) // 2)\n\n return dp[n - 1]", "class Solution:\n def minimumCoins(self, prices: List[int]) -> int:\n n = len(prices)\n dp = [0] * n\n dp[0] = prices[0]\n\n for i in range(1, n):\n dp[i] = min(dp[i - 1], prices[i] + (i + 1) * dp[max(0, i - prices[i])])\n\n return dp[n - 1]", "class Solution:\n def minimumCoins(self, prices: List[int]) -> int:\n dp = [0] * len(prices)\n dp[0] = prices[0]\n\n for i in range(1, len(prices)):\n dp[i] = min(dp[i - 1], prices[i] + (i * dp[max(0, i - prices[i] - 1)]))\n\n return dp[-1]", "class Solution:\n def minimumCoins(self, prices: List[int]) -> int:\n n = len(prices)\n dp = [0] * n\n dp[0] = prices[0]\n\n for i in range(1, n):\n dp[i] = min(dp[i - 1], prices[i] + (i + 1) * prices[0])\n\n return min(dp)", "class Solution:\n def minimumCoins(self, prices: List[int]) -> int:\n n = len(prices)\n dp = [0] * n\n dp[0] = prices[0]\n\n for i in range(1, n):\n dp[i] = min(dp[i - 1], prices[i] + (i + 1) * dp[max(0, i - 2)])\n\n return dp[n - 1]", "class Solution:\n def minimumCoins(self, prices: List[int]) -> int:\n n = len(prices)\n dp = [0] * n\n dp[0] = prices[0]\n\n for i in range(1, n):\n dp[i] = min(dp[i - 1], prices[i] + (i + 1) * dp[max(0, i - 2)])\n\n return dp[n - 1]", "class Solution:\n def minimumCoins(self, prices: List[int]) -> int:\n n = len(prices)\n dp = [0] * n\n dp[0] = prices[0]\n\n for i in range(1, n):\n dp[i] = min(dp[i - 1], prices[i] + (i + 1) * dp[max(0, i - 2)])\n\n return dp[n - 1]", "class Solution:\n def minimumCoins(self, prices: List[int]) -> int:\n n = len(prices)\n dp = [0] * n\n dp[0] = prices[0]\n\n for i in range(1, n):\n dp[i] = min(dp[i - 1], prices[i] + (i + 1) * dp[max(0, i - 2)])\n\n return dp[n - 1]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def beautifulSubstrings(self, s: str, k: int) -> int:\n count = 0\n vowel_count = 0\n consonant_count = 0\n vowel_map = {\"a\": 0, \"e\": 0, \"i\": 0, \"o\": 0, \"u\": 0}\n\n for i in range(len(s)):\n if s[i] in vowel_map:\n vowel_count += 1\n vowel_map[s[i]] += 1\n else:\n consonant_count += 1\n\n if vowel_count == consonant_count and (vowel_count * consonant_count) % k == 0:\n count += 1\n\n return count", "class Solution:\n def beautifulSubstrings(self, s: str, k: int) -> int:\n count = 0\n vowel_count = 0\n consonant_count = 0\n vowel_map = {\"a\": 0, \"e\": 0, \"i\": 0, \"o\": 0, \"u\": 0}\n\n for i in range(len(s)):\n if s[i] in vowel_map:\n vowel_count += 1\n vowel_map[s[i]] += 1\n else:\n consonant_count += 1\n\n if vowel_count == consonant_count and (vowel_count * consonant_count) % k == 0:\n count += 1\n\n return count", "class Solution:\n def beautifulSubstrings(self, s: str, k: int) -> int:\n count = 0\n vowel_count = 0\n consonant_count = 0\n vowel_set = set(\"aeiou\")\n \n for char in s:\n if char in vowel_set:\n vowel_count += 1\n else:\n consonant_count += 1\n \n if vowel_count == consonant_count and (vowel_count * consonant_count) % k == 0:\n count += 1\n \n return count", "class Solution:\n def beautifulSubstrings(self, s: str, k: int) -> int:\n count = 0\n vowel_count = 0\n consonant_count = 0\n vowel_map = {\"a\": 0, \"e\": 0, \"i\": 0, \"o\": 0, \"u\": 0}\n\n for i in range(len(s)):\n if s[i] in vowel_map:\n vowel_count += 1\n vowel_map[s[i]] += 1\n else:\n consonant_count += 1\n\n if vowel_count == consonant_count and (vowel_count * consonant_count) % k == 0:\n count += 1\n\n return count", "class Solution:\n def beautifulSubstrings(self, s: str, k: int) -> int:\n count = 0\n vowel_count = 0\n consonant_count = 0\n vowel_map = {\"a\": 0, \"e\": 0, \"i\": 0, \"o\": 0, \"u\": 0}\n\n for i in range(len(s)):\n if s[i] in vowel_map:\n vowel_count += 1\n vowel_map[s[i]] += 1\n else:\n consonant_count += 1\n\n if vowel_count == consonant_count and (vowel_count * consonant_count) % k == 0:\n count += 1\n\n return count", "class Solution:\n def beautifulSubstrings(self, s: str, k: int) -> int:\n count = 0\n vowel_count = 0\n consonant_count = 0\n vowel_set = set(\"aeiou\")\n\n for char in s:\n if char in vowel_set:\n vowel_count += 1\n else:\n consonant_count += 1\n\n if vowel_count == consonant_count and (vowel_count * consonant_count) % k == 0:\n count += 1\n\n return count", "class Solution:\n def beautifulSubstrings(self, s: str, k: int) -> int:\n count = 0\n vowel_count = 0\n consonant_count = 0\n vowel_set = set(\"aeiou\")\n\n for char in s:\n if char in vowel_set:\n vowel_count += 1\n else:\n consonant_count += 1\n\n if vowel_count == consonant_count and (vowel_count * consonant_count) % k == 0:\n count += 1\n\n return count", "class Solution:\n def beautifulSubstrings(self, s: str, k: int) -> int:\n count = 0\n vowel_count = 0\n consonant_count = 0\n vowel_map = {\"a\": 0, \"e\": 0, \"i\": 0, \"o\": 0, \"u\": 0}\n\n for i in range(len(s)):\n if s[i] in vowel_map:\n vowel_count += 1\n vowel_map[s[i]] += 1\n else:\n consonant_count += 1\n\n if vowel_count == consonant_count and (vowel_count * consonant_count) % k == 0:\n count += 1\n\n for j in range(i + 1, len(s)):\n if s[j] in vowel_map:\n vowel_map[s[j]] -= 1\n if vowel_map[s[j]] == 0:\n vowel_count -= 1\n else:\n consonant_count -= 1\n\n if vowel_count == consonant_count and (vowel_count * consonant_count) % k == 0:\n count += 1\n\n else:\n if vowel_count > consonant_count:\n vowel_count -= 1\n else:\n consonant_count -= 1\n\n if vowel_count == consonant_count and (vowel_count * consonant_count) % k == 0:\n count += 1\n\n return count", "class Solution:\n def beautifulSubstrings(self, s: str, k: int) -> int:\n count = 0\n vowel_count = 0\n consonant_count = 0\n vowel_set = set(\"aeiou\")\n \n for i in range(len(s)):\n if s[i] in vowel_set:\n vowel_count += 1\n else:\n consonant_count += 1\n \n while vowel_count == consonant_count and (vowel_count * consonant_count) % k == 0:\n count += 1\n if i == 0 or s[i - 1] in vowel_set:\n consonant_count -= 1\n else:\n vowel_count -= 1\n \n return count", "class Solution:\n def beautifulSubstrings(self, s: str, k: int) -> int:\n count = 0\n vowel_count = 0\n consonant_count = 0\n vowel_map = {\"a\": 0, \"e\": 0, \"i\": 0, \"o\": 0, \"u\": 0}\n\n for i in range(len(s)):\n if s[i] in vowel_map:\n vowel_count += 1\n vowel_map[s[i]] += 1\n else:\n consonant_count += 1\n\n if vowel_count == consonant_count and (vowel_count * consonant_count) % k == 0:\n count += 1\n\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, true, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findMaximumLength(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[1, nums[0]] for _ in range(n)]\n\n for i in range(1, n):\n for j in range(i, -1, -1):\n if nums[i] >= nums[j]:\n dp[i][0] = dp[j][0] + 1\n dp[i][1] = max(dp[j][1] + nums[i], nums[i])\n else:\n dp[i][0] = 1\n dp[i][1] = nums[i]\n\n return max(dp)[0]", "class Solution:\n def findMaximumLength(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[1, nums[0]] for _ in range(n)]\n\n for i in range(1, n):\n for j in range(i, -1, -1):\n if nums[i] >= nums[j]:\n dp[i][0] = dp[j][0] + 1\n dp[i][1] = max(dp[j][1] + nums[i], nums[i])\n else:\n dp[i][0] = 1\n dp[i][1] = nums[i]\n\n return max(dp)[0]", "class Solution:\n def findMaximumLength(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[1, nums[0]] for _ in range(n)]\n max_len = 1\n\n for i in range(1, n):\n for j in range(i, -1, -1):\n if nums[i] >= nums[j]:\n dp[i][0] = dp[j][0] + 1\n dp[i][1] = max(dp[j][1], dp[i][1])\n else:\n dp[i][1] = dp[j][1] + nums[i]\n\n max_len = max(max_len, dp[i][0])\n\n return max_len", "class Solution:\n def findMaximumLength(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[1, nums[0]] for _ in range(n)]\n for i in range(1, n):\n for j in range(i, -1, -1):\n if nums[i] >= nums[j]:\n dp[i][0] = dp[j][0] + 1\n dp[i][1] = max(dp[j][1], dp[i][0] * nums[i])\n else:\n dp[i][1] = max(dp[i][1], dp[j][1])\n return max(dp)[0]", "class Solution:\n def findMaximumLength(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[1, nums[0]] for _ in range(n)]\n\n for i in range(1, n):\n for j in range(i, -1, -1):\n if nums[i] >= nums[j]:\n dp[i][0] = dp[j][0] + 1\n dp[i][1] = max(dp[j][1] + nums[i], nums[i])\n else:\n dp[i][0] = 1\n dp[i][1] = nums[i]\n\n return max(dp)[0]", "class Solution:\n def findMaximumLength(self, nums: List[int]) -> int:\n n = len(nums)\n max_len = 1\n sum_so_far = nums[0]\n prev_sum = 0\n for num in nums[1:]:\n prev_sum = max(prev_sum, sum_so_far)\n sum_so_far = num if num > sum_so_far else sum_so_far + num\n max_len = max(max_len, sum_so_far - prev_sum + 1)\n return max_len", "class Solution:\n def findMaximumLength(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[1, nums[0]] for _ in range(n)]\n max_len = 1\n\n for i in range(1, n):\n for j in range(i, -1, -1):\n if nums[i] >= nums[j]:\n dp[i][0] = dp[j][0] + 1\n dp[i][1] = max(dp[i][1], dp[j][1] + nums[i])\n else:\n dp[i][1] = max(dp[i][1], dp[j][1])\n\n max_len = max(max_len, dp[i][0])\n\n return max_len", "class Solution:\n def findMaximumLength(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[1, nums[0]] for _ in range(n)]\n max_len = 1\n\n for i in range(1, n):\n for j in range(i, -1, -1):\n if nums[i] >= nums[j]:\n dp[i][0] = dp[j][0] + 1\n dp[i][1] = max(dp[i][1], dp[j][1] + nums[i])\n else:\n dp[i][1] = max(dp[i][1], dp[j][1])\n\n max_len = max(max_len, dp[i][0])\n\n return max_len", "class Solution:\n def findMaximumLength(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[1, nums[0]] for _ in range(n)]\n\n for i in range(1, n):\n for j in range(i, -1, -1):\n if nums[i] >= nums[j]:\n dp[i][0] = dp[j][0] + 1\n dp[i][1] = max(dp[j][1] + nums[i], nums[i])\n else:\n dp[i][0] = 1\n dp[i][1] = nums[i]\n\n return max(dp)[0]", "class Solution:\n def findMaximumLength(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[1, nums[0]] for _ in range(n)]\n max_len = 1\n\n for i in range(1, n):\n for j in range(i, -1, -1):\n if nums[i] >= nums[j]:\n dp[i][0] = dp[j][0] + 1\n dp[i][1] = max(dp[i][1], dp[j][1] + nums[i])\n else:\n dp[i][1] = max(dp[i][1], dp[j][1])\n\n max_len = max(max_len, dp[i][0])\n\n return max_len" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberOfGoodPartitions(self, nums: List[int]) -> int:\n from collections import Counter\n count = Counter(nums)\n mod = 10**9 + 7\n dp = [1] * (len(nums) + 1)\n for i in range(len(nums) - 1, -1, -1):\n dp[i] = (dp[i] + dp[i + 1] - 1) * count[nums[i]] % mod\n dp[i + 1] = dp[i + 1] * count[nums[i]] % mod\n return dp[0] % mod", "class Solution:\n def numberOfGoodPartitions(self, nums: List[int]) -> int:\n from collections import Counter\n c = Counter(nums)\n mod = 10**9 + 7\n dp = [1] * (len(nums) + 1)\n for i in range(len(nums) - 1, -1, -1):\n dp[i] = (dp[i] + dp[i + 1] - 1) * c[nums[i]] % mod\n dp[i + 1] = (dp[i + 1] + dp[i + 1] - 1) * c[nums[i]] % mod\n return dp[0] % mod", "class Solution:\n def numberOfGoodPartitions(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = Counter(nums)\n mod = 10**9 + 7\n dp = [1] * (len(nums) + 1)\n\n for i in range(len(nums) - 1, -1, -1):\n dp[i] = (dp[i] + dp[i + 1] - 1) * count[nums[i]] % mod\n count[nums[i]] -= 1\n\n return dp[0] % mod", "class Solution:\n def numberOfGoodPartitions(self, nums: List[int]) -> int:\n from collections import Counter\n c = Counter(nums)\n mod = 10**9 + 7\n dp = [1] * (len(nums) + 1)\n for i in range(len(nums) - 1, -1, -1):\n dp[i] = (dp[i] + dp[i + 1] - 1) * c[nums[i]] % mod\n dp[i + 1] = (dp[i + 1] + dp[i + 1] - 1) % mod\n return dp[0] % mod", "class Solution:\n def numberOfGoodPartitions(self, nums: List[int]) -> int:\n from collections import Counter\n c = Counter(nums)\n mod = 10**9 + 7\n dp = [1] * (len(nums) + 1)\n for i in range(len(nums) - 1, -1, -1):\n dp[i] = (dp[i] + dp[i + 1] - c[nums[i]]) % mod\n return dp[0]", "class Solution:\n def numberOfGoodPartitions(self, nums: List[int]) -> int:\n from collections import Counter\n c = Counter(nums)\n mod = 10**9 + 7\n dp = [1] * (len(nums) + 1)\n for i in range(len(nums) - 1, -1, -1):\n dp[i] = (dp[i] + dp[i + 1] - 1) * c[nums[i]] % mod\n dp[i + 1] = (dp[i + 1] + dp[i + 1] - 1) % mod\n return dp[0]", "class Solution:\n def numberOfGoodPartitions(self, nums: List[int]) -> int:\n from collections import Counter\n c = Counter(nums)\n mod = 10**9 + 7\n dp = [1] * (len(nums) + 1)\n for i in range(len(nums) - 1, -1, -1):\n dp[i] = (dp[i] + dp[i + 1] - 1) * c[nums[i]] % mod\n dp[i + 1] = (dp[i + 1] + dp[i + 1] - 1) % mod\n return dp[0] % mod", "class Solution:\n def numberOfGoodPartitions(self, nums: List[int]) -> int:\n from collections import Counter\n count = Counter(nums)\n mod = 10**9 + 7\n dp = [1] * (len(nums) + 1)\n for i in range(len(nums) - 1, -1, -1):\n dp[i] = (dp[i] + dp[i + 1] - 1) * count[nums[i]] % mod\n count[nums[i]] -= 1\n return dp[0] % mod", "class Solution:\n def numberOfGoodPartitions(self, nums: List[int]) -> int:\n from collections import Counter\n c = Counter(nums)\n mod = 10**9 + 7\n dp = [1] * (len(nums) + 1)\n for i in range(len(nums) - 1, -1, -1):\n dp[i] = (dp[i] + dp[i + 1] - 1) * c[nums[i]] % mod\n dp[i + 1] = (dp[i + 1] + dp[i + 1] - 1) % mod\n return dp[0] % mod", "class Solution:\n def numberOfGoodPartitions(self, nums: List[int]) -> int:\n from collections import Counter\n c = Counter(nums)\n mod = 10**9 + 7\n dp = [1] * (len(nums) + 1)\n for i in range(len(nums) - 1, -1, -1):\n dp[i] = (dp[i] + dp[i + 1] - 1) * c[nums[i]] % mod\n return dp[0]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countSubarrays(self, nums: List[int], k: int) -> int:\n max_element = max(nums)\n count = 0\n for i in range(len(nums)):\n if nums[i] == max_element:\n j = i\n while j < len(nums) and nums[j] == max_element:\n j += 1\n if j - i >= k:\n count += j - i + 1\n return count", "class Solution:\n def countSubarrays(self, nums: List[int], k: int) -> int:\n max_num = max(nums)\n max_count = nums.count(max_num)\n return sum(max(0, min(max_count - i, k) + 1) for i in range(len(nums) + 1))", "class Solution:\n def countSubarrays(self, nums: List[int], k: int) -> int:\n max_num = max(nums)\n max_count = nums.count(max_num)\n\n if k > max_count:\n return 0\n\n left, right = 0, 0\n count = 0\n while right < len(nums):\n if nums[right] == max_num:\n max_count -= 1\n right += 1\n if max_count >= k - 1:\n count += right - left\n left += 1\n else:\n left = right + 1\n\n return count", "class Solution:\n def countSubarrays(self, nums: List[int], k: int) -> int:\n max_element = max(nums)\n count = 0\n for i in range(len(nums)):\n if nums[i] == max_element:\n j = i\n while j < len(nums) and nums[j] == max_element:\n j += 1\n if j - i >= k:\n count += j - i + 1\n return count", "class Solution:\n def countSubarrays(self, nums: List[int], k: int) -> int:\n max_element = max(nums)\n count = 0\n for i in range(len(nums)):\n if nums[i] == max_element:\n j = i\n while j < len(nums) and nums[j] == max_element:\n j += 1\n if j - i >= k:\n count += j - i + 1\n return count", "class Solution:\n def countSubarrays(self, nums: List[int], k: int) -> int:\n max_element = max(nums)\n count = 0\n for i in range(len(nums)):\n if nums[i] == max_element:\n j = i\n while j < len(nums) and nums[j] == max_element:\n j += 1\n if j - i >= k:\n count += j - i + 1\n return count", "class Solution:\n def countSubarrays(self, nums: List[int], k: int) -> int:\n max_num = max(nums)\n max_count = nums.count(max_num)\n\n if k > max_count:\n return 0\n\n left, right = 0, 0\n count = 0\n while right < len(nums):\n if nums[right] == max_num:\n count += 1\n if count >= k:\n while left <= right and count >= k:\n if nums[left] == max_num:\n count -= 1\n left += 1\n if count >= k:\n count += 1\n right += 1\n result += right - left + 1\n else:\n right += 1\n\n return result", "class Solution:\n def countSubarrays(self, nums: List[int], k: int) -> int:\n max_num = max(nums)\n count = 0\n subarray_count = 0\n\n for num in nums:\n if num == max_num:\n count += 1\n if count >= k:\n subarray_count += 1\n else:\n count = 0\n\n return subarray_count", "class Solution:\n def countSubarrays(self, nums: List[int], k: int) -> int:\n max_element = max(nums)\n count = 0\n for i in range(len(nums)):\n if nums[i] == max_element:\n j = i\n while j < len(nums) and nums[j] == max_element:\n j += 1\n if j - i >= k:\n count += j - i + 1\n return count", "class Solution:\n def countSubarrays(self, nums: List[int], k: int) -> int:\n max_element = max(nums)\n count = 0\n window_size = 0\n max_count = 0\n\n for num in nums:\n if num == max_element:\n max_count += 1\n else:\n max_count = 0\n\n if max_count >= k:\n window_size += 1\n count += window_size\n\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def lexicographicallySmallestArray(self, nums: List[int], limit: int) -> List[int]:\n n = len(nums)\n for i in range(n - 1):\n j = i + 1\n while j > i:\n if abs(nums[i] - nums[j]) > limit:\n break\n if nums[j] < nums[i]:\n nums[i], nums[j] = nums[j], nums[i]\n break\n j -= 1\n return nums", "class Solution:\n def lexicographicallySmallestArray(self, nums: List[int], limit: int) -> List[int]:\n n = len(nums)\n for i in range(n - 1):\n j = i\n while j > 0 and abs(nums[j - 1] - nums[j]) > limit:\n nums[j - 1], nums[j] = nums[j], nums[j - 1]\n j -= 1\n nums[i], min_val = min((nums[i], val) for val in nums[i:][:-1] if abs(val - nums[i]) <= limit)\n return nums", "class Solution:\n def lexicographicallySmallestArray(self, nums: List[int], limit: int) -> List[int]:\n n = len(nums)\n for i in range(n - 1, 0, -1):\n if nums[i - 1] > nums[i]:\n j = i\n while j < n and nums[j] < nums[i - 1] - limit:\n j += 1\n nums[i - 1], nums[j - 1] = nums[j - 1], nums[i - 1]\n return nums", "class Solution:\n def lexicographicallySmallestArray(self, nums: List[int], limit: int) -> List[int]:\n n = len(nums)\n for i in range(n - 1):\n j = i\n while j > 0 and abs(nums[j - 1] - nums[j]) > limit:\n nums[j - 1], nums[j] = nums[j], nums[j - 1]\n j -= 1\n nums[i], min_val = min((nums[i], val) for val in nums[i + 1 :])\n return nums", "class Solution:\n def lexicographicallySmallestArray(self, nums: List[int], limit: int) -> List[int]:\n n = len(nums)\n for i in range(n - 2, -1, -1):\n j = min(range(i, n), key=lambda x: nums[x])\n if nums[i] > nums[j] + limit:\n nums[i], nums[j] = nums[j], nums[i]\n return nums", "class Solution:\n def lexicographicallySmallestArray(self, nums: List[int], limit: int) -> List[int]:\n n = len(nums)\n for i in range(n - 1, 0, -1):\n if nums[i - 1] > nums[i]:\n j = i\n while j < n and nums[j] < nums[i - 1] - limit:\n j += 1\n nums[i - 1], nums[j - 1] = nums[j - 1], nums[i - 1]\n return nums", "class Solution:\n def lexicographicallySmallestArray(self, nums: List[int], limit: int) -> List[int]:\n n = len(nums)\n for i in range(n - 1):\n j = i + 1\n while j > i and abs(nums[j] - nums[j - 1]) > limit:\n nums[j], nums[j - 1] = nums[j - 1], nums[j]\n j -= 1\n if nums[i] > nums[i + 1]:\n nums[i:] = nums[n - 1 : i - 1 : -1]\n return nums", "class Solution:\n def lexicographicallySmallestArray(self, nums: List[int], limit: int) -> List[int]:\n n = len(nums)\n for i in range(n - 1):\n j = i + 1\n while j > i and abs(nums[j] - nums[j - 1]) > limit:\n nums[j], nums[j - 1] = nums[j - 1], nums[j]\n j -= 1\n min_idx = min(j, i + 1)\n if min_idx != i:\n nums[i], nums[min_idx] = nums[min_idx], nums[i]\n return nums", "class Solution:\n def lexicographicallySmallestArray(self, nums: List[int], limit: int) -> List[int]:\n n = len(nums)\n for i in range(n - 1, 0, -1):\n if nums[i - 1] > nums[i]:\n j = min(i, (nums[i - 1] - limit) // (n - i + 1) + i)\n nums[i - 1], nums[j] = nums[j], nums[i - 1]\n return nums", "class Solution:\n def lexicographicallySmallestArray(self, nums: List[int], limit: int) -> List[int]:\n n = len(nums)\n for i in range(n - 1):\n j = i + 1\n while j > i and abs(nums[j] - nums[j - 1]) > limit:\n nums[j], nums[j - 1] = nums[j - 1], nums[j]\n j -= 1\n if nums[i] > nums[i + 1]:\n nums[i:] = nums[i + 1:]\n return nums" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countTestedDevices(self, batteryPercentages: List[int]) -> int:\n tested_devices = 0\n for i in range(len(batteryPercentages)):\n if batteryPercentages[i] > 0:\n tested_devices += 1\n for j in range(i + 1, len(batteryPercentages)):\n batteryPercentages[j] = max(0, batteryPercentages[j] - 1)\n return tested_devices", "class Solution:\n def countTestedDevices(self, batteryPercentages: List[int]) -> int:\n tested_devices = 0\n for i in range(len(batteryPercentages)):\n if batteryPercentages[i] > 0:\n tested_devices += 1\n for j in range(i + 1, len(batteryPercentages)):\n batteryPercentages[j] = max(0, batteryPercentages[j] - 1)\n return tested_devices", "class Solution:\n def countTestedDevices(self, batteryPercentages: List[int]) -> int:\n tested_devices = 0\n for i in range(len(batteryPercentages)):\n if batteryPercentages[i] > 0:\n tested_devices += 1\n for j in range(i + 1, len(batteryPercentages)):\n batteryPercentages[j] = max(0, batteryPercentages[j] - 1)\n return tested_devices", "class Solution:\n def countTestedDevices(self, batteryPercentages: List[int]) -> int:\n tested_devices = 0\n for i in range(len(batteryPercentages)):\n if batteryPercentages[i] > 0:\n tested_devices += 1\n for j in range(i + 1, len(batteryPercentages)):\n batteryPercentages[j] = max(0, batteryPercentages[j] - 1)\n return tested_devices", "class Solution:\n def countTestedDevices(self, batteryPercentages: List[int]) -> int:\n count = 0\n for i in range(len(batteryPercentages)):\n if batteryPercentages[i] > 0:\n count += 1\n for j in range(i + 1, len(batteryPercentages)):\n batteryPercentages[j] = max(0, batteryPercentages[j] - 1)\n return count", "class Solution:\n def countTestedDevices(self, batteryPercentages: List[int]) -> int:\n tested_devices = 0\n for i in range(len(batteryPercentages)):\n if batteryPercentages[i] > 0:\n tested_devices += 1\n for j in range(i + 1, len(batteryPercentages)):\n batteryPercentages[j] = max(0, batteryPercentages[j] - 1)\n return tested_devices", "class Solution:\n def countTestedDevices(self, batteryPercentages: List[int]) -> int:\n tested_devices = 0\n for i in range(len(batteryPercentages)):\n if batteryPercentages[i] > 0:\n tested_devices += 1\n for j in range(i + 1, len(batteryPercentages)):\n batteryPercentages[j] = max(0, batteryPercentages[j] - 1)\n return tested_devices", "class Solution:\n def countTestedDevices(self, batteryPercentages: List[int]) -> int:\n count = 0\n for i in range(len(batteryPercentages)):\n if batteryPercentages[i] > 0:\n count += 1\n for j in range(i + 1, len(batteryPercentages)):\n batteryPercentages[j] = max(0, batteryPercentages[j] - 1)\n return count", "class Solution:\n def countTestedDevices(self, batteryPercentages: List[int]) -> int:\n tested_devices = 0\n for i in range(len(batteryPercentages)):\n if batteryPercentages[i] > 0:\n tested_devices += 1\n for j in range(i + 1, len(batteryPercentages)):\n batteryPercentages[j] = max(0, batteryPercentages[j] - 1)\n return tested_devices", "class Solution:\n def countTestedDevices(self, batteryPercentages: List[int]) -> int:\n tested_devices = 0\n for i in range(len(batteryPercentages)):\n if batteryPercentages[i] > 0:\n tested_devices += 1\n for j in range(i + 1, len(batteryPercentages)):\n batteryPercentages[j] = max(0, batteryPercentages[j] - 1)\n return tested_devices" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findPeaks(self, mountain: List[int]) -> List[int]:\n peaks = []\n for i in range(1, len(mountain) - 1):\n if mountain[i] > mountain[i - 1] and mountain[i] > mountain[i + 1]:\n peaks.append(i)\n return peaks", "class Solution:\n def findPeaks(self, mountain: List[int]) -> List[int]:\n peaks = []\n for i in range(1, len(mountain) - 1):\n if mountain[i] > mountain[i - 1] and mountain[i] > mountain[i + 1]:\n peaks.append(i)\n return peaks", "class Solution:\n def findPeaks(self, mountain: List[int]) -> List[int]:\n peaks = []\n for i in range(1, len(mountain) - 1):\n if mountain[i] > mountain[i - 1] and mountain[i] > mountain[i + 1]:\n peaks.append(i)\n return peaks", "class Solution:\n def findPeaks(self, mountain: List[int]) -> List[int]:\n peaks = []\n for i in range(1, len(mountain) - 1):\n if mountain[i] > mountain[i - 1] and mountain[i] > mountain[i + 1]:\n peaks.append(i)\n return peaks", "class Solution:\n def findPeaks(self, mountain: List[int]) -> List[int]:\n peaks = []\n for i in range(1, len(mountain) - 1):\n if mountain[i] > mountain[i - 1] and mountain[i] > mountain[i + 1]:\n peaks.append(i)\n return peaks", "class Solution:\n def findPeaks(self, mountain: List[int]) -> List[int]:\n peaks = []\n for i in range(1, len(mountain) - 1):\n if mountain[i] > mountain[i - 1] and mountain[i] > mountain[i + 1]:\n peaks.append(i)\n return peaks", "class Solution:\n def findPeaks(self, mountain: List[int]) -> List[int]:\n peaks = []\n for i in range(1, len(mountain) - 1):\n if mountain[i] > mountain[i - 1] and mountain[i] > mountain[i + 1]:\n peaks.append(i)\n return peaks", "class Solution:\n def findPeaks(self, mountain: List[int]) -> List[int]:\n peaks = []\n for i in range(1, len(mountain) - 1):\n if mountain[i] > mountain[i - 1] and mountain[i] > mountain[i + 1]:\n peaks.append(i)\n return peaks", "class Solution:\n def findPeaks(self, mountain: List[int]) -> List[int]:\n peaks = []\n for i in range(1, len(mountain) - 1):\n if mountain[i] > mountain[i - 1] and mountain[i] > mountain[i + 1]:\n peaks.append(i)\n return peaks", "class Solution:\n def findPeaks(self, mountain: List[int]) -> List[int]:\n peaks = []\n for i in range(1, len(mountain) - 1):\n if mountain[i] > mountain[i-1] and mountain[i] > mountain[i+1]:\n peaks.append(i)\n return peaks" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countCompleteSubstrings(self, word: str, k: int) -> int:\n def is_complete_substring(s: str) -> bool:\n letter_counts = [0] * 26\n for c in s:\n letter_counts[ord(c) - ord('a')] += 1\n for count in letter_counts:\n if count != k:\n return False\n for i in range(1, len(s)):\n if abs(ord(s[i]) - ord(s[i - 1])) > 2:\n return False\n return True\n\n count = 0\n for i in range(len(word) - k + 1):\n substring = word[i:i + k]\n if is_complete_substring(substring):\n count += 1\n return count", "class Solution:\n def countCompleteSubstrings(self, word: str, k: int) -> int:\n from collections import Counter\n\n n = len(word)\n count = 0\n for i in range(n):\n if k % 2 == 0 and word[i] in \"aoeui\":\n continue\n if k % 2 == 1 and word[i] not in \"aoeui\":\n continue\n j = i\n temp = word[i]\n count_temp = 1\n while j + 1 < n and abs(ord(word[j + 1]) - ord(word[j])) <= 2:\n if word[j + 1] == word[i]:\n count_temp += 1\n j += 1\n j = i\n while j - 1 >= 0 and abs(ord(word[j - 1]) - ord(word[j])) <= 2:\n if word[j - 1] == word[i]:\n count_temp += 1\n j -= 1\n if count_temp == k:\n count += 1\n return count", "class Solution:\n def countCompleteSubstrings(self, word: str, k: int) -> int:\n from collections import Counter\n\n n = len(word)\n count = 0\n for i in range(n):\n if k % 2 == 0 and word[i] in \"qwertyuiop\":\n continue\n if k % 2 == 1 and word[i] not in \"qwertyuiop\":\n continue\n for j in range(i, n, k):\n if Counter(word[i:j+1]).get(word[i], 0) != k // 2:\n break\n if all(abs(ord(a) - ord(b)) <= 2 for a, b in zip(word[i:j+1], word[i+1:j+2])):\n count += 1\n return count", "class Solution:\n def countCompleteSubstrings(self, word: str, k: int) -> int:\n def is_complete_substring(s: str) -> bool:\n char_count = {}\n for c in s:\n char_count[c] = char_count.get(c, 0) + 1\n for count in char_count.values():\n if count != k:\n return False\n return True\n\n count = 0\n for i in range(k, len(word) + 1):\n substring = word[:i]\n if is_complete_substring(substring):\n count += (i - k) // len(substring)\n return count", "class Solution:\n def countCompleteSubstrings(self, word: str, k: int) -> int:\n from collections import Counter\n\n n = len(word)\n count = 0\n for i in range(n):\n if k % 2 == 0 and word[i] in \"aoeui\":\n continue\n if k % 2 == 1 and word[i] not in \"aoeui\":\n continue\n j = i\n temp = word[i]\n count_temp = 1\n while j + 1 < n and abs(ord(word[j + 1]) - ord(word[j])) <= 2:\n if word[j + 1] == word[i]:\n count_temp += 1\n elif count_temp == k:\n break\n j += 1\n if count_temp == k:\n count += 1\n i = j\n return count", "class Solution:\n def countCompleteSubstrings(self, word: str, k: int) -> int:\n from collections import Counter\n\n count = Counter(word)\n res = 0\n for key, value in count.items():\n if value % k == 0:\n res += value // k\n else:\n return 0\n n = len(word)\n for i in range(n - 1):\n if abs(ord(word[i]) - ord(word[i + 1])) > 2:\n return 0\n return res", "class Solution:\n def countCompleteSubstrings(self, word: str, k: int) -> int:\n def is_complete_substring(s):\n letter_counts = {}\n for letter in s:\n letter_counts[letter] = letter_counts.get(letter, 0) + 1\n for count in letter_counts.values():\n if count != k:\n return False\n return True\n\n count = 0\n for i in range(k, len(word) + 1):\n if is_complete_substring(word[i - k:i]) and is_complete_substring(word[:i]):\n count += 1\n return count", "class Solution:\n def countCompleteSubstrings(self, word: str, k: int) -> int:\n from collections import Counter\n\n n = len(word)\n count = 0\n for i in range(n):\n if k % 2 == 0 and word[i] in \"qwertyuiop\":\n continue\n if k % 2 == 1 and word[i] not in \"qwertyuiop\":\n continue\n j = i\n temp = word[i]\n c = 1\n while j + 1 < n and abs(ord(word[j + 1]) - ord(word[j])) <= 2:\n if c == k:\n break\n temp += word[j + 1]\n c += 1\n j += 1\n if c == k:\n count += 1\n i = j\n return count", "class Solution:\n def countCompleteSubstrings(self, word: str, k: int) -> int:\n from collections import Counter\n\n n = len(word)\n count = 0\n for i in range(n):\n if k % 2 == 0 and word[i] != word[i + k // 2]:\n continue\n flag = True\n count_chars = Counter(word[i:i + k])\n for char in count_chars:\n if count_chars[char] != k // 2 * 2:\n flag = False\n break\n if flag:\n count += 1\n return count", "class Solution:\n def countCompleteSubstrings(self, word: str, k: int) -> int:\n def is_complete_substring(s):\n count = [0] * 26\n for c in s:\n count[ord(c) - ord('a')] += 1\n for cnt in count:\n if cnt != 0 and cnt != k:\n return False\n return True\n\n count = 0\n n = len(word)\n for i in range(n):\n for j in range(i + 1, min(i + k, n) + 1):\n if is_complete_substring(word[i:j]):\n count += 1\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberOfSequence(self, n: int, sick: List[int]) -> int:\n mod = 10**9 + 7\n sick = [0] + sick + [n]\n ans = 1\n for i in range(1, len(sick)):\n ans = (ans * (sick[i] - sick[i - 1] - 1) % mod + ans) % mod\n return ans", "class Solution:\n def numberOfSequence(self, n: int, sick: List[int]) -> int:\n mod = 10**9 + 7\n sick = [0] + sick + [n]\n ans = 1\n for i in range(1, len(sick)):\n ans = (ans * (sick[i] - sick[i - 1] - 1) ** 2) % mod\n return ans", "class Solution:\n def numberOfSequence(self, n: int, sick: List[int]) -> int:\n mod = 10**9 + 7\n sick = [0] + sick + [n]\n ans = 1\n for i in range(1, len(sick)):\n ans = (ans * (sick[i] - sick[i - 1] - 1) * 2) % mod\n return ans", "class Solution:\n def numberOfSequence(self, n: int, sick: List[int]) -> int:\n mod = 10**9 + 7\n sick_count = len(sick)\n dp = [0] * sick_count\n dp[0] = 1\n for i in range(1, sick_count):\n dp[i] = (dp[i - 1] * (i - 1) + dp[max(0, i - 2)] * (sick[i] - sick[i - 1] - 1)) % mod\n return dp[-1]", "class Solution:\n def numberOfSequence(self, n: int, sick: List[int]) -> int:\n mod = 10**9 + 7\n sick = [0] + sick + [n]\n ans = 1\n for i in range(1, len(sick)):\n ans = (ans * (sick[i] - sick[i - 1] - 1) * 2) % mod\n return ans", "class Solution:\n def numberOfSequence(self, n: int, sick: List[int]) -> int:\n MOD = 10**9 + 7\n left, right = 0, 1\n for i in range(1, len(sick)):\n diff = sick[i] - sick[i - 1] - 1\n left = (left * max(diff - 1, 0) + right) % MOD\n right = (left + right) % MOD\n return (left + right) % MOD", "class Solution:\n def numberOfSequence(self, n: int, sick: List[int]) -> int:\n mod = 10**9 + 7\n sick = [0] + sick + [n]\n ans = 1\n for i in range(1, len(sick)):\n ans = (ans * (sick[i] - sick[i - 1] - 1) * 2) % mod\n return ans", "class Solution:\n def numberOfSequence(self, n: int, sick: List[int]) -> int:\n mod = 10**9 + 7\n sick = [0] + sick + [n]\n ans = 1\n for i in range(1, len(sick)):\n ans = (ans * (sick[i] - sick[i - 1] - 1) * 2) % mod\n return ans", "class Solution:\n def numberOfSequence(self, n: int, sick: List[int]) -> int:\n MOD = 10**9 + 7\n sick_count = len(sick)\n dp = [1] * sick_count\n for i in range(1, sick_count):\n dp[i] = (dp[i - 1] * (i + 1) // i) % MOD\n for i in range(sick_count - 2, -1, -1):\n dp[i] = (dp[i] + dp[i + 1]) % MOD\n left_uninfected = [0] * sick_count\n right_uninfected = [0] * sick_count\n left_uninfected[0] = sick[0]\n right_uninfected[-1] = n - 1 - sick[-1]\n for i in range(1, sick_count):\n left_uninfected[i] = sick[i] - sick[i - 1] - 1\n right_uninfected[-i - 1] = sick[-1] - sick[i] - 1\n ans = 1\n for i in range(sick_count):\n ans = (ans * (left_uninfected[i] + 1 + right_uninfected[i]) % MOD * dp[i]) % MOD\n return ans", "class Solution:\n def numberOfSequence(self, n: int, sick: List[int]) -> int:\n MOD = 10**9 + 7\n healthy_children = n - len(sick)\n left_uninfected = [1] * n\n right_uninfected = [1] * n\n\n for idx in sick:\n if idx > 0:\n left_uninfected[idx - 1] = 0\n if idx < n - 1:\n right_uninfected[idx + 1] = 0\n\n for i in range(1, n):\n left_uninfected[i] += left_uninfected[i - 1]\n right_uninfected[n - i - 1] += right_uninfected[n - i]\n\n ans = 1\n for i in range(1, healthy_children + 1):\n ans = (ans * i) % MOD\n\n for i in range(1, n):\n if left_uninfected[i] and right_uninfected[i]:\n ans = (ans * left_uninfected[i]) % MOD\n\n return ans" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxSubarrayLength(self, nums: List[int], k: int) -> int:\n freq = {}\n max_length = 0\n left = 0\n\n for right in range(len(nums)):\n freq[nums[right]] = freq.get(nums[right], 0) + 1\n\n while freq[nums[right]] > k:\n freq[nums[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maxSubarrayLength(self, nums: List[int], k: int) -> int:\n freq = {}\n max_length = 0\n j = 0\n\n for i, num in enumerate(nums):\n freq[num] = freq.get(num, 0) + 1\n\n while freq[num] > k:\n freq[nums[j]] -= 1\n j += 1\n\n max_length = max(max_length, i - j + 1)\n\n return max_length", "class Solution:\n def maxSubarrayLength(self, nums: List[int], k: int) -> int:\n freq = {}\n max_length = 0\n left = 0\n\n for right in range(len(nums)):\n freq[nums[right]] = freq.get(nums[right], 0) + 1\n\n while freq[nums[right]] > k:\n freq[nums[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maxSubarrayLength(self, nums: List[int], k: int) -> int:\n freq = {}\n max_length = 0\n left = 0\n\n for right in range(len(nums)):\n freq[nums[right]] = freq.get(nums[right], 0) + 1\n\n while freq[nums[right]] > k:\n freq[nums[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maxSubarrayLength(self, nums: List[int], k: int) -> int:\n freq = {}\n max_length = 0\n left = 0\n\n for right in range(len(nums)):\n freq[nums[right]] = freq.get(nums[right], 0) + 1\n\n while freq[nums[right]] > k:\n freq[nums[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maxSubarrayLength(self, nums: List[int], k: int) -> int:\n freq = {}\n max_length = 0\n left = 0\n\n for right in range(len(nums)):\n freq[nums[right]] = freq.get(nums[right], 0) + 1\n\n while freq[nums[right]] > k:\n freq[nums[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maxSubarrayLength(self, nums: List[int], k: int) -> int:\n freq = {}\n max_length = 0\n left = 0\n\n for right in range(len(nums)):\n freq[nums[right]] = freq.get(nums[right], 0) + 1\n\n while freq[nums[right]] > k:\n freq[nums[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maxSubarrayLength(self, nums: List[int], k: int) -> int:\n freq = {}\n max_length = 0\n left = 0\n\n for right in range(len(nums)):\n freq[nums[right]] = freq.get(nums[right], 0) + 1\n\n while freq[nums[right]] > k:\n freq[nums[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maxSubarrayLength(self, nums: List[int], k: int) -> int:\n freq = {}\n max_length = 0\n left = 0\n\n for right in range(len(nums)):\n freq[nums[right]] = freq.get(nums[right], 0) + 1\n\n while freq[nums[right]] > k:\n freq[nums[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maxSubarrayLength(self, nums: List[int], k: int) -> int:\n freq = {}\n max_length = 0\n left = 0\n\n for right in range(len(nums)):\n freq[nums[right]] = freq.get(nums[right], 0) + 1\n\n while freq[nums[right]] > k:\n freq[nums[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberGame(self, nums: List[int]) -> List[int]:\n arr = []\n nums.sort()\n for i in range(len(nums) - 1, -1, -1):\n arr.append(nums.pop(i % 2))\n return arr", "class Solution:\n def numberGame(self, nums: List[int]) -> List[int]:\n arr = []\n nums.sort()\n for i in range(len(nums) - 1, -1, -2):\n arr.append(nums[i - 1])\n arr.append(nums[i])\n return arr", "class Solution:\n def numberGame(self, nums: List[int]) -> List[int]:\n arr = []\n nums.sort()\n for i in range(len(nums) - 1, -1, -1):\n arr.append(nums.pop(i % 2))\n return arr", "class Solution:\n def numberGame(self, nums: List[int]) -> List[int]:\n arr = []\n nums.sort()\n for i in range(len(nums) - 1, -1, -1):\n arr.append(nums.pop(i % 2))\n return arr", "class Solution:\n def numberGame(self, nums: List[int]) -> List[int]:\n arr = []\n nums.sort()\n for i in range(len(nums) - 1, -1, -1):\n arr.append(nums.pop(i % 2))\n arr.append(nums.pop((i + 1) % 2))\n return arr", "class Solution:\n def numberGame(self, nums: List[int]) -> List[int]:\n arr = []\n nums.sort()\n for i in range(len(nums) - 1, -1, -1):\n arr.append(nums.pop(i % 2))\n return arr", "class Solution:\n def numberGame(self, nums: List[int]) -> List[int]:\n arr = []\n nums.sort()\n for i in range(len(nums) - 1, -1, -1):\n arr.append(nums.pop(i % 2))\n return arr", "class Solution:\n def numberGame(self, nums: List[int]) -> List[int]:\n arr = []\n nums.sort()\n for i in range(len(nums) - 1, -1, -1):\n arr.append(nums.pop(i % 2))\n return arr", "class Solution:\n def numberGame(self, nums: List[int]) -> List[int]:\n arr = []\n nums.sort()\n for i in range(len(nums) - 1, -1, -1):\n arr.append(nums.pop(i % 2))\n return arr", "class Solution:\n def numberGame(self, nums: List[int]) -> List[int]:\n arr = []\n nums.sort()\n for i in range(len(nums) - 1, -1, -1):\n arr.append(nums.pop(i % 2))\n return arr" ], "pass1_list": [ true, false, true, true, false, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findMissingAndRepeatedValues(self, grid: List[List[int]]) -> List[int]:\n n = len(grid)\n total_sum = (n * n + 1) * (n * n + 2) // 2\n repeated = None\n missing = None\n for row in grid:\n for num in row:\n total_sum -= num\n if total_sum == 0:\n missing = num\n elif total_sum == num:\n repeated = num\n return [repeated, missing]", "class Solution:\n def findMissingAndRepeatedValues(self, grid: List[List[int]]) -> List[int]:\n n = len(grid)\n total_sum = (n * n + 1) * (n * n + 2) // 2\n repeated = None\n missing = None\n\n for row in grid:\n for num in row:\n total_sum -= num\n if total_sum == 0:\n missing = num\n break\n if missing:\n break\n\n for i in range(n):\n for j in range(n):\n if grid[i][j] == missing:\n repeated = grid[i][j]\n break\n if repeated:\n break\n\n return [repeated, missing]", "class Solution:\n def findMissingAndRepeatedValues(self, grid: List[List[int]]) -> List[int]:\n n = len(grid)\n total_sum = n * n * (n * n + 1) // 2\n repeated = None\n missing = None\n for row in grid:\n for num in row:\n total_sum -= num\n if total_sum == 0:\n missing = num\n elif total_sum == num:\n repeated = num\n return [repeated, missing]", "class Solution:\n def findMissingAndRepeatedValues(self, grid: List[List[int]]) -> List[int]:\n n = len(grid)\n total_sum = n * n * (n * n + 1) // 2\n sum_of_grid = sum(sum(row) for row in grid)\n repeated = sum(grid[i][i] for i in range(n)) - sum(grid[i][n - i - 1] for i in range(n))\n return [repeated, total_sum - sum_of_grid + repeated]", "class Solution:\n def findMissingAndRepeatedValues(self, grid: List[List[int]]) -> List[int]:\n n = len(grid)\n total_sum = n * (n + 1) * (2 * n + 1) // 3\n flat_grid = sum(sum(row) for row in grid)\n repeated = sum(max(row) for row in grid)\n missing = total_sum - flat_grid + repeated\n return [repeated, missing]", "class Solution:\n def findMissingAndRepeatedValues(self, grid: List[List[int]]) -> List[int]:\n n = len(grid)\n total_sum = n * n * (n * n + 1) // 2\n sum_of_grid = sum(sum(row) for row in grid)\n repeated = sum(row[i] * (i + 1) for i, row in enumerate(grid) for j in range(len(row))) // 2\n missing = total_sum - sum_of_grid + repeated\n repeated = (repeated - sum(grid[i][i] for i in range(n))) // 2\n return [repeated, missing]", "class Solution:\n def findMissingAndRepeatedValues(self, grid: List[List[int]]) -> List[int]:\n n = len(grid)\n total_sum = n * (n + 1) * (2 * n + 1) // 3\n sum_of_squares = n * n * (n * n + 1) * (2 * n - 1) // 6\n sum_in_grid = sum(sum(row) for row in grid)\n missing_sum = total_sum - sum_in_grid\n a_squared = sum_of_squares - sum(num ** 2 for row in grid for num in row)\n a = int((-missing_sum + (missing_sum ** 2 - 4 * a_squared) ** 0.5) ** 0.5)\n b = int((missing_sum + (missing_sum ** 2 - 4 * a_squared) ** 0.5) ** 0.5)\n return [a, b]", "class Solution:\n def findMissingAndRepeatedValues(self, grid: List[List[int]]) -> List[int]:\n n = len(grid)\n total_sum = n * n * (n * n + 1) // 2\n sum_of_grid = sum(sum(row) for row in grid)\n repeated = sum(row[i] * (i + 1) for i, row in enumerate(grid) for j in range(len(row))) // 2\n missing = total_sum - sum_of_grid + repeated\n repeated = repeated - 1 * (n - 1) - missing * n\n return [repeated, missing]", "class Solution:\n def findMissingAndRepeatedValues(self, grid: List[List[int]]) -> List[int]:\n n = len(grid)\n total_sum = n * n * (n * n + 1) // 2\n repeated = None\n missing = None\n for row in grid:\n for num in row:\n total_sum -= num\n if total_sum == 0:\n missing = num\n elif total_sum == num:\n repeated = num\n return [repeated, missing]", "class Solution:\n def findMissingAndRepeatedValues(self, grid: List[List[int]]) -> List[int]:\n n = len(grid)\n total_sum = (n * n + 1) * (n * n + 2) // 2\n repeated = None\n missing = None\n for row in grid:\n for num in row:\n total_sum -= num\n if total_sum == 0:\n missing = num\n elif total_sum == num:\n repeated = num\n return [repeated, missing]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumSetSize(self, nums1: List[int], nums2: List[int]) -> int:\n count_map = {}\n for num in nums1:\n count_map[num] = count_map.get(num, 0) + 1\n for num in nums2:\n count_map[num] = count_map.get(num, 0) + 1\n \n count_list = list(count_map.values())\n count_list.sort(reverse=True)\n \n max_set_size = 0\n for i in range(len(count_list) // 2):\n max_set_size += min(count_list[i], count_list[-i-1])\n \n return max_set_size", "class Solution:\n def maximumSetSize(self, nums1: List[int], nums2: List[int]) -> int:\n count_map = {}\n for num in nums1:\n count_map[num] = count_map.get(num, 0) + 1\n for num in nums2:\n count_map[num] = count_map.get(num, 0) + 1\n \n max_set_size = 0\n for count in count_map.values():\n max_set_size = max(max_set_size, min(count, count - count % 2))\n \n return max_set_size", "class Solution:\n def maximumSetSize(self, nums1: List[int], nums2: List[int]) -> int:\n count_map = {}\n for num in nums1:\n count_map[num] = count_map.get(num, 0) + 1\n for num in nums2:\n count_map[num] = count_map.get(num, 0) + 1\n\n max_set_size = 0\n for count in count_map.values():\n max_set_size = max(max_set_size, min(count, nums1.count(count_map.get(count))), min(count, nums2.count(count_map.get(count))))\n\n return max_set_size", "class Solution:\n def maximumSetSize(self, nums1: List[int], nums2: List[int]) -> int:\n count_map = {}\n for num in nums1:\n count_map[num] = count_map.get(num, 0) + 1\n for num in nums2:\n count_map[num] = count_map.get(num, 0) + 1\n\n max_set_size = 0\n for count in count_map.values():\n max_set_size = max(max_set_size, min(count, nums1.count(count_map.get(count, 0)) // 2), nums2.count(count_map.get(count, 0)) // 2)\n\n return max_set_size", "class Solution:\n def maximumSetSize(self, nums1: List[int], nums2: List[int]) -> int:\n count_map1 = {}\n count_map2 = {}\n for num in nums1:\n count_map1[num] = count_map1.get(num, 0) + 1\n for num in nums2:\n count_map2[num] = count_map2.get(num, 0) + 1\n\n max_set_size = 0\n for num in count_map1.keys() | count_map2.keys():\n count1 = count_map1.get(num, 0)\n count2 = count_map2.get(num, 0)\n max_set_size = max(max_set_size, min(count1, count2) // 2 * 4 + abs(count1 - count2))\n\n return max_set_size", "class Solution:\n def maximumSetSize(self, nums1: List[int], nums2: List[int]) -> int:\n count_map = {}\n for num in nums1:\n count_map[num] = count_map.get(num, 0) + 1\n for num in nums2:\n count_map[num] = count_map.get(num, 0) + 1\n \n count_list = list(count_map.values())\n count_list.sort(reverse=True)\n return sum(min(count, 2) for count in count_list)", "class Solution:\n def maximumSetSize(self, nums1: List[int], nums2: List[int]) -> int:\n count_map = {}\n for num in nums1:\n count_map[num] = count_map.get(num, 0) + 1\n for num in nums2:\n count_map[num] = count_map.get(num, 0) + 1\n \n count_list = list(count_map.values())\n count_list.sort(reverse=True)\n \n max_set_size = 0\n for i in range(len(count_list) // 2):\n max_set_size += min(count_list[i], count_list[-i-1])\n \n return max_set_size", "class Solution:\n def maximumSetSize(self, nums1: List[int], nums2: List[int]) -> int:\n count_map = {}\n for num in nums1:\n count_map[num] = count_map.get(num, 0) + 1\n for num in nums2:\n count_map[num] = count_map.get(num, 0) + 1\n\n max_set_size = 0\n for count in count_map.values():\n max_set_size = max(max_set_size, min(count, count - count % 2))\n\n return max_set_size", "class Solution:\n def maximumSetSize(self, nums1: List[int], nums2: List[int]) -> int:\n count_map = {}\n for num in nums1:\n count_map[num] = count_map.get(num, 0) + 1\n for num in nums2:\n count_map[num] = count_map.get(num, 0) + 1\n \n count_list = list(count_map.values())\n count_list.sort(reverse=True)\n \n max_set_size = 0\n for i in range(len(count_list) // 2):\n max_set_size += min(count_list[i], count_list[-i-1])\n \n return max_set_size", "class Solution:\n def maximumSetSize(self, nums1: List[int], nums2: List[int]) -> int:\n count_map1 = {}\n count_map2 = {}\n for num in nums1:\n count_map1[num] = count_map1.get(num, 0) + 1\n for num in nums2:\n count_map2[num] = count_map2.get(num, 0) + 1\n \n common_elements = set(count_map1.keys()) & set(count_map2.keys())\n \n max_set_size = 0\n for element in common_elements:\n count1 = min(count_map1[element], len(nums1) // 2)\n count2 = min(count_map2[element], len(nums2) // 2)\n max_set_size = max(max_set_size, count1 + count2)\n \n return max_set_size" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n def is_palindrome(n):\n return str(n) == str(n)[::-1]\n\n total_cost = 0\n n = len(nums)\n\n # Find the minimum and maximum values in the array\n min_val = min(nums)\n max_val = max(nums)\n\n # Generate a list of palindromic numbers in the range [min_val, max_val]\n palindromes = [num for num in range(min_val, max_val + 1) if is_palindrome(num)]\n\n # If there are no palindromic numbers in the range, return -1\n if not palindromes:\n return -1\n\n # Initialize the cost for each palindromic number to be the sum of absolute differences\n costs = [sum(abs(num - p) for num in nums) for p in palindromes]\n\n # Return the minimum cost\n return min(costs)", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n def is_palindrome(n):\n return str(n) == str(n)[::-1]\n\n cost = 0\n for num in set(nums):\n if is_palindrome(num):\n temp_cost = 0\n for n in nums:\n temp_cost += abs(n - num)\n cost = min(cost, temp_cost)\n\n return cost", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n def is_palindrome(n):\n return str(n) == str(n)[::-1]\n\n cost = 0\n for num in set(nums):\n if is_palindrome(num):\n diff = [abs(num - x) for x in nums]\n cost += sum(diff)\n break\n\n return cost", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n def is_palindrome(n):\n return str(n) == str(n)[::-1]\n\n cost = 0\n for num in set(nums):\n if is_palindrome(num):\n diff = [abs(num - x) for x in nums]\n cost += sum(diff)\n break\n\n return cost", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n def is_palindrome(n):\n return str(n) == str(n)[::-1]\n\n total_cost = 0\n min_num = min(nums)\n max_num = max(nums)\n\n palindromic_nums = [num for num in range(min_num, max_num + 1) if is_palindrome(num)]\n\n if not palindromic_nums:\n return sum(nums)\n\n min_cost = float(\"inf\")\n for pal_num in palindromic_nums:\n cost = 0\n for num in nums:\n cost += abs(num - pal_num)\n min_cost = min(min_cost, cost)\n\n return min_cost", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n def is_palindrome(n):\n return str(n) == str(n)[::-1]\n\n total_cost = 0\n n = len(nums)\n\n # Find the closest palindromic number less than 10^9\n left, right = 1, int(1e9)\n while left < right:\n mid = left + (right - left) // 2\n if is_palindrome(mid):\n palindrome = mid\n break\n if is_palindrome(left):\n palindrome = left\n break\n if is_palindrome(right):\n palindrome = right\n break\n if mid % 10 * 10 + (mid % 10 + 1) < int(1e9):\n right = mid % 10 * 10 + (mid % 10 + 1)\n else:\n left = mid + 1\n\n # Calculate the total cost to change all elements to the found palindrome\n for num in nums:\n total_cost += abs(num - palindrome)\n\n return total_cost", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n def is_palindrome(n):\n return str(n) == str(n)[::-1]\n\n cost = 0\n min_val = min(nums)\n max_val = max(nums)\n palindromes = set(i for i in range(min_val, max_val+1) if is_palindrome(i))\n\n for pal in palindromes:\n temp_cost = 0\n for num in nums:\n temp_cost += abs(num - pal)\n cost = min(cost, temp_cost)\n\n return cost", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n def is_palindrome(n):\n return str(n) == str(n)[::-1]\n\n total_cost = 0\n min_palindrome = 10**9\n max_palindrome = 0\n\n for num in nums:\n min_palindrome = min(min_palindrome, num)\n max_palindrome = max(max_palindrome, num)\n\n while not is_palindrome(min_palindrome):\n min_palindrome += 1\n while not is_palindrome(max_palindrome):\n max_palindrome -= 1\n\n for num in nums:\n total_cost += abs(num - min_palindrome)\n\n return total_cost", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n def is_palindrome(n):\n return str(n) == str(n)[::-1]\n\n cost = 0\n for num in set(nums):\n if is_palindrome(num):\n diff = [abs(num - x) for x in nums]\n cost += sum(diff)\n break\n\n return cost", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n def is_palindrome(n):\n return str(n) == str(n)[::-1]\n\n cost = 0\n for num in set(nums):\n if is_palindrome(num):\n temp_cost = 0\n for n in nums:\n temp_cost += abs(n - num)\n cost = min(cost, temp_cost)\n\n return cost" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def removeAlmostEqualCharacters(self, word: str) -> int:\n from collections import deque\n\n alphabet = \"abcdefghijklmnopqrstuvwxyz\"\n adjacent = {letter: alphabet[i - 1] + alphabet[i + 1] for i, letter in enumerate(alphabet)}\n operations = 0\n d = deque()\n\n for letter in word:\n while d and d[-1] in adjacent[letter]:\n d.pop()\n operations += 1\n d.append(letter)\n\n return operations + len(d) - 1", "class Solution:\n def removeAlmostEqualCharacters(self, word: str) -> int:\n from collections import deque\n\n alphabet = \"abcdefghijklmnopqrstuvwxyz\"\n adjacent = {letter: alphabet[i - 1] + alphabet[i + 1] for i, letter in enumerate(alphabet)}\n\n def is_almost_equal(a, b):\n return a == b or b in adjacent[a]\n\n q = deque()\n visited = set()\n operations = 0\n\n for letter in word:\n if letter not in visited:\n while q and is_almost_equal(q[-1], letter):\n visited.remove(q.pop())\n operations += 1\n q.append(letter)\n visited.add(letter)\n\n return operations", "class Solution:\n def removeAlmostEqualCharacters(self, word: str) -> int:\n from collections import deque\n\n alphabet = \"abcdefghijklmnopqrstuvwxyz\"\n adj = {letter: [alphabet[i - 1], alphabet[i + 1]] for i, letter in enumerate(alphabet)}\n\n def is_almost_equal(a, b):\n return a == b or b in adj[a]\n\n operations = 0\n dq = deque()\n visited = set()\n\n for letter in word:\n if letter not in visited:\n while dq and is_almost_equal(dq[-1], letter):\n dq.pop()\n operations += 1\n dq.append(letter)\n visited.add(letter)\n\n return operations", "class Solution:\n def removeAlmostEqualCharacters(self, word: str) -> int:\n from collections import deque\n\n alphabet = \"abcdefghijklmnopqrstuvwxyz\"\n adjacent = {c: [c] + [alphabet[i] for i in range(26) if abs(ord(c) - ord(alphabet[i])) == 1] for c in alphabet}\n cnt = [0] * 26\n operations = 0\n\n for c in word:\n cnt[ord(c) - ord('a')] += 1\n\n for i in range(26):\n if cnt[i] > 1:\n operations += cnt[i] - 1\n cnt[i] = 1\n\n for c in word:\n for adj in adjacent[c]:\n if cnt[ord(adj) - ord('a')] > 0:\n cnt[ord(adj) - ord('a')] -= 1\n break\n\n return operations", "class Solution:\n def removeAlmostEqualCharacters(self, word: str) -> int:\n from collections import Counter\n\n count = Counter(word)\n max_freq = max(count.values())\n return len(word) - max_freq", "class Solution:\n def removeAlmostEqualCharacters(self, word: str) -> int:\n from collections import deque\n\n adj = [[] for _ in range(26)]\n for i in range(26):\n for j in range(26):\n if i == j or abs(i - j) == 1:\n adj[i].append(j)\n\n seen = [False] * 26\n q = deque()\n for c in word:\n i = ord(c) - ord('a')\n if not seen[i]:\n seen[i] = True\n q.append(i)\n\n res = 0\n while q:\n cur = q.popleft()\n for next in adj[cur]:\n seen[next] = False\n q.append(next)\n res += 1\n\n return len(word) - res", "class Solution:\n def removeAlmostEqualCharacters(self, word: str) -> int:\n from collections import deque\n\n alphabet = \"abcdefghijklmnopqrstuvwxyz\"\n adjacent = {ch: alphabet[i - 1] + alphabet[i + 1] for i, ch in enumerate(alphabet)}\n\n def is_almost_equal(a, b):\n return a == b or b in adjacent[a]\n\n q = deque()\n visited = [False] * len(word)\n operations = 0\n\n for i, ch in enumerate(word):\n if not visited[i]:\n j = i\n while j < len(word) and is_almost_equal(ch, word[j]):\n visited[j] = True\n j += 1\n if len(q) > 0 and is_almost_equal(q[-1], ch):\n operations += 1\n else:\n q.append(ch)\n\n return len(word) - len(q) - operations", "class Solution:\n def removeAlmostEqualCharacters(self, word: str) -> int:\n from collections import Counter\n\n letter_counts = Counter(word)\n max_letters = len(letter_counts)\n\n def is_adjacent(char1, char2):\n return abs(ord(char1) - ord(char2)) == 1\n\n def backtrack(index, count, prev_char):\n if count >= max_letters:\n return\n\n if index == len(word):\n return backtrack(index=0, count=count + 1, prev_char=None)\n\n for char in \"abcdefghijklmnopqrstuvwxyz\":\n if letter_counts[char] > 0 and (char != prev_char and not is_adjacent(char, prev_char)):\n letter_counts[char] -= 1\n backtrack(index + 1, count, char)\n letter_counts[char] += 1\n\n backtrack(index=0, count=0, prev_char=None)\n return max_letters - letter_counts[prev_char]", "class Solution:\n def removeAlmostEqualCharacters(self, word: str) -> int:\n from collections import Counter\n\n count = Counter(word)\n max_freq = max(count.values())\n return len(word) - max_freq", "class Solution:\n def removeAlmostEqualCharacters(self, word: str) -> int:\n from collections import deque\n\n alphabet = [chr(i) for i in range(ord('a'), ord('z') + 1)]\n adj_chars = {char: [alphabet[i - 1], alphabet[i + 1]] for i, char in enumerate(alphabet)}\n\n char_counts = [0] * 26\n for char in word:\n char_counts[ord(char) - ord('a')] += 1\n\n q = deque()\n for i, count in enumerate(char_counts):\n if count > 0:\n q.append(i)\n\n operations = 0\n while q:\n char = chr(ord('a') + q.popleft())\n if not char_counts[ord(char) - ord('a')]:\n continue\n char_counts[ord(char) - ord('a')] -= 1\n\n for adj_char in adj_chars[char]:\n if char_counts[ord(adj_char) - ord('a')] > 0:\n char_counts[ord(adj_char) - ord('a')] -= 1\n q.append(ord(adj_char) - ord('a'))\n operations += 1\n\n return operations" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumAddedCoins(self, coins: List[int], target: int) -> int:\n dp = [1] * (target + 1)\n dp[0] = 0\n for coin in coins:\n for i in range(coin, target + 1):\n dp[i] = 1\n for i in range(1, target + 1):\n if dp[i] == 0:\n dp[i] = 1\n for coin in coins:\n if coin <= i and dp[i - coin] == 1:\n dp[i] = 0\n break\n res = 0\n for i in range(1, target + 1):\n if dp[i] == 0:\n res += 1\n dp[i] = 1\n for coin in coins:\n if coin <= i and dp[i - coin] == 1:\n dp[i] = 0\n break\n return res", "class Solution:\n def minimumAddedCoins(self, coins: List[int], target: int) -> int:\n dp = [1e9] * (target + 1)\n dp[0] = 0\n\n for coin in coins:\n dp[coin] = 1\n\n for i in range(1, target + 1):\n if dp[i] == 1e9:\n dp[i] = 1e9 - 1\n for j in range(1, target // i + 1):\n dp[i] = min(dp[i], dp[i - j * i] + 1)\n\n res = 0\n for i in range(1, target + 1):\n res += dp[i]\n\n return res", "class Solution:\n def minimumAddedCoins(self, coins: List[int], target: int) -> int:\n coins.sort()\n dp = [1e9] * (target + 1)\n dp[0] = 0\n\n for coin in coins:\n for i in range(coin, target + 1):\n dp[i] = min(dp[i], dp[i - coin] + 1)\n\n ans = 0\n for i in range(1, target + 1):\n ans += dp[i]\n\n return ans - target", "class Solution:\n def minimumAddedCoins(self, coins: List[int], target: int) -> int:\n dp = [1] + [0] * target\n for coin in coins:\n for i in range(coin, target + 1):\n dp[i] = 1\n return target - sum(dp)", "class Solution:\n def minimumAddedCoins(self, coins: List[int], target: int) -> int:\n dp = [1] + [0] * target\n for coin in coins:\n for i in range(coin, target + 1):\n dp[i] = 1\n return target - sum(dp)", "class Solution:\n def minimumAddedCoins(self, coins: List[int], target: int) -> int:\n dp = [1] + [0] * target\n for coin in coins:\n for i in range(coin, target + 1):\n dp[i] = 1\n return target - sum(dp)", "class Solution:\n def minimumAddedCoins(self, coins: List[int], target: int) -> int:\n dp = [1] + [0] * target\n for coin in coins:\n for i in range(coin, target + 1):\n dp[i] = 1\n return target - sum(dp)", "class Solution:\n def minimumAddedCoins(self, coins: List[int], target: int) -> int:\n dp = [1] * (target + 1)\n dp[0] = 0\n for coin in coins:\n for i in range(coin, target + 1):\n dp[i] = 1\n for i in range(1, target + 1):\n if dp[i] == 0:\n dp[i] = 1\n for coin in coins:\n if coin <= i and dp[i - coin] == 1:\n dp[i] = 0\n break\n ans = 0\n for i in range(1, target + 1):\n if dp[i] == 0:\n ans += 1\n dp[i] = 1\n return ans", "class Solution:\n def minimumAddedCoins(self, coins: List[int], target: int) -> int:\n dp = [1] * (target + 1)\n dp[0] = 0\n for coin in coins:\n for i in range(coin, target + 1):\n dp[i] = 1\n for i in range(1, target + 1):\n if dp[i] == 0:\n dp[i] = 1\n for coin in coins:\n if coin <= i and dp[i - coin] == 1:\n dp[i] = 0\n break\n ans = 0\n for i in range(1, target + 1):\n if dp[i] == 0:\n ans += 1\n dp[i] = 1\n return ans", "class Solution:\n def minimumAddedCoins(self, coins: List[int], target: int) -> int:\n dp = [1] + [0] * target\n for coin in coins:\n for i in range(coin, target + 1):\n dp[i] = 1\n return target - sum(dp) + 1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxPartitionsAfterOperations(self, s: str, k: int) -> int:\n def count_distinct(s):\n return len(set(s))\n\n def max_partitions(s):\n prefix = \"\"\n partitions = 0\n while s:\n prefix = s[: prefix.rfind(s[0]) + 1] if prefix and prefix[-1] != s[0] else prefix + s[0]\n partitions += 1\n s = s[len(prefix):]\n return partitions\n\n best = max_partitions(s)\n for i, c in enumerate(s):\n for new_c in range(ord('a'), ord('z') + 1):\n if chr(new_c) not in s or i == ord(chr(new_c)) - ord('a'):\n continue\n new_s = list(s)\n new_s[i] = chr(new_c)\n new_s = \"\".join(new_s)\n if count_distinct(new_s[:i + 1]) <= k:\n best = max(best, max_partitions(new_s))\n return best", "class Solution:\n def maxPartitionsAfterOperations(self, s: str, k: int) -> int:\n def check(s, k):\n count = {}\n for c in s:\n count[c] = count.get(c, 0) + 1\n if len(count) > k:\n break\n else:\n return True\n return False\n\n n = len(s)\n ans = 1\n\n for i in range(n):\n for j in range(97, 123):\n new_s = list(s)\n new_s[i] = chr(j)\n new_s = ''.join(new_s)\n if check(new_s, k):\n ans = max(ans, n - i + 1)\n break\n\n return ans", "class Solution:\n def maxPartitionsAfterOperations(self, s: str, k: int) -> int:\n def check(s, k):\n count = {}\n for c in s:\n count[c] = count.get(c, 0) + 1\n if len(count) > k:\n break\n else:\n return True\n return False\n\n n = len(s)\n ans = 1\n for i in range(n):\n for j in range(97, 123):\n new_s = list(s)\n new_s[i] = chr(j)\n new_s = ''.join(new_s)\n if check(new_s, k):\n ans = max(ans, n - i + 1)\n break\n return ans", "class Solution:\n def maxPartitionsAfterOperations(self, s: str, k: int) -> int:\n def check(s, k):\n seen = set()\n for c in s:\n if len(seen) == k:\n break\n if c not in seen:\n seen.add(c)\n return len(seen) <= k\n\n n = len(s)\n ans = 1\n for i in range(n):\n for j in range(97, 123):\n new_s = list(s)\n new_s[i] = chr(j)\n new_s = \"\".join(new_s)\n if check(new_s, k):\n ans = max(ans, n - i - check(new_s[i + 1:], k) + 1)\n return ans", "class Solution:\n def maxPartitionsAfterOperations(self, s: str, k: int) -> int:\n n = len(s)\n if n <= k:\n return 1\n\n def check(s, k):\n seen = set()\n for c in s:\n seen.add(c)\n if len(seen) > k:\n return False\n return True\n\n ans = 1\n for i in range(n):\n for j in range(97, 123):\n new_s = list(s)\n new_s[i] = chr(j)\n new_s = ''.join(new_s)\n if check(new_s[:i+1], k) and check(new_s[i+1:], k):\n ans = max(ans, 2 + self.maxPartitionsAfterOperations(new_s[i+1:], k))\n\n return ans", "class Solution:\n def maxPartitionsAfterOperations(self, s: str, k: int) -> int:\n def count_partitions(s: str, k: int) -> int:\n unique_chars = set()\n prefix_length = 0\n for c in s:\n if len(unique_chars) < k:\n unique_chars.add(c)\n prefix_length += 1\n else:\n break\n return prefix_length\n\n n = len(s)\n ans = count_partitions(s, k)\n for i in range(n):\n for j in range(ord('a'), ord('z') + 1):\n new_s = s[:i] + chr(j) + s[i + 1:]\n ans = max(ans, count_partitions(new_s, k) + count_partitions(new_s[count_partitions(new_s, k):], k))\n\n return ans // (k + 1) + 1", "class Solution:\n def maxPartitionsAfterOperations(self, s: str, k: int) -> int:\n def count_distinct(s):\n return len(set(s))\n\n def max_partitions(s):\n prefix = \"\"\n partitions = 0\n while s:\n prefix = s\n for i in range(1, len(s) + 1):\n if count_distinct(prefix[:i]) <= k:\n prefix = prefix[:i]\n s = s[len(prefix):]\n partitions += 1\n return partitions\n\n best = max_partitions(s)\n for i in range(len(s)):\n for j in range(ord('a'), ord('z') + 1):\n new_s = s[:i] + chr(j) + s[i + 1:]\n best = max(best, max_partitions(new_s))\n return best", "class Solution:\n def maxPartitionsAfterOperations(self, s: str, k: int) -> int:\n def check(s, k):\n seen = set()\n for c in s:\n if len(seen) == k:\n break\n seen.add(c)\n return len(seen) <= k\n\n n = len(s)\n ans = 1\n for i in range(n):\n for j in range(ord('a'), ord('z') + 1):\n news = s[:i] + chr(j) + s[i + 1:]\n if check(news, k):\n ans = max(ans, len(news) - len(news.replace('', '')))\n return ans", "class Solution:\n def maxPartitionsAfterOperations(self, s: str, k: int) -> int:\n def check(s, k):\n count = {}\n for c in s:\n count[c] = count.get(c, 0) + 1\n if len(count) > k:\n break\n else:\n return True\n return False\n\n n = len(s)\n ans = 1\n for i in range(n):\n for j in range(97, 123):\n new_s = list(s)\n new_s[i] = chr(j)\n new_s = ''.join(new_s)\n if check(new_s, k):\n ans = max(ans, len(new_s) - len(new_s.lstrip('abcdefghijklmnopqrstuvwxyz'[:k])) + 1)\n return ans", "class Solution:\n def maxPartitionsAfterOperations(self, s: str, k: int) -> int:\n def count_partitions(s: str, k: int) -> int:\n unique_chars = set()\n partitions = 0\n for c in s:\n if len(unique_chars) == k:\n partitions += 1\n unique_chars = set()\n unique_chars.add(c)\n return partitions + 1\n\n n = len(s)\n ans = count_partitions(s, k)\n\n for i in range(n):\n for j in range(ord('a'), ord('z') + 1):\n new_s = s[:i] + chr(j) + s[i + 1:]\n ans = max(ans, count_partitions(new_s, k))\n\n return ans" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def getGoodIndices(self, variables: List[List[int]], target: int) -> List[int]:\n good_indices = []\n for i in range(len(variables)):\n a, b, c, m = variables[i]\n if pow((a ** b % 10), c, m) == target:\n good_indices.append(i)\n return good_indices", "class Solution:\n def getGoodIndices(self, variables: List[List[int]], target: int) -> List[int]:\n good_indices = []\n for i in range(len(variables)):\n a, b, c, m = variables[i]\n if pow((a ** b % 10), c, m) == target:\n good_indices.append(i)\n return good_indices", "class Solution:\n def getGoodIndices(self, variables: List[List[int]], target: int) -> List[int]:\n good_indices = []\n for i, [a, b, c, m] in enumerate(variables):\n temp = (a ** b % 10) ** c % m\n if temp == target:\n good_indices.append(i)\n return good_indices", "class Solution:\n def getGoodIndices(self, variables: List[List[int]], target: int) -> List[int]:\n good_indices = []\n for i, [a, b, c, m] in enumerate(variables):\n temp = (a ** b % 10) ** c % m\n if temp == target:\n good_indices.append(i)\n return good_indices", "class Solution:\n def getGoodIndices(self, variables: List[List[int]], target: int) -> List[int]:\n good_indices = []\n for i in range(len(variables)):\n a, b, c, m = variables[i]\n if pow((a ** b) % 10, c) % m == target:\n good_indices.append(i)\n return good_indices", "class Solution:\n def getGoodIndices(self, variables: List[List[int]], target: int) -> List[int]:\n good_indices = []\n for i in range(len(variables)):\n a, b, c, m = variables[i]\n if pow((a ** b) % 10, c) % m == target:\n good_indices.append(i)\n return good_indices", "class Solution:\n def getGoodIndices(self, variables: List[List[int]], target: int) -> List[int]:\n good_indices = []\n for i, [a, b, c, m] in enumerate(variables):\n temp = (a ** b % 10) ** c % m\n if temp == target:\n good_indices.append(i)\n return good_indices", "class Solution:\n def getGoodIndices(self, variables: List[List[int]], target: int) -> List[int]:\n good_indices = []\n for i in range(len(variables)):\n a, b, c, m = variables[i]\n if pow((a ** b) % 10, c) % m == target:\n good_indices.append(i)\n return good_indices", "class Solution:\n def getGoodIndices(self, variables: List[List[int]], target: int) -> List[int]:\n good_indices = []\n for i in range(len(variables)):\n a, b, c, m = variables[i]\n if pow((a ** b % 10), c, m) == target:\n good_indices.append(i)\n return good_indices", "class Solution:\n def getGoodIndices(self, variables: List[List[int]], target: int) -> List[int]:\n good_indices = []\n for i, [a, b, c, m] in enumerate(variables):\n temp = (a ** b % 10) ** c % m\n if temp == target:\n good_indices.append(i)\n return good_indices" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumCost(self, source: str, target: str, original: list[str], changed: list[str], cost: list[int]) -> int:\n memo = {}\n for i in range(len(original)):\n key = (original[i], changed[i])\n if key not in memo:\n memo[key] = cost[i]\n\n dp = [float('inf')] * (len(source) + 1)\n dp[0] = 0\n\n for i in range(len(source)):\n for j in range(i, -1, -1):\n if source[j] != target[j]:\n dp_tmp = dp[j] + memo.get((target[j], source[j]), float('inf'))\n dp[j + 1] = min(dp[j + 1], dp_tmp)\n\n return -1 if dp[-1] == float('inf') else dp[-1]", "class Solution:\n def minimumCost(self, source: str, target: str, original: List[str], changed: List[str], cost: List[int]) -> int:\n operations = {}\n for i in range(len(original)):\n if cost[i] not in operations or operations[cost[i]][0] == original[i] and operations[cost[i]][1] == changed[i]:\n operations[cost[i]] = (original[i], changed[i])\n\n memo = {}\n def dfs(index, current_cost):\n if index == len(source):\n return 0 if current_cost == 0 else -1\n if (index, current_cost) in memo:\n return memo[(index, current_cost)]\n\n result = -1\n for op_cost, (op_original, op_changed) in operations.items():\n if source[index] == op_original and target[index] == op_changed:\n temp_cost = op_cost + current_cost\n res = dfs(index + 1, temp_cost)\n if res != -1:\n result = max(result, res)\n elif source[index] == op_original:\n temp_cost = op_cost + current_cost\n res = dfs(index, temp_cost)\n if res != -1:\n result = max(result, res)\n\n memo[(index, current_cost)] = result\n return result\n\n return dfs(0, 0)", "class Solution:\n def minimumCost(self, source: str, target: str, original: List[str], changed: List[str], cost: List[int]) -> int:\n mapping = {}\n for i in range(len(original)):\n if original[i] not in mapping:\n mapping[original[i]] = {}\n if changed[i] not in mapping[original[i]]:\n mapping[original[i]][changed[i]] = cost[i]\n\n dp = [float('inf')] * (len(source) + 1)\n dp[0] = 0\n\n for i in range(len(source)):\n for j in range(i, -1, -1):\n if target[j] in mapping[source[j]]:\n dp[j + 1] = min(dp[j + 1], dp[j] + mapping[source[j]][target[j]])\n\n return -1 if dp[-1] == float('inf') else dp[-1]", "class Solution:\n def minimumCost(self, source: str, target: str, original: List[str], changed: List[str], cost: List[int]) -> int:\n memo = {}\n for i in range(len(original)):\n key = (original[i], changed[i])\n if key not in memo:\n memo[key] = cost[i]\n\n dp = [float('inf')] * (len(source) + 1)\n dp[0] = 0\n\n for i in range(len(source)):\n for j in range(i, -1, -1):\n if source[j] != target[j]:\n dp_cost = float('inf')\n for k in range(len(original)):\n if original[k] == source[j] and changed[k] == target[j]:\n dp_cost = min(dp_cost, memo[key])\n\n dp[j + 1] = min(dp[j + 1], dp[j] + dp_cost)\n\n return -1 if dp[-1] == float('inf') else dp[-1]", "class Solution:\n def minimumCost(self, source: str, target: str, original: list[str], changed: list[str], cost: list[int]) -> int:\n cost_map = {}\n for i in range(len(original)):\n if (original[i], changed[i]) not in cost_map:\n cost_map[(original[i], changed[i])] = cost[i]\n\n dp = [float('inf')] * (len(source) + 1)\n dp[0] = 0\n\n for i in range(len(source)):\n for j in range(i, -1, -1):\n if source[j] != target[j]:\n dp[j + 1] = min(dp[j + 1], dp[j] + cost_map.get((target[j], source[j]), float('inf')))\n\n return dp[len(source)] if dp[len(source)] != float('inf') else -1", "class Solution:\n def minimumCost(self, source: str, target: str, original: List[str], changed: List[str], cost: List[int]) -> int:\n graph = {}\n for i in range(len(original)):\n if original[i] not in graph:\n graph[original[i]] = {}\n if changed[i] not in graph[original[i]]:\n graph[original[i]][changed[i]] = cost[i]\n\n memo = {}\n\n def dfs(node, target):\n if node == target:\n return 0\n if node not in memo:\n memo[node] = float(\"inf\")\n for neighbor, weight in graph[node].items():\n res = dfs(neighbor, target)\n if res != float(\"inf\"):\n memo[node] = min(memo[node], res + weight)\n memo[node] = -1 if memo[node] == float(\"inf\") else memo[node]\n return memo[node]\n\n res = 0\n for i in range(len(source)):\n temp_res = dfs(source[i], target[i])\n if temp_res == -1:\n return -1\n res += temp_res\n return res", "class Solution:\n def minimumCost(self, source: str, target: str, original: List[str], changed: List[str], cost: List[int]) -> int:\n graph = {}\n for i in range(len(original)):\n if changed[i] not in graph:\n graph[changed[i]] = {}\n if original[i] not in graph[changed[i]]:\n graph[changed[i]][original[i]] = cost[i]\n\n dp = [float('inf')] * (len(source) + 1)\n dp[0] = 0\n\n for i in range(len(source)):\n for j in range(i, -1, -1):\n if source[j] != target[j]:\n if target[j] in graph:\n for k in graph[target[j]]:\n dp[j + 1] = min(dp[j + 1], dp[j] + graph[target[j]][k])\n else:\n dp[j + 1] = float('inf')\n else:\n dp[j + 1] = dp[j]\n\n return -1 if dp[-1] == float('inf') else dp[-1]", "class Solution:\n def minimumCost(self, source: str, target: str, original: List[str], changed: List[str], cost: List[int]) -> int:\n mapping = {}\n for i in range(len(original)):\n if (original[i], changed[i]) in mapping:\n mapping[(original[i], changed[i])].append(cost[i])\n else:\n mapping[(original[i], changed[i])] = [cost[i]]\n\n dp = [float('inf')] * (len(source) + 1)\n dp[0] = 0\n\n for i in range(len(source)):\n for j in range(i, -1, -1):\n if source[j] != target[j]:\n if (target[j], source[j]) in mapping:\n for c in mapping[(target[j], source[j])]:\n dp[j + 1] = min(dp[j + 1], dp[j] + c)\n else:\n return -1\n else:\n dp[j + 1] = dp[j]\n\n return dp[len(source)]", "class Solution:\n def minimumCost(self, source: str, target: str, original: List[str], changed: List[str], cost: List[int]) -> int:\n memo = {}\n for i in range(len(original)):\n if original[i] not in memo:\n memo[original[i]] = {}\n if changed[i] not in memo[original[i]]:\n memo[original[i]][changed[i]] = cost[i]\n\n dp = [float('inf')] * (len(source) + 1)\n dp[0] = 0\n\n for i in range(len(source)):\n for j in range(i, -1, -1):\n if source[j] != target[j]:\n if target[j] not in memo[source[j]]:\n dp[j + 1] = float('inf')\n continue\n dp[j + 1] = min(dp[j + 1], dp[j] + memo[source[j]][target[j]])\n\n return -1 if dp[-1] == float('inf') else dp[-1]", "class Solution:\n def minimumCost(self, source: str, target: str, original: List[str], changed: List[str], cost: List[int]) -> int:\n mapping = {}\n for i in range(len(original)):\n if (original[i], changed[i]) not in mapping:\n mapping[(original[i], changed[i])] = cost[i]\n\n dp = [float('inf')] * (len(source) + 1)\n dp[0] = 0\n\n for i in range(len(source)):\n for j in range(i, -1, -1):\n if source[j] != target[j]:\n if (target[j], source[j]) in mapping:\n dp[i + 1] = min(dp[i + 1], dp[j] + mapping[(target[j], source[j])])\n else:\n dp[i + 1] = min(dp[i + 1], dp[j])\n\n return -1 if dp[-1] == float('inf') else dp[-1]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def missingInteger(self, nums: List[int]) -> int:\n nums.sort()\n longest_prefix_sum = 0\n i = 0\n while i < len(nums) - 1:\n if nums[i] + 1 == nums[i + 1]:\n longest_prefix_sum += nums[i]\n i += 1\n else:\n i += 2\n longest_prefix_sum += nums[i]\n\n x = longest_prefix_sum + 1\n while x in nums:\n x += 1\n\n return x", "class Solution:\n def missingInteger(self, nums: List[int]) -> int:\n nums.sort()\n longest_prefix_sum = nums[0]\n current_sum = nums[0]\n\n for i in range(1, len(nums)):\n if nums[i] == nums[i - 1] + 1:\n current_sum += nums[i]\n else:\n if current_sum > longest_prefix_sum:\n longest_prefix_sum = current_sum\n current_sum = nums[i]\n\n if current_sum > longest_prefix_sum:\n longest_prefix_sum = current_sum\n\n for i in range(longest_prefix_sum + 1, 51):\n if i not in nums:\n return i", "class Solution:\n def missingInteger(self, nums: List[int]) -> int:\n nums.sort()\n longest_prefix_sum = 0\n i = 0\n while i < len(nums) - 1:\n if nums[i] + 1 == nums[i + 1]:\n longest_prefix_sum += nums[i]\n i += 1\n else:\n i += 1\n if longest_prefix_sum + 1 == nums[i]:\n longest_prefix_sum += 1\n i += 1\n else:\n break\n return longest_prefix_sum + 1", "class Solution:\n def missingInteger(self, nums: List[int]) -> int:\n nums.sort()\n longest_prefix_sum = 0\n i = 0\n while i < len(nums) - 1:\n if nums[i] + 1 == nums[i + 1]:\n longest_prefix_sum += nums[i]\n i += 1\n else:\n i += 1\n if longest_prefix_sum + 1 == nums[i]:\n longest_prefix_sum += 1\n i += 1\n else:\n break\n return longest_prefix_sum + 1", "class Solution:\n def missingInteger(self, nums: List[int]) -> int:\n nums.sort()\n longest_prefix_sum = 0\n i = 0\n while i < len(nums) - 1:\n if nums[i] + 1 == nums[i + 1]:\n longest_prefix_sum += nums[i + 1]\n i += 1\n i += 1\n\n x = longest_prefix_sum + 1\n while x <= sum(nums) + len(nums):\n if x not in nums:\n return x\n x += 1\n return x", "class Solution:\n def missingInteger(self, nums: List[int]) -> int:\n nums.sort()\n longest_prefix_sum = 0\n i = 0\n while i < len(nums) - 1:\n if nums[i] + 1 == nums[i + 1]:\n longest_prefix_sum += nums[i]\n i += 1\n else:\n break\n longest_prefix_sum += nums[i]\n\n x = longest_prefix_sum + 1\n while x <= sum(nums) + len(nums):\n if x not in nums:\n return x\n x += 1", "class Solution:\n def missingInteger(self, nums: List[int]) -> int:\n nums.sort()\n longest_prefix_sum = 0\n i = 0\n while i < len(nums) - 1:\n if nums[i] + 1 == nums[i + 1]:\n longest_prefix_sum += nums[i]\n i += 1\n else:\n i += 1\n if longest_prefix_sum + 1 == nums[i]:\n longest_prefix_sum += 1\n i += 1\n else:\n break\n return longest_prefix_sum + 1", "class Solution:\n def missingInteger(self, nums: List[int]) -> int:\n nums.sort()\n longest_prefix_sum = 0\n i = 0\n while i < len(nums) - 1 and nums[i] + 1 == nums[i + 1]:\n longest_prefix_sum += nums[i]\n i += 1\n longest_prefix_sum += nums[i]\n\n x = longest_prefix_sum + 1\n while i < len(nums) and nums[i] <= x:\n if nums[i] != x:\n return x\n x += 1\n i += 1\n\n return x", "class Solution:\n def missingInteger(self, nums: List[int]) -> int:\n nums.sort()\n longest_prefix_sum = 0\n i = 0\n while i < len(nums) - 1:\n if nums[i] + 1 == nums[i + 1]:\n longest_prefix_sum += nums[i]\n i += 1\n else:\n i += 1\n if longest_prefix_sum + 1 == nums[i]:\n longest_prefix_sum += 1\n i += 1\n else:\n break\n return longest_prefix_sum + 1", "class Solution:\n def missingInteger(self, nums: List[int]) -> int:\n nums.sort()\n longest_prefix_sum = 0\n i = 0\n while i < len(nums) - 1:\n if nums[i] + 1 == nums[i + 1]:\n longest_prefix_sum += nums[i]\n i += 1\n else:\n break\n longest_prefix_sum += nums[i]\n\n x = longest_prefix_sum + 1\n while x in nums:\n x += 1\n\n return x" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumOperationsToMakeEqual(self, x: int, y: int) -> int:\n def operations(n):\n cnt = 0\n while n % 5 == 0:\n cnt += 1\n n //= 5\n while n % 11 == 0:\n cnt += 1\n n //= 11\n return cnt + abs(1 - n)\n\n return operations(x - y) + abs(x - y)", "class Solution:\n def minimumOperationsToMakeEqual(self, x: int, y: int) -> int:\n def operations(n):\n cnt = 0\n while n % 5 == 0:\n cnt += 1\n n //= 5\n while n % 11 == 0:\n cnt += 1\n n //= 11\n return cnt + abs(1 - n)\n\n return abs(x - y) + operations(x) + operations(y)", "class Solution:\n def minimumOperationsToMakeEqual(self, x: int, y: int) -> int:\n def operations(n):\n cnt = 0\n while n % 5 == 0:\n cnt += 1\n n //= 5\n while n % 11 == 0:\n cnt += 1\n n //= 11\n return cnt + abs(1 - n)\n\n return operations(x - y)", "class Solution:\n def minimumOperationsToMakeEqual(self, x: int, y: int) -> int:\n def operations(n):\n cnt = 0\n while n % 5 == 0:\n cnt += 1\n n //= 5\n while n % 11 == 0:\n cnt += 1\n n //= 11\n return cnt + abs(1 - n)\n\n return operations(x - y)", "class Solution:\n def minimumOperationsToMakeEqual(self, x: int, y: int) -> int:\n def operations(n):\n count = 0\n while n % 5 == 0:\n count += 1\n n //= 5\n while n % 11 == 0:\n count += 1\n n //= 11\n return count + abs(1 - n)\n\n return operations(x) + operations(y - x)", "class Solution:\n def minimumOperationsToMakeEqual(self, x: int, y: int) -> int:\n def operations(n):\n cnt = 0\n while n % 5 == 0:\n cnt += 1\n n //= 5\n while n % 11 == 0:\n cnt += 1\n n //= 11\n return cnt + abs(1 - n)\n\n return operations(x - y)", "class Solution:\n def minimumOperationsToMakeEqual(self, x: int, y: int) -> int:\n def operations(n):\n count = 0\n while n > 0:\n if n % 11 == 0:\n count += n // 11\n n //= 11\n elif n % 5 == 0:\n count += n // 5\n n //= 5\n elif n == 1:\n count += 1\n break\n else:\n count += 1\n n -= 1\n return count\n\n return abs(operations(x) - operations(y))", "class Solution:\n def minimumOperationsToMakeEqual(self, x: int, y: int) -> int:\n def operations(n):\n count = 0\n while n > 1:\n if n % 11 == 0:\n count += n // 11\n n //= 11\n elif n % 5 == 0:\n count += n // 5\n n //= 5\n else:\n count += abs(5 - n)\n n = 5\n return count\n\n return abs(operations(x) - operations(y))", "class Solution:\n def minimumOperationsToMakeEqual(self, x: int, y: int) -> int:\n def operations(n):\n count = 0\n while n % 5 == 0:\n count += 1\n n //= 5\n while n % 11 == 0:\n count += 1\n n //= 11\n return count + abs(1 - n)\n\n return operations(x - y)", "class Solution:\n def minimumOperationsToMakeEqual(self, x: int, y: int) -> int:\n def operations(n):\n count = 0\n while n % 5 == 0:\n count += 1\n n //= 5\n while n % 11 == 0:\n count += 1\n n //= 11\n return count + abs(1 - n)\n\n return operations(x - y)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findMaximumNumber(self, k: int, x: int) -> int:\n def get_price(num: int, x: int) -> int:\n binary_str = bin(num)[2:] # Remove the '0b' prefix\n price = 0\n for i, bit in enumerate(binary_str, 1):\n if int(bit) and (i % x == 0):\n price += 1\n return price\n\n def upper_bound(nums, target):\n left, right = 0, len(nums)\n while left < right:\n mid = (left + right) // 2\n if nums[mid] > target:\n right = mid\n else:\n left = mid + 1\n return left\n\n nums = [get_price(i, x) for i in range(1, 60)]\n total_sum = sum(nums)\n if k >= total_sum:\n return 2**60 - 1\n\n nums = nums[::-1]\n k = total_sum - k - 1\n idx = upper_bound(nums, k)\n return (2 ** (idx + 1)) - 1", "class Solution:\n def findMaximumNumber(self, k: int, x: int) -> int:\n def get_price(num: int, x: int) -> int:\n binary_str = bin(num)[2:]\n price = 0\n for i, bit in enumerate(reversed(binary_str), 1):\n if int(bit) and (i % x == 0):\n price += 1\n return price\n\n prices = [get_price(i, x) for i in range(1, 60)]\n total_sum = sum(prices)\n if total_sum <= k:\n return 63\n\n left, right = 0, 59\n while left < right:\n mid = (left + right) // 2\n current_sum = sum(prices[:mid]) + sum(prices[mid + x - 1 :: x])\n if current_sum > k:\n left = mid + 1\n else:\n right = mid\n\n return left", "class Solution:\n def findMaximumNumber(self, k: int, x: int) -> int:\n def get_price(num: int, x: int) -> int:\n binary_str = bin(num)[2:] # Remove the '0b' prefix\n return sum(int(binary_str[i]) for i in range(len(binary_str)) if i % x == 0)\n\n def upper_bound(nums, target):\n left, right = 0, len(nums)\n while left < right:\n mid = (left + right) // 2\n if nums[mid] > target:\n right = mid\n else:\n left = mid + 1\n return left\n\n nums = [get_price(i, x) for i in range(1, 1000001)]\n total_sum = sum(nums)\n if k >= total_sum:\n return 1000000\n\n # Perform binary search to find the maximum number with sum <= k\n left, right = 0, len(nums)\n while left < right:\n mid = (left + right) // 2\n if sum(nums[:mid]) > k:\n left = mid + 1\n else:\n right = mid\n\n return upper_bound(nums, k)", "class Solution:\n def findMaximumNumber(self, k: int, x: int) -> int:\n def get_price(num: int, x: int) -> int:\n binary_str = bin(num)[2:]\n price = 0\n for i, bit in enumerate(reversed(binary_str), 1):\n if int(bit) and (i % x == 0):\n price += 1\n return price\n\n prices = [get_price(i, x) for i in range(1, 60)]\n total_sum = sum(prices)\n if k >= total_sum:\n return 60\n\n left, right = 0, 50\n while left < right:\n mid = (left + right) // 2\n current_sum = sum(prices[:mid])\n if current_sum <= k:\n left = mid + 1\n else:\n right = mid\n\n return left - 1", "class Solution:\n def findMaximumNumber(self, k: int, x: int) -> int:\n def get_price(num: int, x: int) -> int:\n binary_str = bin(num)[2:] # Get the binary representation of num without the '0b' prefix\n price = 0\n for i, bit in enumerate(binary_str, 1): # Start enumeration from 1\n if int(bit) and (i % x == 0):\n price += 1\n return price\n\n def search(low: int, high: int) -> int:\n if low == high:\n return low\n mid = (low + high) // 2\n sum_prices = sum(get_price(num, x) for num in range(1, mid + 1))\n if sum_prices > k:\n return search(low, mid - 1)\n return search(mid, high)\n\n return search(1, 10**15)", "class Solution:\n def findMaximumNumber(self, k: int, x: int) -> int:\n def get_price(num: int, x: int) -> int:\n binary_str = bin(num)[2:] # Get the binary representation of 'num' without the '0b' prefix\n price = 0\n for i, bit in enumerate(reversed(binary_str), 1):\n if int(bit) and (i % x == 0):\n price += 1\n return price\n\n def search(left: int, right: int) -> int:\n if left == right:\n return left\n mid = (left + right) // 2\n sum_prices = sum(get_price(i, x) for i in range(left, mid + 1))\n if sum_prices > k:\n return search(left, mid)\n return search(mid + 1, right)\n\n return search(1, 1 << 63)", "class Solution:\n def findMaximumNumber(self, k: int, x: int) -> int:\n def get_price(num: int, x: int) -> int:\n binary_str = bin(num)[2:] # Remove the '0b' prefix\n return sum(int(binary_str[i]) for i in range(len(binary_str)) if i % x == 0)\n\n def upper_bound(nums, target):\n left, right = 0, len(nums)\n while left < right:\n mid = (left + right) // 2\n if nums[mid] > target:\n right = mid\n else:\n left = mid + 1\n return left\n\n nums = [get_price(i, x) for i in range(1, 60)]\n return upper_bound(nums, k)", "class Solution:\n def findMaximumNumber(self, k: int, x: int) -> int:\n def get_price(num, x):\n s = bin(num)[2:]\n return sum(int(s[-(i+1)]) for i in range(len(s)) if i % x == 0)\n \n prices = [get_price(i, x) for i in range(1, 60)]\n total_sum = sum(prices)\n if k >= total_sum:\n return 2**60 - 1\n \n left, right = 0, 59\n while left < right:\n mid = (left + right + 1) // 2\n if sum(prices[:mid]) > k:\n right = mid - 1\n else:\n left = mid\n \n return 2**left - 1", "class Solution:\n def findMaximumNumber(self, k: int, x: int) -> int:\n def get_price(num: int, x: int) -> int:\n binary_str = bin(num)[2:] # Remove the '0b' prefix\n return sum(int(binary_str[i]) for i in range(len(binary_str)) if i % x == 0)\n\n num_prices = [get_price(i, x) for i in range(1, 60)]\n prefix_sum = [0] * 60\n for i in range(1, 60):\n prefix_sum[i] = prefix_sum[i - 1] + num_prices[i - 1]\n\n left, right = 0, 60\n while left < right:\n mid = (left + right) // 2\n if prefix_sum[mid] > k:\n right = mid\n else:\n left = mid + 1\n\n return left - 1", "class Solution:\n def findMaximumNumber(self, k: int, x: int) -> int:\n def get_price(num: int, x: int) -> int:\n binary_str = bin(num)[2:]\n count = 0\n for i, bit in enumerate(reversed(binary_str), 1):\n if int(bit) and (i % x == 0):\n count += 1\n return count\n\n prices = [get_price(i, x) for i in range(1, 60)]\n total_sum = sum(prices)\n if k >= total_sum:\n return 63\n\n low, high = 0, 59\n while low < high:\n mid = (low + high) // 2\n current_sum = sum(prices[:mid]) + sum(i // x for i in prices[mid:])\n if current_sum <= k:\n low = mid + 1\n else:\n high = mid\n\n return low" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxFrequencyElements(self, nums: List[int]) -> int:\n count_dict = {}\n for num in nums:\n if num in count_dict:\n count_dict[num] += 1\n else:\n count_dict[num] = 1\n \n max_frequency = max(count_dict.values())\n \n return sum(1 for freq in count_dict.values() if freq == max_frequency)", "class Solution:\n def maxFrequencyElements(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = Counter(nums)\n max_freq = max(count.values())\n return sum(1 for freq in count.values() if freq == max_freq)", "class Solution:\n def maxFrequencyElements(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = Counter(nums)\n max_freq = max(count.values())\n return sum(1 for freq in count.values() if freq == max_freq)", "class Solution:\n def maxFrequencyElements(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = Counter(nums)\n max_freq = max(count.values())\n return sum(1 for freq in count.values() if freq == max_freq)", "class Solution:\n def maxFrequencyElements(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = Counter(nums)\n max_freq = max(count.values())\n return sum(1 for freq in count.values() if freq == max_freq)", "class Solution:\n def maxFrequencyElements(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = Counter(nums)\n max_freq = max(count.values())\n return sum(1 for freq in count.values() if freq == max_freq)", "class Solution:\n def maxFrequencyElements(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = Counter(nums)\n max_freq = max(count.values())\n return sum(1 for v in count.values() if v == max_freq)", "class Solution:\n def maxFrequencyElements(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = Counter(nums)\n max_freq = max(count.values())\n return sum(1 for freq in count.values() if freq == max_freq)", "class Solution:\n def maxFrequencyElements(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = Counter(nums)\n max_freq = max(count.values())\n return sum(1 for freq in count.values() if freq == max_freq)", "class Solution:\n def maxFrequencyElements(self, nums: List[int]) -> int:\n from collections import Counter\n\n count = Counter(nums)\n max_freq = max(count.values())\n return sum(1 for freq in count.values() if freq == max_freq)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberOfPowerfulInt(self, start: int, finish: int, limit: int, s: str) -> int:\n count = 0\n s_len = len(s)\n s_int = int(s)\n\n for i in range(max(1, limit + 1 - s_len), limit + 1):\n prefix = str(i)\n for j in range(i + 1):\n candidate = prefix + \"0\" * (s_len - 1) + str(j)\n candidate_int = int(candidate)\n if candidate_int >= s_int:\n if start <= candidate_int <= finish:\n count += 1\n break\n\n return count", "class Solution:\n def numberOfPowerfulInt(self, start: int, finish: int, limit: int, s: str) -> int:\n count = 0\n s_len = len(s)\n s_int = int(s)\n\n for i in range(max(s_len, len(str(finish)))):\n for j in range(10):\n if j <= limit:\n current_num = str(j) * (i + 1 - s_len) + s\n current_int = int(current_num)\n if current_int >= start and current_int <= finish:\n count += 1\n else:\n break\n\n return count", "class Solution:\n def numberOfPowerfulInt(self, start: int, finish: int, limit: int, s: str) -> int:\n count = 0\n s_length = len(s)\n s_int = int(s)\n\n for i in range(max(1, start // s_int * s_int), finish // s_int * s_int + 1, s_int):\n powerful = True\n num_str = str(i)\n for j in range(s_length):\n if int(num_str[-j - 1]) > limit:\n powerful = False\n break\n\n if powerful:\n count += 1\n\n return count", "class Solution:\n def numberOfPowerfulInt(self, start: int, finish: int, limit: int, s: str) -> int:\n count = 0\n s_length = len(s)\n s_int = int(s)\n\n for i in range(max(1, limit + 1 - s_int // 10), limit + 1):\n prefix = str(i)\n for j in range(i + 1):\n candidate = int(prefix + s)\n if start <= candidate <= finish:\n count += 1\n\n for k in range(s_length - 1):\n prefix += str(limit)\n for j in range(i):\n candidate = int(prefix + s)\n if start <= candidate <= finish:\n count += 1\n\n prefix = prefix[:-1]\n\n return count", "class Solution:\n def numberOfPowerfulInt(self, start: int, finish: int, limit: int, s: str) -> int:\n count = 0\n s_len = len(s)\n s_int = int(s)\n\n for i in range(max(1, limit + 1 - s_len), limit + 1):\n prefix = str(i)\n for j in range(i + 1):\n candidate = int(prefix + s)\n if start <= candidate <= finish:\n count += 1\n if int(str(j) + s) < s_int:\n break\n if int(prefix + '9' * (s_len - 1)) < s_int:\n break\n\n return count", "class Solution:\n def numberOfPowerfulInt(self, start: int, finish: int, limit: int, s: str) -> int:\n count = 0\n s_len = len(s)\n s_int = int(s)\n for i in range(max(1, start // s_int), (finish + s_int - 1) // s_int + 1):\n powerful_int = i * s_int\n powerful_str = str(powerful_int)\n if len(powerful_str) != len(s):\n continue\n is_powerful = all(map(lambda x, y: x <= limit and x == y, map(int, powerful_str[-s_len:]), map(int, s)))\n if is_powerful:\n count += 1\n return count", "class Solution:\n def numberOfPowerfulInt(self, start: int, finish: int, limit: int, s: str) -> int:\n def is_powerful(num: int) -> bool:\n str_num = str(num)\n return str_num.endswith(s) and all(map(lambda x: x <= limit, str_num))\n\n return sum(map(is_powerful, range(start, finish + 1)))", "class Solution:\n def numberOfPowerfulInt(self, start: int, finish: int, limit: int, s: str) -> int:\n def is_powerful(num: int) -> bool:\n num_str = str(num)\n return num_str.endswith(s) and all(map(lambda x: x <= limit, num_str))\n \n count = 0\n for i in range(start, finish + 1):\n if is_powerful(i):\n count += 1\n return count", "class Solution:\n def numberOfPowerfulInt(self, start: int, finish: int, limit: int, s: str) -> int:\n count = 0\n s_len = len(s)\n s_int = int(s)\n for i in range(max(1, start // s_int), finish // s_int + 1):\n powerful_int = str(i * s_int)\n if powerful_int.endswith(s) and all(map(lambda x: x <= str(limit), powerful_int)):\n count += 1\n return count", "class Solution:\n def numberOfPowerfulInt(self, start: int, finish: int, limit: int, s: str) -> int:\n count = 0\n s_length = len(s)\n s_int = int(s)\n for i in range(max(1, start // s_int * s_int), finish // s_int * s_int + 1, s_int):\n powerful = True\n num_str = str(i)\n for j in range(s_length):\n if int(num_str[-j - 1]) > limit:\n powerful = False\n break\n if powerful and start <= i <= finish:\n count += 1\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumArrayLength(self, nums: List[int]) -> int:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n n = len(nums)\n if n == 1:\n return 1\n\n g = nums[0]\n for num in nums[1:]:\n g = gcd(g, num)\n\n return 1 if g == 1 else 2", "class Solution:\n def minimumArrayLength(self, nums: List[int]) -> int:\n def gcd(x, y):\n while y:\n x, y = y, x % y\n return x\n\n def lcm(x, y):\n return x * y // gcd(x, y)\n\n nums.sort()\n result = 1\n for i in range(1, len(nums)):\n result = lcm(result, nums[i] // gcd(nums[i], nums[i - 1]))\n\n return result", "class Solution:\n def minimumArrayLength(self, nums: List[int]) -> int:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n n = len(nums)\n if n == 1:\n return 1\n\n g = nums[0]\n for num in nums[1:]:\n g = gcd(g, num)\n\n return 1 if g == 1 else 2", "class Solution:\n def minimumArrayLength(self, nums: List[int]) -> int:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n def lcm(a, b):\n return a * b // gcd(a, b)\n\n nums.sort()\n l = 0\n for i in range(len(nums) - 1, 0, -1):\n l = lcm(l, nums[i])\n if l == 1:\n break\n\n return len(nums) if l == 1 else 2", "class Solution:\n def minimumArrayLength(self, nums: List[int]) -> int:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n n = len(nums)\n if n == 1:\n return 1\n\n g = nums[0]\n for num in nums[1:]:\n g = gcd(g, num)\n\n return 1 if g == 1 else 2", "class Solution:\n def minimumArrayLength(self, nums: List[int]) -> int:\n gcd = nums[0]\n for num in nums[1:]:\n gcd = self.gcd(gcd, num)\n return 1 if gcd == 1 else 2\n\n def gcd(self, a, b):\n while b:\n a, b = b, a % b\n return a", "class Solution:\n def minimumArrayLength(self, nums: List[int]) -> int:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n def lcm(a, b):\n return a * b // gcd(a, b)\n\n nums.sort()\n l = 0\n for i in range(len(nums) - 1, 0, -1):\n l = lcm(l, nums[i])\n if l == 1:\n break\n\n return len(nums) if l == 1 else 2", "class Solution:\n def minimumArrayLength(self, nums: List[int]) -> int:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n n = len(nums)\n if n == 1:\n return 1\n\n g = nums[0]\n for num in nums[1:]:\n g = gcd(g, num)\n\n return 1 if g == 1 else 2", "class Solution:\n def minimumArrayLength(self, nums: List[int]) -> int:\n gcd = nums[0]\n for num in nums[1:]:\n gcd = self.gcd(gcd, num)\n \n return 1 if gcd == 1 else 2\n\n def gcd(self, a, b):\n while b:\n a, b = b, a % b\n return a", "class Solution:\n def minimumArrayLength(self, nums: List[int]) -> int:\n def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n def lcm(a, b):\n return a * b // gcd(a, b)\n\n nums.sort()\n l = 0\n for i in range(len(nums) - 1, 0, -1):\n l = lcm(l, nums[i])\n if l == 1:\n break\n\n return len(nums) if l == 1 else 2" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def beautifulIndices(self, s: str, a: str, b: str, k: int) -> List[int]:\n result = []\n a_indices = [i for i in range(len(s)) if s[i:i + len(a)] == a]\n b_indices = [i for i in range(len(s)) if s[i:i + len(b)] == b]\n\n for i in a_indices:\n for j in b_indices:\n if abs(i - j) <= k:\n result.append(i)\n break\n\n return sorted(list(set(result)))", "class Solution:\n def beautifulIndices(self, s: str, a: str, b: str, k: int) -> List[int]:\n result = []\n a_indices = [i for i in range(len(s)) if s[i:i + len(a)] == a]\n b_indices = [i for i in range(len(s)) if s[i:i + len(b)] == b]\n\n for i in a_indices:\n for j in b_indices:\n if abs(i - j) <= k:\n result.append(i)\n break\n\n return sorted(result)", "class Solution:\n def beautifulIndices(self, s: str, a: str, b: str, k: int) -> List[int]:\n def find_all_indices(s, sub):\n indices = []\n sub_len = len(sub)\n for i in range(len(s) - sub_len + 1):\n if s[i:i + sub_len] == sub:\n indices.append(i)\n return indices\n\n a_indices = find_all_indices(s, a)\n b_indices = find_all_indices(s, b)\n beautiful_indices = []\n\n for i in a_indices:\n for j in b_indices:\n if abs(i - j) <= k:\n beautiful_indices.append(i)\n break\n\n return sorted(list(set(beautiful_indices)))", "class Solution:\n def beautifulIndices(self, s: str, a: str, b: str, k: int) -> List[int]:\n def find_all_indices(s, sub):\n indices = []\n sub_len = len(sub)\n for i in range(len(s) - sub_len + 1):\n if s[i:i + sub_len] == sub:\n indices.append(i)\n return indices\n\n a_indices = find_all_indices(s, a)\n b_indices = find_all_indices(s, b)\n beautiful_indices = []\n\n for i in a_indices:\n for j in b_indices:\n if abs(i - j) <= k:\n beautiful_indices.append(i)\n break\n\n return sorted(list(set(beautiful_indices)))", "class Solution:\n def beautifulIndices(self, s: str, a: str, b: str, k: int) -> List[int]:\n result = []\n a_indices = []\n b_indices = []\n\n for i in range(len(s) - len(a) + 1):\n if s[i:i + len(a)] == a:\n a_indices.append(i)\n\n for j in range(len(s) - len(b) + 1):\n if s[j:j + len(b)] == b:\n b_indices.append(j)\n\n for i in a_indices:\n for j in b_indices:\n if abs(i - j) <= k:\n result.append(i)\n break\n\n return sorted(result)", "class Solution:\n def beautifulIndices(self, s: str, a: str, b: str, k: int) -> List[int]:\n result = []\n a_indices = [i for i in range(len(s)) if s[i:i + len(a)] == a]\n b_indices = [i for i in range(len(s)) if s[i:i + len(b)] == b]\n\n for i in a_indices:\n for j in b_indices:\n if abs(i - j) <= k:\n result.append(i)\n break\n\n return sorted(list(set(result)))", "class Solution:\n def beautifulIndices(self, s: str, a: str, b: str, k: int) -> List[int]:\n def find_all_indices(s, sub):\n indices = []\n sub_len = len(sub)\n for i in range(len(s) - sub_len + 1):\n if s[i:i + sub_len] == sub:\n indices.append(i)\n return indices\n\n a_indices = find_all_indices(s, a)\n b_indices = find_all_indices(s, b)\n beautiful_indices = []\n\n for i in a_indices:\n for j in b_indices:\n if abs(i - j) <= k:\n beautiful_indices.append(i)\n break\n\n return sorted(beautiful_indices)", "class Solution:\n def beautifulIndices(self, s: str, a: str, b: str, k: int) -> List[int]:\n result = []\n a_indices = []\n b_indices = []\n\n # Find all indices of 'a' and 'b' in string 's'\n for i in range(len(s)):\n if i + len(a) <= len(s) and s[i:i + len(a)] == a:\n a_indices.append(i)\n if i + len(b) <= len(s) and s[i:i + len(b)] == b:\n b_indices.append(i)\n\n # Check for beautiful indices\n for i in a_indices:\n for j in b_indices:\n if abs(i - j) <= k:\n result.append(i)\n\n # Sort the result\n result.sort()\n\n return result", "class Solution:\n def beautifulIndices(self, s: str, a: str, b: str, k: int) -> List[int]:\n def find_all_indices(s, sub):\n indices = []\n sub_len = len(sub)\n for i in range(len(s) - sub_len + 1):\n if s[i:i + sub_len] == sub:\n indices.append(i)\n return indices\n\n a_indices = find_all_indices(s, a)\n b_indices = find_all_indices(s, b)\n beautiful_indices = []\n\n for i in a_indices:\n for j in b_indices:\n if abs(i - j) <= k:\n beautiful_indices.append(i)\n break\n\n return sorted(list(set(beautiful_indices)))", "class Solution:\n def beautifulIndices(self, s: str, a: str, b: str, k: int) -> List[int]:\n def find_all_indices(s, sub):\n indices = []\n sub_len = len(sub)\n for i in range(len(s) - sub_len + 1):\n if s[i:i + sub_len] == sub:\n indices.append(i)\n return indices\n\n a_indices = find_all_indices(s, a)\n b_indices = find_all_indices(s, b)\n beautiful_indices = []\n\n for i in a_indices:\n for j in b_indices:\n if abs(i - j) <= k:\n beautiful_indices.append(i)\n break\n\n return sorted(list(set(beautiful_indices)))" ], "pass1_list": [ true, true, true, true, true, true, true, false, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def hasTrailingZeros(self, nums: List[int]) -> bool:\n # Check for trailing zeros in the bitwise OR of all pairs of numbers\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if (nums[i] | nums[j]) & (-(nums[i] | nums[j])) != 0:\n return True\n return False", "class Solution:\n def hasTrailingZeros(self, nums: List[int]) -> bool:\n # Check for trailing zeros in the bitwise OR of all pairs of numbers\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if (nums[i] | nums[j]) & (-nums[i] | -nums[j]) != 0:\n return True\n return False", "class Solution:\n def hasTrailingZeros(self, nums: List[int]) -> bool:\n # Check if any number in the array has a trailing zero\n for num in nums:\n binary = bin(num)[2:] # Get the binary representation without the leading '0b'\n if binary[-1] == '0' or binary[-2] == '0':\n return True\n return False", "class Solution:\n def hasTrailingZeros(self, nums: List[int]) -> bool:\n # Check if any number in the array has a trailing zero\n for num in nums:\n binary = bin(num)[2:] # Get the binary representation without the \"0b\" prefix\n if binary[-1] == '0' or binary[-2] == '0':\n return True\n return False", "class Solution:\n def hasTrailingZeros(self, nums: List[int]) -> bool:\n # Check for trailing zeros in the bitwise OR of all pairs of numbers in the array\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if (nums[i] | nums[j]) & (-(nums[i] | nums[j])) != 0:\n return True\n return False", "class Solution:\n def hasTrailingZeros(self, nums: List[int]) -> bool:\n # Check all pairs of numbers in the array\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n # Perform bitwise OR and check for trailing zeros\n if (nums[i] | nums[j]) & (-(nums[i] | nums[j])) != 0:\n return True\n return False", "class Solution:\n def hasTrailingZeros(self, nums: List[int]) -> bool:\n # Check if any number in the array has a trailing zero\n for num in nums:\n binary = bin(num)[2:] # Get the binary representation without the leading '0b'\n if binary[-1] == '0' or binary[-2] == '0':\n return True\n return False", "class Solution:\n def hasTrailingZeros(self, nums: List[int]) -> bool:\n # Check for trailing zeros in the bitwise OR of all pairs of numbers\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if (nums[i] | nums[j]) & (-(nums[i] | nums[j])) == 0:\n return True\n return False", "class Solution:\n def hasTrailingZeros(self, nums: List[int]) -> bool:\n # Check for trailing zeros in the bitwise OR of all pairs of numbers\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if (nums[i] | nums[j]) & (-(nums[i] | nums[j])) != 0:\n return True\n return False", "class Solution:\n def hasTrailingZeros(self, nums: List[int]) -> bool:\n # Check for trailing zeros in the bitwise OR of all pairs of numbers\n for i in range(len(nums)):\n for j in range(i + 1, len(nums)):\n if (nums[i] | nums[j]) & (-(nums[i] | nums[j])) == 0:\n return True\n return False" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n xor_sum = 0\n for num in nums:\n xor_sum ^= num\n ans = bin(xor_sum ^ k).count('1')\n\n for i in range(20, -1, -1):\n cnt = 0\n for num in nums:\n if num & (1 << i):\n cnt += 1\n if cnt % 2 == 1:\n ans -= 1\n\n return ans", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n xor_sum = 0\n for num in nums:\n xor_sum ^= num\n ans = bin(xor_sum ^ k).count('1')\n return ans // 2 + (ans % 2 and 1 or 0)", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n xor_sum = 0\n for num in nums:\n xor_sum ^= num\n ans = bin(xor_sum ^ k).count('1')\n\n for i in range(20, -1, -1):\n cnt = 0\n for num in nums:\n if num & (1 << i):\n cnt += 1\n if cnt % 2 == 1:\n ans -= 1\n\n return ans", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n xor_sum = 0\n for num in nums:\n xor_sum ^= num\n \n count = 0\n for i in range(20):\n if xor_sum & 1 << i:\n count += 1\n \n for num in nums:\n c = 0\n for i in range(20):\n if num & 1 << i:\n c += 1\n if c % 2 != count % 2:\n count += 1\n \n return count - (xor_sum == k)", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n def count_ones(n, i):\n return (n >> i) & 1 if n else 0\n\n xor_sum = 0\n for num in nums:\n xor_sum ^= num\n\n for i in range(20, -1, -1):\n mask = 1 << i\n cnt = sum(count_ones(num, i) for num in nums)\n if (xor_sum & mask) and (cnt % 2 == 0):\n xor_sum ^= mask\n elif not (xor_sum & mask) and (cnt % 2 == 1):\n return -1\n\n return bin(xor_sum ^ k).count('1')", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n def count_ones(n, i):\n return (n >> i) & 1 if n else 0\n\n xor_sum = 0\n for num in nums:\n xor_sum ^= num\n\n for i in range(20, -1, -1):\n mask = 1 << i\n cnt = sum(count_ones(num, i) for num in nums)\n if (xor_sum & mask) and (cnt % 2 == 0):\n xor_sum ^= mask\n elif not (xor_sum & mask) and (cnt % 2 == 1):\n return -1\n\n return bin(xor_sum ^ k).count('1')", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n xor_sum = 0\n for num in nums:\n xor_sum ^= num\n\n count = [0] * 20\n for i in range(20):\n count[i] = bin(xor_sum & (1 << i)).count('1')\n\n for num in nums:\n for i in range(20):\n if bin(num & (1 << i)).count('1') != count[i]:\n count[i] += 1\n break\n\n res = float('inf')\n for i in range(20):\n if count[i] % 2 == 1:\n res = min(res, count[i] - 1)\n\n return res if xor_sum ^ k else res + 1", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n xor_sum = 0\n for num in nums:\n xor_sum ^= num\n \n count = 0\n for i in range(20):\n if xor_sum & 1 << i:\n count += 1\n xor_sum ^= 1 << i\n \n for num in nums:\n count = min(count, self.count_bits(num ^ k))\n \n return count if xor_sum == k else count + 1\n\n def count_bits(self, num: int) -> int:\n count = 0\n while num:\n count += num & 1\n num >>= 1\n return count", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n xor_sum = 0\n for num in nums:\n xor_sum ^= num\n \n # Count the number of set bits in xor_sum\n bit_count = bin(xor_sum).count('1')\n \n # If k is zero, no operations needed if xor_sum is also zero\n if k == 0:\n return 0 if xor_sum == 0 else -1\n \n # If k is not zero, we need to make sure xor_sum has an odd number of set bits\n if k > 0 and bit_count % 2 == 0:\n return -1\n \n # Now, we need to flip bit_count bits to make xor_sum equal to k\n return bit_count", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n xor_sum = 0\n for num in nums:\n xor_sum ^= num\n ans = bin(xor_sum ^ k).count('1')\n return ans // 2 + (ans % 2 and 1 or 0)" ], "pass1_list": [ false, false, false, false, true, true, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def areaOfMaxDiagonal(self, dimensions: List[List[int]]) -> int:\n max_diag = 0\n max_area = 0\n for length, width in dimensions:\n diag = (length ** 2 + width ** 2) ** 0.5\n area = length * width\n if diag > max_diag or (diag == max_diag and area > max_area):\n max_diag = diag\n max_area = area\n return max_area", "class Solution:\n def areaOfMaxDiagonal(self, dimensions: List[List[int]]) -> int:\n max_diag = 0\n max_area = 0\n for length, width in dimensions:\n diag = (length ** 2 + width ** 2) ** 0.5\n area = length * width\n if diag > max_diag or (diag == max_diag and area > max_area):\n max_diag = diag\n max_area = area\n return max_area", "class Solution:\n def areaOfMaxDiagonal(self, dimensions: List[List[int]]) -> int:\n max_diag = 0\n max_area = 0\n for length, width in dimensions:\n diag = (length ** 2 + width ** 2) ** 0.5\n area = length * width\n if diag > max_diag or (diag == max_diag and area > max_area):\n max_diag = diag\n max_area = area\n return max_area", "class Solution:\n def areaOfMaxDiagonal(self, dimensions: List[List[int]]) -> int:\n max_diag = 0\n max_area = 0\n for length, width in dimensions:\n diag = (length ** 2 + width ** 2) ** 0.5\n area = length * width\n if diag > max_diag or (diag == max_diag and area > max_area):\n max_diag = diag\n max_area = area\n return max_area", "class Solution:\n def areaOfMaxDiagonal(self, dimensions: List[List[int]]) -> int:\n max_diag = 0\n max_area = 0\n for length, width in dimensions:\n diag = int((length ** 2 + width ** 2) ** 0.5)\n area = length * width\n if diag > max_diag or (diag == max_diag and area > max_area):\n max_diag = diag\n max_area = area\n return max_area", "class Solution:\n def areaOfMaxDiagonal(self, dimensions: List[List[int]]) -> int:\n max_diag = 0\n max_area = 0\n for length, width in dimensions:\n diag = (length ** 2 + width ** 2) ** 0.5\n area = length * width\n if diag > max_diag or (diag == max_diag and area > max_area):\n max_diag = diag\n max_area = area\n return max_area", "class Solution:\n def areaOfMaxDiagonal(self, dimensions: List[List[int]]) -> int:\n max_diag = 0\n max_area = 0\n for length, width in dimensions:\n diag = (length ** 2 + width ** 2) ** 0.5\n area = length * width\n if diag > max_diag or (diag == max_diag and area > max_area):\n max_diag = diag\n max_area = area\n return max_area", "class Solution:\n def areaOfMaxDiagonal(self, dimensions: List[List[int]]) -> int:\n max_diag = 0\n max_area = 0\n for length, width in dimensions:\n diag = (length ** 2 + width ** 2) ** 0.5\n area = length * width\n if diag > max_diag or (diag == max_diag and area > max_area):\n max_diag = diag\n max_area = area\n return max_area", "class Solution:\n def areaOfMaxDiagonal(self, dimensions: List[List[int]]) -> int:\n max_diag = 0\n max_area = 0\n for length, width in dimensions:\n diag = (length ** 2 + width ** 2) ** 0.5\n area = length * width\n if diag > max_diag or (diag == max_diag and area > max_area):\n max_diag = diag\n max_area = area\n return max_area", "class Solution:\n def areaOfMaxDiagonal(self, dimensions: List[List[int]]) -> int:\n max_diagonal = 0\n max_area = 0\n for length, width in dimensions:\n diagonal = (length ** 2 + width ** 2) ** 0.5\n if diagonal > max_diagonal:\n max_diagonal = diagonal\n max_area = length * width\n elif diagonal == max_diagonal:\n new_area = length * width\n if new_area > max_area:\n max_area = new_area\n return max_area" ], "pass1_list": [ true, true, true, true, false, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def incremovableSubarrayCount(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[0] * n for _ in range(n)]\n count = 0\n\n for i in range(n):\n dp[i][i] = 1\n count += 1\n\n for len in range(1, n):\n for i in range(n - len):\n j = i + len\n dp[i][j] = dp[i][j - 1] + dp[i + 1][j]\n if nums[i] >= nums[j]:\n dp[i][j] += 1\n count += dp[i][j]\n\n return count", "class Solution:\n def incremovableSubarrayCount(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[0] * n for _ in range(n)]\n count = 0\n\n for i in range(n):\n dp[i][i] = 1\n for j in range(i):\n if nums[j] < nums[i]:\n dp[j][i] = dp[j][i - 1] + 1\n elif nums[j] > nums[i]:\n dp[j][i] = 1\n else:\n dp[j][i] = dp[j][i - 1] + 2\n count += dp[i][i]\n\n return count", "class Solution:\n def incremovableSubarrayCount(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[0] * n for _ in range(n)]\n count = 0\n\n for i in range(n):\n dp[i][i] = 1\n count += 1\n\n for len in range(1, n):\n for i in range(n - len):\n j = i + len\n dp[i][j] = dp[i][j - 1] + dp[i + 1][j]\n if nums[i] >= nums[j]:\n dp[i][j] += 1\n count += dp[i][j]\n\n return count", "class Solution:\n def incremovableSubarrayCount(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[0] * n for _ in range(n)]\n for i in range(n):\n dp[i][i] = 1\n for len in range(1, n):\n for i in range(n - len):\n j = i + len\n dp[i][j] = dp[i][j - 1] + dp[i + 1][j] + (nums[i] >= nums[j] and nums[i + 1] <= nums[j - 1])\n return sum(dp[0][i - 1] for i in range(1, n + 1))", "class Solution:\n def incremovableSubarrayCount(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[0] * n for _ in range(n)]\n count = 0\n\n for i in range(n):\n dp[i][i] = 1\n count += 1\n\n for len in range(1, n):\n for i in range(n - len):\n j = i + len\n dp[i][j] = dp[i][j - 1] + dp[i + 1][j]\n if nums[i] >= nums[i + 1]:\n dp[i][j] += 1\n if nums[j - 1] >= nums[j]:\n dp[i][j] += 1\n count += dp[i][j]\n\n return count", "class Solution:\n def incremovableSubarrayCount(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[0] * n for _ in range(n)]\n count = 0\n\n for i in range(n):\n dp[i][i] = 1\n count += 1\n\n for len in range(1, n):\n for i in range(n - len):\n j = i + len\n dp[i][j] = dp[i][j - 1] + dp[i + 1][j]\n if nums[i] >= nums[j]:\n dp[i][j] += 1\n count += dp[i][j]\n\n return count", "class Solution:\n def incremovableSubarrayCount(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[0] * n for _ in range(n)]\n for i in range(n):\n dp[i][i] = 1\n for len in range(1, n):\n for i in range(n - len):\n j = i + len\n dp[i][j] = dp[i][j - 1] + dp[i + 1][j] + (nums[i] >= nums[i + 1] and nums[i + 1] >= nums[j])\n return dp[0][n - 1]", "class Solution:\n def incremovableSubarrayCount(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[0] * n for _ in range(n)]\n count = 0\n \n for i in range(n):\n dp[i][i] = 1\n count += 1\n \n for len in range(1, n):\n for i in range(n - len):\n j = i + len\n if nums[i] <= nums[j]:\n dp[i][j] = dp[i][j-1] + 1\n else:\n dp[i][j] = dp[i+1][j]\n count += dp[i][j]\n \n return count", "class Solution:\n def incremovableSubarrayCount(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[0] * n for _ in range(n)]\n count = 0\n\n for i in range(n):\n dp[i][i] = 1\n count += 1\n\n for len in range(1, n):\n for i in range(n - len):\n j = i + len\n dp[i][j] = dp[i][j - 1] + dp[i + 1][j]\n if nums[i] >= nums[j]:\n dp[i][j] += 1\n count += dp[i][j]\n\n return count", "class Solution:\n def incremovableSubarrayCount(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [1] * n\n for i in range(1, n):\n if nums[i] > nums[i - 1]:\n dp[i] += dp[i - 1]\n return sum(dp) + sum(dp[i] * (n - i - 1) for i in range(n))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minOrAfterOperations(self, nums: List[int], k: int) -> int:\n res = 0\n for i in range(30, -1, -1):\n cnt = 0\n for j in range(len(nums) - 1):\n if nums[j] & nums[j + 1] < (nums[j] | nums[j + 1]) and (nums[j] & (1 << i)) == 0 and (nums[j + 1] & (1 << i)) == 0:\n cnt += 1\n if cnt > k:\n res += 2 ** i\n break\n k -= cnt\n return res | nums[0]", "class Solution:\n def minOrAfterOperations(self, nums: List[int], k: int) -> int:\n res = 0\n for i in range(30, -1, -1):\n count_zeros = sum(1 for num in nums if (num & (1 << i)) == 0)\n if count_zeros <= k:\n res += 1 << i\n k -= count_zeros\n return res", "class Solution:\n def minOrAfterOperations(self, nums: List[int], k: int) -> int:\n res = 0\n for i in range(30, -1, -1):\n count_zeros = sum(not x >> i & 1 for x in nums)\n if count_zeros <= k:\n res += 1 << i\n k -= count_zeros\n return res", "class Solution:\n def minOrAfterOperations(self, nums: List[int], k: int) -> int:\n res = 0\n for i in range(30, -1, -1):\n count_zeros = sum(not x >> i & 1 for x in nums)\n if count_zeros <= k:\n res += 1 << i\n k -= count_zeros\n return res", "class Solution:\n def minOrAfterOperations(self, nums: List[int], k: int) -> int:\n res = 0\n for i in range(30, -1, -1):\n count_zeros = 0\n for num in nums:\n if not num & 1 << i:\n count_zeros += 1\n if count_zeros > k:\n break\n if count_zeros <= k:\n res += 1 << i\n return res", "class Solution:\n def minOrAfterOperations(self, nums: List[int], k: int) -> int:\n res = 0\n for i in range(30, -1, -1):\n cnt = 0\n for j in range(len(nums) - 1):\n if nums[j] & nums[j + 1] < (nums[j] | nums[j + 1]) and (nums[j] & (1 << i)) == 0 and (nums[j + 1] & (1 << i)) == 0:\n cnt += 1\n if cnt > k:\n continue\n for j in range(len(nums) - 1):\n if (nums[j] & (1 << i)) == 0 and (nums[j + 1] & (1 << i)) == 0:\n nums[j] &= nums[j + 1]\n res += 1 << i\n break\n return res", "class Solution:\n def minOrAfterOperations(self, nums: List[int], k: int) -> int:\n res = 0\n for i in range(30, -1, -1):\n count_zeros = sum(1 for num in nums if (num & (1 << i)) == 0)\n if count_zeros <= k:\n res += 2 ** i\n k -= count_zeros\n return res", "class Solution:\n def minOrAfterOperations(self, nums: List[int], k: int) -> int:\n or_val = 0\n for num in nums:\n or_val |= num\n\n for i in range(len(nums) - 1):\n if i > k:\n break\n nums[i] &= nums[i + 1]\n\n for num in nums:\n or_val = min(or_val, or_val | num)\n\n return or_val", "class Solution:\n def minOrAfterOperations(self, nums: List[int], k: int) -> int:\n res = 0\n for i in range(30, -1, -1):\n count_zeros = sum(1 for num in nums if (num & (1 << i)) == 0)\n if count_zeros <= k:\n res += 2 ** i\n k -= count_zeros\n return res", "class Solution:\n def minOrAfterOperations(self, nums: List[int], k: int) -> int:\n res = 0\n for i in range(30, -1, -1):\n count_zeros = sum(1 for num in nums if (num & (1 << i)) == 0)\n if count_zeros <= k:\n res += 2 ** i\n k -= count_zeros\n elif k > 0:\n k = 0\n return res" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def largestPerimeter(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n for i in range(n - 1, 2 - 1, -1):\n if nums[i] < nums[i - 1] + nums[i - 2]:\n return nums[i] + nums[i - 1] + nums[i - 2]\n return -1", "class Solution:\n def largestPerimeter(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n for i in range(n - 1, 2 - 1, -1):\n if nums[i - 2] + nums[i - 1] > nums[i]:\n return nums[i - 2] + nums[i - 1] + nums[i]\n return -1", "class Solution:\n def largestPerimeter(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n for i in range(n - 1, 2 - 1, -1):\n if nums[i - 2] + nums[i - 1] > nums[i]:\n return nums[i - 2] + nums[i - 1] + nums[i]\n return -1", "class Solution:\n def largestPerimeter(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n for i in range(n - 1, n - 4, -1):\n if nums[i] < nums[i - 1] + nums[i - 2]:\n return nums[i] + nums[i - 1] + nums[i - 2]\n return -1", "class Solution:\n def largestPerimeter(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n for i in range(n - 1, n - 3, -1):\n if nums[i] < nums[i - 1] + nums[i - 2]:\n return nums[i] + nums[i - 1] + nums[i - 2]\n return -1", "class Solution:\n def largestPerimeter(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n for i in range(n - 1, 2 - 1, -1):\n if nums[i] < nums[i - 1] + nums[i - 2]:\n return nums[i] + nums[i - 1] + nums[i - 2]\n return -1", "class Solution:\n def largestPerimeter(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n for i in range(n - 1, 2 - 1, -1):\n if nums[i] < nums[i - 1] + nums[i - 2]:\n return nums[i] + nums[i - 1] + nums[i - 2]\n return -1", "class Solution:\n def largestPerimeter(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n for i in range(n - 1, 1, -1):\n if nums[i] < nums[i - 1] + nums[i - 2]:\n return nums[i] + nums[i - 1] + nums[i - 2]\n return -1", "class Solution:\n def largestPerimeter(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n for i in range(n - 1, 2 - 1, -1):\n if nums[i - 2] + nums[i - 1] > nums[i]:\n return nums[i - 2] + nums[i - 1] + nums[i]\n return -1", "class Solution:\n def largestPerimeter(self, nums: List[int]) -> int:\n nums.sort()\n n = len(nums)\n for i in range(n - 1, 2, -1):\n if nums[i] < nums[i - 1] + nums[i - 2]:\n return nums[i] + nums[i - 1] + nums[i - 2]\n return -1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[float('inf')] * (n + 2) for _ in range(n + 2)]\n dp[0][0] = 0\n\n for i in range(n):\n dp[i + 1][1] = dp[i][0] + nums[i]\n dp[i + 1][2] = min(dp[j][1] + dp[i][0] + nums[i] for j in range(i + 1))\n for k in range(3, i + 2):\n dp[i + 1][k] = min(dp[j][k - 1] + dp[i][0] + nums[i] for j in range(i + 1))\n\n return dp[n][3]", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[float('inf')] * (n + 2) for _ in range(n + 2)]\n\n for i in range(n - 1, -1, -1):\n dp[i][i] = 0\n for j in range(i + 1, n + 1):\n dp[i][j] = min(dp[i][j], dp[i][j - 1] + nums[i])\n dp[i][j] = min(dp[i][j], dp[i + 1][j] + nums[i])\n\n ans = float('inf')\n for i in range(n):\n ans = min(ans, dp[i][i] + dp[i + 1][i + 1] + dp[i + 2][n])\n\n return ans", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[float('inf')] * (n + 2) for _ in range(n + 2)]\n for i in range(n - 1, -1, -1):\n dp[i][i] = 0\n for j in range(i + 1, n + 1):\n dp[i][j] = min(dp[i][j], dp[i][j - 1] + nums[j - 1])\n dp[i][j + 1] = min(dp[i][j + 1], dp[i][j] + nums[i])\n return min(dp[0][i] + nums[0] for i in range(2, n + 1))", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[float('inf')] * (n + 2) for _ in range(n + 2)]\n\n for i in range(n - 1, -1, -1):\n dp[i][i] = 0\n for j in range(i + 1, n + 1):\n dp[i][j] = min(dp[i][j], dp[i][j - 1] + nums[i])\n dp[i][j] = min(dp[i][j], dp[i + 1][j] + nums[i])\n\n ans = float('inf')\n for i in range(n):\n ans = min(ans, dp[i][i] + dp[i + 1][i + 1] + dp[i + 2][n])\n\n return ans", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[float('inf')] * (n + 2) for _ in range(n + 2)]\n for i in range(n - 1, -1, -1):\n dp[i][i] = 0\n for j in range(i + 1, n + 1):\n dp[i][j] = min(dp[i][j], dp[i][j - 1] + nums[i])\n dp[i][j] = min(dp[i][j], dp[i + 1][j] + nums[i])\n return dp[0][n]", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[float('inf')] * (n + 2) for _ in range(n + 2)]\n for i in range(n - 1, -1, -1):\n dp[i][i] = 0\n for j in range(i + 1, n + 1):\n dp[i][j] = min(dp[i][j], dp[i][j - 1] + nums[i])\n dp[i][j] = min(dp[i][j], dp[i + 1][j] + nums[i])\n return dp[0][n]", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[float(\"inf\")] * (n + 2) for _ in range(n + 2)]\n for i in range(n - 1, -1, -1):\n dp[i][i] = 0\n for j in range(i + 1, n + 1):\n dp[i][j] = min(dp[i][j], dp[i][j - 1] + nums[i])\n dp[i][j] = min(dp[i][j], dp[i + 1][j] + nums[i])\n return dp[0][n]", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[float(\"inf\")] * (n + 2) for _ in range(n + 2)]\n for i in range(n - 1, -1, -1):\n dp[i][i] = 0\n for j in range(i + 1, n + 1):\n dp[i][j] = min(dp[i][j], dp[i][j - 1] + nums[i])\n dp[i][j] = min(dp[i][j], dp[i + 1][j] + nums[i])\n return dp[0][n]", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[float('inf')] * (n + 2) for _ in range(n + 2)]\n for i in range(n - 1, -1, -1):\n dp[i][i] = 0\n for j in range(i + 1, n + 1):\n dp[i][j] = min(dp[i][j], dp[i][j - 1] + nums[i])\n dp[i][j] = min(dp[i][j], dp[i + 1][j] + nums[i])\n return dp[0][n]", "class Solution:\n def minimumCost(self, nums: List[int]) -> int:\n n = len(nums)\n dp = [[float('inf')] * (n + 2) for _ in range(n + 2)]\n for i in range(n - 1, -1, -1):\n dp[i][i] = 0\n for j in range(i + 1, n + 1):\n dp[i][j] = min(dp[i][j], dp[i][j - 1] + nums[i])\n dp[i][j] = min(dp[i][j], dp[i + 1][j] + nums[i])\n return dp[0][n]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumSubarraySum(self, nums: List[int], k: int) -> int:\n left, right = 0, 0\n max_sum = 0\n current_sum = 0\n freq = {}\n\n while right < len(nums):\n current_sum += nums[right]\n\n if (nums[right] - k) in freq:\n max_sum = max(max_sum, current_sum - freq[(nums[right] - k)] + nums[right])\n\n if nums[right] in freq:\n freq[nums[right]] += 1\n else:\n freq[nums[right]] = 1\n\n while current_sum - nums[left] >= k:\n current_sum -= nums[left]\n left += 1\n\n max_sum = max(max_sum, current_sum)\n right += 1\n\n return max_sum", "class Solution:\n def maximumSubarraySum(self, nums: List[int], k: int) -> int:\n n = len(nums)\n max_sum = 0\n for i in range(n):\n for j in range(i + 1, n):\n if abs(nums[i] - nums[j]) == k:\n max_sum = max(max_sum, sum(nums[i:j+1]))\n return max_sum", "class Solution:\n def maximumSubarraySum(self, nums: List[int], k: int) -> int:\n left, right = 0, 0\n max_sum = 0\n current_sum = 0\n target_val = None\n target_found = False\n\n while right < len(nums):\n if target_found:\n current_sum += nums[right]\n right += 1\n if nums[right - 1] == target_val:\n target_found = False\n else:\n current_sum = nums[left] + nums[right]\n right += 1\n target_val = nums[left] + k\n target_found = True\n\n if abs(nums[left] - nums[right - 1]) == k:\n max_sum = max(max_sum, current_sum)\n\n if current_sum <= 0:\n current_sum = 0\n left = right\n\n return max_sum", "class Solution:\n def maximumSubarraySum(self, nums: List[int], k: int) -> int:\n left, right = 0, 0\n max_sum = 0\n current_sum = 0\n freq = {}\n\n while right < len(nums):\n current_sum += nums[right]\n\n if (nums[right] - k) in freq:\n max_sum = max(max_sum, current_sum - freq[(nums[right] - k)] + k)\n\n if nums[right] in freq:\n freq[nums[right]] += 1\n else:\n freq[nums[right]] = 1\n\n if right - left + 1 > k:\n current_sum -= nums[left]\n left += 1\n\n right += 1\n\n return max_sum", "class Solution:\n def maximumSubarraySum(self, nums: List[int], k: int) -> int:\n n = len(nums)\n max_sum = 0\n for i in range(n):\n for j in range(i + 1, n):\n if abs(nums[i] - nums[j]) == k:\n max_sum = max(max_sum, sum(nums[i:j+1]))\n return max_sum", "class Solution:\n def maximumSubarraySum(self, nums: List[int], k: int) -> int:\n n = len(nums)\n max_sum = 0\n for i in range(n):\n for j in range(i + 1, n):\n if abs(nums[i] - nums[j]) == k:\n max_sum = max(max_sum, sum(nums[i:j+1]))\n return max_sum", "class Solution:\n def maximumSubarraySum(self, nums: List[int], k: int) -> int:\n left, right = 0, 0\n max_sum = 0\n current_sum = 0\n mp = {}\n\n while right < len(nums):\n current_sum += nums[right]\n\n if (nums[right] - k) in mp:\n max_sum = max(max_sum, current_sum - mp[(nums[right] - k)])\n\n if nums[right] in mp:\n mp[nums[right]] += 1\n else:\n mp[nums[right]] = 1\n\n if current_sum <= 0:\n current_sum = 0\n left = right + 1\n mp = {}\n right += 1\n\n return max_sum", "class Solution:\n def maximumSubarraySum(self, nums: List[int], k: int) -> int:\n n = len(nums)\n max_sum = 0\n for i in range(n):\n for j in range(i + 1, n + 1):\n subarray = nums[i:j]\n if len(subarray) < 2:\n continue\n first = subarray[0]\n last = subarray[-1]\n if abs(first - last) == k:\n max_sum = max(max_sum, sum(subarray))\n return max_sum", "class Solution:\n def maximumSubarraySum(self, nums: List[int], k: int) -> int:\n left, right = 0, 0\n max_sum = 0\n current_sum = 0\n target_val = None\n mp = {}\n\n while right < len(nums):\n target_val = nums[right] - k\n if target_val in mp:\n while left < right and nums[left] != target_val:\n left += 1\n current_sum = mp[target_val] + nums[right]\n max_sum = max(max_sum, current_sum)\n mp[nums[right]] = mp.get(nums[right], 0) + nums[right]\n right += 1\n\n return max_sum", "class Solution:\n def maximumSubarraySum(self, nums: List[int], k: int) -> int:\n left, right = 0, 0\n max_sum = 0\n current_sum = 0\n target_val = None\n value_map = {}\n\n while right < len(nums):\n target_val = nums[right] - k\n if target_val in value_map:\n while left < right and nums[left] != target_val:\n left += 1\n if nums[left] == target_val:\n current_sum = value_map[target_val] + nums[right]\n max_sum = max(max_sum, current_sum)\n left += 1\n value_map[nums[right]] = value_map.get(nums[right], 0) + nums[right]\n current_sum += nums[right]\n max_sum = max(max_sum, current_sum)\n right += 1\n\n return max_sum" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumLength(self, s: str) -> int:\n count = {}\n for i in range(len(s) - 1):\n if s[i] == s[i + 1]:\n count[s[i]] = count.get(s[i], 0) + 1\n max_len = -1\n for key, value in count.items():\n if value >= 3:\n max_len = max(max_len, len(key) * value // (value // 2 + 1))\n return max_len", "class Solution:\n def maximumLength(self, s: str) -> int:\n count = {}\n for i in range(len(s) - 1):\n if s[i] == s[i + 1]:\n count[s[i]] = count.get(s[i], 0) + 1\n max_len = -1\n for key, value in count.items():\n if value >= 3:\n max_len = max(max_len, len(key) * value // (value // 2 + 1))\n return max_len", "class Solution:\n def maximumLength(self, s: str) -> int:\n count = {}\n for i in range(len(s) - 1):\n if s[i] == s[i + 1]:\n count[s[i]] = count.get(s[i], 0) + 1\n max_len = -1\n for key, value in count.items():\n if value >= 3:\n max_len = max(max_len, 2)\n return max_len", "class Solution:\n def maximumLength(self, s: str) -> int:\n count = {}\n for i in range(len(s) - 1):\n if s[i] == s[i + 1]:\n count[s[i]] = count.get(s[i], 0) + 1\n max_length = -1\n for char, value in count.items():\n if value >= 3:\n max_length = max(max_length, len(char) * value // 2, len(char) * (value - 1))\n return max_length", "class Solution:\n def maximumLength(self, s: str) -> int:\n count = {}\n for i in range(len(s) - 1):\n if s[i] == s[i + 1]:\n count[s[i:i + 2]] = count.get(s[i:i + 2], 0) + 1\n else:\n count[s[i]] = count.get(s[i], 0) + 1\n max_length = -1\n for key, value in count.items():\n if value >= 3:\n max_length = max(max_length, len(key))\n return max_length", "class Solution:\n def maximumLength(self, s: str) -> int:\n count = {}\n for i in range(len(s) - 1):\n if s[i] == s[i + 1]:\n count[s[i]] = count.get(s[i], 0) + 1\n max_length = -1\n for key, value in count.items():\n if value >= 3:\n max_length = max(max_length, len(key) * value // (value // (s[0] == key) + 1))\n return max_length", "class Solution:\n def maximumLength(self, s: str) -> int:\n count = {}\n for i in range(len(s) - 1):\n if s[i] == s[i + 1]:\n count[s[i]] = count.get(s[i], 0) + 1\n max_length = -1\n for key, value in count.items():\n if value >= 3:\n max_length = max(max_length, len(key) * value // (value // 2 + 1))\n return max_length", "class Solution:\n def maximumLength(self, s: str) -> int:\n count = {}\n for i in range(len(s) - 1):\n if s[i] == s[i + 1]:\n count[s[i]] = count.get(s[i], 0) + 1\n max_length = -1\n for key, value in count.items():\n if value >= 3:\n max_length = max(max_length, len(key) * value // (value // 2 + 1))\n return max_length", "class Solution:\n def maximumLength(self, s: str) -> int:\n count = {}\n for i in range(len(s) - 1):\n if s[i] == s[i + 1]:\n count[s[i]] = count.get(s[i], 0) + 1\n max_len = -1\n for key, value in count.items():\n if value >= 3:\n max_len = max(max_len, 1)\n return max_len", "class Solution:\n def maximumLength(self, s: str) -> int:\n count = {}\n for i in range(len(s) - 1):\n if s[i] == s[i + 1]:\n count[s[i]] = count.get(s[i], 0) + 1\n max_length = -1\n for key, value in count.items():\n if value >= 3:\n max_length = max(max_length, 2)\n return max_length" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countMatchingSubarrays(self, nums: List[int], pattern: List[int]) -> int:\n n, m = len(nums), len(pattern)\n count = 0\n for i in range(n - m):\n match = True\n for j in range(m):\n if pattern[j] == 1 and nums[i + j] >= nums[i + j + 1]:\n match = False\n break\n if pattern[j] == 0 and nums[i + j] != nums[i + j + 1]:\n match = False\n break\n if pattern[j] == -1 and nums[i + j] <= nums[i + j + 1]:\n match = False\n break\n if match:\n count += 1\n return count", "class Solution:\n def countMatchingSubarrays(self, nums: List[int], pattern: List[int]) -> int:\n n, m = len(nums), len(pattern)\n count = 0\n\n for i in range(n - m):\n match = True\n for j in range(m):\n if pattern[j] == 1 and nums[i + j] >= nums[i + j + 1]:\n match = False\n break\n if pattern[j] == 0 and nums[i + j] != nums[i + j + 1]:\n match = False\n break\n if pattern[j] == -1 and nums[i + j] <= nums[i + j + 1]:\n match = False\n break\n if match:\n count += 1\n\n return count", "class Solution:\n def countMatchingSubarrays(self, nums: List[int], pattern: List[int]) -> int:\n n, m = len(nums), len(pattern)\n count = 0\n for i in range(n - m):\n match = True\n for j in range(m):\n if pattern[j] == 1 and nums[i + j] >= nums[i + j + 1]:\n match = False\n break\n if pattern[j] == 0 and nums[i + j] != nums[i + j + 1]:\n match = False\n break\n if pattern[j] == -1 and nums[i + j] <= nums[i + j + 1]:\n match = False\n break\n if match:\n count += 1\n return count", "class Solution:\n def countMatchingSubarrays(self, nums: List[int], pattern: List[int]) -> int:\n n, m = len(nums), len(pattern)\n count = 0\n for i in range(n - m):\n match = True\n for j in range(m):\n if pattern[j] == 1 and nums[i + j] >= nums[i + j + 1]:\n match = False\n break\n if pattern[j] == 0 and nums[i + j] != nums[i + j + 1]:\n match = False\n break\n if pattern[j] == -1 and nums[i + j] <= nums[i + j + 1]:\n match = False\n break\n if match:\n count += 1\n return count", "class Solution:\n def countMatchingSubarrays(self, nums: List[int], pattern: List[int]) -> int:\n n, m = len(nums), len(pattern)\n count = 0\n for i in range(n - m):\n match = True\n for j in range(m):\n if pattern[j] == 1 and nums[i + j] >= nums[i + j + 1]:\n match = False\n break\n if pattern[j] == 0 and nums[i + j] != nums[i + j + 1]:\n match = False\n break\n if pattern[j] == -1 and nums[i + j] <= nums[i + j + 1]:\n match = False\n break\n if match:\n count += 1\n return count", "class Solution:\n def countMatchingSubarrays(self, nums: List[int], pattern: List[int]) -> int:\n n, m = len(nums), len(pattern)\n count = 0\n for i in range(n - m):\n match = True\n for j in range(m):\n if pattern[j] == 1 and nums[i + j] >= nums[i + j + 1]:\n match = False\n break\n if pattern[j] == 0 and nums[i + j] != nums[i + j + 1]:\n match = False\n break\n if pattern[j] == -1 and nums[i + j] <= nums[i + j + 1]:\n match = False\n break\n if match:\n count += 1\n return count", "class Solution:\n def countMatchingSubarrays(self, nums: List[int], pattern: List[int]) -> int:\n n, m = len(nums), len(pattern)\n count = 0\n for i in range(n - m):\n match = True\n for j in range(m):\n if pattern[j] == 1 and nums[i + j] >= nums[i + j + 1]:\n match = False\n break\n if pattern[j] == 0 and nums[i + j] != nums[i + j + 1]:\n match = False\n break\n if pattern[j] == -1 and nums[i + j] <= nums[i + j + 1]:\n match = False\n break\n if match:\n count += 1\n return count", "class Solution:\n def countMatchingSubarrays(self, nums: List[int], pattern: List[int]) -> int:\n n, m = len(nums), len(pattern)\n count = 0\n for i in range(n - m):\n match = True\n for j in range(m):\n if pattern[j] == 1 and nums[i + j] >= nums[i + j + 1]:\n match = False\n break\n if pattern[j] == 0 and nums[i + j] != nums[i + j + 1]:\n match = False\n break\n if pattern[j] == -1 and nums[i + j] <= nums[i + j + 1]:\n match = False\n break\n if match:\n count += 1\n return count", "class Solution:\n def countMatchingSubarrays(self, nums: List[int], pattern: List[int]) -> int:\n n, m = len(nums), len(pattern)\n count = 0\n for i in range(n - m):\n match = True\n for j in range(m):\n if pattern[j] == 1 and nums[i + j] >= nums[i + j + 1]:\n match = False\n break\n if pattern[j] == 0 and nums[i + j] != nums[i + j + 1]:\n match = False\n break\n if pattern[j] == -1 and nums[i + j] <= nums[i + j + 1]:\n match = False\n break\n if match:\n count += 1\n return count", "class Solution:\n def countMatchingSubarrays(self, nums: List[int], pattern: List[int]) -> int:\n n, m = len(nums), len(pattern)\n count = 0\n for i in range(n - m):\n match = True\n for j in range(m):\n if pattern[j] == 1 and nums[i + j] >= nums[i + j + 1]:\n match = False\n break\n if pattern[j] == 0 and nums[i + j] != nums[i + j + 1]:\n match = False\n break\n if pattern[j] == -1 and nums[i + j] <= nums[i + j + 1]:\n match = False\n break\n if match:\n count += 1\n return count" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def flowerGame(self, n: int, m: int) -> int:\n if n == 1 and m == 1:\n return 0\n if n == 1:\n return m\n if m == 1:\n return n\n return n * m - (n - 1) * (m - 1) // 2", "class Solution:\n def flowerGame(self, n: int, m: int) -> int:\n if n == 1 and m == 1:\n return 0\n if n == 1:\n return m\n if m == 1:\n return n\n return n * m - (n - 1) * (m - 1) // 2", "class Solution:\n def flowerGame(self, n: int, m: int) -> int:\n if n == 1 and m == 1:\n return 0\n if n == 1:\n return m\n if m == 1:\n return n\n return n * m - (n - 1) * (m - 1) // 2", "class Solution:\n def flowerGame(self, n: int, m: int) -> int:\n if n == 1 and m == 1:\n return 0\n if n == 1:\n return m\n if m == 1:\n return n\n return n * m - (n - 1) * (m - 1) // 2", "class Solution:\n def flowerGame(self, n: int, m: int) -> int:\n if n == 1 and m == 1:\n return 0\n if n == 1:\n return m\n if m == 1:\n return n\n return n * m - (n - 1) * (m - 1) // 2", "class Solution:\n def flowerGame(self, n: int, m: int) -> int:\n if n == 1 and m == 1:\n return 0\n if n == 1:\n return m\n if m == 1:\n return n\n return n * m - (n - 1) * (m - 1) // 2", "class Solution:\n def flowerGame(self, n: int, m: int) -> int:\n if n == 1 and m == 1:\n return 0\n if n == 1:\n return m\n if m == 1:\n return n\n return n * m - (n - 1) * (m - 1) // 2", "class Solution:\n def flowerGame(self, n: int, m: int) -> int:\n if n == 1 and m == 1:\n return 0\n if n == 1:\n return m\n if m == 1:\n return n\n return n * m - (n - 1) * (m - 1) // 2", "class Solution:\n def flowerGame(self, n: int, m: int) -> int:\n if n == 1 and m == 1:\n return 0\n if n == 1:\n return m\n if m == 1:\n return n\n return n * m - (n - 1) * (m - 1) // 2", "class Solution:\n def flowerGame(self, n: int, m: int) -> int:\n if n == 1 and m == 1:\n return 0\n if n == 1:\n return m\n if m == 1:\n return n\n return n * m - (n - 1) * (m - 1) // 2" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def canSortArray(self, nums: List[int]) -> bool:\n def count_set_bits(n):\n count = 0\n while n:\n count += n & 1\n n >>= 1\n return count\n\n groups = {}\n for num in nums:\n bit_count = count_set_bits(num)\n if bit_count not in groups:\n groups[bit_count] = []\n groups[bit_count].append(num)\n\n for bit_count in sorted(groups.keys()):\n groups[bit_count].sort(reverse=True)\n\n sorted_nums = []\n for bit_count in sorted(groups.keys()):\n sorted_nums.extend(groups[bit_count])\n\n return sorted_nums == sorted(nums)", "class Solution:\n def canSortArray(self, nums: List[int]) -> bool:\n def count_set_bits(n):\n count = 0\n while n:\n count += n & 1\n n >>= 1\n return count\n\n sorted_nums = sorted(nums)\n for i in range(len(nums) - 1):\n if count_set_bits(nums[i]) != count_set_bits(nums[i + 1]) and count_set_bits(sorted_nums[i]) != count_set_bits(sorted_nums[i + 1]):\n return False\n return True", "class Solution:\n def canSortArray(self, nums: List[int]) -> bool:\n def count_set_bits(n):\n count = 0\n while n:\n count += n & 1\n n >>= 1\n return count\n\n sorted_nums = sorted(nums)\n for i in range(len(nums) - 1):\n if count_set_bits(nums[i]) != count_set_bits(nums[i + 1]) and nums[i] > nums[i + 1]:\n return False\n if count_set_bits(nums[i]) != count_set_bits(sorted_nums[i]) or count_set_bits(nums[i + 1]) != count_set_bits(sorted_nums[i + 1]):\n return False\n return True", "class Solution:\n def canSortArray(self, nums: List[int]) -> bool:\n def count_set_bits(n):\n count = 0\n while n:\n count += n & 1\n n >>= 1\n return count\n \n sorted_nums = sorted(nums)\n for i in range(len(nums) - 1):\n if count_set_bits(nums[i]) != count_set_bits(nums[i + 1]) and nums[i] > nums[i + 1]:\n return False\n return True", "class Solution:\n def canSortArray(self, nums: List[int]) -> bool:\n def count_set_bits(n):\n count = 0\n while n:\n count += n & 1\n n >>= 1\n return count\n \n sorted_nums = sorted(nums)\n for i in range(len(nums) - 1):\n if count_set_bits(nums[i]) != count_set_bits(nums[i + 1]) and nums[i] > nums[i + 1]:\n return False\n if count_set_bits(sorted_nums[i]) != count_set_bits(sorted_nums[i + 1]) and sorted_nums[i] < sorted_nums[i + 1]:\n return False\n return True", "class Solution:\n def canSortArray(self, nums: List[int]) -> bool:\n def count_set_bits(num):\n count = 0\n while num:\n count += num & 1\n num >>= 1\n return count\n\n sorted_nums = sorted(nums)\n for i in range(len(nums) - 1):\n if count_set_bits(nums[i]) != count_set_bits(nums[i + 1]) and nums[i] > nums[i + 1]:\n return False\n return True", "class Solution:\n def canSortArray(self, nums: List[int]) -> bool:\n def count_set_bits(num):\n count = 0\n while num:\n count += num & 1\n num >>= 1\n return count\n\n sorted_nums = sorted(nums)\n for i in range(len(nums) - 1):\n if count_set_bits(nums[i]) != count_set_bits(nums[i + 1]) and nums[i] > nums[i + 1]:\n return False\n return True", "class Solution:\n def canSortArray(self, nums: List[int]) -> bool:\n def count_set_bits(n):\n count = 0\n while n:\n count += n & 1\n n >>= 1\n return count\n\n sorted_nums = sorted(nums)\n for i in range(len(nums) - 1):\n if count_set_bits(nums[i]) != count_set_bits(nums[i + 1]) and nums[i] != sorted_nums[i]:\n return False\n return True", "class Solution:\n def canSortArray(self, nums: List[int]) -> bool:\n def count_set_bits(n):\n count = 0\n while n:\n count += n & 1\n n >>= 1\n return count\n \n sorted_nums = sorted(nums)\n for i in range(len(nums)):\n if count_set_bits(nums[i]) != count_set_bits(sorted_nums[i]):\n return False\n return True", "class Solution:\n def canSortArray(self, nums: List[int]) -> bool:\n def count_set_bits(n):\n count = 0\n while n:\n count += n & 1\n n >>= 1\n return count\n \n sorted_nums = sorted(nums)\n for i in range(len(nums) - 1):\n if count_set_bits(nums[i]) != count_set_bits(nums[i + 1]) and nums[i] != sorted_nums[i]:\n return False\n return True" ], "pass1_list": [ false, false, true, false, false, false, false, false, true, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def earliestSecondToMarkIndices(self, nums: List[int], changeIndices: List[int]) -> int:\n n, m = len(nums), len(changeIndices)\n marked = [False] * n\n steps = 0\n\n for i in range(m):\n index = changeIndices[i]\n if nums[index] > 0:\n nums[index] -= 1\n elif not marked[index]:\n marked[index] = True\n steps += 1\n\n for i in range(n):\n if not marked[i]:\n return -1\n\n return steps", "class Solution:\n def earliestSecondToMarkIndices(self, nums: List[int], changeIndices: List[int]) -> int:\n n, m = len(nums), len(changeIndices)\n marked = [False] * n\n steps = 0\n\n for s in range(m):\n i = changeIndices[s] - 1\n if nums[i] > 0:\n nums[i] -= 1\n elif not marked[i]:\n marked[i] = True\n steps += 1\n\n if all(marked):\n return s + 1\n\n if all(marked):\n return m\n else:\n return -1", "class Solution:\n def earliestSecondToMarkIndices(self, nums: List[int], changeIndices: List[int]) -> int:\n n, m = len(nums), len(changeIndices)\n marked = [False] * n\n steps = 0\n\n for s in range(m):\n i = changeIndices[s] - 1\n if nums[i] > 0:\n nums[i] -= 1\n elif not marked[i]:\n marked[i] = True\n steps += 1\n\n return m if all(marked) else -1", "class Solution:\n def earliestSecondToMarkIndices(self, nums: List[int], changeIndices: List[int]) -> int:\n n, m = len(nums), len(changeIndices)\n marked = [False] * n\n steps = 0\n\n for i in range(m):\n if not marked[changeIndices[i] - 1]:\n nums[changeIndices[i] - 1] -= 1\n if nums[changeIndices[i] - 1] == 0:\n marked[changeIndices[i] - 1] = True\n for j in range(n):\n if not marked[j]:\n return -1\n steps += 1\n\n return steps", "class Solution:\n def earliestSecondToMarkIndices(self, nums: List[int], changeIndices: List[int]) -> int:\n n, m = len(nums), len(changeIndices)\n marked = [False] * n\n steps = 0\n\n for s in range(m):\n i = changeIndices[s] - 1\n if nums[i] > 0:\n nums[i] -= 1\n elif not marked[i]:\n marked[i] = True\n steps += 1\n\n if all(marked):\n return s + 1\n\n for i in range(n):\n if not marked[i]:\n return -1\n\n return steps", "class Solution:\n def earliestSecondToMarkIndices(self, nums: List[int], changeIndices: List[int]) -> int:\n n, m = len(nums), len(changeIndices)\n marked = [False] * (n + 1)\n seconds = 0\n\n for s in changeIndices:\n if not marked[s]:\n nums[s - 1] -= 1\n if nums[s - 1] == 0:\n marked[s] = True\n for i in range(1, n + 1):\n if not marked[i]:\n return -1\n seconds += 1\n\n return seconds", "class Solution:\n def earliestSecondToMarkIndices(self, nums: List[int], changeIndices: List[int]) -> int:\n n, m = len(nums), len(changeIndices)\n marked = [False] * n\n steps = 0\n\n for i in range(m):\n index = changeIndices[i]\n if nums[index] > 0:\n nums[index] -= 1\n elif not marked[index]:\n marked[index] = True\n steps += 1\n\n if all(marked):\n return steps + 1\n\n if all(marked):\n return m\n else:\n return -1", "class Solution:\n def earliestSecondToMarkIndices(self, nums: List[int], changeIndices: List[int]) -> int:\n n, m = len(nums), len(changeIndices)\n marked = [False] * n\n steps = 0\n\n for s in range(m):\n i = changeIndices[s] - 1\n if nums[i] > 0:\n nums[i] -= 1\n elif not marked[i]:\n marked[i] = True\n steps += 1\n\n if all(marked):\n return s + 1\n\n return -1 if all(marked) else m + 1", "class Solution:\n def earliestSecondToMarkIndices(self, nums: List[int], changeIndices: List[int]) -> int:\n n, m = len(nums), len(changeIndices)\n marked = [False] * n\n steps = 0\n\n for s in range(m):\n i = changeIndices[s] - 1\n if nums[i] > 0:\n nums[i] -= 1\n elif not marked[i]:\n marked[i] = True\n steps += 1\n\n if all(marked):\n return s + 1\n\n if all(marked):\n return m\n else:\n return -1", "class Solution:\n def earliestSecondToMarkIndices(self, nums: List[int], changeIndices: List[int]) -> int:\n n, m = len(nums), len(changeIndices)\n marked = [False] * n\n steps = 0\n\n for s in range(m):\n i = changeIndices[s] - 1\n if nums[i] > 0:\n nums[i] -= 1\n elif not marked[i]:\n marked[i] = True\n steps += 1\n\n if all(marked):\n return s + 1\n\n for i in range(n):\n if not marked[i]:\n return -1\n\n return steps" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumTimeToInitialState(self, word: str, k: int) -> int:\n # Initialize the time counter and the current word\n time, current = 0, word\n \n # Keep looping until the current word becomes equal to the original word\n while current != word:\n # Increment the time counter\n time += 1\n \n # Remove the first k characters from the current word\n current = current[k:]\n \n # Add k characters from the end of the original word to the current word\n current += word[:k]\n \n # Return the time counter as the minimum time required\n return time", "class Solution:\n def minimumTimeToInitialState(self, word: str, k: int) -> int:\n n = len(word)\n time = n // k\n if n % k != 0:\n time += 1\n word = word[n-k:] + word[:n-k]\n for i in range(time):\n word = word[k:] + word[:k]\n if word == word[k:]:\n return i + 1\n return time", "class Solution:\n def minimumTimeToInitialState(self, word: str, k: int) -> int:\n n = len(word)\n time = n // k\n if n % k != 0:\n time += 1\n word = word[n-k:] + word[:n-k]\n for _ in range(time):\n word = word[k:] + word[:k]\n if word == word[:k] + word[k:] + word[:k] + word[2*k:]:\n return time\n return time + 1", "class Solution:\n def minimumTimeToInitialState(self, word: str, k: int) -> int:\n n = len(word)\n time = n // k\n if n % k != 0:\n time += 1\n word = word[n-k:] + word[:n-k]\n for _ in range(time):\n word = word[k:] + word[:k]\n if word == word[:k]:\n return time\n return -1", "class Solution:\n def minimumTimeToInitialState(self, word: str, k: int) -> int:\n n = len(word)\n time = n // k\n if n % k != 0:\n time += 1\n word = word[n - k:] + word[:n - k]\n for i in range(time):\n word = word[k:] + word[:k]\n if word == word[:k] + word[k:] + word[:k]:\n return i + 1\n return time", "class Solution:\n def minimumTimeToInitialState(self, word: str, k: int) -> int:\n # Initialize the time required to revert word to its initial state\n time = 0\n \n # Keep processing until word reverts to its initial state\n while word != word[k:]:\n # Remove the first k characters of word\n word = word[k:]\n # Add k characters to the end of word\n word += word[:k]\n # Increment the time\n time += 1\n \n # Return the minimum time required for word to revert to its initial state\n return time", "class Solution:\n def minimumTimeToInitialState(self, word: str, k: int) -> int:\n seen = set()\n time = 0\n while True:\n time += 1\n new_word = word[-k:] + word[:-k]\n if new_word == word:\n break\n if new_word in seen:\n break\n seen.add(word)\n word = new_word\n return time - 1", "class Solution:\n def minimumTimeToInitialState(self, word: str, k: int) -> int:\n n = len(word)\n time = n // k\n if n % k != 0:\n time += 1\n word = word[n-k:] + word[:n-k]\n for i in range(time):\n word = word[k:] + word[:k]\n if word == word[:k] + word[k:] + word[:k]:\n return i + 1\n return time", "class Solution:\n def minimumTimeToInitialState(self, word: str, k: int) -> int:\n n = len(word)\n time = n // k\n if n % k != 0:\n time += 1\n word = word[n-k:] + word[:n-k]\n for _ in range(time):\n word = word[k:] + word[:k]\n if word == word[:k] + word[k:] and word == word[::-1]:\n return time\n return time + 1", "class Solution:\n def minimumTimeToInitialState(self, word: str, k: int) -> int:\n n = len(word)\n time = n // k\n if n % k != 0:\n time += 1\n word = word[-k:] + word[:-k]\n for _ in range(time):\n word = word[-k:] + word[:-k]\n if word == word[-k:] + word[:-k]:\n return time" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxSelectedElements(self, nums: List[int]) -> int:\n left, right = 0, 1\n max_len = 1\n min_val = nums[0]\n max_val = nums[0] + 1\n\n for i in range(1, len(nums)):\n if nums[i] <= max_val:\n max_val = max(max_val, nums[i] + 1)\n min_val = min(min_val, nums[i])\n right = i + 1\n max_len = max(max_len, right - left)\n elif nums[i] == max_val + 1:\n left = right\n right = i + 1\n min_val = nums[i]\n max_val = nums[i] + 1\n max_len = max(max_len, right - left)\n\n return max_len", "class Solution:\n def maxSelectedElements(self, nums: List[int]) -> int:\n nums.sort()\n dp = [1] * len(nums)\n for i in range(1, len(nums)):\n if nums[i] - nums[i - 1] == 1:\n dp[i] = dp[i - 1] + 1\n elif nums[i] - nums[i - 1] == 0:\n dp[i] = 2\n else:\n dp[i] = 1\n return max(dp)", "class Solution:\n def maxSelectedElements(self, nums: List[int]) -> int:\n left, right = 0, 1\n max_length = 0\n while right < len(nums):\n if nums[right] - nums[left] <= right - left:\n max_length = max(max_length, right - left + 1)\n right += 1\n else:\n left += 1\n return max_length", "class Solution:\n def maxSelectedElements(self, nums: List[int]) -> int:\n left, right = 0, 1\n max_len = 1\n min_val = nums[0]\n max_val = nums[0]\n\n for i in range(1, len(nums)):\n if nums[i] == min_val or nums[i] == max_val + 1:\n left, min_val = i, min(min_val, nums[i])\n elif nums[i] == min_val + 1 or nums[i] == max_val:\n right, max_val = i, max(max_val, nums[i])\n\n max_len = max(max_len, right - left + 1)\n\n return max_len", "class Solution:\n def maxSelectedElements(self, nums: List[int]) -> int:\n left, right = 0, 1\n max_len = 1\n min_val = nums[0]\n max_val = nums[0]\n\n for i in range(1, len(nums)):\n if nums[i] == min_val + 1 or nums[i] == max_val + 1:\n min_val = min(min_val, nums[i])\n max_val = max(max_val, nums[i])\n left, right = i, i + 1\n max_len = max(max_len, right - left + 1)\n elif nums[i] <= min_val:\n min_val = nums[i]\n left = i\n elif nums[i] >= max_val + 1:\n max_val = nums[i]\n right = i\n\n return max_len", "class Solution:\n def maxSelectedElements(self, nums: List[int]) -> int:\n left, right = min(nums), max(nums)\n count = 0\n while left <= right:\n mid = (left + right) // 2\n temp_count = 0\n for num in nums:\n if num > mid:\n temp_count += 1\n elif num == mid:\n temp_count += 1\n else:\n temp_count = 1\n count = max(count, temp_count)\n if temp_count < count:\n right = mid - 1\n else:\n left = mid + 1\n return count", "class Solution:\n def maxSelectedElements(self, nums: List[int]) -> int:\n min_val = min(nums)\n nums = [num - min_val for num in nums]\n\n dp = [1] * len(nums)\n for i in range(1, len(nums)):\n for j in range(i):\n if nums[i] - nums[j] == 1:\n dp[i] = max(dp[i], dp[j] + 1)\n\n return max(dp)", "class Solution:\n def maxSelectedElements(self, nums: List[int]) -> int:\n left, right = min(nums), max(nums)\n count = 0\n while left <= right:\n mid = left + (right - left) // 2\n temp = 0\n for num in nums:\n if num <= mid:\n temp += 1\n if num + 1 <= mid:\n temp += 1\n count = max(count, temp)\n if temp == len(nums):\n break\n if temp > len(nums) // 2:\n left = mid + 1\n else:\n right = mid - 1\n return count", "class Solution:\n def maxSelectedElements(self, nums: List[int]) -> int:\n left, right = min(nums), max(nums)\n count = 0\n while left <= right:\n mid = left + (right - left) // 2\n temp = [num for num in nums if num <= mid]\n temp.sort()\n if all(temp[i] == i for i in range(len(temp))):\n count = len(temp)\n left = mid + 1\n else:\n right = mid - 1\n return count", "class Solution:\n def maxSelectedElements(self, nums: List[int]) -> int:\n min_val = min(nums)\n nums = [num - min_val for num in nums]\n nums.sort()\n max_length = 1\n current_length = 1\n\n for i in range(1, len(nums)):\n if nums[i] == nums[i - 1] + 1:\n current_length += 1\n else:\n max_length = max(max_length, current_length)\n current_length = 1\n\n return max(max_length, current_length)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumLength(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num**2, 0) + 1\n count[num**4] = count.get(num**4, 0) - 1\n \n max_len = 0\n for num, freq in count.items():\n max_len = max(max_len, freq)\n \n return max_len * 2 + 1 if max_len > 0 else 0", "class Solution:\n def maximumLength(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num**2, 0) + 1\n count[num**4] = count.get(num**4, 0) - 1\n \n max_len = 0\n for num, freq in count.items():\n max_len = max(max_len, freq * 2 + 1)\n \n return max_len", "class Solution:\n def maximumLength(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num**2, 0) + 1\n count[num**4] = count.get(num**4, 0) - 1\n \n max_len = 0\n for num, freq in count.items():\n max_len = max(max_len, freq)\n \n return max_len * 2 + 1", "class Solution:\n def maximumLength(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num**2, 0) + 1\n count[num**4] = count.get(num**4, 0) - 1\n \n max_len = 0\n for num, freq in count.items():\n max_len = max(max_len, freq)\n \n return max_len * 2 + 1 if max_len > 0 else 0", "class Solution:\n def maximumLength(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num**2, 0) + 1\n count[num**4] = max(count.get(num**4, 0), count[num] - count.get(num**2, 0))\n count[num**8] = max(count.get(num**8, 0), count[num] - count.get(num**4, 0))\n for i in range(12, 30, 2):\n count[num**i] = max(count.get(num**i, 0), count[num**i-4] + count[num**i-2] - count[num**i-6])\n\n return max(count.values()) + 1", "class Solution:\n def maximumLength(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num**2, 0) + 1\n count[num**4] = max(count.get(num**4, 0), count[num] - 1)\n count[num**8] = max(count.get(num**8, 0), count[num**4] - 1)\n power = 16\n while num**power in count:\n count[num**power] = max(count[num**power], count[num**power//2] - 1)\n power *= 2\n\n return max(count.values()) + 1", "class Solution:\n def maximumLength(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num, 0) + 1\n count[num**2] = count.get(num**2, 0) - 1\n \n ans = 0\n for num, c in count.items():\n ans = max(ans, c)\n count[num**0.5] = max(count.get(int(num**0.5), 0) - c, 0)\n \n return ans + 1", "class Solution:\n def maximumLength(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num**2, 0) + 1\n count[num**4] = max(count.get(num**4, 0), count[num] - 1)\n count[num**8] = max(count.get(num**8, 0), count[num] - 1)\n temp = num\n while temp**2 in count:\n count[temp**2] = max(count[temp**2], count[temp])\n temp *= 2\n\n ans = 0\n for val in count.values():\n ans = max(ans, val * 2 + 1)\n\n return ans", "class Solution:\n def maximumLength(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num**2, 0) + 1\n count[num**4] = count.get(num**4, 0) - 1\n \n max_len = 0\n for num, freq in count.items():\n max_len = max(max_len, freq)\n \n return max_len * 2 + 1", "class Solution:\n def maximumLength(self, nums: List[int]) -> int:\n count = {}\n for num in nums:\n count[num] = count.get(num**2, 0) + 1\n count[num**4] = count.get(num**4, 0) - 1\n \n max_len = 0\n for num, freq in count.items():\n max_len = max(max_len, freq + count.get(num**2, 0))\n \n return max_len + 1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def unmarkedSumArray(self, nums: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums)\n marked = [False] * n\n unmarked_sum = sum(nums)\n min_heap = []\n answer = []\n\n for query in queries:\n index, k = query\n if not marked[index]:\n marked[index] = True\n unmarked_sum -= nums[index]\n\n while k > 0 and min_heap:\n val = min_heap.pop()\n if not marked[val]:\n marked[val] = True\n unmarked_sum -= nums[val]\n k -= 1\n\n for i in range(n):\n if not marked[i]:\n min_heap.append(i)\n min_heap.sort(key=lambda x: (nums[x], x))\n\n answer.append(unmarked_sum)\n\n return answer", "class Solution:\n def unmarkedSumArray(self, nums: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums)\n marked = [False] * n\n unmarked_sum = sum(nums)\n min_heap = []\n answer = []\n\n for query in queries:\n index, k = query\n if not marked[index]:\n marked[index] = True\n unmarked_sum -= nums[index]\n heapq.heappush(min_heap, nums[index])\n\n while k > 0 and min_heap:\n val = heapq.heappop(min_heap)\n if not marked[nums.index(val)]:\n marked[nums.index(val)] = True\n unmarked_sum -= val\n k -= 1\n\n answer.append(unmarked_sum)\n\n return answer", "class Solution:\n def unmarkedSumArray(self, nums: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums)\n marked = [False] * n\n unmarked_sum = sum(nums)\n min_heap = []\n answer = []\n\n for query in queries:\n index, k = query\n if not marked[index]:\n marked[index] = True\n unmarked_sum -= nums[index]\n\n while k > 0 and min_heap:\n val = min_heap.pop(0)\n if not marked[val]:\n marked[val] = True\n unmarked_sum -= nums[val]\n k -= 1\n\n for i in range(n):\n if not marked[i]:\n min_heap.append(i)\n min_heap.sort(key=lambda x: nums[x])\n\n answer.append(unmarked_sum)\n\n return answer", "class Solution:\n def unmarkedSumArray(self, nums: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums)\n marked = [False] * n\n unmarked_sum = sum(nums)\n min_heap = []\n answer = []\n\n for query in queries:\n index, k = query\n if not marked[index]:\n marked[index] = True\n unmarked_sum -= nums[index]\n heapq.heappush(min_heap, nums[index])\n\n while k > 0 and min_heap:\n val = heapq.heappop(min_heap)\n if not marked[nums.index(val)]:\n marked[nums.index(val)] = True\n unmarked_sum -= val\n k -= 1\n\n answer.append(unmarked_sum)\n\n return answer", "class Solution:\n def unmarkedSumArray(self, nums: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums)\n marked = [False] * n\n unmarked_sum = sum(nums)\n min_heap = []\n answer = []\n\n for query in queries:\n index, k = query\n if not marked[index]:\n marked[index] = True\n unmarked_sum -= nums[index]\n\n while k > 0 and min_heap:\n val = min_heap.pop()\n if not marked[val]:\n marked[val] = True\n unmarked_sum -= nums[val]\n k -= 1\n\n if k > 0:\n for i in range(n):\n if not marked[i]:\n min_heap.append(i)\n min_heap.sort(key=lambda x: (nums[x], x))\n k -= 1\n\n answer.append(unmarked_sum)\n\n return answer", "class Solution:\n def unmarkedSumArray(self, nums: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums)\n marked = [False] * n\n unmarked_sum = sum(nums)\n min_heap = []\n answer = []\n\n for query in queries:\n index, k = query\n if not marked[index]:\n unmarked_sum -= nums[index]\n marked[index] = True\n heapq.heappush(min_heap, nums[index])\n\n for _ in range(k):\n if min_heap:\n unmarked_sum -= heapq.heappop(min_heap)\n\n answer.append(unmarked_sum)\n\n return answer", "class Solution:\n def unmarkedSumArray(self, nums: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums)\n marked = [False] * n\n unmarked_sum = sum(nums)\n min_heap = []\n answer = []\n\n for query in queries:\n index, k = query\n if not marked[index]:\n marked[index] = True\n unmarked_sum -= nums[index]\n\n while k > 0 and min_heap:\n val = heappop(min_heap)\n if not marked[val]:\n marked[val] = True\n unmarked_sum -= nums[val]\n k -= 1\n\n for i in range(n):\n if not marked[i]:\n heappush(min_heap, i)\n\n answer.append(unmarked_sum)\n\n return answer", "class Solution:\n def unmarkedSumArray(self, nums: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums)\n marked = [False] * n\n unmarked_sum = sum(nums)\n min_heap = []\n answer = []\n\n for query in queries:\n index, k = query\n if not marked[index]:\n marked[index] = True\n unmarked_sum -= nums[index]\n\n while k > 0 and min_heap:\n val = min_heap.pop()\n if not marked[val]:\n marked[val] = True\n unmarked_sum -= nums[val]\n k -= 1\n\n if k > 0:\n for i in range(n):\n if not marked[i]:\n min_heap.append(i)\n min_heap.sort(key=lambda x: (nums[x], x))\n k -= 1\n\n answer.append(unmarked_sum)\n\n return answer", "class Solution:\n def unmarkedSumArray(self, nums: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums)\n marked = [False] * n\n unmarked_sum = sum(nums)\n min_heap = []\n answer = []\n\n for query in queries:\n index, k = query\n if not marked[index]:\n unmarked_sum -= nums[index]\n marked[index] = True\n heapq.heappush(min_heap, nums[index])\n\n while k > 0 and min_heap:\n val = heapq.heappop(min_heap)\n if not marked[nums.index(val)]:\n unmarked_sum -= val\n marked[nums.index(val)] = True\n k -= 1\n\n answer.append(unmarked_sum)\n\n return answer", "class Solution:\n def unmarkedSumArray(self, nums: List[int], queries: List[List[int]]) -> List[int]:\n n = len(nums)\n marked = [False] * n\n unmarked_sum = sum(nums)\n min_heap = []\n answer = []\n\n for query in queries:\n index, k = query\n if not marked[index]:\n unmarked_sum -= nums[index]\n marked[index] = True\n min_heap.append(nums[index])\n heapq.heapify(min_heap)\n\n for _ in range(k):\n if min_heap:\n unmarked_sum -= heapq.heappop(min_heap)\n\n answer.append(unmarked_sum)\n\n return answer" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def lastNonEmptyString(self, s: str) -> str:\n last_str = \"\"\n for char in reversed(s):\n if char not in last_str:\n last_str = char + last_str\n return last_str", "class Solution:\n def lastNonEmptyString(self, s: str) -> str:\n # Create a set of unique characters in the string\n unique_chars = set(s)\n # Initialize a string to store the result\n result = \"\"\n # Iterate through the unique characters\n for char in unique_chars:\n # Find the index of the first occurrence of the character\n index = s.find(char)\n # If the character is in the string\n if index != -1:\n # Append the character at that index to the result\n result += s[index]\n # Remove the character from the string\n s = s[:index] + s[index + 1:]\n return result", "class Solution:\n def lastNonEmptyString(self, s: str) -> str:\n last = \"\"\n for c in reversed(s):\n if c not in last:\n last = c + last\n return last", "class Solution:\n def lastNonEmptyString(self, s: str) -> str:\n # Create a set of unique characters in the string\n unique_chars = set(s)\n # Initialize a result string\n result = \"\"\n # Iterate through the unique characters\n for char in unique_chars:\n # If the character is in the string, append it to the result\n if char in s:\n result += char\n # Return the result string\n return result", "class Solution:\n def lastNonEmptyString(self, s: str) -> str:\n # Create a set of unique characters in the string\n unique_chars = set(s)\n # Initialize a string to store the result\n result = \"\"\n # Iterate through the unique characters\n for char in unique_chars:\n # Find the index of the first occurrence of the character\n index = s.find(char)\n # If the character is found\n if index != -1:\n # Add the character to the result\n result += char\n # Remove the character from the string\n s = s[index + 1:]\n return result", "class Solution:\n def lastNonEmptyString(self, s: str) -> str:\n alphabet = set('abcdefghijklmnopqrstuvwxyz')\n result = []\n for char in s:\n if char not in alphabet:\n result.append(char)\n alphabet.add(char)\n return \"\".join(result)", "class Solution:\n def lastNonEmptyString(self, s: str) -> str:\n stack = []\n for c in s:\n if not stack or stack[-1] != c:\n stack.append(c)\n else:\n stack.pop()\n return \"\".join(stack)", "class Solution:\n def lastNonEmptyString(self, s: str) -> str:\n count = {}\n for c in s:\n if c not in count:\n count[c] = 1\n else:\n count[c] += 1\n\n res = \"\"\n for c in \"abcdefghijklmnopqrstuvwxyz\":\n if c in count and count[c] > 0:\n res += c\n count[c] -= 1\n\n return res", "class Solution:\n def lastNonEmptyString(self, s: str) -> str:\n # Create a set containing all unique characters in s\n unique_chars = set(s)\n # Initialize a string to store the result\n result = \"\"\n # Iterate through the unique characters\n for char in unique_chars:\n # Find the index of the first occurrence of the character in s\n index = s.find(char)\n # If the character is found\n if index != -1:\n # Add the character to the result\n result += char\n # Remove the first occurrence of the character from s\n s = s[index + 1 :]\n # Return the result\n return result", "class Solution:\n def lastNonEmptyString(self, s: str) -> str:\n alphabet = set('abcdefghijklmnopqrstuvwxyz')\n result = []\n for char in s:\n if char not in alphabet:\n result.append(char)\n alphabet.add(char)\n return \"\".join(result)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countPrefixSuffixPairs(self, words: List[str]) -> int:\n def is_prefix_and_suffix(str1: str, str2: str) -> bool:\n length_str1 = len(str1)\n return str2.startswith(str1) and str2.endswith(str1) and (len(str2) > length_str1)\n\n count = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n if is_prefix_and_suffix(words[i], words[j]):\n count += 1\n return count", "class Solution:\n def countPrefixSuffixPairs(self, words: List[str]) -> int:\n def is_prefix_and_suffix(str1: str, str2: str) -> bool:\n length_str1 = len(str1)\n return str2.startswith(str1) and str2.endswith(str1) and (len(str2) > 2 * length_str1)\n\n count = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n if is_prefix_and_suffix(words[i], words[j]):\n count += 1\n\n return count", "class Solution:\n def countPrefixSuffixPairs(self, words: List[str]) -> int:\n def is_prefix_and_suffix(str1: str, str2: str) -> bool:\n length_str1 = len(str1)\n return str2.startswith(str1) and str2.endswith(str1) and (\n length_str1 != len(str2) or length_str1 % 2 == 0\n )\n\n count = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n if is_prefix_and_suffix(words[i], words[j]):\n count += 1\n\n return count", "class Solution:\n def countPrefixSuffixPairs(self, words: List[str]) -> int:\n def is_prefix_and_suffix(str1: str, str2: str) -> bool:\n return str2.startswith(str1) and str2.endswith(str1)\n\n count = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n if is_prefix_and_suffix(words[i], words[j]):\n count += 1\n\n return count", "class Solution:\n def countPrefixSuffixPairs(self, words: List[str]) -> int:\n def is_prefix_and_suffix(str1: str, str2: str) -> bool:\n length_str1 = len(str1)\n return str2.startswith(str1) and str2.endswith(str1) and (len(str2) > length_str1)\n\n count = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n if is_prefix_and_suffix(words[i], words[j]):\n count += 1\n return count", "class Solution:\n def countPrefixSuffixPairs(self, words: List[str]) -> int:\n def is_prefix_and_suffix(str1: str, str2: str) -> bool:\n length_str1 = len(str1)\n return str2.startswith(str1) and str2.endswith(str1) and (len(str2) > length_str1)\n\n count = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n if is_prefix_and_suffix(words[i], words[j]):\n count += 1\n\n return count", "class Solution:\n def countPrefixSuffixPairs(self, words: List[str]) -> int:\n def is_prefix_and_suffix(str1: str, str2: str) -> bool:\n return str2.startswith(str1) and str2.endswith(str1)\n \n count = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n if is_prefix_and_suffix(words[i], words[j]):\n count += 1\n \n return count", "class Solution:\n def countPrefixSuffixPairs(self, words: List[str]) -> int:\n def is_prefix_and_suffix(str1: str, str2: str) -> bool:\n length_str1 = len(str1)\n return str2.startswith(str1) and str2.endswith(str1) and (\n length_str1 != len(str2) or length_str1 % 2 == 0\n )\n\n count = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n if is_prefix_and_suffix(words[i], words[j]):\n count += 1\n\n return count", "class Solution:\n def countPrefixSuffixPairs(self, words: List[str]) -> int:\n def is_prefix_and_suffix(str1: str, str2: str) -> bool:\n return str2.startswith(str1) and str2.endswith(str1)\n \n count = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n if is_prefix_and_suffix(words[i], words[j]):\n count += 1\n \n return count", "class Solution:\n def countPrefixSuffixPairs(self, words: List[str]) -> int:\n def is_prefix_and_suffix(str1: str, str2: str) -> bool:\n return str2.startswith(str1) and str2.endswith(str1)\n \n count = 0\n for i in range(len(words)):\n for j in range(i + 1, len(words)):\n if is_prefix_and_suffix(words[i], words[j]):\n count += 1\n \n return count" ], "pass1_list": [ false, false, false, true, false, false, true, false, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def returnToBoundaryCount(self, nums: List[int]) -> int:\n count = 0\n position = 0\n \n for num in nums:\n position += num\n if position == 0:\n count += 1\n \n return count", "class Solution:\n def returnToBoundaryCount(self, nums: List[int]) -> int:\n count = 0\n position = 0\n\n for num in nums:\n position += num\n if position == 0:\n count += 1\n\n return count", "class Solution:\n def returnToBoundaryCount(self, nums: List[int]) -> int:\n count = 0\n position = 0\n\n for num in nums:\n position += num\n if position == 0:\n count += 1\n\n return count", "class Solution:\n def returnToBoundaryCount(self, nums: List[int]) -> int:\n count = 0\n position = 0\n\n for num in nums:\n position += num\n if position == 0:\n count += 1\n\n return count", "class Solution:\n def returnToBoundaryCount(self, nums: List[int]) -> int:\n count = 0\n position = 0\n\n for num in nums:\n position += num\n if position == 0:\n count += 1\n\n return count", "class Solution:\n def returnToBoundaryCount(self, nums: List[int]) -> int:\n count = 0\n position = 0\n\n for num in nums:\n position += num\n if position == 0:\n count += 1\n\n return count", "class Solution:\n def returnToBoundaryCount(self, nums: List[int]) -> int:\n count = 0\n position = 0\n\n for num in nums:\n position += num\n if position == 0:\n count += 1\n\n return count", "class Solution:\n def returnToBoundaryCount(self, nums: List[int]) -> int:\n count = 0\n position = 0\n\n for num in nums:\n position += num\n if position == 0:\n count += 1\n\n return count", "class Solution:\n def returnToBoundaryCount(self, nums: List[int]) -> int:\n count = 0\n position = 0\n\n for num in nums:\n position += num\n if position == 0:\n count += 1\n\n return count", "class Solution:\n def returnToBoundaryCount(self, nums: List[int]) -> int:\n count = 0\n position = 0\n\n for num in nums:\n position += num\n if position == 0:\n count += 1\n\n return count" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countKeyChanges(self, s: str) -> int:\n count = 0\n last_key = ''\n\n for c in s:\n current_key = c.lower()\n if current_key != last_key:\n count += 1\n last_key = current_key\n\n return count", "class Solution:\n def countKeyChanges(self, s: str) -> int:\n count = 0\n last_key = ''\n \n for c in s:\n current_key = c.lower()\n if current_key != last_key:\n count += 1\n last_key = current_key\n \n return count", "class Solution:\n def countKeyChanges(self, s: str) -> int:\n count = 0\n last_key = ''\n\n for c in s:\n lower_c = c.lower()\n if lower_c != last_key:\n count += 1\n last_key = lower_c\n\n return count", "class Solution:\n def countKeyChanges(self, s: str) -> int:\n count = 0\n last_key = ''\n\n for c in s:\n lower_c = c.lower()\n if lower_c != last_key:\n count += 1\n last_key = lower_c\n\n return count", "class Solution:\n def countKeyChanges(self, s: str) -> int:\n count = 0\n last_key = ''\n \n for c in s:\n current_key = c.lower()\n if current_key != last_key:\n count += 1\n last_key = current_key\n \n return count", "class Solution:\n def countKeyChanges(self, s: str) -> int:\n count = 0\n last_key = ''\n\n for c in s:\n current_key = c.lower()\n if current_key != last_key:\n count += 1\n last_key = current_key\n\n return count", "class Solution:\n def countKeyChanges(self, s: str) -> int:\n count = 0\n last_key = ''\n\n for c in s:\n current_key = c.lower()\n if current_key != last_key:\n count += 1\n last_key = current_key\n\n return count", "class Solution:\n def countKeyChanges(self, s: str) -> int:\n count = 0\n last_key = ''\n\n for c in s:\n lower_c = c.lower()\n if lower_c != last_key:\n count += 1\n last_key = lower_c\n\n return count", "class Solution:\n def countKeyChanges(self, s: str) -> int:\n count = 0\n last_key = ''\n\n for c in s:\n current_key = c.lower()\n if current_key != last_key:\n count += 1\n last_key = current_key\n\n return count", "class Solution:\n def countKeyChanges(self, s: str) -> int:\n count = 0\n last_key = ''\n\n for c in s:\n current_key = c.lower()\n if current_key != last_key:\n count += 1\n last_key = current_key\n\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumStrength(self, nums: List[int], k: int) -> int:\n n = len(nums)\n prefix_sum = [0] * (n + 1)\n for i in range(n):\n prefix_sum[i + 1] = prefix_sum[i] + nums[i]\n\n dp = [float('-inf')] * (k + 1)\n dp[0] = 0\n for i in range(1, n + 1):\n strength = prefix_sum[i] - prefix_sum[i - 1]\n for j in range(k, 0, -1):\n dp[j] = max(dp[j], dp[j - 1] + strength * j)\n\n return dp[k]", "class Solution:\n def maximumStrength(self, nums: List[int], k: int) -> int:\n n = len(nums)\n prefix_sum = [0] * (n + 1)\n for i in range(n):\n prefix_sum[i + 1] = prefix_sum[i] + nums[i]\n\n dp = [float(\"-inf\")] * (n + 1)\n dp[0] = 0\n for i in range(n):\n for j in range(i, -1, -1):\n dp[j + 1] = max(dp[j + 1], dp[j] + (prefix_sum[i + 1] - prefix_sum[j]))\n\n max_strength = 0\n for i in range(n):\n if dp[i + 1] > 0:\n max_strength = max(max_strength, dp[i + 1] * k)\n\n return max_strength", "class Solution:\n def maximumStrength(self, nums: List[int], k: int) -> int:\n n = len(nums)\n prefix_sum = [0] * (n + 1)\n for i in range(n):\n prefix_sum[i + 1] = prefix_sum[i] + nums[i]\n\n dp = [float('-inf')] * (k + 1)\n dp[0] = 0\n for i in range(1, n + 1):\n strength = prefix_sum[i] - prefix_sum[i - 1]\n for j in range(k, 0, -1):\n dp[j] = max(dp[j], dp[j - 1] + strength * j)\n\n return dp[k]", "class Solution:\n def maximumStrength(self, nums: List[int], k: int) -> int:\n n = len(nums)\n strength = [0] * n\n for i in range(n):\n strength[i] = nums[i] * (i + 1)\n\n for i in range(1, n):\n strength[i] += strength[i - 1]\n\n strength.sort(reverse=True)\n\n ans = sum(strength[:k])\n return ans", "class Solution:\n def maximumStrength(self, nums: List[int], k: int) -> int:\n n = len(nums)\n prefix_sum = [0] * (n + 1)\n for i in range(n):\n prefix_sum[i + 1] = prefix_sum[i] + nums[i]\n\n dp = [float('-inf')] * (k + 1)\n dp[0] = 0\n for i in range(1, n + 1):\n strength = prefix_sum[i] - prefix_sum[i - 1]\n for j in range(k, 0, -1):\n dp[j] = max(dp[j], dp[j - 1] + strength * j)\n\n return dp[k]", "class Solution:\n def maximumStrength(self, nums: List[int], k: int) -> int:\n n = len(nums)\n strength = [0] * n\n for i in range(n):\n strength[i] = nums[i] * (i + 1)\n\n for i in range(1, n):\n strength[i] += strength[i - 1]\n\n strength.sort(reverse=True)\n\n ans = sum(strength[:k])\n return ans", "class Solution:\n def maximumStrength(self, nums: List[int], k: int) -> int:\n n = len(nums)\n strength = [0] * n\n for i in range(n):\n strength[i] = nums[i] * (i + 1)\n for i in range(1, n):\n strength[i] += strength[i - 1]\n strength.sort(reverse=True)\n ans = sum(strength[:k])\n return ans", "class Solution:\n def maximumStrength(self, nums: List[int], k: int) -> int:\n n = len(nums)\n strength = [0] * n\n for i in range(n):\n strength[i] = nums[i] * (i + 1)\n for i in range(1, n):\n strength[i] += strength[i - 1]\n strength.sort(reverse=True)\n ans = sum(strength[:k])\n return ans", "class Solution:\n def maximumStrength(self, nums: List[int], k: int) -> int:\n n = len(nums)\n strength = [0] * n\n for i in range(n):\n strength[i] = nums[i] * (i + 1)\n for i in range(1, n):\n strength[i] += strength[i - 1]\n strength.sort(reverse=True)\n ans = sum(strength[:k])\n return ans", "class Solution:\n def maximumStrength(self, nums: List[int], k: int) -> int:\n n = len(nums)\n strength = [0] * n\n for i in range(n):\n strength[i] = nums[i] * (i + 1)\n for i in range(1, n):\n strength[i] += strength[i - 1]\n strength.sort(reverse=True)\n return sum(strength[:k])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def sumOfPowers(self, nums: List[int], k: int) -> int:\n n = len(nums)\n MOD = 10**9 + 7\n dp = [[0] * n for _ in range(k)]\n\n for i in range(n):\n dp[0][i] = 1\n\n for i in range(1, k):\n for j in range(1, n):\n dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] * (j - i + 1)) % MOD\n\n ans = 0\n for i in range(n - k + 1):\n sorted_nums = sorted(nums[i:i + k])\n diffs = [sorted_nums[j] - sorted_nums[j - 1] for j in range(1, k)]\n power = sum(diffs)\n ans = (ans + dp[k - 1][i + k - 1] * power) % MOD\n\n return ans", "class Solution:\n def sumOfPowers(self, nums: List[int], k: int) -> int:\n n = len(nums)\n MOD = 10**9 + 7\n dp = [[0] * n for _ in range(k)]\n for i in range(n):\n dp[0][i] = 1\n \n for i in range(1, k):\n for j in range(1, n):\n dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] * (n - j) % MOD) % MOD\n \n ans = 0\n for i in range(n):\n for j in range(i + 1, n):\n diff = abs(nums[i] - nums[j])\n for l in range(k):\n ans = (ans + dp[k - 1][l] * diff % MOD) % MOD\n \n return ans", "class Solution:\n def sumOfPowers(self, nums: List[int], k: int) -> int:\n n = len(nums)\n MOD = 10**9 + 7\n\n dp = [[0] * n for _ in range(k)]\n for i in range(n):\n dp[0][i] = 1\n\n for i in range(1, k):\n for j in range(1, n):\n dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - 1]) % MOD\n\n ans = 0\n for i in range(n - k + 1):\n sorted_nums = sorted(nums[i:i + k])\n diffs = [sorted_nums[j] - sorted_nums[j - 1] for j in range(1, k)]\n min_diff = min(diffs)\n ans = (ans + min_diff * dp[k - 1][i + k - 1]) % MOD\n\n return ans", "class Solution:\n def sumOfPowers(self, nums: List[int], k: int) -> int:\n n = len(nums)\n MOD = 10**9 + 7\n dp = [[0] * n for _ in range(k)]\n for i in range(n):\n dp[0][i] = 1\n\n for i in range(1, k):\n for j in range(1, n):\n dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] - dp[i - 1][j - 1]) % MOD\n\n ans = 0\n for i in range(n - k + 1):\n sorted_nums = sorted(nums[i:i + k])\n diffs = [sorted_nums[j] - sorted_nums[j - 1] for j in range(1, k)]\n ans = (ans + sum(diffs)) % MOD\n\n return ans", "class Solution:\n def sumOfPowers(self, nums: List[int], k: int) -> int:\n n = len(nums)\n MOD = 10**9 + 7\n\n dp = [[0] * n for _ in range(k)]\n for i in range(n):\n dp[0][i] = 1\n\n for i in range(1, k):\n for j in range(1, n):\n dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] * (n - j)) % MOD\n\n nums.sort()\n ans = 0\n for i in range(n):\n for j in range(i + 1, n):\n if nums[j] - nums[i] > 0:\n ans = (ans + dp[k - 1][j] * (j - i)) % MOD\n\n return ans", "class Solution:\n def sumOfPowers(self, nums: List[int], k: int) -> int:\n n = len(nums)\n MOD = 10**9 + 7\n dp = [[0] * n for _ in range(k)]\n for i in range(n):\n dp[0][i] = 1\n\n for i in range(1, k):\n for j in range(1, n):\n dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] * (n - j)) % MOD\n\n ans = 0\n for i in range(n):\n for j in range(i + 1, n):\n power = abs(nums[i] - nums[j])\n ans = (ans + dp[k - 2][i] * dp[1][j] * power) % MOD\n\n return ans", "class Solution:\n def sumOfPowers(self, nums: List[int], k: int) -> int:\n n = len(nums)\n MOD = 10**9 + 7\n dp = [[0] * n for _ in range(k)]\n for i in range(n):\n dp[0][i] = 1\n \n for i in range(1, k):\n for j in range(1, n):\n dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] * (n - j)) % MOD\n \n ans = 0\n for i in range(n):\n for j in range(i + 1, n):\n diff = abs(nums[i] - nums[j])\n for l in range(k):\n ans = (ans + dp[k - 1][j] * diff) % MOD\n \n return ans", "class Solution:\n def sumOfPowers(self, nums: List[int], k: int) -> int:\n n = len(nums)\n MOD = 10**9 + 7\n dp = [[0] * n for _ in range(k)]\n for i in range(n):\n dp[0][i] = 1\n\n for i in range(1, k):\n for j in range(1, n):\n dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] * (n - j) % MOD) % MOD\n\n ans = 0\n for i in range(n - k + 1):\n s = set(nums[i:i + k])\n ans = (ans + len(s) * (len(s) - 1) // 2) % MOD\n\n return ans", "class Solution:\n def sumOfPowers(self, nums: List[int], k: int) -> int:\n n = len(nums)\n MOD = 10**9 + 7\n\n dp = [[0] * n for _ in range(k)]\n for i in range(n):\n dp[0][i] = 1\n\n for i in range(1, k):\n for j in range(1, n):\n dp[i][j] = (dp[i][j - 1] + dp[i - 1][j] * (n - j) * (j - i + 1)) % MOD\n\n ans = 0\n for i in range(n - k + 1):\n sorted_nums = sorted(nums[i:i + k])\n diff = [sorted_nums[j] - sorted_nums[j - 1] for j in range(1, k)]\n power = sum(diff)\n ans = (ans + dp[k - 1][i + k - 1] * power) % MOD\n\n return ans", "class Solution:\n def sumOfPowers(self, nums: List[int], k: int) -> int:\n n = len(nums)\n MOD = 10**9 + 7\n\n # Sort the input array\n nums.sort()\n\n # Initialize the result to 0\n result = 0\n\n # Iterate over all possible distances\n for dist in range(1, n + 1):\n count = 0\n\n # Find the number of pairs with the given distance\n for i in range(n - 1):\n if nums[i + 1] - nums[i] == dist:\n count += 1\n\n # Calculate the number of subsequences with the given distance\n subsequences = (\n (factorial(k - 1, MOD) * factorial(n - k, MOD) * factorial(n - k - count, MOD))\n % MOD\n * factorial(count, MOD)\n ) % MOD\n\n # Add the contribution of these subsequences to the result\n result = (result + subsequences * dist) % MOD\n\n return result\n\n def factorial(self, n, MOD):\n result = 1\n for i in range(1, n + 1):\n result = (result * i) % MOD\n return result" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxPalindromesAfterOperations(self, words: List[str]) -> int:\n letter_counts = {}\n for word in words:\n for letter in word:\n letter_counts[letter] = letter_counts.get(letter, 0) + 1\n\n odd_count = sum(1 for count in letter_counts.values() if count % 2 == 1)\n return min(len(words), len(letter_counts) + (odd_count + 1) // 2)", "class Solution:\n def maxPalindromesAfterOperations(self, words: List[str]) -> int:\n letter_count = {}\n for word in words:\n for letter in word:\n letter_count[letter] = letter_count.get(letter, 0) + 1\n\n odd_count = sum(1 for count in letter_count.values() if count % 2 == 1)\n return min(len(words), odd_count // 2 + 1)", "class Solution:\n def maxPalindromesAfterOperations(self, words: List[str]) -> int:\n letter_count = {}\n for word in words:\n for letter in word:\n letter_count[letter] = letter_count.get(letter, 0) + 1\n\n odd_count = sum(1 for count in letter_count.values() if count % 2 == 1)\n return min(len(words), odd_count + 1)", "class Solution:\n def maxPalindromesAfterOperations(self, words: List[str]) -> int:\n freq = [0] * 26\n for word in words:\n for ch in word:\n freq[ord(ch) - ord('a')] += 1\n\n count = 0\n for i in range(26):\n count += freq[i] // 2 * 2\n if freq[i] % 2 == 1:\n count += 1\n\n return min(count, len(words))", "class Solution:\n def maxPalindromesAfterOperations(self, words: List[str]) -> int:\n from collections import Counter\n\n letter_counts = Counter(letter for word in words for letter in word)\n odd_counts = sum(1 for count in letter_counts.values() if count % 2 == 1)\n return min(len(words), len(letter_counts) + (odd_counts + 1) // 2)", "class Solution:\n def maxPalindromesAfterOperations(self, words: List[str]) -> int:\n letter_counts = {}\n for word in words:\n for letter in word:\n letter_counts[letter] = letter_counts.get(letter, 0) + 1\n\n odd_count = sum(1 for count in letter_counts.values() if count % 2 == 1)\n return min(len(words), odd_count + 1)", "class Solution:\n def maxPalindromesAfterOperations(self, words: List[str]) -> int:\n letter_count = {}\n for word in words:\n for letter in word:\n letter_count[letter] = letter_count.get(letter, 0) + 1\n\n max_palindromes = 0\n for word in words:\n is_palindrome = True\n for i in range(len(word) // 2):\n if word[i] != word[-i - 1]:\n is_palindrome = False\n break\n if is_palindrome:\n max_palindromes += 1\n for letter in word:\n letter_count[letter] -= 1\n\n return max_palindromes + sum(1 for count in letter_count.values() if count % 2 == 0) // 2", "class Solution:\n def maxPalindromesAfterOperations(self, words: List[str]) -> int:\n letter_counts = {}\n for word in words:\n for letter in word:\n letter_counts[letter] = letter_counts.get(letter, 0) + 1\n\n odd_counts = sum(1 for count in letter_counts.values() if count % 2 == 1)\n return min(len(words), odd_counts + 1)", "class Solution:\n def maxPalindromesAfterOperations(self, words: List[str]) -> int:\n letter_count = {}\n for word in words:\n for letter in word:\n letter_count[letter] = letter_count.get(letter, 0) + 1\n\n odd_count = sum(1 for count in letter_count.values() if count % 2 == 1)\n return min(len(words), odd_count // 2 + 1)", "class Solution:\n def maxPalindromesAfterOperations(self, words: List[str]) -> int:\n letter_count = {}\n for word in words:\n for letter in word:\n letter_count[letter] = letter_count.get(letter, 0) + 1\n \n odd_count = sum(1 for count in letter_count.values() if count % 2 == 1)\n return min(len(words), odd_count // 2 + 1)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maxOperations(self, nums: List[int]) -> int:\n nums.sort()\n count = 0\n target_sum = nums[-1] + nums[-2]\n i, j = 0, 1\n while i < len(nums) - 1 and j < len(nums):\n current_sum = nums[i] + nums[j]\n if current_sum == target_sum:\n count += 1\n i += 2\n j = i\n elif current_sum < target_sum:\n i += 1\n else:\n j += 1\n return count // 2", "class Solution:\n def maxOperations(self, nums: List[int]) -> int:\n nums.sort()\n count = 0\n target_sum = nums[-1] + nums[-2]\n i, j = 0, 1\n while i < len(nums) - 1 and j < len(nums):\n current_sum = nums[i] + nums[j]\n if current_sum == target_sum:\n count += 1\n i += 2\n j = i\n elif current_sum < target_sum:\n i += 1\n else:\n j += 1\n return count", "class Solution:\n def maxOperations(self, nums: List[int]) -> int:\n nums.sort()\n count = 0\n target_sum = nums[-1] + nums[-2]\n i, j = 0, 1\n while i < len(nums) - 1 and j < len(nums):\n current_sum = nums[i] + nums[j]\n if current_sum == target_sum:\n count += 1\n i += 2\n j = i\n elif current_sum < target_sum:\n i += 1\n else:\n j += 1\n return count", "class Solution:\n def maxOperations(self, nums: List[int]) -> int:\n nums.sort()\n count = 0\n target_sum = nums[-1] + nums[-2]\n i, j = 0, 1\n while i < len(nums) - 1 and j < len(nums):\n current_sum = nums[i] + nums[j]\n if current_sum == target_sum:\n count += 1\n i += 2\n j = i\n elif current_sum < target_sum:\n i += 1\n else:\n j += 1\n return count // 2", "class Solution:\n def maxOperations(self, nums: List[int]) -> int:\n nums.sort()\n count = 0\n target = nums[-1] + nums[-2]\n i, j = 0, 1\n while i < len(nums) - 1 and j < len(nums):\n if i != j and nums[i] + nums[j] == target:\n count += 1\n i = 0\n j = 1\n elif nums[i] + nums[j] < target:\n i += 1\n else:\n j += 1\n return count // 2", "class Solution:\n def maxOperations(self, nums: List[int]) -> int:\n nums.sort()\n count = 0\n target_sum = nums[-1] + nums[-2]\n i, j = 0, 1\n while i < len(nums) - 1 and j < len(nums):\n current_sum = nums[i] + nums[j]\n if current_sum > target_sum:\n j += 1\n elif current_sum < target_sum:\n i += 1\n else:\n count += 1\n i += 1\n j += 1\n return count", "class Solution:\n def maxOperations(self, nums: List[int]) -> int:\n nums.sort()\n count = 0\n target_sum = nums[-1] + nums[-2]\n i, j = 0, 1\n while i < len(nums) - 1 and j < len(nums):\n current_sum = nums[i] + nums[j]\n if current_sum == target_sum:\n count += 1\n i += 2\n j = i\n elif current_sum < target_sum:\n i += 1\n else:\n j += 1\n return count", "class Solution:\n def maxOperations(self, nums: List[int]) -> int:\n nums.sort()\n count = 0\n target_sum = nums[-1] + nums[-2]\n i, j = 0, 1\n while i < len(nums) - 1 and j < len(nums):\n current_sum = nums[i] + nums[j]\n if current_sum == target_sum:\n count += 1\n i += 2\n j = i\n elif current_sum < target_sum:\n i += 1\n else:\n j += 1\n return count", "class Solution:\n def maxOperations(self, nums: List[int]) -> int:\n nums.sort()\n count = 0\n target_sum = nums[-1] + nums[-2]\n i, j = 0, 1\n while i < len(nums) - 1 and j < len(nums):\n current_sum = nums[i] + nums[j]\n if current_sum == target_sum:\n count += 1\n i += 2\n j = i\n elif current_sum < target_sum:\n i += 1\n else:\n j += 1\n return count // 2", "class Solution:\n def maxOperations(self, nums: List[int]) -> int:\n nums.sort()\n count = 0\n target_sum = nums[-1] + nums[-2]\n i, j = 0, 1\n while i < len(nums) - 1 and j < len(nums):\n current_sum = nums[i] + nums[j]\n if current_sum == target_sum:\n count += 1\n i += 2\n j = i\n elif current_sum < target_sum:\n i += 1\n else:\n j += 1\n return count // 2" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def isPossibleToSplit(self, nums: List[int]) -> bool:\n counter = collections.Counter(nums)\n nums.sort()\n\n def dfs(index, used, count):\n if count == len(nums) // 2:\n return True\n for i in range(index, len(nums)):\n if (used[nums[i]] + used[nums[i] ^ 1]) % 2 == 0:\n used[nums[i]] += 1\n if dfs(i + 1, used, count + 1):\n return True\n used[nums[i]] -= 1\n return False\n\n return dfs(0, [0] * 101, 0)", "class Solution:\n def isPossibleToSplit(self, nums: List[int]) -> bool:\n nums_set = set(nums)\n n = len(nums)\n count = 0\n for num in nums_set:\n if nums.count(num) == n // 2:\n return False\n count += nums.count(num)\n return count == n", "class Solution:\n def isPossibleToSplit(self, nums: List[int]) -> bool:\n n = len(nums) // 2\n nums1 = set()\n nums2 = set()\n for num in nums:\n if num in nums1:\n nums2.add(num)\n nums2.remove(num)\n elif num in nums2:\n nums1.add(num)\n nums1.remove(num)\n elif len(nums1) < n:\n nums1.add(num)\n else:\n nums2.add(num)\n if len(nums1) == n and len(nums2) == n:\n return True\n return False", "class Solution:\n def isPossibleToSplit(self, nums: List[int]) -> bool:\n counter = collections.Counter(nums)\n nums1_elements = set()\n for num, freq in counter.items():\n if freq == 1:\n nums1_elements.add(num)\n elif freq == 2:\n counter[num] -= 1\n else:\n return False\n \n for num, freq in counter.items():\n if freq > 0 and num not in nums1_elements:\n nums1_elements.add(num)\n elif freq > 1:\n return False\n \n return True", "class Solution:\n def isPossibleToSplit(self, nums: List[int]) -> bool:\n nums_set = set(nums)\n n = len(nums)\n count = 0\n for num in nums_set:\n if nums.count(num) == n // 2:\n return False\n count += nums.count(num)\n return count == n", "class Solution:\n def isPossibleToSplit(self, nums: List[int]) -> bool:\n nums_set = set(nums)\n n = len(nums)\n count = 0\n for num in nums_set:\n if nums.count(num) == n // 2:\n return False\n count += nums.count(num)\n return count == n", "class Solution:\n def isPossibleToSplit(self, nums: List[int]) -> bool:\n n = len(nums) // 2\n nums1 = set()\n nums2 = set()\n for num in nums:\n if num in nums1:\n nums2.add(num)\n elif num in nums2:\n nums1.add(num)\n elif len(nums1) < n:\n nums1.add(num)\n else:\n nums2.add(num)\n if len(nums1) == n and len(nums2) == n:\n return True\n return len(nums1) == n or len(nums2) == n", "class Solution:\n def isPossibleToSplit(self, nums: List[int]) -> bool:\n counter = {}\n for num in nums:\n counter[num] = counter.get(num, 0) + 1\n\n nums1_freq = [0] * 101\n nums2_freq = [0] * 101\n\n for num, freq in counter.items():\n if freq == 1:\n return True\n elif freq == 2:\n nums1_freq[num] += 1\n nums2_freq[num] += 1\n else:\n return False\n\n for i in range(101):\n if nums1_freq[i] > 1 or nums2_freq[i] > 1:\n return False\n\n return True", "class Solution:\n def isPossibleToSplit(self, nums: List[int]) -> bool:\n n = len(nums) // 2\n nums1 = set()\n nums2 = set()\n for num in nums:\n if num in nums1:\n nums2.add(num)\n elif num in nums2:\n nums1.add(num)\n elif len(nums1) < n:\n nums1.add(num)\n else:\n nums2.add(num)\n if len(nums1) == n and len(nums2) == n:\n return True\n return len(nums1) == n and len(nums2) == n", "class Solution:\n def isPossibleToSplit(self, nums: List[int]) -> bool:\n counter = {}\n for num in nums:\n counter[num] = counter.get(num, 0) + 1\n \n nums1_elements = []\n for num, count in counter.items():\n if count == 1:\n nums1_elements.append(num)\n elif count > 2:\n return False\n \n if len(nums1_elements) != len(nums) / 2:\n return False\n \n nums2_elements = set(nums) - set(nums1_elements)\n return len(nums2_elements) == len(nums) / 2" ], "pass1_list": [ false, false, false, true, false, false, false, true, true, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumMoves(self, nums: List[int], k: int, maxChanges: int) -> int:\n n = len(nums)\n dp = [[float('inf')] * (k + 1) for _ in range(n + 1)]\n dp[0][0] = 0\n\n for i in range(n):\n if nums[i] == 1:\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][0])\n for j in range(k - 1, -1, -1):\n dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + 1)\n else:\n for j in range(k):\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n if maxChanges > 0:\n dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + 1)\n maxChanges -= 1\n\n return dp[n][k]", "class Solution:\n def minimumMoves(self, nums: List[int], k: int, maxChanges: int) -> int:\n n = len(nums)\n dp = [float('inf')] * (k + 1)\n dp[0] = 0\n\n for num in nums:\n new_dp = [float('inf')] * (k + 1)\n for i in range(k, num - 1, -1):\n new_dp[i] = min(new_dp[i], dp[i - 1] + 1)\n if maxChanges > 0:\n new_dp[i - 1] = min(new_dp[i - 1], dp[i] + 1)\n if num == 1:\n new_dp[i - 1] = min(new_dp[i - 1], dp[i])\n dp = new_dp\n\n return dp[k]", "class Solution:\n def minimumMoves(self, nums: List[int], k: int, maxChanges: int) -> int:\n n = len(nums)\n ones_count = nums.count(1)\n if ones_count >= k:\n return k\n \n maxChanges -= ones_count\n if maxChanges < 0:\n return -1\n \n dp = [float('inf')] * (n + 2)\n dp[0] = 0\n for num in nums:\n dp[num] = min(dp[num], dp[num - 1] + 1)\n \n for i in range(n - 2, -1, -1):\n dp[i] = min(dp[i], dp[i + 1] + 1)\n \n ans = dp[0] + k\n for i in range(n):\n if nums[i] == 1:\n ans = min(ans, dp[i + 1] + k - 1)\n else:\n if maxChanges > 0:\n ans = min(ans, dp[i + 1] + k)\n if i > 0 and nums[i - 1] == 1:\n ans = min(ans, dp[i] + k - 1)\n if i < n - 1 and nums[i + 1] == 1:\n ans = min(ans, dp[i + 2] + k - 1)\n \n return ans", "class Solution:\n def minimumMoves(self, nums: List[int], k: int, maxChanges: int) -> int:\n n = len(nums)\n ones = sum(nums)\n if maxChanges + ones < k:\n return -1\n if maxChanges >= k:\n return k\n \n dp = [float('inf')] * (n + 2)\n dp[0] = 0\n for i in range(n):\n if nums[i]:\n dp[i + 1] = min(dp[i + 1], dp[max(0, i - 1)] + 1)\n else:\n dp[i + 1] = min(dp[i + 1], dp[i] + 1)\n if maxChanges:\n dp[i + 1] = min(dp[i + 1], dp[i - 1] + 1)\n maxChanges -= 1\n \n return dp[n] + k", "class Solution:\n def minimumMoves(self, nums: List[int], k: int, maxChanges: int) -> int:\n n = len(nums)\n ones = sum(nums)\n if maxChanges + ones < k:\n return -1\n if maxChanges >= k:\n return k\n \n dp = [float('inf')] * (n + 2)\n dp[0] = 0\n for i in range(n):\n if nums[i] == 1:\n dp[i + 1] = min(dp[i + 1], dp[max(0, i - 1)] + 1)\n else:\n dp[i + 1] = min(dp[i + 1], dp[i] + 1)\n if maxChanges > 0:\n dp[i + 1] = min(dp[i + 1], dp[max(0, i - 1)] + 2)\n maxChanges -= 1\n \n return dp[n] + k", "class Solution:\n def minimumMoves(self, nums: List[int], k: int, maxChanges: int) -> int:\n n = len(nums)\n left, right = 0, 0\n ones_count = sum(nums)\n\n while left < right or (left == right and nums[left] == 0):\n right = (right + 1) % n\n if nums[right] == 1:\n ones_count -= 1\n maxChanges -= 1\n\n if ones_count == k:\n break\n\n left = (left + 1) % n\n if nums[left] == 0:\n maxChanges += 1\n ones_count += 1\n\n moves = n - max(left, right) + 1\n return moves + max(0, k - ones_count)", "class Solution:\n def minimumMoves(self, nums: List[int], k: int, maxChanges: int) -> int:\n n = len(nums)\n left, right = 0, 0\n moves = 0\n\n while left < n:\n while right < n and nums[right] == 0:\n right += 1\n\n if right == n:\n break\n\n ones = sum(nums[left:right])\n zeros = right - left - ones\n\n if ones + maxChanges >= k:\n moves += k - ones + (zeros - maxChanges)\n break\n else:\n moves += zeros\n k -= ones\n maxChanges -= zeros\n left = right\n\n return moves", "class Solution:\n def minimumMoves(self, nums: List[int], k: int, maxChanges: int) -> int:\n n = len(nums)\n left, right = 0, 0\n while left < n:\n while right < n and k > 0:\n if nums[right] == 1:\n k -= 1\n right += 1\n if k == 0:\n break\n left_ones = sum(nums[left:right])\n maxChanges = min(maxChanges, left_ones)\n left_ones = min(left_ones, k)\n moves = right - left - left_ones * 2 + maxChanges\n k -= left_ones\n left = right\n return moves", "class Solution:\n def minimumMoves(self, nums: List[int], k: int, maxChanges: int) -> int:\n n = len(nums)\n left, right = 0, 0\n while left < n:\n while right < n and k > 0:\n if nums[right] == 1:\n k -= 1\n right += 1\n if k == 0:\n break\n left_ones = nums[left:right].count(1)\n maxChanges = min(maxChanges, k - 1)\n moves = right - left - left_ones + maxChanges\n left = right\n return moves", "class Solution:\n def minimumMoves(self, nums: List[int], k: int, maxChanges: int) -> int:\n n = len(nums)\n left, right = 0, 0\n ones_count = sum(nums)\n\n while left < right or (left == right and nums[left] == 0):\n if right == n - 1:\n right = n\n while right < n and ones_count + maxChanges >= k:\n if nums[right] == 1:\n ones_count -= 1\n right += 1\n maxChanges -= 1\n if left == right:\n left += 1\n right += 1\n while left < n and ones_count + maxChanges < k:\n if nums[left] == 1:\n ones_count += 1\n left += 1\n if left < n:\n maxChanges += 1\n\n moves = n - (right - left)\n moves += max(0, k - ones_count - max(0, right - left - 1))\n\n return moves" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minOperations(self, k: int) -> int:\n if k == 1:\n return 0\n count, val, res = 0, 1, 0\n while val < k:\n count += 1\n val = (val + count) * 2\n res += count\n return res", "class Solution:\n def minOperations(self, k: int) -> int:\n if k == 1:\n return 0\n count, val, res = 0, 1, 0\n while val < k:\n count += 1\n val = (val + count) * 2\n res += count\n return res", "class Solution:\n def minOperations(self, k: int) -> int:\n if k <= 2:\n return k - 1\n \n res = k - 1\n factor = 1\n while k % factor != 0:\n factor += 1\n \n k //= factor\n res = min(res, (k - 1) * factor + (factor - 1))\n \n return res", "class Solution:\n def minOperations(self, k: int) -> int:\n if k == 1:\n return 0\n count, sum, i = 0, 1, 1\n while sum < k:\n if sum + i <= k:\n sum += i\n i += 1\n else:\n count += sum // i\n sum = sum % i * (i + 1)\n i += 1\n return count + (i - 1)", "class Solution:\n def minOperations(self, k: int) -> int:\n if k == 1:\n return 0\n count, sum, i = 0, 1, 1\n while sum < k:\n i = i + 1\n count, sum = count + 1, sum + i\n return count", "class Solution:\n def minOperations(self, k: int) -> int:\n if k <= 2:\n return k - 1\n \n operations = 0\n num = 1\n while num < k:\n diff = (k - num) // num\n operations += diff\n num += diff\n return operations", "class Solution:\n def minOperations(self, k: int) -> int:\n if k == 1:\n return 0\n count, val, res = 0, 1, 0\n while val < k:\n count += 1\n val = (val + 1) * 2\n res += count\n return res", "class Solution:\n def minOperations(self, k: int) -> int:\n if k == 1:\n return 0\n count, sum, res = 0, 1, 0\n while sum < k:\n count += 1\n sum += count\n res += 1\n return res", "class Solution:\n def minOperations(self, k: int) -> int:\n if k == 1:\n return 0\n count, sum, ops = 1, 1, 0\n while sum < k:\n count += 1\n sum += count\n ops += 2\n return ops", "class Solution:\n def minOperations(self, k: int) -> int:\n if k == 1:\n return 0\n result = k\n for i in range(2, k + 1):\n temp = (i - 1) * (k // i)\n if k % i == 0:\n temp += k // i\n else:\n temp += k // i + 1\n result = min(result, temp)\n return result" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def longestCommonPrefix(self, arr1: List[int], arr2: List[int]) -> int:\n def common_prefix(num1: int, num2: int) -> int:\n str1 = str(num1)\n str2 = str(num2)\n i = 0\n while i < min(len(str1), len(str2)) and str1[i] == str2[i]:\n i += 1\n return i\n\n max_common_prefix_length = 0\n for num1 in arr1:\n for num2 in arr2:\n common_length = common_prefix(num1, num2)\n max_common_prefix_length = max(max_common_prefix_length, common_length)\n\n return max_common_prefix_length", "class Solution:\n def longestCommonPrefix(self, arr1: List[int], arr2: List[int]) -> int:\n def commonPrefix(num1: int, num2: int) -> int:\n str1 = str(num1)\n str2 = str(num2)\n i = 0\n while i < min(len(str1), len(str2)) and str1[i] == str2[i]:\n i += 1\n return i\n\n max_common_prefix_length = 0\n for num1 in arr1:\n for num2 in arr2:\n common_prefix_length = commonPrefix(num1, num2)\n max_common_prefix_length = max(max_common_prefix_length, common_prefix_length)\n\n return max_common_prefix_length", "class Solution:\n def longestCommonPrefix(self, arr1: List[int], arr2: List[int]) -> int:\n def common_prefix(num1: int, num2: int) -> int:\n str1 = str(num1)\n str2 = str(num2)\n i = 0\n while i < min(len(str1), len(str2)) and str1[i] == str2[i]:\n i += 1\n return i\n\n max_common_prefix_length = 0\n for num1 in arr1:\n for num2 in arr2:\n common_length = common_prefix(num1, num2)\n max_common_prefix_length = max(max_common_prefix_length, common_length)\n\n return max_common_prefix_length", "class Solution:\n def longestCommonPrefix(self, arr1: List[int], arr2: List[int]) -> int:\n def common_prefix_length(num1: int, num2: int) -> int:\n str1 = str(num1)\n str2 = str(num2)\n i = 0\n while i < min(len(str1), len(str2)) and str1[i] == str2[i]:\n i += 1\n return i\n\n max_common_prefix_length = 0\n for x in arr1:\n for y in arr2:\n max_common_prefix_length = max(max_common_prefix_length, common_prefix_length(x, y))\n\n return max_common_prefix_length", "class Solution:\n def longestCommonPrefix(self, arr1: List[int], arr2: List[int]) -> int:\n def common_prefix(num1: int, num2: int) -> int:\n str1 = str(num1)\n str2 = str(num2)\n i = 0\n while i < min(len(str1), len(str2)) and str1[i] == str2[i]:\n i += 1\n return i\n\n max_length = 0\n for num1 in arr1:\n for num2 in arr2:\n length = common_prefix(num1, num2)\n if length > max_length:\n max_length = length\n\n return max_length", "class Solution:\n def longestCommonPrefix(self, arr1: List[int], arr2: List[int]) -> int:\n def common_prefix(num1: int, num2: int) -> int:\n str1 = str(num1)\n str2 = str(num2)\n i = 0\n while i < min(len(str1), len(str2)) and str1[i] == str2[i]:\n i += 1\n return i\n\n max_common_prefix_length = 0\n for num1 in arr1:\n for num2 in arr2:\n common_length = common_prefix(num1, num2)\n max_common_prefix_length = max(max_common_prefix_length, common_length)\n\n return max_common_prefix_length", "class Solution:\n def longestCommonPrefix(self, arr1: List[int], arr2: List[int]) -> int:\n def common_prefix(num1: int, num2: int) -> int:\n str1 = str(num1)\n str2 = str(num2)\n i = 0\n while i < min(len(str1), len(str2)) and str1[i] == str2[i]:\n i += 1\n return i\n\n max_length = 0\n for num1 in arr1:\n for num2 in arr2:\n length = common_prefix(num1, num2)\n max_length = max(max_length, length)\n\n return max_length", "class Solution:\n def longestCommonPrefix(self, arr1: List[int], arr2: List[int]) -> int:\n def common_prefix(num1: int, num2: int) -> int:\n str1 = str(num1)\n str2 = str(num2)\n i = 0\n while i < min(len(str1), len(str2)) and str1[i] == str2[i]:\n i += 1\n return i\n\n max_common_prefix_length = 0\n for x in arr1:\n for y in arr2:\n common_length = common_prefix(x, y)\n max_common_prefix_length = max(max_common_prefix_length, common_length)\n\n return max_common_prefix_length", "class Solution:\n def longestCommonPrefix(self, arr1: List[int], arr2: List[int]) -> int:\n def common_prefix(num1: int, num2: int) -> int:\n str1 = str(num1)\n str2 = str(num2)\n i = 0\n while i < min(len(str1), len(str2)) and str1[i] == str2[i]:\n i += 1\n return i\n\n max_length = 0\n for num1 in arr1:\n for num2 in arr2:\n length = common_prefix(num1, num2)\n max_length = max(max_length, length)\n\n return max_length", "class Solution:\n def longestCommonPrefix(self, arr1: List[int], arr2: List[int]) -> int:\n def common_prefix(num1: int, num2: int) -> int:\n str1 = str(num1)\n str2 = str(num2)\n i = 0\n while i < min(len(str1), len(str2)) and str1[i] == str2[i]:\n i += 1\n return i\n\n max_common_prefix_length = 0\n for num1 in arr1:\n for num2 in arr2:\n common_length = common_prefix(num1, num2)\n max_common_prefix_length = max(max_common_prefix_length, common_length)\n\n return max_common_prefix_length" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n nums.sort()\n for num in reversed(nums):\n if num < k:\n count += 1\n else:\n break\n return count", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n while nums:\n if nums[0] < k:\n nums.remove(min(nums))\n count += 1\n else:\n break\n return count", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n nums.sort()\n while nums[0] < k:\n if nums[0] == nums[1]:\n nums.pop(0)\n else:\n break\n count += 1\n return count + len(nums) - nums.count(k)", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n nums.sort()\n for num in nums:\n if num < k:\n count += 1\n else:\n break\n return count", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n while nums:\n if nums[0] < k:\n nums.remove(min(nums))\n count += 1\n else:\n break\n return count", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n while nums:\n if nums[0] < k:\n nums.remove(min(nums))\n count += 1\n else:\n break\n return count", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n nums.sort()\n for num in nums:\n if num < k:\n count += 1\n else:\n break\n return count", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n nums.sort()\n for num in nums:\n if num < k:\n count += 1\n else:\n break\n return count", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n nums.sort()\n for num in nums:\n if num < k:\n count += 1\n else:\n break\n return count", "class Solution:\n def minOperations(self, nums: List[int], k: int) -> int:\n count = 0\n nums.sort()\n for i in range(len(nums) - 1, -1, -1):\n if nums[i] < k:\n count += 1\n else:\n break\n if i == 0:\n count += nums.count(nums[i])\n return count" ], "pass1_list": [ false, false, false, true, false, false, true, true, true, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumBoxes(self, apple: List[int], capacity: List[int]) -> int:\n capacity.sort(reverse=True)\n box_count = 0\n total_apples = sum(apple)\n\n for box in capacity:\n total_apples -= box\n box_count += 1\n\n if total_apples <= 0:\n break\n\n return box_count", "class Solution:\n def minimumBoxes(self, apple: List[int], capacity: List[int]) -> int:\n capacity.sort(reverse=True)\n box_count = 0\n total_apples = sum(apple)\n\n for box in capacity:\n total_apples -= box\n box_count += 1\n\n if total_apples <= 0:\n break\n\n return box_count", "class Solution:\n def minimumBoxes(self, apple: List[int], capacity: List[int]) -> int:\n capacity.sort(reverse=True)\n box_count = 0\n total_apples = sum(apple)\n\n for box in capacity:\n total_apples -= box\n box_count += 1\n\n if total_apples <= 0:\n break\n\n return box_count", "class Solution:\n def minimumBoxes(self, apple: List[int], capacity: List[int]) -> int:\n capacity.sort(reverse=True)\n box_count = 0\n total_apples = sum(apple)\n\n for box in capacity:\n total_apples -= box\n box_count += 1\n\n if total_apples <= 0:\n break\n\n return box_count", "class Solution:\n def minimumBoxes(self, apple: List[int], capacity: List[int]) -> int:\n capacity.sort(reverse=True)\n box_count = 0\n total_apples = sum(apple)\n for box in capacity:\n total_apples -= box\n box_count += 1\n if total_apples <= 0:\n break\n return box_count", "class Solution:\n def minimumBoxes(self, apple: List[int], capacity: List[int]) -> int:\n capacity.sort(reverse=True)\n box_count = 0\n total_apples = sum(apple)\n for i in capacity:\n total_apples -= i\n box_count += 1\n if total_apples <= 0:\n break\n return box_count", "class Solution:\n def minimumBoxes(self, apple: List[int], capacity: List[int]) -> int:\n capacity.sort(reverse=True)\n box_count = 0\n total_apples = sum(apple)\n\n for box in capacity:\n total_apples -= box\n box_count += 1\n\n if total_apples <= 0:\n break\n\n return box_count", "class Solution:\n def minimumBoxes(self, apple: List[int], capacity: List[int]) -> int:\n capacity.sort(reverse=True)\n box_count = 0\n total_apples = sum(apple)\n\n for box in capacity:\n total_apples -= box\n box_count += 1\n\n if total_apples <= 0:\n break\n\n return box_count", "class Solution:\n def minimumBoxes(self, apple: List[int], capacity: List[int]) -> int:\n capacity.sort(reverse=True)\n box_count = 0\n total_apples = sum(apple)\n\n for box in capacity:\n total_apples -= box\n box_count += 1\n\n if total_apples <= 0:\n break\n\n return box_count", "class Solution:\n def minimumBoxes(self, apple: List[int], capacity: List[int]) -> int:\n capacity.sort(reverse=True)\n box_count = 0\n total_apples = sum(apple)\n\n for box in capacity:\n total_apples -= box\n box_count += 1\n\n if total_apples <= 0:\n break\n\n return box_count" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countSubstrings(self, s: str, c: str) -> int:\n count = 0\n left, right = 0, 0\n\n while right < len(s):\n if s[right] == c:\n count += right - left + 1\n right += 1\n else:\n left += 1\n\n return count", "class Solution:\n def countSubstrings(self, s: str, c: str) -> int:\n count = start = 0\n for i, char in enumerate(s):\n if char == c:\n count += i - start + 1\n start = i\n return count + 1", "class Solution:\n def countSubstrings(self, s: str, c: str) -> int:\n count = start = 0\n for i, char in enumerate(s):\n if char == c:\n count += i - start + 1\n start = i\n return count + 1", "class Solution:\n def countSubstrings(self, s: str, c: str) -> int:\n count = 0\n left, right = 0, 0\n while right < len(s):\n if s[right] == c:\n while left < len(s) and s[left] == c:\n left += 1\n count += left - right\n right += 1\n else:\n right += 1\n left = right\n return count", "class Solution:\n def countSubstrings(self, s: str, c: str) -> int:\n count = 0\n left, right = 0, 0\n while right < len(s):\n if s[right] == c:\n count += right - left + 1\n right += 1\n else:\n left += 1\n return count", "class Solution:\n def countSubstrings(self, s: str, c: str) -> int:\n count = 0\n left, right = 0, 0\n\n while right < len(s):\n if s[right] == c:\n count += right - left + 1\n right += 1\n else:\n left += 1\n\n return count", "class Solution:\n def countSubstrings(self, s: str, c: str) -> int:\n count = 0\n left, right = 0, 0\n\n while right < len(s):\n if s[right] == c:\n count += right - left + 1\n right += 1\n else:\n left += 1\n\n return count", "class Solution:\n def countSubstrings(self, s: str, c: str) -> int:\n count = start = 0\n for i, char in enumerate(s):\n if char == c:\n count += i - start + 1\n start = i\n return count + 1", "class Solution:\n def countSubstrings(self, s: str, c: str) -> int:\n count = 0\n left, right = 0, 0\n\n while right < len(s):\n if s[right] == c:\n count += right - left + 1\n right += 1\n else:\n left += 1\n right += 1\n\n return count", "class Solution:\n def countSubstrings(self, s: str, c: str) -> int:\n count = start = 0\n for i, char in enumerate(s):\n if char == c:\n count += i + 1\n start += 1\n else:\n count += start\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, true, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumDistance(self, points: List[List[int]]) -> int:\n def manhattan_distance(p1, p2):\n return abs(p1[0] - p2[0]) + abs(p1[1] - p2[1])\n \n def max_distance(points):\n max_dist = 0\n for i in range(len(points)):\n for j in range(i + 1, len(points)):\n dist = manhattan_distance(points[i], points[j])\n max_dist = max(max_dist, dist)\n return max_dist\n \n min_max_dist = float('inf')\n for i in range(len(points)):\n remaining_points = points[:i] + points[i+1:]\n min_max_dist = min(min_max_dist, max_distance(remaining_points))\n \n return min_max_dist", "class Solution:\n def minimumDistance(self, points: List[List[int]]) -> int:\n def manhattan_distance(p1, p2):\n return abs(p1[0] - p2[0]) + abs(p1[1] - p2[1])\n \n def max_distance(points):\n max_dist = 0\n for i in range(len(points)):\n for j in range(i + 1, len(points)):\n dist = manhattan_distance(points[i], points[j])\n max_dist = max(max_dist, dist)\n return max_dist\n \n min_max_dist = float(\"inf\")\n for i in range(len(points)):\n tmp_points = points[:i] + points[i+1:]\n min_max_dist = min(min_max_dist, max_distance(tmp_points))\n \n return min_max_dist", "class Solution:\n def minimumDistance(self, points: List[List[int]]) -> int:\n def manhattan_distance(p1, p2):\n return abs(p1[0] - p2[0]) + abs(p1[1] - p2[1])\n\n def max_distance(points):\n max_dist = 0\n for i in range(len(points)):\n for j in range(i + 1, len(points)):\n dist = manhattan_distance(points[i], points[j])\n max_dist = max(max_dist, dist)\n return max_dist\n\n min_max_dist = float(\"inf\")\n for i in range(len(points)):\n tmp_points = points[:i] + points[i + 1:]\n min_max_dist = min(min_max_dist, max_distance(tmp_points))\n\n return min_max_dist", "class Solution:\n def minimumDistance(self, points: List[List[int]]) -> int:\n def manhattan_distance(p1, p2):\n return abs(p1[0] - p2[0]) + abs(p1[1] - p2[1])\n\n def max_distance(points):\n max_dist = 0\n for i in range(len(points)):\n for j in range(i + 1, len(points)):\n dist = manhattan_distance(points[i], points[j])\n max_dist = max(max_dist, dist)\n return max_dist\n\n min_max_dist = float(\"inf\")\n for i in range(len(points)):\n dist_without_i = max_distance(points[:i] + points[i + 1:])\n min_max_dist = min(min_max_dist, dist_without_i)\n\n return min_max_dist", "class Solution:\n def minimumDistance(self, points: List[List[int]]) -> int:\n def manhattan_distance(p1, p2):\n return abs(p1[0] - p2[0]) + abs(p1[1] - p2[1])\n \n def max_distance(points):\n max_dist = 0\n for i in range(len(points)):\n for j in range(i + 1, len(points)):\n dist = manhattan_distance(points[i], points[j])\n max_dist = max(max_dist, dist)\n return max_dist\n \n min_max_dist = float(\"inf\")\n for i in range(len(points)):\n tmp_points = points[:i] + points[i+1:]\n min_max_dist = min(min_max_dist, max_distance(tmp_points))\n \n return min_max_dist", "class Solution:\n def minimumDistance(self, points: List[List[int]]) -> int:\n def manhattan_distance(p1, p2):\n return abs(p1[0] - p2[0]) + abs(p1[1] - p2[1])\n \n def max_distance(points):\n max_dist = 0\n for i in range(len(points)):\n for j in range(i + 1, len(points)):\n dist = manhattan_distance(points[i], points[j])\n max_dist = max(max_dist, dist)\n return max_dist\n \n min_max_dist = float('inf')\n for i in range(len(points)):\n remaining_points = points[:i] + points[i+1:]\n min_max_dist = min(min_max_dist, max_distance(remaining_points))\n \n return min_max_dist", "class Solution:\n def minimumDistance(self, points: List[List[int]]) -> int:\n def manhattan_distance(p1, p2):\n return abs(p1[0] - p2[0]) + abs(p1[1] - p2[1])\n \n def max_distance(points):\n max_dist = 0\n for i in range(len(points)):\n for j in range(i + 1, len(points)):\n dist = manhattan_distance(points[i], points[j])\n max_dist = max(max_dist, dist)\n return max_dist\n \n min_max_dist = float('inf')\n for i in range(len(points)):\n tmp_points = points[:i] + points[i+1:]\n min_max_dist = min(min_max_dist, max_distance(tmp_points))\n \n return min_max_dist", "class Solution:\n def minimumDistance(self, points: List[List[int]]) -> int:\n def manhattan_distance(p1, p2):\n return abs(p1[0] - p2[0]) + abs(p1[1] - p2[1])\n \n def max_distance(points):\n max_dist = 0\n for i in range(len(points)):\n for j in range(i + 1, len(points)):\n dist = manhattan_distance(points[i], points[j])\n max_dist = max(max_dist, dist)\n return max_dist\n \n min_max_dist = float('inf')\n for i in range(len(points)):\n dist_without_i = max_distance(points[:i] + points[i+1:])\n min_max_dist = min(min_max_dist, dist_without_i)\n \n return min_max_dist", "class Solution:\n def minimumDistance(self, points: List[List[int]]) -> int:\n def manhattan_distance(p1, p2):\n return abs(p1[0] - p2[0]) + abs(p1[1] - p2[1])\n \n def max_distance(points):\n max_dist = 0\n for i in range(len(points)):\n for j in range(i + 1, len(points)):\n dist = manhattan_distance(points[i], points[j])\n max_dist = max(max_dist, dist)\n return max_dist\n \n min_max_dist = float(\"inf\")\n for i in range(len(points)):\n tmp_points = points[:i] + points[i+1:]\n min_max_dist = min(min_max_dist, max_distance(tmp_points))\n \n return min_max_dist", "class Solution:\n def minimumDistance(self, points: List[List[int]]) -> int:\n def manhattan_distance(p1, p2):\n return abs(p1[0] - p2[0]) + abs(p1[1] - p2[1])\n \n n = len(points)\n max_dist = 0\n \n # Calculate the maximum distance between all pairs of points\n for i in range(n):\n for j in range(i + 1, n):\n dist = manhattan_distance(points[i], points[j])\n max_dist = max(max_dist, dist)\n \n # Calculate the maximum distance after removing each point\n min_max_dist = max_dist\n for i in range(n):\n tmp_max_dist = 0\n for j in range(n):\n if i != j:\n for k in range(n):\n if k != i and k != j:\n dist = manhattan_distance(points[j], points[k])\n tmp_max_dist = max(tmp_max_dist, dist)\n min_max_dist = min(min_max_dist, tmp_max_dist)\n \n return min_max_dist" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def sumOfPower(self, nums: List[int], k: int) -> int:\n n = len(nums)\n dp = [[0] * (k + 1) for _ in range(n + 1)]\n mod = 10**9 + 7\n\n for i in range(n + 1):\n dp[i][0] = 1\n\n for i in range(1, n + 1):\n for j in range(1, k + 1):\n dp[i][j] = dp[i - 1][j]\n if nums[i - 1] <= j:\n dp[i][j] += dp[i - 1][j - nums[i - 1]]\n dp[i][j] %= mod\n\n return dp[n][k]", "class Solution:\n def sumOfPower(self, nums: List[int], k: int) -> int:\n n = len(nums)\n dp = [[0] * (k + 1) for _ in range(n + 1)]\n dp[0][0] = 1\n\n for i in range(1, n + 1):\n dp[i][0] = 1\n for j in range(1, k + 1):\n dp[i][j] = dp[i - 1][j] + dp[i - 1][j - nums[i - 1]]\n dp[i][j] %= 1000000007\n\n return dp[n][k]", "class Solution:\n def sumOfPower(self, nums: List[int], k: int) -> int:\n n = len(nums)\n dp = [[0] * (k + 1) for _ in range(n + 1)]\n dp[0][0] = 1\n\n for i in range(1, n + 1):\n dp[i][0] = 1\n for j in range(1, k + 1):\n dp[i][j] = dp[i - 1][j] + dp[i - 1][j - nums[i - 1]]\n dp[i][j] %= 1000000007\n\n return dp[n][k]", "class Solution:\n def sumOfPower(self, nums: List[int], k: int) -> int:\n n = len(nums)\n dp = [[0] * (k + 1) for _ in range(n + 1)]\n mod = 10**9 + 7\n\n for i in range(n + 1):\n dp[i][0] = 1\n\n for i in range(1, n + 1):\n for j in range(1, k + 1):\n dp[i][j] = dp[i - 1][j]\n if nums[i - 1] <= j:\n dp[i][j] += dp[i - 1][j - nums[i - 1]]\n\n return dp[n][k] % mod", "class Solution:\n def sumOfPower(self, nums: List[int], k: int) -> int:\n n = len(nums)\n dp = [[0] * (k + 1) for _ in range(n + 1)]\n dp[0][0] = 1\n\n for i in range(1, n + 1):\n dp[i][0] = 1\n for j in range(1, k + 1):\n dp[i][j] = dp[i - 1][j] + dp[i - 1][j - nums[i - 1]]\n dp[i][j] %= 1000000007\n\n return dp[n][k]", "class Solution:\n def sumOfPower(self, nums: List[int], k: int) -> int:\n n = len(nums)\n dp = [[0] * (k + 1) for _ in range(n + 1)]\n for i in range(n + 1):\n dp[i][0] = 1\n\n for i in range(1, n + 1):\n for j in range(1, k + 1):\n dp[i][j] = dp[i - 1][j]\n if nums[i - 1] <= j:\n dp[i][j] += dp[i - 1][j - nums[i - 1]]\n\n return dp[n][k] % (10**9 + 7)", "class Solution:\n def sumOfPower(self, nums: List[int], k: int) -> int:\n n = len(nums)\n dp = [[0] * (k + 1) for _ in range(n + 1)]\n for i in range(n + 1):\n dp[i][0] = 1\n\n for i in range(1, n + 1):\n for j in range(1, k + 1):\n dp[i][j] = dp[i - 1][j]\n if nums[i - 1] <= j:\n dp[i][j] += dp[i - 1][j - nums[i - 1]]\n\n return dp[n][k] % (10**9 + 7)", "class Solution:\n def sumOfPower(self, nums: List[int], k: int) -> int:\n n = len(nums)\n dp = [[0] * (k + 1) for _ in range(n + 1)]\n mod = 10**9 + 7\n\n for i in range(n + 1):\n dp[i][0] = 1\n\n for i in range(1, n + 1):\n for j in range(1, k + 1):\n dp[i][j] = dp[i - 1][j]\n if nums[i - 1] <= j:\n dp[i][j] += dp[i - 1][j - nums[i - 1]]\n dp[i][j] %= mod\n\n return dp[n][k]", "class Solution:\n def sumOfPower(self, nums: List[int], k: int) -> int:\n n = len(nums)\n dp = [[0] * (k + 1) for _ in range(n + 1)]\n mod = 10**9 + 7\n\n for i in range(n + 1):\n dp[i][0] = 1\n\n for i in range(1, n + 1):\n for j in range(1, k + 1):\n dp[i][j] = dp[i - 1][j]\n if nums[i - 1] <= j:\n dp[i][j] += dp[i - 1][j - nums[i - 1]]\n dp[i][j] %= mod\n\n return dp[n][k]", "class Solution:\n def sumOfPower(self, nums: List[int], k: int) -> int:\n n = len(nums)\n dp = [[0] * (k + 1) for _ in range(n + 1)]\n for i in range(n + 1):\n dp[i][0] = 1\n\n for i in range(1, n + 1):\n for j in range(1, k + 1):\n dp[i][j] = dp[i - 1][j]\n if nums[i - 1] <= j:\n dp[i][j] += dp[i - 1][j - nums[i - 1]]\n\n return dp[n][k] % (10**9 + 7)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def getSmallestString(self, s: str, k: int) -> str:\n alphabet = list('abcdefghijklmnopqrstuvwxyz')\n alphabet_dict = {char: idx for idx, char in enumerate(alphabet)}\n\n def distance(s1, s2):\n return sum(min(abs(alphabet_dict[s1[i]] - alphabet_dict[s2[i]]), 26 - abs(alphabet_dict[s1[i]] - alphabet_dict[s2[i]])) for i in range(len(s1)))\n\n if k == 0:\n return s\n\n for i in range(len(s) - 1, -1, -1):\n if k - (alphabet_dict[s[i]] + 1) >= 0:\n k -= alphabet_dict[s[i]] + 1\n s = s[:i] + 'a' + s[i + 1:]\n else:\n s = s[:i] + alphabet[alphabet_dict[s[i]] - k % 26] + s[i + 1:]\n break\n\n return s", "class Solution:\n def getSmallestString(self, s: str, k: int) -> str:\n alphabet = list('abcdefghijklmnopqrstuvwxyz')\n alphabet_dict = {letter: idx for idx, letter in enumerate(alphabet)}\n\n def distance(s1, s2):\n return sum(min(abs(alphabet_dict[c1] - alphabet_dict[c2]), 26 - abs(alphabet_dict[c1] - alphabet_dict[c2])) for c1, c2 in zip(s1, s2))\n\n s_list = list(s)\n n = len(s)\n for i in range(n):\n s_list[i] = alphabet[0]\n\n result = ''.join(s_list)\n remaining_distance = k\n\n for i in range(n - 1, -1, -1):\n while remaining_distance > 0:\n prev_dist = distance(result, s)\n s_list[i] = alphabet[(alphabet_dict[s_list[i]] + 1) % 26]\n new_dist = distance(result, s)\n remaining_distance -= new_dist - prev_dist\n result = ''.join(s_list)\n if new_dist > k:\n s_list[i] = alphabet[(alphabet_dict[s_list[i]] - 1) % 26]\n remaining_distance += new_dist - prev_dist\n break\n\n return result", "class Solution:\n def getSmallestString(self, s: str, k: int) -> str:\n alphabet = list('abcdefghijklmnopqrstuvwxyz')\n dist = [0] * 26\n for i in range(1, 26):\n dist[i] = (dist[i - 1] + alphabet[i - 1] - alphabet[i]) % 26\n\n def get_distance(ch1, ch2):\n return dist[alphabet.index(ch2) - alphabet.index(ch1)]\n\n def is_valid(s, k):\n total_dist = 0\n for i in range(len(s)):\n total_dist += get_distance(s[i], alphabet[i])\n return total_dist <= k\n\n result = s\n for i in range(len(s)):\n for j in alphabet:\n s_new = s[:i] + j + s[i + 1:]\n if is_valid(s_new, k) and s_new < result:\n result = s_new\n\n return result", "class Solution:\n def getSmallestString(self, s: str, k: int) -> str:\n alphabet = list('abcdefghijklmnopqrstuvwxyz')\n dist = [0] * 26\n for i in range(1, 26):\n dist[i] = dist[i - 1] + (26 - i) + i\n \n def total_distance(s):\n return sum(dist[ord(c) - ord('a') - 1] for c in s)\n \n def smallest_string(k):\n if k == 0:\n return s\n res = ['a'] * len(s)\n k -= len(s)\n for i in range(len(s) - 1, -1, -1):\n if k <= 0:\n break\n res[i] = chr(ord('a') + (k + i) % 26)\n k -= 26 - (k + i) % 26\n return ''.join(res)\n \n s = smallest_string(k)\n while total_distance(s) > k:\n for i in range(len(s) - 1, -1, -1):\n if s[i] != 'z':\n s = s[:i] + chr(ord(s[i]) - 1) + s[i + 1:]\n break\n \n return s", "class Solution:\n def getSmallestString(self, s: str, k: int) -> str:\n alphabet = list('abcdefghijklmnopqrstuvwxyz')\n dist = [0] * 26\n for i in range(1, 26):\n dist[i] = dist[i - 1] + (26 - i) + i\n\n def get_distance(c1, c2):\n return min(dist[ord(c2) - ord(c1)], dist[ord(c1) - ord(c2)])\n\n def dfs(index, k):\n if k < 0:\n return \"\"\n if index == len(s):\n return \"\"\n min_str = \"z\"\n min_k = k\n for c in alphabet:\n new_k = k - get_distance(s[index], c)\n if new_k < 0:\n continue\n candidate = dfs(index + 1, new_k)\n if candidate:\n if candidate < min_str or (candidate == min_str and c < min_str[0]):\n min_str = c + candidate\n min_k = new_k\n return min_str\n\n return dfs(0, k)", "class Solution:\n def getSmallestString(self, s: str, k: int) -> str:\n alphabet = list('abcdefghijklmnopqrstuvwxyz')\n alphabet_dict = {char: idx for idx, char in enumerate(alphabet)}\n s_list = list(s)\n n = len(s)\n\n for i in range(n):\n s_list[i] = alphabet[(alphabet_dict[s_list[i]] + k) % 26]\n k -= min(alphabet_dict[s_list[i]], alphabet_dict[s[i]])\n if k <= 0:\n break\n\n return ''.join(s_list)", "class Solution:\n def getSmallestString(self, s: str, k: int) -> str:\n alphabet = list('abcdefghijklmnopqrstuvwxyz')\n alphabet_dict = {char: idx for idx, char in enumerate(alphabet)}\n\n def distance(s1, s2):\n return sum(min(abs(alphabet_dict[s1[i]] - alphabet_dict[s2[i]]), 26 - abs(alphabet_dict[s1[i]] - alphabet_dict[s2[i]])) for i in range(len(s1)))\n\n s_list = list(s)\n for i in range(len(s) - 1, -1, -1):\n if k >= 26:\n k -= 26\n s_list[i] = 'a'\n else:\n s_list[i] = alphabet[alphabet_dict[s_list[i]] + k]\n break\n\n return ''.join(s_list)", "class Solution:\n def getSmallestString(self, s: str, k: int) -> str:\n alphabet = list('abcdefghijklmnopqrstuvwxyz')\n dist = [0] * 26\n for i in range(1, 26):\n dist[i] = (dist[i - 1] + alphabet[i - 1] - alphabet[i]) % 26\n\n def get_distance(ch1, ch2):\n return dist[alphabet.index(ch2) - alphabet.index(ch1)]\n\n def is_valid(s, k):\n return sum(get_distance(s1, s2) for s1, s2 in zip(s, t)) <= k\n\n def helper(s, t, k):\n if is_valid(s, k):\n return t\n for i in range(len(t)):\n if t[i] != 'a':\n for j in range(ord('a'), ord(t[i])):\n new_char = chr(j)\n new_t = t[:i] + new_char + t[i + 1:]\n if helper(s, new_t, k):\n return new_t\n return t\n\n t = list(s)\n for i in range(len(t)):\n t[i] = 'a'\n t = ''.join(t)\n return helper(s, t, k)", "class Solution:\n def getSmallestString(self, s: str, k: int) -> str:\n alphabet = list('abcdefghijklmnopqrstuvwxyz')\n dist = [0] * 26\n for i in range(1, 26):\n dist[i] = (dist[i - 1] + alphabet[i - 1] - alphabet[i]) % 26\n\n def get_distance(ch1, ch2):\n return min(abs(alphabet.index(ch1) - alphabet.index(ch2)), dist[alphabet.index(ch1)] + alphabet.index(ch2), alphabet.index(ch1) + 26 - alphabet.index(ch2))\n\n def dfs(index, k, string):\n if k < 0:\n return\n\n if index == len(s):\n result[0] = min(result[0], string, key=lambda x: (x, len(x)))\n return\n\n for ch in 'abcdefghijklmnopqrstuvwxyz':\n new_k = k - get_distance(s[index], ch)\n if new_k >= 0:\n dfs(index + 1, new_k, string + ch)\n\n result = [s]\n dfs(0, k, '')\n return result[0]", "class Solution:\n def getSmallestString(self, s: str, k: int) -> str:\n alphabet = list('abcdefghijklmnopqrstuvwxyz')\n dist = [0] * 26\n for i in range(1, 26):\n dist[i] = dist[i - 1] + (26 - i) + i\n\n def min_dist(c1, c2):\n return min(abs(alphabet.index(c1) - alphabet.index(c2)),\n 26 - abs(alphabet.index(c1) - alphabet.index(c2)))\n\n def dfs(idx, k):\n if k < 0:\n return \"\"\n if idx == len(s):\n return \"\"\n res = \"z\"\n for i in range(26):\n char = alphabet[i]\n if k >= dist[min_dist(char, s[idx])]:\n k -= dist[min_dist(char, s[idx])]\n temp = char + dfs(idx + 1, k)\n if temp < res:\n res = temp\n k += dist[min_dist(char, s[idx])]\n return res\n\n return dfs(0, k)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def resultArray(self, nums: List[int]) -> List[int]:\n arr1, arr2 = [nums[0]], [nums[1]]\n for i in range(2, len(nums)):\n if arr1[-1] > arr2[-1]:\n arr1.append(nums[i])\n else:\n arr2.append(nums[i])\n return arr1 + arr2", "class Solution:\n def resultArray(self, nums: List[int]) -> List[int]:\n arr1, arr2 = [nums[0]], [nums[1]]\n for i in range(2, len(nums)):\n if arr1[-1] > arr2[-1]:\n arr1.append(nums[i])\n else:\n arr2.append(nums[i])\n return arr1 + arr2", "class Solution:\n def resultArray(self, nums: List[int]) -> List[int]:\n arr1, arr2 = [nums[0]], [nums[1]]\n for i in range(2, len(nums)):\n if arr1[-1] > arr2[-1]:\n arr1.append(nums[i])\n else:\n arr2.append(nums[i])\n return arr1 + arr2", "class Solution:\n def resultArray(self, nums: List[int]) -> List[int]:\n arr1, arr2 = [nums[0]], [nums[1]]\n for i in range(2, len(nums)):\n if arr1[-1] > arr2[-1]:\n arr1.append(nums[i])\n else:\n arr2.append(nums[i])\n return arr1 + arr2", "class Solution:\n def resultArray(self, nums: List[int]) -> List[int]:\n arr1, arr2 = [nums[0]], [nums[1]]\n for i in range(2, len(nums)):\n if arr1[-1] > arr2[-1]:\n arr1.append(nums[i])\n else:\n arr2.append(nums[i])\n return arr1 + arr2", "class Solution:\n def resultArray(self, nums: List[int]) -> List[int]:\n arr1, arr2 = [nums[0]], [nums[1]]\n for i in range(2, len(nums)):\n if arr1[-1] > arr2[-1]:\n arr1.append(nums[i])\n else:\n arr2.append(nums[i])\n return arr1 + arr2", "class Solution:\n def resultArray(self, nums: List[int]) -> List[int]:\n arr1, arr2 = [nums[0]], [nums[1]]\n for i in range(2, len(nums)):\n if arr1[-1] > arr2[-1]:\n arr1.append(nums[i])\n else:\n arr2.append(nums[i])\n return arr1 + arr2", "class Solution:\n def resultArray(self, nums: List[int]) -> List[int]:\n arr1, arr2 = [nums[0]], [nums[1]]\n for i in range(2, len(nums)):\n if arr1[-1] > arr2[-1]:\n arr1.append(nums[i])\n else:\n arr2.append(nums[i])\n return arr1 + arr2", "class Solution:\n def resultArray(self, nums: List[int]) -> List[int]:\n arr1, arr2 = [nums[0]], [nums[1]]\n for i in range(2, len(nums)):\n if arr1[-1] > arr2[-1]:\n arr1.append(nums[i])\n else:\n arr2.append(nums[i])\n return arr1 + arr2", "class Solution:\n def resultArray(self, nums: List[int]) -> List[int]:\n arr1, arr2 = [nums[0]], [nums[1]]\n for i in range(2, len(nums)):\n if arr1[-1] > arr2[-1]:\n arr1.append(nums[i])\n else:\n arr2.append(nums[i])\n return arr1 + arr2" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumLengthSubstring(self, s: str) -> int:\n max_length = 0\n left = 0\n char_count = {}\n\n for right in range(len(s)):\n char_count[s[right]] = char_count.get(s[right], 0) + 1\n\n while char_count[s[right]] > 2:\n char_count[s[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maximumLengthSubstring(self, s: str) -> int:\n max_length = 0\n left = 0\n char_count = {}\n\n for right in range(len(s)):\n char_count[s[right]] = char_count.get(s[right], 0) + 1\n\n while char_count[s[right]] > 2:\n char_count[s[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maximumLengthSubstring(self, s: str) -> int:\n max_length = 0\n left = 0\n char_count = {}\n\n for right, char in enumerate(s):\n char_count[char] = char_count.get(char, 0) + 1\n\n while char_count[char] > 2:\n char_count[s[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maximumLengthSubstring(self, s: str) -> int:\n max_length = 0\n left = 0\n char_count = {}\n\n for right in range(len(s)):\n char_count[s[right]] = char_count.get(s[right], 0) + 1\n\n while char_count[s[right]] > 2:\n char_count[s[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maximumLengthSubstring(self, s: str) -> int:\n max_length = 0\n left = 0\n char_count = {}\n\n for right, char in enumerate(s):\n char_count[char] = char_count.get(char, 0) + 1\n\n while char_count[char] > 2:\n char_count[s[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maximumLengthSubstring(self, s: str) -> int:\n max_length = 0\n left = 0\n char_count = {}\n\n for right in range(len(s)):\n char = s[right]\n char_count[char] = char_count.get(char, 0) + 1\n\n while char_count[char] > 2:\n char_count[s[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maximumLengthSubstring(self, s: str) -> int:\n max_length = 0\n left = 0\n char_count = {}\n\n for right in range(len(s)):\n char = s[right]\n char_count[char] = char_count.get(char, 0) + 1\n\n while char_count[char] > 2:\n char_count[s[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maximumLengthSubstring(self, s: str) -> int:\n max_length = 0\n left = 0\n char_count = {}\n\n for right in range(len(s)):\n char_count[s[right]] = char_count.get(s[right], 0) + 1\n\n while char_count[s[right]] > 2:\n char_count[s[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maximumLengthSubstring(self, s: str) -> int:\n max_length = 0\n left = 0\n char_count = {}\n\n for right in range(len(s)):\n char = s[right]\n char_count[char] = char_count.get(char, 0) + 1\n\n while char_count[char] > 2:\n char_count[s[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length", "class Solution:\n def maximumLengthSubstring(self, s: str) -> int:\n max_length = 0\n left = 0\n char_count = {}\n\n for right in range(len(s)):\n char = s[right]\n char_count[char] = char_count.get(char, 0) + 1\n\n while char_count[char] > 2:\n char_count[s[left]] -= 1\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumHappinessSum(self, happiness: List[int], k: int) -> int:\n n = len(happiness)\n if n == k:\n return sum(happiness)\n \n happiness.sort(reverse=True)\n total_sum = sum(happiness[:k])\n for i in range(k, n):\n total_sum += max(0, happiness[i] - i + k - 1)\n \n return total_sum", "class Solution:\n def maximumHappinessSum(self, happiness: List[int], k: int) -> int:\n n = len(happiness)\n if n == k:\n return sum(happiness)\n \n happiness.sort(reverse=True)\n happiness = [max(h, 0) for h in happiness]\n \n dp = [0] * (k + 1)\n for i in range(1, k + 1):\n dp[i] = happiness[i - 1] + dp[i - 1] - (i - 1)\n \n return dp[k]", "class Solution:\n def maximumHappinessSum(self, happiness: List[int], k: int) -> int:\n n = len(happiness)\n if n == k:\n return sum(happiness)\n \n happiness.sort(reverse=True)\n total_sum = 0\n for i in range(k):\n total_sum += max(0, happiness[i])\n for j in range(i+1, n):\n happiness[j] = max(0, happiness[j] - 1)\n \n return total_sum", "class Solution:\n def maximumHappinessSum(self, happiness: List[int], k: int) -> int:\n n = len(happiness)\n if n == k:\n return sum(happiness)\n \n happiness.sort(reverse=True)\n happiness = [h for h in happiness if h > 0]\n n = len(happiness)\n \n dp = [0] * (n + 1)\n for i in range(1, n + 1):\n dp[i] = max(dp[i - 1], happiness[i - 1] + (i - 1 - k + 1) + dp[max(0, i - k)])\n \n return dp[n]", "class Solution:\n def maximumHappinessSum(self, happiness: List[int], k: int) -> int:\n n = len(happiness)\n if n == k:\n return sum(happiness)\n \n happiness.sort(reverse=True)\n total_sum = sum(happiness[:k])\n for i in range(k, n):\n total_sum += max(0, happiness[i] - i + k - 1)\n \n return total_sum", "class Solution:\n def maximumHappinessSum(self, happiness: List[int], k: int) -> int:\n n = len(happiness)\n if n == 1:\n return happiness[0]\n \n happiness.sort(reverse=True)\n \n dp = [0] * n\n dp[0] = happiness[0]\n \n for i in range(1, n):\n dp[i] = max(dp[i-1], happiness[i] + dp[i-1] - i)\n \n return dp[k-1]", "class Solution:\n def maximumHappinessSum(self, happiness: List[int], k: int) -> int:\n n = len(happiness)\n happiness.sort(reverse=True)\n\n total_sum = 0\n for i in range(k):\n total_sum += max(0, happiness[i])\n for j in range(i + 1, n):\n happiness[j] = max(0, happiness[j] - 1)\n\n return total_sum", "class Solution:\n def maximumHappinessSum(self, happiness: List[int], k: int) -> int:\n n = len(happiness)\n if n == k:\n return sum(happiness)\n \n happiness.sort(reverse=True)\n total_sum = 0\n for i in range(k):\n total_sum += max(0, happiness[i])\n for j in range(i+1, n):\n happiness[j] = max(0, happiness[j] - 1)\n \n return total_sum", "class Solution:\n def maximumHappinessSum(self, happiness: List[int], k: int) -> int:\n n = len(happiness)\n if n == k:\n return sum(happiness)\n \n happiness.sort(reverse=True)\n total_sum = sum(happiness[:k])\n for i in range(k, n):\n total_sum += max(0, happiness[i] - i + k - 1)\n \n return total_sum", "class Solution:\n def maximumHappinessSum(self, happiness: List[int], k: int) -> int:\n n = len(happiness)\n if n == k:\n return sum(happiness)\n \n happiness.sort(reverse=True)\n happiness = [h - i for i, h in enumerate(happiness)]\n \n return sum(happiness[:k])" ], "pass1_list": [ false, false, false, false, false, true, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def isSubstringPresent(self, s: str) -> bool:\n n = len(s)\n for i in range(n - 1):\n if s[i:i + 2] in s[n - 1::-1]:\n return True\n return False", "class Solution:\n def isSubstringPresent(self, s: str) -> bool:\n n = len(s)\n for i in range(n - 1):\n if s[i:i + 2] in s[n - 1::-1]:\n return True\n return False", "class Solution:\n def isSubstringPresent(self, s: str) -> bool:\n n = len(s)\n for i in range(n - 1):\n if s[i:i + 2] in s[n - 1:i - 1:-1]:\n return True\n return False", "class Solution:\n def isSubstringPresent(self, s: str) -> bool:\n n = len(s)\n for i in range(n - 1):\n if s[i:i + 2] in s[n - 1::-1]:\n return True\n return False", "class Solution:\n def isSubstringPresent(self, s: str) -> bool:\n n = len(s)\n for i in range(n - 1):\n if s[i:i + 2] in s[n - 1::-1]:\n return True\n return False", "class Solution:\n def isSubstringPresent(self, s: str) -> bool:\n n = len(s)\n for i in range(n - 1):\n if s[i:i + 2] in s[n - 1::-1]:\n return True\n return False", "class Solution:\n def isSubstringPresent(self, s: str) -> bool:\n n = len(s)\n for i in range(n - 1):\n if s[i:i + 2] in s[n - 1::-1]:\n return True\n return False", "class Solution:\n def isSubstringPresent(self, s: str) -> bool:\n n = len(s)\n for i in range(n - 1):\n if s[i:i + 2] in s[n - 1::-1]:\n return True\n return False", "class Solution:\n def isSubstringPresent(self, s: str) -> bool:\n n = len(s)\n for i in range(n - 1):\n if s[i:i + 2] in s[n - 1::-1]:\n return True\n return False", "class Solution:\n def isSubstringPresent(self, s: str) -> bool:\n n = len(s)\n for i in range(n - 1):\n if s[i:i + 2] in s[n - 1::-1]:\n return True\n return False" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimizeStringValue(self, s: str) -> str:\n letter_counts = [0] * 26\n for c in s:\n if c != '?':\n letter_counts[ord(c) - ord('a')] += 1\n\n min_value = sum(min(count, 1) for count in letter_counts)\n result = []\n used_letters = set()\n\n for c in s:\n if c != '?':\n result.append(c)\n used_letters.add(c)\n else:\n for letter in 'abcdefghijklmnopqrstuvwxyz':\n if letter not in used_letters:\n letter_counts[ord(letter) - ord('a')] += 1\n if sum(min(count, 1) for count in letter_counts) == min_value:\n result.append(letter)\n used_letters.add(letter)\n break\n letter_counts[ord(letter) - ord('a')] -= 1\n\n return \"\".join(result)", "class Solution:\n def minimizeStringValue(self, s: str) -> str:\n letter_counts = [0] * 26\n for c in s:\n if c != '?':\n letter_counts[ord(c) - ord('a')] += 1\n\n min_value = sum(min(count, 1) for count in letter_counts)\n min_str = \"\"\n\n for i, count in enumerate(letter_counts):\n if count == 0:\n min_str += chr(i + ord('a'))\n\n for c in s:\n if c != '?':\n min_str += c\n else:\n min_str += 'a'\n\n return min_str if min_value == 0 else self.helper(s, letter_counts, min_value, min_str)\n\n def helper(self, s, letter_counts, min_value, min_str):\n for i in range(len(s)):\n if s[i] == '?':\n for c in 'abcdefghijklmnopqrstuvwxyz':\n new_letter_counts = letter_counts.copy()\n new_letter_counts[ord(c) - ord('a')] += 1\n new_min_value = min_value\n for j, count in enumerate(new_letter_counts):\n if count > 1:\n new_min_value += count - 1\n\n new_min_str = min_str[:i] + c\n for j in range(i + 1, len(s)):\n if s[j] != '?':\n new_min_str += s[j]\n else:\n new_min_str += 'a'\n for k in range(ord(c) + 1, ord('z') + 1):\n if new_letter_counts[k - ord('a')] == 0:\n new_min_str = min_str[:j] + chr(k)\n new_letter_counts[k - ord('a')] += 1\n break\n break\n\n if new_min_value < min_value or (new_min_value == min_value and new_min_str < min_str):\n min_value = new_min_value\n min_str = new_min_str\n\n return min_str", "class Solution:\n def minimizeStringValue(self, s: str) -> str:\n letter_counts = [0] * 26\n for i, c in enumerate(s):\n if c != '?':\n letter_counts[ord(c) - ord('a')] += 1\n \n result = []\n for c in s:\n if c == '?':\n for j in range(26):\n if letter_counts[j] == 0:\n result.append(chr(ord('a') + j))\n letter_counts[j] = 1\n break\n else:\n result.append(c)\n \n return \"\".join(result)", "class Solution:\n def minimizeStringValue(self, s: str) -> str:\n letter_counts = [0] * 26\n for c in s:\n if c != '?':\n letter_counts[ord(c) - ord('a')] += 1\n\n min_value = sum(min(count, 1) for count in letter_counts)\n min_str = ''.join(chr(ord('a') + i) for i, count in enumerate(letter_counts) if count >= 1)\n\n for i, c in enumerate(s):\n if c == '?':\n letter_counts[ord(min_str[i]) - ord('a')] -= 1\n letter_counts[ord('a') + i] += 1\n min_str = min_str[:i] + chr(ord('a') + i) + min_str[i + 1:]\n\n return min_str", "class Solution:\n def minimizeStringValue(self, s: str) -> str:\n letter_counts = [0] * 26\n for c in s:\n if c != '?':\n letter_counts[ord(c) - ord('a')] += 1\n\n result = []\n for c in s:\n if c == '?':\n min_count = float('inf')\n min_letter = 'z'\n for i in range(26):\n if letter_counts[i] < min_count:\n min_count = letter_counts[i]\n min_letter = chr(i + ord('a'))\n result.append(min_letter)\n letter_counts[ord(min_letter) - ord('a')] += 1\n else:\n result.append(c)\n\n return ''.join(result)", "class Solution:\n def minimizeStringValue(self, s: str) -> str:\n letter_counts = [0] * 26\n for c in s:\n if c != '?':\n letter_counts[ord(c) - ord('a')] += 1\n\n min_value = sum(min(count, 1) for count in letter_counts)\n min_string = ''.join(chr(ord('a') + i) for i, count in enumerate(letter_counts) if count >= 1)\n\n for i, c in enumerate(s):\n if c == '?':\n letter_counts[ord(min_string[i]) - ord('a')] -= 1\n letter_counts[ord('a') + i] += 1\n min_string = min_string[:i] + chr(ord('a') + i) + min_string[i + 1:]\n\n return min_string", "class Solution:\n def minimizeStringValue(self, s: str) -> str:\n letter_counts = [0] * 26\n cost = 0\n result = []\n\n for ch in s:\n if ch != '?':\n count = letter_counts[ord(ch) - ord('a')]\n cost += count\n letter_counts[ord(ch) - ord('a')] += 1\n else:\n min_cost_letter = 'a'\n min_cost = float('inf')\n for i in range(26):\n letter = chr(ord('a') + i)\n count = letter_counts[i]\n if count < min_cost:\n min_cost = count\n min_cost_letter = letter\n letter_counts[ord(min_cost_letter) - ord('a')] += 1\n cost += 1\n result.append(min_cost_letter)\n\n return ''.join(result)", "class Solution:\n def minimizeStringValue(self, s: str) -> str:\n letter_counts = [0] * 26\n for c in s:\n if c != '?':\n letter_counts[ord(c) - ord('a')] += 1\n\n min_value = sum(min(count, 1) for count in letter_counts)\n min_str = ''.join(chr(ord('a') + i) for i, count in enumerate(letter_counts) if count >= 1)\n\n for i, c in enumerate(s):\n if c == '?':\n letter_counts[ord(min_str[i]) - ord('a')] -= 1\n letter_counts[ord('a') + i] += 1\n min_str = min_str[:i] + chr(ord('a') + i) + min_str[i + 1:]\n\n return min_str", "class Solution:\n def minimizeStringValue(self, s: str) -> str:\n letter_counts = [0] * 26\n for c in s:\n if c != '?':\n letter_counts[ord(c) - ord('a')] += 1\n\n min_value = sum(min(count, 1) for count in letter_counts)\n min_str = ''.join(chr(ord('a') + i) for i in range(26) if letter_counts[i] > 0)\n\n for i, c in enumerate(s):\n if c == '?':\n letter_counts[ord(min_str[i]) - ord('a')] -= 1\n min_str = min_str[:i] + 'a' + min_str[i + 1:]\n for j in range(i + 1, len(s)):\n if s[j] != '?' and s[j] != min_str[j]:\n break\n if s[j] == '?' and letter_counts[ord(min_str[j]) - ord('a')] > 0:\n letter_counts[ord(min_str[j]) - ord('a')] -= 1\n min_str = min_str[:j] + min_str[j] + min_str[j + 1:]\n else:\n for k in range(25, -1, -1):\n if letter_counts[k] > 0:\n letter_counts[k] -= 1\n min_str = min_str[:j] + chr(ord('a') + k) + min_str[j + 1:]\n break\n break\n\n return min_str", "class Solution:\n def minimizeStringValue(self, s: str) -> str:\n letter_counts = [0] * 26\n for c in s:\n if c != '?':\n letter_counts[ord(c) - ord('a')] += 1\n\n result = []\n for c in s:\n if c == '?':\n for i in range(26):\n if letter_counts[i] == 0:\n result.append(chr(i + ord('a')))\n letter_counts[i] = 1\n break\n else:\n result.append(c)\n\n return \"\".join(result)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumLevels(self, possible: List[int]) -> int:\n n = len(possible)\n total_points = sum(possible)\n if total_points <= 0:\n return -1\n \n bob_points = [0] * n\n bob_points[-1] = possible[-1]\n for i in range(n - 2, -1, -1):\n bob_points[i] = bob_points[i + 1] + possible[i]\n \n alice_points = [0] * n\n alice_points[0] = possible[0]\n for i in range(1, n):\n alice_points[i] = alice_points[i - 1] + possible[i]\n \n for i in range(1, n):\n if alice_points[i - 1] > bob_points[i]:\n return i\n \n return -1", "class Solution:\n def minimumLevels(self, possible: List[int]) -> int:\n n = len(possible)\n total_points = sum(possible)\n if total_points <= 0:\n return -1\n \n left_points = [0] * n\n right_points = [0] * n\n \n left_sum = 0\n for i in range(n):\n left_sum += possible[i]\n left_points[i] = left_sum\n \n right_sum = 0\n for i in range(n - 1, -1, -1):\n right_sum += possible[i]\n right_points[i] = right_sum\n \n alice_max_points = 0\n for i in range(1, n):\n alice_points = left_points[i - 1] + right_points[i] - 1\n bob_points = total_points - alice_points - 2\n if alice_points > bob_points:\n alice_max_points = max(alice_max_points, alice_points)\n \n if alice_max_points <= 0:\n return -1\n return min(i + 1 for i in range(1, n) if alice_max_points == left_points[i - 1] + right_points[i] - 1)", "class Solution:\n def minimumLevels(self, possible: List[int]) -> int:\n n = len(possible)\n total_points = sum(possible)\n if total_points < 2:\n return -1\n \n bob_points = [0] * n\n bob_points[-1] = possible[-1]\n for i in range(n - 2, -1, -1):\n bob_points[i] = bob_points[i + 1] + possible[i]\n \n alice_points = [0] * n\n alice_points[0] = possible[0]\n for i in range(1, n):\n alice_points[i] = alice_points[i - 1] + possible[i]\n \n min_levels = n\n for i in range(1, n):\n if alice_points[i - 1] > bob_points[i]:\n min_levels = i\n break\n \n return min_levels", "class Solution:\n def minimumLevels(self, possible: List[int]) -> int:\n n = len(possible)\n total_points = sum(possible)\n if total_points <= 0:\n return -1\n \n bob_points = [0] * n\n bob_points[-1] = possible[-1]\n for i in range(n - 2, -1, -1):\n bob_points[i] = bob_points[i + 1] + possible[i]\n \n alice_points = [0] * n\n alice_points[0] = possible[0]\n for i in range(1, n):\n alice_points[i] = alice_points[i - 1] + possible[i]\n \n min_levels = n\n for i in range(n - 1):\n if alice_points[i] > bob_points[i + 1]:\n min_levels = i\n break\n \n return min_levels + 1", "class Solution:\n def minimumLevels(self, possible: List[int]) -> int:\n n = len(possible)\n total_points = sum(possible)\n if total_points <= 0:\n return -1\n \n bob_points = [0] * n\n bob_points[-1] = possible[-1]\n for i in range(n - 2, -1, -1):\n bob_points[i] = bob_points[i + 1] + possible[i]\n \n alice_points = [0] * n\n alice_points[0] = possible[0]\n for i in range(1, n):\n alice_points[i] = alice_points[i - 1] + possible[i]\n \n for i in range(n - 1):\n if alice_points[i] > bob_points[i + 1]:\n return i + 1\n \n return -1", "class Solution:\n def minimumLevels(self, possible: List[int]) -> int:\n n = len(possible)\n total_points = sum(possible)\n if total_points <= 0:\n return -1\n \n bob_points = [0] * (n + 1)\n bob_points[n - 1] = possible[n - 1]\n for i in range(n - 2, -1, -1):\n bob_points[i] = bob_points[i + 1] + possible[i]\n \n alice_points = [0] * n\n alice_points[0] = possible[0]\n for i in range(1, n):\n alice_points[i] = alice_points[i - 1] + possible[i]\n \n min_levels = n\n for i in range(n - 1):\n if alice_points[i] > bob_points[i + 1]:\n min_levels = i + 1\n break\n \n return min_levels", "class Solution:\n def minimumLevels(self, possible: List[int]) -> int:\n n = len(possible)\n total_points = sum(possible)\n if total_points <= 0:\n return -1\n \n bob_points = [0] * (n + 1)\n for i in range(n - 1, -1, -1):\n bob_points[i] = bob_points[i + 1] + possible[i]\n \n alice_min_levels = n\n for i in range(n):\n if bob_points[i + 1] < (i + 1) - bob_points[i + 1]:\n alice_min_levels = i\n break\n \n return alice_min_levels + 1", "class Solution:\n def minimumLevels(self, possible: List[int]) -> int:\n n = len(possible)\n total_points = sum(possible)\n if total_points < 2:\n return -1\n\n bob_points = [0] * (n + 1)\n bob_points[-1] = total_points\n for i in range(n - 2, -1, -1):\n if possible[i]:\n bob_points[i] = bob_points[i + 1] - 2\n\n alice_points = [0] * n\n for i in range(n):\n if possible[i]:\n alice_points[i] = 1\n if i > 0:\n alice_points[i] += alice_points[i - 1]\n\n for i in range(n - 1):\n if alice_points[i] > bob_points[i + 1]:\n return i + 1\n\n return -1", "class Solution:\n def minimumLevels(self, possible: List[int]) -> int:\n n = len(possible)\n total_points = sum(possible)\n \n if total_points <= 0:\n return -1\n \n bob_points = [0] * n\n bob_points[-1] = possible[-1]\n for i in range(n - 2, -1, -1):\n bob_points[i] = bob_points[i + 1] + possible[i]\n \n alice_points = [0] * n\n alice_points[0] = possible[0]\n for i in range(1, n):\n alice_points[i] = alice_points[i - 1] + possible[i]\n \n for i in range(n - 1):\n if alice_points[i] > bob_points[i + 1]:\n return i + 1\n \n return -1", "class Solution:\n def minimumLevels(self, possible: List[int]) -> int:\n n = len(possible)\n total_points = sum(possible)\n \n if total_points <= 0:\n return -1\n \n bob_points = [0] * n\n bob_points[-1] = possible[-1]\n for i in range(n - 2, -1, -1):\n bob_points[i] = bob_points[i + 1] + possible[i]\n \n alice_points = [0] * n\n for i in range(n):\n alice_points[i] = possible[i] - bob_points[i]\n \n min_levels = n\n for i in range(n):\n if alice_points[i] > 0:\n min_levels = i\n break\n \n return min_levels + 1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def shortestSubstrings(self, arr: List[str]) -> List[str]:\n def find_shortest_unique_substring(s, strings):\n n = len(s)\n for i in range(n, 0, -1):\n for string in strings:\n if i <= len(string) and s[i-1] in string[len(string)-i:]:\n break\n else:\n return s[:i]\n return \"\"\n\n answer = []\n for s in arr:\n strings = arr.copy()\n strings.remove(s)\n answer.append(find_shortest_unique_substring(s, strings))\n return answer", "class Solution:\n def shortestSubstrings(self, arr: List[str]) -> List[str]:\n def find_shortest_unique_substring(s, strings):\n for i in range(len(s), 0, -1):\n for sub in (s[j:j+i] for j in range(len(s) - i + 1)):\n if all(sub not in other for other in strings if other != s):\n return sub\n return \"\"\n\n return [find_shortest_unique_substring(s, arr) for s in arr]", "class Solution:\n def shortestSubstrings(self, arr: List[str]) -> List[str]:\n def find_shortest_unique_substring(s, strings):\n n = len(s)\n for i in range(n, 0, -1):\n for string in strings:\n if i <= len(string) and s[:i] in string:\n break\n else:\n return s[:i]\n return \"\"\n\n return [find_shortest_unique_substring(s, arr) for s in arr]", "class Solution:\n def shortestSubstrings(self, arr: List[str]) -> List[str]:\n def find_shortest_unique_substring(s, strings):\n unique_substrings = []\n for i in range(len(s)):\n for j in range(i + 1, len(s) + 1):\n substring = s[i:j]\n if all(substring not in other for other in strings if other != s) and (not unique_substrings or len(substring) < len(unique_substrings[0]) or (len(substring) == len(unique_substrings[0]) and substring < unique_substrings[0])):\n unique_substrings = [substring]\n elif all(substring not in other for other in strings if other != s) and substring < unique_substrings[0]:\n unique_substrings.insert(0, substring)\n return unique_substrings[0] if unique_substrings else \"\"\n\n return [find_shortest_unique_substring(s, arr) for s in arr]", "class Solution:\n def shortestSubstrings(self, arr: List[str]) -> List[str]:\n def find_shortest_unique_substring(s, strings):\n for i in range(len(s), 0, -1):\n for sub in (s[j:j+i] for j in range(len(s) - i + 1)):\n if all(sub not in other for other in strings if other != s):\n return sub\n return \"\"\n\n return [find_shortest_unique_substring(s, arr) for s in arr]", "class Solution:\n def shortestSubstrings(self, arr: List[str]) -> List[str]:\n def find_shortest_unique_substring(s, strings):\n for i in range(len(s), 0, -1):\n for sub in (s[j:j+i] for j in range(len(s) - i + 1)):\n if all(sub not in other for other in strings if other != s):\n return sub\n return \"\"\n\n return [find_shortest_unique_substring(s, arr) for s in arr]", "class Solution:\n def shortestSubstrings(self, arr: List[str]) -> List[str]:\n def find_shortest_unique_substring(s, strings):\n for i in range(len(s), 0, -1):\n for sub in (s[j:j+i] for j in range(len(s) - i + 1)):\n if all(sub not in other for other in strings if other != s):\n return sub\n return \"\"\n\n return [find_shortest_unique_substring(s, arr) for s in arr]", "class Solution:\n def shortestSubstrings(self, arr: List[str]) -> List[str]:\n def find_shortest_unique_substring(s, other_strings):\n n = len(s)\n unique_substrings = []\n for i in range(n):\n for j in range(i + 1, n + 1):\n substring = s[i:j]\n if all(substring not in other_string for other_string in other_strings):\n unique_substrings.append(substring)\n return min(unique_substrings, key=len or s)\n\n return [find_shortest_unique_substring(s, [other_s for other_s in arr if other_s != s]) for s in arr]", "class Solution:\n def shortestSubstrings(self, arr: List[str]) -> List[str]:\n def find_shortest_unique_substring(s, strings):\n for i in range(len(s), 0, -1):\n for sub in (s[j:j+i] for j in range(len(s) - i + 1)):\n if all(sub not in other for other in strings if other != s):\n return sub\n return \"\"\n\n return [find_shortest_unique_substring(s, arr) for s in arr]", "class Solution:\n def shortestSubstrings(self, arr: List[str]) -> List[str]:\n def find_shortest_unique_substring(s, other_strings):\n n = len(s)\n unique_substrings = []\n\n for i in range(n):\n for j in range(i + 1, n + 1):\n substr = s[i:j]\n if all(substr not in other_str for other_str in other_strings):\n unique_substrings.append(substr)\n\n unique_substrings.sort(key=len)\n return unique_substrings[0] if unique_substrings else \"\"\n\n return [find_shortest_unique_substring(s, [other_s for other_s in arr if other_s != s]) for s in arr]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumDeletions(self, word: str, k: int) -> int:\n letter_freq = {}\n for letter in word:\n if letter not in letter_freq:\n letter_freq[letter] = 1\n else:\n letter_freq[letter] += 1\n\n freq_counts = {}\n for freq in letter_freq.values():\n if freq not in freq_counts:\n freq_counts[freq] = 1\n else:\n freq_counts[freq] += 1\n\n max_freq = max(letter_freq.values())\n min_deletions = float('inf')\n\n for target_freq in range(max_freq, max(max_freq - k, 1) - 1, -1):\n deletions = 0\n for freq, count in freq_counts.items():\n if freq > target_freq:\n deletions += freq - target_freq\n elif freq < target_freq and target_freq - k <= freq:\n deletions += count\n min_deletions = min(min_deletions, deletions)\n\n return min_deletions", "class Solution:\n def minimumDeletions(self, word: str, k: int) -> int:\n freq = [0] * 26\n count = [0] * 26\n for c in word:\n freq[ord(c) - ord('a')] += 1\n\n for i in range(26):\n if freq[i] > 0:\n count[i % 26] += 1\n\n deletions = 0\n for i in range(26):\n if count[i] > 0 and count[i] - count[(i + k) % 26] > 0:\n deletions += count[i] - count[(i + k) % 26]\n\n return deletions", "class Solution:\n def minimumDeletions(self, word: str, k: int) -> int:\n letter_freq = {}\n for letter in word:\n if letter not in letter_freq:\n letter_freq[letter] = 1\n else:\n letter_freq[letter] += 1\n\n freq_list = list(letter_freq.values())\n freq_list.sort()\n\n deletions = 0\n while freq_list and freq_list[-1] - freq_list[0] > k:\n deletions += 1\n freq_list[-1] -= 1\n freq_list.sort()\n\n return deletions", "class Solution:\n def minimumDeletions(self, word: str, k: int) -> int:\n freq = [0] * 26\n count = [0] * 26\n for c in word:\n freq[ord(c) - ord('a')] += 1\n\n for i in range(26):\n if freq[i] > 0:\n count[i % 26] += 1\n\n deletions = 0\n for i in range(26):\n if count[i] > 0 and count[i] - count[(i + k) % 26] > 0:\n deletions += count[i] - count[(i + k) % 26]\n\n return deletions", "class Solution:\n def minimumDeletions(self, word: str, k: int) -> int:\n freq = [0] * 26\n count = [0] * 26\n for c in word:\n freq[ord(c) - ord('a')] += 1\n\n for i, f in enumerate(freq):\n count[i] = (f + k) // (k + 1)\n\n deletions = sum(freq) - sum(count)\n for c in word:\n idx = ord(c) - ord('a')\n if freq[idx] > count[idx]:\n deletions -= 1\n freq[idx] -= 1\n if freq[idx] == count[idx]:\n deletions += 1\n\n return deletions", "class Solution:\n def minimumDeletions(self, word: str, k: int) -> int:\n letter_freq = {}\n for letter in word:\n if letter not in letter_freq:\n letter_freq[letter] = 1\n else:\n letter_freq[letter] += 1\n\n freq_counts = {}\n for freq in letter_freq.values():\n if freq not in freq_counts:\n freq_counts[freq] = 1\n else:\n freq_counts[freq] += 1\n\n deletions = 0\n for freq, count in freq_counts.items():\n min_freq = max(0, int(freq - k))\n max_freq = int(freq + k)\n if min_freq != max_freq:\n deletions += count * (freq - min_freq)\n freq_counts[min_freq] = freq_counts.get(min_freq, 0) + count\n freq_counts[max_freq] = freq_counts.get(max_freq, 0) + count\n\n max_freq_count = max(freq_counts.values())\n deletions += len(word) - max_freq_count\n\n return deletions", "class Solution:\n def minimumDeletions(self, word: str, k: int) -> int:\n freq = [0] * 26\n count = [0] * 26\n for c in word:\n freq[ord(c) - ord('a')] += 1\n\n for i in range(26):\n if freq[i] > 0:\n count[i % (k + 1)] += 1\n\n deletions = 0\n for i in range(26):\n if count[i] > 0:\n deletions += (count[i] - 1) * (k + 1)\n\n return deletions", "class Solution:\n def minimumDeletions(self, word: str, k: int) -> int:\n freq = [0] * 26\n count = [0] * 26\n for c in word:\n freq[ord(c) - ord('a')] += 1\n\n for i in range(26):\n if freq[i] > 0:\n count[i % (k + 1)] += 1\n\n deletions = sum(freq)\n for i in range(k + 1):\n deletions -= max(count[i], 1)\n\n return sum(freq) - max(count)", "class Solution:\n def minimumDeletions(self, word: str, k: int) -> int:\n freq = [0] * 26\n count = [0] * 26\n for c in word:\n freq[ord(c) - ord('a')] += 1\n\n for i in range(26):\n if freq[i] > 0:\n count[i % 26] += 1\n\n deletions = 0\n for i in range(26):\n if count[i] > 0 and count[i] - count[(i + k) % 26] > 0:\n deletions += count[i] - count[(i + k) % 26]\n\n return deletions", "class Solution:\n def minimumDeletions(self, word: str, k: int) -> int:\n letter_freq = {}\n for letter in word:\n if letter not in letter_freq:\n letter_freq[letter] = 1\n else:\n letter_freq[letter] += 1\n\n freq_counts = {}\n for freq in letter_freq.values():\n if freq - k in freq_counts:\n freq_counts[freq - k] += 1\n if freq + k in freq_counts:\n freq_counts[freq + k] += 1\n if freq not in freq_counts:\n freq_counts[freq] = 1\n\n min_deletions = float('inf')\n for target_freq in range(min(letter_freq.values()), max(letter_freq.values()) + k + 1):\n deletions = 0\n if target_freq in freq_counts:\n deletions += freq_counts[target_freq]\n if target_freq - k in freq_counts:\n deletions -= freq_counts[target_freq - k]\n if target_freq + k in freq_counts:\n deletions -= freq_counts[target_freq + k]\n min_deletions = min(min_deletions, deletions)\n\n return min_deletions" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findLatestTime(self, s: str) -> str:\n def replace_chars(s, chars):\n for i in range(len(s)):\n if s[i] == '?':\n s = s[:i] + chars[0] + s[i+1:]\n chars = chars[1:]\n return s, chars\n\n chars = ['9', '8', '7', '6', '5', '4', '3', '2', '1', '0']\n s, chars = replace_chars(s[:2], chars.copy())\n s, chars = replace_chars(s[3:], chars.copy())\n return s", "class Solution:\n def findLatestTime(self, s: str) -> str:\n def replace_chars(s, i, chars):\n for c in chars:\n if s[i] == '?' or int(s[i]) < c:\n return c\n return s[i]\n\n res = s\n for i in range(4):\n if s[i] == '?':\n if i < 2:\n chars = list(map(str, range(10, 0, -1)))\n else:\n chars = list(map(str, range(60, 0, -1)))\n for c in chars:\n new_s = s[:i] + c + s[i + 1:]\n if int(new_s[:2]) <= 11 and int(new_s[3:]) <= 59:\n res = max(res, new_s, key=lambda x: (x[:2], x[3:]))\n return res", "class Solution:\n def findLatestTime(self, s: str) -> str:\n def replace_chars(s, index, chars):\n for c in chars:\n if s[index] == '?':\n s = s[:index] + c + s[index + 1:]\n if self.is_valid_time(s):\n return replace_chars(s, index - 1, chars)\n else:\n return s\n return s\n\n chars = ['9', '4', '3', '2', '1', '0']\n s = replace_chars(s, 3, chars)\n s = replace_chars(s, 1, chars)\n s = replace_chars(s, 0, chars)\n\n return s\n\n def is_valid_time(self, s):\n hour, minute = map(int, s.split(\":\"))\n return 0 <= hour <= 11 and 0 <= minute <= 59", "class Solution:\n def findLatestTime(self, s: str) -> str:\n def replace_chars(s, index, chars):\n for c in chars:\n new_s = list(s)\n new_s[index] = c\n s = ''.join(new_s)\n if self.is_valid_time(s):\n return s\n return None\n\n def is_valid_time(s):\n hours, minutes = map(int, s.split(\":\"))\n return 0 <= hours <= 11 and 0 <= minutes <= 59\n\n if is_valid_time(s):\n return s\n\n hour, minute = s[:2], s[3:]\n\n if \"?\" in hour:\n hour = replace_chars(hour, hour.find(\"?\"), [\"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"9\"])\n\n if \"?\" in minute:\n minute = replace_chars(minute, minute.find(\"?\"), [\"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"9\"])\n\n if \"?\" in hour or \"?\" in minute:\n hour = replace_chars(hour, hour.find(\"?\"), [\"9\"])\n minute = replace_chars(minute, minute.find(\"?\"), [\"9\", \"5\", \"4\"])\n\n if \"?\" in hour or \"?\" in minute:\n hour = replace_chars(hour, hour.find(\"?\"), [\"1\"])\n minute = replace_chars(minute, minute.find(\"?\"), [\"9\", \"5\"])\n\n return hour + \":\" + minute", "class Solution:\n def findLatestTime(self, s: str) -> str:\n def replace_question_marks(s: str, max_val: int) -> str:\n result = []\n for c in s:\n if c == '?':\n result.append(str(max_val))\n max_val = 0\n else:\n result.append(c)\n return \"\".join(result)\n\n hours, minutes = s[:2], s[3:]\n return replace_question_marks(hours, 1 if hours != \"1?\" else 9) + \":\" + replace_question_marks(minutes, 5 if minutes != \"5?\" else 9)", "class Solution:\n def findLatestTime(self, s: str) -> str:\n def replace_chars(s, index, chars):\n for c in chars:\n new_s = list(s)\n new_s[index] = c\n s = ''.join(new_s)\n if self.is_valid_time(s):\n return s\n return None\n\n def is_valid_time(s):\n hours, minutes = map(int, s.split(\":\"))\n return 0 <= hours <= 11 and 0 <= minutes <= 59\n\n if is_valid_time(s):\n return s\n\n hour, minute = s[:2], s[3:]\n\n if \"?\" in hour:\n hour = replace_chars(hour, hour.find(\"?\"), [\"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"9\"])\n\n if \"?\" in minute:\n minute = replace_chars(minute, minute.find(\"?\"), [\"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"9\"])\n\n if \"?\" in hour:\n hour = replace_chars(hour, hour.find(\"?\"), [\"9\"])\n\n if \"?\" in minute:\n minute = replace_chars(minute, minute.find(\"?\"), [\"9\"])\n\n return hour + \":\" + minute", "class Solution:\n def findLatestTime(self, s: str) -> str:\n def replace_chars(s, index, chars):\n for c in chars:\n new_s = list(s)\n new_s[index] = c\n s = ''.join(new_s)\n yield s\n\n hours, minutes = s[:2], s[3:]\n hour_chars = ['0', '1', '2', '9'] if hours == '1?' or hours == '?1' else ['0', '1', '2', '3', '9']\n minute_chars = ['0', '1', '2', '3', '4', '5', '6', '9'] if len(minutes) == 3 else ['5', '6', '9']\n\n for hour in replace_chars(hours, hours.index('?'), hour_chars):\n for minute in replace_chars(minutes, minutes.index('?'), minute_chars):\n if 0 <= int(hour) <= 11 and 0 <= int(minute) <= 59:\n latest_time = hour + ':' + minute\n return latest_time", "class Solution:\n def findLatestTime(self, s: str) -> str:\n def replace_chars(s, chars):\n result = []\n for c in s:\n if c == \"?\":\n result.append(chars.pop())\n else:\n result.append(c)\n return \"\".join(result)\n\n digits = list(\"9543210\")\n s = list(s)\n hours = replace_chars(s[:2], digits)\n minutes = replace_chars(s[3:], digits)\n\n if int(hours) > 11:\n hours = \"11\"\n minutes = \"59\"\n\n return f\"{hours}:{minutes}\"", "class Solution:\n def findLatestTime(self, s: str) -> str:\n def replace_chars(s, chars):\n result = []\n for c in s:\n if c == \"?\":\n result.append(chars.pop())\n else:\n result.append(c)\n return \"\".join(result)\n\n hours, minutes = s[:2], s[3:]\n if \"?\" in hours:\n hours = replace_chars(hours, [\"9\", \"1\"])\n else:\n hours = replace_chars(hours, [])\n if int(hours) > 1:\n hours = \"00\"\n if \"?\" in minutes:\n minutes = replace_chars(minutes, [\"9\", \"5\"])\n else:\n minutes = replace_chars(minutes, [])\n if int(minutes) > 5:\n minutes = \"59\"\n return \"{}:{}\".format(hours, minutes)", "class Solution:\n def findLatestTime(self, s: str) -> str:\n def replace_chars(s, index, chars):\n for c in chars:\n new_s = list(s)\n new_s[index] = c\n s = ''.join(new_s)\n yield s\n\n hours, minutes = s[:2], s[3:]\n hour_chars = ['0', '1', '2', '9'] if hours == '1?' else ['0', '1', '2', '3', '9']\n minute_chars = ['0', '1', '2', '3', '4', '5', '6', '9'] if len(minutes) == 2 else ['9']\n\n max_time = '00:00'\n for h in replace_chars(hours, 1, hour_chars):\n for m in replace_chars(minutes, 0, minute_chars):\n time = h + ':' + m\n if time >= max_time and time <= '11:59':\n max_time = time\n\n return max_time" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def medianOfUniquenessArray(self, nums: List[int]) -> int:\n def count_distinct(i, j):\n return len(set(nums[i:j+1]))\n \n n = len(nums)\n uniqueness = [0] * (n * (n + 1) // 2)\n idx = 0\n \n for i in range(n):\n for j in range(i, n):\n uniqueness[idx] = count_distinct(i, j)\n idx += 1\n \n uniqueness.sort()\n return uniqueness[len(uniqueness) // 2]", "class Solution:\n def medianOfUniquenessArray(self, nums: List[int]) -> int:\n def count_distinct(i, j):\n return len(set(nums[i:j+1]))\n \n n = len(nums)\n uniqueness = [0] * (n * (n + 1) // 2)\n idx = 0\n \n for i in range(n):\n for j in range(i, n):\n uniqueness[idx] = count_distinct(i, j)\n idx += 1\n \n uniqueness.sort()\n return uniqueness[len(uniqueness) // 2]", "class Solution:\n def medianOfUniquenessArray(self, nums: List[int]) -> int:\n def count_distinct(i, j):\n return len(set(nums[i:j+1]))\n \n n = len(nums)\n uniqueness_arr = [count_distinct(0, i) for i in range(n)]\n for i in range(1, n):\n for j in range(n - i):\n uniqueness_arr.append(count_distinct(j, j + i))\n \n uniqueness_arr.sort()\n return uniqueness_arr[len(uniqueness_arr) // 2]", "class Solution:\n def medianOfUniquenessArray(self, nums: List[int]) -> int:\n def count_distinct(i, j):\n return len(set(nums[i:j+1]))\n\n n = len(nums)\n uniqueness = [0] * (n * (n + 1) // 2)\n idx = 0\n\n for i in range(n):\n for j in range(i, n):\n uniqueness[idx] = count_distinct(i, j)\n idx += 1\n\n uniqueness.sort()\n med_idx = len(uniqueness) // 2\n return uniqueness[med_idx] if len(uniqueness) % 2 == 1 else uniqueness[med_idx - 1]", "class Solution:\n def medianOfUniquenessArray(self, nums: List[int]) -> int:\n n = len(nums)\n left, right = 1, n\n\n while left < right:\n mid = (left + right) // 2\n distinct_counts = [0] * (n + 1)\n max_distinct = 0\n\n for i in range(n):\n if nums[i] >= mid:\n max_distinct += 1\n distinct_counts[max_distinct] += 1\n if distinct_counts[max_distinct] == mid:\n max_distinct += 1\n\n if sum(distinct_counts[:mid]) >= (n * (n + 1)) // 2:\n right = mid\n else:\n left = mid + 1\n\n return left", "class Solution:\n def medianOfUniquenessArray(self, nums: List[int]) -> int:\n def distinct_elements(i, j):\n return len(set(nums[i:j + 1]))\n\n n = len(nums)\n uniqueness_array = [distinct_elements(0, i) for i in range(n)]\n\n for i in range(1, n):\n for j in range(n - i):\n uniqueness_array.append(distinct_elements(j, j + i))\n\n uniqueness_array.sort()\n\n mid = len(uniqueness_array) // 2\n return uniqueness_array[mid] if len(uniqueness_array) % 2 == 1 else uniqueness_array[mid - 1]", "class Solution:\n def medianOfUniquenessArray(self, nums: List[int]) -> int:\n def count_distinct(i, j):\n return len(set(nums[i:j+1]))\n \n n = len(nums)\n uniqueness_array = [count_distinct(i, i) for i in range(n)]\n for length in range(1, n):\n for i in range(n - length):\n j = i + length\n uniqueness_array.append(count_distinct(i, j))\n \n uniqueness_array.sort()\n mid = len(uniqueness_array) // 2\n return uniqueness_array[mid] if len(uniqueness_array) % 2 == 1 else min(uniqueness_array[mid-1:mid+1])", "class Solution:\n def medianOfUniquenessArray(self, nums: List[int]) -> int:\n def count_distinct(i, j):\n return len(set(nums[i:j+1]))\n\n n = len(nums)\n uniqueness = [0] * (n * (n + 1) // 2)\n idx = 0\n\n for i in range(n):\n for j in range(i, n):\n uniqueness[idx] = count_distinct(i, j)\n idx += 1\n\n uniqueness.sort()\n return uniqueness[len(uniqueness) // 2]", "class Solution:\n def medianOfUniquenessArray(self, nums: List[int]) -> int:\n def count_distinct(i, j):\n return len(set(nums[i:j+1]))\n \n n = len(nums)\n uniqueness = [0] * (n * (n + 1) // 2)\n idx = 0\n \n for i in range(n):\n for j in range(i, n):\n uniqueness[idx] = count_distinct(i, j)\n idx += 1\n \n uniqueness.sort()\n return uniqueness[len(uniqueness) // 2]", "class Solution:\n def medianOfUniquenessArray(self, nums: List[int]) -> int:\n def count_distinct(i, j):\n return len(set(nums[i:j+1]))\n\n n = len(nums)\n uniqueness = [0] * (n * (n + 1) // 2)\n\n idx = 0\n for i in range(n):\n for j in range(i, n):\n uniqueness[idx] = count_distinct(i, j)\n idx += 1\n\n uniqueness.sort()\n return uniqueness[len(uniqueness) // 2]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def mostFrequentIDs(self, nums: List[int], freq: List[int]) -> List[int]:\n count_dict = {}\n ans = []\n for i in range(len(nums)):\n count_dict[nums[i]] = count_dict.get(nums[i], 0) + freq[i]\n max_freq = max(count_dict.values(), default=0)\n ans.append(max_freq)\n return ans", "class Solution:\n def mostFrequentIDs(self, nums: List[int], freq: List[int]) -> List[int]:\n count_dict = {}\n ans = []\n for i in range(len(nums)):\n count_dict[nums[i]] = count_dict.get(nums[i], 0) + freq[i]\n max_freq = max(count_dict.values(), default=0)\n ans.append(max_freq)\n return ans", "class Solution:\n def mostFrequentIDs(self, nums: List[int], freq: List[int]) -> List[int]:\n count_dict = {}\n ans = []\n for i in range(len(nums)):\n count_dict[nums[i]] = count_dict.get(nums[i], 0) + freq[i]\n max_freq = max(count_dict.values(), default=0)\n ans.append(max_freq)\n return ans", "class Solution:\n def mostFrequentIDs(self, nums: List[int], freq: List[int]) -> List[int]:\n id_count = {}\n ans = []\n count = 0\n\n for i in range(len(nums)):\n id_count[nums[i]] = id_count.get(nums[i], 0) + freq[i]\n if id_count[nums[i]] == 0:\n del id_count[nums[i]]\n count = max(count, id_count.get(nums[i], 0)) if id_count else 0\n ans.append(count)\n\n return ans", "class Solution:\n def mostFrequentIDs(self, nums: List[int], freq: List[int]) -> List[int]:\n id_count = {}\n ans = []\n n = len(nums)\n\n for i in range(n):\n id_count[nums[i]] = id_count.get(nums[i], 0) + freq[i]\n max_freq = max(id_count.values(), default=0)\n ans.append(max_freq)\n\n return ans", "class Solution:\n def mostFrequentIDs(self, nums: List[int], freq: List[int]) -> List[int]:\n id_count = {}\n ans = []\n count = 0\n\n for i in range(len(nums)):\n id_count[nums[i]] = id_count.get(nums[i], 0) + freq[i]\n if id_count[nums[i]] == 0:\n del id_count[nums[i]]\n count = max(count, id_count.get(nums[i], 0)) if id_count else 0\n ans.append(count)\n\n return ans", "class Solution:\n def mostFrequentIDs(self, nums: List[int], freq: List[int]) -> List[int]:\n id_freq = {}\n ans = []\n for i in range(len(nums)):\n id_freq[nums[i]] = id_freq.get(nums[i], 0) + freq[i]\n max_freq = max(id_freq.values(), default=0)\n ans.append(max_freq)\n return ans", "class Solution:\n def mostFrequentIDs(self, nums: List[int], freq: List[int]) -> List[int]:\n id_count = {}\n ans = []\n n = len(nums)\n\n for i in range(n):\n id_count[nums[i]] = id_count.get(nums[i], 0) + freq[i]\n max_freq = max(id_count.values(), default=0)\n ans.append(max_freq)\n\n return ans", "class Solution:\n def mostFrequentIDs(self, nums: List[int], freq: List[int]) -> List[int]:\n id_count = {}\n ans = []\n count = 0\n\n for i in range(len(nums)):\n count += freq[i]\n if count == 0:\n ans.append(0)\n continue\n\n id_count[nums[i]] = id_count.get(nums[i], 0) + freq[i] * (count // freq[i])\n max_freq = max(id_count.values(), default=0)\n ans.append(max_freq)\n\n return ans", "class Solution:\n def mostFrequentIDs(self, nums: List[int], freq: List[int]) -> List[int]:\n id_count = {}\n ans = []\n n = len(nums)\n\n for i in range(n):\n id_count[nums[i]] = id_count.get(nums[i], 0) + freq[i]\n max_freq = max(list(id_count.values()) + [0])\n ans.append(max_freq)\n\n return ans" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumValueSum(self, nums: List[int], andValues: List[int]) -> int:\n n, m = len(nums), len(andValues)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n cur = 0\n for j in range(i, -1, -1):\n cur |= nums[j]\n if j == 0 or nums[j - 1] & cur != cur:\n dp[j + 1] = min(dp[j + 1], dp[j] + cur)\n\n for i in range(m):\n cur = andValues[i]\n for j in range(n):\n if j == 0 or nums[j - 1] & cur != cur:\n dp[j + 1] = min(dp[j + 1], dp[j] + cur)\n\n return dp[n] if dp[n] != float('inf') else -1", "class Solution:\n def minimumValueSum(self, nums: List[int], andValues: List[int]) -> int:\n n, m = len(nums), len(andValues)\n dp = [[float('inf')] * (m + 1) for _ in range(n + 1)]\n dp[0][0] = 0\n\n for i in range(n):\n for j in range(m):\n if nums[i] & andValues[j] == andValues[j]:\n dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + nums[i])\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n\n return dp[n][m] if dp[n][m] != float('inf') else -1", "class Solution:\n def minimumValueSum(self, nums: List[int], andValues: List[int]) -> int:\n n, m = len(nums), len(andValues)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n for j in range(i, -1, -1):\n nums[j] &= nums[i]\n dp[i + 1] = min(dp[i + 1], dp[j] + nums[i])\n\n for i in range(n - 1, -1, -1):\n for val in andValues:\n if nums[i] & val == val:\n dp[i] = min(dp[i], dp[i + 1] + val)\n\n return dp[0] if dp[0] != float('inf') else -1", "class Solution:\n def minimumValueSum(self, nums: List[int], andValues: List[int]) -> int:\n n, m = len(nums), len(andValues)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n cur = 0\n for j in range(i, -1, -1):\n cur &= nums[j]\n if j == i:\n dp[j + 1] = min(dp[j + 1], dp[j] + nums[j])\n else:\n dp[j + 1] = min(dp[j + 1], dp[j] + nums[j] - cur + (cur & andValues[nums.index(cur) - 1]))\n\n return dp[n] if dp[n] != float('inf') else -1", "class Solution:\n def minimumValueSum(self, nums: List[int], andValues: List[int]) -> int:\n n, m = len(nums), len(andValues)\n dp = [[float('inf')] * (m + 1) for _ in range(n + 1)]\n dp[0][0] = 0\n\n for i in range(n):\n for j in range(m):\n if nums[i] & andValues[j] != andValues[j]:\n continue\n dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + nums[i])\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n\n return dp[n][m] if dp[n][m] != float('inf') else -1", "class Solution:\n def minimumValueSum(self, nums: List[int], andValues: List[int]) -> int:\n n, m = len(nums), len(andValues)\n dp = [[float('inf')] * (m + 1) for _ in range(n + 1)]\n dp[0][0] = 0\n\n for i in range(n):\n for j in range(m):\n if nums[i] & andValues[j] != andValues[j]:\n continue\n dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + nums[i])\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n\n return dp[n][m] if dp[n][m] != float('inf') else -1", "class Solution:\n def minimumValueSum(self, nums: List[int], andValues: List[int]) -> int:\n n, m = len(nums), len(andValues)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n for j in range(i, -1, -1):\n nums[j] &= nums[i]\n dp[j + 1] = min(dp[j + 1], dp[j] + nums[i])\n\n res = float('inf')\n for i in range(n - m + 1):\n and_ = 0\n for j in range(m):\n and_ |= andValues[j]\n if nums[i + j] != and_:\n break\n else:\n res = min(res, dp[i + m] + and_)\n\n return res if res != float('inf') else -1", "class Solution:\n def minimumValueSum(self, nums: List[int], andValues: List[int]) -> int:\n n, m = len(nums), len(andValues)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n for j in range(i, -1, -1):\n nums[j] &= nums[i]\n dp[i + 1] = min(dp[i + 1], dp[j] + nums[i])\n\n for i in range(m):\n for j in range(n):\n if nums[j] == andValues[i]:\n dp[j + 1] = min(dp[j + 1], dp[j] + andValues[i])\n\n return dp[n] if dp[n] != float('inf') else -1", "class Solution:\n def minimumValueSum(self, nums: List[int], andValues: List[int]) -> int:\n n, m = len(nums), len(andValues)\n dp = [[float('inf')] * (m + 1) for _ in range(n + 1)]\n dp[0][0] = 0\n\n for i in range(n):\n cur = 0\n for j in range(i, -1, -1):\n cur |= nums[j]\n for k in range(m):\n if andValues[k] == (cur & nums[j]):\n dp[j][k + 1] = min(dp[j][k + 1], dp[i + 1][k] + nums[j])\n\n return dp[0][m] if dp[0][m] != float('inf') else -1", "class Solution:\n def minimumValueSum(self, nums: List[int], andValues: List[int]) -> int:\n n, m = len(nums), len(andValues)\n dp = [float('inf')] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n for j in range(i, -1, -1):\n nums[j] &= nums[i]\n dp[i + 1] = min(dp[i + 1], dp[j] + nums[i])\n\n for i in range(n - 1, -1, -1):\n for val in andValues:\n if nums[i] & val == val:\n dp[i] = min(dp[i], dp[i + 1] + val)\n\n return dp[0] if dp[0] != float('inf') else -1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def sumOfEncryptedInt(self, nums: List[int]) -> int:\n total_sum = 0\n for num in nums:\n max_digit = 0\n temp_num = num\n while temp_num > 0:\n digit = temp_num % 10\n if digit > max_digit:\n max_digit = digit\n temp_num //= 10\n encrypted_num = max_digit * len(str(num))\n total_sum += encrypted_num\n return total_sum", "class Solution:\n def sumOfEncryptedInt(self, nums: List[int]) -> int:\n total_sum = 0\n for num in nums:\n max_digit = max(str(num))\n encrypted_num = int(max_digit) * len(str(num))\n total_sum += encrypted_num\n return total_sum", "class Solution:\n def sumOfEncryptedInt(self, nums: List[int]) -> int:\n total_sum = 0\n for num in nums:\n max_digit = 0\n temp_num = num\n while temp_num > 0:\n digit = temp_num % 10\n if digit > max_digit:\n max_digit = digit\n temp_num //= 10\n encrypted_num = max_digit * len(str(num))\n total_sum += encrypted_num\n return total_sum", "class Solution:\n def sumOfEncryptedInt(self, nums: List[int]) -> int:\n total_sum = 0\n for num in nums:\n max_digit = 0\n temp_num = num\n while temp_num > 0:\n digit = temp_num % 10\n if digit > max_digit:\n max_digit = digit\n temp_num //= 10\n encrypted_num = max_digit * len(str(num))\n total_sum += encrypted_num\n return total_sum", "class Solution:\n def sumOfEncryptedInt(self, nums: List[int]) -> int:\n total_sum = 0\n for num in nums:\n max_digit = max(int(digit) for digit in str(num))\n encrypted_num = int(str(max_digit) * len(str(num)))\n total_sum += encrypted_num\n return total_sum", "class Solution:\n def sumOfEncryptedInt(self, nums: List[int]) -> int:\n total_sum = 0\n for num in nums:\n max_digit = str(num).rjust(3, '0') # Ensure all numbers have same length\n max_digit = max(max_digit) # Get the largest digit\n encrypted_num = int(max_digit * 3) # Create the encrypted number\n total_sum += encrypted_num\n return total_sum", "class Solution:\n def sumOfEncryptedInt(self, nums: List[int]) -> int:\n total_sum = 0\n for num in nums:\n max_digit = 0\n temp_num = num\n while temp_num > 0:\n digit = temp_num % 10\n if digit > max_digit:\n max_digit = digit\n temp_num //= 10\n encrypted_num = max_digit * len(str(num))\n total_sum += encrypted_num\n return total_sum", "class Solution:\n def sumOfEncryptedInt(self, nums: List[int]) -> int:\n total_sum = 0\n for num in nums:\n max_digit = 0\n temp_num = num\n while temp_num > 0:\n digit = temp_num % 10\n if digit > max_digit:\n max_digit = digit\n temp_num //= 10\n encrypted_num = max_digit * len(str(num))\n total_sum += encrypted_num\n return total_sum", "class Solution:\n def sumOfEncryptedInt(self, nums: List[int]) -> int:\n total_sum = 0\n for num in nums:\n max_digit = max(int(digit) for digit in str(num))\n encrypted_num = int(str(max_digit) * len(str(num)))\n total_sum += encrypted_num\n return total_sum", "class Solution:\n def sumOfEncryptedInt(self, nums: List[int]) -> int:\n total_sum = 0\n for num in nums:\n max_digit = 0\n temp_num = num\n while temp_num > 0:\n digit = temp_num % 10\n if digit > max_digit:\n max_digit = digit\n temp_num //= 10\n encrypted_num = max_digit * len(str(num))\n total_sum += encrypted_num\n return total_sum" ], "pass1_list": [ false, false, false, false, true, false, false, false, true, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def sumOfTheDigitsOfHarshadNumber(self, x: int) -> int:\n sum_of_digits = sum(int(digit) for digit in str(x))\n if x % sum_of_digits == 0:\n return sum_of_digits\n else:\n return -1", "class Solution:\n def sumOfTheDigitsOfHarshadNumber(self, x: int) -> int:\n sum_of_digits = sum(int(digit) for digit in str(x))\n if x % sum_of_digits == 0:\n return sum_of_digits\n else:\n return -1", "class Solution:\n def sumOfTheDigitsOfHarshadNumber(self, x: int) -> int:\n sum_of_digits = sum(int(digit) for digit in str(x))\n if x % sum_of_digits == 0:\n return sum_of_digits\n else:\n return -1", "class Solution:\n def sumOfTheDigitsOfHarshadNumber(self, x: int) -> int:\n sum_of_digits = sum(int(digit) for digit in str(x))\n if x % sum_of_digits == 0:\n return sum_of_digits\n else:\n return -1", "class Solution:\n def sumOfTheDigitsOfHarshadNumber(self, x: int) -> int:\n sum_of_digits = sum(int(digit) for digit in str(x))\n if x % sum_of_digits == 0:\n return sum_of_digits\n else:\n return -1", "class Solution:\n def sumOfTheDigitsOfHarshadNumber(self, x: int) -> int:\n sum_of_digits = sum(int(digit) for digit in str(x))\n if x % sum_of_digits == 0:\n return sum_of_digits\n else:\n return -1", "class Solution:\n def sumOfTheDigitsOfHarshadNumber(self, x: int) -> int:\n sum_of_digits = sum(int(digit) for digit in str(x))\n if x % sum_of_digits == 0:\n return sum_of_digits\n else:\n return -1", "class Solution:\n def sumOfTheDigitsOfHarshadNumber(self, x: int) -> int:\n sum_of_digits = sum(int(digit) for digit in str(x))\n if x % sum_of_digits == 0:\n return sum_of_digits\n else:\n return -1", "class Solution:\n def sumOfTheDigitsOfHarshadNumber(self, x: int) -> int:\n sum_of_digits = sum(int(digit) for digit in str(x))\n if x % sum_of_digits == 0:\n return sum_of_digits\n else:\n return -1", "class Solution:\n def sumOfTheDigitsOfHarshadNumber(self, x: int) -> int:\n sum_of_digits = sum(int(digit) for digit in str(x))\n if x % sum_of_digits == 0:\n return sum_of_digits\n else:\n return -1" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def longestMonotonicSubarray(self, nums: List[int]) -> int:\n longest_length = 0\n current_length = 1\n\n for i in range(1, len(nums)):\n if nums[i] > nums[i - 1]:\n current_length += 1\n elif nums[i] < nums[i - 1]:\n current_length = 2\n else:\n current_length = 1\n\n longest_length = max(longest_length, current_length)\n\n return longest_length", "class Solution:\n def longestMonotonicSubarray(self, nums: List[int]) -> int:\n n = len(nums)\n inc_len, dec_len = 1, 1\n max_len = 1\n\n for i in range(1, n):\n if nums[i] > nums[i - 1]:\n inc_len += 1\n dec_len = 1 if dec_len == i else dec_len + 1\n elif nums[i] < nums[i - 1]:\n inc_len = 1 if inc_len == i else inc_len + 1\n dec_len += 1\n else:\n inc_len, dec_len = 1, 1\n\n max_len = max(max_len, inc_len, dec_len)\n\n return max_len", "class Solution:\n def longestMonotonicSubarray(self, nums: List[int]) -> int:\n longest_length = 0\n current_length = 1\n\n for i in range(1, len(nums)):\n if nums[i] > nums[i - 1]:\n current_length += 1\n elif nums[i] < nums[i - 1]:\n current_length = 2\n else:\n current_length = 1\n\n longest_length = max(longest_length, current_length)\n\n return longest_length", "class Solution:\n def longestMonotonicSubarray(self, nums: List[int]) -> int:\n longest_length = 0\n current_length = 1\n\n for i in range(1, len(nums)):\n if nums[i] > nums[i - 1]:\n current_length += 1\n elif nums[i] < nums[i - 1]:\n current_length = 2\n else:\n current_length = 1\n\n longest_length = max(longest_length, current_length)\n\n return longest_length", "class Solution:\n def longestMonotonicSubarray(self, nums: List[int]) -> int:\n longest_length = 0\n current_length = 1\n\n for i in range(1, len(nums)):\n if nums[i] > nums[i - 1]:\n current_length += 1\n elif nums[i] < nums[i - 1]:\n current_length = 2\n else:\n current_length = 1\n\n longest_length = max(longest_length, current_length)\n\n return longest_length", "class Solution:\n def longestMonotonicSubarray(self, nums: List[int]) -> int:\n longest_length = 0\n current_length = 1\n\n for i in range(1, len(nums)):\n if nums[i] > nums[i - 1]:\n current_length += 1\n elif nums[i] < nums[i - 1]:\n current_length = 2\n else:\n current_length = 1\n\n longest_length = max(longest_length, current_length)\n\n return longest_length", "class Solution:\n def longestMonotonicSubarray(self, nums: List[int]) -> int:\n longest_length = 0\n current_length = 1\n\n for i in range(1, len(nums)):\n if nums[i] > nums[i - 1]:\n current_length += 1\n elif nums[i] < nums[i - 1]:\n current_length = 2\n else:\n current_length = 1\n\n longest_length = max(longest_length, current_length)\n\n return longest_length", "class Solution:\n def longestMonotonicSubarray(self, nums: List[int]) -> int:\n longest_length = 0\n current_length = 1\n\n for i in range(1, len(nums)):\n if nums[i] > nums[i - 1]:\n current_length += 1\n elif nums[i] < nums[i - 1]:\n current_length = 2\n else:\n current_length = 1\n\n longest_length = max(longest_length, current_length)\n\n return longest_length", "class Solution:\n def longestMonotonicSubarray(self, nums: List[int]) -> int:\n longest_length = 0\n current_length = 1\n\n for i in range(1, len(nums)):\n if nums[i] > nums[i - 1]:\n current_length += 1\n elif nums[i] < nums[i - 1]:\n current_length = 2\n else:\n current_length = 1\n\n longest_length = max(longest_length, current_length)\n\n return longest_length", "class Solution:\n def longestMonotonicSubarray(self, nums: List[int]) -> int:\n longest_length = 0\n current_length = 1\n\n for i in range(1, len(nums)):\n if nums[i] > nums[i - 1] or nums[i] < nums[i - 1]:\n current_length += 1\n else:\n longest_length = max(longest_length, current_length)\n current_length = 1\n\n return max(longest_length, current_length)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumPrimeDifference(self, nums: List[int]) -> int:\n def is_prime(n: int) -> bool:\n if n <= 1:\n return False\n if n <= 3:\n return True\n if n % 2 == 0 or n % 3 == 0:\n return False\n i = 5\n while i * i <= n:\n if n % i == 0 or n % (i + 2) == 0:\n return False\n i += 6\n return True\n\n primes = [i for i, num in enumerate(nums) if is_prime(num)]\n max_distance = 0\n for i in range(len(primes) - 1):\n max_distance = max(max_distance, abs(primes[i + 1] - primes[i]))\n return max_distance", "class Solution:\n def maximumPrimeDifference(self, nums: List[int]) -> int:\n def is_prime(n: int) -> bool:\n if n <= 1:\n return False\n if n <= 3:\n return True\n if n % 2 == 0 or n % 3 == 0:\n return False\n i = 5\n while i * i <= n:\n if n % i == 0 or n % (i + 2) == 0:\n return False\n i += 6\n return True\n\n max_dist = 0\n first_prime = None\n for i, num in enumerate(nums):\n if is_prime(num):\n if first_prime is None:\n first_prime = i\n else:\n max_dist = max(max_dist, abs(i - first_prime))\n return max_dist", "class Solution:\n def maximumPrimeDifference(self, nums: List[int]) -> int:\n def is_prime(n):\n if n <= 1:\n return False\n if n <= 3:\n return True\n if n % 2 == 0 or n % 3 == 0:\n return False\n i = 5\n while i * i <= n:\n if n % i == 0 or n % (i + 2) == 0:\n return False\n i += 6\n return True\n\n primes = [i for i, num in enumerate(nums) if is_prime(num)]\n max_distance = 0\n for i in range(len(primes) - 1):\n max_distance = max(max_distance, abs(primes[i + 1] - primes[i]))\n return max_distance", "class Solution:\n def maximumPrimeDifference(self, nums: List[int]) -> int:\n def is_prime(n: int) -> bool:\n if n <= 1:\n return False\n for i in range(2, int(n**0.5) + 1):\n if n % i == 0:\n return False\n return True\n\n primes = [i for i in range(len(nums)) if is_prime(nums[i])]\n max_distance = 0\n for i in range(len(primes)):\n for j in range(i + 1, len(primes) + 1):\n max_distance = max(max_distance, abs(primes[j] - primes[i]))\n return max_distance", "class Solution:\n def maximumPrimeDifference(self, nums: List[int]) -> int:\n def is_prime(n: int) -> bool:\n if n <= 1:\n return False\n if n <= 3:\n return True\n if n % 2 == 0 or n % 3 == 0:\n return False\n i = 5\n while i * i <= n:\n if n % i == 0 or n % (i + 2) == 0:\n return False\n i += 6\n return True\n\n primes = [i for i, num in enumerate(nums) if is_prime(num)]\n max_distance = 0\n for i in range(len(primes) - 1):\n max_distance = max(max_distance, abs(primes[i + 1] - primes[i]))\n return max_distance", "class Solution:\n def maximumPrimeDifference(self, nums: List[int]) -> int:\n def is_prime(n: int) -> bool:\n if n <= 1:\n return False\n if n <= 3:\n return True\n if n % 2 == 0 or n % 3 == 0:\n return False\n i = 5\n while i * i <= n:\n if n % i == 0 or n % (i + 2) == 0:\n return False\n i += 6\n return True\n\n primes = [i for i, num in enumerate(nums) if is_prime(num)]\n max_distance = 0\n for i in range(len(primes) - 1):\n max_distance = max(max_distance, abs(primes[i + 1] - primes[i]))\n return max_distance", "class Solution:\n def maximumPrimeDifference(self, nums: List[int]) -> int:\n def is_prime(n: int) -> bool:\n if n <= 1:\n return False\n if n <= 3:\n return True\n if n % 2 == 0 or n % 3 == 0:\n return False\n i = 5\n while i * i <= n:\n if n % i == 0 or n % (i + 2) == 0:\n return False\n i += 6\n return True\n\n primes = [i for i, num in enumerate(nums) if is_prime(num)]\n max_distance = 0\n for i in range(len(primes) - 1):\n max_distance = max(max_distance, abs(primes[i + 1] - primes[i]))\n return max_distance", "class Solution:\n def maximumPrimeDifference(self, nums: List[int]) -> int:\n def is_prime(n: int) -> bool:\n if n <= 1:\n return False\n if n <= 3:\n return True\n if n % 2 == 0 or n % 3 == 0:\n return False\n i = 5\n while i * i <= n:\n if n % i == 0 or n % (i + 2) == 0:\n return False\n i += 6\n return True\n\n primes = [i for i, num in enumerate(nums) if is_prime(num)]\n max_distance = 0\n for i in range(len(primes)):\n for j in range(i + 1, len(primes)):\n max_distance = max(max_distance, abs(primes[j] - primes[i]))\n return max_distance", "class Solution:\n def maximumPrimeDifference(self, nums: List[int]) -> int:\n def is_prime(n: int) -> bool:\n if n <= 1:\n return False\n for i in range(2, int(n**0.5) + 1):\n if n % i == 0:\n return False\n return True\n\n primes = [i for i in nums if is_prime(i)]\n max_distance = 0\n for prime in primes:\n max_distance = max(max_distance, abs(nums.index(prime) - nums.index(primes[-1])))\n return max_distance", "class Solution:\n def maximumPrimeDifference(self, nums: List[int]) -> int:\n def is_prime(n: int) -> bool:\n if n <= 1:\n return False\n for i in range(2, int(n**0.5) + 1):\n if n % i == 0:\n return False\n return True\n\n primes = [i for i, num in enumerate(nums) if is_prime(num)]\n max_distance = 0\n for i in range(len(primes)):\n for j in range(i + 1, len(primes)):\n max_distance = max(max_distance, abs(primes[j] - primes[i]))\n return max_distance" ], "pass1_list": [ false, true, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def countAlternatingSubarrays(self, nums: List[int]) -> int:\n count = prev = 1\n for i in range(1, len(nums)):\n if nums[i] == nums[i - 1]:\n count += prev\n prev += 1\n return count + len(nums)", "class Solution:\n def countAlternatingSubarrays(self, nums: List[int]) -> int:\n n = len(nums)\n count = 0\n prev = -1\n for i in range(n):\n if nums[i] != prev:\n count += i + 1\n prev = nums[i]\n return count", "class Solution:\n def countAlternatingSubarrays(self, nums: List[int]) -> int:\n count = 0\n prev = -1\n curr = 0\n for num in nums:\n if num == prev:\n curr += 1\n else:\n count += curr * (curr + 1) // 2 + 1\n prev = num\n curr = 0\n return count", "class Solution:\n def countAlternatingSubarrays(self, nums: List[int]) -> int:\n count = 0\n prev = -1\n curr = 0\n\n for num in nums:\n if num == prev:\n curr += 1\n else:\n count += (curr + 1) * (curr + 2) // 2\n curr = 1\n prev = num\n\n return count + (curr + 1) * (curr + 2) // 2", "class Solution:\n def countAlternatingSubarrays(self, nums: List[int]) -> int:\n count = prev = 1\n for i in range(1, len(nums)):\n if nums[i] == nums[i - 1]:\n count += prev\n prev += 1\n return count + len(nums)", "class Solution:\n def countAlternatingSubarrays(self, nums: List[int]) -> int:\n count = 0\n prev = None\n i = 0\n\n while i < len(nums):\n if prev != nums[i]:\n count += 1\n prev = nums[i]\n i += 1\n else:\n j = i + 1\n while j < len(nums) and nums[j] == prev:\n j += 1\n count += 1\n prev = 1 - prev\n i = j\n\n return count", "class Solution:\n def countAlternatingSubarrays(self, nums: List[int]) -> int:\n count = 0\n prev = -1\n total = 0\n for num in nums:\n if num != prev:\n count += 1\n total += count\n prev = num\n return total", "class Solution:\n def countAlternatingSubarrays(self, nums: List[int]) -> int:\n count = 0\n prev = None\n i = 0\n\n for num in nums:\n if num == prev:\n count += i\n else:\n count += i + 1\n prev = num\n i += 1\n\n return count", "class Solution:\n def countAlternatingSubarrays(self, nums: List[int]) -> int:\n n = len(nums)\n count = 0\n prev = -1\n for i in range(n):\n if nums[i] != prev:\n count += i + 1\n prev = nums[i]\n return count", "class Solution:\n def countAlternatingSubarrays(self, nums: List[int]) -> int:\n count = 0\n prev = -1\n curr = 0\n\n for num in nums:\n if num == prev:\n curr += 1\n else:\n count += (curr + 1) * (curr + 2) // 2\n prev = num\n curr = 0\n\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findKthSmallest(self, coins: List[int], k: int) -> int:\n def count_smaller_or_equal(val):\n cnt = 0\n for coin in coins:\n cnt += val // coin\n return cnt\n \n left, right = 0, 10**5\n while left < right:\n mid = left + (right - left) // 2\n if count_smaller_or_equal(mid) < k:\n left = mid + 1\n else:\n right = mid\n return left", "class Solution:\n def findKthSmallest(self, coins: List[int], k: int) -> int:\n def dfs(idx, val, k):\n if k == 0:\n return val\n if idx == len(coins):\n return dfs(0, val, k - 1)\n new_val = val + coins[idx]\n k = k - 1 if new_val < target else k\n return dfs(idx + 1, min(val, new_val), k)\n\n target = k\n coins.sort()\n return dfs(0, 0, k)", "class Solution:\n def findKthSmallest(self, coins: List[int], k: int) -> int:\n def count_smaller(target):\n cnt = 0\n for coin in coins:\n cnt += target // coin\n return cnt\n \n left, right = 0, 10**5\n while left < right:\n mid = left + (right - left) // 2\n if count_smaller(mid) < k:\n left = mid + 1\n else:\n right = mid\n return left", "class Solution:\n def findKthSmallest(self, coins: List[int], k: int) -> int:\n def count_smaller(val):\n cnt = 0\n for coin in coins:\n cnt += val // coin\n return cnt\n \n left, right = 0, 10**5\n while left < right:\n mid = left + (right - left) // 2\n if count_smaller(mid) < k:\n left = mid + 1\n else:\n right = mid\n return left", "class Solution:\n def findKthSmallest(self, coins: List[int], k: int) -> int:\n def count_smaller_or_equal(val):\n count = 0\n for coin in coins:\n count += val // coin\n return count\n \n left, right = 0, int(1e5)\n while left < right:\n mid = left + (right - left) // 2\n if count_smaller_or_equal(mid) < k:\n left = mid + 1\n else:\n right = mid\n return left", "class Solution:\n def findKthSmallest(self, coins: List[int], k: int) -> int:\n def dfs(idx, val, k):\n if k == 0:\n return val\n if idx == len(coins):\n return dfs(0, val, k - 1)\n new_val = val + coins[idx]\n k = k - 1 if new_val < target else k\n return dfs(idx + 1, min(val, new_val), k)\n\n target = k\n for coin in coins:\n target -= 1 if coin < target else 0\n return dfs(0, 0, k)", "class Solution:\n def findKthSmallest(self, coins: List[int], k: int) -> int:\n def dfs(idx, val, k):\n if k == 0:\n return val\n if idx == len(coins):\n return float('inf')\n next_val = val + coins[idx]\n k -= self.find_count(idx, next_val, k)\n return dfs(idx + 1, next_val, k) if k > 0 else val\n\n def find_count(idx, val, k):\n count = 0\n for i in range(idx, len(coins)):\n next_val = val + coins[i] * (k + 1)\n count += (next_val - val) // coins[i]\n return count\n\n return dfs(0, 0, k)", "class Solution:\n def findKthSmallest(self, coins: List[int], k: int) -> int:\n def dfs(idx, cur, k):\n if cur >= k:\n return \n if idx == len(coins):\n if cur == k - 1:\n return res[0]\n return \n\n for i in range(idx, len(coins)):\n dfs(i, cur + 1, k)\n res[0] += 1\n if res[0] == k:\n return \n\n res = [0]\n coins.sort()\n dfs(0, 0, k)\n return res[0] * coins[0]", "class Solution:\n def findKthSmallest(self, coins: List[int], k: int) -> int:\n def count_smaller_or_equal(val):\n count = 0\n for coin in coins:\n count += val // coin\n return count\n \n left, right = 0, 10**5\n while left < right:\n mid = left + (right - left) // 2\n if count_smaller_or_equal(mid) < k:\n left = mid + 1\n else:\n right = mid\n return left", "class Solution:\n def findKthSmallest(self, coins: List[int], k: int) -> int:\n def dfs(idx, val):\n nonlocal k\n if k == 0:\n return val\n if idx == len(coins):\n return float('inf')\n coin = coins[idx]\n next_val = dfs(idx + 1, val + coin)\n if next_val != float('inf'):\n k -= 1\n return next_val\n\n coins.sort()\n return dfs(0, 0)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def stringIndices(self, wordsContainer: List[str], wordsQuery: List[str]) -> List[int]:\n indices = []\n suffix_dict = {}\n\n for i, word in enumerate(wordsContainer):\n for j in range(len(word), 0, -1):\n suffix = word[-j:]\n if suffix not in suffix_dict:\n suffix_dict[suffix] = (i, j)\n\n for query in wordsQuery:\n max_suffix_len = 0\n best_index = 0\n for j in range(len(query), 0, -1):\n suffix = query[-j:]\n if suffix in suffix_dict:\n index, suffix_len = suffix_dict[suffix]\n if suffix_len > max_suffix_len:\n max_suffix_len = suffix_len\n best_index = index\n if j == 1:\n break\n\n indices.append(best_index)\n\n return indices", "class Solution:\n def stringIndices(self, wordsContainer: List[str], wordsQuery: List[str]) -> List[int]:\n n = len(wordsContainer)\n m = len(wordsQuery)\n suffix_dict = {}\n for i in range(n):\n suffix = wordsContainer[i][::-1]\n if suffix not in suffix_dict:\n suffix_dict[suffix] = [i, len(wordsContainer[i])]\n else:\n suffix_dict[suffix].append(i)\n\n ans = [-1] * m\n for i in range(m):\n query_suffix = wordsQuery[i][::-1]\n temp = []\n for j in range(len(query_suffix)):\n if query_suffix[:j+1] in suffix_dict:\n temp.extend(suffix_dict[query_suffix[:j+1]])\n if temp:\n temp.sort(key=lambda x: (len(wordsContainer[x[1]]), x[1]))\n ans[i] = temp[0][0]\n\n return ans", "class Solution:\n def stringIndices(self, wordsContainer: List[str], wordsQuery: List[str]) -> List[int]:\n indices = []\n suffix_dict = {}\n\n for i, word in enumerate(wordsContainer):\n for j in range(len(word), 0, -1):\n suffix = word[-j:]\n if suffix not in suffix_dict:\n suffix_dict[suffix] = (i, j)\n else:\n old_index, old_length = suffix_dict[suffix]\n if j < old_length or (j == old_length and len(word) < len(wordsContainer[old_index])):\n suffix_dict[suffix] = (i, j)\n\n for query in wordsQuery:\n max_common_suffix = ''\n for j in range(len(query), 0, -1):\n suffix = query[-j:]\n if suffix in suffix_dict:\n max_common_suffix = suffix\n break\n index, _ = suffix_dict.get(max_common_suffix, (-1, 0))\n indices.append(index)\n\n return indices", "class Solution:\n def stringIndices(self, wordsContainer: List[str], wordsQuery: List[str]) -> List[int]:\n indices = []\n suffix_dict = {}\n\n for i, word in enumerate(wordsContainer):\n for j in range(len(word), 0, -1):\n suffix = word[-j:]\n if suffix not in suffix_dict:\n suffix_dict[suffix] = (i, j)\n\n for query in wordsQuery:\n max_suffix_len = 0\n best_index = 0\n for j in range(len(query), 0, -1):\n suffix = query[-j:]\n if suffix in suffix_dict:\n index, suffix_len = suffix_dict[suffix]\n if suffix_len > max_suffix_len or (\n suffix_len == max_suffix_len\n and len(wordsContainer[index]) < len(wordsContainer[best_index])\n ):\n max_suffix_len = suffix_len\n best_index = index\n\n indices.append(best_index)\n\n return indices", "class Solution:\n def stringIndices(self, wordsContainer: List[str], wordsQuery: List[str]) -> List[int]:\n indices = []\n suffix_dict = {}\n\n for i, word in enumerate(wordsContainer):\n for j in range(len(word), 0, -1):\n suffix = word[-j:]\n if suffix not in suffix_dict:\n suffix_dict[suffix] = (i, j)\n\n for query in wordsQuery:\n max_suffix_len = 0\n best_index = 0\n for j in range(len(query), 0, -1):\n suffix = query[-j:]\n if suffix in suffix_dict:\n index, suffix_len = suffix_dict[suffix]\n if suffix_len > max_suffix_len:\n max_suffix_len = suffix_len\n best_index = index\n elif suffix_len == max_suffix_len:\n best_index = min(best_index, index)\n\n indices.append(best_index)\n\n return indices", "class Solution:\n def stringIndices(self, wordsContainer: List[str], wordsQuery: List[str]) -> List[int]:\n n = len(wordsContainer)\n m = len(wordsQuery)\n indices = [-1] * m\n\n # Build a map to store the index of each word in wordsContainer\n word_index_map = {word: index for index, word in enumerate(wordsContainer)}\n\n # Iterate through each query word\n for i, query in enumerate(wordsQuery):\n max_common_suffix_length = 0\n min_word_length = float('inf')\n index_with_min_length = -1\n\n # Iterate through each word in wordsContainer\n for word in wordsContainer:\n common_suffix_length = self.common_suffix_length(query, word)\n if common_suffix_length > max_common_suffix_length:\n max_common_suffix_length = common_suffix_length\n min_word_length = len(word)\n index_with_min_length = word_index_map[word]\n elif common_suffix_length == max_common_suffix_length and len(word) < min_word_length:\n min_word_length = len(word)\n index_with_min_length = word_index_map[word]\n\n # If a word with the longest common suffix is found, update the index in the indices list\n if index_with_min_length != -1:\n indices[i] = index_with_min_length\n\n return indices\n\n def common_suffix_length(self, str1, str2):\n min_length = min(len(str1), len(str2))\n for i in range(min_length - 1, -1, -1):\n if str1[i] != str2[i]:\n return min_length - 1 - i\n return min_length", "class Solution:\n def stringIndices(self, wordsContainer: List[str], wordsQuery: List[str]) -> List[int]:\n n = len(wordsContainer)\n m = len(wordsQuery)\n indices = [-1] * m\n\n # Build a map to store the index of each word in wordsContainer\n word_index_map = {word: index for index, word in enumerate(wordsContainer)}\n\n # Iterate through each query word\n for i, query in enumerate(wordsQuery):\n max_common_suffix_length = 0\n min_word_length = float('inf')\n best_index = -1\n\n # Iterate through each word in wordsContainer\n for word in wordsContainer:\n common_suffix_length = self.common_suffix_length(word, query)\n if common_suffix_length > max_common_suffix_length:\n max_common_suffix_length = common_suffix_length\n min_word_length = len(word)\n best_index = word_index_map[word]\n elif common_suffix_length == max_common_suffix_length:\n if len(word) < min_word_length or (len(word) == min_word_length and word_index_map[word] < best_index):\n min_word_length = len(word)\n best_index = word_index_map[word]\n\n indices[i] = best_index\n\n return indices\n\n def common_suffix_length(self, word1: str, word2: str) -> int:\n min_length = min(len(word1), len(word2))\n for i in range(min_length - 1, -1, -1):\n if word1[i] != word2[i]:\n return min_length - 1 - i\n return min_length", "class Solution:\n def stringIndices(self, wordsContainer: List[str], wordsQuery: List[str]) -> List[int]:\n n = len(wordsContainer)\n m = len(wordsQuery)\n indices = [-1] * m\n\n # Build a map to store the index of each word in wordsContainer\n word_index_map = {word: index for index, word in enumerate(wordsContainer)}\n\n # Iterate through each query word\n for i, query in enumerate(wordsQuery):\n max_common_suffix_length = 0\n min_word_length = float('inf')\n best_index = -1\n\n # Iterate through each word in wordsContainer\n for j, word in enumerate(wordsContainer):\n # Find the length of the common suffix\n common_suffix_length = self.common_suffix_length(word, query)\n\n # Update the best index if needed\n if common_suffix_length > max_common_suffix_length:\n max_common_suffix_length = common_suffix_length\n min_word_length = len(word)\n best_index = j\n elif common_suffix_length == max_common_suffix_length and len(word) < min_word_length:\n min_word_length = len(word)\n best_index = j\n\n # Update the index in the indices list\n if best_index != -1:\n indices[i] = best_index\n\n return indices\n\n def common_suffix_length(self, word1: str, word2: str) -> int:\n min_length = min(len(word1), len(word2))\n for i in range(min_length - 1, -1, -1):\n if word1[i] != word2[i]:\n return min_length - 1 - i\n return min_length", "class Solution:\n def stringIndices(self, wordsContainer: List[str], wordsQuery: List[str]) -> List[int]:\n n, m = len(wordsContainer), len(wordsQuery)\n indices = [-1] * m\n suffix_lengths = [0] * n\n\n # Calculate suffix length for each word in wordsContainer\n for i in range(n):\n suffix_lengths[i] = self.longestCommonSuffix(wordsContainer[i], wordsQuery[i])\n\n # Find the minimum index with the maximum suffix length for each word in wordsQuery\n for i in range(m):\n max_suffix_length = max(suffix_lengths)\n max_indices = [j for j in range(n) if suffix_lengths[j] == max_suffix_length]\n min_index = min(max_indices, key=lambda x: (len(wordsContainer[x]), x))\n indices[i] = min_index\n\n # Update suffix lengths by removing the current word from wordsQuery\n for j in range(n):\n suffix_lengths[j] = self.longestCommonSuffix(wordsContainer[j], wordsQuery[i][0:suffix_lengths[j]])\n\n return indices\n\n def longestCommonSuffix(self, word1: str, word2: str) -> int:\n i, j = len(word1) - 1, len(word2) - 1\n while i >= 0 and j >= 0 and word1[i] == word2[j]:\n i -= 1\n j -= 1\n return len(word1) - i - 1", "class Solution:\n def stringIndices(self, wordsContainer: List[str], wordsQuery: List[str]) -> List[int]:\n indices = []\n suffix_dict = {}\n\n for i, word in enumerate(wordsContainer):\n for j in range(len(word), 0, -1):\n suffix = word[-j:]\n if suffix not in suffix_dict:\n suffix_dict[suffix] = (i, j)\n else:\n old_index, old_length = suffix_dict[suffix]\n if j < old_length or (j == old_length and len(word) < len(wordsContainer[old_index])):\n suffix_dict[suffix] = (i, j)\n\n for query in wordsQuery:\n longest_suffix = \"\"\n for j in range(len(query), 0, -1):\n suffix = query[-j:]\n if suffix in suffix_dict:\n longest_suffix = suffix\n break\n indices.append(suffix_dict[longest_suffix][0])\n\n return indices" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def scoreOfString(self, s: str) -> int:\n score = 0\n for i in range(1, len(s)):\n score += abs(ord(s[i]) - ord(s[i - 1]))\n return score", "class Solution:\n def scoreOfString(self, s: str) -> int:\n score = 0\n for i in range(1, len(s)):\n score += abs(ord(s[i]) - ord(s[i - 1]))\n return score", "class Solution:\n def scoreOfString(self, s: str) -> int:\n score = 0\n for i in range(1, len(s)):\n score += abs(ord(s[i]) - ord(s[i - 1]))\n return score", "class Solution:\n def scoreOfString(self, s: str) -> int:\n score = 0\n for i in range(1, len(s)):\n score += abs(ord(s[i]) - ord(s[i - 1]))\n return score", "class Solution:\n def scoreOfString(self, s: str) -> int:\n score = 0\n for i in range(1, len(s)):\n score += abs(ord(s[i]) - ord(s[i - 1]))\n return score", "class Solution:\n def scoreOfString(self, s: str) -> int:\n score = 0\n for i in range(1, len(s)):\n score += abs(ord(s[i]) - ord(s[i - 1]))\n return score", "class Solution:\n def scoreOfString(self, s: str) -> int:\n score = 0\n for i in range(1, len(s)):\n score += abs(ord(s[i]) - ord(s[i - 1]))\n return score", "class Solution:\n def scoreOfString(self, s: str) -> int:\n score = 0\n for i in range(1, len(s)):\n score += abs(ord(s[i]) - ord(s[i - 1]))\n return score", "class Solution:\n def scoreOfString(self, s: str) -> int:\n score = 0\n for i in range(1, len(s)):\n score += abs(ord(s[i]) - ord(s[i - 1]))\n return score", "class Solution:\n def scoreOfString(self, s: str) -> int:\n score = 0\n for i in range(1, len(s)):\n score += abs(ord(s[i]) - ord(s[i - 1]))\n return score" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumSubarrayLength(self, nums: List[int], k: int) -> int:\n def calculate_OR(nums):\n result = 0\n for num in nums:\n result |= num\n return result\n \n left, right = 0, 0\n min_length = len(nums) + 1\n OR_value = 0\n \n while right < len(nums):\n OR_value |= nums[right]\n while OR_value >= k:\n min_length = min(min_length, right - left + 1)\n OR_value ^= nums[left]\n left += 1\n right += 1\n \n return min_length if min_length <= len(nums) else -1", "class Solution:\n def minimumSubarrayLength(self, nums: List[int], k: int) -> int:\n def calculate_OR(left, right):\n OR_value = 0\n for i in range(left, right+1):\n OR_value |= nums[i]\n return OR_value\n \n if not nums or k == 0:\n return 1 if k == 0 else -1\n \n n = len(nums)\n OR_values = [0] * (n + 1)\n OR_values[0] = -1\n \n for i in range(n):\n OR_values[i+1] = calculate_OR(i, i)\n \n for length in range(1, n + 1):\n for i in range(n - length + 1):\n j = i + length - 1\n OR_values[i + 1] |= OR_values[j + 1]\n if OR_values[i + 1] >= k:\n return length\n \n return -1", "class Solution:\n def minimumSubarrayLength(self, nums: List[int], k: int) -> int:\n def calculate_OR(nums):\n result = 0\n for num in nums:\n result |= num\n return result\n \n left = 0\n right = 0\n min_length = len(nums) + 1\n OR_value = 0\n \n while right < len(nums):\n OR_value |= nums[right]\n while OR_value >= k:\n min_length = min(min_length, right - left + 1)\n OR_value ^= nums[left]\n left += 1\n right += 1\n \n return min_length if min_length <= len(nums) else -1", "class Solution:\n def minimumSubarrayLength(self, nums: List[int], k: int) -> int:\n def calculate_OR(nums):\n result = 0\n for num in nums:\n result |= num\n return result\n \n left, right = 0, 0\n min_length = len(nums) + 1\n OR_value = 0\n \n while right < len(nums):\n OR_value |= nums[right]\n while OR_value >= k:\n min_length = min(min_length, right - left + 1)\n OR_value ^= nums[left]\n left += 1\n right += 1\n \n return min_length if min_length <= len(nums) else -1", "class Solution:\n def minimumSubarrayLength(self, nums: List[int], k: int) -> int:\n if k == 0:\n return 1\n \n needed_bits = []\n for i in range(60, -1, -1):\n if k & (1 << i):\n needed_bits.append(i)\n \n or_window = 0\n left = 0\n min_len = float('inf')\n for right in range(len(nums)):\n or_window |= nums[right]\n \n while or_window & k == k:\n min_len = min(min_len, right - left + 1)\n or_window ^= nums[left]\n left += 1\n \n return -1 if min_len == float('inf') else min_len", "class Solution:\n def minimumSubarrayLength(self, nums: List[int], k: int) -> int:\n def calculate_OR(nums):\n result = 0\n for num in nums:\n result |= num\n return result\n \n left, right = 0, 0\n min_length = len(nums) + 1\n OR_value = 0\n \n while right < len(nums):\n OR_value |= nums[right]\n while OR_value >= k:\n min_length = min(min_length, right - left + 1)\n OR_value ^= nums[left]\n left += 1\n right += 1\n \n return min_length if min_length <= len(nums) else -1", "class Solution:\n def minimumSubarrayLength(self, nums: List[int], k: int) -> int:\n def calculate_OR(nums):\n result = 0\n for num in nums:\n result |= num\n return result\n \n left = 0\n right = 0\n min_length = len(nums) + 1\n OR_value = 0\n \n while right < len(nums):\n OR_value |= nums[right]\n while OR_value >= k:\n min_length = min(min_length, right - left + 1)\n OR_value ^= nums[left]\n left += 1\n right += 1\n \n return min_length if min_length <= len(nums) else -1", "class Solution:\n def minimumSubarrayLength(self, nums: List[int], k: int) -> int:\n if k == 0:\n return 1\n \n needed_bits = []\n for i in range(60, -1, -1):\n if k & (1 << i):\n needed_bits.append(i)\n \n or_window = 0\n left = 0\n min_len = float('inf')\n \n for right in range(len(nums)):\n or_window |= nums[right]\n \n while or_window & k == k:\n min_len = min(min_len, right - left + 1)\n or_window ^= nums[left]\n left += 1\n \n return -1 if min_len == float('inf') else min_len", "class Solution:\n def minimumSubarrayLength(self, nums: List[int], k: int) -> int:\n if k == 0:\n return 1\n \n needed_bits = []\n for i in range(60, -1, -1):\n if k & (1 << i):\n needed_bits.append(i)\n \n or_window = 0\n left = 0\n min_len = float('inf')\n \n for right in range(len(nums)):\n or_window |= nums[right]\n \n while or_window & k == k:\n min_len = min(min_len, right - left + 1)\n or_window ^= nums[left]\n left += 1\n \n return -1 if min_len == float('inf') else min_len", "class Solution:\n def minimumSubarrayLength(self, nums: List[int], k: int) -> int:\n def calculate_OR(nums):\n result = 0\n for num in nums:\n result |= num\n return result\n \n left = 0\n right = 0\n min_length = len(nums) + 1\n OR_value = 0\n \n while right < len(nums):\n OR_value |= nums[right]\n while OR_value >= k:\n min_length = min(min_length, right - left + 1)\n OR_value ^= nums[left]\n left += 1\n right += 1\n \n return min_length if min_length <= len(nums) else -1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberOfSubarrays(self, nums: List[int]) -> int:\n max_val = max(nums)\n count = 0\n count_max = 0\n for num in nums:\n if num == max_val:\n count_max += 1\n count += count_max\n return count", "class Solution:\n def numberOfSubarrays(self, nums: List[int]) -> int:\n max_elem = max(nums)\n count = 0\n left = right = 0\n for i in range(len(nums)):\n if nums[i] == max_elem:\n count += (i - left + 1) * (right - i)\n left = i\n while right < len(nums) and nums[right] != max_elem:\n right += 1\n return count", "class Solution:\n def numberOfSubarrays(self, nums: List[int]) -> int:\n max_val = max(nums)\n count = 0\n count_max = 0\n\n for num in nums:\n if num == max_val:\n count_max += count + 1\n count = 0\n else:\n count += 1\n\n return count_max", "class Solution:\n def numberOfSubarrays(self, nums: List[int]) -> int:\n max_elem = max(nums)\n count = 0\n left = 0\n right = 0\n subarray_count = 0\n \n while right < len(nums):\n if nums[right] == max_elem:\n subarray_count += 1\n count += (subarray_count) * (subarray_count + 1) // 2\n else:\n subarray_count = 0\n right += 1\n \n return count", "class Solution:\n def numberOfSubarrays(self, nums: List[int]) -> int:\n max_elem = max(nums)\n count = 0\n left = 0\n right = 0\n subarray_count = 0\n \n while right < len(nums):\n if nums[right] == max_elem:\n subarray_count += 1\n count += right - left + 1\n right += 1\n else:\n left = right\n right = left\n \n return count", "class Solution:\n def numberOfSubarrays(self, nums: List[int]) -> int:\n max_val = max(nums)\n count = 0\n count_max = 0\n\n for num in nums:\n if num == max_val:\n count_max += count + 1\n count = 0\n else:\n count += 1\n\n return count_max", "class Solution:\n def numberOfSubarrays(self, nums: List[int]) -> int:\n max_val = max(nums)\n count = 0\n left = 0\n right = 0\n subarray_count = 0\n \n while right < len(nums):\n if nums[right] == max_val:\n subarray_count += 1\n count += (subarray_count * (subarray_count + 1)) // 2\n else:\n subarray_count = 0\n right += 1\n \n return count", "class Solution:\n def numberOfSubarrays(self, nums: List[int]) -> int:\n max_val = max(nums)\n count = 0\n left = 0\n right = 0\n while right < len(nums):\n if nums[right] == max_val:\n count += right - left + 1\n right += 1\n else:\n left = right\n right += 1\n return count", "class Solution:\n def numberOfSubarrays(self, nums: List[int]) -> int:\n count = 0\n max_val = max(nums)\n max_count = nums.count(max_val)\n\n count = max_count * (max_count + 1) // 2\n\n return count", "class Solution:\n def numberOfSubarrays(self, nums: List[int]) -> int:\n max_val = max(nums)\n count = 0\n left = 0\n right = 0\n while right < len(nums):\n if nums[right] == max_val:\n count += right - left + 1\n right += 1\n else:\n left = right\n right += 1\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumEnergy(self, energy: List[int], k: int) -> int:\n n = len(energy)\n total_sum = sum(energy)\n prefix_sum = [0] * n\n prefix_sum[0] = energy[0]\n for i in range(1, n):\n prefix_sum[i] = prefix_sum[i - 1] + energy[i]\n\n max_energy = -float(\"inf\")\n for i in range(k, n):\n jump_sum = prefix_sum[i - 1] - prefix_sum[i - k]\n max_energy = max(max_energy, jump_sum)\n\n return max_energy + (total_sum - prefix_sum[-1])", "class Solution:\n def maximumEnergy(self, energy: List[int], k: int) -> int:\n n = len(energy)\n total_sum = [0] * n\n current_sum = 0\n\n # Calculate the total sum of energy for each subarray of size k\n for i in range(k):\n current_sum += energy[i]\n total_sum[0] = current_sum\n\n for i in range(1, n - k + 1):\n current_sum += energy[i + k - 1] - energy[i - 1]\n total_sum[i] = current_sum\n\n # Return the maximum total sum\n return max(total_sum)", "class Solution:\n def maximumEnergy(self, energy: List[int], k: int) -> int:\n n = len(energy)\n total_energy = [0] * n\n \n for i in range(n):\n total_energy[i] = energy[i]\n if i >= k:\n total_energy[i] += total_energy[i - k]\n \n return max(total_energy)", "class Solution:\n def maximumEnergy(self, energy: List[int], k: int) -> int:\n n = len(energy)\n total_sum = sum(energy)\n prefix_sum = [0] * n\n prefix_sum[0] = energy[0]\n for i in range(1, n):\n prefix_sum[i] = prefix_sum[i - 1] + energy[i]\n max_sum = -float(\"inf\")\n for i in range(k, n):\n max_sum = max(max_sum, prefix_sum[i - k] - prefix_sum[i - k - 1] if i - k - 1 >= 0 else prefix_sum[i - k],\n prefix_sum[i] - total_sum + prefix_sum[i - k])\n return max_sum", "class Solution:\n def maximumEnergy(self, energy: List[int], k: int) -> int:\n n = len(energy)\n total_energy = [0] * n\n\n for i in range(n):\n total_energy[i] = energy[i]\n if i >= k:\n total_energy[i] += total_energy[i - k]\n\n return max(total_energy)", "class Solution:\n def maximumEnergy(self, energy: List[int], k: int) -> int:\n n = len(energy)\n total_energy = [0] * n\n\n for i in range(n):\n total_energy[i] = energy[i]\n if i >= k:\n total_energy[i] += total_energy[i - k]\n\n return max(total_energy)", "class Solution:\n def maximumEnergy(self, energy: List[int], k: int) -> int:\n n = len(energy)\n total_energy = [0] * n\n \n # Calculate total energy for each magician\n for i in range(n):\n j = i\n sum_energy = 0\n while j < n:\n sum_energy += energy[j]\n j += k\n total_energy[i] = sum_energy\n \n # Return the maximum total energy\n return max(total_energy)", "class Solution:\n def maximumEnergy(self, energy: List[int], k: int) -> int:\n n = len(energy)\n total_sum = sum(energy)\n prefix_sum = [0] * n\n \n for i in range(n):\n prefix_sum[i] = total_sum\n if i >= k:\n prefix_sum[i] -= prefix_sum[i - k]\n total_sum -= energy[i]\n \n return max(prefix_sum)", "class Solution:\n def maximumEnergy(self, energy: List[int], k: int) -> int:\n n = len(energy)\n total_energy = [0] * n\n \n for i in range(n):\n total_energy[i] = energy[i]\n if i >= k:\n total_energy[i] += total_energy[i - k]\n \n return max(total_energy)", "class Solution:\n def maximumEnergy(self, energy: List[int], k: int) -> int:\n n = len(energy)\n total_sum = sum(energy)\n prefix_sum = [0] * n\n prefix_sum[0] = energy[0]\n for i in range(1, n):\n prefix_sum[i] = prefix_sum[i - 1] + energy[i]\n max_sum = -float(\"inf\")\n for i in range(k, n):\n max_sum = max(max_sum, prefix_sum[i - k] - prefix_sum[i - k - 1] if i - k - 1 >= 0 else prefix_sum[i - k], total_sum - prefix_sum[i - 1])\n return max_sum" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumOperationsToMakeKPeriodic(self, word: str, k: int) -> int:\n n = len(word)\n count = 0\n for i in range(k):\n temp = word[i:n:k]\n if temp == word[:len(temp)]:\n count += 1\n return k - count", "class Solution:\n def minimumOperationsToMakeKPeriodic(self, word: str, k: int) -> int:\n n = len(word)\n count = 0\n for i in range(0, n, k):\n for j in range(i + k, n, k):\n if word[i:i + k] == word[j:j + k]:\n count += 1\n break\n return n // k - count", "class Solution:\n def minimumOperationsToMakeKPeriodic(self, word: str, k: int) -> int:\n n = len(word)\n cnt = [0] * 26\n for i in range(0, n, k):\n for j in range(k):\n cnt[ord(word[i + j]) - ord('a')] += 1\n\n res = 0\n for i in range(26):\n res += cnt[i] // k\n\n return len(word) // k - res", "class Solution:\n def minimumOperationsToMakeKPeriodic(self, word: str, k: int) -> int:\n n = len(word)\n count = 0\n for i in range(0, n, k):\n for j in range(i + k, n, k):\n if word[i:i + k] == word[j:j + k]:\n count += 1\n break\n return n // k - count", "class Solution:\n def minimumOperationsToMakeKPeriodic(self, word: str, k: int) -> int:\n n = len(word)\n count = 0\n for i in range(0, n, k):\n s = word[i:i + k]\n if s not in word[:i]:\n count += 1\n word = word.replace(word[i:i + k], s, 1)\n return count", "class Solution:\n def minimumOperationsToMakeKPeriodic(self, word: str, k: int) -> int:\n n = len(word)\n count = 0\n for i in range(k):\n temp = word[i:n:k]\n if i == 0:\n s = temp\n else:\n for j in range(len(temp)):\n if temp[j] != s[j]:\n count += 1\n break\n return count", "class Solution:\n def minimumOperationsToMakeKPeriodic(self, word: str, k: int) -> int:\n n = len(word)\n count = 0\n for i in range(k):\n temp = word[i:n:k]\n if temp == word[:len(temp)]:\n count += 1\n word = word[1:]\n return k - count", "class Solution:\n def minimumOperationsToMakeKPeriodic(self, word: str, k: int) -> int:\n n = len(word)\n cnt = [0] * 26\n for i in range(k):\n cnt[ord(word[i]) - ord('a')] += 1\n target = [0] * 26\n for i in range(26):\n if cnt[i] > 0:\n target[i] = 1\n for i in range(k, n, k):\n for j in range(26):\n cnt[j] -= ord(word[i - k]) - ord('a') == j\n for j in range(26):\n cnt[j] += ord(word[i]) - ord('a') == j\n if cnt[ord(word[i]) - ord('a')] == 1:\n target[ord(word[i]) - ord('a')] -= 1\n res = 0\n for i in range(26):\n res += cnt[i] // k - target[i]\n return res", "class Solution:\n def minimumOperationsToMakeKPeriodic(self, word: str, k: int) -> int:\n n = len(word)\n count = 0\n for i in range(k):\n temp = word[i:n:k]\n if temp == word[:len(temp)]:\n count += 1\n word = word[1:]\n return k - count", "class Solution:\n def minimumOperationsToMakeKPeriodic(self, word: str, k: int) -> int:\n n = len(word)\n count = 0\n for i in range(k):\n temp = word[i:n:k]\n if temp != word[:len(temp)]:\n count += 1\n word = word.replace(temp, word[:len(temp)], 1)\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minOperationsToMakeMedianK(self, nums: List[int], k: int) -> int:\n n = len(nums)\n nums.sort()\n mid = (n - 1) // 2\n left_sum = 0\n right_sum = 0\n\n for i in range(mid + 1):\n left_sum += abs(nums[i] - k)\n\n for i in range(mid + 1, n):\n right_sum += abs(nums[i] - k)\n\n return min(left_sum, right_sum)", "class Solution:\n def minOperationsToMakeMedianK(self, nums: List[int], k: int) -> int:\n n = len(nums)\n nums.sort()\n mid = (n - 1) // 2\n left_sum = 0\n right_sum = 0\n\n for i in range(mid + 1):\n left_sum += abs(nums[i] - k)\n\n for i in range(mid + 1, n):\n right_sum += abs(nums[i] - k)\n\n return min(left_sum, right_sum)", "class Solution:\n def minOperationsToMakeMedianK(self, nums: List[int], k: int) -> int:\n n = len(nums)\n nums.sort()\n med_index = (n - 1) // 2\n left_sum = 0\n right_sum = 0\n\n for i in range(med_index + 1):\n left_sum += abs(nums[i] - k)\n\n for i in range(med_index + 1, n):\n right_sum += abs(nums[i] - k)\n\n return min(left_sum, right_sum)", "class Solution:\n def minOperationsToMakeMedianK(self, nums: List[int], k: int) -> int:\n n = len(nums)\n nums.sort()\n left = self.minOperations(nums, k, True)\n right = self.minOperations(nums, k, False)\n return min(left, right)\n\n def minOperations(self, nums, k, smaller):\n count = 0\n i = 0 if smaller else len(nums) - 1\n median_index = len(nums) // 2\n while True:\n if i == median_index:\n return count\n if smaller:\n if nums[i] <= k:\n count += k - nums[i]\n i += 1\n else:\n count += nums[i] - k\n i += 2\n else:\n if nums[i] >= k:\n count += nums[i] - k\n i -= 1\n else:\n count += k - nums[i]\n i -= 2", "class Solution:\n def minOperationsToMakeMedianK(self, nums: List[int], k: int) -> int:\n n = len(nums)\n nums.sort()\n mid = (n - 1) // 2\n left = 0\n right = n - 1\n operations = 0\n\n while left <= right:\n if nums[mid] == k:\n operations = 0\n break\n elif nums[mid] > k:\n operations += nums[mid] - k\n right = mid - 1\n else:\n operations += k - nums[mid]\n left = mid + 1\n mid = (left + right) // 2\n\n return operations", "class Solution:\n def minOperationsToMakeMedianK(self, nums: List[int], k: int) -> int:\n n = len(nums)\n nums.sort()\n mid = (n - 1) // 2\n left = 0\n right = n - 1\n operations = 0\n\n while left <= right:\n if nums[mid] == k:\n operations = 0\n break\n elif nums[mid] > k:\n operations += nums[mid] - k\n right = mid - 1\n else:\n operations += k - nums[mid]\n left = mid + 1\n mid = (left + right) // 2\n\n return operations", "class Solution:\n def minOperationsToMakeMedianK(self, nums: List[int], k: int) -> int:\n n = len(nums)\n nums.sort()\n mid = (n - 1) // 2\n left_sum = 0\n right_sum = 0\n\n for i in range(mid + 1):\n left_sum += abs(nums[i] - k)\n\n for i in range(mid + 1, n):\n right_sum += abs(nums[i] - k)\n\n return min(left_sum, right_sum)", "class Solution:\n def minOperationsToMakeMedianK(self, nums: List[int], k: int) -> int:\n n = len(nums)\n nums.sort()\n med_index = (n - 1) // 2\n left_sum = 0\n right_sum = 0\n\n for i in range(med_index + 1):\n left_sum += abs(nums[i] - k)\n\n for i in range(med_index + 1, n):\n right_sum += abs(nums[i] - k)\n\n return min(left_sum, right_sum)", "class Solution:\n def minOperationsToMakeMedianK(self, nums: List[int], k: int) -> int:\n n = len(nums)\n nums.sort()\n mid = (n - 1) // 2\n left_sum = 0\n right_sum = 0\n\n for i in range(mid + 1):\n left_sum += abs(nums[i] - k)\n\n for i in range(mid + 1, n):\n right_sum += abs(nums[i] - k)\n\n return min(left_sum, right_sum)", "class Solution:\n def minOperationsToMakeMedianK(self, nums: List[int], k: int) -> int:\n n = len(nums)\n nums.sort()\n mid = (n - 1) // 2\n left = self.minOperations(nums, k, mid, True)\n right = self.minOperations(nums, k, mid, False)\n return min(left, right)\n\n def minOperations(self, nums, k, mid, is_left):\n operations = 0\n for i in range(mid + (not is_left), len(nums)):\n operations += abs(nums[i] - k)\n for i in range(mid - (is_left) - 1, -1, -1):\n operations += abs(nums[i] - k)\n return operations" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberOfRightTriangles(self, grid: List[List[int]]) -> int:\n def count_right_triangles(row1, col1, row2, col2):\n return grid[row1][col1] and grid[row1][col2] and grid[row2][col2]\n\n triangle_count = 0\n for row1 in range(len(grid)):\n for col1 in range(len(grid[row1])):\n for row2 in range(row1 + 1, len(grid)):\n for col2 in range(len(grid[row2])):\n if count_right_triangles(row1, col1, row2, col2):\n triangle_count += 1\n return triangle_count", "class Solution:\n def numberOfRightTriangles(self, grid: List[List[int]]) -> int:\n def count_right_triangles(row1, col1, row2, col2):\n return grid[row1][col1] and grid[row1][col2] and grid[row2][col2]\n\n triangle_count = 0\n for row1 in range(len(grid)):\n for col1 in range(len(grid[row1])):\n for row2 in range(row1 + 1, len(grid)):\n for col2 in range(len(grid[row2])):\n if count_right_triangles(row1, col1, row2, col2):\n triangle_count += 1\n return triangle_count", "class Solution:\n def numberOfRightTriangles(self, grid: List[List[int]]) -> int:\n count = 0\n for i in range(len(grid)):\n for j in range(len(grid[i])):\n if grid[i][j] == 1:\n for k in range(i + 1, len(grid)):\n if grid[k][j] == 1 and grid[k][j - i + k - 1] == 1:\n count += 1\n return count", "class Solution:\n def numberOfRightTriangles(self, grid: List[List[int]]) -> int:\n count = 0\n for i in range(len(grid)):\n for j in range(len(grid[i])):\n if grid[i][j] == 1:\n for k in range(i + 1, len(grid)):\n if grid[k][j] == 1 and grid[k][j - i + k] == 1:\n count += 1\n return count", "class Solution:\n def numberOfRightTriangles(self, grid: List[List[int]]) -> int:\n count = 0\n rows = len(grid)\n cols = len(grid[0])\n\n for i in range(rows):\n for j in range(cols):\n if grid[i][j] == 1:\n for k in range(i + 1, rows):\n if grid[k][j] == 1 and grid[k][j - i + k - 1] == 1:\n count += 1\n return count", "class Solution:\n def numberOfRightTriangles(self, grid: List[List[int]]) -> int:\n def count_right_triangles(row1, col1, row2, col2):\n return grid[row1][col1] and grid[row1][col2] and grid[row2][col2]\n\n num_triangles = 0\n for row1 in range(len(grid)):\n for col1 in range(len(grid[row1])):\n for row2 in range(row1 + 1, len(grid)):\n for col2 in range(len(grid[row2])):\n if count_right_triangles(row1, col1, row2, col2):\n num_triangles += 1\n return num_triangles", "class Solution:\n def numberOfRightTriangles(self, grid: List[List[int]]) -> int:\n count = 0\n for i in range(len(grid)):\n for j in range(len(grid[i])):\n if grid[i][j] == 1:\n for k in range(i + 1, len(grid)):\n if grid[k][j] == 1 and grid[k][j - i + k] == 1:\n count += 1\n return count", "class Solution:\n def numberOfRightTriangles(self, grid: List[List[int]]) -> int:\n def count_right_triangles(row1, col1, row2, col2):\n return grid[row1][col1] and grid[row1][col2] and grid[row2][col2]\n\n num_triangles = 0\n for i in range(len(grid)):\n for j in range(len(grid[i])):\n if grid[i][j]:\n for k in range(j + 1, len(grid[i])):\n if grid[i][k]:\n num_triangles += sum(count_right_triangles(i, j, a, k) for a in range(len(grid))) - count_right_triangles(i, j, i, k)\n return num_triangles", "class Solution:\n def numberOfRightTriangles(self, grid: List[List[int]]) -> int:\n count = 0\n for i in range(len(grid)):\n for j in range(len(grid[i])):\n if grid[i][j] == 1:\n for k in range(i + 1, len(grid)):\n if grid[k][j] == 1 and grid[k][j] == 1:\n count += 1\n return count", "class Solution:\n def numberOfRightTriangles(self, grid: List[List[int]]) -> int:\n count = 0\n for i in range(len(grid)):\n for j in range(len(grid[i])):\n if grid[i][j] == 1:\n for k in range(i + 1, len(grid)):\n if grid[k][j] == 1 and grid[k][j - i + k - 1] == 1:\n count += 1\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minEnd(self, n: int, x: int) -> int:\n if n == 1:\n return x\n count = 0\n i = 0\n while x != 0:\n if x % 2 == 1:\n count += 1\n x //= 2\n if count == 0:\n return x\n ans = x\n for i in range(1, n):\n ans |= ans << i\n ans |= ans >> i\n ans += 1\n if ans >> count == 0:\n break\n return ans", "class Solution:\n def minEnd(self, n: int, x: int) -> int:\n if n == 1:\n return x\n count = 0\n i = 0\n while x > 0:\n if x % 2 == 1:\n count += 1\n x //= 2\n if count == 0:\n return x\n ans = x\n for i in range(1, n):\n ans |= ans << i\n ans |= ans >> i\n ans += 1\n if ans >> count == 0:\n break\n return ans", "class Solution:\n def minEnd(self, n: int, x: int) -> int:\n if n == 1:\n return x\n ans = x\n for i in range(30, -1, -1):\n if n > 1 and x & (1 << i):\n ans += (1 << i)\n n -= 1\n return ans", "class Solution:\n def minEnd(self, n: int, x: int) -> int:\n if n == 1:\n return x\n ans = x\n for i in range(1, n):\n ans |= (ans + 1) << i\n return ans", "class Solution:\n def minEnd(self, n: int, x: int) -> int:\n if n == 1:\n return x\n ans = x\n for i in range(30, -1, -1):\n if (x >> i) & 1:\n ans += (1 << i) * (n - 1)\n return ans", "class Solution:\n def minEnd(self, n: int, x: int) -> int:\n if x == 0:\n return 1\n bit_count = 0\n for i in range(31, -1, -1):\n if (x >> i) & 1:\n bit_count = i + 1\n break\n return (1 << bit_count) + n - 2", "class Solution:\n def minEnd(self, n: int, x: int) -> int:\n if n == 1:\n return x\n \n count = 0\n factor = 1\n while factor <= x:\n if x % factor == 0:\n count += 1\n factor *= 2\n \n if count == 0:\n return x + 1\n elif count == 1:\n return x * 2\n else:\n return x + 2 ** (count - 1)", "class Solution:\n def minEnd(self, n: int, x: int) -> int:\n if n == 1:\n return x\n count = 0\n i = 0\n while x > 0:\n if x % 2 == 1:\n count += 1\n x //= 2\n if count == 0:\n return x\n ans = x\n for i in range(1, n):\n x += 2 ** (i - 1)\n ans = min(ans, x + 2 ** (i - 1) - 1)\n return ans", "class Solution:\n def minEnd(self, n: int, x: int) -> int:\n if x == 0:\n return 1\n bit_length = 0\n while x > 0:\n x >>= 1\n bit_length += 1\n return 2 ** (bit_length - 1) * (n - 1) + x", "class Solution:\n def minEnd(self, n: int, x: int) -> int:\n if x == 0:\n return 1\n bit_count = 0\n for i in range(31, -1, -1):\n if x & (1 << i):\n bit_count += 1\n else:\n break\n return 2 ** (bit_count - 1) * (2 ** (n - 1 - bit_count) or 1) + x - 1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minAnagramLength(self, s: str) -> int:\n letter_count = {}\n for letter in s:\n if letter in letter_count:\n letter_count[letter] += 1\n else:\n letter_count[letter] = 1\n\n unique_letters = len(letter_count)\n max_frequency = max(letter_count.values())\n\n return max(unique_letters, max_frequency)", "class Solution:\n def minAnagramLength(self, s: str) -> int:\n from collections import Counter\n\n counter = Counter(s)\n min_length = float(\"inf\")\n\n for char in counter:\n if counter[char] > 0:\n min_length = min(min_length, counter[char])\n\n return min_length", "class Solution:\n def minAnagramLength(self, s: str) -> int:\n letter_count = {}\n for letter in s:\n if letter not in letter_count:\n letter_count[letter] = 1\n else:\n letter_count[letter] += 1\n\n unique_letters = len(letter_count)\n return max(unique_letters, int(len(s) / unique_letters))", "class Solution:\n def minAnagramLength(self, s: str) -> int:\n letter_count = {}\n for letter in s:\n if letter not in letter_count:\n letter_count[letter] = 1\n else:\n letter_count[letter] += 1\n\n unique_letters = len(letter_count)\n max_occurrences = max(letter_count.values())\n\n return max(unique_letters, max_occurrences)", "class Solution:\n def minAnagramLength(self, s: str) -> int:\n letter_count = {}\n for letter in s:\n if letter not in letter_count:\n letter_count[letter] = 1\n else:\n letter_count[letter] += 1\n\n unique_letters = len(letter_count)\n max_frequency = max(letter_count.values())\n\n return max(unique_letters, max_frequency)", "class Solution:\n def minAnagramLength(self, s: str) -> int:\n letter_count = {}\n for letter in s:\n if letter in letter_count:\n letter_count[letter] += 1\n else:\n letter_count[letter] = 1\n\n unique_letters = len(letter_count)\n return max(unique_letters, int(len(s) / unique_letters))", "class Solution:\n def minAnagramLength(self, s: str) -> int:\n letter_count = {}\n for letter in s:\n if letter not in letter_count:\n letter_count[letter] = 1\n else:\n letter_count[letter] += 1\n\n unique_letters = len(letter_count)\n return max(unique_letters, int(len(s) / unique_letters))", "class Solution:\n def minAnagramLength(self, s: str) -> int:\n letter_count = {}\n for letter in s:\n if letter not in letter_count:\n letter_count[letter] = 1\n else:\n letter_count[letter] += 1\n\n unique_letters = len(letter_count)\n max_frequency = max(letter_count.values())\n\n return max(unique_letters, max_frequency)", "class Solution:\n def minAnagramLength(self, s: str) -> int:\n from collections import Counter\n\n counter = Counter(s)\n min_length = len(s)\n for count in counter.values():\n min_length = min(min_length, s.length // count)\n return min_length", "class Solution:\n def minAnagramLength(self, s: str) -> int:\n letter_count = {}\n for letter in s:\n if letter not in letter_count:\n letter_count[letter] = 1\n else:\n letter_count[letter] += 1\n\n unique_letters = len(letter_count)\n max_frequency = max(letter_count.values())\n\n return max(unique_letters, max_frequency)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def isValid(self, word: str) -> bool:\n if len(word) < 3:\n return False\n vowels = set(\"aeiouAEIOU\")\n consonants = set(\"bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ\")\n for char in word:\n if char not in vowels.union(consonants).union(set(str(i) for i in range(10))):\n return False\n return any(char in vowels for char in word) and any(char in consonants for char in word)", "class Solution:\n def isValid(self, word: str) -> bool:\n if len(word) < 3:\n return False\n vowels = set(\"aeiouAEIOU\")\n consonants = set(\"bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ\")\n for char in word:\n if char not in vowels and char not in consonants and not char.isdigit():\n return False\n return any(char in vowels for char in word) and any(char in consonants for char in word)", "class Solution:\n def isValid(self, word: str) -> bool:\n if len(word) < 3:\n return False\n vowels = set(\"aeiouAEIOU\")\n consonants = set(\"bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ\")\n for char in word:\n if char not in vowels and char not in consonants and not char.isdigit():\n return False\n return any(char in vowels for char in word) and any(char in consonants for char in word)", "class Solution:\n def isValid(self, word: str) -> bool:\n if len(word) < 3:\n return False\n vowels = set(\"aeiouAEIOU\")\n consonants = set(\"bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ\")\n for char in word:\n if char not in vowels and char not in consonants and not char.isdigit():\n return False\n return any(char in vowels for char in word) and any(char in consonants for char in word)", "class Solution:\n def isValid(self, word: str) -> bool:\n if len(word) < 3:\n return False\n vowels = set(\"aeiouAEIOU\")\n consonants = set(\"bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ\")\n for char in word:\n if char not in vowels and char not in consonants and not char.isdigit():\n return False\n return bool(vowels & set(word)) and bool(consonants & set(word))", "class Solution:\n def isValid(self, word: str) -> bool:\n if len(word) < 3:\n return False\n vowels = set(\"aeiouAEIOU\")\n consonants = set(\"bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ\")\n for char in word:\n if char not in vowels.union(consonants).union(set(str(range(10)))):\n return False\n return any(char in vowels for char in word) and any(char in consonants for char in word)", "class Solution:\n def isValid(self, word: str) -> bool:\n if len(word) < 3:\n return False\n vowels = set(\"aeiouAEIOU\")\n consonants = set(\"bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ\")\n for char in word:\n if char not in vowels and char not in consonants and not char.isdigit():\n return False\n return any(char in vowels for char in word) and any(char in consonants for char in word)", "class Solution:\n def isValid(self, word: str) -> bool:\n if len(word) < 3:\n return False\n vowels = set(\"aeiouAEIOU\")\n consonants = set(\"bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ\")\n for char in word:\n if char not in vowels and char not in consonants and not char.isdigit():\n return False\n return any(char in vowels for char in word) and any(char in consonants for char in word)", "class Solution:\n def isValid(self, word: str) -> bool:\n if len(word) < 3:\n return False\n vowels = set(\"aeiouAEIOU\")\n consonants = set(\"bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ\")\n for char in word:\n if char not in vowels and char not in consonants and not char.isdigit():\n return False\n return bool(word.replace(\"0123456789\", \"\", 1).strip()) and bool(word.replace(vowels, \"\", 1).strip())", "class Solution:\n def isValid(self, word: str) -> bool:\n if len(word) < 3:\n return False\n vowels = set(\"aeiouAEIOU\")\n consonants = set(\"bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ\")\n for char in word:\n if char not in vowels and char not in consonants and not char.isdigit():\n return False\n return bool(vowels & set(word)) and bool(consonants & set(word))" ], "pass1_list": [ true, true, true, true, true, false, true, true, false, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def addedInteger(self, nums1: List[int], nums2: List[int]) -> int:\n return sum(nums2) - sum(nums1) // len(nums1)", "class Solution:\n def addedInteger(self, nums1: List[int], nums2: List[int]) -> int:\n return sum(nums2) - sum(nums1) // len(nums1)", "class Solution:\n def addedInteger(self, nums1: List[int], nums2: List[int]) -> int:\n return sum(nums2) - sum(nums1)", "class Solution:\n def addedInteger(self, nums1: List[int], nums2: List[int]) -> int:\n return sum(nums2) - sum(nums1) // len(nums1)", "class Solution:\n def addedInteger(self, nums1: List[int], nums2: List[int]) -> int:\n return sum(nums2) - sum(nums1) // len(nums1)", "class Solution:\n def addedInteger(self, nums1: List[int], nums2: List[int]) -> int:\n return sum(nums2) - sum(nums1)", "class Solution:\n def addedInteger(self, nums1: List[int], nums2: List[int]) -> int:\n sum_nums1 = sum(nums1)\n sum_nums2 = sum(nums2)\n length = len(nums1)\n x = (sum_nums2 - sum_nums1) / length\n return int(x)", "class Solution:\n def addedInteger(self, nums1: List[int], nums2: List[int]) -> int:\n return sum(nums2) - sum(nums1) // len(nums1)", "class Solution:\n def addedInteger(self, nums1: List[int], nums2: List[int]) -> int:\n return sum(nums2) - sum(nums1)", "class Solution:\n def addedInteger(self, nums1: List[int], nums2: List[int]) -> int:\n sum_nums1 = sum(nums1)\n sum_nums2 = sum(nums2)\n length = len(nums1)\n x = (sum_nums2 - sum_nums1) / length\n return int(x)" ], "pass1_list": [ false, false, false, false, false, false, true, false, false, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def canMakeSquare(self, grid: List[List[str]]) -> bool:\n def is_square(grid, color):\n count = 0\n for i in range(3):\n for j in range(3):\n if grid[i][j] == color:\n count += 1\n return count >= 4\n\n return is_square(grid, 'B') or is_square(grid, 'W') or (grid[0][0] + grid[0][1] + grid[1][0] + grid[1][1] + grid[2][2] + grid[2][1] == 'WWWWWW' or grid[0][2] + grid[0][1] + grid[1][2] + grid[1][1] + grid[2][0] + grid[2][1] == 'WWWWWW' or grid[0][0] + grid[1][0] + grid[0][1] + grid[1][1] + grid[2][2] + grid[2][1] == 'BBBBBB' or grid[0][0] + grid[1][0] + grid[0][2] + grid[1][2] + grid[2][0] + grid[2][1] == 'BBBBBB')", "class Solution:\n def canMakeSquare(self, grid: List[List[str]]) -> bool:\n def is_square(grid, color):\n count = 0\n for i in range(3):\n for j in range(3):\n if grid[i][j] == color:\n count += 1\n return count >= 4\n\n return is_square(grid, 'B') or is_square(grid, 'W') or (grid[0][0] + grid[0][1] + grid[1][0] + grid[1][1] == 'WWWW' or grid[0][1] + grid[0][2] + grid[1][1] + grid[1][2] == 'WWWW' or grid[0][0] + grid[0][1] + grid[1][0] + grid[2][0] == 'WWWW' or grid[1][1] + grid[1][2] + grid[2][1] + grid[2][2] == 'WWWW')", "class Solution:\n def canMakeSquare(self, grid: List[List[str]]) -> bool:\n def is_square(a, b, c, d):\n return a == b == c == d\n\n for i in range(3):\n for j in range(3):\n if is_square(grid[i][j], grid[i][j + 1], grid[i + 1][j], grid[i + 1][j + 1]):\n return True\n if is_square(grid[i][j], grid[i][j + 1], grid[i - 1][j], grid[i - 1][j + 1]):\n return True\n if is_square(grid[i][j], grid[i + 1][j], grid[i][j + 1], grid[i + 1][j + 1]):\n return True\n if is_square(grid[i][j], grid[i - 1][j], grid[i][j + 1], grid[i - 1][j + 1]):\n return True\n if is_square(grid[i][j], grid[i + 1][j], grid[i - 1][j], grid[i + 1][j + 1]):\n return True\n if is_square(grid[i][j], grid[i - 1][j], grid[i + 1][j], grid[i - 1][j + 1]):\n return True\n if is_square(grid[i][j], grid[i + 1][j - 1], grid[i + 1][j], grid[i][j + 1]):\n return True\n if is_square(grid[i][j], grid[i - 1][j - 1], grid[i - 1][j], grid[i][j + 1]):\n return True\n\n return False", "class Solution:\n def canMakeSquare(self, grid: List[List[str]]) -> bool:\n def is_square(grid, color):\n count = 0\n for i in range(3):\n for j in range(3):\n if grid[i][j] == color:\n count += 1\n return count >= 4\n\n return is_square(grid, 'B') or is_square(grid, 'W')", "class Solution:\n def canMakeSquare(self, grid: List[List[str]]) -> bool:\n def is_square(grid, color):\n count = 0\n for i in range(3):\n for j in range(3):\n if grid[i][j] == color:\n count += 1\n return count >= 4\n\n return is_square(grid, 'B') or is_square(grid, 'W')", "class Solution:\n def canMakeSquare(self, grid: List[List[str]]) -> bool:\n def is_square(grid, color):\n count = 0\n for i in range(3):\n for j in range(3):\n if grid[i][j] == color:\n count += 1\n return count >= 4\n\n return is_square(grid, 'B') or is_square(grid, 'W') or (grid[0][0] + grid[0][1] + grid[1][0] + grid[1][1] == 'WWWW' or grid[0][2] + grid[1][2] + grid[2][0] + grid[2][1] == 'WWWW' or grid[0][0] + grid[1][1] + grid[2][0] + grid[2][2] == 'WWWW' or grid[0][2] + grid[1][1] + grid[2][0] + grid[2][2] == 'WWWW')", "class Solution:\n def canMakeSquare(self, grid: List[List[str]]) -> bool:\n def is_square(grid, color):\n count = 0\n for i in range(3):\n for j in range(3):\n if grid[i][j] == color:\n count += 1\n return count >= 4\n\n return is_square(grid, 'W') or is_square(grid, 'B')", "class Solution:\n def canMakeSquare(self, grid: List[List[str]]) -> bool:\n def is_square(grid, color):\n count = 0\n for i in range(3):\n for j in range(3):\n if grid[i][j] == color:\n count += 1\n return count >= 4\n\n return is_square(grid, 'W') or is_square(grid, 'B')", "class Solution:\n def canMakeSquare(self, grid: List[List[str]]) -> bool:\n def is_square(grid, color):\n count = 0\n for i in range(3):\n for j in range(3):\n if grid[i][j] == color:\n count += 1\n return count >= 4\n\n return is_square(grid, 'B') or is_square(grid, 'W')", "class Solution:\n def canMakeSquare(self, grid: List[List[str]]) -> bool:\n def is_square(grid, color):\n count = 0\n for i in range(3):\n for j in range(3):\n if grid[i][j] == color:\n count += 1\n return count >= 4\n\n return is_square(grid, 'B') or is_square(grid, 'W')" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minCostToEqualizeArray(self, nums: List[int], cost1: int, cost2: int) -> int:\n if cost1 >= 2 * cost2:\n return sum((num - nums[0]) // 2 * cost2 + (num - nums[0]) % 2 * cost1 for num in nums) % (10**9 + 7)\n else:\n return sum((num - min(nums)) // 2 * cost1 + (num - min(nums)) % 2 * cost2 for num in nums) % (10**9 + 7)", "class Solution:\n def minCostToEqualizeArray(self, nums: List[int], cost1: int, cost2: int) -> int:\n if cost2 > 2 * cost1:\n return sum((num - nums[0]) * cost1 for num in nums) % (10**9 + 7)\n return sum(nums) - len(nums) * min(nums) + (len(nums) - 1) * cost2 % (10**9 + 7)", "class Solution:\n def minCostToEqualizeArray(self, nums: List[int], cost1: int, cost2: int) -> int:\n if cost1 > 2 * cost2:\n return sum(nums[i] for i in range(len(nums))) % (10**9 + 7)\n if cost1 < 2 * cost2:\n return (\n cost1 * (max(nums) - min(nums))\n + cost2 * (len(nums) - 1)\n - cost1\n - cost2\n ) % (10**9 + 7)\n return (\n cost1 * (max(nums) - min(nums))\n + cost2 * (len(nums) - 1)\n - cost2\n ) % (10**9 + 7)", "class Solution:\n def minCostToEqualizeArray(self, nums: List[int], cost1: int, cost2: int) -> int:\n if cost1 > 2 * cost2:\n return sum((num - nums[0]) // 2 * cost2 + cost1 for num in nums) % (10**9 + 7)\n return sum(max(0, num - nums[0]) * cost1) % (10**9 + 7)", "class Solution:\n def minCostToEqualizeArray(self, nums: List[int], cost1: int, cost2: int) -> int:\n if cost1 > 2 * cost2:\n return sum((num - nums[0]) // 2 * cost2 + (num - nums[0]) % 2 * cost1 for num in nums) % (10**9 + 7)\n return sum(max(0, num - nums[0]) * cost1 for num in nums) % (10**9 + 7)", "class Solution:\n def minCostToEqualizeArray(self, nums: List[int], cost1: int, cost2: int) -> int:\n if cost1 > 2 * cost2:\n cost1, cost2 = cost2 * 2, cost1\n\n n = len(nums)\n total_cost = 0\n max_num = max(nums)\n\n if cost1 <= cost2:\n total_cost += (max_num - nums[0]) * cost1\n for i in range(1, n):\n total_cost += (max_num - nums[i]) * cost1\n total_cost -= (max_num - nums[i - 1]) * (cost1 - cost2)\n else:\n total_cost += (max_num - nums[0]) * cost2\n for i in range(1, n):\n total_cost += (max_num - nums[i]) * cost2\n total_cost -= (max_num - nums[i - 1]) * (cost2 - cost1)\n\n return total_cost % (10**9 + 7)", "class Solution:\n def minCostToEqualizeArray(self, nums: List[int], cost1: int, cost2: int) -> int:\n if cost1 > 2 * cost2:\n return sum((num - nums[0]) // 2 * cost2 + (num - nums[0]) % 2 * cost1 for num in nums) % (10**9 + 7)\n return sum(max(0, num - nums[0]) * cost1 for num in nums) % (10**9 + 7)", "class Solution:\n def minCostToEqualizeArray(self, nums: List[int], cost1: int, cost2: int) -> int:\n if cost1 > 2 * cost2:\n cost1, cost2 = cost2 * 2, cost1\n\n n = len(nums)\n total_cost = 0\n max_num = max(nums)\n\n if cost1 <= cost2:\n total_cost += (max_num - nums[0]) * cost1\n for i in range(1, n):\n total_cost += (max(nums[i], nums[i - 1]) - nums[i]) * cost1\n else:\n total_cost += (max_num - nums[0]) * cost2\n for i in range(1, n):\n total_cost += (max(nums[i], nums[i - 1]) - nums[i]) * cost2\n if nums[i - 1] == nums[i]:\n total_cost -= cost2\n\n return total_cost % (10**9 + 7)", "class Solution:\n def minCostToEqualizeArray(self, nums: List[int], cost1: int, cost2: int) -> int:\n if cost1 > 2 * cost2:\n cost1, cost2 = cost2 * 2, cost1\n\n nums.sort()\n n = len(nums)\n result = 0\n i, j = 0, n - 1\n\n while i < j:\n diff = nums[j] - nums[i]\n if diff == 0:\n i += 1\n j -= 1\n elif diff == 1:\n result += cost1\n i += 1\n else:\n result += cost2\n i += 1\n j -= 1\n\n return result % (10**9 + 7)", "class Solution:\n def minCostToEqualizeArray(self, nums: List[int], cost1: int, cost2: int) -> int:\n if cost1 > 2 * cost2:\n return sum(nums[i] for i in range(len(nums))) % (10**9 + 7)\n if cost1 < 2 * cost2:\n return (\n sum(\n min(nums[i], (10**6 + 6) - nums[i]) * cost1 % (10**9 + 7)\n for i in range(len(nums))\n )\n % (10**9 + 7)\n )\n return (\n cost2\n + sum(\n min(nums[i], (10**6 + 6) - nums[i]) * cost1 // 2 % (10**9 + 7)\n for i in range(len(nums))\n )\n % (10**9 + 7)\n )" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def minimumSubstringsInPartition(self, s: str) -> int:\n def is_balanced(s):\n counts = {}\n for c in s:\n if c in counts:\n counts[c] += 1\n else:\n counts[c] = 1\n min_count = next(iter(counts.values()))\n return all(count == min_count for count in counts.values())\n\n ans = 0\n i = 0\n while i < len(s):\n j = i\n while j < len(s) and not is_balanced(s[i:j+1]):\n j += 1\n ans += 1\n i = j + 1\n return ans", "class Solution:\n def minimumSubstringsInPartition(self, s: str) -> int:\n def is_balanced(s: str) -> bool:\n char_count = {}\n for char in s:\n if char in char_count:\n char_count[char] += 1\n else:\n char_count[char] = 1\n counts = char_count.values()\n return len(set(counts)) == 1 and counts[0] > 0\n\n min_substrings = 0\n i = 0\n while i < len(s):\n if is_balanced(s[i:]):\n min_substrings += 1\n i = i + len(s[i:])\n else:\n i += 1\n\n return min_substrings", "class Solution:\n def minimumSubstringsInPartition(self, s: str) -> int:\n def is_balanced(s):\n letter_counts = {}\n for letter in s:\n if letter in letter_counts:\n letter_counts[letter] += 1\n else:\n letter_counts[letter] = 1\n min_count = next(iter(letter_counts.values()))\n for count in letter_counts.values():\n if count < min_count:\n return False\n return True\n\n left, right = 0, 0\n count = 0\n while right < len(s):\n if is_balanced(s[left:right + 1]):\n left = right + 1\n count += 1\n else:\n right += 1\n\n return count", "class Solution:\n def minimumSubstringsInPartition(self, s: str) -> int:\n def is_balanced(s):\n letter_counts = {}\n for letter in s:\n if letter in letter_counts:\n letter_counts[letter] += 1\n else:\n letter_counts[letter] = 1\n min_count = next(iter(letter_counts.values()))\n for count in letter_counts.values():\n if count < min_count:\n return False\n return True\n\n left, right = 0, 0\n count = 1\n while right < len(s):\n if is_balanced(s[left:right]):\n left = right\n right += 1\n count = right - left\n return count", "class Solution:\n def minimumSubstringsInPartition(self, s: str) -> int:\n def is_balanced(s):\n letter_counts = {}\n for letter in s:\n if letter in letter_counts:\n letter_counts[letter] += 1\n else:\n letter_counts[letter] = 1\n values = letter_counts.values()\n return len(set(values)) == 1 and values[0] > 0\n\n ans = 0\n i = 0\n while i < len(s):\n j = i + 1\n while j < len(s) and not is_balanced(s[i:j]):\n j += 1\n ans += 1\n i = j\n return ans", "class Solution:\n def minimumSubstringsInPartition(self, s: str) -> int:\n def is_balanced(s):\n letter_counts = {}\n for letter in s:\n if letter in letter_counts:\n letter_counts[letter] += 1\n else:\n letter_counts[letter] = 1\n min_count = next(iter(letter_counts.values()))\n for count in letter_counts.values():\n if count < min_count:\n return False\n return True\n\n left, right = 0, 0\n count = 1\n while right < len(s):\n if is_balanced(s[left:right]):\n left = right\n right += 1\n count = right - left\n\n return count", "class Solution:\n def minimumSubstringsInPartition(self, s: str) -> int:\n def is_balanced(s):\n counts = {}\n for c in s:\n if c in counts:\n counts[c] += 1\n else:\n counts[c] = 1\n min_count = next(iter(counts.values()))\n return all(count == min_count for count in counts.values())\n\n ans = 0\n i = 0\n while i < len(s):\n j = i\n while j < len(s) and not is_balanced(s[i:j+1]):\n j += 1\n ans += 1\n i = j + 1\n return ans", "class Solution:\n def minimumSubstringsInPartition(self, s: str) -> int:\n def is_balanced(s):\n count = {}\n for c in s:\n count[c] = count.get(c, 0) + 1\n for val in count.values():\n if val != len(count):\n return False\n return True\n\n left, right = 0, 0\n count = 0\n while right < len(s):\n while not is_balanced(s[left:right + 1]):\n left += 1\n count += 1\n left = right + 1\n right += 1\n\n return count", "class Solution:\n def minimumSubstringsInPartition(self, s: str) -> int:\n def is_balanced(s: str) -> bool:\n char_count = {}\n for char in s:\n if char in char_count:\n char_count[char] += 1\n else:\n char_count[char] = 1\n counts = char_count.values()\n return len(set(counts)) == 1 and counts[0] > 0\n\n min_partitions = 0\n i = 0\n while i < len(s):\n if is_balanced(s[i:]):\n min_partitions += 1\n i = 0\n s = \"\"\n else:\n i += 1\n\n return min_partitions", "class Solution:\n def minimumSubstringsInPartition(self, s: str) -> int:\n def is_balanced(s):\n letter_counts = {}\n for letter in s:\n if letter in letter_counts:\n letter_counts[letter] += 1\n else:\n letter_counts[letter] = 1\n for count in letter_counts.values():\n if count != len(letter_counts):\n return False\n return True\n\n left, right = 0, 0\n count = 0\n while right < len(s):\n if is_balanced(s[left:right + 1]):\n left = right + 1\n count += 1\n right += 1\n\n return count" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberOfStableArrays(self, zero: int, one: int, limit: int) -> int:\n mod = 10**9 + 7\n dp = [[0] * (one + 1) for _ in range(zero + 1)]\n dp[0][0] = 1\n for z in range(1, zero + 1):\n for o in range(1, one + 1):\n dp[z][o] = (dp[z][o - 1] + dp[z - 1][o]) % mod\n if z + o > limit:\n dp[z][o] = (dp[z][o] - dp[z - limit + o - 1][o - 1] + mod) % mod\n return dp[zero][one]", "class Solution:\n def numberOfStableArrays(self, zero: int, one: int, limit: int) -> int:\n mod = 10**9 + 7\n dp = [[0] * (one + 1) for _ in range(zero + 1)]\n for i in range(1, zero + 1):\n dp[i][0] = 1\n for i in range(1, zero + 1):\n for j in range(1, one + 1):\n dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % mod\n if i + j > limit:\n dp[i][j] = (dp[i][j] - dp[i - 1][j - 1] + mod) % mod\n return dp[zero][one]", "class Solution:\n def numberOfStableArrays(self, zero: int, one: int, limit: int) -> int:\n mod = 10**9 + 7\n dp = [[0] * (one + 1) for _ in range(zero + 1)]\n for i in range(1, zero + 1):\n dp[i][0] = 1\n for i in range(1, zero + 1):\n for j in range(1, one + 1):\n dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % mod\n if i + j > limit:\n dp[i][j] = (dp[i][j] - dp[i - 1][j - 1] + mod) % mod\n return dp[zero][one]", "class Solution:\n def numberOfStableArrays(self, zero: int, one: int, limit: int) -> int:\n mod = 10**9 + 7\n dp = [[0] * (one + 1) for _ in range(zero + 1)]\n for i in range(zero + 1):\n dp[i][0] = 1\n for i in range(1, one + 1):\n dp[0][i] = 1\n for z in range(1, zero + 1):\n for o in range(1, one + 1):\n dp[z][o] = (dp[z - 1][o] + dp[z][o - 1]) % mod\n if z + o > limit:\n dp[z][o] = (dp[z][o] - dp[z - 1][o - 1] + mod) % mod\n return dp[zero][one]", "class Solution:\n def numberOfStableArrays(self, zero: int, one: int, limit: int) -> int:\n mod = 10**9 + 7\n dp = [[0] * (one + 1) for _ in range(zero + 1)]\n dp[0][0] = 1\n for z in range(1, zero + 1):\n for o in range(1, one + 1):\n dp[z][o] = (dp[z - 1][o - 1] + dp[z][o - 1] * (o >= limit)) % mod\n return sum(dp[zero]) % mod", "class Solution:\n def numberOfStableArrays(self, zero: int, one: int, limit: int) -> int:\n mod = 10**9 + 7\n dp = [[0] * (one + 1) for _ in range(zero + 1)]\n dp[0][0] = 1\n for z in range(1, zero + 1):\n for o in range(1, one + 1):\n dp[z][o] = (dp[z - 1][o - 1] + dp[z][o - 1] * (o >= limit)) % mod\n return sum(dp[zero]) % mod", "class Solution:\n def numberOfStableArrays(self, zero: int, one: int, limit: int) -> int:\n mod = 10**9 + 7\n dp = [[0] * (one + 1) for _ in range(zero + 1)]\n dp[0][0] = 1\n for z in range(1, zero + 1):\n for o in range(1, one + 1):\n dp[z][o] = (dp[z][o - 1] + dp[z - 1][o]) % mod\n if z + o > limit:\n dp[z][o] = (dp[z][o] - dp[z - limit + o - 1][o - 1] + mod) % mod\n return dp[zero][one]", "class Solution:\n def numberOfStableArrays(self, zero: int, one: int, limit: int) -> int:\n mod = 10**9 + 7\n dp = [[0] * (one + 1) for _ in range(zero + 1)]\n for i in range(zero + 1):\n dp[i][0] = 1\n for i in range(1, one + 1):\n dp[0][i] = 1\n for z in range(1, zero + 1):\n for o in range(1, one + 1):\n dp[z][o] = (dp[z][o - 1] + dp[z - 1][o]) % mod\n if z + o > limit:\n dp[z][o] = (dp[z][o] - dp[z - 1][o - 1] + mod) % mod\n return sum(dp[zero]) % mod", "class Solution:\n def numberOfStableArrays(self, zero: int, one: int, limit: int) -> int:\n mod = 10**9 + 7\n dp = [[0] * (one + 1) for _ in range(zero + 1)]\n for i in range(1, zero + 1):\n dp[i][0] = 1\n for i in range(1, zero + 1):\n for j in range(1, one + 1):\n dp[i][j] = (dp[i - 1][j] * max(0, limit - j) % mod + dp[i][j - 1] * max(0, j - limit - 1) % mod + dp[i - 1][j - 1] * (i + j - limit - 1) % mod) % mod\n return dp[zero][one]", "class Solution:\n def numberOfStableArrays(self, zero: int, one: int, limit: int) -> int:\n mod = 10**9 + 7\n dp = [[0] * (one + 1) for _ in range(zero + 1)]\n dp[0][0] = 1\n for z in range(1, zero + 1):\n for o in range(1, one + 1):\n dp[z][o] = (dp[z][o - 1] + dp[z - 1][o]) % mod\n if z + o > limit:\n dp[z][o] = (dp[z][o] - dp[z - limit + o - 1][o - 1] + mod) % mod\n return dp[zero][one]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberOfSpecialChars(self, word: str) -> int:\n lowercase_letters = set()\n uppercase_letters = set()\n for char in word:\n if char.islower():\n lowercase_letters.add(char)\n else:\n uppercase_letters.add(char.lower())\n \n special_chars = lowercase_letters.intersection(uppercase_letters)\n return len(special_chars)", "class Solution:\n def numberOfSpecialChars(self, word: str) -> int:\n lowercase_letters = set()\n uppercase_letters = set()\n for char in word:\n if char.islower():\n lowercase_letters.add(char)\n else:\n uppercase_letters.add(char.lower())\n return len(lowercase_letters & uppercase_letters)", "class Solution:\n def numberOfSpecialChars(self, word: str) -> int:\n lowercase_letters = set()\n uppercase_letters = set()\n for char in word:\n if char.islower():\n lowercase_letters.add(char)\n else:\n uppercase_letters.add(char.lower())\n \n special_chars = lowercase_letters.intersection(uppercase_letters)\n return len(special_chars)", "class Solution:\n def numberOfSpecialChars(self, word: str) -> int:\n lowercase_letters = set()\n uppercase_letters = set()\n for char in word:\n if char.islower():\n lowercase_letters.add(char)\n else:\n uppercase_letters.add(char.lower())\n return len(lowercase_letters & uppercase_letters)", "class Solution:\n def numberOfSpecialChars(self, word: str) -> int:\n lowercase_letters = set()\n uppercase_letters = set()\n for char in word:\n if char.islower():\n lowercase_letters.add(char)\n else:\n uppercase_letters.add(char.lower())\n \n special_chars = lowercase_letters.intersection(uppercase_letters)\n return len(special_chars)", "class Solution:\n def numberOfSpecialChars(self, word: str) -> int:\n lowercase_letters = set()\n uppercase_letters = set()\n for char in word:\n if char.islower():\n lowercase_letters.add(char)\n else:\n uppercase_letters.add(char.lower())\n \n special_chars = lowercase_letters.intersection(uppercase_letters)\n return len(special_chars)", "class Solution:\n def numberOfSpecialChars(self, word: str) -> int:\n lowercase_letters = set()\n uppercase_letters = set()\n for char in word:\n if char.islower():\n lowercase_letters.add(char)\n else:\n uppercase_letters.add(char.lower())\n \n special_chars = lowercase_letters.intersection(uppercase_letters)\n return len(special_chars)", "class Solution:\n def numberOfSpecialChars(self, word: str) -> int:\n lowercase_letters = set()\n uppercase_letters = set()\n for char in word:\n if char.islower():\n lowercase_letters.add(char)\n else:\n uppercase_letters.add(char.lower())\n return len(lowercase_letters & uppercase_letters)", "class Solution:\n def numberOfSpecialChars(self, word: str) -> int:\n lowercase_letters = set()\n uppercase_letters = set()\n for char in word:\n if char.islower():\n lowercase_letters.add(char)\n else:\n uppercase_letters.add(char.lower())\n \n special_chars = lowercase_letters.intersection(uppercase_letters)\n return len(special_chars)", "class Solution:\n def numberOfSpecialChars(self, word: str) -> int:\n lowercase_letters = set()\n uppercase_letters = set()\n for char in word:\n if char.islower():\n lowercase_letters.add(char)\n else:\n uppercase_letters.add(char.lower())\n return len(lowercase_letters & uppercase_letters)" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findProductsOfElements(self, queries: List[List[int]]) -> List[int]:\n def powerful_array(x: int) -> List[int]:\n arr = []\n while x > 0:\n if x % 2 == 0:\n arr.append(2)\n x //= 2\n else:\n arr.append(1)\n x -= 1\n return arr\n\n def concatenate_arrays(arrays: List[List[int]]) -> List[int]:\n result = []\n for arr in arrays:\n result.extend(arr)\n return result\n\n def calculate_product(from_i: int, to_i: int, mod: int) -> int:\n product = 1\n for i in range(from_i, to_i + 1):\n product *= big_nums[i]\n product %= mod\n return product % mod\n\n big_nums = []\n i = 1\n while len(big_nums) < 10000:\n arr = powerful_array(i)\n big_nums.extend(arr)\n i += 1\n\n answer = []\n for query in queries:\n from_i, to_i, mod = query\n answer.append(calculate_product(big_nums.index(from_i), big_nums.index(to_i), mod))\n\n return answer", "class Solution:\n def findProductsOfElements(self, queries: List[List[int]]) -> List[int]:\n def powerful_array(x: int) -> List[int]:\n arr = []\n while x > 0:\n if x % 2 == 0:\n arr.append(2)\n x //= 2\n else:\n arr.append(1)\n x -= 1\n return arr\n\n def concatenate_arrays(arrays: List[List[int]]) -> List[int]:\n result = []\n for arr in arrays:\n result.extend(arr)\n return result\n\n def calculate_product(from_i: int, to_i: int, mod_i: int) -> int:\n product = 1\n for i in range(from_i, to_i + 1):\n product *= big_nums[i]\n product %= mod_i\n return product % mod_i\n\n big_nums = []\n n = int(1e15)\n for i in range(1, n + 1):\n arr = powerful_array(i)\n big_nums.extend(arr)\n\n answer = []\n for query in queries:\n from_i, to_i, mod_i = query\n answer.append(calculate_product(from_i, to_i, mod_i))\n\n return answer", "class Solution:\n def findProductsOfElements(self, queries: List[List[int]]) -> List[int]:\n def powerful_array(x: int) -> List[int]:\n arr = []\n while x > 0:\n if x % 2 == 1:\n arr.append(1)\n else:\n arr.append(2)\n x //= 2\n if x >= 2:\n arr.append(2 ** (x - 1))\n return arr\n\n def concatenate_arrays(n: int) -> List[int]:\n result = []\n for i in range(1, n + 1):\n arr = powerful_array(i)\n result.extend(arr)\n return result\n\n def query_product(query: List[int], big_nums: List[int]) -> int:\n from_i, to_i, mod_i = query\n product = 1\n for i in range(from_i, to_i + 1):\n product = (product * big_nums[i]) % mod_i\n return product\n\n big_nums = concatenate_arrays(100000)\n answer = []\n for query in queries:\n answer.append(query_product(query, big_nums))\n return answer", "class Solution:\n def findProductsOfElements(self, queries: List[List[int]]) -> List[int]:\n answer = []\n big_nums = [1]\n i = 0\n\n while True:\n powerful_array = []\n x = i\n while x > 0:\n if x % 2 == 1:\n powerful_array.append(1)\n else:\n powerful_array.append(2)\n x //= 2\n big_nums += powerful_array\n i += 1\n if i == 16:\n break\n\n for query in queries:\n from_, to_, mod_ = query\n product = 1\n for j in range(int(from_), int(to_) + 1):\n product = (product * big_nums[j]) % mod_\n answer.append(product)\n\n return answer", "class Solution:\n def findProductsOfElements(self, queries: List[List[int]]) -> List[int]:\n def powerful_array(x: int) -> List[int]:\n arr = []\n while x > 0:\n arr.append(2 ** (len(arr) + 1))\n x -= 2 ** (len(arr))\n return arr\n\n def concatenate_arrays(arrays: List[List[int]]) -> List[int]:\n result = []\n for arr in arrays:\n result.extend(arr)\n return result\n\n def calculate_product(from_i: int, to_i: int, mod: int) -> int:\n product = 1\n for i in range(from_i, to_i + 1):\n product = (product * big_nums[i]) % mod\n return product % mod\n\n big_nums = concatenate_arrays([powerful_array(i) for i in range(1, 60)])\n answer = []\n for query in queries:\n from_i, to_i, mod_i = query\n answer.append(calculate_product(big_nums.index(from_i), big_nums.index(to_i), mod_i))\n return answer", "class Solution:\n def findProductsOfElements(self, queries: List[List[int]]) -> List[int]:\n def get_powerful_array_sum(x: int) -> int:\n powerful_array = []\n while x > 0:\n powerful_array.append(2 ** (len(powerful_array) + 1))\n x -= 2 ** (len(powerful_array) - 1)\n return sum(powerful_array)\n\n def query_product(from_: int, to_: int, mod: int) -> int:\n product = 1\n i = from_\n while i <= to_:\n product = (product * (get_powerful_array_sum(i) % mod)) % mod\n i += 1\n return product\n\n answer = []\n for query in queries:\n from_, to_, mod_ = query\n answer.append(query_product(from_, to_, mod_))\n\n return answer", "class Solution:\n def findProductsOfElements(self, queries: List[List[int]]) -> List[int]:\n def powerful_array(x: int) -> List[int]:\n arr = []\n i = 0\n while x > 0:\n if x % 2 == 1:\n arr.append(2 ** i)\n i += 1\n x //= 2\n return arr\n\n def concatenate_arrays(arrays: List[List[int]]) -> List[int]:\n result = []\n for arr in arrays:\n result.extend(arr)\n return result\n\n def calculate_product(query: List[int], mod: int) -> int:\n product = 1\n for i in range(query[0], query[1] + 1):\n product *= big_nums[i]\n product %= mod\n return product % mod\n\n big_nums = []\n n = 0\n while len(big_nums) < 1000000:\n arr = powerful_array(n)\n big_nums.extend(arr)\n n += 1\n\n big_nums_map = {i: num for i, num in enumerate(big_nums)}\n\n answers = []\n for query in queries:\n from_i, to_i, mod_i = query\n if from_i == to_i:\n answers.append(big_nums_map[from_i] % mod_i)\n else:\n answers.append(calculate_product(query, query[2]))\n\n return answers", "class Solution:\n def findProductsOfElements(self, queries: List[List[int]]) -> List[int]:\n def powerful_array(x: int) -> List[int]:\n arr = []\n i = 0\n while x > 0:\n if x % 2 == 1:\n arr.append(2**i)\n i += 1\n x //= 2\n return arr\n\n def concatenate_arrays(n: int) -> List[int]:\n all_arrays = []\n for i in range(1, n + 1):\n arr = powerful_array(i)\n all_arrays.extend(arr)\n return all_arrays\n\n def query_product(query: List[int], big_nums: List[int]) -> int:\n product = 1\n for i in range(query[0], query[1] + 1):\n product = (product * big_nums[i]) % query[2]\n return product\n\n big_nums = concatenate_arrays(10**15)\n answer = []\n for query in queries:\n answer.append(query_product(query, big_nums))\n return answer", "class Solution:\n def findProductsOfElements(self, queries: List[List[int]]) -> List[int]:\n def powerful_array(x: int) -> List[int]:\n arr = []\n while x > 0:\n if x % 2 == 0:\n arr.append(2)\n x //= 2\n else:\n arr.append(1)\n x -= 1\n return arr\n\n def concatenate_arrays(arrays: List[List[int]]) -> List[int]:\n result = []\n for arr in arrays:\n result.extend(arr)\n return result\n\n def calculate_product(from_i: int, to_i: int, mod_i: int) -> int:\n product = 1\n for i in range(from_i, to_i + 1):\n product *= big_nums[i]\n product %= mod_i\n return product % mod_i\n\n big_nums = []\n n = int(1e15)\n for i in range(1, n + 1):\n arr = powerful_array(i)\n big_nums.extend(arr)\n\n answer = []\n for query in queries:\n from_i, to_i, mod_i = query\n answer.append(calculate_product(from_i, to_i, mod_i))\n\n return answer", "class Solution:\n def findProductsOfElements(self, queries: List[List[int]]) -> List[int]:\n def powerful_array(x: int) -> List[int]:\n arr = []\n while x > 0:\n if x % 2 == 1:\n arr.append(1)\n else:\n arr.append(2)\n x //= 2\n if x >= 2:\n arr.append(2 ** (x - 1))\n return arr\n\n def concatenate_arrays(n: int) -> List[int]:\n arr = []\n for i in range(1, int(n ** (1/2)) + 1):\n arr.extend(powerful_array(i))\n if n == 1:\n return arr\n else:\n arr.extend(concatenate_arrays(n - int(n ** (1/2))))\n return arr\n\n def query_product(query: List[int], big_nums: List[int]) -> int:\n product = 1\n for i in range(query[0], query[1] + 1):\n product = (product * big_nums[i]) % query[2]\n return product\n\n big_nums = concatenate_arrays(10**16)\n answer = []\n for query in queries:\n answer.append(query_product(query, big_nums))\n return answer" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def findPermutationDifference(self, s: str, t: str) -> int:\n s_index_map = {char: index for index, char in enumerate(s)}\n t_index_map = {char: index for index, char in enumerate(t)}\n\n diff = 0\n for char in s:\n diff += abs(s_index_map[char] - t_index_map[char])\n\n return diff", "class Solution:\n def findPermutationDifference(self, s: str, t: str) -> int:\n s_dict = {}\n t_dict = {}\n \n for i, char in enumerate(s):\n s_dict[char] = i\n \n for i, char in enumerate(t):\n t_dict[char] = i\n \n diff = 0\n for char in s:\n diff += abs(s_dict[char] - t_dict[char])\n \n return diff", "class Solution:\n def findPermutationDifference(self, s: str, t: str) -> int:\n s_dict = {}\n t_dict = {}\n \n for i, char in enumerate(s):\n s_dict[char] = i\n \n for i, char in enumerate(t):\n t_dict[char] = i\n \n diff = 0\n for char in s:\n diff += abs(s_dict[char] - t_dict[char])\n \n return diff", "class Solution:\n def findPermutationDifference(self, s: str, t: str) -> int:\n s_dict = {}\n t_dict = {}\n \n for i, char in enumerate(s):\n s_dict[char] = i\n \n for i, char in enumerate(t):\n t_dict[char] = i\n \n diff = 0\n for char in s:\n diff += abs(s_dict[char] - t_dict[char])\n \n return diff", "class Solution:\n def findPermutationDifference(self, s: str, t: str) -> int:\n s_dict = {}\n t_dict = {}\n \n for i, char in enumerate(s):\n s_dict[char] = i\n \n for i, char in enumerate(t):\n t_dict[char] = i\n \n diff = 0\n for char in s:\n diff += abs(s_dict[char] - t_dict[char])\n \n return diff", "class Solution:\n def findPermutationDifference(self, s: str, t: str) -> int:\n s_dict = {}\n t_dict = {}\n \n for i, char in enumerate(s):\n s_dict[char] = i\n \n for i, char in enumerate(t):\n t_dict[char] = i\n \n diff = 0\n for char in s:\n diff += abs(s_dict[char] - t_dict[char])\n \n return diff", "class Solution:\n def findPermutationDifference(self, s: str, t: str) -> int:\n s_dict = {}\n t_dict = {}\n \n for i, char in enumerate(s):\n s_dict[char] = i\n \n for i, char in enumerate(t):\n t_dict[char] = i\n \n diff = 0\n for char in s:\n diff += abs(s_dict[char] - t_dict[char])\n \n return diff", "class Solution:\n def findPermutationDifference(self, s: str, t: str) -> int:\n s_index_map = {char: index for index, char in enumerate(s)}\n t_index_map = {char: index for index, char in enumerate(t)}\n\n diff_sum = 0\n for char in s:\n diff_sum += abs(s_index_map[char] - t_index_map[char])\n\n return diff_sum", "class Solution:\n def findPermutationDifference(self, s: str, t: str) -> int:\n s_dict = {}\n t_dict = {}\n \n for i, char in enumerate(s):\n s_dict[char] = i\n \n for i, char in enumerate(t):\n t_dict[char] = i\n \n diff = 0\n for char in s:\n diff += abs(s_dict[char] - t_dict[char])\n \n return diff", "class Solution:\n def findPermutationDifference(self, s: str, t: str) -> int:\n s_dict = {}\n t_dict = {}\n \n for i, char in enumerate(s):\n s_dict[char] = i\n \n for i, char in enumerate(t):\n t_dict[char] = i\n \n diff = 0\n for char in s:\n diff += abs(s_dict[char] - t_dict[char])\n \n return diff" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def waysToReachStair(self, k: int) -> int:\n # Initialize a list to store the number of ways to reach each stair\n dp = [0] * (k + 1)\n dp[0], dp[1] = 2, 1\n\n # Calculate the number of ways to reach each stair\n for i in range(2, k + 1):\n dp[i] = dp[i - 1] + dp[max(0, i - (1 << (jump := 0))) - 1]\n\n # Return the number of ways to reach stair k\n return dp[k]", "class Solution:\n def waysToReachStair(self, k: int) -> int:\n # Initialize a list to store the number of ways to reach each stair\n dp = [0] * (k + 1)\n dp[0], dp[1] = 2, 1\n\n # Use dynamic programming to calculate the number of ways to reach each stair\n for i in range(2, k + 1):\n dp[i] = dp[i - 1] + dp[max(0, i - (1 << (jump := 0))) - 1]\n\n # Return the number of ways to reach stair k\n return dp[k]", "class Solution:\n def waysToReachStair(self, k: int) -> int:\n if k == 0:\n return 1\n dp = [0] * (k + 1)\n dp[0], dp[1] = 1, 2\n for i in range(2, k + 1):\n dp[i] = dp[i - 1] + dp[max(0, i - (1 << (i - 1)))];\n return dp[k]", "class Solution:\n def waysToReachStair(self, k: int) -> int:\n if k == 0:\n return 1\n if k < 0:\n return 0\n \n dp = [0] * (k + 1)\n dp[0] = 1\n dp[1] = 1\n \n for i in range(2, k + 1):\n dp[i] = dp[i - 1] + dp[max(0, i - 2 - (1 << (self.bitcount(i - 1))))]\n \n return dp[k]\n \n def bitcount(self, n):\n count = 0\n while n > 0:\n count += 1\n n //= 2\n return count", "class Solution:\n def waysToReachStair(self, k: int) -> int:\n if k == 0:\n return 1\n dp = [0] * (k + 1)\n dp[0], dp[1] = 1, 2\n for i in range(2, k + 1):\n dp[i] = dp[i - 1] + dp[max(0, i - (1 << (bin(i - 1).count(\"1\") - 1)))];\n return dp[k]", "class Solution:\n def waysToReachStair(self, k: int) -> int:\n # Initialize a list to store the number of ways to reach each stair\n dp = [0] * (k + 1)\n dp[0], dp[1] = 2, 1\n\n # Calculate the number of ways to reach each stair\n for i in range(2, k + 1):\n dp[i] = dp[i - 1] + dp[max(0, i - (1 << (self.bitCount(i - 1) - 1)))];\n\n return dp[k]\n\n def bitCount(self, n):\n # Count the number of 1 bits in the binary representation of n\n count = 0\n while n:\n count += n & 1\n n >>= 1\n return count", "class Solution:\n def waysToReachStair(self, k: int) -> int:\n # Initialize a list to store the number of ways to reach each stair\n dp = [0] * (k + 1)\n dp[0], dp[1] = 2, 1\n\n # We only need to calculate up to the square root of k, since 2^jump should be less than or equal to k\n for jump in range(int(k ** 0.5)):\n for i in range(jump + 1, k + 1):\n if i - (1 << jump) >= 0:\n dp[i] += dp[i - (1 << jump)]\n\n return dp[k]", "class Solution:\n def waysToReachStair(self, k: int) -> int:\n if k == 0:\n return 1\n if k < 0:\n return 0\n \n dp = [0] * (k + 1)\n dp[0] = 1\n dp[1] = 1\n \n for i in range(2, k + 1):\n dp[i] = dp[i - 1] + dp[max(0, i - 2 - (1 << (max(0, int(math.log2(i - 2))))))]\n \n return dp[k]", "class Solution:\n def waysToReachStair(self, k: int) -> int:\n # Initialize a list to store the number of ways to reach each stair\n dp = [0] * (k + 1)\n dp[0], dp[1] = 2, 1\n\n # Calculate the number of ways to reach each stair\n for i in range(2, k + 1):\n dp[i] = dp[i - 1] + dp[max(0, i - (1 << (jump := 0))) - 1]\n\n # Return the number of ways to reach stair k\n return dp[k]", "class Solution:\n def waysToReachStair(self, k: int) -> int:\n # Initialize a list to store the number of ways to reach each stair\n dp = [0] * (k + 1)\n dp[0], dp[1] = 2, 1\n\n # Use dynamic programming to find the number of ways to reach stair k\n for i in range(2, k + 1):\n dp[i] = dp[i - 1] + dp[max(0, i - (1 << (i - 1)))];\n\n return dp[k]" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def sumDigitDifferences(self, nums: List[int]) -> int:\n total_diff = 0\n num_digits = len(str(nums[0]))\n \n # Calculate the digit sums for each position across all numbers\n digit_sums = [0] * num_digits\n for num in nums:\n num_str = str(num)\n for i in range(num_digits):\n digit_sums[i] += int(num_str[i])\n \n # Calculate the digit differences\n for i in range(num_digits):\n digit_set = set()\n for num in nums:\n num_str = str(num)\n digit = int(num_str[i])\n if digit not in digit_set:\n total_diff += 1\n digit_set.add(digit)\n \n # Multiply the total differences by the number of pairs\n total_diff *= len(nums) * (len(nums) - 1) // 2\n \n return total_diff", "class Solution:\n def sumDigitDifferences(self, nums: List[int]) -> int:\n total_diff = 0\n num_digits = len(str(nums[0]))\n \n # Calculate the digit sums for each position\n digit_sums = [0] * num_digits\n for num in nums:\n num_str = str(num)\n for i in range(num_digits):\n digit_sums[i] += int(num_str[i])\n \n # Calculate the sum of digit differences\n for i in range(num_digits):\n digit_count = [0] * 10\n for num in nums:\n digit_count[int(num[i])] += 1\n total_diff += sum(\n [abs(digit_sums[i] - (digit_count[j] * j)) for j in range(10)]\n )\n \n return total_diff", "class Solution:\n def sumDigitDifferences(self, nums: List[int]) -> int:\n total_sum = 0\n num_digits = len(str(nums[0]))\n \n # Calculate the digit sums for each integer in the input list\n digit_sums = [sum(map(int, str(num))) for num in nums]\n \n # Calculate the average of the digit sums\n avg_sum = sum(digit_sums) // len(nums)\n \n # Calculate the sum of digit differences\n for num in nums:\n total_sum += abs(sum(map(int, str(num))) - avg_sum) * num_digits\n \n return total_sum // 2", "class Solution:\n def sumDigitDifferences(self, nums: List[int]) -> int:\n total_diff = 0\n num_digits = len(str(nums[0]))\n \n # Calculate the digit sums for each position across all numbers\n digit_sums = [0] * num_digits\n for num in nums:\n num_str = str(num)\n for i in range(num_digits):\n digit_sums[i] += int(num_str[i])\n \n # Calculate the digit differences\n for i in range(num_digits):\n digit_count = sum([int(num[i]) for num in nums])\n total_diff += digit_sums[i] * (len(nums) - digit_count)\n \n return total_diff", "class Solution:\n def sumDigitDifferences(self, nums: List[int]) -> int:\n total_sum = 0\n num_digits = len(str(nums[0]))\n \n # Calculate the digit sums for each position\n digit_sums = [0] * num_digits\n for num in nums:\n num_str = str(num)\n for i in range(num_digits):\n digit_sums[i] += int(num_str[i])\n \n # Calculate the sum of digit differences\n for i in range(num_digits):\n digit_count = [0] * 10\n for num in nums:\n num_str = str(num)\n digit_count[int(num_str[i])] += 1\n total_sum += sum(\n [abs(digit_count[j] - digit_sums[i]) * j for j in range(10)]\n )\n \n return total_sum", "class Solution:\n def sumDigitDifferences(self, nums: List[int]) -> int:\n total_diff = 0\n num_digits = len(str(nums[0]))\n \n # Calculate the digit sums for each position across all numbers\n digit_sums = [0] * num_digits\n for num in nums:\n num_str = str(num)\n for i in range(num_digits):\n digit_sums[i] += int(num_str[i])\n \n # Calculate the sum of digit differences for each position\n for i in range(num_digits):\n digit_count = [0] * 10\n for num in nums:\n digit_count[int(num_str[i])] += 1\n total_diff += sum(abs(digit_count[j] - digit_sums[i] / len(nums)) for j in range(10))\n \n return total_diff", "class Solution:\n def sumDigitDifferences(self, nums: List[int]) -> int:\n total_diff = 0\n num_digits = len(str(nums[0]))\n \n # Calculate the digit sums for each position across all numbers\n digit_sums = [0] * num_digits\n for num in nums:\n num_str = str(num)\n for i in range(num_digits):\n digit_sums[i] += int(num_str[i])\n \n # Calculate the sum of digit differences for each position\n for i in range(num_digits):\n digit_set = set()\n for num in nums:\n digit_str = str(num)[i]\n if digit_str not in digit_set:\n total_diff += 1\n digit_set.add(digit_str)\n \n return total_diff * len(nums)", "class Solution:\n def sumDigitDifferences(self, nums: List[int]) -> int:\n total_diff = 0\n num_digits = len(str(nums[0]))\n\n # Calculate the digit sums for each position across all numbers\n digit_sums = [0] * num_digits\n for num in nums:\n num_str = str(num)\n for i in range(num_digits):\n digit_sums[i] += int(num_str[i])\n\n # Calculate the digit differences\n for i in range(num_digits):\n digit_count = sum(int(digit) for digit in str(digit_sums[i]))\n total_diff += digit_count * (len(nums) - digit_count)\n\n return total_diff", "class Solution:\n def sumDigitDifferences(self, nums: List[int]) -> int:\n total_diff = 0\n num_digits = len(str(nums[0]))\n \n # Calculate the digit sums for each position\n digit_sums = [0] * num_digits\n for num in nums:\n num_str = str(num)\n for i in range(num_digits):\n digit_sums[i] += int(num_str[i])\n \n # Calculate the sum of digit differences\n for i in range(num_digits):\n digit_count = [0] * 10\n for num in nums:\n num_str = str(num)\n digit_count[int(num_str[i])] += 1\n total_diff += sum(abs(digit_count[j] - digit_sums[i]) for j in range(10)) // 2\n \n return total_diff", "class Solution:\n def sumDigitDifferences(self, nums: List[int]) -> int:\n total_diff = 0\n num_digits = len(str(nums[0]))\n\n # Calculate the digit sums for each position across all numbers\n digit_sums = [0] * num_digits\n for num in nums:\n num_str = str(num)\n for i in range(num_digits):\n digit_sums[i] += int(num_str[i])\n\n # Calculate the digit differences\n for i in range(num_digits):\n digit_count = sum(int(digit) for digit in str(digit_sums[i]))\n total_diff += digit_count * (len(nums) - digit_count)\n\n return total_diff" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def occurrencesAfterSorting(self, nums: List[int], queries: List[int], x: int) -> List[int]:\n def find_occurrences(target, occurrences):\n count = 0\n for i, num in enumerate(nums):\n if num == target:\n count += 1\n if count == occurrences:\n return i\n return -1\n\n answer = []\n for query in queries:\n index = find_occurrences(x, query)\n answer.append(index)\n\n return answer", "class Solution:\n def occurrencesAfterSorting(self, nums: List[int], queries: List[int], x: int) -> List[int]:\n def find_occurrences(arr, target, occur_count):\n count = 0\n index = -1\n for i in range(len(arr)):\n if arr[i] == target:\n count += 1\n if count == occur_count:\n index = i\n break\n return index\n\n nums.sort()\n answer = []\n for query in queries:\n index = find_occurrences(nums, x, query)\n answer.append(index)\n\n return answer", "class Solution:\n def occurrencesAfterSorting(self, nums: List[int], queries: List[int], x: int) -> List[int]:\n def find_occurrences(target, count):\n idx = -1\n for i in range(len(nums)):\n if nums[i] == target:\n idx = i\n count -= 1\n if count == 0:\n return idx\n return -1\n\n nums.sort()\n answer = []\n for query in queries:\n index = find_occurrences(x, query)\n answer.append(index)\n\n return answer", "class Solution:\n def occurrencesAfterSorting(self, nums: List[int], queries: List[int], x: int) -> List[int]:\n def find_occurrences(arr, target, occur_count):\n count = 0\n index = -1\n for i in range(len(arr)):\n if arr[i] == target:\n count += 1\n if count == occur_count:\n index = i\n break\n return index\n\n nums.sort()\n answer = []\n for query in queries:\n index = find_occurrences(nums, x, query)\n answer.append(index)\n return answer", "class Solution:\n def occurrencesAfterSorting(self, nums: List[int], queries: List[int], x: int) -> List[int]:\n def find_occurrence(target: int):\n left, right = 0, len(nums) - 1\n while left <= right:\n mid = left + (right - left) // 2\n if nums[mid] == x and (mid == 0 or nums[mid - 1] != x):\n return mid\n if nums[mid] < x:\n left = mid + 1\n else:\n right = mid - 1\n return -1\n\n nums.sort()\n answer = []\n for query in queries:\n index = find_occurrence(query - 1)\n answer.append(index) if index != -1 else answer.append(-1)\n return answer", "class Solution:\n def occurrencesAfterSorting(self, nums: List[int], queries: List[int], x: int) -> List[int]:\n def find_occurrences(target, num):\n count = 0\n for n in num:\n if n == target:\n count += 1\n if count == target:\n return True\n return False\n\n nums.sort()\n answer = []\n for query in queries:\n index = find_occurrences(query, nums, x)\n answer.append(index)\n return answer", "class Solution:\n def occurrencesAfterSorting(self, nums: List[int], queries: List[int], x: int) -> List[int]:\n def find_occurrences(target, occurrences):\n count = 0\n for i, num in enumerate(nums):\n if num == target:\n count += 1\n if count == occurrences:\n return i\n return -1\n\n answer = []\n for query in queries:\n index = find_occurrences(x, query)\n answer.append(index)\n\n return answer", "class Solution:\n def occurrencesAfterSorting(self, nums: List[int], queries: List[int], x: int) -> List[int]:\n def find_occurrences(target, occurrences):\n count = 0\n for i, num in enumerate(nums):\n if num == target:\n count += 1\n if count == occurrences:\n return i\n return -1\n\n nums.sort()\n answer = []\n for query in queries:\n index = find_occurrences(x, query)\n answer.append(index)\n\n return answer", "class Solution:\n def occurrencesAfterSorting(self, nums: List[int], queries: List[int], x: int) -> List[int]:\n def find_occurrences(arr, target, occur_count):\n occurrences = []\n count = 0\n index = 0\n while count < len(arr):\n if arr[count] == target:\n if count == occur_count - 1:\n occurrences.append(index)\n return occurrences\n else:\n count += 1\n index += 1\n else:\n count += 1\n index += 1\n return occurrences\n\n answer = []\n for query in queries:\n occur_count = query + 1\n occurrences = find_occurrences(nums, x, occur_count)\n if occurrences:\n answer.append(occurrences[-1])\n else:\n answer.append(-1)\n\n return answer", "class Solution:\n def occurrencesAfterSorting(self, nums: List[int], queries: List[int], x: int) -> List[int]:\n def find_occurrences(target, occurrences):\n count = 0\n for i, num in enumerate(nums):\n if num == target:\n count += 1\n if count == occurrences:\n return i\n return -1\n\n answer = []\n for query in queries:\n index = find_occurrences(x, query)\n answer.append(index)\n\n return answer" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def maximumSumSubsequence(self, nums: List[int], queries: List[List[int]]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 0\n for i in range(n):\n dp[i + 1] = max(dp[i], dp[i] + nums[i])\n\n def update(pos, x):\n dp[pos + 1] = max(dp[pos], dp[pos] + x)\n for i in range(pos + 2, len(dp)):\n dp[i] = max(dp[i - 1], dp[i] + nums[i - 1])\n\n def query(pos, x):\n ans = 0\n for i in range(pos + 1, len(dp)):\n ans = max(ans, dp[i])\n return ans\n\n res = 0\n for pos, x in queries:\n res = (res + query(pos, x)) % (10**9 + 7)\n update(pos, x)\n return res", "class Solution:\n def maximumSumSubsequence(self, nums: List[int], queries: List[List[int]]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 0\n for i in range(n):\n dp[i + 1] = max(dp[i], dp[i] + nums[i])\n\n def update(pos, x):\n dp[pos + 1] = max(dp[pos + 1], dp[pos] + x)\n\n def query(pos):\n return dp[pos + 1]\n\n ans = 0\n mod = 10**9 + 7\n for pos, x in queries:\n update(pos, x)\n ans += query(pos)\n ans %= mod\n\n return ans", "class Solution:\n def maximumSumSubsequence(self, nums: List[int], queries: List[List[int]]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 0\n for i in range(n):\n dp[i + 1] = max(dp[i], dp[i] + nums[i])\n\n def update(pos, x):\n dp[pos + 1] = max(dp[pos], dp[pos] + x)\n for i in range(pos + 1, n):\n dp[i + 1] = max(dp[i], dp[i] + x)\n\n ans = 0\n for pos, x in queries:\n update(pos, x)\n ans += dp[n]\n ans %= 1000000007\n return ans", "class Solution:\n def maximumSumSubsequence(self, nums: List[int], queries: List[List[int]]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 0\n for i in range(n):\n dp[i + 1] = max(dp[i], dp[i] + nums[i])\n\n def query(pos, x):\n dp[pos + 1] = max(dp[pos], dp[pos] + x)\n for i in range(pos + 2, n + 1):\n dp[i] = max(dp[i - 1], dp[i - 1] + nums[i - 1])\n return dp[n]\n\n ans = 0\n for query in queries:\n ans = (ans + query[1] + query(query[0], query[1])) % (10**9 + 7)\n\n return ans", "class Solution:\n def maximumSumSubsequence(self, nums: List[int], queries: List[List[int]]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 0\n\n for i in range(n):\n dp[i + 1] = max(dp[i], dp[i] + nums[i])\n\n ans = 0\n mod = 10**9 + 7\n\n for query in queries:\n pos, x = query\n dp[pos + 1] = max(dp[pos], dp[pos] + x)\n ans += dp[-1] - dp[pos]\n\n return ans % mod", "class Solution:\n def maximumSumSubsequence(self, nums: List[int], queries: List[List[int]]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 0\n for i in range(n):\n dp[i + 1] = max(dp[i], dp[i] + nums[i])\n\n def update(pos, x):\n dp[pos + 1] = max(dp[pos + 1], dp[pos] + x)\n\n def query(pos):\n return dp[pos + 1]\n\n ans = 0\n mod = int(1e9 + 7)\n for pos, x in queries:\n update(pos, x)\n ans += query(pos)\n ans %= mod\n\n return ans", "class Solution:\n def maximumSumSubsequence(self, nums: List[int], queries: List[List[int]]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 0\n for i in range(n):\n dp[i + 1] = max(dp[i], dp[i] + nums[i])\n\n def update(pos, x):\n dp[pos + 1] = max(dp[pos], dp[pos] + x)\n for i in range(pos + 2, len(dp)):\n dp[i] = max(dp[i - 1], dp[i - 1] + x)\n\n ans = 0\n for pos, x in queries:\n update(pos, x)\n ans += dp[-1] % (10**9 + 7)\n ans %= 10**9 + 7\n return ans", "class Solution:\n def maximumSumSubsequence(self, nums: List[int], queries: List[List[int]]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 0\n for i in range(n):\n dp[i + 1] = max(dp[i], dp[i] + nums[i])\n\n def update(pos, x):\n dp[pos + 1] = max(dp[pos + 1], dp[pos] + x)\n\n def query(pos):\n return dp[pos + 1]\n\n ans = 0\n mod = 10**9 + 7\n for pos, x in queries:\n update(pos, x)\n ans += query(pos)\n ans %= mod\n\n return ans", "class Solution:\n def maximumSumSubsequence(self, nums: List[int], queries: List[List[int]]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 0\n for i in range(n):\n dp[i + 1] = max(dp[i], dp[i] + nums[i])\n\n def update(pos, x):\n dp[pos + 1] = max(dp[pos + 1], dp[pos] + x)\n\n def query(pos):\n return dp[pos + 1]\n\n res = 0\n mod = int(1e9 + 7)\n for pos, x in queries:\n update(pos, x)\n res = (res + query(pos)) % mod\n return res", "class Solution:\n def maximumSumSubsequence(self, nums: List[int], queries: List[List[int]]) -> int:\n n = len(nums)\n dp = [0] * (n + 1)\n dp[0] = 0\n for i in range(n):\n dp[i + 1] = max(dp[i], dp[i] + nums[i])\n\n def query(pos, x):\n dp[pos + 1] = max(dp[pos], dp[pos] + x)\n for i in range(pos + 2, n + 1):\n dp[i] = max(dp[i - 1], dp[i] + nums[i - 1])\n return dp[n]\n\n ans = 0\n for query in queries:\n ans = (ans + query(query[0], query[1])) % (10**9 + 7)\n return ans" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def duplicateNumbersXOR(self, nums: List[int]) -> int:\n xor_result = 0\n seen = set()\n \n for num in nums:\n if num in seen:\n xor_result ^= num\n else:\n seen.add(num)\n \n return xor_result", "class Solution:\n def duplicateNumbersXOR(self, nums: List[int]) -> int:\n xor_result = 0\n seen = set()\n\n for num in nums:\n if num in seen:\n xor_result ^= num\n else:\n seen.add(num)\n\n return xor_result", "class Solution:\n def duplicateNumbersXOR(self, nums: List[int]) -> int:\n xor_result = 0\n seen = set()\n \n for num in nums:\n if num in seen:\n xor_result ^= num\n else:\n seen.add(num)\n \n return xor_result", "class Solution:\n def duplicateNumbersXOR(self, nums: List[int]) -> int:\n xor_result = 0\n seen = set()\n\n for num in nums:\n if num in seen:\n xor_result ^= num\n else:\n seen.add(num)\n\n return xor_result", "class Solution:\n def duplicateNumbersXOR(self, nums: List[int]) -> int:\n xor_result = 0\n seen = set()\n \n for num in nums:\n if num in seen:\n xor_result ^= num\n else:\n seen.add(num)\n \n return xor_result", "class Solution:\n def duplicateNumbersXOR(self, nums: List[int]) -> int:\n result = 0\n for num in nums:\n # XOR the current number with the result\n result ^= num\n # Loop through the numbers again to find duplicates\n for num in nums:\n # XOR the current number with the result again\n result ^= num\n # If the result is zero, that means we've found a duplicate\n if result == 0:\n return num\n return result", "class Solution:\n def duplicateNumbersXOR(self, nums: List[int]) -> int:\n xor_result = 0\n num_set = set()\n\n for num in nums:\n if num in num_set:\n xor_result ^= num\n else:\n num_set.add(num)\n\n return xor_result", "class Solution:\n def duplicateNumbersXOR(self, nums: List[int]) -> int:\n xor_result = 0\n seen = set()\n\n for num in nums:\n if num in seen:\n xor_result ^= num\n else:\n seen.add(num)\n\n return xor_result", "class Solution:\n def duplicateNumbersXOR(self, nums: List[int]) -> int:\n xor_result = 0\n seen = set()\n \n for num in nums:\n if num in seen:\n xor_result ^= num\n else:\n seen.add(num)\n \n return xor_result", "class Solution:\n def duplicateNumbersXOR(self, nums: List[int]) -> int:\n count_map = {}\n xor_result = 0\n\n for num in nums:\n if num in count_map:\n count_map[num] += 1\n else:\n count_map[num] = 1\n\n for num, count in count_map.items():\n if count == 2:\n xor_result ^= num\n\n return xor_result" ], "pass1_list": [ true, true, true, true, true, false, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def isArraySpecial(self, nums: List[int]) -> bool:\n for i in range(len(nums) - 1):\n if nums[i] % 2 == nums[i + 1] % 2:\n return False\n return True", "class Solution:\n def isArraySpecial(self, nums: List[int]) -> bool:\n odd_count = 0\n for num in nums:\n if num % 2 == 1:\n odd_count += 1\n else:\n if odd_count == 0:\n return False\n odd_count = 0\n return odd_count == 0 or odd_count == 1", "class Solution:\n def isArraySpecial(self, nums: List[int]) -> bool:\n for i in range(len(nums) - 1):\n if nums[i] % 2 == nums[i + 1] % 2:\n return False\n return True", "class Solution:\n def isArraySpecial(self, nums: List[int]) -> bool:\n odd_count = 0\n for num in nums:\n if num % 2 == 1:\n odd_count += 1\n if odd_count > 1:\n return False\n return True", "class Solution:\n def isArraySpecial(self, nums: List[int]) -> bool:\n for i in range(len(nums) - 1):\n if nums[i] % 2 == nums[i + 1] % 2:\n return False\n return True", "class Solution:\n def isArraySpecial(self, nums: List[int]) -> bool:\n odd_count = 0\n for num in nums:\n if num % 2 == 1:\n odd_count += 1\n else:\n if odd_count == 0:\n return False\n odd_count = 0\n return odd_count == 0 or odd_count == 1", "class Solution:\n def isArraySpecial(self, nums: List[int]) -> bool:\n for i in range(len(nums) - 1):\n if nums[i] % 2 == nums[i + 1] % 2:\n return False\n return True", "class Solution:\n def isArraySpecial(self, nums: List[int]) -> bool:\n odd_count = 0\n for num in nums:\n if num % 2 == 1:\n odd_count += 1\n else:\n if odd_count == 0:\n return False\n odd_count = 0\n return odd_count == 0 or odd_count == 1", "class Solution:\n def isArraySpecial(self, nums: List[int]) -> bool:\n odd_count = 0\n for num in nums:\n if num % 2 == 1:\n odd_count += 1\n else:\n if odd_count == 0:\n return False\n odd_count = 0\n return odd_count == 0 or odd_count == 1", "class Solution:\n def isArraySpecial(self, nums: List[int]) -> bool:\n for i in range(len(nums) - 1):\n if nums[i] % 2 == nums[i + 1] % 2:\n return False\n return True" ], "pass1_list": [ true, false, true, false, true, false, true, false, false, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def numberOfPairs(self, nums1: List[int], nums2: List[int], k: int) -> int:\n count = 0\n for i in range(len(nums1)):\n for j in range(len(nums2)):\n if nums1[i] % (nums2[j] * k) == 0:\n count += 1\n return count", "class Solution:\n def numberOfPairs(self, nums1: List[int], nums2: List[int], k: int) -> int:\n count = 0\n for i in range(len(nums1)):\n for j in range(len(nums2)):\n if nums1[i] % (nums2[j] * k) == 0:\n count += 1\n return count", "class Solution:\n def numberOfPairs(self, nums1: List[int], nums2: List[int], k: int) -> int:\n count = 0\n for i in range(len(nums1)):\n for j in range(len(nums2)):\n if nums1[i] % (nums2[j] * k) == 0:\n count += 1\n return count", "class Solution:\n def numberOfPairs(self, nums1: List[int], nums2: List[int], k: int) -> int:\n count = 0\n for i in range(len(nums1)):\n for j in range(len(nums2)):\n if nums1[i] % (nums2[j] * k) == 0:\n count += 1\n return count", "class Solution:\n def numberOfPairs(self, nums1: List[int], nums2: List[int], k: int) -> int:\n count = 0\n for i in range(len(nums1)):\n for j in range(len(nums2)):\n if nums1[i] % (nums2[j] * k) == 0:\n count += 1\n return count", "class Solution:\n def numberOfPairs(self, nums1: List[int], nums2: List[int], k: int) -> int:\n count = 0\n for i in range(len(nums1)):\n for j in range(len(nums2)):\n if nums1[i] % (nums2[j] * k) == 0:\n count += 1\n return count", "class Solution:\n def numberOfPairs(self, nums1: List[int], nums2: List[int], k: int) -> int:\n count = 0\n for i in range(len(nums1)):\n for j in range(len(nums2)):\n if nums1[i] % (nums2[j] * k) == 0:\n count += 1\n return count", "class Solution:\n def numberOfPairs(self, nums1: List[int], nums2: List[int], k: int) -> int:\n count = 0\n for i in range(len(nums1)):\n for j in range(len(nums2)):\n if nums1[i] % (nums2[j] * k) == 0:\n count += 1\n return count", "class Solution:\n def numberOfPairs(self, nums1: List[int], nums2: List[int], k: int) -> int:\n count = 0\n for i in range(len(nums1)):\n for j in range(len(nums2)):\n if nums1[i] % (nums2[j] * k) == 0:\n count += 1\n return count", "class Solution:\n def numberOfPairs(self, nums1: List[int], nums2: List[int], k: int) -> int:\n count = 0\n for i in range(len(nums1)):\n for j in range(len(nums2)):\n if nums1[i] % (nums2[j] * k) == 0:\n count += 1\n return count" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "class Solution:\n def compressedString(self, word: str) -> str:\n comp = []\n i = 0\n\n while i < len(word):\n count = 1\n while i + 1 < len(word) and word[i] == word[i + 1]:\n i += 1\n count += 1\n\n comp.append(str(min(count, 9)))\n comp.append(word[i])\n i += 1\n\n return ''.join(comp)", "class Solution:\n def compressedString(self, word: str) -> str:\n comp = []\n i = 0\n\n while i < len(word):\n count = 1\n while i + 1 < len(word) and word[i] == word[i + 1]:\n i += 1\n count += 1\n\n comp.append(str(min(count, 9)))\n comp.append(word[i])\n i += 1\n\n return \"\".join(comp)", "class Solution:\n def compressedString(self, word: str) -> str:\n comp = []\n i = 0\n\n while i < len(word):\n count = 1\n repeat_char = word[i]\n\n while i + 1 < len(word) and word[i + 1] == repeat_char:\n i += 1\n count += 1\n\n comp.append(str(count))\n comp.append(repeat_char)\n i += 1\n\n return ''.join(comp)", "class Solution:\n def compressedString(self, word: str) -> str:\n comp = []\n i = 0\n\n while i < len(word):\n count = 1\n c = word[i]\n\n while i + 1 < len(word) and word[i + 1] == c:\n i += 1\n count += 1\n\n comp.append(str(count))\n comp.append(c)\n\n i += 1\n\n return \"\".join(comp)", "class Solution:\n def compressedString(self, word: str) -> str:\n comp = []\n i = 0\n\n while i < len(word):\n count = 1\n while i + 1 < len(word) and word[i] == word[i + 1]:\n i += 1\n count += 1\n\n comp.append(str(min(count, 9)))\n comp.append(word[i])\n i += 1\n\n return ''.join(comp)", "class Solution:\n def compressedString(self, word: str) -> str:\n comp = []\n i = 0\n \n while i < len(word):\n count = 1\n while i + 1 < len(word) and word[i] == word[i + 1]:\n i += 1\n count += 1\n \n comp.append(str(min(count, 9)))\n comp.append(word[i])\n i += 1\n \n return ''.join(comp)", "class Solution:\n def compressedString(self, word: str) -> str:\n comp = []\n i = 0\n\n while i < len(word):\n count = 1\n c = word[i]\n\n while i + 1 < len(word) and word[i + 1] == c:\n i += 1\n count += 1\n\n comp.append(str(count))\n comp.append(c)\n\n i += 1\n\n return \"\".join(comp)", "class Solution:\n def compressedString(self, word: str) -> str:\n comp = []\n i = 0\n\n while i < len(word):\n count = 1\n while i + 1 < len(word) and word[i] == word[i + 1]:\n i += 1\n count += 1\n\n comp.append(str(min(count, 9)))\n comp.append(word[i])\n i += 1\n\n return ''.join(comp)", "class Solution:\n def compressedString(self, word: str) -> str:\n comp = []\n i = 0\n\n while i < len(word):\n count = 1\n while i + 1 < len(word) and word[i] == word[i + 1]:\n i += 1\n count += 1\n\n comp.append(str(min(count, 9)))\n comp.append(word[i])\n i += 1\n\n return \"\".join(comp)", "class Solution:\n def compressedString(self, word: str) -> str:\n comp = []\n i = 0\n\n while i < len(word):\n count = 1\n while i + 1 < len(word) and word[i] == word[i + 1]:\n i += 1\n count += 1\n\n comp.append(str(count))\n comp.append(word[i])\n i += 1\n\n return \"\".join(comp)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ns = input()\nt = 0\na = 0\nfor i in range(n):\n if s[i] == \"T\":\n t += 1\n else:\n a += 1\nif t > a:\n print(\"T\")\nelif t < a:\n print(\"A\")\nelse:\n for i in range(n):\n if s[i] == \"T\":\n print(\"T\")\n break\n else:\n print(\"A\")", "n = int(input())\ns = input()\nt = s.count(\"T\")\na = s.count(\"A\")\nif t > a:\n print(\"T\")\nelif t < a:\n print(\"A\")\nelse:\n print(\"T\")", "n = int(input())\ns = input()\nt = s.count(\"T\")\na = s.count(\"A\")\nif t > a:\n print(\"T\")\nelif t < a:\n print(\"A\")\nelse:\n print(\"T\" if s[::-1].find(\"T\") < s[::-1].find(\"A\") else \"A\")", "n = int(input())\ns = input()\nt = s.count(\"T\")\na = s.count(\"A\")\nif t > a:\n print(\"T\")\nelif t < a:\n print(\"A\")\nelse:\n print(\"T\")", "n = int(input())\ns = input()\nt = s.count(\"T\")\na = s.count(\"A\")\nif t > a:\n print(\"T\")\nelif t < a:\n print(\"A\")\nelse:\n print(\"T\" if s[::-1].index(\"T\") < s[::-1].index(\"A\") else \"A\")", "n = int(input())\ns = input()\nt = s.count(\"T\")\na = s.count(\"A\")\nif t > a:\n print(\"T\")\nelif t < a:\n print(\"A\")\nelse:\n print(\"T\")", "n = int(input())\ns = input()\nt = s.count(\"T\")\na = s.count(\"A\")\nif t > a:\n print(\"T\")\nelif t < a:\n print(\"A\")\nelse:\n print(\"T\" if s[::-1].index(\"T\") < s[::-1].index(\"A\") else \"A\")", "n = int(input())\ns = input()\nt = s.count(\"T\")\na = s.count(\"A\")\nif t > a:\n print(\"T\")\nelif t < a:\n print(\"A\")\nelse:\n print(\"T\")", "n = int(input())\ns = input()\nt = s.count(\"T\")\na = s.count(\"A\")\nif t > a:\n print(\"T\")\nelif t < a:\n print(\"A\")\nelse:\n if s.find(\"T\") < s.find(\"A\"):\n print(\"T\")\n else:\n print(\"A\")", "n = int(input())\ns = input()\nt = s.count(\"T\")\na = s.count(\"A\")\nif t > a:\n print(\"T\")\nelif t < a:\n print(\"A\")\nelse:\n if s.index(\"T\") < s.index(\"A\"):\n print(\"T\")\n else:\n print(\"A\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = list(map(int, input().split()))\n\nwhile True:\n i = 0\n while i < n - 1 and abs(a[i] - a[i + 1]) == 1:\n i += 1\n if i == n - 1:\n break\n if a[i] < a[i + 1]:\n a = a[: i + 1] + list(range(a[i] + 1, a[i + 1])) + a[i + 1 :]\n else:\n a = a[: i + 1] + list(range(a[i], a[i + 1] - 1, -1)) + a[i + 1 :]\n\nprint(*a)", "n = int(input())\na = list(map(int, input().split()))\nwhile True:\n flag = False\n for i in range(n - 1):\n if abs(a[i] - a[i + 1]) != 1:\n if a[i] > a[i + 1]:\n a = a[:i + 1] + list(range(a[i], a[i + 1] - 1, -1)) + a[i + 1 :]\n else:\n a = a[:i + 1] + list(range(a[i] + 1, a[i + 1])) + a[i + 1 :]\n flag = True\n break\n if not flag:\n break\nprint(*a)", "n = int(input())\na = list(map(int, input().split()))\n\nwhile True:\n flag = 0\n for i in range(n - 1):\n if abs(a[i] - a[i + 1]) != 1:\n if a[i] > a[i + 1]:\n a = a[:i + 1] + list(range(a[i], a[i + 1] - 1, -1)) + a[i + 1 :]\n else:\n a = a[:i + 1] + list(range(a[i], a[i + 1])) + a[i + 1 :]\n flag = 1\n break\n if flag == 0:\n break\n\nfor i in a:\n print(i, end=\" \")", "n = int(input())\na = list(map(int, input().split()))\n\nwhile True:\n flag = 0\n for i in range(n - 1):\n if abs(a[i] - a[i + 1]) != 1:\n if a[i] > a[i + 1]:\n a = a[: i + 1] + list(range(a[i + 1] + 1, a[i] + 1)) + a[i + 1 :]\n else:\n a = a[: i + 1] + list(range(a[i] - 1, a[i + 1] - 1, -1)) + a[i + 1 :]\n flag = 1\n break\n if flag == 0:\n break\n\nfor i in a:\n print(i, end=\" \")", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nwhile True:\r\n flag = True\r\n for i in range(n - 1):\r\n if abs(a[i] - a[i + 1]) != 1:\r\n flag = False\r\n if a[i] < a[i + 1]:\r\n a = a[: i + 1] + list(range(a[i] + 1, a[i + 1])) + a[i + 1 :]\r\n else:\r\n a = a[: i + 1] + list(range(a[i] - 1, a[i + 1], -1)) + a[i + 1 :]\r\n break\r\n if flag:\r\n break\r\n\r\nprint(*a)\r", "n = int(input())\na = list(map(int, input().split()))\n\nwhile True:\n i = 0\n while i < n - 1 and abs(a[i] - a[i + 1]) == 1:\n i += 1\n if i == n - 1:\n break\n if a[i] > a[i + 1]:\n a = a[: i + 1] + list(range(a[i], a[i + 1] - 1, -1)) + a[i + 1 :]\n else:\n a = a[: i + 1] + list(range(a[i], a[i + 1] + 1)) + a[i + 1 :]\n\nprint(*a)", "n = int(input())\na = list(map(int, input().split()))\n\nwhile True:\n i = 0\n while i < n - 1 and abs(a[i] - a[i + 1]) == 1:\n i += 1\n if i == n - 1:\n break\n if a[i] < a[i + 1]:\n a = a[: i + 1] + list(range(a[i] + 1, a[i + 1])) + a[i + 1 :]\n else:\n a = a[: i + 1] + list(range(a[i], a[i + 1] - 1, -1)) + a[i + 1 :]\n\nprint(*a)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nwhile True:\r\n flag = True\r\n for i in range(n - 1):\r\n if abs(a[i] - a[i + 1]) != 1:\r\n flag = False\r\n if a[i] > a[i + 1]:\r\n a = a[: i + 1] + list(range(a[i], a[i + 1] - 1, -1)) + a[i + 1 :]\r\n else:\r\n a = a[: i + 1] + list(range(a[i], a[i + 1] + 1)) + a[i + 1 :]\r\n break\r\n if flag:\r\n break\r\n\r\nprint(*a)\r", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nwhile True:\r\n flag = True\r\n for i in range(n - 1):\r\n if abs(a[i] - a[i + 1]) != 1:\r\n flag = False\r\n if a[i] > a[i + 1]:\r\n a = a[: i + 1] + list(range(a[i], a[i + 1] - 1, -1)) + a[i + 1 :]\r\n else:\r\n a = a[: i + 1] + list(range(a[i], a[i + 1] + 1)) + a[i + 1 :]\r\n break\r\n if flag:\r\n break\r\n\r\nprint(*a)\r", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nwhile True:\r\n flag = True\r\n for i in range(n - 1):\r\n if abs(a[i] - a[i + 1]) != 1:\r\n flag = False\r\n if a[i] < a[i + 1]:\r\n a = a[: i + 1] + list(range(a[i] + 1, a[i + 1])) + a[i + 1 :]\r\n else:\r\n a = a[: i + 1] + list(range(a[i] - 1, a[i + 1], -1)) + a[i + 1 :]\r\n break\r\n if flag:\r\n break\r\n\r\nprint(*a)\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s = input()\r\nt = input()\r\n\r\ns = s.replace(\"@\", \"\")\r\nt = t.replace(\"@\", \"\")\r\n\r\nif sorted(s) == sorted(t):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r", "s = input()\r\nt = input()\r\n\r\ns = s.replace(\"@\", \"0\")\r\nt = t.replace(\"@\", \"0\")\r\n\r\nif sorted(s) == sorted(t):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r", "s = input()\r\nt = input()\r\n\r\ns_count = [0] * 26\r\nt_count = [0] * 26\r\n\r\nfor i in range(len(s)):\r\n if s[i] != \"@\":\r\n s_count[ord(s[i]) - ord(\"a\")] += 1\r\n if t[i] != \"@\":\r\n t_count[ord(t[i]) - ord(\"a\")] += 1\r\n\r\nfor i in range(len(s)):\r\n if s[i] == \"@\" and t[i] == \"@\":\r\n continue\r\n if s[i] == \"@\":\r\n if t_count[ord(t[i]) - ord(\"a\")] > 0:\r\n t_count[ord(t[i]) - ord(\"a\")] -= 1\r\n else:\r\n print(\"No\")\r\n exit()\r\n elif t[i] == \"@\":\r\n if s_count[ord(s[i]) - ord(\"a\")] > 0:\r\n s_count[ord(s[i]) - ord(\"a\")] -= 1\r\n else:\r\n print(\"No\")\r\n exit()\r\n elif s[i] != t[i]:\r\n print(\"No\")\r\n exit()\r\n\r\nprint(\"Yes\")\r", "s = input()\r\nt = input()\r\n\r\ns_list = list(s)\r\nt_list = list(t)\r\n\r\ns_count = s.count(\"@\")\r\nt_count = t.count(\"@\")\r\n\r\nif s_count != t_count:\r\n print(\"No\")\r\nelse:\r\n s_dict = {}\r\n t_dict = {}\r\n\r\n for i in range(len(s)):\r\n if s_list[i] == \"@\":\r\n if s_dict.get(t_list[i]) == None:\r\n s_dict[t_list[i]] = 1\r\n else:\r\n s_dict[t_list[i]] += 1\r\n elif t_list[i] == \"@\":\r\n if t_dict.get(s_list[i]) == None:\r\n t_dict[s_list[i]] = 1\r\n else:\r\n t_dict[s_list[i]] += 1\r\n elif s_list[i] != t_list[i]:\r\n print(\"No\")\r\n break\r\n\r\n else:\r\n for key in s_dict:\r\n if s_dict[key] > t_dict.get(key, 0):\r\n print(\"No\")\r\n break\r\n else:\r\n for key in t_dict:\r\n if t_dict[key] > s_dict.get(key, 0):\r\n print(\"No\")\r\n break\r\n else:\r\n print(\"Yes\")\r", "s = input()\r\nt = input()\r\n\r\ns = s.replace(\"@\", \"\")\r\nt = t.replace(\"@\", \"\")\r\n\r\ns = sorted(s)\r\nt = sorted(t)\r\n\r\nif s == t:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r", "s = input()\r\nt = input()\r\n\r\ns = list(s)\r\nt = list(t)\r\n\r\nfor i in range(len(s)):\r\n if s[i] == \"@\":\r\n s[i] = \"a\"\r\n if t[i] == \"@\":\r\n t[i] = \"a\"\r\n\r\ns.sort()\r\nt.sort()\r\n\r\nif s == t:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r", "s = input()\r\nt = input()\r\n\r\ns_count = [0] * 26\r\nt_count = [0] * 26\r\n\r\nfor i in range(len(s)):\r\n if s[i] == \"@\":\r\n s_count[ord(\"a\") - ord(\"a\")] += 1\r\n else:\r\n s_count[ord(s[i]) - ord(\"a\")] += 1\r\n\r\nfor i in range(len(t)):\r\n if t[i] == \"@\":\r\n t_count[ord(\"a\") - ord(\"a\")] += 1\r\n else:\r\n t_count[ord(t[i]) - ord(\"a\")] += 1\r\n\r\nfor i in range(26):\r\n if abs(s_count[i] - t_count[i]) > 1:\r\n print(\"No\")\r\n exit()\r\n\r\nprint(\"Yes\")\r", "s = input()\r\nt = input()\r\n\r\ns_list = list(s)\r\nt_list = list(t)\r\n\r\ns_count = s.count(\"@\")\r\nt_count = t.count(\"@\")\r\n\r\nif s_count != t_count:\r\n print(\"No\")\r\nelse:\r\n s_dict = {}\r\n t_dict = {}\r\n for i in range(len(s)):\r\n if s_list[i] == \"@\":\r\n if s[i] in s_dict:\r\n s_dict[s[i]] += 1\r\n else:\r\n s_dict[s[i]] = 1\r\n if t_list[i] == \"@\":\r\n if t[i] in t_dict:\r\n t_dict[t[i]] += 1\r\n else:\r\n t_dict[t[i]] = 1\r\n\r\n for key, value in s_dict.items():\r\n if key not in t_dict or t_dict[key] < value:\r\n print(\"No\")\r\n break\r\n else:\r\n print(\"Yes\")\r", "s = input()\r\nt = input()\r\n\r\ns = list(s)\r\nt = list(t)\r\n\r\nfor i in range(len(s)):\r\n if s[i] == \"@\" and t[i] == \"@\":\r\n s[i] = t[i] = \"a\"\r\n elif s[i] == \"@\":\r\n s[i] = \"a\"\r\n elif t[i] == \"@\":\r\n t[i] = \"a\"\r\n\r\ns = \"\".join(s)\r\nt = \"\".join(t)\r\n\r\nif s == t:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r", "s = input()\r\nt = input()\r\n\r\nif s == t:\r\n print(\"Yes\")\r\nelse:\r\n s_count = [0] * 26\r\n t_count = [0] * 26\r\n for i in range(len(s)):\r\n if s[i] != \"@\":\r\n s_count[ord(s[i]) - ord(\"a\")] += 1\r\n if t[i] != \"@\":\r\n t_count[ord(t[i]) - ord(\"a\")] += 1\r\n for i in range(len(s)):\r\n if s[i] == \"@\" and t[i] == \"@\":\r\n continue\r\n if s[i] == \"@\":\r\n if t_count[ord(t[i]) - ord(\"a\")] > 0:\r\n t_count[ord(t[i]) - ord(\"a\")] -= 1\r\n else:\r\n print(\"No\")\r\n break\r\n elif t[i] == \"@\":\r\n if s_count[ord(s[i]) - ord(\"a\")] > 0:\r\n s_count[ord(s[i]) - ord(\"a\")] -= 1\r\n else:\r\n print(\"No\")\r\n break\r\n elif s[i] != t[i]:\r\n print(\"No\")\r\n break\r\n else:\r\n print(\"Yes\")\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s = input()\nn = int(input())\nans = -1\nfor i in range(2 ** s.count(\"?\")):\n t = s\n j = 0\n for j in range(len(s)):\n if s[j] == \"?\":\n t = t[:j] + str(i % 2) + t[j + 1 :]\n i //= 2\n if int(t, 2) <= n:\n ans = max(ans, int(t, 2))\nprint(ans)", "s = input()\nn = int(input())\nans = -1\nfor i in range(2 ** s.count(\"?\")):\n t = s\n j = 0\n for k in range(len(t)):\n if t[k] == \"?\":\n t = t[:k] + str(i // 2 ** j % 2) + t[k + 1 :]\n j += 1\n if int(t, 2) <= n:\n ans = max(ans, int(t, 2))\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nS = input().strip()\nN = int(input())\n\nans = -1\n\nfor i in range(2 ** S.count(\"?\")):\n T = S\n j = 0\n for c in T:\n if c == \"?\":\n T = T[:j] + str(i % 2) + T[j + 1 :]\n j += 1\n i //= 2\n if int(T, 2) <= N:\n ans = max(ans, int(T, 2))\n\nprint(ans)", "s = input()\nn = int(input())\nans = -1\nfor i in range(2 ** s.count(\"?\")):\n x = s\n j = 0\n for k in range(len(s)):\n if s[k] == \"?\":\n x = x[:k] + str(i // 2**j % 2) + x[k + 1 :]\n j += 1\n if int(x, 2) <= n:\n ans = max(ans, int(x, 2))\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nS = input().strip()\nN = int(input())\n\nans = -1\n\nfor i in range(2 ** S.count(\"?\")):\n T = S[:]\n j = 0\n for j in range(len(S)):\n if S[j] == \"?\":\n T = T[:j] + str(i % 2) + T[j + 1 :]\n i //= 2\n if int(T, 2) <= N:\n ans = max(ans, int(T, 2))\n\nprint(ans)", "s = input()\nn = int(input())\n\nans = -1\nfor i in range(2 ** s.count(\"?\")):\n t = s\n j = 0\n for j in range(len(s)):\n if s[j] == \"?\":\n t = t[:j] + str(i % 2) + t[j + 1 :]\n i //= 2\n if int(t, 2) <= n:\n ans = max(ans, int(t, 2))\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nS = input().strip()\nN = int(input())\n\nans = -1\n\nfor i in range(2 ** S.count(\"?\")):\n T = S[:]\n for j in range(len(S)):\n if S[j] == \"?\":\n T = T[:j] + str((i >> (len(S) - j - 1) & 1)) + T[j + 1 :]\n if int(T, 2) <= N:\n ans = max(ans, int(T, 2))\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nS = input().strip()\nN = int(input())\n\nans = -1\n\nfor i in range(2 ** S.count(\"?\")):\n T = S\n j = 0\n for j in range(S.count(\"?\")):\n if T.count(\"?\") == 0:\n break\n T = T.replace(\"?\", str(i % 2), 1)\n i //= 2\n if int(T, 2) <= N:\n ans = max(ans, int(T, 2))\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nS = input().strip()\nN = int(input())\n\nans = -1\n\nfor i in range(2 ** S.count(\"?\")):\n T = S\n j = 0\n for j in range(T.count(\"?\")):\n if i >> j & 1:\n T = T.replace(\"?\", \"1\", 1)\n else:\n T = T.replace(\"?\", \"0\", 1)\n if int(T, 2) <= N:\n ans = max(ans, int(T, 2))\n\nprint(ans)", "s = input()\nn = int(input())\nans = -1\nfor i in range(2 ** s.count(\"?\")):\n t = s\n j = 0\n for k in range(len(s)):\n if s[k] == \"?\":\n t = t[:k] + str(i // 2**j % 2) + t[k + 1 :]\n j += 1\n if int(t, 2) <= n:\n ans = max(ans, int(t, 2))\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\nH, W, T = map(int, input().split())\ngrid = [input() for _ in range(H)]\nsy, sx, gy, gx = 0, 0, 0, 0\ncandy = 0\nfor i in range(H):\n for j in range(W):\n if grid[i][j] == 'S':\n sy, sx = i, j\n elif grid[i][j] == 'G':\n gy, gx = i, j\n elif grid[i][j] == 'o':\n candy += 1\n\ndx = [-1, 0, 1, 0]\ndy = [0, 1, 0, -1]\n\ndist = [[T + 1] * W for _ in range(H)]\ndist[sy][sx] = 0\nq = deque([(sy, sx)])\nwhile q:\n y, x = q.popleft()\n for i in range(4):\n ny, nx = y + dy[i], x + dx[i]\n if 0 <= ny < H and 0 <= nx < W:\n if grid[ny][nx] != '#' and dist[ny][nx] > dist[y][x] + 1:\n dist[ny][nx] = dist[y][x] + 1\n q.append((ny, nx))\n\nif dist[gy][gx] > T:\n print(-1)\nelse:\n ans = 0\n for i in range(H):\n for j in range(W):\n if grid[i][j] == 'o' and dist[i][j] + dist[gy][gx] - dist[i][j] <= T:\n ans = max(ans, dist[i][j])\n print(ans)", "from collections import deque\n\nH, W, T = map(int, input().split())\ngrid = [input() for _ in range(H)]\nsy, sx, gy, gx = 0, 0, 0, 0\ncandies = []\nfor i in range(H):\n for j in range(W):\n if grid[i][j] == \"S\":\n sy, sx = i, j\n elif grid[i][j] == \"G\":\n gy, gx = i, j\n elif grid[i][j] == \"o\":\n candies.append((i, j))\n\ndist = [[T + 1] * W for _ in range(H)]\ndist[sy][sx] = 0\nq = deque([(sy, sx)])\nwhile q:\n y, x = q.popleft()\n for dy, dx in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n ny, nx = y + dy, x + dx\n if 0 <= ny < H and 0 <= nx < W and grid[ny][nx] != \"#\":\n if dist[ny][nx] > dist[y][x] + 1:\n dist[ny][nx] = dist[y][x] + 1\n q.append((ny, nx))\n\nans = 0\nif dist[gy][gx] <= T:\n visited = [[False] * W for _ in range(H)]\n visited[gy][gx] = True\n q = deque([(gy, gx)])\n while q:\n y, x = q.popleft()\n for dy, dx in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n ny, nx = y + dy, x + dx\n if 0 <= ny < H and 0 <= nx < W and grid[ny][nx] != \"#\" and not visited[ny][nx]:\n if grid[ny][nx] == \"o\":\n ans += 1\n visited[ny][nx] = True\n q.append((ny, nx))\nprint(ans)", "from collections import deque\n\nH, W, T = map(int, input().split())\ngrid = []\nfor _ in range(H):\n grid.append(list(input()))\n\nstart = []\ngoal = []\ncandies = []\nfor i in range(H):\n for j in range(W):\n if grid[i][j] == \"S\":\n start = [i, j]\n elif grid[i][j] == \"G\":\n goal = [i, j]\n elif grid[i][j] == \"o\":\n candies.append([i, j])\n\ndist = [[-1] * W for _ in range(H)]\ndist[start[0]][start[1]] = 0\nq = deque([start])\nwhile q:\n y, x = q.popleft()\n for dy, dx in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n ny = y + dy\n nx = x + dx\n if 0 <= ny < H and 0 <= nx < W:\n if grid[ny][nx] != \"#\":\n if dist[ny][nx] == -1:\n dist[ny][nx] = dist[y][x] + 1\n q.append([ny, nx])\n\nif dist[goal[0]][goal[1]] > T:\n print(-1)\nelse:\n visited = set()\n cnt = 0\n for candy in candies:\n if dist[candy[0]][candy[1]] <= T and candy not in visited:\n cnt += 1\n visited.add(candy)\n print(cnt)", "from collections import deque\n\nH, W, T = map(int, input().split())\ngrid = [list(input()) for _ in range(H)]\nsy, sx, gy, gx = -1, -1, -1, -1\ncandies = []\nfor i in range(H):\n for j in range(W):\n if grid[i][j] == \"S\":\n sy, sx = i, j\n elif grid[i][j] == \"G\":\n gy, gx = i, j\n elif grid[i][j] == \"o\":\n candies.append((i, j))\n\ndx = [-1, 0, 1, 0]\ndy = [0, 1, 0, -1]\ndist = [[T + 1] * W for _ in range(H)]\ndist[sy][sx] = 0\nq = deque([(sy, sx)])\nwhile q:\n y, x = q.popleft()\n for i in range(4):\n ny, nx = y + dy[i], x + dx[i]\n if 0 <= ny < H and 0 <= nx < W and grid[ny][nx] != \"#\":\n if dist[ny][nx] > dist[y][x] + 1:\n dist[ny][nx] = dist[y][x] + 1\n q.append((ny, nx))\n\nans = 0\nif dist[gy][gx] <= T:\n for cy, cx in candies:\n if dist[cy][cx] < dist[gy][gx]:\n ans += 1\nprint(ans)", "from collections import deque\n\nh, w, t = map(int, input().split())\ngrid = [input() for _ in range(h)]\nsy, sx, gy, gx = 0, 0, 0, 0\ncandies = 0\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \"S\":\n sy, sx = i, j\n elif grid[i][j] == \"G\":\n gy, gx = i, j\n elif grid[i][j] == \"o\":\n candies += 1\n\ndist = [[-1] * w for _ in range(h)]\ndist[sy][sx] = 0\nq = deque([(sy, sx)])\nwhile q:\n y, x = q.popleft()\n for dy, dx in [(0, 1), (1, 0), (0, -1), (-1, 0)]:\n ny, nx = y + dy, x + dx\n if 0 <= ny < h and 0 <= nx < w and grid[ny][nx] != \"#\":\n if dist[ny][nx] == -1:\n dist[ny][nx] = dist[y][x] + 1\n q.append((ny, nx))\n\nans = -1\nif dist[gy][gx] <= t:\n ans = 0\n for i in range(h):\n for j in range(w):\n if dist[i][j] <= t and grid[i][j] == \"o\":\n ans += 1\nprint(ans)", "from collections import deque\n\nH, W, T = map(int, input().split())\ngrid = [input() for _ in range(H)]\nsy, sx, gy, gx = 0, 0, 0, 0\ncandy = 0\nfor i in range(H):\n for j in range(W):\n if grid[i][j] == \"S\":\n sy, sx = i, j\n elif grid[i][j] == \"G\":\n gy, gx = i, j\n elif grid[i][j] == \"o\":\n candy += 1\n\ndx = [-1, 0, 1, 0]\ndy = [0, 1, 0, -1]\ndist = [[T + 1] * W for _ in range(H)]\ndist[sy][sx] = 0\nq = deque([(sy, sx)])\nwhile q:\n y, x = q.popleft()\n for i in range(4):\n ny, nx = y + dy[i], x + dx[i]\n if 0 <= ny < H and 0 <= nx < W and grid[ny][nx] != \"#\":\n if dist[ny][nx] > dist[y][x] + 1:\n dist[ny][nx] = dist[y][x] + 1\n q.append((ny, nx))\n\nans = -1\nif dist[gy][gx] <= T:\n ans = 0\n for i in range(H):\n for j in range(W):\n if dist[i][j] <= T and grid[i][j] == \"o\":\n ans += 1\nprint(ans)", "from collections import deque\n\nH, W, T = map(int, input().split())\ngrid = [list(input()) for _ in range(H)]\nsy, sx, gy, gx = 0, 0, 0, 0\ncandy = 0\nfor i in range(H):\n for j in range(W):\n if grid[i][j] == 'S':\n sy, sx = i, j\n elif grid[i][j] == 'G':\n gy, gx = i, j\n elif grid[i][j] == 'o':\n candy += 1\n\nif T < abs(sy - gy) + abs(sx - gx):\n print(-1)\n exit()\n\nvisited = [[False] * W for _ in range(H)]\nvisited[sy][sx] = True\nq = deque([(sy, sx, 0, 0)])\nwhile q:\n y, x, d, c = q.popleft()\n if y == gy and x == gx:\n print(c)\n break\n for dy, dx in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\n ny, nx = y + dy, x + dx\n if 0 <= ny < H and 0 <= nx < W and grid[ny][nx] != '#' and not visited[ny][nx]:\n visited[ny][nx] = True\n if grid[ny][nx] == 'o':\n c += 1\n q.append((ny, nx, d + 1, c))", "from collections import deque\n\nh, w, t = map(int, input().split())\ngrid = [list(input()) for _ in range(h)]\nsy, sx, gy, gx = 0, 0, 0, 0\ncandies = []\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \"S\":\n sy, sx = i, j\n elif grid[i][j] == \"G\":\n gy, gx = i, j\n elif grid[i][j] == \"o\":\n candies.append((i, j))\n\ndist = [[t + 1] * w for _ in range(h)]\ndist[sy][sx] = 0\nq = deque([(sy, sx)])\nwhile q:\n y, x = q.popleft()\n for dy, dx in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n ny, nx = y + dy, x + dx\n if 0 <= ny < h and 0 <= nx < w and grid[ny][nx] != \"#\":\n if dist[ny][nx] > dist[y][x] + 1:\n dist[ny][nx] = dist[y][x] + 1\n q.append((ny, nx))\n\nif dist[gy][gx] > t:\n print(-1)\nelse:\n ans = 0\n for y, x in candies:\n if dist[y][x] < dist[gy][gx]:\n ans += 1\n print(ans)", "from collections import deque\n\nh, w, t = map(int, input().split())\ngrid = [input() for _ in range(h)]\nsy, sx, gy, gx = 0, 0, 0, 0\ncandies = []\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \"S\":\n sy, sx = i, j\n elif grid[i][j] == \"G\":\n gy, gx = i, j\n elif grid[i][j] == \"o\":\n candies.append((i, j))\n\nvisited = [[False] * w for _ in range(h)]\ndist = [[t + 1] * w for _ in range(h)]\ndist[sy][sx] = 0\nq = deque([(sy, sx)])\nwhile q:\n y, x = q.popleft()\n for dy, dx in [(0, 1), (1, 0), (0, -1), (-1, 0)]:\n ny, nx = y + dy, x + dx\n if 0 <= ny < h and 0 <= nx < w and grid[ny][nx] != \"#\":\n if dist[ny][nx] > dist[y][x] + 1:\n dist[ny][nx] = dist[y][x] + 1\n q.append((ny, nx))\n\nif dist[gy][gx] > t:\n print(-1)\nelse:\n ans = 0\n for y, x in candies:\n if dist[y][x] < dist[gy][gx]:\n ans += 1\n print(ans)", "from collections import deque\n\nH, W, T = map(int, input().split())\ngrid = [input() for _ in range(H)]\nsy, sx, gy, gx = 0, 0, 0, 0\ncandies = 0\nfor i in range(H):\n for j in range(W):\n if grid[i][j] == \"S\":\n sy, sx = i, j\n elif grid[i][j] == \"G\":\n gy, gx = i, j\n elif grid[i][j] == \"o\":\n candies += 1\n\nif candies > T:\n print(-1)\n exit()\n\nvisited = [[False] * W for _ in range(H)]\nq = deque([(sx, sy, 0, 0)])\nvisited[sy][sx] = True\nwhile q:\n x, y, d, c = q.popleft()\n if x == gx and y == gy:\n print(c)\n exit()\n for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n nx, ny = x + dx, y + dy\n if 0 <= ny < H and 0 <= nx < W:\n if not visited[ny][nx] and grid[ny][nx] != \"#\":\n if grid[ny][nx] == \"o\":\n c += 1\n q.append((nx, ny, d + 1, c))\n visited[ny][nx] = True\nprint(-1)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nS = input().strip()\nN = len(S)\n\nif N <= 3:\n print(52 ** N % mod)\n exit()\n\ndp = [[0] * 2 for _ in range(N + 1)]\ndp[0][0] = 1\n\nfor i in range(N):\n c = S[i]\n if c == \"?\":\n dp[i + 1][0] = (dp[i][0] + dp[i][1]) % mod\n dp[i + 1][1] = (dp[i][1] * 26) % mod\n elif c.isupper():\n dp[i + 1][0] = dp[i][0]\n dp[i + 1][1] = (dp[i][1] * 26 + dp[i][0]) % mod\n else:\n dp[i + 1][0] = dp[i][1]\n\nans = dp[N][0] + dp[N][1] * 26\nprint(ans % mod)", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nS = input().strip()\nN = len(S)\n\nif N == 4:\n if S in [\"AAAA\", \"A?AA\", \"A?aA\", \"A?a?\", \"??AA\", \"??aA\", \"??a?\", \"???A\", \"???a\"]:\n print(0)\n else:\n print(52**S.count(\"?\"))\n exit()\n\ndp = [[0] * 27 for _ in range(N + 1)]\ndp[0][0] = 1\n\nfor i in range(N):\n c = S[i]\n if c == \"?\":\n for j in range(26):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * 52) % mod\n elif c.isupper():\n for j in range(26):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod\n if j != ord(c) - ord(\"A\"):\n dp[i + 1][ord(c) - ord(\"A\")] = (\n dp[i + 1][ord(c) - ord(\"A\")] + dp[i][j]\n ) % mod\n else:\n for j in range(26):\n if j != ord(c) - ord(\"a\"):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod\n\nans = 0\nfor i in range(26):\n ans = (ans + dp[N][i]) % mod\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nS = input().strip()\nN = len(S)\n\nif N == 4:\n if S in [\"AAAA\", \"A?AA\", \"A??A\", \"A???\"]:\n print(26 * 26)\n elif S in [\"A?aA\", \"A??a\"]:\n print(26 * 25)\n elif S in [\"A?a?\", \"A??a?\", \"A?a??\"]:\n print(26 * 25 * 25)\n elif S in [\"A?Aa\", \"A??Aa\", \"A?A?a\"]:\n print(26 * 25 * 25 * 25)\n else:\n print(pow(52, S.count(\"?\"), mod))\n exit()\n\ndp = [[0] * 27 for _ in range(N + 1)]\ndp[0][0] = 1\nfor i in range(N):\n c = S[i]\n if c == \"?\":\n for j in range(26):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * 52) % mod\n elif c.isupper():\n for j in range(26):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod\n if j != ord(c) - 65:\n dp[i + 1][ord(c) - 65] = (dp[i + 1][ord(c) - 65] + dp[i][j]) % mod\n else:\n for j in range(26):\n if j != ord(c) - 97:\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod\n\nans = 0\nfor i in range(26):\n ans = (ans + dp[N][i]) % mod\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\n\nS = input().strip()\nN = len(S)\n\nif N == 4:\n if S[0] == S[1] and S[0].isupper() and S[2].islower() and S[3].isupper():\n print(0)\n else:\n print(52**S.count(\"?\"))\n exit()\n\ndp = [[0] * 2 for _ in range(N + 1)]\ndp[0][0] = 1\n\nfor i in range(N):\n if S[i] == \"?\":\n dp[i + 1][0] = (dp[i + 1][0] + 52 * dp[i][0]) % mod\n dp[i + 1][1] = (dp[i + 1][1] + 26 * dp[i][1]) % mod\n elif S[i].isupper():\n dp[i + 1][0] = (dp[i + 1][0] + dp[i][0]) % mod\n if i >= 1 and S[i - 1] == S[i]:\n dp[i + 1][1] = (dp[i + 1][1] + dp[i][1]) % mod\n else:\n dp[i + 1][1] = (dp[i + 1][1] + 26 * dp[i][1]) % mod\n else:\n dp[i + 1][0] = (dp[i + 1][0] + dp[i][0]) % mod\n dp[i + 1][1] = (dp[i + 1][1] + 26 * dp[i][1]) % mod\n\nprint((52**S.count(\"?\") * dp[N][0] + dp[N][1]) % mod)", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nS = input().strip()\nN = len(S)\n\nif N < 4:\n print(52 ** N % mod)\n exit()\n\ndp = [[0] * 26 for _ in range(N + 1)]\ndp[0][0] = 1\nfor i in range(N):\n c = S[i]\n if c == \"?\":\n for j in range(26):\n dp[i + 1][j] = (dp[i + 1][j] + 26 * dp[i][j]) % mod\n elif c.isupper():\n for j in range(26):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod\n dp[i + 1][ord(c) - 65] = (dp[i + 1][ord(c) - 65] + dp[i][j]) % mod\n else:\n for j in range(26):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod\n\nans = 0\nfor i in range(26):\n ans = (ans + dp[N][i]) % mod\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nS = input().strip()\nN = len(S)\n\nif N <= 3:\n print(52 ** N % mod)\n exit()\n\nINF = 10**18\ndp = [[INF] * 27 for _ in range(N + 1)]\ndp[0][0] = 1\n\nfor i in range(N):\n c = S[i]\n if c == \"?\":\n for j in range(26):\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] * 52 % mod)\n elif c.isupper():\n for j in range(26):\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] * 26 % mod)\n if j != ord(c) - ord(\"A\"):\n dp[i + 1][ord(c) - ord(\"A\")] = min(\n dp[i + 1][ord(c) - ord(\"A\")], dp[i][j] * 26 % mod\n )\n else:\n for j in range(26):\n if j != ord(c) - ord(\"a\"):\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] * 25 % mod)\n\nans = 0\nfor i in range(26):\n ans += dp[N][i]\n ans %= mod\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nS = input().strip()\nN = len(S)\n\nif N <= 3:\n print(52 ** N % mod)\n exit()\n\ndp = [[0] * 2 for _ in range(N + 1)]\ndp[0][0] = 1\nfor i in range(N):\n c = S[i]\n if c == \"?\":\n dp[i + 1][0] = (dp[i][0] + dp[i][1]) % mod\n dp[i + 1][1] = (dp[i][1] * 26) % mod\n elif c.isupper():\n dp[i + 1][0] = dp[i][0]\n dp[i + 1][1] = (dp[i][1] + dp[i][0] * 25) % mod\n else:\n dp[i + 1][0] = (dp[i][0] + dp[i][1] * 26) % mod\n dp[i + 1][1] = dp[i][1]\n\nans = 0\nfor i in range(26):\n for j in range(26):\n if i == j:\n continue\n for k in range(26):\n if k == i or k == j:\n continue\n ans = (ans + dp[N][0] * 26 + dp[N][1] - dp[N - 1][(ord(i) - 65) // 2] - dp[N - 2][(ord(j) - 65) // 2] - dp[N - 3][(ord(k) - 65) // 2]) % mod\n\nprint(ans % mod)", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\n\nS = input().strip()\nN = len(S)\n\nif N <= 3:\n print(52 ** N % mod)\n exit()\n\ndp = [[0] * (N + 1) for _ in range(N + 1)]\ndp[0][0] = 1\n\nfor i in range(N):\n c = S[i]\n if c == \"?\":\n for j in range(i, -1, -1):\n dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j] * 52) % mod\n elif c.isupper():\n for j in range(i, -1, -1):\n dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j] * 25) % mod\n else:\n for j in range(i, -1, -1):\n dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j] * 26) % mod\n\nans = 0\nfor i in range(N + 1):\n ans = (ans + dp[N][i]) % mod\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nS = input().strip()\nN = len(S)\n\nif N == 4:\n if S in [\"AAAA\", \"A?AA\", \"A?aA\", \"A?a?\", \"A?a?\"]:\n print(0)\n else:\n print(52**S.count(\"?\"))\n exit()\n\ndp = [[0] * 26 for _ in range(N + 1)]\ndp[0][0] = 1\nfor i in range(N):\n if S[i] == \"?\":\n for j in range(26):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * 52) % mod\n else:\n for j in range(26):\n if chr(ord(\"A\") + j) != S[i]:\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod\n else:\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * 25) % mod\n\nans = 0\nfor i in range(26):\n ans = (ans + dp[N][i]) % mod\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nS = input().strip()\nN = len(S)\n\nif N <= 3:\n print(52 ** N % mod)\n exit()\n\ndp = [[0] * 26 for _ in range(N + 1)]\ndp[0][0] = 1\n\nfor i in range(N):\n c = S[i]\n if c == \"?\":\n for j in range(26):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * 52) % mod\n elif c.isupper():\n for j in range(26):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod\n dp[i + 1][ord(c) - ord(\"A\")] = (dp[i + 1][ord(c) - ord(\"A\")] + dp[i][ord(c) - ord(\"A\")]) % mod\n else:\n for j in range(26):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * 25) % mod\n\nans = 0\nfor i in range(26):\n ans = (ans + dp[N][i]) % mod\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "a, b = map(int, input().split())\nprint((a + b - 1) // b)", "a, b = map(int, input().split())\nprint((a + b - 1) // b)", "a, b = map(int, input().split())\nprint((a + b - 1) // b)", "a, b = map(int, input().split())\nprint((a + b - 1) // b)", "a, b = map(int, input().split())\nprint((a + b - 1) // b)", "a, b = map(int, input().split())\nprint((a + b - 1) // b)", "a, b = map(int, input().split())\nprint((a + b - 1) // b)", "a, b = map(int, input().split())\nprint((a + b - 1) // b)", "a, b = map(int, input().split())\nprint((a + b - 1) // b)", "a, b = map(int, input().split())\nprint((a + b - 1) // b)" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nH, W = map(int, input().split())\nS = [input().rstrip() for _ in range(H)]\n\nfor i in range(H - 4):\n for j in range(W - 4):\n if S[i][j] == \"s\" and S[i][j + 1] == \"n\" and S[i][j + 2] == \"u\" and S[i + 1][j + 2] == \"k\" and S[i + 2][j + 2] == \"e\":\n for k in range(5):\n print(i + k, j + k)\n exit()\n if S[i][j] == \"s\" and S[i + 1][j] == \"n\" and S[i + 2][j] == \"u\" and S[i + 2][j + 1] == \"k\" and S[i + 2][j + 2] == \"e\":\n for k in range(5):\n print(i + k, j + k)\n exit()\n if S[i][j] == \"s\" and S[i + 1][j] == \"n\" and S[i + 2][j] == \"u\" and S[i + 2][j + 1] == \"k\" and S[i + 3][j + 1] == \"e\":\n for k in range(5):\n print(i + k, j + k - 1)\n exit()\n if S[i][j] == \"s\" and S[i + 1][j] == \"n\" and S[i + 1][j + 1] == \"u\" and S[i + 2][j + 1] == \"k\" and S[i + 3][j + 1] == \"e\":\n for k in range(5):\n print(i + k, j + k - 1)\n exit()\n if S[i][j] == \"s\" and S[i + 1][j] == \"n\" and S[i + 2][j] == \"u\" and S[i + 3][j] == \"k\" and S[i + 4][j] == \"e\":\n for k in range(5):\n print(i + k, j)\n exit()\n if S[i][j] == \"s\" and S[i + 1][j] == \"n\" and S[i + 2][j] == \"u\" and S[i + 3][j + 1] == \"k\" and S[i + 4][j + 1] == \"e\":\n for k in range(5):\n print(i + k, j + k - 1)\n exit()\n if S[i][j] == \"s\" and S[i + 1][j] == \"n\" and S[i + 2][j + 1] == \"u\" and S[i + 3][j + 1] == \"k\" and S[i + 4][j + 1] == \"e\":\n for k in range(5):\n print(i + k, j + k - 1)\n exit()\n if S[i][j] == \"s\" and S[i + 1][j + 1] == \"n\" and S[i + 2][j + 1] == \"u\" and S[i + 3][j + 1] == \"k\" and S[i + 4][j + 1] == \"e\":\n for k in range(5):\n print(i + k, j + k)\n exit()\n if S[i][j] == \"s\" and S[i + 1][j + 1] == \"n\" and S[i + 2][j + 1] == \"u\" and S[i + 3][j + 1] == \"k\" and S[i + 4][j + 2] == \"e\":\n for k in range(5):\n print(i + k, j + k)\n exit()\n if S[i][j] == \"s\" and S[i + 1][j + 1] == \"n\" and S[i + 2][j + 1] == \"u\" and S[i + 3][j + 2] == \"k\" and S[i + 4][j + 2] == \"e\":\n for k in range(5):\n print(i + k, j + k)\n exit()\n if S[i][j] == \"s\" and S[i + 1][j + 1] == \"n\" and S[i + 2][j + 2] == \"u\" and S[i + 3][j + 2] == \"k\" and S[i + 4][j + 2] == \"e\":\n for k in range(5):\n print(i + k, j + k)\n exit()\n if S[i][j] == \"s\" and S[i + 1][j + 2] == \"n\" and S[i + 2][j + 2] == \"u\" and S[i + 3][j + 2] == \"k\" and S[i + 4][j + 2] == \"e\":\n for k in range(5):\n print(i + k, j + k + 1)\n exit()", "", "def main():\n h, w = map(int, input().split())\n s = [input() for _ in range(h)]\n for i in range(h - 4):\n for j in range(w - 4):\n if s[i][j] == \"s\" and s[i][j + 1] == \"n\" and s[i][j + 2] == \"u\" and s[i][j + 3] == \"k\" and s[i][j + 4] == \"e\":\n for di in range(-1, 2):\n for dj in range(-1, 2):\n if di == 0 and dj == 0:\n continue\n ok = True\n for k in range(5):\n ni, nj = i + k * di, j + k * dj\n if ni < 0 or ni >= h or nj < 0 or nj >= w:\n ok = False\n break\n if k == 0:\n if s[ni][nj] != \"s\":\n ok = False\n break\n elif k == 1:\n if s[ni][nj] != \"n\":\n ok = False\n break\n elif k == 2:\n if s[ni][nj] != \"u\":\n ok = False\n break\n elif k == 3:\n if s[ni][nj] != \"k\":\n ok = False\n break\n else:\n if s[ni][nj] != \"e\":\n ok = False\n break\n if ok:\n for k in range(5):\n print(i + k * di + 1, j + k * dj + 1)\n return\n print(-1, -1)\n\n\nmain()", "h, w = map(int, input().split())\ns = [input() for _ in range(h)]\n\nfor i in range(h - 4):\n for j in range(w - 4):\n if s[i][j] == \"s\" and s[i][j + 1] == \"n\" and s[i][j + 2] == \"u\" and s[i][j + 3] == \"k\" and s[i][j + 4] == \"e\":\n print(i + 1, j + 1)\n print(i + 1, j + 2)\n print(i + 1, j + 3)\n print(i + 1, j + 4)\n print(i + 1, j + 5)\n exit()\n if s[i][j] == \"s\" and s[i + 1][j] == \"n\" and s[i + 2][j] == \"u\" and s[i + 3][j] == \"k\" and s[i + 4][j] == \"e\":\n print(i + 1, j + 1)\n print(i + 2, j + 1)\n print(i + 3, j + 1)\n print(i + 4, j + 1)\n print(i + 5, j + 1)\n exit()\n if s[i][j] == \"s\" and s[i + 1][j + 1] == \"n\" and s[i + 2][j + 2] == \"u\" and s[i + 3][j + 3] == \"k\" and s[i + 4][j + 4] == \"e\":\n print(i + 1, j + 1)\n print(i + 2, j + 2)\n print(i + 3, j + 3)\n print(i + 4, j + 4)\n print(i + 5, j + 5)\n exit()\n if s[i][j + 4] == \"s\" and s[i + 1][j + 3] == \"n\" and s[i + 2][j + 2] == \"u\" and s[i + 3][j + 1] == \"k\" and s[i + 4][j] == \"e\":\n print(i + 1, j + 5)\n print(i + 2, j + 4)\n print(i + 3, j + 3)\n print(i + 4, j + 2)\n print(i + 5, j + 1)\n exit()", "import sys\ninput = sys.stdin.readline\n\nH, W = map(int, input().split())\nS = [input().rstrip() for _ in range(H)]\n\nfor i in range(H - 4):\n for j in range(W - 4):\n if S[i][j] == 's' and S[i][j + 1] == 'n' and S[i][j + 2] == 'u' and S[i][j + 3] == 'k' and S[i][j + 4] == 'e':\n print(i + 1, j + 1)\n print(i + 1, j + 2)\n print(i + 1, j + 3)\n print(i + 1, j + 4)\n print(i + 1, j + 5)\n sys.exit()\n if S[i][j] == 's' and S[i + 1][j] == 'n' and S[i + 2][j] == 'u' and S[i + 3][j] == 'k' and S[i + 4][j] == 'e':\n print(i + 1, j + 1)\n print(i + 2, j + 1)\n print(i + 3, j + 1)\n print(i + 4, j + 1)\n print(i + 5, j + 1)\n sys.exit()\n if S[i][j] == 's' and S[i + 1][j + 1] == 'n' and S[i + 2][j + 2] == 'u' and S[i + 3][j + 3] == 'k' and S[i + 4][j + 4] == 'e':\n print(i + 1, j + 1)\n print(i + 2, j + 2)\n print(i + 3, j + 3)\n print(i + 4, j + 4)\n print(i + 5, j + 5)\n sys.exit()\n if S[i][j + 4] == 's' and S[i + 1][j + 3] == 'n' and S[i + 2][j + 2] == 'u' and S[i + 3][j + 1] == 'k' and S[i + 4][j] == 'e':\n print(i + 1, j + 4)\n print(i + 2, j + 3)\n print(i + 3, j + 2)\n print(i + 4, j + 1)\n print(i + 5, j + 1)\n sys.exit()\n if S[i + 4][j] == 's' and S[i + 3][j] == 'n' and S[i + 2][j] == 'u' and S[i + 1][j] == 'k' and S[i][j] == 'e':\n print(i + 4, j + 1)\n print(i + 3, j + 1)\n print(i + 2, j + 1)\n print(i + 1, j + 1)\n print(i, j + 1)\n sys.exit()\n if S[i + 4][j + 4] == 's' and S[i + 3][j + 3] == 'n' and S[i + 2][j + 2] == 'u' and S[i + 1][j + 1] == 'k' and S[i][j] == 'e':\n print(i + 4, j + 4)\n print(i + 3, j + 3)\n print(i + 2, j + 2)\n print(i + 1, j + 1)\n print(i, j)\n sys.exit()\n if S[i][j + 4] == 's' and S[i + 1][j + 3] == 'n' and S[i + 2][j + 2] == 'u' and S[i + 3][j + 1] == 'k' and S[i + 4][j] == 'e':\n print(i + 1, j + 4)\n print(i + 2, j + 3)\n print(i + 3, j + 2)\n print(i + 4, j + 1)\n print(i + 5, j)\n sys.exit()\n if S[i + 4][j + 4] == 's' and S[i + 3][j + 3] == 'n' and S[i + 2][j + 2] == 'u' and S[i + 1][j + 1] == 'k' and S[i][j] == 'e':\n print(i + 4, j + 4)\n print(i + 3, j + 3)\n print(i + 2, j + 2)\n print(i + 1, j + 1)\n print(i, j)", "h, w = map(int, input().split())\ns = [input() for _ in range(h)]\n\nfor i in range(h - 4):\n for j in range(w - 4):\n if s[i][j] == \"s\" and s[i][j + 1] == \"n\" and s[i + 1][j + 2] == \"u\" and s[i + 2][j + 3] == \"k\" and s[i + 3][j + 4] == \"e\":\n for x in range(5):\n print(i + x + 1, j + x + 1)\n exit()\n if s[i][j] == \"s\" and s[i + 1][j] == \"n\" and s[i + 2][j] == \"u\" and s[i + 3][j] == \"k\" and s[i + 4][j] == \"e\":\n for x in range(5):\n print(i + x, j + 1)\n exit()\n if s[i][j] == \"s\" and s[i + 1][j + 1] == \"n\" and s[i + 2][j + 2] == \"u\" and s[i + 3][j + 3] == \"k\" and s[i + 4][j + 4] == \"e\":\n for x in range(5):\n print(i + x, j + x)\n exit()\n if s[i][j + 4] == \"s\" and s[i + 1][j + 3] == \"n\" and s[i + 2][j + 2] == \"u\" and s[i + 3][j + 1] == \"k\" and s[i + 4][j] == \"e\":\n for x in range(5):\n print(i + x, j + 4 - x)\n exit()", "def main():\n h, w = map(int, input().split())\n s = [input() for _ in range(h)]\n for i in range(h - 4):\n for j in range(w - 4):\n if s[i][j] == 's' and s[i][j + 1] == 'n' and s[i][j + 2] == 'u' and s[i][j + 3] == 'k' and s[i][j + 4] == 'e':\n for di in range(-1, 2):\n for dj in range(-1, 2):\n if di == 0 and dj == 0:\n continue\n ok = True\n for k in range(5):\n ni, nj = i + k * di, j + k * dj\n if ni < 0 or ni >= h or nj < 0 or nj >= w:\n ok = False\n break\n if k == 0 and s[ni][nj] != 's':\n ok = False\n break\n if k == 1 and s[ni][nj] != 'n':\n ok = False\n break\n if k == 2 and s[ni][nj] != 'u':\n ok = False\n break\n if k == 3 and s[ni][nj] != 'k':\n ok = False\n break\n if k == 4 and s[ni][nj] != 'e':\n ok = False\n break\n if ok:\n for k in range(5):\n print(i + k * di + 1, j + k * dj + 1)\n return\n print(-1, -1)\n print(-1, -1)\n print(-1, -1)\n print(-1, -1)\n print(-1, -1)\n\n\nmain()", "h, w = map(int, input().split())\ns = [input() for _ in range(h)]\nfor i in range(h - 4):\n for j in range(w - 4):\n if s[i][j] + s[i][j + 1] + s[i][j + 2] + s[i + 1][j + 1] + s[i + 2][j] + s[i + 2][j + 1] + s[i + 2][j + 2] + s[i + 3][j + 1] == \"snuuke\":\n print(i + 1, j + 1)\n print(i + 1, j + 2)\n print(i + 2, j + 1)\n print(i + 3, j + 1)\n print(i + 4, j + 1)\n exit()\n if s[i][j] + s[i + 1][j] + s[i + 2][j] + s[i + 3][j] + s[i][j + 1] + s[i + 1][j + 1] + s[i + 2][j + 1] + s[i + 1][j + 2] == \"snuuke\":\n print(i + 1, j + 1)\n print(i, j + 2)\n print(i + 1, j + 1)\n print(i + 1, j + 2)\n print(i + 2, j + 1)\n exit()\n if s[i][j] + s[i][j + 1] + s[i][j + 2] + s[i + 1][j + 3] + s[i + 1][j] + s[i + 1][j + 1] + s[i + 1][j + 2] + s[i + 2][j + 1] == \"snuuke\":\n print(i + 1, j + 1)\n print(i, j + 1)\n print(i + 1, j + 1)\n print(i + 2, j + 1)\n print(i + 2, j + 2)\n exit()\n if s[i][j] + s[i + 1][j] + s[i + 2][j] + s[i + 3][j] + s[i + 1][j + 1] + s[i + 2][j + 1] + s[i + 3][j + 1] + s[i + 2][j + 2] == \"snuuke\":\n print(i + 1, j + 1)\n print(i, j + 1)\n print(i + 1, j + 1)\n print(i + 2, j + 1)\n print(i + 3, j + 1)\n exit()\n if s[i][j] + s[i + 1][j] + s[i + 2][j] + s[i + 3][j] + s[i + 1][j - 1] + s[i + 1][j + 1] + s[i + 2][j + 1] + s[i + 1][j + 2] == \"snuuke\":\n print(i + 1, j + 1)\n print(i, j)\n print(i + 1, j + 1)\n print(i + 2, j + 1)\n print(i + 3, j + 1)\n exit()\n if s[i][j] + s[i][j + 1] + s[i][j + 2] + s[i][j + 3] + s[i + 1][j] + s[i + 1][j + 1] + s[i + 1][j + 2] + s[i + 2][j + 1] == \"snuuke\":\n print(i + 1, j + 1)\n print(i, j + 1)\n print(i + 1, j + 1)\n print(i + 1, j + 2)\n print(i + 1, j + 3)\n exit()\n if s[i][j] + s[i + 1][j] + s[i + 2][j] + s[i + 3][j] + s[i][j + 1] + s[i + 1][j + 1] + s[i + 2][j + 1] + s[i + 3][j + 1] == \"snuuke\":\n print(i + 1, j + 1)\n print(i, j + 1)\n print(i + 1, j + 1)\n print(i + 2, j + 1)\n print(i + 3, j + 1)\n exit()\n if s[i][j] + s[i + 1][j] + s[i + 2][j] + s[i + 3][j] + s[i + 1][j + 1] + s[i + 2][j + 1] + s[i + 3][j + 1] + s[i + 2][j + 2] == \"snuuke\":\n print(i + 1, j + 1)\n print(i, j + 1)\n print(i + 1, j + 1)\n print(i + 2, j + 1)\n print(i + 3, j + 1)\n exit()\n if s[i][j] + s[i + 1][j] + s[i + 2][j] + s[i + 3][j] + s[i + 1][j - 1] + s[i + 1][j + 1] + s[i + 2][j + 1] + s[i + 3][j + 1] == \"snuuke\":\n print(i + 1, j + 1)\n print(i, j)\n print(i + 1, j + 1)\n print(i + 2, j + 1)\n print(i + 3, j + 1)\n exit()", "h, w = map(int, input().split())\ns = [input() for _ in range(h)]\n\nfor i in range(h - 4):\n for j in range(w - 4):\n if s[i][j] == \"s\" and s[i][j + 1] == \"n\" and s[i][j + 2] == \"u\" and s[i][j + 3] == \"k\" and s[i][j + 4] == \"e\":\n for di in range(-1, 2):\n for dj in range(-1, 2):\n if di == 0 and dj == 0:\n continue\n ok = True\n for k in range(5):\n ni = i + k * di\n nj = j + k * dj\n if ni < 0 or ni >= h or nj < 0 or nj >= w:\n ok = False\n break\n if k == 0 and s[ni][nj] != \"s\":\n ok = False\n break\n if k == 1 and s[ni][nj] != \"n\":\n ok = False\n break\n if k == 2 and s[ni][nj] != \"u\":\n ok = False\n break\n if k == 3 and s[ni][nj] != \"k\":\n ok = False\n break\n if k == 4 and s[ni][nj] != \"e\":\n ok = False\n break\n if ok:\n for k in range(5):\n print(i + k * di + 1, j + k * dj + 1)\n exit()", "h, w = map(int, input().split())\ns = [input() for _ in range(h)]\n\nfor i in range(h - 4):\n for j in range(w - 4):\n if s[i][j] + s[i][j + 1] + s[i][j + 2] + s[i + 1][j + 1] + s[i + 2][j] + s[i + 2][j + 1] + s[i + 2][j + 2] + s[i + 3][j + 1] == \"snuuke\":\n for k in range(5):\n print(i + k, j + 1)\n exit()\n if s[i][j] + s[i][j + 1] + s[i][j + 2] + s[i + 1][j] + s[i + 1][j + 2] + s[i + 2][j] + s[i + 2][j + 1] + s[i + 3][j + 1] == \"snuuke\":\n for k in range(5):\n print(i + k, j + 2 - k)\n exit()\n if s[i][j] + s[i][j + 1] + s[i][j + 2] + s[i + 1][j] + s[i + 1][j + 1] + s[i + 2][j + 2] + s[i + 3][j] + s[i + 3][j + 1] == \"snuuke\":\n for k in range(5):\n print(i + k, j + 3 - k)\n exit()\n if s[i][j] + s[i][j + 1] + s[i + 1][j - 1] + s[i + 1][j] + s[i + 1][j + 1] + s[i + 2][j] + s[i + 2][j + 1] + s[i + 3][j + 1] == \"snuuke\":\n for k in range(5):\n print(i + k, j + 2 - k)\n exit()\n if s[i][j] + s[i][j + 1] + s[i + 1][j - 1] + s[i + 1][j] + s[i + 1][j + 1] + s[i + 2][j] + s[i + 3][j] + s[i + 3][j + 1] == \"snuuke\":\n for k in range(5):\n print(i + k, j + 2 - k)\n exit()\n if s[i][j] + s[i + 1][j - 1] + s[i + 1][j] + s[i + 1][j + 1] + s[i + 2][j] + s[i + 2][j + 1] + s[i + 3][j] + s[i + 3][j + 1] == \"snuuke\":\n for k in range(5):\n print(i + k, j + 1)\n exit()" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\ns = [input() for i in range(n)]\n\nfor i in range(n):\n for j in range(i + 1, n):\n cnt = 0\n for k in range(m):\n if s[i][k] != s[j][k]:\n cnt += 1\n if cnt == 1:\n s[i], s[j] = s[j], s[i]\n break\n\nfor i in range(n - 1):\n cnt = 0\n for j in range(m):\n if s[i][j] != s[i + 1][j]:\n cnt += 1\n if cnt != 1:\n print(\"No\")\n exit()\nprint(\"Yes\")", "n, m = map(int, input().split())\ns = [input() for _ in range(n)]\n\nfor i in range(n):\n for j in range(i + 1, n):\n d = sum(a != b for a, b in zip(s[i], s[j]))\n if d == 1:\n s[i], s[j] = s[j], s[i]\n break\n else:\n print(\"No\")\n exit()\n\nprint(\"Yes\")", "n, m = map(int, input().split())\ns = [input() for i in range(n)]\n\nfor i in range(n):\n for j in range(i + 1, n):\n cnt = 0\n for k in range(m):\n if s[i][k] != s[j][k]:\n cnt += 1\n if cnt == 1:\n s[i], s[j] = s[j], s[i]\n\nfor i in range(n - 1):\n cnt = 0\n for j in range(m):\n if s[i][j] != s[i + 1][j]:\n cnt += 1\n if cnt != 1:\n print(\"No\")\n exit()\nprint(\"Yes\")", "n, m = map(int, input().split())\ns = [input() for i in range(n)]\n\nfor i in range(n):\n for j in range(i + 1, n):\n d = sum(a != b for a, b in zip(s[i], s[j]))\n if d == 1:\n s[i], s[j] = s[j], s[i]\n break\n else:\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "n, m = map(int, input().split())\ns = [input() for _ in range(n)]\n\nfor i in range(n):\n for j in range(i + 1, n):\n cnt = 0\n for k in range(m):\n if s[i][k] != s[j][k]:\n cnt += 1\n if cnt == 1:\n s[i], s[j] = s[j], s[i]\n break\n\nfor i in range(n - 1):\n cnt = 0\n for j in range(m):\n if s[i][j] != s[i + 1][j]:\n cnt += 1\n if cnt != 1:\n print(\"No\")\n exit()\n\nprint(\"Yes\")", "n, m = map(int, input().split())\ns = [input() for i in range(n)]\n\nfor i in range(n):\n for j in range(i + 1, n):\n d = sum(a != b for a, b in zip(s[i], s[j]))\n if d == 1:\n s[i], s[j] = s[j], s[i]\n break\n else:\n print(\"No\")\n exit()\n\nprint(\"Yes\")", "n, m = map(int, input().split())\ns = [input() for i in range(n)]\n\nfor i in range(n):\n for j in range(i + 1, n):\n d = 0\n for k in range(m):\n if s[i][k] != s[j][k]:\n d += 1\n if d == 1:\n break\n else:\n print(\"No\")\n exit()\nprint(\"Yes\")", "n, m = map(int, input().split())\ns = [input() for _ in range(n)]\n\nfor i in range(n):\n for j in range(i + 1, n):\n d = sum(a != b for a, b in zip(s[i], s[j]))\n if d == 1:\n s[i], s[j] = s[j], s[i]\n break\n else:\n print(\"No\")\n exit()\nprint(\"Yes\")", "n, m = map(int, input().split())\ns = [input() for i in range(n)]\n\nfor i in range(n):\n for j in range(n):\n if i != j:\n cnt = 0\n for k in range(m):\n if s[i][k] != s[j][k]:\n cnt += 1\n if cnt == 1:\n break\n if j == n - 1:\n print(\"No\")\n exit()\nprint(\"Yes\")", "n, m = map(int, input().split())\ns = [input() for i in range(n)]\n\nfor i in range(n):\n for j in range(i + 1, n):\n cnt = 0\n for k in range(m):\n if s[i][k] != s[j][k]:\n cnt += 1\n if cnt == 1:\n s[i], s[j] = s[j], s[i]\n break\n else:\n print(\"No\")\n exit()\nprint(\"Yes\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n(n, m, d) = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nans = -1\nfor i in range(n):\n if a[i] + d >= b[-1]:\n ans = max(ans, a[i] + b[-1])\n break\nfor i in range(m):\n if b[i] + d >= a[-1]:\n ans = max(ans, a[-1] + b[i])\n break\nfor i in range(n):\n j = bisect_left(b, a[i] - d)\n if j != m:\n ans = max(ans, a[i] + b[j])\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, m, d) = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nans = -1\nfor i in range(n):\n if a[i] + d >= b[-1]:\n ans = max(ans, a[i] + b[-1])\n break\nfor i in range(m):\n if b[i] + d >= a[-1]:\n ans = max(ans, a[-1] + b[i])\n break\nfor i in range(n):\n j = 0\n while j < m and b[j] < a[i] - d:\n j += 1\n if j == m:\n break\n ans = max(ans, a[i] + b[j])\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(N, M, D) = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nA.sort()\nB.sort()\nans = -1\nfor a in A:\n for b in B:\n if abs(a - b) <= D:\n ans = max(ans, a + b)\n break\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, m, d) = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nans = -1\nfor i in range(n):\n if a[i] + d >= b[-1]:\n ans = max(ans, a[i] + b[-1])\n break\nfor i in range(m):\n if b[i] + d >= a[-1]:\n ans = max(ans, a[-1] + b[i])\n break\nfor i in range(n):\n j = 0\n while j < m and b[j] < a[i] - d:\n j += 1\n if j == m:\n break\n ans = max(ans, a[i] + b[j])\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, m, d) = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nans = -1\nfor i in range(n):\n if a[i] + d >= b[-1]:\n ans = max(ans, a[i] + b[-1])\n break\nfor i in range(m):\n if b[i] + d >= a[-1]:\n ans = max(ans, b[i] + a[-1])\n break\nfor i in range(n):\n j = 0\n while j < m and b[j] < a[i] - d:\n j += 1\n if j < m:\n ans = max(ans, a[i] + b[j])\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, m, d) = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nans = -1\nfor i in range(n):\n if a[i] + d >= b[-1]:\n ans = max(ans, a[i] + b[-1])\n break\nfor i in range(m):\n if b[i] + d >= a[-1]:\n ans = max(ans, a[-1] + b[i])\n break\nfor i in range(n):\n j = 0\n while j < m and a[i] - d >= b[j]:\n j += 1\n if j == m:\n continue\n ans = max(ans, a[i] + b[j])\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, m, d) = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nans = -1\nfor i in range(n):\n if a[i] + d >= b[-1]:\n ans = max(ans, a[i] + b[-1])\n break\nfor i in range(m):\n if b[i] + d >= a[-1]:\n ans = max(ans, a[-1] + b[i])\n break\nfor i in range(n):\n j = 0\n while j < m and b[j] < a[i] - d:\n j += 1\n if j == m:\n break\n ans = max(ans, a[i] + b[j])\nfor i in range(m):\n j = 0\n while j < n and a[j] < b[i] - d:\n j += 1\n if j == n:\n break\n ans = max(ans, a[j] + b[i])\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, m, d) = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nans = -1\nfor i in range(n):\n if a[i] + d >= b[-1]:\n ans = max(ans, a[i] + b[-1])\n break\nfor i in range(m):\n if b[i] + d >= a[-1]:\n ans = max(ans, a[-1] + b[i])\n break\nfor i in range(n):\n j = 0\n while j < m and b[j] < a[i] - d:\n j += 1\n if j == m:\n continue\n ans = max(ans, a[i] + b[j])\nif ans == -1:\n print(-1)\nelse:\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n(N, M, D) = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nA.sort()\nB.sort()\nans = -1\nfor a in A:\n for b in B:\n if abs(a - b) <= D:\n ans = max(ans, a + b)\n break\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, m, d) = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nans = -1\nfor i in range(n):\n if a[i] + d >= b[-1]:\n ans = max(ans, a[i] + b[-1])\n break\nfor i in range(m):\n if b[i] + d >= a[-1]:\n ans = max(ans, a[-1] + b[i])\n break\nfor i in range(n):\n j = min(i + 1, n - 1)\n while j < n and a[j] - a[i] <= d:\n if a[j] + d >= b[i]:\n ans = max(ans, a[j] + b[i])\n j += 1\n if ans >= a[i] + b[-1]:\n break\nfor i in range(m):\n j = min(i + 1, m - 1)\n while j < m and b[j] - b[i] <= d:\n if b[j] + d >= a[i]:\n ans = max(ans, a[i] + b[j])\n j += 1\n if ans >= a[-1] + b[i]:\n break\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN, Q = list(map(int, input().split()))\n\ngraph = [[] for _ in range(N)]\n\ncnt = N\n\nfor _ in range(Q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n u, v = query[1:]\n graph[u - 1].append(v - 1)\n graph[v - 1].append(u - 1)\n cnt -= 1\n else:\n v = query[1]\n for i in range(len(graph[v - 1])):\n u = graph[v - 1][i]\n graph[u].remove(v - 1)\n graph[v - 1].remove(u)\n cnt += 1\n\n print(cnt)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = map(int, input().split())\n\ngraph = [[] for _ in range(N)]\n\ncnt = N\n\nfor _ in range(Q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n u, v = query[1:]\n graph[u - 1].append(v - 1)\n graph[v - 1].append(u - 1)\n cnt -= 1\n else:\n v = query[1]\n for i in range(len(graph[v - 1])):\n u = graph[v - 1][i]\n graph[u].remove(v - 1)\n graph[v - 1].remove(u)\n cnt += 1\n\n print(cnt)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = list(map(int, input().split()))\n\ngraph = [[] for _ in range(N)]\n\ncnt = N\n\nfor _ in range(Q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n u, v = query[1:]\n graph[u - 1].append(v - 1)\n graph[v - 1].append(u - 1)\n cnt -= 1\n else:\n v = query[1]\n for i in range(len(graph[v - 1])):\n graph[graph[v - 1][i]].remove(v - 1)\n graph[v - 1] = []\n cnt += 1\n\n print(cnt)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = map(int, input().split())\n\ngraph = [[] for _ in range(N)]\n\ncnt = N\n\nfor _ in range(Q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n u, v = query[1:]\n u -= 1\n v -= 1\n graph[u].append(v)\n graph[v].append(u)\n cnt -= 1\n else:\n v = query[1] - 1\n for i in graph[v]:\n graph[i].remove(v)\n graph[v] = []\n cnt = N\n for i in range(N):\n if graph[i]:\n cnt -= 1\n break\n for i in range(N):\n if not graph[i]:\n cnt += 1\n break\n print(cnt)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = list(map(int, input().split()))\n\ngraph = [[] for _ in range(N)]\n\ncnt = N\n\nfor _ in range(Q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n u, v = query[1:]\n graph[u - 1].append(v - 1)\n graph[v - 1].append(u - 1)\n cnt -= 1\n else:\n v = query[1]\n for i in range(len(graph[v - 1])):\n graph[graph[v - 1][i]].remove(v - 1)\n graph[v - 1] = []\n cnt += 1\n\n print(cnt)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = list(map(int, input().split()))\n\ngraph = [[] for _ in range(N)]\n\nfor _ in range(Q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n u, v = query[1:]\n graph[u - 1].append(v - 1)\n graph[v - 1].append(u - 1)\n else:\n v = query[1]\n graph[v - 1] = []\n\n cnt = 0\n for g in graph:\n if not g:\n cnt += 1\n\n print(cnt)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = list(map(int, input().split()))\n\ngraph = [[] for _ in range(N)]\n\ncnt = N\n\nfor _ in range(Q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n u, v = query[1:]\n graph[u - 1].append(v - 1)\n graph[v - 1].append(u - 1)\n cnt -= 1\n else:\n v = query[1]\n for i in graph[v - 1]:\n if i in graph[v - 1]:\n graph[v - 1].remove(i)\n if v - 1 in graph[i]:\n graph[i].remove(v - 1)\n cnt += 1\n print(cnt)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = map(int, input().split())\n\ngraph = [[] for _ in range(N)]\n\ncnt = N\n\nfor _ in range(Q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n u, v = query[1:]\n graph[u - 1].append(v - 1)\n graph[v - 1].append(u - 1)\n cnt -= 1\n else:\n v = query[1]\n for i in range(len(graph[v - 1])):\n u = graph[v - 1][i]\n graph[u].remove(v - 1)\n graph[v - 1].remove(u)\n cnt += 1\n print(cnt)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = map(int, input().split())\n\ngraph = [[] for _ in range(N)]\n\ncnt = N\n\nfor _ in range(Q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n u, v = query[1:]\n graph[u - 1].append(v - 1)\n graph[v - 1].append(u - 1)\n else:\n v = query[1]\n graph[v - 1] = []\n\n isolated = 0\n for i in range(N):\n if len(graph[i]) == 0:\n isolated += 1\n\n print(isolated)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = map(int, input().split())\n\ngraph = [[] for _ in range(N)]\n\ncnt = N\n\nfor _ in range(Q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n u, v = query[1:]\n graph[u - 1].append(v - 1)\n graph[v - 1].append(u - 1)\n cnt -= 1\n else:\n v = query[1]\n graph[v - 1] = []\n for i in range(N):\n if i != v - 1 and (v - 1) in graph[i]:\n graph[i].remove(v - 1)\n cnt += 1\n\n print(cnt)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\nfrom collections import deque\n\n(N, M) = map(int, input().split())\n\ngraph = [[] for _ in range(M + 1)]\ndist = [float(\"inf\")] * (M + 1)\ndist[1] = 0\nQ = deque([1])\n\nfor _ in range(N):\n A = int(input())\n S = list(map(int, input().split()))\n for s in S:\n graph[s].extend(S)\n\nwhile Q:\n v = Q.popleft()\n for nv in graph[v]:\n if dist[nv] > dist[v] + 1:\n dist[nv] = dist[v] + 1\n Q.append(nv)\n\nif dist[M] == float(\"inf\"):\n print(-1)\nelse:\n print(dist[M])", "from collections import deque\n\n(N, M) = map(int, input().split())\n\ngraph = [[] for _ in range(M + 1)]\n\nfor _ in range(N):\n A = int(input())\n S = list(map(int, input().split()))\n for s in S:\n graph[s].append(A)\n\ndist = [float(\"inf\")] * (M + 1)\ndist[1] = 0\nq = deque([1])\n\nwhile q:\n v = q.popleft()\n for u in graph[v]:\n for s in graph[u]:\n if dist[s] > dist[u] + 1:\n dist[s] = dist[u] + 1\n q.append(s)\n\nprint(dist[M] if dist[M] != float(\"inf\") else -1)", "import sys\n\ninput = sys.stdin.readline\nfrom collections import deque\n\n(N, M) = map(int, input().split())\n\ngraph = [[] for _ in range(M + 1)]\nindeg = [0] * (M + 1)\ndist = [float(\"inf\")] * (M + 1)\ndist[1] = 0\n\nfor _ in range(N):\n A = int(input())\n S = list(map(int, input().split()))\n for s in S:\n graph[s].extend(S)\n indeg[s] += len(S) - 1\n\nq = deque([1])\nwhile q:\n v = q.popleft()\n for nv in graph[v]:\n indeg[nv] -= 1\n if indeg[nv] == 0:\n q.append(nv)\n dist[nv] = dist[v] + 1\n\nprint(dist[M] if dist[M] != float(\"inf\") else -1)", "import sys\n\ninput = sys.stdin.readline\n(n, m) = map(int, input().split())\ngraph = [[] for _ in range(m + 1)]\nfor _ in range(n):\n a = int(input())\n s = list(map(int, input().split()))\n for i in range(a - 1):\n graph[s[i]].append(s[i + 1])\n graph[s[i + 1]].append(s[i])\ndist = [-1] * (m + 1)\ndist[1] = 0\nq = [1]\nwhile q:\n v = q.pop(0)\n for nv in graph[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + 1\n q.append(nv)\nprint(dist[m] if dist[m] != -1 else -1)", "from collections import deque\n\n(n, m) = map(int, input().split())\nparents = [i for i in range(m + 1)]\nranks = [0] * (m + 1)\n\n\ndef find(x):\n if parents[x] == x:\n return x\n else:\n parents[x] = find(parents[x])\n return parents[x]\n\n\ndef union(x, y):\n (x, y) = (find(x), find(y))\n if x == y:\n return\n if ranks[x] > ranks[y]:\n parents[y] = x\n elif ranks[x] < ranks[y]:\n parents[x] = y\n else:\n parents[x] = y\n ranks[y] += 1\n\n\ndef solve():\n for i in range(n):\n a = int(input())\n s = list(map(int, input().split()))\n for j in range(a):\n union(s[j], s[j] + 1)\n if find(1) == find(m):\n return len(parents) - 1\n else:\n return -1\n\n\nprint(solve())", "from collections import deque\n\n(n, m) = map(int, input().split())\n\ngraph = [[] for _ in range(m + 1)]\ndist = [float(\"inf\")] * (m + 1)\ndist[1] = 0\nq = deque([1])\n\nfor _ in range(n):\n a = int(input())\n for s in input().split():\n s = int(s)\n graph[s].extend(map(int, input().split()))\n graph[s].append(s)\n\nwhile q:\n v = q.popleft()\n for u in graph[v]:\n if dist[u] > dist[v] + 1:\n dist[u] = dist[v] + 1\n q.append(u)\n\nprint(dist[m] if dist[m] != float(\"inf\") else -1)", "from collections import deque\n\n(n, m) = map(int, input().split())\n\ngraph = [[] for _ in range(m + 1)]\ndist = [float(\"inf\")] * (m + 1)\ndist[1] = 0\nq = deque([1])\n\nfor _ in range(n):\n a = int(input())\n s = list(map(int, input().split()))\n for i in range(a - 1):\n graph[s[i]].append(s[i + 1])\n graph[s[i + 1]].append(s[i])\n\nwhile q:\n v = q.popleft()\n for u in graph[v]:\n if dist[u] == float(\"inf\"):\n dist[u] = dist[v] + 1\n q.append(u)\n\nprint(dist[m] if dist[m] != float(\"inf\") else -1)", "from collections import deque\n\n(n, m) = map(int, input().split())\n\ngraph = [[] for _ in range(m + 1)]\ndist = [float(\"inf\")] * (m + 1)\ndist[1] = 0\nq = deque([1])\n\nfor _ in range(n):\n a = int(input())\n s = list(map(int, input().split()))\n for i in range(a - 1):\n graph[s[i]].append(s[i + 1])\n graph[s[i + 1]].append(s[i])\n\nwhile q:\n v = q.popleft()\n for nv in graph[v]:\n if dist[nv] > dist[v] + 1:\n dist[nv] = dist[v] + 1\n q.append(nv)\n\nprint(dist[m] if dist[m] != float(\"inf\") else -1)", "from collections import deque\n\n(n, m) = map(int, input().split())\ngraph = [[] for _ in range(m + 1)]\nfor _ in range(n):\n a = int(input())\n s = list(map(int, input().split()))\n for i in range(a - 1):\n graph[s[i]].append(s[i + 1])\n graph[s[i + 1]].append(s[i])\ndist = [-1] * (m + 1)\ndist[1] = 0\nq = deque([1])\nwhile q:\n v = q.popleft()\n for u in graph[v]:\n if dist[u] == -1:\n dist[u] = dist[v] + 1\n q.append(u)\nprint(dist[m] if dist[m] != -1 else -1)", "from collections import deque\n\n(n, m) = map(int, input().split())\n\ngraph = [[] for _ in range(m + 1)]\ndist = [float(\"inf\")] * (m + 1)\ndist[1] = 0\nq = deque([1])\n\nfor _ in range(n):\n a = int(input())\n s = list(map(int, input().split()))\n for i in range(a - 1):\n graph[s[i]].append(s[i + 1])\n graph[s[i + 1]].append(s[i])\n\nwhile q:\n v = q.popleft()\n for u in graph[v]:\n if dist[u] == float(\"inf\"):\n dist[u] = dist[v] + 1\n q.append(u)\n\nprint(dist[m] if dist[m] != float(\"inf\") else -1)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ns = input()\nt = input()\nfor i in range(n):\n if s[i] != t[i] and s[i] != t[i] + 1 and s[i] != t[i] - 1 and s[i] != chr(ord(t[i]) - 32) and s[i] != chr(ord(t[i]) + 32):\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "n = int(input())\ns = input()\nt = input()\n\nfor i in range(n):\n if s[i] != t[i] and s[i] != t[i] + 32 and s[i] != t[i] - 32 and s[i] != t[i] + 48 and s[i] != t[i] - 48:\n print(\"No\")\n exit()\nprint(\"Yes\")", "n = int(input())\ns = input()\nt = input()\n\nfor i in range(n):\n if s[i] != t[i] and s[i] != t[i] + 32 and s[i] != t[i] - 32 and s[i] != t[i] + 48 and s[i] != t[i] - 48:\n print(\"No\")\n exit()\nprint(\"Yes\")", "n = int(input())\ns = input()\nt = input()\n\nfor i in range(n):\n if s[i] != t[i] and s[i] != t[i] + 1 and s[i] != t[i] - 1 and s[i] != ord(t[i]) - 32 and s[i] != ord(t[i]) + 32:\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "n = int(input())\ns = input()\nt = input()\nfor i in range(n):\n if s[i] != t[i] and s[i] != t[i] + 1 and s[i] != t[i] - 1 and chr(ord(s[i]) + 1) != t[i] and chr(ord(s[i]) - 1) != t[i]:\n print(\"No\")\n exit()\nprint(\"Yes\")", "n = int(input())\ns = input()\nt = input()\n\nif all(x == y or (x == \"1\" and y == \"l\") or (x == \"l\" and y == \"1\") or (x == \"0\" and y == \"o\") or (x == \"o\" and y == \"0\") for x, y in zip(s, t)):\n print(\"Yes\")\nelse:\n print(\"No\")", "n = int(input())\ns = input()\nt = input()\n\nfor i in range(n):\n if s[i] != t[i] and s[i] != t[i] + 32 and s[i] != t[i] - 32 and s[i] != t[i] + 48 and s[i] != t[i] - 48:\n print(\"No\")\n exit()\nprint(\"Yes\")", "n = int(input())\ns = input()\nt = input()\n\nfor i in range(n):\n if s[i] != t[i] and s[i] != \"1\" + t[i] and s[i] != \"l\" + t[i] and s[i] != \"0\" + t[i] and s[i] != \"o\" + t[i]:\n print(\"No\")\n exit()\nprint(\"Yes\")", "n = int(input())\ns = input()\nt = input()\n\nfor i in range(n):\n if s[i] != t[i] and s[i] != \"1\" + t[i] and s[i] != \"l\" + t[i] and s[i] != \"0\" + t[i] and s[i] != \"o\" + t[i]:\n print(\"No\")\n exit()\nprint(\"Yes\")", "n = int(input())\ns = input()\nt = input()\n\nfor i in range(n):\n if s[i] != t[i] and s[i] != t[i] + 1 and s[i] != t[i] - 1 and s[i] != chr(ord(t[i]) - 32) and s[i] != chr(ord(t[i]) + 32):\n print(\"No\")\n exit()\nprint(\"Yes\")" ], "pass1_list": [ false, false, false, false, false, true, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\r\n\r\na = []\r\nfor i in range(m):\r\n a.append(list(map(int, input().split())))\r\n\r\nans = 0\r\nfor i in range(1, n):\r\n for j in range(i + 2, n + 1):\r\n flag = True\r\n for k in range(m):\r\n if abs(a[k][i - 1] - a[k][j - 1]) == 1:\r\n flag = False\r\n if flag:\r\n ans += 1\r\n\r\nprint(ans)\r", "n, m = map(int, input().split())\na = [list(map(int, input().split())) for _ in range(m)]\n\nmood = 0\nfor i in range(n):\n for j in range(i + 2, n):\n if not any(a[k][l] == i + 1 and a[k][l + 1] == j + 1 for k in range(m) for l in range(n - 1)):\n mood += 1\nprint(mood)", "n, m = map(int, input().split())\r\na = [list(map(int, input().split())) for _ in range(m)]\r\n\r\nmood = 0\r\nfor i in range(n):\r\n for j in range(i + 2, n):\r\n if not any(a[k][l] == i + 1 and a[k][l + 1] == j + 1 or a[k][l] == j + 1 and a[k][l + 1] == i + 1 for k in range(m) for l in range(n - 1)):\r\n mood += 1\r\nprint(mood)\r", "n, m = map(int, input().split())\na = [list(map(int, input().split())) for i in range(m)]\n\nmood = 0\nfor i in range(n):\n for j in range(i + 2, n):\n flag = True\n for k in range(m):\n if a[k][i + 1] == j + 1 and a[k][i] == j or a[k][i] == j + 1 and a[k][i + 1] == j:\n flag = False\n break\n if flag:\n mood += 1\nprint(mood)", "n, m = map(int, input().split())\r\na = [list(map(int, input().split())) for _ in range(m)]\r\n\r\nmood = 0\r\nfor i in range(n):\r\n for j in range(i + 2, n):\r\n if not any(a[k][l] == i + 1 and a[k][l + 1] == j + 1 for k in range(m) for l in range(n - 1)):\r\n mood += 1\r\n\r\nprint(mood)\r", "n, m = map(int, input().split())\r\n\r\npeople = [[] for _ in range(n)]\r\nfor _ in range(m):\r\n for i, a in enumerate(map(int, input().split())):\r\n people[a - 1].append(i)\r\n\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i + 2, n):\r\n if not (people[i] and people[j] and (people[i][-1] + 1 == people[j][0] or people[j][-1] + 1 == people[i][0])):\r\n ans += 1\r\nprint(ans)\r", "n, m = map(int, input().split())\r\na = [list(map(int, input().split())) for _ in range(m)]\r\n\r\nbad_mood = 0\r\nfor i in range(n):\r\n for j in range(i + 2, n):\r\n if not any(a[k][l] == i + 1 and a[k][l + 1] == j + 1 for k in range(m) for l in range(n - 1)):\r\n bad_mood += 1\r\n if not any(a[k][l] == j + 1 and a[k][l + 1] == i + 1 for k in range(m) for l in range(n - 1)):\r\n bad_mood += 1\r\n\r\nprint(bad_mood // 2)\r", "n, m = map(int, input().split())\na = [list(map(int, input().split())) for i in range(m)]\n\nb = [[] for i in range(n + 1)]\nfor i in range(m):\n for j in range(n):\n b[a[i][j]].append(a[i][j + 1])\n b[a[i][j + 1]].append(a[i][j])\n\nans = 0\nfor i in range(1, n + 1):\n for j in range(i + 1, n + 1):\n if j not in b[i]:\n ans += 1\nprint(ans)", "n, m = map(int, input().split())\r\n\r\na = []\r\nfor i in range(m):\r\n a.append(list(map(int, input().split())))\r\n\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(i + 2, n):\r\n flag = True\r\n for k in range(m):\r\n if abs(a[k][i] - a[k][j]) == 1:\r\n flag = False\r\n if flag:\r\n count += 1\r\n\r\nprint(count)\r", "n, m = map(int, input().split())\r\n\r\na = []\r\nfor i in range(m):\r\n a.append(list(map(int, input().split())))\r\n\r\nans = 0\r\nfor i in range(1, n):\r\n for j in range(i + 2, n + 1):\r\n flag = 0\r\n for k in range(m):\r\n if a[k][i - 1] == j and a[k][i] == j - 1:\r\n flag = 1\r\n break\r\n if a[k][j - 1] == i and a[k][j] == i + 1:\r\n flag = 1\r\n break\r\n if flag == 0:\r\n ans += 1\r\nprint(ans)\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m, h, k = map(int, input().split())\ns = input()\nrecovery = []\nfor i in range(m):\n recovery.append(tuple(map(int, input().split())))\n\nx, y = 0, 0\nhealth = h\nfor move in s:\n health -= 1\n if health < 0:\n print(\"No\")\n break\n if move == \"R\":\n x += 1\n elif move == \"L\":\n x -= 1\n elif move == \"U\":\n y += 1\n else:\n y -= 1\n if (x, y) in recovery and health < k:\n health = k\n if health == 0:\n print(\"Yes\")\n break\nelse:\n print(\"Yes\" if health >= 0 else \"No\")", "n, m, h, k = map(int, input().split())\ns = input()\nitems = []\nfor i in range(m):\n x, y = map(int, input().split())\n items.append((x, y))\n\nx, y = 0, 0\nhealth = h\nfor move in s:\n if move == \"R\":\n x += 1\n elif move == \"L\":\n x -= 1\n elif move == \"U\":\n y += 1\n else:\n y -= 1\n health -= 1\n if health < 0:\n break\n for item in items:\n if x == item[0] and y == item[1]:\n if health < k:\n health = k\n break\n\nif health >= 0:\n print(\"Yes\")\nelse:\n print(\"No\")", "n, m, h, k = map(int, input().split())\ns = input()\nitems = set()\nfor i in range(m):\n x, y = map(int, input().split())\n items.add((x, y))\n\nx, y, health = 0, 0, h\nfor move in s:\n if move == \"R\":\n x += 1\n elif move == \"L\":\n x -= 1\n elif move == \"U\":\n y += 1\n else:\n y -= 1\n health -= 1\n if health < 0:\n break\n if (x, y) in items and health < k:\n health = k\n\nif health >= 0:\n print(\"Yes\")\nelse:\n print(\"No\")", "n, m, h, k = map(int, input().split())\ns = input()\nitems = set()\nfor i in range(m):\n x, y = map(int, input().split())\n items.add((x, y))\n\nx, y = 0, 0\nhealth = h\nfor move in s:\n if move == \"R\":\n x += 1\n elif move == \"L\":\n x -= 1\n elif move == \"U\":\n y += 1\n else:\n y -= 1\n health -= 1\n if health < 0:\n break\n if (x, y) in items and health < k:\n health = k\nprint(\"Yes\" if health >= 0 else \"No\")", "n, m, h, k = map(int, input().split())\ns = input()\nitems = []\nfor i in range(m):\n x, y = map(int, input().split())\n items.append((x, y))\n\nx, y = 0, 0\nhealth = h\nfor move in s:\n if move == \"R\":\n x += 1\n elif move == \"L\":\n x -= 1\n elif move == \"U\":\n y += 1\n else:\n y -= 1\n health -= 1\n if health < 0:\n break\n for item in items:\n if x == item[0] and y == item[1]:\n if health < k:\n health = k\n break\n\nif health >= 0:\n print(\"Yes\")\nelse:\n print(\"No\")", "n, m, h, k = map(int, input().split())\ns = input()\nitems = [list(map(int, input().split())) for i in range(m)]\nx, y = 0, 0\nhealth = h\nfor i in range(n):\n if health < 0:\n print(\"No\")\n break\n health -= 1\n if s[i] == \"R\":\n x += 1\n elif s[i] == \"L\":\n x -= 1\n elif s[i] == \"U\":\n y += 1\n else:\n y -= 1\n for item in items:\n if x == item[0] and y == item[1]:\n if health < k:\n health = k\n items.remove(item)\n break\n if health < 0:\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "import sys\n\ninput = sys.stdin.readline\n\nN, M, H, K = map(int, input().split())\nS = input().strip()\nitems = []\nfor i in range(M):\n x, y = map(int, input().split())\n items.append((x, y))\n\nx, y = 0, 0\nhealth = H\nfor s in S:\n if health < 0:\n print(\"No\")\n break\n health -= 1\n if s == \"R\":\n x += 1\n elif s == \"L\":\n x -= 1\n elif s == \"U\":\n y += 1\n else:\n y -= 1\n for item in items:\n if x == item[0] and y == item[1]:\n if health < K:\n health = K\n break\nelse:\n print(\"Yes\")", "n, m, h, k = map(int, input().split())\ns = input()\nitems = set()\nfor i in range(m):\n x, y = map(int, input().split())\n items.add((x, y))\n\nx, y = 0, 0\nhealth = h\nfor move in s:\n if health < 0:\n print(\"No\")\n break\n health -= 1\n if move == \"R\":\n x += 1\n elif move == \"L\":\n x -= 1\n elif move == \"U\":\n y += 1\n else:\n y -= 1\n if (x, y) in items and health < k:\n health = k\nelse:\n print(\"Yes\")", "n, m, h, k = map(int, input().split())\ns = input()\nitems = []\nfor i in range(m):\n items.append(tuple(map(int, input().split())))\n\nx, y = 0, 0\nhealth = h\nfor move in s:\n health -= 1\n if health < 0:\n print(\"No\")\n break\n if move == \"R\":\n x += 1\n elif move == \"L\":\n x -= 1\n elif move == \"U\":\n y += 1\n else:\n y -= 1\n if (x, y) in items and health < k:\n health = k\n if health == 0:\n print(\"Yes\")\n break\nelse:\n print(\"Yes\" if health >= 0 else \"No\")", "n, m, h, k = map(int, input().split())\ns = input()\nitems = []\nfor i in range(m):\n x, y = map(int, input().split())\n items.append((x, y))\n\nx, y = 0, 0\nhealth = h\nfor move in s:\n if move == \"R\":\n x += 1\n elif move == \"L\":\n x -= 1\n elif move == \"U\":\n y += 1\n else:\n y -= 1\n health -= 1\n if health < 0:\n break\n for item in items:\n if item[0] == x and item[1] == y:\n if health < k:\n health = k\n break\n\nif health >= 0:\n print(\"Yes\")\nelse:\n print(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "(x, y, z) = map(int, input().split())\ns = input()\nn = len(s)\ndp = [[10**18] * 3 for _ in range(n + 1)]\ndp[0][0] = 0\nfor i in range(n):\n if s[i] == \"a\":\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + x)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + y)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + x)\n else:\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + x)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][0] + z)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][1] + z)\nprint(min(dp[n]))", "(x, y, z) = map(int, input().split())\ns = input()\nn = len(s)\ndp = [[10**18] * 3 for _ in range(n + 1)]\ndp[0][0] = 0\nfor i in range(n):\n if s[i] == \"A\":\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + x)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + y)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + x)\n else:\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + x)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][0] + z)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][1] + z)\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][2] + z)\nprint(min(dp[n]))", "(x, y, z) = map(int, input().split())\ns = input()\nn = len(s)\ndp = [[float(\"inf\")] * 3 for _ in range(n + 1)]\ndp[0][0] = 0\nfor i in range(n):\n if s[i] == \"a\":\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + x)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + y)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + x)\n else:\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + x)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][0] + z)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][1] + z)\nprint(min(dp[n]))", "(x, y, z) = map(int, input().split())\ns = input()\nn = len(s)\ndp = [[float(\"inf\")] * 3 for _ in range(n + 1)]\ndp[0][0] = 0\nfor i in range(n):\n if s[i] == \"a\":\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + x)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][0] + y)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][1] + x)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + y)\n else:\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][0] + x)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + y)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][0] + z + x)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + z + y)\nprint(min(dp[n]))", "(x, y, z) = map(int, input().split())\ns = input()\nn = len(s)\ndp = [[float(\"inf\")] * 3 for _ in range(n + 1)]\ndp[0][0] = 0\nfor i in range(n):\n if s[i] == \"a\":\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + x)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + y)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + x)\n else:\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + x)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][0] + z)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + z)\nprint(min(dp[n]))", "(x, y, z) = map(int, input().split())\ns = input()\nn = len(s)\ndp = [[10**18] * 3 for _ in range(n + 1)]\ndp[0][0] = 0\nfor i in range(n):\n if s[i] == \"a\":\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + x)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + y)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + x)\n else:\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + x)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][0] + z)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][1] + z)\nprint(min(dp[n]))", "(x, y, z) = map(int, input().split())\ns = input()\nn = len(s)\ndp = [[float(\"inf\")] * 3 for _ in range(n + 1)]\ndp[0][0] = 0\nfor i in range(n):\n if s[i] == \"a\":\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + x)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + y)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + x)\n else:\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + x)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][0] + z)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][1] + z)\nprint(min(dp[n]))", "(x, y, z) = map(int, input().split())\ns = input()\nn = len(s)\ndp = [[float(\"inf\")] * 3 for _ in range(n + 1)]\ndp[0][0] = 0\nfor i in range(n):\n if s[i] == \"a\":\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + x)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + y)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + x)\n else:\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + x)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][0] + z)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][1] + z)\nprint(min(dp[n]))", "(x, y, z) = map(int, input().split())\ns = input()\nn = len(s)\ndp = [[10**18] * 3 for _ in range(n + 1)]\ndp[0][0] = 0\nfor i in range(n):\n if s[i] == \"a\":\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + x)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + y)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + x)\n else:\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + x)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][0] + z)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][1] + z)\nprint(min(dp[n]))", "(x, y, z) = map(int, input().split())\ns = input()\nn = len(s)\ndp = [[float(\"inf\")] * 3 for _ in range(n + 1)]\ndp[0][0] = 0\nfor i in range(n):\n if s[i] == \"a\":\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + x)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + y)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + x)\n else:\n dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + x)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][2] + y)\n dp[i + 1][1] = min(dp[i + 1][1], dp[i][0] + z)\n dp[i + 1][2] = min(dp[i + 1][2], dp[i][1] + z)\nprint(min(dp[n]))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\nn = int(input())\ngraph = [[] for _ in range(n + 1)]\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n graph[u].append(v)\n graph[v].append(u)\n\nleaves = [v for v in range(1, n + 1) if len(graph[v]) == 1]\nstars = []\nwhile leaves:\n leaf = leaves.pop()\n center = graph[leaf][0]\n stack = deque([center])\n level = 0\n while stack:\n level += 1\n for _ in range(len(stack)):\n node = stack.popleft()\n for adj in graph[node]:\n if adj == leaf:\n continue\n if len(graph[adj]) == 1:\n leaves.append(adj)\n stack.append(adj)\n graph[node].remove(adj)\n graph[adj].remove(node)\n stars.append(level)\n\nprint(*sorted(stars))", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\nE = [[] for i in range(N)]\n\nfor i in range(N - 1):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n E[u].append(v)\n E[v].append(u)\n\nS = []\n\nfor i in range(N):\n if len(E[i]) == 1:\n S.append(i)\n\nwhile S:\n u = S.pop()\n v = E[u][0]\n E[v].remove(u)\n if len(E[v]) == 1:\n S.append(v)\n\nL = []\n\nfor i in range(N):\n if len(E[i]) > 1:\n L.append(len(E[i]))\n\nL.sort()\n\nprint(*L)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nUV = [list(map(int, input().split())) for i in range(N - 1)]\n\nfrom collections import deque\n\nG = [[] for i in range(N + 1)]\nfor u, v in UV:\n G[u].append(v)\n G[v].append(u)\n\nQ = deque([1])\ndist = [-1] * (N + 1)\ndist[1] = 0\nwhile Q:\n v = Q.popleft()\n for nv in G[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + 1\n Q.append(nv)\n\nL = []\nfor v in range(1, N + 1):\n if dist[v] == 1:\n L.append(len(G[v]) - 1)\n\nL.sort()\nprint(*L)", "from collections import deque\n\nN = int(input())\n\ngraph = [[] for _ in range(N + 1)]\n\nfor _ in range(N - 1):\n u, v = map(int, input().split())\n graph[u].append(v)\n graph[v].append(u)\n\ncenters = []\n\nvisited = [0] * (N + 1)\n\nfor i in range(1, N + 1):\n if visited[i]:\n continue\n q = deque([i])\n visited[i] = 1\n while q:\n node = q.popleft()\n for next_node in graph[node]:\n if visited[next_node]:\n continue\n visited[next_node] = 1\n q.append(next_node)\n centers.append(len(q) - 1)\n\ncenters.sort()\n\nprint(*centers)", "from collections import deque\n\nn = int(input())\n\ngraph = [[] for _ in range(n + 1)]\n\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n graph[u].append(v)\n graph[v].append(u)\n\ncenters = []\n\nvisited = [False] * (n + 1)\n\nfor i in range(1, n + 1):\n if not visited[i]:\n q = deque([i])\n visited[i] = True\n size = 0\n\n while q:\n node = q.popleft()\n size += 1\n\n for adj in graph[node]:\n if not visited[adj]:\n visited[adj] = True\n q.append(adj)\n\n if size > 2:\n centers.append(size - 1)\n\ncenters.sort()\n\nprint(*centers)", "from collections import deque\n\nn = int(input())\n\ngraph = [[] for _ in range(n)]\n\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n graph[u].append(v)\n graph[v].append(u)\n\ncenters = []\n\nvisited = [False] * n\n\nfor i in range(n):\n if visited[i]:\n continue\n q = deque([i])\n visited[i] = True\n size = 0\n while q:\n v = q.popleft()\n size += 1\n for nv in graph[v]:\n if not visited[nv]:\n q.append(nv)\n visited[nv] = True\n centers.append(size)\n\ncenters.sort()\n\nprint(*centers[1:])", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nUV = [list(map(int, input().split())) for i in range(N - 1)]\n\nfrom collections import deque\n\nG = [[] for i in range(N + 1)]\nfor u, v in UV:\n G[u].append(v)\n G[v].append(u)\n\nQ = deque([1])\nused = [0] * (N + 1)\nused[1] = 1\nwhile Q:\n v = Q.popleft()\n for nv in G[v]:\n if used[nv] == 0:\n used[nv] = 1\n Q.append(nv)\n\ncnt = 0\nfor i in range(1, N + 1):\n if used[i]:\n cnt += 1\n\nfrom collections import Counter\n\ncnts = Counter(used)\n\nans = []\nfor k, v in cnts.items():\n if k == 1:\n ans.append(v)\n\nans.sort()\nprint(*ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\nE = [[] for i in range(N)]\n\nfor i in range(N - 1):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n E[u].append(v)\n E[v].append(u)\n\nL = []\n\nfor i in range(N):\n if len(E[i]) == 1:\n S = set()\n S.add(i)\n v = E[i][0]\n while len(E[v]) == 1:\n S.add(v)\n v = E[v][0]\n S.add(v)\n L.append(len(S))\n\nL.sort()\n\nprint(*L)", "from collections import deque\n\nn = int(input())\ngraph = [[] for _ in range(n)]\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n u, v = u - 1, v - 1\n graph[u].append(v)\n graph[v].append(u)\n\nleaves = [i for i in range(n) if len(graph[i]) == 1]\nstars = []\nwhile leaves:\n leaf = leaves.pop()\n q = deque([leaf])\n level = 0\n while q:\n level += 1\n for _ in range(len(q)):\n node = q.popleft()\n for next_node in graph[node]:\n if next_node == leaf:\n continue\n q.append(next_node)\n graph[next_node].remove(node)\n if len(graph[next_node]) == 1:\n leaves.append(next_node)\n if level > 2:\n stars.append(level - 1)\n\nstars.sort()\nprint(*stars)", "from collections import deque\n\nN = int(input())\n\ngraph = [[] for _ in range(N)]\n\nfor _ in range(N - 1):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n graph[u].append(v)\n graph[v].append(u)\n\nleaves = [i for i in range(N) if len(graph[i]) == 1]\n\nstars = []\n\nwhile leaves:\n leaf = leaves.pop()\n center = graph[leaf][0]\n q = deque([center])\n level = 1\n\n while q:\n size = len(q)\n for _ in range(size):\n node = q.popleft()\n for adj in graph[node]:\n if adj == center:\n continue\n q.append(adj)\n graph[adj].remove(node)\n if len(graph[adj]) == 1:\n leaves.append(adj)\n level += 1\n\n stars.append(level - 1)\n\nstars.sort()\nprint(*stars)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\n\npeople = []\nfor i in range(n):\n s, a = input().split()\n a = int(a)\n people.append((s, a))\n\npeople.sort(key=lambda x: x[1])\n\nfor i in range(n):\n people[i + 1 : n + 1] = people[1 : i + 1]\n print(people[1][0])", "n = int(input())\npeople = []\nfor i in range(n):\n s, a = map(str, input().split())\n a = int(a)\n people.append((s, a))\n\npeople.sort(key=lambda x: x[1])\n\nfor i in range(n):\n people[i + 1 : n + 1] + people[1 : i + 1]\n\nfor s, a in people:\n print(s)", "n = int(input())\n\npeople = []\nfor i in range(n):\n s, a = input().split()\n a = int(a)\n people.append((s, a))\n\npeople.sort(key=lambda x: x[1])\n\nfor s, a in people:\n print(s)", "n = int(input())\n\npeople = []\nfor i in range(n):\n s, a = input().split()\n a = int(a)\n people.append((s, a))\n\npeople.sort(key=lambda x: x[1])\n\nfor name, _ in people:\n print(name)", "n = int(input())\npeople = []\nfor i in range(n):\n s, a = map(str, input().split())\n a = int(a)\n people.append((s, a))\n\npeople.sort(key=lambda x: x[1])\n\nfor i in range(n):\n people[i - 1 + n] = people[i]\n\nfor s, _ in people:\n print(s)", "n = int(input())\npeople = []\nfor _ in range(n):\n s, a = input().split()\n a = int(a)\n people.append((s, a))\npeople.sort(key=lambda x: x[1])\nfor i in range(n):\n people.append(people.pop(0))\nfor s, _ in people:\n print(s)", "n = int(input())\npeople = []\nfor i in range(n):\n s, a = map(str, input().split())\n a = int(a)\n people.append((s, a))\npeople.sort(key=lambda x: x[1])\nfor i in range(n):\n people[i + 1:] = people[1:] + people[:1]\n print(people[i][0])", "n = int(input())\npeople = []\nfor i in range(n):\n s, a = map(str, input().split())\n a = int(a)\n people.append((s, a))\npeople.sort(key=lambda x: x[1])\nfor i in range(n):\n people[i + 1 :] = people[1:] + people[1:i + 1]\nfor s, _ in people:\n print(s)", "n = int(input())\n\npeople = []\nfor i in range(n):\n s, a = map(str, input().split())\n a = int(a)\n people.append((s, a))\n\npeople.sort(key=lambda x: x[1])\n\nfor i in range(n):\n people[i - 1 + n] = people[i]\n\nfor s, _ in people:\n print(s)", "n = int(input())\npeople = []\nfor _ in range(n):\n s, a = map(str, input().split())\n people.append((s, int(a)))\npeople.sort(key=lambda x: x[1])\nfor i in range(n):\n people[i:] = people[n-1:i:-1] + people[i:]\nfor s, _ in people:\n print(s)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\n\nif n <= 999:\n print(n)\nelif n <= 9999:\n print(n - n % 1000)\nelif n <= 99999:\n print(n - n % 10000)\nelif n <= 999999:\n print(n - n % 100000)\nelif n <= 9999999:\n print(n - n % 1000000)\nelif n <= 99999999:\n print(n - n % 10000000)\nelse:\n print(n - n % 100000000)", "n = int(input())\n\nif n <= 999:\n print(n)\nelif n <= 9999:\n print(n - n % 1000)\nelif n <= 99999:\n print(n - n % 10000)\nelif n <= 999999:\n print(n - n % 100000)\nelif n <= 9999999:\n print(n - n % 1000000)\nelif n <= 99999999:\n print(n - n % 10000000)\nelse:\n print(n - n % 100000000)", "n = int(input())\nif n < 1000:\n print(n)\nelif n < 10000:\n print(n - n % 100 * 10 + n % 1000 * 10)\nelif n < 100000:\n print(n - n % 10 * 100 + n % 10000 * 10)\nelif n < 1000000:\n print(n - n % 1000 * 10 + n % 100000 * 10)\nelif n < 10000000:\n print(n - n % 10000 * 10 + n % 1000000 * 10)\nelif n < 100000000:\n print(n - n % 100000 * 10 + n % 10000000 * 10)\nelif n < 1000000000:\n print(n - n % 1000000 * 10 + n % 100000000 * 10)", "n = int(input())\r\n\r\nif n <= 999:\r\n print(n)\r\nelif n <= 9999:\r\n print(n - n % 1000 + 1000)\r\nelif n <= 99999:\r\n print(n - n % 10000 + 10000)\r\nelif n <= 999999:\r\n print(n - n % 100000 + 100000)\r\nelif n <= 9999999:\r\n print(n - n % 1000000 + 1000000)\r\nelif n <= 99999999:\r\n print(n - n % 10000000 + 10000000)\r\nelse:\r\n print(n - n % 100000000 + 100000000)\r", "n = int(input())\n\nif n <= 999:\n print(n)\nelif n <= 9999:\n print(n - n % 1000)\nelif n <= 99999:\n print(n - n % 10000)\nelif n <= 999999:\n print(n - n % 100000)\nelif n <= 9999999:\n print(n - n % 1000000)\nelif n <= 99999999:\n print(n - n % 10000000)\nelse:\n print(n - n % 100000000)", "n = int(input())\n\nif n <= 999:\n print(n)\nelif n <= 9999:\n print(n - n % 1000)\nelif n <= 99999:\n print(n - n % 10000)\nelif n <= 999999:\n print(n - n % 100000)\nelif n <= 9999999:\n print(n - n % 1000000)\nelif n <= 99999999:\n print(n - n % 10000000)\nelse:\n print(n - n % 100000000)", "n = int(input())\n\nif n <= 999:\n print(n)\nelif n <= 9999:\n print(n - n % 1000)\nelif n <= 99999:\n print(n - n % 10000)\nelif n <= 999999:\n print(n - n % 100000)\nelif n <= 9999999:\n print(n - n % 1000000)\nelif n <= 99999999:\n print(n - n % 10000000)\nelse:\n print(n - n % 100000000)", "n = int(input())\n\nif n <= 999:\n print(n)\nelif n <= 9999:\n print(n - n % 1000)\nelif n <= 99999:\n print(n - n % 10000)\nelif n <= 999999:\n print(n - n % 100000)\nelif n <= 9999999:\n print(n - n % 1000000)\nelif n <= 99999999:\n print(n - n % 10000000)\nelse:\n print(n - n % 100000000)", "n = int(input())\n\nif n <= 999:\n print(n)\nelif n <= 9999:\n print(n - n % 1000)\nelif n <= 99999:\n print(n - n % 10000)\nelif n <= 999999:\n print(n - n % 100000)\nelif n <= 9999999:\n print(n - n % 1000000)\nelif n <= 99999999:\n print(n - n % 10000000)\nelse:\n print(n - n % 100000000)", "n = int(input())\n\nif n <= 999:\n print(n)\nelif n <= 9999:\n print(n - n % 1000)\nelif n <= 99999:\n print(n - n % 10000)\nelif n <= 999999:\n print(n - n % 100000)\nelif n <= 9999999:\n print(n - n % 1000000)\nelif n <= 99999999:\n print(n - n % 10000000)\nelse:\n print(n - n % 100000000)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, d = map(int, input().split())\nxy = [list(map(int, input().split())) for _ in range(n)]\n\nfor i in range(n):\n xy[i].append(i)\n\nxy.sort(key=lambda x: x[0])\n\nans = [False] * n\nans[0] = True\n\nfor i in range(n):\n for j in range(i + 1, n):\n if (xy[i][0] - xy[j][0]) ** 2 + (xy[i][1] - xy[j][1]) ** 2 <= d ** 2:\n ans[xy[j][2]] = True\n\nfor i in ans:\n print(\"Yes\" if i else \"No\")", "n, d = map(int, input().split())\nxy = [list(map(int, input().split())) for _ in range(n)]\n\nfrom math import sqrt\n\nfor i in range(n):\n for j in range(n):\n if sqrt((xy[i][0] - xy[j][0]) ** 2 + (xy[i][1] - xy[j][1]) ** 2) <= d:\n xy[i][2] = 1\n break\n\nfor i in range(n):\n if xy[i][2]:\n print(\"Yes\")\n else:\n print(\"No\")", "n, d = map(int, input().split())\nxy = [list(map(int, input().split())) for _ in range(n)]\n\ninfected = [False] * n\ninfected[0] = True\n\nfor i in range(n):\n for j in range(n):\n if i != j and (xy[i][0] - xy[j][0]) ** 2 + (xy[i][1] - xy[j][1]) ** 2 <= d ** 2:\n infected[j] = True\n\nfor i in infected:\n print(\"Yes\" if i else \"No\")", "import sys\n\ninput = sys.stdin.readline\n\nN, D = map(int, input().split())\nXY = [list(map(int, input().split())) for i in range(N)]\n\nans = [False] * N\nans[0] = True\n\nfor i in range(N):\n for j in range(N):\n if i == j:\n continue\n if (XY[i][0] - XY[j][0]) ** 2 + (XY[i][1] - XY[j][1]) ** 2 <= D ** 2:\n ans[j] = True\n\nfor i in ans:\n print(\"Yes\" if i else \"No\")", "n, d = map(int, input().split())\nxy = [list(map(int, input().split())) for _ in range(n)]\n\ninfected = [False] * n\ninfected[0] = True\n\nfor i in range(n):\n for j in range(n):\n if i != j and (xy[i][0] - xy[j][0]) ** 2 + (xy[i][1] - xy[j][1]) ** 2 <= d ** 2:\n infected[j] = True\n\nfor i in infected:\n print(\"Yes\" if i else \"No\")", "import sys\nfrom math import sqrt\n\ninput = sys.stdin.readline\n\nN, D = map(int, input().split())\n\nX = []\nY = []\n\nfor i in range(N):\n x, y = map(int, input().split())\n X.append(x)\n Y.append(y)\n\ninfected = [False] * N\ninfected[0] = True\n\nfor i in range(N):\n for j in range(N):\n if sqrt((X[i] - X[j]) ** 2 + (Y[i] - Y[j]) ** 2) <= D:\n infected[j] = True\n\nfor i in infected:\n if i:\n print(\"Yes\")\n else:\n print(\"No\")", "import sys\nfrom math import sqrt\n\ninput = sys.stdin.readline\n\nN, D = map(int, input().split())\n\nX = []\nY = []\nfor i in range(N):\n x, y = map(int, input().split())\n X.append(x)\n Y.append(y)\n\ninfected = [False] * N\ninfected[0] = True\n\nfor i in range(N):\n for j in range(N):\n if sqrt((X[i] - X[j]) ** 2 + (Y[i] - Y[j]) ** 2) <= D and (not infected[j]):\n infected[j] = True\n\nfor i in infected:\n if i:\n print(\"Yes\")\n else:\n print(\"No\")", "import sys\n\ninput = sys.stdin.readline\n\nN, D = map(int, input().split())\n\nX = []\nY = []\nfor i in range(N):\n x, y = map(int, input().split())\n X.append(x)\n Y.append(y)\n\nINF = 10**9\ndist = [[INF] * N for i in range(N)]\nfor i in range(N):\n for j in range(i + 1, N):\n dx = X[i] - X[j]\n dy = Y[i] - Y[j]\n dist[i][j] = dist[j][i] = int((dx * dx + dy * dy) ** 0.5)\n\nfor i in range(N):\n dist[i][i] = 0\n\nfor i in range(N):\n for j in range(N):\n for k in range(N):\n dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k])\n\nfor i in range(1, N):\n if dist[0][i] <= D:\n print(\"Yes\")\n else:\n print(\"No\")", "n, d = map(int, input().split())\nxy = [list(map(int, input().split())) for _ in range(n)]\n\nfor i in range(n):\n for j in range(n):\n if i != j and (xy[i][0] - xy[j][0]) ** 2 + (xy[i][1] - xy[j][1]) ** 2 <= d ** 2:\n xy[j][0] = -1\n\nfor i in range(n):\n if xy[i][0] == -1:\n print(\"Yes\")\n else:\n print(\"No\")", "n, d = map(int, input().split())\r\nxy = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n\r\ndef dist(x1, y1, x2, y2):\r\n return ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\r\n\r\n\r\ndef bfs(s):\r\n q = [(s, 0)]\r\n visited = [False] * n\r\n visited[s] = True\r\n while q:\r\n v, c = q.pop(0)\r\n for i in range(n):\r\n if not visited[i] and dist(xy[v][0], xy[v][1], xy[i][0], xy[i][1]) <= d:\r\n visited[i] = True\r\n q.append((i, c + 1))\r\n return visited\r\n\r\n\r\nans = bfs(0)\r\nfor i in ans:\r\n print(\"Yes\" if i else \"No\")\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from sys import stdin\n\ninput = stdin.readline\n\n\ndef main():\n (w, h) = map(int, input().split())\n n = int(input())\n p = [tuple(map(int, input().split())) for _ in range(n)]\n a = int(input())\n x = list(map(int, input().split()))\n b = int(input())\n y = list(map(int, input().split()))\n x.sort()\n y.sort()\n x = [0] + x + [w]\n y = [0] + y + [h]\n cnt = [0] * (a + 2)\n for i in range(n):\n j = bisect_left(x, p[i][0])\n cnt[j] += 1\n ans = [0, 1]\n for i in range(1, a + 1):\n ans[0] += min(cnt[i], cnt[i - 1])\n ans[1] += max(cnt[i], cnt[i - 1])\n print(*ans)\n\n\ndef bisect_left(a, x):\n \"Find the first index i where a[i] >= x.\"\n lo = 0\n hi = len(a)\n while lo < hi:\n mid = (lo + hi) // 2\n if a[mid] < x:\n lo = mid + 1\n else:\n hi = mid\n return lo\n\n\nmain()", "from sys import stdin\n\ninput = stdin.readline\n\n\ndef main():\n w, h = map(int, input().split())\n n = int(input())\n p = []\n q = []\n for _ in range(n):\n x, y = map(int, input().split())\n p.append(x)\n q.append(y)\n p.sort()\n q.sort()\n a = int(input())\n a_list = list(map(int, input().split()))\n b = int(input())\n b_list = list(map(int, input().split()))\n a_list.sort()\n b_list.sort()\n a_dict = {}\n b_dict = {}\n for i in range(a):\n a_dict[a_list[i]] = i\n for i in range(b):\n b_dict[b_list[i]] = i\n p_dict = {}\n q_dict = {}\n for i in range(n):\n if p[i] not in p_dict:\n p_dict[p[i]] = [i, i]\n else:\n p_dict[p[i]][0] = i\n if q[i] not in q_dict:\n q_dict[q[i]] = [i, i]\n else:\n q_dict[q[i]][1] = i\n ans = [0, 1]\n for i in range(n):\n x = p_dict[p[i]][0]\n y = q_dict[q[i]][1]\n if x <= y:\n ans[1] = max(ans[1], y - x + 1)\n else:\n ans[0] = max(ans[0], x - y)\n print(ans[0], ans[1])\n\n\nmain()", "from sys import stdin\n\ninput = stdin.readline\n(w, h) = map(int, input().split())\nn = int(input())\nstrawberries = [tuple(map(int, input().split())) for _ in range(n)]\na = int(input())\na_cuts = list(map(int, input().split()))\nb = int(input())\nb_cuts = list(map(int, input().split()))\na_cuts.append(w)\nb_cuts.append(h)\na_cuts.sort()\nb_cuts.sort()\nstrawberries.sort(key=lambda x: (x[0], x[1]))\na_cuts_idx = [0] * (a + 1)\nb_cuts_idx = [0] * (b + 1)\nfor i, (x, y) in enumerate(strawberries):\n a_cuts_idx[bisect_left(a_cuts, x)] += 1\n b_cuts_idx[bisect_left(b_cuts, y)] += 1\nm = max(a_cuts_idx[1:-1]) * max(b_cuts_idx[1:-1])\nM = sum(a_cuts_idx[1:-1]) * sum(b_cuts_idx[1:-1])\nfor i in range(1, a):\n for j in range(1, b):\n m = min(m, a_cuts_idx[i] * b_cuts_idx[j])\n M = max(M, a_cuts_idx[i] * b_cuts_idx[j])\nprint(m, M)", "from sys import stdin\n\ninput = stdin.readline\n(w, h) = map(int, input().split())\nn = int(input())\nstrawberries = [list(map(int, input().split())) for _ in range(n)]\na = int(input())\na_list = list(map(int, input().split()))\nb = int(input())\nb_list = list(map(int, input().split()))\na_list.append(w)\nb_list.append(h)\na_list.sort()\nb_list.sort()\nstrawberries.sort(key=lambda x: (x[0], x[1]))\n(left, right) = (0, 0)\n(min_strawberries, max_strawberries) = (n, 0)\nfor i in range(n):\n if strawberries[i][0] > left:\n min_strawberries -= right\n right = 0\n left = strawberries[i][0]\n right += 1\nfor i in range(n):\n if strawberries[i][1] > left:\n max_strawberries = max(max_strawberries, right)\n right = 0\n left = strawberries[i][1]\n right += 1\nprint(max(0, min_strawberries - 1), max_strawberries)", "from sys import stdin\n\ninput = stdin.readline\n\n\ndef main():\n w, h = map(int, input().split())\n n = int(input())\n p = [tuple(map(int, input().split())) for _ in range(n)]\n a = int(input())\n x = list(map(int, input().split()))\n b = int(input())\n y = list(map(int, input().split()))\n x.sort()\n y.sort()\n x.insert(0, 0)\n x.append(w)\n y.insert(0, 0)\n y.append(h)\n cnt = [0] * (a + 1)\n for i in range(n):\n j = bisect_left(x, p[i][0])\n k = bisect_right(x, p[i][0])\n cnt[j] += 1\n cnt[k] -= 1\n for i in range(1, a + 1):\n cnt[i] += cnt[i - 1]\n c = [0] * (b + 1)\n for i in range(n):\n j = bisect_left(y, p[i][1])\n k = bisect_right(y, p[i][1])\n c[j] += cnt[bisect_left(x, p[i][0])]\n c[k] -= cnt[bisect_left(x, p[i][0])]\n for i in range(1, b + 1):\n c[i] += c[i - 1]\n print(min(c), max(c))\n\n\ndef bisect_left(a, x):\n \"Find the first index i of the leftmost item in a such that a[i] >= x.\"\n lo = 0\n hi = len(a)\n while lo < hi:\n mid = (lo + hi) // 2\n if x <= a[mid]:\n hi = mid\n else:\n lo = mid + 1\n return lo\n\n\ndef bisect_right(a, x):\n \"Find the first index i of the rightmost item in a such that a[i] <= x.\"\n lo = 0\n hi = len(a)\n while lo < hi:\n mid = (lo + hi) // 2\n if a[mid] <= x:\n lo = mid + 1\n else:\n hi = mid\n return lo\n\n\nmain()", "from sys import stdin\n\ninput = stdin.readline\n(w, h) = map(int, input().split())\nn = int(input())\nstrawberries = [tuple(map(int, input().split())) for _ in range(n)]\na = int(input())\na_line = sorted(map(int, input().split()))\nb = int(input())\nb_line = sorted(map(int, input().split()))\na_line.append(w)\nb_line.append(h)\na_line = [0] + a_line\nb_line = [0] + b_line\nstrawberries.sort(key=lambda x: (x[0], x[1]))\na_line_idx = 0\nb_line_idx = 0\nmin_strawberries = 0\nmax_strawberries = 0\nwhile a_line_idx < len(a_line) and b_line_idx < len(b_line):\n if strawberries[min_strawberries][0] >= a_line[a_line_idx]:\n a_line_idx += 1\n elif strawberries[min_strawberries][1] >= b_line[b_line_idx]:\n b_line_idx += 1\n else:\n min_strawberries += 1\n max_strawberries += 1\nprint(min_strawberries, max_strawberries)", "import sys\n\ninput = sys.stdin.readline\n(W, H) = map(int, input().split())\nN = int(input())\nP = [tuple(map(int, input().split())) for _ in range(N)]\nA = int(input())\na = list(map(int, input().split()))\nB = int(input())\nb = list(map(int, input().split()))\na.append(W)\nb.append(H)\na.sort()\nb.sort()\nP.sort(key=lambda p: (p[0], -p[1]))\nQ = []\nfor p, q in P:\n while Q and Q[-1][1] > q:\n Q.pop()\n Q.append((p, q))\nP = []\nfor p, q in Q:\n P.append(p)\nQ = []\nfor p, q in P[::-1]:\n while Q and Q[-1][1] > q:\n Q.pop()\n Q.append((p, q))\nP = Q[::-1]\nQ = []\nfor p, q in P:\n while Q and Q[-1][0] > p:\n x = Q.pop()\n if x[1] > q:\n Q.append(x)\n break\n Q.append((p, q))\nP = []\nfor p, q in Q:\n P.append(q)\nQ = []\nfor p, q in P[::-1]:\n while Q and Q[-1][0] > p:\n x = Q.pop()\n if x[1] > q:\n Q.append(x)\n break\n Q.append((p, q))\nP = Q[::-1]\nans = [0, 1]\nfor p, q in zip(a, a[1:]):\n i = bisect_left(P, q)\n ans[0] = max(ans[0], i)\n ans[1] = max(ans[1], len(P) - i)\nfor p, q in zip(b, b[1:]):\n i = bisect_left(P, p)\n ans[0] = max(ans[0], i)\n ans[1] = max(ans[1], len(P) - i)\nprint(*ans)", "from sys import stdin\n\ninput = stdin.readline\n(w, h) = map(int, input().split())\nn = int(input())\nstrawberries = [tuple(map(int, input().split())) for _ in range(n)]\na = int(input())\nx = list(map(int, input().split()))\nb = int(input())\ny = list(map(int, input().split()))\nx.sort()\ny.sort()\nx = [0] + x + [w]\ny = [0] + y + [h]\ngrid = [[0] * (a + 2) for _ in range(b + 2)]\nfor p, q in strawberries:\n grid[bisect_left(y, q)][bisect_left(x, p)] += 1\nans = [0, 0]\nfor i in range(1, b + 1):\n row = [0] * (a + 2)\n for j in range(1, a + 1):\n row[j] = row[j - 1] + grid[i][j]\n ans[0] = max(ans[0], max(row))\n ans[1] = max(ans[1], max(row) - min(row))\nprint(ans[0], ans[1])", "from sys import stdin, stdout\n\ninput = stdin.readline\n\n\ndef main():\n w, h = map(int, input().split())\n n = int(input())\n p, q = [0] * n, [0] * n\n for i in range(n):\n x, y = map(int, input().split())\n p[i], q[i] = x, y\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n a.sort()\n b.sort()\n m, M = 0, 0\n for i in range(n):\n x, y = p[i], q[i]\n cnt = 0\n for j in range(len(a)):\n if a[j] < x:\n cnt += 1\n for j in range(len(b)):\n if b[j] < y:\n cnt += 1\n m, M = max(m, cnt), min(M, cnt)\n print(m, M)\n\n\nmain()", "from sys import stdin\n\ninput = stdin.readline\n(w, h) = map(int, input().split())\nn = int(input())\nstrawberries = [tuple(map(int, input().split())) for _ in range(n)]\na = int(input())\na_list = list(map(int, input().split()))\nb = int(input())\nb_list = list(map(int, input().split()))\na_list.append(w)\nb_list.append(h)\na_list.sort()\nb_list.sort()\nx_count = [0] * (a + 1)\ny_count = [0] * (b + 1)\nfor x, y in strawberries:\n idx_x = 0\n idx_y = 0\n for i in range(a):\n if a_list[i] > x:\n break\n idx_x += 1\n for i in range(b):\n if b_list[i] > y:\n break\n idx_y += 1\n x_count[idx_x] += 1\n y_count[idx_y] += 1\nmin_strawberries = min(x_count)\nmax_strawberries = max(x_count)\nfor i in range(1, b):\n min_strawberries += min(y_count[i - 1], y_count[i])\n max_strawberries += max(y_count[i - 1], y_count[i])\nprint(min_strawberries, max_strawberries)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import defaultdict\n\nn, m = map(int, input().split())\ngraph = defaultdict(set)\nfor _ in range(m):\n u, v = map(int, input().split())\n graph[u].add(v)\n graph[v].add(u)\n\nk = int(input())\nbad_pairs = set()\nfor _ in range(k):\n x, y = map(int, input().split())\n bad_pairs.add(frozenset([x, y]))\n\nq = int(input())\nfor _ in range(q):\n p, q = map(int, input().split())\n if frozenset([p, q]) in bad_pairs:\n print(\"No\")\n elif p in graph[q] or q in graph[p]:\n print(\"Yes\")\n else:\n for node in graph[p]:\n if q in graph[node]:\n print(\"No\")\n break\n else:\n print(\"Yes\")", "from collections import deque\n\nn, m = map(int, input().split())\ngraph = [[] for _ in range(n + 1)]\nfor _ in range(m):\n u, v = map(int, input().split())\n graph[u].append(v)\n graph[v].append(u)\n\nk = int(input())\nbad_pairs = [tuple(map(int, input().split())) for _ in range(k)]\n\nq = int(input())\nqueries = [tuple(map(int, input().split())) for _ in range(q)]\n\n\ndef bfs(start, end):\n queue = deque([start])\n visited = {start}\n while queue:\n node = queue.popleft()\n for neighbor in graph[node]:\n if neighbor == end:\n return True\n if neighbor not in visited:\n visited.add(neighbor)\n queue.append(neighbor)\n return False\n\n\nfor p, q in queries:\n for x, y in bad_pairs:\n if bfs(x, p) and bfs(q, y):\n print(\"No\")\n break\n else:\n print(\"Yes\")", "import sys\n\ninput = sys.stdin.readline\nfrom collections import deque\n\nN, M = list(map(int, input().split()))\ngraph = [[] for _ in range(N)]\nfor _ in range(M):\n u, v = list(map(int, input().split()))\n u -= 1\n v -= 1\n graph[u].append(v)\n graph[v].append(u)\n\nK = int(input())\nbad_pairs = [list(map(int, input().split())) for _ in range(K)]\n\nQ = int(input())\nqueries = [list(map(int, input().split())) for _ in range(Q)]\n\n\ndef bfs(start):\n visited = [False] * N\n queue = deque([start])\n visited[start] = True\n while queue:\n node = queue.popleft()\n for next_node in graph[node]:\n if not visited[next_node]:\n visited[next_node] = True\n queue.append(next_node)\n return visited\n\n\nvisited_lists = []\nfor x, y in bad_pairs:\n x -= 1\n y -= 1\n visited_lists.append(bfs(x) + bfs(y))\n\nfor p, q in queries:\n p -= 1\n q -= 1\n for visited_list in visited_lists:\n if visited_list[p] and visited_list[q]:\n print(\"No\")\n break\n else:\n print(\"Yes\")", "from collections import deque\n\nn, m = map(int, input().split())\ngraph = [[] for _ in range(n + 1)]\nfor _ in range(m):\n u, v = map(int, input().split())\n graph[u].append(v)\n graph[v].append(u)\n\nk = int(input())\nbad_pairs = [list(map(int, input().split())) for _ in range(k)]\n\nq = int(input())\nqueries = [list(map(int, input().split())) for _ in range(q)]\n\n\ndef bfs(start, end):\n visited = [False] * (n + 1)\n queue = deque([start])\n visited[start] = True\n while queue:\n node = queue.popleft()\n for neighbor in graph[node]:\n if neighbor == end:\n return True\n if not visited[neighbor]:\n visited[neighbor] = True\n queue.append(neighbor)\n return False\n\n\nfor p, q in queries:\n for x, y in bad_pairs:\n if bfs(x, p) and bfs(y, q):\n print(\"No\")\n break\n else:\n print(\"Yes\")", "from collections import defaultdict\n\nn, m = map(int, input().split())\ngraph = defaultdict(set)\nfor _ in range(m):\n u, v = map(int, input().split())\n graph[u].add(v)\n graph[v].add(u)\n\nk = int(input())\nbad_pairs = set()\nfor _ in range(k):\n x, y = map(int, input().split())\n bad_pairs.add((x, y))\n\nq = int(input())\nfor _ in range(q):\n p, q = map(int, input().split())\n if (p, q) in bad_pairs or (q, p) in bad_pairs:\n print(\"No\")\n else:\n print(\"Yes\")", "from collections import deque\n\nn, m = map(int, input().split())\ngraph = [[] for _ in range(n)]\nfor _ in range(m):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n graph[u].append(v)\n graph[v].append(u)\n\nk = int(input())\nbad_pairs = [tuple(map(int, input().split())) for _ in range(k)]\n\nq = int(input())\nqueries = [tuple(map(int, input().split())) for _ in range(q)]\n\n\ndef bfs(start, end):\n queue = deque([start])\n visited = [False] * n\n visited[start] = True\n while queue:\n node = queue.popleft()\n for neighbor in graph[node]:\n if neighbor == end:\n return True\n if not visited[neighbor]:\n visited[neighbor] = True\n queue.append(neighbor)\n return False\n\n\nfor p, q in queries:\n p -= 1\n q -= 1\n if any(bfs(pair[0] - 1, pair[1] - 1) for pair in bad_pairs if pair[0] in (p, q) and pair[1] in (p, q)):\n print(\"No\")\n else:\n print(\"Yes\")", "from collections import deque\n\nn, m = map(int, input().split())\ngraph = [[] for _ in range(n + 1)]\nfor _ in range(m):\n u, v = map(int, input().split())\n graph[u].append(v)\n graph[v].append(u)\n\nk = int(input())\nbad_pairs = [tuple(map(int, input().split())) for _ in range(k)]\n\nq = int(input())\nqueries = [tuple(map(int, input().split())) for _ in range(q)]\n\n\ndef bfs(start, end):\n visited = [False] * (n + 1)\n queue = deque([start])\n visited[start] = True\n while queue:\n node = queue.popleft()\n for neighbor in graph[node]:\n if neighbor == end:\n return True\n if not visited[neighbor]:\n visited[neighbor] = True\n queue.append(neighbor)\n return False\n\n\nfor p, q in queries:\n for x, y in bad_pairs:\n if (x == p and y == q) or (x == q and y == p):\n print(\"No\")\n break\n if bfs(x, p) and bfs(y, q):\n print(\"No\")\n break\n else:\n print(\"Yes\")", "import sys\n\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\n\ngraph = [[] for _ in range(N)]\n\nfor _ in range(M):\n u, v = map(int, input().split())\n u, v = u - 1, v - 1\n graph[u].append(v)\n graph[v].append(u)\n\nK = int(input())\n\nbad_pairs = [tuple(map(int, input().split())) for _ in range(K)]\n\nQ = int(input())\n\nqueries = [tuple(map(int, input().split())) for _ in range(Q)]\n\n\ndef dfs(v, prev, color):\n visited[v] = True\n color_map[v] = color\n for nv in graph[v]:\n if not visited[nv]:\n dfs(nv, v, -color)\n elif color_map[nv] == color:\n return True\n return False\n\n\ndef has_path(u, v):\n global color_map, visited\n visited = [False] * N\n color_map = [0] * N\n return dfs(u, -1, 1)\n\n\nfor p, q in bad_pairs:\n p, q = p - 1, q - 1\n if has_path(p, q):\n print(\"No\")\n exit()\n\nfor p, q in queries:\n p, q = p - 1, q - 1\n if has_path(p, q):\n print(\"No\")\n else:\n print(\"Yes\")", "import sys\nfrom collections import defaultdict\n\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\ngraph = defaultdict(set)\nfor _ in range(M):\n u, v = map(int, input().split())\n graph[u].add(v)\n graph[v].add(u)\n\nK = int(input())\nbad_pairs = set()\nfor _ in range(K):\n x, y = map(int, input().split())\n bad_pairs.add(frozenset([x, y]))\n\nQ = int(input())\nfor _ in range(Q):\n p, q = map(int, input().split())\n if frozenset([p, q]) in bad_pairs:\n print(\"No\")\n elif p in graph[q] or q in graph[p]:\n print(\"Yes\")\n elif any(p in graph[i] and q in graph[i] for i in range(1, N + 1)):\n print(\"No\")\n else:\n print(\"Yes\")", "from collections import deque\n\nn, m = list(map(int, input().split()))\ngraph = [[] for _ in range(n)]\nfor _ in range(m):\n u, v = list(map(int, input().split()))\n u -= 1\n v -= 1\n graph[u].append(v)\n graph[v].append(u)\n\nk = int(input())\nbad_pairs = [list(map(int, input().split())) for _ in range(k)]\n\nq = int(input())\nqueries = [list(map(int, input().split())) for _ in range(q)]\n\n\ndef bfs(start, end):\n queue = deque([start])\n visited = [False] * n\n while queue:\n node = queue.popleft()\n if node == end:\n return True\n if visited[node]:\n continue\n visited[node] = True\n queue.extend(graph[node])\n return False\n\n\nfor pair in bad_pairs:\n x, y = pair\n x -= 1\n y -= 1\n for query in queries:\n p, q = query\n p -= 1\n q -= 1\n if bfs(p, x) and bfs(q, y):\n print(\"No\")\n break\n else:\n print(\"Yes\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\nprint(5 * (n // 5))", "n = int(input())\nprint(5 * (n // 5))", "n = int(input())\nprint(5 * (n // 5))", "n = int(input())\nprint(5 * (n // 5))", "n = int(input())\nprint(5 * (n // 5))", "n = int(input())\nprint(5 * (n // 5))", "n = int(input())\nprint(5 * (n // 5))", "n = int(input())\nprint(5 * (n // 5))", "n = int(input())\nprint(5 * (n + 4) // 5)", "n = int(input())\nprint(5 * (n // 5))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "p, q = input().split()\ndistances = {\"A\": 0, \"B\": 3, \"C\": 4, \"D\": 8, \"E\": 9, \"F\": 14, \"G\": 23}\nprint(abs(distances[q] - distances[p]))", "p, q = input().split()\r\ndist = [3, 1, 4, 1, 5, 9]\r\nd = 0\r\nfor i in range(len(dist)):\r\n if p == \"A\":\r\n d += sum(dist[:i])\r\n break\r\n if p == chr(ord(list(p)[0]) - 1 + i + 65):\r\n d += sum(dist[:i])\r\n break\r\nfor i in range(len(dist)):\r\n if q == \"A\":\r\n d += sum(dist[i:])\r\n break\r\n if q == chr(ord(list(q)[0]) - 1 + i + 65):\r\n d += sum(dist[i:])\r\n break\r\nprint(d)\r", "p, q = input().split()\r\ndist = [3, 1, 4, 1, 5, 9]\r\ndist_sum = 0\r\nfor i in range(len(dist)):\r\n if p == \"A\" and q == \"B\":\r\n print(dist[i])\r\n break\r\n elif p == \"B\" and q == \"A\":\r\n print(dist[i])\r\n break\r\n elif p == \"B\" and q == \"C\":\r\n print(dist[i])\r\n break\r\n elif p == \"C\" and q == \"B\":\r\n print(dist[i])\r\n break\r\n elif p == \"C\" and q == \"D\":\r\n print(dist[i])\r\n break\r\n elif p == \"D\" and q == \"C\":\r\n print(dist[i])\r\n break\r\n elif p == \"D\" and q == \"E\":\r\n print(dist[i])\r\n break\r\n elif p == \"E\" and q == \"D\":\r\n print(dist[i])\r\n break\r\n elif p == \"E\" and q == \"F\":\r\n print(dist[i])\r\n break\r\n elif p == \"F\" and q == \"E\":\r\n print(dist[i])\r\n break\r\n elif p == \"F\" and q == \"G\":\r\n print(dist[i])\r\n break\r\n elif p == \"G\" and q == \"F\":\r\n print(dist[i])\r\n break\r\n dist_sum += dist[i]\r\n if p == \"A\":\r\n p = \"B\"\r\n elif p == \"B\":\r\n p = \"C\"\r\n elif p == \"C\":\r\n p = \"D\"\r\n elif p == \"D\":\r\n p = \"E\"\r\n elif p == \"E\":\r\n p = \"F\"\r\n elif p == \"F\":\r\n p = \"G\"\r", "p, q = map(str, input().split())\nd = {\"A\": 0, \"B\": 3, \"C\": 4, \"D\": 8, \"E\": 9, \"F\": 14, \"G\": 23}\nprint(abs(d[p] - d[q]))", "p, q = input().split()\ndist = [3, 1, 4, 1, 5, 9]\r\nans = 0\r\nfor i in range(len(dist)):\r\n if p == \"A\" and q == \"B\":\r\n ans = dist[i]\r\n break\r\n elif p == \"B\" and q == \"A\":\r\n ans = dist[i]\r\n break\r\n elif p == \"B\" and q == \"C\":\r\n ans = dist[i]\r\n break\r\n elif p == \"C\" and q == \"B\":\r\n ans = dist[i]\r\n break\r\n elif p == \"C\" and q == \"D\":\r\n ans = dist[i]\r\n break\r\n elif p == \"D\" and q == \"C\":\r\n ans = dist[i]\r\n break\r\n elif p == \"D\" and q == \"E\":\r\n ans = dist[i]\r\n break\r\n elif p == \"E\" and q == \"D\":\r\n ans = dist[i]\r\n break\r\n elif p == \"E\" and q == \"F\":\r\n ans = dist[i]\r\n break\r\n elif p == \"F\" and q == \"E\":\r\n ans = dist[i]\r\n break\r\n elif p == \"F\" and q == \"G\":\r\n ans = dist[i]\r\n break\r\n elif p == \"G\" and q == \"F\":\r\n ans = dist[i]\r\n break\r\n if p == \"A\" and q != \"B\":\r\n ans += dist[i]\r\n elif p == \"B\" and q != \"A\" and q != \"C\":\r\n ans += dist[i]\r\n elif p == \"C\" and q != \"B\" and q != \"D\":\r\n ans += dist[i]\r\n elif p == \"D\" and q != \"C\" and q != \"E\":\r\n ans += dist[i]\r\n elif p == \"E\" and q != \"D\" and q != \"F\":\r\n ans += dist[i]\r\n elif p == \"F\" and q != \"E\" and q != \"G\":\r\n ans += dist[i]\r\n elif p == \"G\" and q != \"F\":\r\n ans += dist[i]\r\n if q == \"A\" and p != \"B\":\r\n ans += dist[6 - i - 1]\r\n break\r\n elif q == \"B\" and p != \"A\" and p != \"C\":\r\n ans += dist[6 - i - 1]\r\n break\r\n elif q == \"C\" and p != \"B\" and p != \"D\":\r\n ans += dist[6 - i - 1]\r\n break\r\n elif q == \"D\" and p != \"C\" and p != \"E\":\r\n ans += dist[6 - i - 1]\r\n break\r\n elif q == \"E\" and p != \"D\" and p != \"F\":\r\n ans += dist[6 - i - 1]\r\n break\r\n elif q == \"F\" and p != \"E\" and p != \"G\":\r\n ans += dist[6 - i - 1]\r\n break\r\n elif q == \"G\" and p != \"F\":\r\n ans += dist[6 - i - 1]\r\n break\r\nprint(ans)", "p, q = input().split()\r\ndist = [3, 1, 4, 1, 5, 9]\r\ndist_sum = 0\r\nfor i in range(len(dist)):\r\n if p == \"A\":\r\n break\r\n if p == \"B\":\r\n dist_sum += dist[i]\r\n break\r\n dist_sum += dist[i]\r\n if p == \"C\":\r\n break\r\nfor i in range(len(dist) - 1, -1, -1):\r\n if q == \"G\":\r\n break\r\n if q == \"F\":\r\n dist_sum += dist[i]\r\n break\r\n dist_sum += dist[i]\r\n if q == \"E\":\r\n break\r\nprint(dist_sum)\r", "p, q = input().split()\ndist = [3, 1, 4, 1, 5, 9]\r\nans = 0\r\nfor i in range(len(dist)):\r\n if p == \"A\" and q == \"B\":\r\n ans = dist[i]\r\n break\r\n elif p == \"B\" and q == \"A\":\r\n ans = dist[i]\r\n break\r\n elif p == \"B\" and q == \"C\":\r\n ans = dist[i]\r\n break\r\n elif p == \"C\" and q == \"B\":\r\n ans = dist[i]\r\n break\r\n elif p == \"C\" and q == \"D\":\r\n ans = dist[i]\r\n break\r\n elif p == \"D\" and q == \"C\":\r\n ans = dist[i]\r\n break\r\n elif p == \"D\" and q == \"E\":\r\n ans = dist[i]\r\n break\r\n elif p == \"E\" and q == \"D\":\r\n ans = dist[i]\r\n break\r\n elif p == \"E\" and q == \"F\":\r\n ans = dist[i]\r\n break\r\n elif p == \"F\" and q == \"E\":\r\n ans = dist[i]\r\n break\r\n elif p == \"F\" and q == \"G\":\r\n ans = dist[i]\r\n break\r\n elif p == \"G\" and q == \"F\":\r\n ans = dist[i]\r\n break\r\n if p == \"A\" and q != \"B\":\r\n ans += dist[i]\r\n elif p == \"B\" and q != \"A\" and q != \"C\":\r\n ans += dist[i]\r\n elif p == \"C\" and q != \"B\" and q != \"D\":\r\n ans += dist[i]\r\n elif p == \"D\" and q != \"C\" and q != \"E\":\r\n ans += dist[i]\r\n elif p == \"E\" and q != \"D\" and q != \"F\":\r\n ans += dist[i]\r\n elif p == \"F\" and q != \"E\" and q != \"G\":\r\n ans += dist[i]\r\n elif p == \"G\" and q != \"F\":\r\n ans += dist[i]\r\n if q == \"A\" and p != \"B\":\r\n ans = ans - dist[i]\r\n break\r\n elif q == \"B\" and p != \"A\" and p != \"C\":\r\n ans = ans - dist[i]\r\n break\r\n elif q == \"C\" and p != \"B\" and p != \"D\":\r\n ans = ans - dist[i]\r\n break\r\n elif q == \"D\" and p != \"C\" and p != \"E\":\r\n ans = ans - dist[i]\r\n break\r\n elif q == \"E\" and p != \"D\" and p != \"F\":\r\n ans = ans - dist[i]\r\n break\r\n elif q == \"F\" and p != \"E\" and p != \"G\":\r\n ans = ans - dist[i]\r\n break\r\n elif q == \"G\" and p != \"F\":\r\n ans = ans - dist[i]\r\n break\r\nprint(ans)\r", "p, q = input().split()\r\nd = {\"A\": 0, \"B\": 3, \"C\": 4, \"D\": 8, \"E\": 9, \"F\": 14, \"G\": 23}\r\nprint(abs(d[p] - d[q]))", "p, q = input().split()\r\ndistances = {\"A\": 0, \"B\": 3, \"C\": 4, \"D\": 8, \"E\": 9, \"F\": 14, \"G\": 23}\r\nprint(abs(distances[p] - distances[q]))", "p, q = input().split()\r\nd = {\"A\": 0, \"B\": 3, \"C\": 4, \"D\": 8, \"E\": 9, \"F\": 14, \"G\": 23}\r\nprint(abs(d[p] - d[q]))" ], "pass1_list": [ true, false, false, true, false, false, false, true, true, true ], "metadata_list": [] }, { "code_list": [ "h, w = map(int, input().split())\na = []\nfor i in range(h):\n a.append(input())\nfor i in range(1, h - 1):\n for j in range(1, w - 1):\n if a[i][j] == \".\" and a[i - 1][j - 1] == \"#\" and a[i - 1][j] == \"#\" and a[i - 1][j + 1] == \"#\" and a[i][j - 1] == \"#\" and a[i][j + 1] == \"#\" and a[i + 1][j - 1] == \"#\" and a[i + 1][j] == \"#\" and a[i + 1][j + 1] == \"#\":\n print(i + 1, j + 1)\n exit()", "h, w = map(int, input().split())\na = []\nfor i in range(h):\n a.append(input())\n\nfor i in range(h - 1):\n for j in range(w - 1):\n if a[i][j] == \"#\" and a[i + 1][j] == \"#\" and a[i][j + 1] == \"#\" and a[i + 1][j + 1] == \".\":\n print(i + 1, j + 1)\n exit()\n elif a[i][j] == \"#\" and a[i + 1][j] == \"#\" and a[i][j + 1] == \".\" and a[i + 1][j + 1] == \"#\":\n print(i, j + 1)\n exit()\n elif a[i][j] == \".\" and a[i + 1][j] == \"#\" and a[i][j + 1] == \"#\" and a[i + 1][j + 1] == \"#\":\n print(i + 1, j)\n exit()\n elif a[i][j] == \"#\" and a[i + 1][j] == \".\" and a[i][j + 1] == \"#\" and a[i + 1][j + 1] == \"#\":\n print(i, j)\n exit()", "h, w = map(int, input().split())\r\na = []\r\nfor i in range(h):\r\n a.append(input())\r\nfor i in range(1, h - 1):\r\n for j in range(1, w - 1):\r\n if a[i][j] == '.' and a[i - 1][j - 1] == '#' and a[i - 1][j] == '#' and a[i - 1][j + 1] == '#' and a[i][j - 1] == '#' and a[i][j + 1] == '#' and a[i + 1][j - 1] == '#' and a[i + 1][j] == '#' and a[i + 1][j + 1] == '#':\r\n print(i + 1, j + 1)\r\n exit()\r", "h, w = map(int, input().split())\na = []\nfor i in range(h):\n a.append(input())\n\nfor i in range(1, h - 1):\n for j in range(1, w - 1):\n if a[i][j] == '.' and a[i - 1][j - 1] == '#' and a[i - 1][j] == '#' and a[i - 1][j + 1] == '#' and a[i][j - 1] == '#' and a[i][j + 1] == '#' and a[i + 1][j - 1] == '#' and a[i + 1][j] == '#' and a[i + 1][j + 1] == '#':\n print(i + 1, j + 1)\n exit()", "h, w = map(int, input().split())\r\na = []\r\nfor i in range(h):\r\n a.append(input())\r\nfor i in range(h - 1):\r\n for j in range(w - 1):\r\n if a[i][j] == \"#\" and a[i + 1][j] == \"#\" and a[i][j + 1] == \"#\" and a[i + 1][j + 1] == \"#\":\r\n for x in range(i, h):\r\n for y in range(j, w):\r\n if a[x][y] == \".\":\r\n print(x + 1, y + 1)\r\n exit()\r", "h, w = map(int, input().split())\r\na = []\r\nfor i in range(h):\r\n a.append(input())\r\nfor i in range(h - 1):\r\n for j in range(w - 1):\r\n if a[i][j] == \"#\" and a[i + 1][j] == \"#\" and a[i][j + 1] == \"#\" and a[i + 1][j + 1] == \".\":\r\n print(i + 1, j + 1)\r\n exit()\r\n elif a[i][j] == \"#\" and a[i + 1][j] == \"#\" and a[i][j + 1] == \".\" and a[i + 1][j + 1] == \"#\":\r\n print(i + 1, j + 1)\r\n exit()\r\n elif a[i][j] == \".\" and a[i + 1][j] == \"#\" and a[i][j + 1] == \"#\" and a[i + 1][j + 1] == \"#\":\r\n print(i + 1, j + 1)\r\n exit()\r\n elif a[i][j] == \"#\" and a[i + 1][j] == \".\" and a[i][j + 1] == \"#\" and a[i + 1][j + 1] == \"#\":\r\n print(i + 1, j + 1)\r\n exit()\r", "h, w = map(int, input().split())\na = []\nfor i in range(h):\n a.append(input())\n\nfor i in range(1, h - 1):\n for j in range(1, w - 1):\n if a[i][j] == \".\" and a[i - 1][j - 1] == \"#\" and a[i - 1][j] == \"#\" and a[i - 1][j + 1] == \"#\" and a[i][j - 1] == \"#\" and a[i][j + 1] == \"#\" and a[i + 1][j - 1] == \"#\" and a[i + 1][j] == \"#\" and a[i + 1][j + 1] == \"#\":\n print(i + 1, j + 1)\n exit()", "h, w = map(int, input().split())\r\na = []\r\nfor i in range(h):\r\n a.append(input())\r\nfor i in range(h):\r\n for j in range(w):\r\n if a[i][j] == \".\" and (i > 0 and a[i - 1][j] == \"#\") and (j > 0 and a[i][j - 1] == \"#\") and (\r\n i + 1 < h and a[i + 1][j] == \"#\") and (j + 1 < w and a[i][j + 1] == \"#\"):\r\n print(i + 1, j + 1)\r\n exit()\r", "h, w = map(int, input().split())\n\ngrid = []\nfor i in range(h):\n grid.append(input())\n\nfor i in range(1, h - 1):\n for j in range(1, w - 1):\n if (\n grid[i][j] == \".\"\n and grid[i - 1][j] == \"#\"\n and grid[i + 1][j] == \"#\"\n and grid[i][j - 1] == \"#\"\n and grid[i][j + 1] == \"#\"\n ):\n print(i + 1, j + 1)\n exit()", "import sys\n\ninput = sys.stdin.readline\n\nH, W = map(int, input().split())\n\nS = []\nfor i in range(H):\n S.append(input().rstrip())\n\nfor i in range(H):\n for j in range(W):\n if S[i][j] == \".\":\n continue\n if (\n i + 1 < H\n and j + 1 < W\n and S[i][j + 1] == \"#\"\n and S[i + 1][j] == \"#\"\n and S[i + 1][j + 1] == \"#\"\n ):\n print(i + 1, j + 1)\n return" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = list(map(int, input().split()))\nq = int(input())\n\nsleep = []\nfor i in range(1, n, 2):\n sleep.append((a[i], a[i + 1]))\n\nfor _ in range(q):\n l, r = map(int, input().split())\n ans = 0\n for s, e in sleep:\n if l <= s and e <= r:\n ans += e - s\n elif l <= s and e > r:\n ans += r - s\n elif l < e and s > r:\n ans += e - l\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nA = list(map(int, input().split()))\nQ = int(input())\n\nsleep = []\nfor i in range(1, N, 2):\n sleep.append((A[i], A[i + 1]))\n\nfor _ in range(Q):\n l, r = map(int, input().split())\n ans = 0\n for s, e in sleep:\n if l <= s and e <= r:\n ans += e - s\n elif l <= s and e > r:\n ans += r - s\n elif l < e and s < r:\n ans += e - l\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nA = list(map(int, input().split()))\n\nQ = int(input())\n\nsleep = []\nfor i in range(1, N, 2):\n sleep.append((A[i], A[i + 1]))\n\nfor _ in range(Q):\n l, r = map(int, input().split())\n ans = 0\n for s, e in sleep:\n if l <= s and e <= r:\n ans += e - s\n elif l <= s and e > r:\n ans += r - s\n elif l < e and s < r:\n ans += e - l\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nA = list(map(int, input().split()))\nQ = int(input())\n\nsleep_time = []\nfor i in range(1, N, 2):\n sleep_time.append((A[i], A[i + 1]))\n\nfor i in range(Q):\n l, r = list(map(int, input().split()))\n ans = 0\n for s, e in sleep_time:\n if s >= l and s < r:\n ans += min(e, r) - s\n elif l < s and e < r:\n ans += e - s\n print(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nq = int(input())\r\n\r\nsleep_time = []\r\nfor i in range(1, n, 2):\r\n sleep_time.append((a[i], a[i + 1] - a[i]))\r\n\r\nfor _ in range(q):\r\n l, r = list(map(int, input().split()))\r\n ans = 0\r\n for s, t in sleep_time:\r\n if l <= s <= r:\r\n ans += min(r, s + t) - s\r\n elif l <= s + t <= r:\r\n ans += min(r, s + t) - max(l, s)\r\n print(ans)\r", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nA = list(map(int, input().split()))\nQ = int(input())\n\nsleep = []\nfor i in range(N // 2):\n sleep.append((A[2 * i + 1] - A[2 * i], i))\n\nsleep.sort()\n\nBIT = [0] * (N // 2)\n\n\ndef update(i, x):\n while i < N // 2:\n BIT[i] += x\n i += i & -i\n\n\ndef get(i):\n res = 0\n while i > 0:\n res += BIT[i - 1]\n i -= i & -i\n return res\n\n\nfor i in range(N // 2):\n update(sleep[i][1], sleep[i][0])\n\nfor _ in range(Q):\n l, r = map(int, input().split())\n ans = 0\n if l == 0:\n ans = get(r // 2)\n else:\n ans = get(r // 2) - get((l + 1) // 2 - 1)\n print(ans)", "n = int(input())\na = list(map(int, input().split()))\n\nq = int(input())\n\nans = [0] * q\n\nfor i in range(q):\n l, r = list(map(int, input().split()))\n while r >= a[0]:\n idx = 1\n while idx < n and a[idx] < l:\n idx += 2\n if idx < n and a[idx] <= r:\n ans[i] += a[idx + 1] - a[idx]\n l = a[idx + 1]\n print(ans[i])", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nA = list(map(int, input().split()))\nQ = int(input())\n\nsleep = []\nfor i in range(1, N, 2):\n sleep.append((A[i], A[i + 1]))\n\nfor _ in range(Q):\n l, r = map(int, input().split())\n ans = 0\n for s, e in sleep:\n if l <= s <= r:\n ans += min(r, e) - s\n elif l <= e <= r:\n ans += e - max(l, s)\n print(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nq = int(input())\r\n\r\nsleep_time = []\r\nfor i in range(1, n, 2):\r\n sleep_time.append((a[i], a[i + 1] - a[i]))\r\n\r\nfor _ in range(q):\r\n l, r = map(int, input().split())\r\n ans = 0\r\n for t, s in sleep_time:\r\n if l <= t and t < r:\r\n ans += min(r, t + s) - t\r\n elif l < t + s and t + s <= r:\r\n ans += min(r, t + s) - max(l, t)\r\n print(ans)\r", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nA = list(map(int, input().split()))\nQ = int(input())\n\nsleep = []\nfor i in range(1, N, 2):\n sleep.append((A[i], A[i + 1]))\n\nfor _ in range(Q):\n l, r = list(map(int, input().split()))\n ans = 0\n for s, e in sleep:\n if l <= s and e <= r:\n ans += e - s\n elif l <= s and e > r:\n ans += r - s\n elif l < e and s < r:\n ans += e - l\n print(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\n(n, m, k) = map(int, input().split())\ngraph = [[] for _ in range(n + 1)]\nguards = []\nfor _ in range(m):\n (a, b) = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\nfor _ in range(k):\n (p, h) = map(int, input().split())\n guards.append((p, h))\n\ndist = [-1] * (n + 1)\ndist[guards[0][0]] = 0\nq = deque([guards[0][0]])\nwhile q:\n v = q.popleft()\n for nv in graph[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + 1\n q.append(nv)\n\nguarded = sorted(\n [v for (v, d) in enumerate(dist) if d <= guards[0][1]], key=lambda x: x\n)\n\nprint(len(guarded))\nprint(*guarded)", "from collections import deque\n\n(n, m, k) = map(int, input().split())\ngraph = [[] for _ in range(n + 1)]\nguards = []\nfor _ in range(m):\n (a, b) = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\nfor _ in range(k):\n (p, h) = map(int, input().split())\n guards.append((p, h))\n\ndist = [-1] * (n + 1)\ndist[guards[0][0]] = 0\nq = deque([guards[0][0]])\nwhile q:\n v = q.popleft()\n for nv in graph[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + 1\n q.append(nv)\n\nguarded = sorted(\n [v for (v, d) in enumerate(dist) if any(d <= h for (_, h) in guards)]\n)\nprint(len(guarded))\nprint(*guarded)", "from collections import deque\n\n(n, m, k) = map(int, input().split())\ngraph = [[] for _ in range(n + 1)]\nguards = []\nfor _ in range(m):\n (a, b) = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\nfor _ in range(k):\n (p, h) = map(int, input().split())\n guards.append((p, h))\ndist = [-1] * (n + 1)\ndist[guards[0][0]] = 0\nq = deque([guards[0][0]])\nwhile q:\n v = q.popleft()\n for nv in graph[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + 1\n q.append(nv)\nguarded = sorted(\n [v for (v, d) in enumerate(dist) if any(d <= h for (_, h) in guards)]\n)\nprint(len(guarded))\nprint(*guarded)", "import sys\nfrom collections import deque\n\ninput = sys.stdin.readline\n\nN, M, K = map(int, input().split())\n\ngraph = [[] for _ in range(N + 1)]\nguards = []\n\nfor _ in range(M):\n a, b = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\n\nfor _ in range(K):\n p, h = map(int, input().split())\n guards.append((p, h))\n\ndist = [-1] * (N + 1)\ndist[guards[0][0]] = 0\n\nq = deque([guards[0][0]])\n\nwhile q:\n now = q.popleft()\n for i in graph[now]:\n if dist[i] == -1:\n dist[i] = dist[now] + 1\n q.append(i)\n\nans = []\nfor i in range(1, N + 1):\n for p, h in guards:\n if dist[i] <= h:\n ans.append(i)\n break\n\nans.sort()\n\nprint(len(ans))\nprint(*ans)", "import sys\nfrom collections import deque\n\ninput = sys.stdin.readline\n\nN, M, K = map(int, input().split())\n\ngraph = [[] for _ in range(N + 1)]\nguards = []\n\nfor _ in range(M):\n a, b = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\n\nfor _ in range(K):\n p, h = map(int, input().split())\n guards.append((p, h))\n\ndist = [float(\"inf\")] * (N + 1)\nq = deque()\n\nfor p, h in guards:\n dist[p] = 0\n q.append(p)\n\nwhile q:\n v = q.popleft()\n for nv in graph[v]:\n if dist[nv] > dist[v] + 1:\n dist[nv] = dist[v] + 1\n q.append(nv)\n\nguarded = sorted([v for v in range(1, N + 1) if dist[v] <= h])\n\nprint(len(guarded))\nprint(*guarded)", "import sys\nfrom collections import deque\n\ninput = sys.stdin.readline\n\nN, M, K = map(int, input().split())\n\ngraph = [[] for _ in range(N + 1)]\nguards = []\n\nfor _ in range(M):\n a, b = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\n\nfor _ in range(K):\n p, h = map(int, input().split())\n guards.append((p, h))\n\ndist = [-1] * (N + 1)\ndist[guards[0][0]] = 0\n\nq = deque([guards[0][0]])\n\nwhile q:\n now = q.popleft()\n for i in graph[now]:\n if dist[i] == -1:\n dist[i] = dist[now] + 1\n q.append(i)\n\nans = []\nfor i in range(1, N + 1):\n for j in range(K):\n if dist[i] <= guards[j][1]:\n ans.append(i)\n break\n\nans.sort()\n\nprint(len(ans))\nprint(*ans)", "from collections import deque\n\n(n, m, k) = map(int, input().split())\ngraph = [[] for _ in range(n + 1)]\nguards = []\nfor _ in range(m):\n (a, b) = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\nfor _ in range(k):\n (p, h) = map(int, input().split())\n guards.append((p, h))\ndistances = [-1] * (n + 1)\ndistances[guards[0][0]] = 0\nq = deque([guards[0][0]])\nwhile q:\n v = q.popleft()\n for u in graph[v]:\n if distances[u] == -1:\n distances[u] = distances[v] + 1\n q.append(u)\nguarded = sorted(\n [v for v in range(1, n + 1) if any(0 <= distances[v] <= h for (p, h) in guards)]\n)\nprint(len(guarded))\nprint(*guarded)", "from collections import deque\n\n(n, m, k) = map(int, input().split())\ngraph = [[] for _ in range(n + 1)]\nguards = []\nfor _ in range(m):\n (a, b) = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\nfor _ in range(k):\n (p, h) = map(int, input().split())\n guards.append((p, h))\n\ndistances = [-1] * (n + 1)\nq = deque()\nfor p, h in guards:\n distances[p] = 0\n q.append(p)\nwhile q:\n v = q.popleft()\n for u in graph[v]:\n if distances[u] == -1:\n distances[u] = distances[v] + 1\n q.append(u)\n\nguarded = sorted([v for v in range(1, n + 1) if distances[v] != -1])\nprint(len(guarded))\nprint(*guarded)", "from collections import deque\n\n(n, m, k) = map(int, input().split())\ngraph = [[] for _ in range(n + 1)]\nguards = []\nfor _ in range(m):\n (a, b) = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\nfor _ in range(k):\n (p, h) = map(int, input().split())\n guards.append((p, h))\n\ndist = [n + 1] * (n + 1)\nfor p, h in guards:\n dist[p] = 0\nq = deque([p for (p, h) in guards])\nwhile q:\n v = q.popleft()\n for u in graph[v]:\n if dist[u] > dist[v] + 1:\n dist[u] = dist[v] + 1\n q.append(u)\n\nguarded = sorted([v for v in range(1, n + 1) if dist[v] <= h])\nprint(len(guarded))\nprint(\" \".join(map(str, guarded)))", "from collections import deque\n\n(n, m, k) = map(int, input().split())\ngraph = [[] for _ in range(n + 1)]\nguards = []\nfor _ in range(m):\n (a, b) = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\nfor _ in range(k):\n (p, h) = map(int, input().split())\n guards.append((p, h))\n\ndist = [n + 1] * (n + 1)\nfor p, h in guards:\n dist[p] = 0\n q = deque([p])\n while q:\n v = q.popleft()\n for u in graph[v]:\n if dist[u] > dist[v] + 1:\n dist[u] = dist[v] + 1\n q.append(u)\n\nguarded = sorted([v for v in range(1, n + 1) if dist[v] <= h])\nprint(len(guarded))\nprint(*guarded)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ns = input()\nfor i in range(n):\n print(s[i], s[i], sep=\"\", end=\"\")", "n = int(input())\ns = input()\n\nfor i in range(n):\n print(s[i], s[i], end=\"\")", "n = int(input())\ns = input()\nans = \"\"\nfor i in range(n):\n ans += s[i] * 2\nprint(ans)", "n = int(input())\ns = input()\nans = \"\"\nfor i in range(n):\n ans += s[i] * 2\nprint(ans)", "n = int(input())\ns = input()\nfor i in range(n):\n print(s[i], s[i], end=\"\")", "n = int(input())\ns = input()\n\nprint(s + s)", "n = int(input())\ns = input()\n\nfor i in range(n):\n print(s[i], s[i], sep=\"\", end=\"\")", "n = int(input())\ns = input()\nans = \"\"\nfor i in range(n):\n ans += s[i] * 2\nprint(ans)", "n = int(input())\ns = input()\nans = \"\"\nfor i in range(n):\n ans += s[i] * 2\nprint(ans)", "n = int(input())\ns = input()\n\nfor i in range(n):\n print(s[i] * 2, end=\"\")" ], "pass1_list": [ true, false, true, true, false, false, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "a = list(map(int, input().split()))\nprint(sum(2**i * x for i, x in enumerate(a)))", "a = list(map(int, input().split()))\nprint(sum(2**i * x for i, x in enumerate(a)))", "a = list(map(int, input().split()))\nprint(sum(2**i * x for i, x in enumerate(a)))", "a = list(map(int, input().split()))\nprint(sum([2**i * x for i, x in enumerate(a)]))", "a = list(map(int, input().split()))\nprint(sum(2**i * x for i, x in enumerate(a)))", "a = list(map(int, input().split()))\nprint(sum(2**i for i in range(64) if a[i]))", "a = list(map(int, input().split()))\nprint(sum(2**i * x for i, x in enumerate(a)))", "a = list(map(int, input().split()))\nprint(sum([2**i * x for i, x in enumerate(a)]))", "a = list(map(int, input().split()))\nprint(sum([2**i * x for i, x in enumerate(a)]))", "a = list(map(int, input().split()))\nprint(sum(2**i * x for i, x in enumerate(a)))" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = list(map(int, input().split()))\nd = {}\nfor i in range(n):\n d[i + 1] = []\nfor i in range(3 * n):\n d[a[i]].append(i + 1)\nans = []\nfor i in d:\n d[i].sort()\n ans.append((d[i][1], i))\nans.sort()\nfor i in ans:\n print(i[1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\nd = {}\nfor i in range(n):\n d[i + 1] = []\nfor i in range(3 * n):\n d[a[i]].append(i + 1)\nans = []\nfor i in d:\n d[i].sort()\n ans.append((d[i][1], i))\nans.sort()\nfor i in ans:\n print(i[1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n d[i + 1] = []\n\nfor i in range(3 * n):\n d[a[i]].append(i)\n\nans = []\nfor i in d:\n d[i].sort()\n ans.append((d[i][1], i))\n\nans.sort()\n\nfor i in range(n):\n print(ans[i][1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n d[i + 1] = []\nfor i in range(3 * n):\n d[a[i]].append(i)\n\nans = []\nfor i in d:\n d[i].sort()\n ans.append((d[i][1], i))\nans.sort()\n\nfor i in range(n):\n print(ans[i][1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n d[i + 1] = []\n\nfor i in range(3 * n):\n d[a[i]].append(i)\n\nans = []\nfor i in d:\n d[i].sort()\n ans.append((d[i][1], i))\n\nans.sort()\nfor i in ans:\n print(i[1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\n\npos = {}\nfor i in range(n):\n pos[i + 1] = []\nfor i in range(3 * n):\n pos[a[i]].append(i)\n\nans = []\nfor i in range(1, n + 1):\n pos[i].sort()\n ans.append((pos[i][1], i))\nans.sort()\n\nfor i in range(n):\n print(ans[i][1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\nd = {}\nfor i in range(n):\n d[i + 1] = []\nfor i in range(3 * n):\n d[a[i]].append(i + 1)\nans = []\nfor i in d:\n d[i].sort()\n ans.append([d[i][1], i])\nans.sort()\nfor i in ans:\n print(i[1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n d[i + 1] = []\nfor i in range(n * 3):\n d[a[i]].append(i + 1)\n\nans = []\nfor i in d:\n d[i].sort()\n ans.append([d[i][1], i])\nans.sort()\n\nfor i in ans:\n print(i[1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n d[i + 1] = []\n\nfor i in range(3 * n):\n d[a[i]].append(i)\n\nans = []\nfor i in range(1, n + 1):\n ans.append([d[i][1], i])\n\nans.sort()\n\nfor i in range(n):\n print(ans[i][1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n d[i + 1] = []\n\nfor i in range(3 * n):\n d[a[i]].append(i + 1)\n\nans = []\nfor i in d:\n d[i].sort()\n ans.append([d[i][1], i])\n\nans.sort()\n\nfor i in range(n):\n print(ans[i][1], end=\" \")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\nx = []\ny = []\nfor i in range(n):\n a, b = map(int, input().split())\n x.append(a)\n y.append(b)\n\nans = 0\n\nif n == 1:\n if x[0] == 1:\n if y[0] > 0:\n ans = y[0]\n else:\n ans = y[0]\n\nelse:\n for i in range(n):\n if x[i] == 1:\n if y[i] > 0:\n ans += y[i]\n if i != n - 1:\n if x[i + 1] == 0:\n if y[i + 1] > 0:\n ans += y[i + 1]\n else:\n break\n else:\n if y[i] > 0:\n ans += y[i]\n\n for i in range(n - 1, -1, -1):\n if x[i] == 1:\n if y[i] > 0:\n ans += y[i]\n if i != 0:\n if x[i - 1] == 0:\n if y[i - 1] > 0:\n ans += y[i - 1]\n else:\n break\n else:\n if y[i] > 0:\n ans += y[i]\n\nprint(ans)", "n = int(input())\nx = []\ny = []\nfor i in range(n):\n x.append(int(input().split()[0]))\n y.append(int(input().split()[1]))\n\nans = 0\n\nif x[0] == 1:\n ans = max(ans, y[0])\nelse:\n ans = 0\n\nfor i in range(1, n):\n if x[i] == 0:\n ans = max(ans, y[i] + y[i - 1])\n elif x[i - 1] == 0:\n ans = max(ans, y[i] + y[i - 1])\n else:\n ans = max(ans, y[i])\n\nprint(ans)", "n = int(input())\nx = []\ny = []\nfor i in range(n):\n x.append(int(input().split()[0]))\n y.append(int(input().split()[1]))\n\nans = 0\n\nif n == 1:\n if x[0] == 0:\n ans = y[0]\nelse:\n for i in range(n - 1, -1, -1):\n if x[i] == 0:\n ans += y[i]\n elif i == n - 1:\n continue\n elif x[i + 1] == 0:\n ans += y[i]\n\nprint(ans)", "n = int(input())\nx = []\ny = []\nfor i in range(n):\n a, b = map(int, input().split())\n x.append(a)\n y.append(b)\n\nans = 0\nsum_ = 0\nfor i in range(n):\n if x[i] == 0:\n if sum_ < 0:\n sum_ = y[i]\n else:\n sum_ += y[i]\n elif sum_ < 0:\n sum_ = y[i]\n ans = max(ans, sum_)\nprint(ans)", "n = int(input())\nx = []\ny = []\nfor i in range(n):\n a, b = map(int, input().split())\n x.append(a)\n y.append(b)\n\nans = 0\n\npoison = 0\nfor i in range(n):\n if x[i] == 0:\n if poison == 0:\n ans += y[i]\n else:\n ans = max(ans, y[i])\n elif poison == 0:\n ans += y[i]\n poison = 1\n else:\n ans = max(ans, 0)\n break\n\nprint(ans)", "n = int(input())\nx = []\ny = []\nfor i in range(n):\n a, b = map(int, input().split())\n x.append(a)\n y.append(b)\n\nans = 0\npoison = 0\nantidote = 0\nfor i in range(n):\n if x[i] == 0:\n if poison == 0:\n antidote += y[i]\n else:\n poison = 0\n ans += y[i]\n elif poison == 0:\n poison = 1\n ans += y[i]\n else:\n pass\n\nprint(ans)", "n = int(input())\nx = []\ny = []\nfor i in range(n):\n a, b = map(int, input().split())\n x.append(a)\n y.append(b)\nans = 0\ns = 0\nfor i in range(n):\n if x[i] == 0:\n s += y[i]\n elif x[i] == 1:\n if s < 0:\n s += y[i]\n else:\n s = y[i]\n if s < 0:\n s = 0\n ans = max(ans, s)\nprint(ans)", "n = int(input())\nx = []\ny = []\nfor i in range(n):\n a, b = map(int, input().split())\n x.append(a)\n y.append(b)\n\nans = 0\ns = 0\nfor i in range(n):\n if x[i] == 0:\n s += y[i]\n else:\n if s < 0:\n s = 0\n else:\n s += y[i]\n ans = max(ans, s)\nprint(ans)", "n = int(input())\nx = []\ny = []\nfor i in range(n):\n a, b = map(int, input().split())\n x.append(a)\n y.append(b)\n\nans = 0\n\npoison = 0\nfor i in range(n):\n if x[i] == 1:\n if poison == 0:\n poison = 1\n ans += y[i]\n else:\n poison = 0\n\nprint(ans)", "n = int(input())\nx = []\ny = []\nfor i in range(n):\n a, b = map(int, input().split())\n x.append(a)\n y.append(b)\n\nans = 0\n\npoison = 0\n\nfor i in range(n):\n if x[i] == 1:\n if poison == 0:\n poison = 1\n ans += y[i]\n else:\n if poison == 1:\n poison = 0\n ans += y[i]\n\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN, K, Q = map(int, input().split())\n\nA = [0] * N\n\nfor i in range(Q):\n x, y = map(int, input().split())\n x -= 1\n A[x] = y\n A = sorted(A, reverse=True)\n print(sum(A[:K]))", "import sys\nfrom bisect import *\n\ninput = sys.stdin.readline\n\nN, K, Q = map(int, input().split())\n\nA = [0] * N\n\nfor i in range(Q):\n x, y = map(int, input().split())\n x -= 1\n if A[x] == y:\n continue\n A[x] = y\n idx = bisect_right(A, y)\n if idx > K:\n print(0)\n else:\n print(sum(A[:idx]) - sum(sorted(A[:idx])[:(idx - K)]))", "import sys\n\ninput = sys.stdin.readline\n\nN, K, Q = map(int, input().split())\n\nX = [0] * N\n\nfor i in range(Q):\n x, y = map(int, input().split())\n x -= 1\n if X[x] == y:\n continue\n if X[x] > y:\n X[x] = y\n for j in range(x + 1, N):\n if X[j] < X[j - 1]:\n X[j - 1], X[j] = X[j], X[j - 1]\n break\n else:\n X[x] = y\n for j in range(x):\n if X[j] < X[j + 1]:\n X[j], X[j + 1] = X[j + 1], X[j]\n break\n\n X = X[:K]\n X.sort(reverse=True)\n print(sum(X))", "import sys\n\ninput = sys.stdin.readline\n\nN, K, Q = map(int, input().split())\n\ndata = [0] * N\n\nfor i in range(Q):\n x, y = map(int, input().split())\n x -= 1\n data[x] = y\n data = sorted(data, reverse=True)\n print(sum(data[:K]))", "import heapq\n\nN, K, Q = map(int, input().split())\n\nheap = []\nfor i in range(N):\n heapq.heappush(heap, 0)\n\nfor i in range(Q):\n x, y = map(int, input().split())\n x -= 1\n if heap[x] != y:\n if heap[x] > y:\n heapq.heappop(heap)\n heapq.heappush(heap, y)\n heapq.heapify(heap)\n\n sum = 0\n for j in range(K):\n sum += heap[j]\n print(sum)", "import sys\n\ninput = sys.stdin.readline\n\nN, K, Q = map(int, input().split())\n\nX = [0] * N\n\nfor _ in range(Q):\n x, y = map(int, input().split())\n x -= 1\n if X[x] != y:\n if X[x]:\n X[x] = y\n X.sort(reverse=True)\n print(sum(X[:K]))\n else:\n X[x] = y\n if y:\n X.sort(reverse=True)\n print(sum(X[:K]))", "import sys\n\ninput = sys.stdin.readline\n\nN, K, Q = map(int, input().split())\n\ndata = [0] * N\n\nfor i in range(Q):\n x, y = map(int, input().split())\n x -= 1\n data[x] = y\n data = sorted(data, reverse=True)\n print(sum(data[:K]))", "import sys\n\ninput = sys.stdin.readline\n\nN, K, Q = map(int, input().split())\n\nA = [0] * N\n\nfor i in range(Q):\n X, Y = map(int, input().split())\n X -= 1\n A[X] = Y\n A.sort(reverse=True)\n print(sum(A[:K]))", "import sys\n\ninput = sys.stdin.readline\n\nN, K, Q = map(int, input().split())\n\nA = [0] * N\n\nfor i in range(Q):\n X, Y = map(int, input().split())\n X -= 1\n A[X] = Y\n A = sorted(A, reverse=True)\n print(sum(A[:K]))", "import sys\n\ninput = sys.stdin.readline\n\nN, K, Q = map(int, input().split())\n\nX = [0] * N\n\nfor i in range(Q):\n x, y = map(int, input().split())\n x -= 1\n X[x] = y\n\nX.sort(reverse=True)\n\nfor i in range(Q):\n print(sum(X[:K]))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n print(sum(a[i * 7 : (i + 1) * 7]), end=\" \")\r", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n print(sum(a[i * 7 : (i + 1) * 7]), end=\" \")\r", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n print(sum(a[i * 7 : (i + 1) * 7]), end=\" \")\r", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n print(sum(a[i * 7 : (i + 1) * 7]), end=\" \")\r", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n print(sum(a[i * 7 : (i + 1) * 7]), end=\" \")\r", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n print(sum(a[i * 7 : (i + 1) * 7]), end=\" \")\r", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n):\n print(sum(a[i * 7 : (i + 1) * 7]), end=\" \")", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n print(sum(a[i * 7 : (i + 1) * 7]), end=\" \")\r", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n print(sum(a[i * 7 : (i + 1) * 7]), end=\" \")\r", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n print(sum(a[i * 7 : (i + 1) * 7]), end=\" \")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if s[i] + s[j] == (s[i] + s[j])[::-1]:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r", "n = int(input())\r\ns = [input() for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if s[i] + s[j] == (s[i] + s[j])[::-1]:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if s[i] + s[j] == (s[i] + s[j])[::-1]:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if s[i] + s[j] == (s[i] + s[j])[::-1]:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if s[i] + s[j] == (s[i] + s[j])[::-1]:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r", "n = int(input())\ns = [input() for i in range(n)]\n\nfor i in range(n):\n for j in range(i + 1, n):\n if s[i] + s[j] == (s[i] + s[j])[::-1]:\n print(\"Yes\")\n exit()\n if s[j] + s[i] == (s[j] + s[i])[::-1]:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nans = \"No\"\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if s[i] + s[j] == (s[i] + s[j])[::-1]:\r\n ans = \"Yes\"\r\nprint(ans)\r", "n = int(input())\ns = [input() for _ in range(n)]\n\nfor i in range(n):\n for j in range(i + 1, n):\n if s[i] + s[j] == (s[i] + s[j])[::-1]:\n print(\"Yes\")\n exit()\n if s[j] + s[i] == (s[j] + s[i])[::-1]:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nans = \"No\"\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if s[i] + s[j] == (s[i] + s[j])[::-1]:\r\n ans = \"Yes\"\r\nprint(ans)\r", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nans = \"No\"\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if s[i] + s[j] == (s[i] + s[j])[::-1]:\r\n ans = \"Yes\"\r\nprint(ans)\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nHA, WA = map(int, input().split())\nA = [input().rstrip() for _ in range(HA)]\nHB, WB = map(int, input().split())\nB = [input().rstrip() for _ in range(HB)]\nHX, WX = map(int, input().split())\nX = [input().rstrip() for _ in range(HX)]\n\nfor i in range(WX - WB + 1):\n for j in range(HX - HB + 1):\n for k in range(WA - WX + 1):\n for l in range(HA - HX + 1):\n flag = True\n for x in range(HX):\n for y in range(WX):\n if X[x][y] == '#':\n if A[l + x][k + y] == '#' or B[x + j][y + i] == '#':\n continue\n else:\n flag = False\n break\n if flag == False:\n break\n if flag:\n for x in range(HX):\n for y in range(WX):\n if X[x][y] == '#' and A[l + x][k + y] == '#':\n A[l + x][k + y] = '.'\n if X[x][y] == '#' and B[x + j][y + i] == '#':\n B[x + j][y + i] = '.'\n print(\"Yes\")\n exit()\nprint(\"No\")", "from itertools import product\n\nfor _ in range(int(input())):\n (ha, wa) = map(int, input().split())\n a = [input() for _ in range(ha)]\n (hb, wb) = map(int, input().split())\n b = [input() for _ in range(hb)]\n (hx, wx) = map(int, input().split())\n x = [input() for _ in range(hx)]\n for dx, dy in product(range(wx), range(hx)):\n c = [['.'] * (wa + wb + dx) for _ in range(ha + hb + dy)]\n for i in range(ha):\n for j in range(wa):\n c[i + dy][j + dx] = a[i][j]\n for i in range(hb):\n for j in range(wb):\n c[i + dy][j + dx] = max(c[i + dy][j + dx], b[i][j])\n if c[ha + hb + dy - 1][wa + wb + dx - 1] == '.':\n continue\n ok = True\n for i in range(ha + hb + dy):\n for j in range(wa + wb + dx):\n if c[i][j] != x[i][j]:\n ok = False\n break\n if not ok:\n break\n if ok:\n print('Yes')\n break\n else:\n print('No')", "from itertools import product\n\n(ha, wa) = map(int, input().split())\na = [input() for _ in range(ha)]\n(hb, wb) = map(int, input().split())\nb = [input() for _ in range(hb)]\n(hx, wx) = map(int, input().split())\nx = [input() for _ in range(hx)]\n\nfor dx, dy in product(range(wx), range(hx)):\n for i in range(ha):\n for j in range(wa):\n if a[i][j] == \"#\":\n x[i + dy][j + dx] = \"#\"\n for i in range(hb):\n for j in range(wb):\n if b[i][j] == \"#\":\n x[i + dy][j + dx] = \"#\"\n if all(row == line for row, line in zip(x, x)):\n print(\"Yes\")\n exit()\nprint(\"No\")", "import sys\n\ninput = sys.stdin.readline\n\nH_A, W_A = map(int, input().split())\nA = [input().rstrip() for _ in range(H_A)]\nH_B, W_B = map(int, input().split())\nB = [input().rstrip() for _ in range(H_B)]\nH_X, W_X = map(int, input().split())\nX = [input().rstrip() for _ in range(H_X)]\n\nfor i in range(H_X - H_A + 1):\n for j in range(W_X - W_A + 1):\n for k in range(H_X - H_B + 1):\n for l in range(W_X - W_B + 1):\n flag = True\n for m in range(H_A):\n for n in range(W_A):\n if A[m][n] == '#' and X[i + m][j + n] == '.':\n flag = False\n for m in range(H_B):\n for n in range(W_B):\n if B[m][n] == '#' and X[k + m][l + n] == '.':\n flag = False\n for m in range(H_A):\n for n in range(W_A):\n if A[m][n] == '#' and X[k + m][l + n] == '#':\n flag = False\n for m in range(H_B):\n for n in range(W_B):\n if B[m][n] == '#' and X[i + m][j + n] == '#':\n flag = False\n if flag:\n print(\"Yes\")\n return\nprint(\"No\")", "import sys\n\ninput = sys.stdin.readline\n\nH_A, W_A = map(int, input().split())\nA = [input().rstrip() for _ in range(H_A)]\nH_B, W_B = map(int, input().split())\nB = [input().rstrip() for _ in range(H_B)]\nH_X, W_X = map(int, input().split())\nX = [input().rstrip() for _ in range(H_X)]\n\nfor i in range(H_A + H_X - 1):\n for j in range(W_A + W_X - 1):\n for k in range(H_B + H_X - 1):\n for l in range(W_B + W_X - 1):\n flag = True\n for x in range(H_X):\n for y in range(W_X):\n if X[x][y] == '#':\n if A[i + x][j + y] == '#' or B[k + x][l + y] == '#':\n continue\n else:\n flag = False\n break\n if not flag:\n break\n if flag:\n print(\"Yes\")\n exit()\nprint(\"No\")", "from itertools import product\n\nha, wa = map(int, input().split())\na = [input() for _ in range(ha)]\nhb, wb = map(int, input().split())\nb = [input() for _ in range(hb)]\nhx, wx = map(int, input().split())\nx = [input() for _ in range(hx)]\n\nfor dx in range(wx):\n for dy in range(hx):\n for da in product(range(wx - wa + 1), range(hx - ha + 1)):\n for db in product(range(wx - wb + 1), range(hx - hb + 1)):\n ok = True\n for i in range(ha):\n for j in range(wa):\n if a[i][j] == '#' and x[i + da[1]][j + da[0]] == '.':\n ok = False\n break\n if not ok:\n break\n if not ok:\n continue\n for i in range(hb):\n for j in range(wb):\n if b[i][j] == '#' and x[i + db[1]][j + db[0]] == '.':\n ok = False\n break\n if not ok:\n break\n if ok:\n print(\"Yes\")\n exit()\nprint(\"No\")", "def solve():\n (ha, wa) = map(int, input().split())\n a = [input() for _ in range(ha)]\n (hb, wb) = map(int, input().split())\n b = [input() for _ in range(hb)]\n (hx, wx) = map(int, input().split())\n x = [input() for _ in range(hx)]\n for dx in range(wx):\n for dy in range(hx):\n ca = [[0] * (wx + wa - 1) for _ in range(hx + ha - 1)]\n for i in range(ha):\n for j in range(wa):\n ca[i + dy][j + dx] = a[i][j]\n for i in range(hb):\n for j in range(wb):\n ca[i + dy][j + dx] = max(ca[i + dy][j + dx], b[i][j])\n if ca[dy + hx - 1][:wx] == x[-1]:\n continue\n flag = True\n for i in range(hx):\n if ca[dy + i][:wx] != x[i]:\n flag = False\n break\n if flag:\n print(\"Yes\")\n return\n print(\"No\")\n\n\nsolve()", "def solve():\n (h1, w1) = map(int, input().split())\n a = [input() for _ in range(h1)]\n (h2, w2)) = map(int, input().split())\n b = [input() for _ in range(h2)]\n (hx, wx) = map(int, input().split())\n x = [input() for _ in range(hx)]\n for i in range(wx + w1 - 1):\n for j in range(hx + h1 - 1):\n for k in range(w2 + 1):\n for l in range(h2 + 1):\n if k + w1 > wx or l + h1 > hx:\n break\n c = [[\".\"] * wx for _ in range(hx)]\n for i1 in range(h1):\n for j1 in range(w1):\n c[i1 + j][j1 + k] = a[i1][j1]\n for i2 in range(h2):\n for j2 in range(w2):\n c[i2 + i][j2 + k] = b[i2][j2]\n if c == x:\n print(\"Yes\")\n return\n print(\"No\")\n\n\nsolve()", "import sys\n\ninput = sys.stdin.readline\n\nH_A, W_A = map(int, input().split())\nA = [input().rstrip() for _ in range(H_A)]\nH_B, W_B = map(int, input().split())\nB = [input().rstrip() for _ in range(H_B)]\nH_X, W_X = map(int, input().split())\nX = [input().rstrip() for _ in range(H_X)]\n\nfor i in range(H_A + H_X - 1):\n for j in range(W_A + W_X - 1):\n for k in range(H_B + H_X - 1):\n for l in range(W_B + W_X - 1):\n flag = True\n for h in range(H_X):\n for w in range(W_X):\n if A[i + h][j + w] == '#' or B[k + h][l + w] == '#':\n if X[h][w] == '.':\n flag = False\n break\n if not flag:\n break\n if flag:\n print(\"Yes\")\n exit()\nprint(\"No\")", "import sys\n\ninput = sys.stdin.readline\n\n\ndef solve():\n ha, wa = map(int, input().split())\n a = [input().rstrip() for _ in range(ha)]\n hb, wb = map(int, input().split())\n b = [input().rstrip() for _ in range(hb)]\n hx, wx = map(int, input().split())\n x = [input().rstrip() for _ in range(hx)]\n for i in range(ha + hx - 1, -1, -1):\n for j in range(wa + wx - 1, -1, -1):\n if a[i - ha + ha - 1 : i + 1] + b[j - wa + wa - 1 : j + 1] == x:\n return \"Yes\"\n return \"No\"\n\n\nprint(solve())" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\ns = input()\r\nstack = []\r\nans = \"\"\r\nfor i in s:\r\n if i == \"(\":\r\n stack.append(i)\r\n elif i == \")\":\r\n if stack:\r\n stack.pop()\r\n else:\r\n if not stack:\r\n ans += i\r\nprint(ans)\r", "n = int(input())\ns = input()\n\nstack = []\nans = \"\"\nfor c in s:\n if c == \"(\":\n stack.append(c)\n elif c == \")\":\n if stack:\n stack.pop()\n else:\n ans += c\n else:\n if not stack:\n ans += c\n else:\n stack.append(c)\n\nfor c in stack:\n ans += c\n\nprint(ans)", "n = int(input())\ns = input()\n\nstack = []\nans = \"\"\nfor c in s:\n if c == \"(\":\n stack.append(c)\n elif c == \")\":\n if stack and stack[-1] == \"(\":\n stack.pop()\n else:\n ans += c\n else:\n if not stack:\n ans += c\n else:\n stack.append(c)\n\nprint(ans)", "n = int(input())\r\ns = input()\r\nstack = []\r\nans = \"\"\r\nfor i in s:\r\n if i == \"(\":\r\n stack.append(i)\r\n elif i == \")\":\r\n if stack and stack[-1] == \"(\":\r\n stack.pop()\r\n else:\r\n if not stack:\r\n ans += i\r\nprint(ans)\r", "n = int(input())\ns = input()\n\nstack = []\nans = []\nfor i in s:\n if i == \"(\":\n stack.append(i)\n elif i == \")\":\n if stack:\n stack.pop()\n else:\n ans.append(i)\n else:\n if not stack:\n ans.append(i)\n\nprint(\"\".join(ans))", "n = int(input())\ns = input()\n\nstack = []\nans = []\n\nfor c in s:\n if c == \"(\":\n stack.append(c)\n elif c == \")\":\n if stack:\n stack.pop()\n else:\n ans.append(c)\n else:\n if stack:\n ans.append(c)\n\nprint(\"\".join(ans))", "n = int(input())\r\ns = input()\r\nstack = []\r\nans = []\r\nfor i in s:\r\n if i == \"(\":\r\n stack.append(i)\r\n elif i == \")\":\r\n if stack:\r\n stack.pop()\r\n else:\r\n if not stack:\r\n ans.append(i)\r\nprint(*ans, sep=\"\")\r", "n = int(input())\ns = input()\n\nstack = []\nans = \"\"\n\nfor c in s:\n if c == \"(\":\n stack.append(c)\n elif c == \")\":\n if stack:\n stack.pop()\n else:\n if not stack:\n ans += c\n\nprint(ans)", "n = int(input())\r\ns = input()\r\nstack = []\r\nans = \"\"\r\nfor i in s:\r\n if i == \"(\":\r\n stack.append(i)\r\n elif i == \")\":\r\n if stack:\r\n stack.pop()\r\n else:\r\n if not stack:\r\n ans += i\r\nprint(ans)\r", "n = int(input())\r\ns = input()\r\nstack = []\r\nans = []\r\nfor i in s:\r\n if i == \"(\":\r\n stack.append(i)\r\n elif i == \")\":\r\n if stack:\r\n stack.pop()\r\n else:\r\n if not stack:\r\n ans.append(i)\r\nprint(*ans, sep=\"\")\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "def egcd(a, b):\r\n if a == 0:\r\n return (b, 0, 1)\r\n else:\r\n g, y, x = egcd(b % a, a)\r\n return (g, x - b // a * y, y)\r\n\r\n\r\ndef modinv(a, m):\r\n g, x, y = egcd(a, m)\r\n if g != 1:\r\n raise ValueError\r\n else:\r\n return x % m\r\n\r\n\r\ndef solve(n, m):\r\n mod = 998244353\r\n if n == 1:\r\n return m % mod\r\n else:\r\n return (\r\n pow(m, n, mod)\r\n - n * (m - 1) * pow(m - 1, n - 1, mod)\r\n + (n - 1) * (m - 1) * pow(m - 2, n - 2, mod)\r\n ) % mod\r\n\r\n\r\n(n, m) = map(int, input().split())\r\nprint(solve(n, m))\r", "def egcd(a, b):\r\n if a == 0:\r\n return (b, 0, 1)\r\n else:\r\n g, y, x = egcd(b % a, a)\r\n return (g, x - b // a * y, y)\r\n\r\n\r\ndef modinv(a, m):\r\n g, x, y = egcd(a, m)\r\n if g != 1:\r\n raise Exception(\"Modular inverse does not exist\")\r\n else:\r\n return x % m\r\n\r\n\r\n(n, m) = map(int, input().split())\r\nmod = 998244353\r\nif n == 2:\r\n print(m * (m - 1) % mod)\r\nelse:\r\n a = m\r\n b = m - 1\r\n c = m - 2\r\n for i in range(3, n + 1):\r\n a = a * b % mod\r\n b = b * c % mod\r\n print(a)\r", "def egcd(a, b):\r\n if a == 0:\r\n return (b, 0, 1)\r\n else:\r\n g, y, x = egcd(b % a, a)\r\n return (g, x - b // a * y, y)\r\n\r\n\r\ndef modinv(a, m):\r\n g, x, y = egcd(a, m)\r\n if g != 1:\r\n raise Exception(\"Modular inverse does not exist\")\r\n else:\r\n return x % m\r\n\r\n\r\n(n, m) = map(int, input().split())\r\nmod = 998244353\r\nif n == 2:\r\n print(m * (m - 1) % mod)\r\nelse:\r\n a = m\r\n b = m - 1\r\n c = m - 2\r\n for i in range(3, n + 1):\r\n a = a * b % mod\r\n b = b * c % mod\r\n print(a)\r", "def egcd(a, b):\r\n if a == 0:\r\n return (b, 0, 1)\r\n else:\r\n g, y, x = egcd(b % a, a)\r\n return (g, x - b // a * y, y)\r\n\r\n\r\ndef modinv(a, m):\r\n g, x, y = egcd(a, m)\r\n if g != 1:\r\n raise Exception(\"Modular inverse does not exist\")\r\n else:\r\n return x % m\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n mod = 998244353\r\n a = (m - 1) * m ** (n - 1)\r\n b = m - 2\r\n c = m - 1\r\n d = m\r\n x = modinv(b, mod)\r\n y = modinv(c, mod)\r\n z = modinv(d, mod)\r\n ans = a * (x + y - z) % mod\r\n print(ans)\r\n\r\n\r\nmain()\r", "def egcd(a, b):\n if a == 0:\n return (b, 0, 1)\n else:\n g, y, x = egcd(b % a, a)\n return (g, x - b // a * y, y)\n\n\ndef modinv(a, m):\n g, x, y = egcd(a, m)\n if g != 1:\n raise ValueError\n return x % m\n\n\ndef comb(n, k, mod):\n if k < 0 or k > n:\n return 0\n r = 1\n for i in range(k):\n r = r * (n - i) * modinv(i + 1, mod) % mod\n return r\n\n\ndef solve(n, m, mod):\n if n == 1:\n return m\n a = (m - 1) * comb(m + n - 2, n - 1, mod) % mod\n b = comb(m, 2, mod)\n c = (m - 1) ** 2\n d = modinv(c, mod)\n return (a - b * d) % mod\n\n\n(n, m) = map(int, input().split())\nmod = 998244353\nprint(solve(n, m, mod))", "def main():\n n, m = map(int, input().split())\n mod = 998244353\n if n == 2:\n print(m * (m - 1) % mod)\n return\n f = [1] * (n + 1)\n for i in range(2, n + 1):\n f[i] = f[i - 1] * i % mod\n ans = pow(m, n, mod)\n ans -= m * (m - 1) * pow(m - 1, n - 2, mod) * f[n - 1] * f[n - 2] % mod\n ans %= mod\n for i in range(3, n):\n ans -= m * (m - 1) * pow(m - 2, n - i - 1, mod) * f[n - 1] * f[n - i - 1] % mod\n ans %= mod\n print(ans)\n\n\nmain()", "mod = 998244353\n(n, m) = map(int, input().split())\nif m == 1:\n print(0)\nelse:\n a = pow(m - 1, n, mod)\n b = pow(m, n, mod)\n c = pow(m - 2, n, mod)\n d = pow(m - 1, n - 1, mod)\n print((a - c + mod) * (b - d + mod) % mod)", "def main():\n (n, m) = map(int, input().split())\n mod = 998244353\n if m == 1:\n print(0)\n return\n if n == 1:\n print(m)\n return\n a = pow(m, n, mod)\n b = pow(m - 1, n, mod)\n c = pow(m - 2, n, mod)\n d = (m - 1) * (m - 2)\n ans = (a - b - c + d) % mod\n print(ans)\n\n\nmain()", "def egcd(a, b):\r\n if a == 0:\r\n return (b, 0, 1)\r\n else:\r\n g, y, x = egcd(b % a, a)\r\n return (g, x - b // a * y, y)\r\n\r\n\r\ndef modinv(a, m):\r\n g, x, y = egcd(a, m)\r\n if g != 1:\r\n raise Exception(\"Modular inverse does not exist\")\r\n else:\r\n return x % m\r\n\r\n\r\ndef powmod(a, n, m):\r\n if n == 0:\r\n return 1\r\n elif n % 2 == 0:\r\n s = powmod(a, n // 2, m)\r\n return s * s % m\r\n else:\r\n return a * powmod(a, n - 1, m) % m\r\n\r\n\r\ndef comb(n, k, mod):\r\n if k < 0 or k > n:\r\n return 0\r\n k = min(k, n - k)\r\n num = den = 1\r\n for i in range(k):\r\n num = num * (n - i) % mod\r\n den = den * (i + 1) % mod\r\n return num * modinv(den, mod) % mod\r\n\r\n\r\ndef solve(n, m, mod):\r\n if n == 1:\r\n return m % mod\r\n return (\r\n m\r\n * (m - 1)\r\n % mod\r\n * powmod(comb(m - 2, n - 2, mod) + comb(m - 1, n - 2, mod), n - 1, mod)\r\n % mod\r\n )\r\n\r\n\r\n(n, m) = map(int, input().split())\r\nmod = 998244353\r\nprint(solve(n, m, mod))\r", "def egcd(a, b):\r\n if a == 0:\r\n return (b, 0, 1)\r\n else:\r\n (g, y, x) = egcd(b % a, a)\r\n return (g, x - b // a * y, y)\r\n\r\n\r\ndef modinv(a, m):\r\n (g, x, y) = egcd(a, m)\r\n if g != 1:\r\n raise Exception(\"Modular inverse does not exist\")\r\n else:\r\n return x % m\r\n\r\n\r\ndef solve(n, m):\r\n mod = 998244353\r\n a = 1\r\n b = 1\r\n for i in range(n):\r\n a = a * (m - 1) % mod\r\n b = b * (m - 2) % mod\r\n return a * modinv(b, mod) % mod\r\n\r\n\r\n(n, m) = map(int, input().split())\r\nprint(solve(n, m))\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s = list(map(int, input().split()))\n\nif all(100 <= i <= 675 and i % 25 == 0 for i in s) and all(s[i] <= s[i + 1] for i in range(7)):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = list(map(int, input().split()))\n\nif all(100 <= x <= 675 and x % 25 == 0 for x in s) and all(s[i] <= s[i + 1] for i in range(7)):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = list(map(int, input().split()))\n\nif all(100 <= x <= 675 and x % 25 == 0 for x in s) and all(s[i] <= s[i + 1] for i in range(7)):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = list(map(int, input().split()))\n\nif all(100 <= x <= 675 and x % 25 == 0 for x in s) and all(s[i] <= s[i + 1] for i in range(7)):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = list(map(int, input().split()))\n\nif all(100 <= i <= 675 and i % 25 == 0 for i in s) and all(s[i] <= s[i + 1] for i in range(7)):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = list(map(int, input().split()))\n\nif all(100 <= i <= 675 and i % 25 == 0 for i in s) and all(s[i] <= s[i + 1] for i in range(7)):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = list(map(int, input().split()))\n\nif all(100 <= x <= 675 and x % 25 == 0 for x in s) and all(s[i] <= s[i + 1] for i in range(7)):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = list(map(int, input().split()))\n\nif all(100 <= i <= 675 and i % 25 == 0 for i in s) and all(s[i] <= s[i + 1] for i in range(7)):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = list(map(int, input().split()))\n\nif all(100 <= x <= 675 and x % 25 == 0 for x in s) and all(s[i] <= s[i + 1] for i in range(7)):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = list(map(int, input().split()))\n\nif all(100 <= x <= 675 and x % 25 == 0 for x in s) and all(s[i] <= s[i + 1] for i in range(7)):\n print(\"Yes\")\nelse:\n print(\"No\")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\nc = list(map(str, input().split()))\nd = list(map(str, input().split()))\np = list(map(int, input().split()))\n\ntotal = 0\nfor i in c:\n if i in d:\n index = d.index(i)\n total += p[index]\n else:\n total += p[0]\n\nprint(total)", "n, m = map(int, input().split())\nc = list(map(str, input().split()))\nd = list(map(str, input().split()))\np = list(map(int, input().split()))\n\ntotal = 0\nfor i in c:\n if i in d:\n index = d.index(i)\n total += p[index]\n else:\n total += p[0]\nprint(total)", "n, m = map(int, input().split())\nc = list(map(str, input().split()))\nd = list(map(str, input().split()))\np = list(map(int, input().split()))\n\ntotal = 0\nfor i in c:\n if i in d:\n total += p[d.index(i) + 1]\n else:\n total += p[0]\nprint(total)", "n, m = map(int, input().split())\nc = list(map(str, input().split()))\nd = list(map(str, input().split()))\np = list(map(int, input().split()))\n\ntotal = 0\nfor i in c:\n if i in d:\n index = d.index(i)\n total += p[index]\n else:\n total += p[0]\n\nprint(total)", "n, m = map(int, input().split())\r\nc = list(map(str, input().split()))\r\nd = list(map(str, input().split()))\r\np = list(map(int, input().split()))\r\n\r\ntotal = 0\r\nfor i in c:\r\n if i in d:\r\n index = d.index(i)\r\n total += p[index]\r\n else:\r\n total += p[0]\r\nprint(total)\r", "n, m = map(int, input().split())\nc = list(map(str, input().split()))\nd = list(map(str, input().split()))\np = list(map(int, input().split()))\n\ntotal = 0\nfor i in c:\n if i in d:\n index = d.index(i)\n total += p[index]\n else:\n total += p[0]\nprint(total)", "n, m = map(int, input().split())\nc = list(map(str, input().split()))\nd = list(map(str, input().split()))\np = list(map(int, input().split()))\n\ntotal = 0\nfor i in c:\n if i in d:\n index = d.index(i)\n total += p[index]\n else:\n total += p[0]\nprint(total)", "n, m = map(int, input().split())\nc = list(map(str, input().split()))\nd = list(map(str, input().split()))\np = list(map(int, input().split()))\n\ntotal = 0\nfor i in c:\n if i in d:\n total += p[d.index(i) + 1]\n else:\n total += p[0]\n\nprint(total)", "n, m = map(int, input().split())\nc = list(map(str, input().split()))\nd = list(map(str, input().split()))\np = list(map(int, input().split()))\n\ntotal = 0\nfor i in c:\n if i in d:\n index = d.index(i)\n total += p[index]\n else:\n total += p[0]\n\nprint(total)", "n, m = map(int, input().split())\r\nc = list(map(str, input().split()))\r\nd = list(map(str, input().split()))\r\np = list(map(int, input().split()))\r\n\r\ntotal = 0\r\nfor i in c:\r\n if i in d:\r\n index = d.index(i)\r\n total += p[index]\r\n else:\r\n total += p[0]\r\nprint(total)\r" ], "pass1_list": [ false, false, true, false, false, false, false, true, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\nab = [list(map(int, input().split())) for _ in range(n)]\nab.sort(key=lambda x: (x[0] / (x[0] + x[1]), x[1]), reverse=True)\nprint(\" \".join(map(str, [i + 1 for i, _ in enumerate(ab)])))", "n = int(input())\nab = []\nfor i in range(n):\n a, b = map(int, input().split())\n ab.append((-a / (a + b), i + 1))\nab.sort()\nprint(*ab)", "n = int(input())\nab = [list(map(int, input().split())) for _ in range(n)]\nab.sort(key=lambda x: (-x[0] / (x[0] + x[1]), x[1]))\nprint(\" \".join(map(str, [i + 1 for a, b in ab])))", "n = int(input())\nab = [list(map(int, input().split())) for _ in range(n)]\nab.sort(key=lambda x: (x[0] / (x[0] + x[1]), x[1]), reverse=True)\nprint(*[i + 1 for i in range(n)], sep=\" \")", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\na.sort(key=lambda x: (-x[0] / (x[0] + x[1]), x[1]))\nfor i in a:\n print(i[1] + 1, end=\" \")", "n = int(input())\na = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append((-x / (x + y), i + 1))\na.sort()\nprint(*[str(i) for _, i in a])", "n = int(input())\nab = []\nfor i in range(n):\n a, b = map(int, input().split())\n ab.append((-a / (a + b), i + 1))\nab.sort()\nprint(*[i for _, i in ab])", "n = int(input())\nab = []\nfor i in range(n):\n a, b = map(int, input().split())\n ab.append((-a / (a + b), i + 1))\nab.sort()\nprint(*[i for _, i in ab])", "n = int(input())\nab = [list(map(int, input().split())) for i in range(n)]\nab.sort(key=lambda x: (x[0] / (x[0] + x[1]), x[1]), reverse=True)\nprint(*[i + 1 for i in range(n)], sep=\" \")", "n = int(input())\nab = []\nfor i in range(n):\n a, b = map(int, input().split())\n ab.append((a / (a + b), i + 1))\nab.sort(reverse=True)\nprint(*[str(i) for _, i in ab])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\nh, w = map(int, input().split())\nsnuke = \"snuke\"\ns = [input() for _ in range(h)]\n\ndx = [0, 0, 1, -1, 1, 1, -1, -1]\ndy = [1, -1, 0, 0, 1, -1, 1, -1]\n\nvisited = [[False] * w for _ in range(h)]\n\nq = deque([(0, 0)])\nvisited[0][0] = True\n\nwhile q:\n x, y = q.popleft()\n for i in range(8):\n nx, ny = x + dx[i], y + dy[i]\n if 0 <= nx < h and 0 <= ny < w:\n if s[nx][ny] == snuke[(x + y + i) % 5]:\n if nx == h - 1 and ny == w - 1:\n print(\"Yes\")\n exit()\n if not visited[nx][ny]:\n visited[nx][ny] = True\n q.append((nx, ny))\n\nprint(\"No\")", "from collections import deque\n\nh, w = map(int, input().split())\nsnuke = \"snuke\"\ns = [input() for _ in range(h)]\n\nvisited = [[False] * w for _ in range(h)]\nq = deque([(0, 0)])\nvisited[0][0] = True\n\nwhile q:\n y, x = q.popleft()\n for dy, dx in [(0, 1), (1, 0), (0, -1), (-1, 0)]:\n ny, nx = y + dy, x + dx\n if 0 <= ny < h and 0 <= nx < w:\n if not visited[ny][nx] and s[ny][nx] == snuke[(y + x + 1) % 5]:\n visited[ny][nx] = True\n q.append((ny, nx))\n if ny == h - 1 and nx == w - 1:\n print(\"Yes\")\n exit()\nprint(\"No\")", "h, w = map(int, input().split())\nsnuke = \"snuke\"\ns = [input() for _ in range(h)]\ndp = [[False] * w for _ in range(h)]\ndp[0][0] = s[0][0] == \"s\"\nfor i in range(1, h):\n dp[i][0] = dp[i - 1][0] and s[i][0] == \"n\"\nfor j in range(1, w):\n dp[0][j] = dp[0][j - 1] and s[0][j] == \"u\"\nfor i in range(1, h):\n for j in range(1, w):\n dp[i][j] = (dp[i - 1][j] and s[i][j] == \"k\") or (dp[i][j - 1] and s[i][j] == \"e\")\nprint(\"Yes\" if dp[-1][-1] else \"No\")", "from collections import deque\n\nh, w = map(int, input().split())\nsnuke = \"snuke\"\ns = []\nfor _ in range(h):\n s.append(input())\n\nfor i in range(h):\n for j in range(w):\n if s[i][j] != snuke[(i + j) % 5]:\n s[i] = s[i][:j] + \" \" + s[i][j + 1 :]\n\nq = deque([(0, 0)])\nwhile q:\n i, j = q.popleft()\n if i == h - 1 and j == w - 1:\n print(\"Yes\")\n exit()\n if i > 0:\n q.append((i - 1, j))\n if i < h - 1:\n q.append((i + 1, j))\n if j > 0:\n q.append((i, j - 1))\n if j < w - 1:\n q.append((i, j + 1))\nprint(\"No\")", "from collections import deque\n\nh, w = map(int, input().split())\nsnuke = \"snuke\"\ns = [input() for _ in range(h)]\n\ndx = [0, 0, -1, 1, -1, 1, -1, 1, 0]\ndy = [1, -1, 0, 0, -1, -1, 1, 1, 0]\n\ndist = [[0] * w for _ in range(h)]\ndist[0][0] = 1\nq = deque([(0, 0)])\nwhile q:\n x, y = q.popleft()\n for i in range(8):\n nx, ny = x + dx[i], y + dy[i]\n if 0 <= nx < h and 0 <= ny < w:\n if s[nx][ny] == snuke[(dist[x][y] - 1) % 5]:\n dist[nx][ny] = dist[x][y] + 1\n q.append((nx, ny))\n\nprint(\"Yes\" if dist[h - 1][w - 1] else \"No\")", "from collections import deque\n\nH, W = map(int, input().split())\nsnuke = \"snuke\"\nS = [input() for _ in range(H)]\n\ndx = [0, 1, 0, -1]\ndy = [1, 0, -1, 0]\n\nvisited = [[False for _ in range(W)] for _ in range(H)]\nq = deque([(0, 0)])\nvisited[0][0] = True\n\nwhile q:\n x, y = q.popleft()\n for i in range(4):\n nx, ny = x + dx[i], y + dy[i]\n if 0 <= nx < H and 0 <= ny < W:\n if S[nx][ny] == snuke[(x + y + i) % 5]:\n if nx == H - 1 and ny == W - 1:\n print(\"Yes\")\n exit()\n if not visited[nx][ny]:\n visited[nx][ny] = True\n q.append((nx, ny))\nprint(\"No\")", "from collections import deque\n\nh, w = map(int, input().split())\nsnuke = \"snuke\"\ngrid = [input() for _ in range(h)]\n\nvisited = [[False for _ in range(w)] for _ in range(h)]\nq = deque([(0, 0)])\nvisited[0][0] = True\n\nwhile q:\n y, x = q.popleft()\n for dy, dx in [(0, 1), (1, 0), (0, -1), (-1, 0)]:\n ny, nx = y + dy, x + dx\n if 0 <= ny < h and 0 <= nx < w:\n if not visited[ny][nx] and grid[ny][nx] == snuke[(y + x + 1) % 5]:\n visited[ny][nx] = True\n q.append((ny, nx))\n if ny == h - 1 and nx == w - 1:\n print(\"Yes\")\n exit()\nprint(\"No\")", "from collections import deque\n\nh, w = map(int, input().split())\ns = [input() for _ in range(h)]\nsnuke = \"snuke\"\n\ndx = [0, 0, 1, -1]\ndy = [1, -1, 0, 0]\n\ndist = [[0 for _ in range(w)] for _ in range(h)]\nfor i in range(h):\n for j in range(w):\n dist[i][j] = 1e9\ndist[0][0] = 0\nq = deque([(0, 0)])\nwhile q:\n y, x = q.popleft()\n for i in range(4):\n ny = y + dy[i]\n nx = x + dx[i]\n if 0 <= ny < h and 0 <= nx < w:\n if s[ny][nx] == snuke[(dist[y][x] + 1) % 5]:\n if dist[ny][nx] > dist[y][x] + 1:\n dist[ny][nx] = dist[y][x] + 1\n q.append((ny, nx))\n\nprint(\"Yes\" if dist[h - 1][w - 1] == h + w - 1 else \"No\")", "h, w = map(int, input().split())\ns = [input() for _ in range(h)]\nsnuke = \"snuke\"\n\nfor i in range(h):\n for j in range(w):\n if s[i][j] != snuke[(i + j) % 5]:\n break\n else:\n continue\n break\nelse:\n print(\"Yes\")\n exit()\n\nfor i in range(h - 1, -1, -1):\n for j in range(w - 1, -1, -1):\n if s[i][j] != snuke[(h + w - i - j - 2) % 5]:\n break\n else:\n continue\n break\nelse:\n print(\"Yes\")\n exit()\n\nprint(\"No\")", "from collections import deque\n\nH, W = map(int, input().split())\nS = [input() for _ in range(H)]\n\nsnuke = \"snuke\"\n\nvisited = [[False] * W for _ in range(H)]\n\nq = deque([(0, 0)])\nvisited[0][0] = True\n\nwhile q:\n y, x = q.popleft()\n\n if y == H - 1 and x == W - 1:\n print(\"Yes\")\n break\n\n for dy, dx in [(0, 1), (1, 0), (0, -1), (-1, 0)]:\n ny, nx = y + dy, x + dx\n\n if 0 <= ny < H and 0 <= nx < W:\n if not visited[ny][nx] and S[ny][nx] == snuke[(x + y + 1) % 5]:\n visited[ny][nx] = True\n q.append((ny, nx))\n\nelse:\n print(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import defaultdict\n\nN = int(input())\nA = list(map(int, input().split()))\nS = input()\n\nd = defaultdict(int)\nfor i, (a, s) in enumerate(zip(A, S)):\n d[s] += a * (N - i - 1) * (N - i - 2)\n\nprint(d[\"M\"] + d[\"E\"] + d[\"X\"])", "from collections import defaultdict\n\nn = int(input())\na = list(map(int, input().split()))\ns = input()\n\nd = defaultdict(int)\nfor i in range(n):\n d[a[i]] += 1\n\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n if s[i] != s[j]:\n if s[i] + s[j] == \"MX\":\n ans += d[2]\n elif s[i] + s[j] == \"EM\":\n ans += d[0]\n else:\n ans += d[1]\n\nprint(ans)", "from collections import defaultdict\n\nN = int(input())\nA = list(map(int, input().split()))\nS = input()\n\nd = defaultdict(int)\nfor i in range(N):\n d[S[i]] += 1\n\nif d['M'] == d['E'] == d['X']:\n print(0)\n exit()\n\nans = 0\nfor i in range(N):\n for j in range(i + 1, N):\n if S[i] == S[j]:\n continue\n k = 3 - (S[i] + S[j])\n if d[k] == 0:\n continue\n if A[i] == A[j]:\n ans += 3 - A[i]\n else:\n ans += 3 - (A[i] + A[j])\nprint(ans)", "from collections import defaultdict\n\nN = int(input())\nA = list(map(int, input().split()))\nS = input()\n\nd = defaultdict(int)\nfor i in range(N):\n d[S[i]] += 1\n\nif d['M'] == d['E'] == d['X']:\n print(0)\nelse:\n ans = 0\n for i in range(N):\n if d[S[i]] == 1:\n for j in range(i + 1, N):\n if S[j] != S[i]:\n ans += 3 - (A[i] + A[j])\n break\n print(ans)", "from collections import defaultdict\n\nn = int(input())\na = list(map(int, input().split()))\ns = input()\n\nd = defaultdict(int)\nfor i in range(n):\n d[s[i]] += 1\n\nif d['M'] == d['X'] == d['E'] == n // 3:\n print(0)\n exit()\n\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n if s[i] == s[j]:\n continue\n for k in range(j + 1, n):\n if s[i] == s[k] or s[j] == s[k]:\n continue\n if s[i] + s[j] + s[k] == 'MEX':\n ans += (3 - (a[i] + a[j] + a[k])) % 3\nprint(ans)", "from collections import defaultdict\n\nN = int(input())\nA = list(map(int, input().split()))\nS = input()\n\nd = defaultdict(int)\nfor i in range(N):\n d[S[i]] += 1\n\nif d['M'] == d['E'] == d['X']:\n print(0)\nelse:\n ans = 0\n for i in range(N):\n if d[S[i]] == 1:\n for j in range(i + 1, N):\n if d[S[j]] == 1:\n ans += 3 - A[i] - A[j]\n for k in range(j + 1, N):\n if d[S[k]] == 1:\n ans += 3 - A[i] - A[j] - A[k]\n print(ans)", "from collections import defaultdict\n\nn = int(input())\na = list(map(int, input().split()))\ns = input()\n\nd = defaultdict(int)\nfor i, ai in enumerate(a):\n d[s[i]] += 1\n\nm, e, x = d['M'], d['E'], d['X']\n\nans = 0\n\nif m > 0 and e > 0 and x > 0:\n ans += m * e * x\n\nif m > 0 and e == 0 and x > 0:\n ans += (m - 1) * x\n\nif m > 0 and e > 0 and x == 0:\n ans += m * (e - 1)\n\nif m == 0 and e > 0 and x > 0:\n ans += e * x\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\ns = input()\n\nm = e = x = 0\nfor i in range(n):\n if s[i] == \"M\":\n m += 1\n elif s[i] == \"E\":\n e += 1\n else:\n x += 1\n\nans = 0\nfor i in range(n):\n if s[i] == \"M\":\n if a[i] == 1:\n ans += e * x\n elif a[i] == 2:\n ans += e * e\n elif s[i] == \"E\":\n if a[i] == 0:\n ans += m * x\n elif a[i] == 2:\n ans += m * m\n else:\n if a[i] == 0:\n ans += m * e\n elif a[i] == 1:\n ans += m * m\n\nprint(ans)", "from collections import defaultdict\n\nN = int(input())\nA = list(map(int, input().split()))\nS = input()\n\nd = defaultdict(list)\nfor i, (a, s) in enumerate(zip(A, S)):\n d[s].append(a)\n\nans = 0\nfor i, a in enumerate(d['M']):\n for j, b in enumerate(d['E']):\n if i < j:\n c = 2\n if c in d['M'][i:j] or c in d['E'][i:j]:\n c = 0\n if c in d['X'][i:j]:\n c = 1\n ans += c\n\nfor i, a in enumerate(d['M']):\n for j, b in enumerate(d['X']):\n if i < j:\n c = 1\n if c in d['M'][i:j] or c in d['X'][i:j]:\n c = 0\n if c in d['E'][i:j]:\n c = 2\n ans += c\n\nfor i, a in enumerate(d['E']):\n for j, b in enumerate(d['X']):\n if i < j:\n c = 0\n if c in d['E'][i:j] or c in d['X'][i:j]:\n c = 1\n if c in d['M'][i:j]:\n c = 2\n ans += c\n\nprint(ans)", "from collections import defaultdict\n\nN = int(input())\nA = list(map(int, input().split()))\nS = input()\n\nd = defaultdict(int)\nfor i in range(N):\n d[S[i]] += 1\n\nif d['M'] == d['E'] == d['X']:\n print(0)\n exit()\n\nans = 0\nfor i in range(N):\n for j in range(i + 1, N):\n if S[i] == S[j]:\n continue\n k = 3 - (S[i] + S[j])\n if d[k] == 0:\n continue\n if A[i] == A[j]:\n ans += 3 - A[i]\n else:\n ans += 3 - (A[i] + A[j])\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from heapq import heappush, heappop\n\nN, M = map(int, input().split())\nP = list(map(int, input().split()))\nL = list(map(int, input().split()))\nD = list(map(int, input().split()))\n\ncoupon = []\nfor i in range(M):\n coupon.append((L[i], D[i]))\ncoupon.sort()\n\npq = []\nfor p in P:\n heappush(pq, -p)\n\nans = 0\nfor l, d in coupon:\n while len(pq) > 0 and -pq[0] < l:\n ans -= heappop(pq)\n if len(pq) > 0:\n ans += heappop(pq) - d\n\nwhile len(pq) > 0:\n ans -= heappop(pq)\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nP = list(map(int, input().split()))\nL = list(map(int, input().split()))\nD = list(map(int, input().split()))\nLP = [list(i) for i in zip(L, D)]\nLP.sort(reverse=True)\nLP_index = 0\nans = 0\nfor p in P:\n while LP_index < M and p >= LP[LP_index][0]:\n ans += LP[LP_index][1]\n LP_index += 1\n ans += p\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\nP = list(map(int, input().split()))\nL = list(map(int, input().split()))\nD = list(map(int, input().split()))\n\ncoupon = sorted([(L[i], D[i]) for i in range(M)], reverse=True)\n\nans = 0\nfor p in P:\n for l, d in coupon:\n if p >= l:\n ans += p - d\n coupon.remove((l, d))\n break\n else:\n ans += p\n\nprint(ans)", "n, m = map(int, input().split())\np = list(map(int, input().split()))\nl = list(map(int, input().split()))\nd = list(map(int, input().split()))\n\ncoupon = sorted([(l[i], d[i]) for i in range(m)], reverse=True)\np.sort(reverse=True)\n\nans = 0\nfor i in range(n):\n for j in range(m):\n if p[i] >= coupon[j][0]:\n ans += p[i] - coupon[j][1]\n coupon.pop(j)\n break\n else:\n ans += p[i]\n\nprint(ans)", "from heapq import heappop, heappush\n\nN, M = map(int, input().split())\nP = list(map(int, input().split()))\nL = list(map(int, input().split()))\nD = list(map(int, input().split()))\n\ncoupons = sorted([(L[i], D[i]) for i in range(M)], reverse=True)\n\npq = []\nfor p in P:\n while len(pq) and pq[0] < p:\n heappop(pq)\n if len(pq) and pq[0] <= coupons[0][0]:\n heappush(pq, p - coupons[0][1])\n coupons.pop(0)\n else:\n heappush(pq, p)\n\nprint(sum(pq))", "from heapq import heappop, heappush\n\nN, M = map(int, input().split())\nP = list(map(int, input().split()))\nL = list(map(int, input().split()))\nD = list(map(int, input().split()))\n\ncoupons = sorted([(L[i], D[i]) for i in range(M)], reverse=True)\n\npq = []\nfor p in P:\n while len(pq) and pq[0] < p:\n heappop(pq)\n if len(pq) and coupons:\n if coupons[-1][0] <= p:\n heappush(pq, p - coupons[-1][1])\n coupons.pop()\n else:\n heappush(pq, p)\n else:\n heappush(pq, p)\n\nprint(sum(pq))", "import sys\n\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\nP = list(map(int, input().split()))\nL = list(map(int, input().split()))\nD = list(map(int, input().split()))\n\ncoupon = sorted([(L[i], D[i]) for i in range(M)], reverse=True)\n\nans = 0\nfor p in P:\n for l, d in coupon:\n if p >= l:\n ans += p - d\n coupon.remove((l, d))\n break\n else:\n ans += p\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\nP = list(map(int, input().split()))\nL = list(map(int, input().split()))\nD = list(map(int, input().split()))\n\ncoupon = sorted([(L[i], D[i]) for i in range(M)], reverse=True)\nP.sort(reverse=True)\n\nans = 0\nfor p in P:\n for l, d in coupon:\n if p >= l:\n ans += p - d\n coupon.remove((l, d))\n break\n else:\n ans += p\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\nP = list(map(int, input().split()))\nL = list(map(int, input().split()))\nD = list(map(int, input().split()))\n\ncoupon = sorted([(L[i], D[i]) for i in range(M)], reverse=True)\n\nans = 0\nfor p in P:\n for l, d in coupon:\n if p >= l:\n ans += p - d\n coupon.remove((l, d))\n break\n else:\n ans += p\n\nprint(ans)", "from heapq import heappush, heappop\n\nN, M = map(int, input().split())\nP = list(map(int, input().split()))\nL = list(map(int, input().split()))\nD = list(map(int, input().split()))\n\ncoupon = []\nfor i in range(M):\n coupon.append((L[i], D[i]))\ncoupon.sort()\n\npq = []\nfor p in P:\n heappush(pq, -p)\n\nans = 0\nfor l, d in coupon:\n while pq and -pq[0] < l:\n ans -= heappop(pq)\n if pq:\n ans += -heappop(pq) - d\n\nwhile pq:\n ans -= heappop(pq)\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "a, b = map(int, input().split())\r\nif abs(a - b) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a, b = map(int, input().split())\r\nif abs(a - b) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r", "a, b = map(int, input().split())\r\nif abs(a - b) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r", "a, b = map(int, input().split())\r\nif abs(a - b) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r", "a, b = map(int, input().split())\r\nif abs(a - b) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r", "a, b = map(int, input().split())\r\nif abs(a - b) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r", "a, b = map(int, input().split())\r\nif abs(a - b) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r", "a, b = map(int, input().split())\r\nif abs(a - b) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r", "a, b = map(int, input().split())\r\nif abs(a - b) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r", "a, b = map(int, input().split())\r\nif abs(a - b) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = [list(map(int, input())) for _ in range(n)]\n\nfor i in range(n):\n a[i][0], a[i][-1] = a[i][-1], a[0][i]\n a[0][i], a[-1][i] = a[-1][i], a[i][0]\n\nfor i in range(n):\n print(\"\".join(map(str, a[i])))", "n = int(input())\na = [list(map(int, input())) for _ in range(n)]\n\nfor i in range(n):\n a[i][0], a[i][1] = a[i][1], a[i][0]\n a[i][-1], a[i][-2] = a[i][-2], a[i][-1]\nfor i in range(1, n - 1):\n a[0][i], a[1][i] = a[1][i], a[0][i]\n a[n - 1][i], a[n - 2][i] = a[n - 2][i], a[n - 1][i]\n\nfor i in range(n):\n for j in range(n):\n print(a[i][j], end=\"\")\n print()", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, list(input()))))\nfor i in range(n):\n if i == 0:\n a[i][0], a[i][1] = a[i][1], a[i][0]\n elif i == n - 1:\n a[i][n - 1], a[i][n - 2] = a[i][n - 2], a[i][n - 1]\n a[i][0], a[i][n - 1] = a[i][1], a[i][n - 2]\nfor i in range(1, n - 1):\n a[0][i], a[n - 1][i] = a[1][i], a[n - 2][i]\nfor i in a:\n print(\"\".join(map(str, i)))", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, list(input()))))\n\nfor i in range(n):\n for j in range(1, n):\n a[i][j] = a[i][j - 1]\n a[i][0] = a[i - 1][0]\n\nfor i in range(n):\n print(\"\".join(map(str, a[i])))", "n = int(input())\na = [list(map(int, input())) for _ in range(n)]\n\nfor i in range(n):\n a[i][0], a[i][-1] = a[i][-1], a[i][0]\nfor i in range(1, n):\n a[0][i], a[n - 1][i] = a[n - 1][i], a[0][i]\n\nfor i in range(n):\n print(\"\".join(map(str, a[i])))", "n = int(input())\na = [list(map(int, input())) for _ in range(n)]\nfor i in range(n):\n a[i][0], a[i][-1] = a[i][-1], a[i][0]\nfor i in range(n):\n a[0][i], a[-1][i] = a[-1][i], a[0][i]\nfor i in a:\n print(*i, sep=\"\")", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(input()))\n\nfor i in range(n):\n for j in range(1, n):\n a[i][j] = a[i][j - 1]\n a[i][0] = a[i - 1][0]\n\nfor i in range(n):\n print(\"\".join(a[i]))", "n = int(input())\na = [list(map(int, input())) for _ in range(n)]\n\nfor i in range(n):\n a[i][0], a[i][-1] = a[i][-1], a[i][0]\nfor i in range(1, n):\n a[0][i], a[n - 1][i] = a[n - 1][i], a[0][i]\n\nfor i in range(n):\n print(\"\".join(map(str, a[i])))", "n = int(input())\na = [list(map(int, input())) for _ in range(n)]\nfor i in range(n):\n a[i][0], a[i][-1] = a[i][-1], a[i][0]\nfor i in range(n):\n a[0][i], a[-1][i] = a[-1][i], a[0][i]\nfor i in a:\n print(*i, sep=\"\")", "n = int(input())\na = [list(map(int, input())) for _ in range(n)]\n\nfor i in range(n):\n a[i][0], a[i][-1] = a[i][-1], a[i][0]\nfor i in range(1, n):\n a[0][i], a[n - 1][i] = a[n - 1][i], a[0][i]\n\nfor i in range(n):\n print(\"\".join(map(str, a[i])))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from heapq import heappush, heappop\n\n(n, k) = map(int, input().split())\nheap = []\nans = 1\nfor a, b in (map(int, input().split()) for _ in range(n)):\n heappush(heap, -b)\n while -heap[0] * (ans + a) <= k:\n ans += 1\n heappop(heap)\nprint(ans)", "(n, k) = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\na.sort(key=lambda x: x[0])\r\nans = 1\r\ns = 0\r\nfor i in range(n):\r\n s += a[i][1]\r\n if s <= k:\r\n print(1)\r\n exit()\r\n if a[i][0] > ans:\r\n ans += 1\r\n s -= a[i][1]\r\nprint(ans)\r", "(n, k) = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\na.sort(key=lambda x: x[0])\r\nans = 1\r\ns = 0\r\nfor i in range(n):\r\n s += a[i][1]\r\n if s <= k:\r\n ans = max(ans, a[i][0] + 1)\r\nprint(ans)\r", "def main():\n (n, k) = map(int, input().split())\n a = []\n b = []\n for i in range(n):\n (x, y) = map(int, input().split())\n a.append(x)\n b.append(y)\n a.sort()\n b.sort()\n ans = 1\n for i in range(n):\n if b[i] > k:\n ans += a[i] - 1\n print(ans)\n\n\nmain()", "(n, k) = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n (x, y) = map(int, input().split())\r\n a.append((x, y))\r\na.sort()\r\nans = 0\r\ns = 0\r\nfor i in range(n):\r\n s += a[i][1]\r\n ans = max(ans, a[i][0])\r\n if s <= k:\r\n print(ans + 1)\r\n exit()\r", "import sys\n\ninput = sys.stdin.readline\n(N, K) = map(int, input().split())\nmeds = []\nfor i in range(N):\n (a, b) = map(int, input().split())\n meds.append((a, b))\nmeds.sort()\nans = 0\ntotal = 0\nfor a, b in meds:\n total += b\n ans += a\n if total <= K:\n break\nprint(ans + 1)", "import sys\n\ninput = sys.stdin.readline\n(n, k) = map(int, input().split())\na = []\nfor i in range(n):\n (x, y) = map(int, input().split())\n a.append((x, y))\na.sort()\nans = 1\ns = 0\nfor i in range(n):\n s += a[i][1]\n ans = max(ans, a[i][0] + 1)\n if s <= k:\n print(ans)\n exit()", "(n, k) = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\na.sort(key=lambda x: x[0])\r\nans = 1\r\ns = 0\r\nfor i in range(n):\r\n s += a[i][1]\r\n if a[i][0] > 1:\r\n s -= (a[i][0] - 1) * a[i][1] // a[i][0]\r\n if s <= k:\r\n print(ans)\r\n break\r\n ans += 1\r\nelse:\r\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n(N, K) = map(int, input().split())\nmeds = []\nfor i in range(N):\n (a, b) = map(int, input().split())\n meds.append((a, b))\nmeds.sort()\nans = 0\ntotal = 0\nfor a, b in meds:\n total += b\n ans += a\n if total <= K:\n print(ans)\n break\nelse:\n print(ans + 1)", "def main():\n (n, k) = map(int, input().split())\n a = []\n b = []\n for i in range(n):\n (ai, bi) = map(int, input().split())\n a.append(ai)\n b.append(bi)\n a.sort()\n b.sort()\n ans = 1\n s = 0\n for i in range(n):\n s += b[i]\n if s <= k:\n break\n ans = max(ans, a[i])\n print(ans)\n\n\nmain()" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\nn1, n2, m = map(int, input().split())\nab = [list(map(int, input().split())) for _ in range(m)]\n\ng1 = [[] for _ in range(n1 + 1)]\ng2 = [[] for _ in range(n2 + 1)]\nfor a, b in ab:\n if a <= n1:\n g1[a].append(b)\n else:\n g2[a - n1].append(b - n1)\n\nd1 = [-1] * (n1 + 1)\nd1[1] = 0\nq = deque([1])\nwhile q:\n v = q.popleft()\n for nv in g1[v]:\n if d1[nv] == -1:\n d1[nv] = d1[v] + 1\n q.append(nv)\n\nd2 = [-1] * (n2 + 1)\nd2[1] = 0\nq = deque([1])\nwhile q:\n v = q.popleft()\n for nv in g2[v]:\n if d2[nv] == -1:\n d2[nv] = d2[v] + 1\n q.append(nv)\n\nans = 0\nfor a, b in ab:\n if d1[a] != -1 and d2[b - n1] != -1:\n ans = max(ans, d1[a] + d2[b - n1] + 1)\nprint(ans)", "from collections import deque\n\nn1, n2, m = map(int, input().split())\nab = [list(map(int, input().split())) for _ in range(m)]\n\ng1 = [[] for _ in range(n1 + 1)]\ng2 = [[] for _ in range(n2 + 1)]\nfor a, b in ab:\n if a <= n1:\n g1[a].append(b)\n else:\n g2[a - n1].append(b)\n\nd1 = [-1] * (n1 + 1)\nd2 = [-1] * (n2 + 1)\nd1[1] = 0\ndq = deque([1])\nwhile dq:\n v = dq.popleft()\n for nv in g1[v]:\n if d1[nv] == -1:\n d1[nv] = d1[v] + 1\n dq.append(nv)\nd2[0] = 0\ndq = deque([0])\nwhile dq:\n v = dq.popleft()\n for nv in g2[v]:\n if d2[nv] == -1:\n d2[nv] = d2[v] + 1\n dq.append(nv)\n\nans = 0\nfor a, b in ab:\n if d1[a] != -1 and d2[b - n1] != -1:\n ans = max(ans, d1[a] + d2[b - n1] + 1)\nprint(ans)", "from collections import deque\n\nn1, n2, m = map(int, input().split())\n\nab = [list(map(int, input().split())) for _ in range(m)]\n\ng1 = [[] for _ in range(n1 + 1)]\ng2 = [[] for _ in range(n2 + 1)]\n\nfor a, b in ab:\n if a <= n1:\n g1[a].append(b)\n else:\n g2[a - n1].append(b - n1)\n\ndist = [-1] * (n1 + n2 + 1)\ndist[1] = 0\nq = deque([1])\n\nwhile q:\n v = q.popleft()\n for nv in g1[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + 1\n q.append(nv)\n for nv in g2[v - n1]:\n if dist[nv + n1] == -1:\n dist[nv + n1] = dist[v] + 1\n q.append(nv + n1)\n\nans = dist[n1 + n2]\nfor a, b in ab:\n if 1 <= a <= n1 and n1 + 1 <= b <= n1 + n2:\n ans = max(ans, dist[a] + dist[b] + 1)\n\nprint(ans)", "from collections import deque\n\nn1, n2, m = map(int, input().split())\nab = [list(map(int, input().split())) for _ in range(m)]\n\ng1 = [[] for _ in range(n1 + 1)]\ng2 = [[] for _ in range(n2 + 1)]\nfor a, b in ab:\n if a <= n1:\n g1[a].append(b)\n else:\n g2[a - n1].append(b)\n\nq = deque([1])\ndist = [0] * (n1 + n2 + 1)\nwhile q:\n v = q.popleft()\n for nv in g1[v]:\n if dist[nv] == 0:\n dist[nv] = dist[v] + 1\n q.append(nv)\n for nv in g2[v]:\n if dist[nv] == 0:\n dist[nv] = dist[v] + 1\n q.append(nv)\n\nprint(dist[n1 + n2])", "from collections import deque\n\nn1, n2, m = map(int, input().split())\n\ng1 = [[] for _ in range(n1 + 1)]\ng2 = [[] for _ in range(n2 + 1)]\n\nfor _ in range(m):\n a, b = map(int, input().split())\n if a <= n1:\n g1[a].append(b)\n else:\n g2[a - n1].append(b - n1)\n\ndist = [-1] * (n1 + n2 + 1)\ndist[1] = 0\nq = deque([1])\n\nwhile q:\n v = q.popleft()\n for nv in g1[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + 1\n q.append(nv)\n for nv in g2[v - n1]:\n if dist[nv + n1] == -1:\n dist[nv + n1] = dist[v] + 1\n q.append(nv + n1)\n\nprint(dist[n1 + n2])", "from collections import deque\n\nn1, n2, m = map(int, input().split())\n\ngraph = [[] for _ in range(n1 + n2 + 1)]\n\nfor _ in range(m):\n a, b = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\n\ndist = [-1] * (n1 + n2 + 1)\ndist[1] = 0\nq = deque([1])\n\nwhile q:\n v = q.popleft()\n for nv in graph[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + 1\n q.append(nv)\n\nans = dist[n1 + n2]\nfor v in range(1, n1 + 1):\n for nv in graph[v]:\n if n1 + 1 <= nv <= n1 + n2:\n ans = max(ans, dist[v] + dist[nv])\n\nprint(ans + 1)", "from collections import deque\n\nn1, n2, m = map(int, input().split())\n\ngraph = [[] for _ in range(n1 + n2 + 1)]\n\nfor _ in range(m):\n a, b = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\n\ndist = [-1] * (n1 + n2 + 1)\ndist[1] = 0\nq = deque([1])\n\nwhile q:\n node = q.popleft()\n for nei in graph[node]:\n if dist[nei] == -1:\n dist[nei] = dist[node] + 1\n q.append(nei)\n\nans = dist[n1 + n2]\nfor i in range(1, n1 + 1):\n for j in range(n1 + 1, n1 + n2 + 1):\n if j in graph[i]:\n ans = max(ans, dist[i] + dist[j] + 1)\n\nprint(ans)", "from collections import deque\n\nn1, n2, m = map(int, input().split())\nab = [list(map(int, input().split())) for _ in range(m)]\n\ng1 = [[] for _ in range(n1 + 1)]\ng2 = [[] for _ in range(n2 + 1)]\nfor a, b in ab:\n if a <= n1:\n g1[a].append(b)\n else:\n g2[a - n1].append(b - n1)\n\nd1 = [-1] * (n1 + 1)\nd2 = [-1] * (n2 + 1)\nd1[1] = 0\nq = deque([1])\nwhile q:\n v = q.popleft()\n for nv in g1[v]:\n if d1[nv] == -1:\n d1[nv] = d1[v] + 1\n q.append(nv)\nd2[0] = 0\nq = deque([0])\nwhile q:\n v = q.popleft()\n for nv in g2[v]:\n if d2[nv] == -1:\n d2[nv] = d2[v] + 1\n q.append(nv)\n\nans = 0\nfor i in range(1, n1 + 1):\n for j in range(n2):\n ans = max(ans, d1[i] + d2[j] + 1)\nprint(ans)", "from collections import deque\n\nn1, n2, m = map(int, input().split())\nab = [list(map(int, input().split())) for _ in range(m)]\n\ng1 = [[] for _ in range(n1 + 1)]\ng2 = [[] for _ in range(n2 + 1)]\nfor a, b in ab:\n if a <= n1:\n g1[a].append(b)\n else:\n g2[a - n1].append(b - n1)\n\ndist = [-1] * (n1 + n2 + 1)\ndist[1] = 0\nq = deque([1])\nwhile q:\n v = q.popleft()\n for nv in g1[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + 1\n q.append(nv)\n for nv in g2[v - n1]:\n if dist[nv + n1] == -1:\n dist[nv + n1] = dist[v] + 1\n q.append(nv + n1)\n\nans = dist[n1 + n2]\nfor a, b in ab:\n if a <= n1 and b > n1:\n ans = max(ans, dist[a] + dist[b - n1] + 1)\nprint(ans)", "from collections import deque\r\n\r\nn1, n2, m = map(int, input().split())\r\nab = [list(map(int, input().split())) for _ in range(m)]\r\n\r\ng1 = [[] for _ in range(n1 + 1)]\r\ng2 = [[] for _ in range(n2 + 1)]\r\nfor a, b in ab:\r\n if a <= n1:\r\n g1[a].append(b)\r\n else:\r\n g2[a - n1].append(b - n1)\r\n\r\nd1 = [-1] * (n1 + 1)\r\nd2 = [-1] * (n2 + 1)\r\nd1[1] = 0\r\nq = deque([1])\r\nwhile q:\r\n v = q.popleft()\r\n for nv in g1[v]:\r\n if d1[nv] == -1:\r\n d1[nv] = d1[v] + 1\r\n q.append(nv)\r\nd2[0] = 0\r\nq = deque([0])\r\nwhile q:\r\n v = q.popleft()\r\n for nv in g2[v]:\r\n if d2[nv] == -1:\r\n d2[nv] = d2[v] + 1\r\n q.append(nv)\r\n\r\nans = 0\r\nfor i in range(1, n1 + 1):\r\n for j in range(n2):\r\n ans = max(ans, d1[i] + d2[j] + 1)\r\nprint(ans)\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\n(n, m) = map(int, input().split())\np = [0] + list(map(int, input().split()))\ncovered = [False] * (n + 1)\nfor _ in range(m):\n (x, y) = map(int, input().split())\n q = deque([x])\n for _ in range(y):\n q.extend(p[i] for i in q if i <= n)\n for i in q:\n covered[i] = True\nprint(sum(covered))", "from collections import deque\n\n(n, m) = map(int, input().split())\np = list(map(int, input().split()))\np = [0] + p\ncovered = [False] * (n + 1)\nfor _ in range(m):\n (x, y) = map(int, input().split())\n q = deque([x])\n while q:\n node = q.popleft()\n if not covered[node]:\n covered[node] = True\n q.extend([i for i in range(n + 1) if p[i] == node])\n if y == 0:\n break\n y -= 1\nprint(sum(covered))", "from collections import deque\n\n(n, m) = map(int, input().split())\np = [0] + list(map(int, input().split()))\ncovered = [False] * (n + 1)\nfor _ in range(m):\n (x, y) = map(int, input().split())\n q = deque([x])\n for _ in range(y):\n q.extend(p[i] for i in q if i <= n)\n for i in q:\n covered[i] = True\nprint(sum(covered))", "from collections import deque\n\n(n, m) = map(int, input().split())\np = list(map(int, input().split()))\nassert 1 <= n <= 3 * 10**5\nassert 1 <= m <= 3 * 10**5\nassert all(1 <= i <= n for i in p)\n\nparents = [[] for _ in range(n)]\nfor i, pi in enumerate(p, 2):\n parents[pi - 1].append(i)\n\ncovered = [False] * (n + 1)\ncovered_count = 0\nfor _ in range(m):\n (x, y) = map(int, input().split())\n assert 1 <= x <= n\n assert 0 <= y <= 3 * 10**5\n q = deque([x])\n while q:\n node = q.popleft()\n if not covered[node]:\n covered[node] = True\n covered_count += 1\n for child in parents[node - 1]:\n if y > 0:\n q.append(child)\n y -= 1\n\nprint(covered_count)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\nP = list(map(int, input().split()))\n\nX = [0] * M\nY = [0] * M\n\nfor i in range(M):\n X[i], Y[i] = list(map(int, input().split()))\n\nparent = [[] for i in range(N + 1)]\nfor i in range(1, N):\n parent[P[i - 1]].append(i)\n\ncovered = [False] * (N + 1)\n\nfor i in range(M):\n stack = [X[i]]\n for j in stack:\n if covered[j] == False:\n covered[j] = True\n stack.extend(parent[j])\n\nprint(covered.count(True))", "from collections import deque\n\n(n, m) = map(int, input().split())\nparents = list(map(int, input().split()))\nassert 1 <= n <= 3 * 10**5\nassert 1 <= m <= 3 * 10**5\nassert all(1 <= p <= i - 1 for i, p in enumerate(parents, 2))\n\nfamily = [[] for _ in range(n)]\nfor i, p in enumerate(parents, 2):\n family[p - 1].append(i)\n\ncovered = [False] * n\nfor _ in range(m):\n (x, y) = map(int, input().split())\n x -= 1\n assert 0 <= x < n\n assert 0 <= y <= 3 * 10**5\n q = deque([x])\n while q:\n person = q.popleft()\n if covered[person]:\n continue\n covered[person] = True\n for child in family[person]:\n q.append(child)\n if y > 0:\n y -= 1\n else:\n break\n\nprint(sum(covered))", "from collections import deque\n\n(n, m) = map(int, input().split())\nparents = list(map(int, input().split()))\nassert len(parents) == n - 1\n\nfamily = [[] for _ in range(n)]\nfor i, p in enumerate(parents, 2):\n family[p - 1].append(i)\n\ncovered = [False] * (n + 1)\nfor _ in range(m):\n (x, y) = map(int, input().split())\n q = deque([x])\n while q:\n person = q.popleft()\n if covered[person] is False:\n covered[person] = True\n for child in family[person - 1]:\n q.append(child)\n y -= 1\n if y == 0:\n break\n\nprint(sum(covered))", "from collections import defaultdict\n\n(n, m) = map(int, input().split())\nparents = list(map(int, input().split()))\nassert len(parents) == n - 1\n\nfamily = defaultdict(list)\nfor i, p in enumerate(parents, 2):\n family[p].append(i)\n\ncovered = set()\nfor _ in range(m):\n (x, y) = map(int, input().split())\n covered.add(x)\n for _ in range(y):\n x = family[x]\n if x:\n x = x[0]\n covered.add(x)\n\nprint(len(covered))", "from collections import deque\n\n(n, m) = map(int, input().split())\np = [0] + list(map(int, input().split()))\ncovered = [False] * (n + 1)\nfor _ in range(m):\n (x, y) = map(int, input().split())\n q = deque([x])\n for _ in range(y):\n q.extend(i for i in (p[j] for j in q) if i)\n for j in q:\n covered[j] = True\nprint(sum(covered))", "from collections import deque\n\n(n, m) = map(int, input().split())\np = [0] + list(map(int, input().split()))\ncovered = [False] * (n + 1)\nfor _ in range(m):\n (x, y) = map(int, input().split())\n q = deque([x])\n for _ in range(y):\n q.extend(p[i] for i in q if i > 0)\n for i in q:\n covered[i] = True\nprint(sum(covered))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, p, q = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nprint(min(p, q + min(d)))\r", "n, p, q = map(int, input().split())\nd = list(map(int, input().split()))\nprint(min(p, q + min(d)))", "n, p, q = map(int, input().split())\nd = list(map(int, input().split()))\nprint(min(p, q + min(d)))", "n, p, q = map(int, input().split())\nd = list(map(int, input().split()))\nprint(min(p, q + min(d)))", "n, p, q = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nprint(min(p, q + min(d)))\r", "n, p, q = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nprint(min(p, q + min(d)))\r", "n, p, q = map(int, input().split())\nd = list(map(int, input().split()))\nprint(min(p, q + min(d)))", "n, p, q = map(int, input().split())\nd = list(map(int, input().split()))\nprint(min(p, q + min(d)))", "n, p, q = map(int, input().split())\nd = list(map(int, input().split()))\nprint(min(p, q + min(d)))", "n, p, q = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nprint(min(p, q + min(d)))\r" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\np = []\nc = []\nfor i in range(n):\n a = list(map(int, input().split()))\n p.append(a[0])\n c.append(a[1:])\nans = \"No\"\nfor i in range(n):\n for j in range(i + 1, n):\n if p[i] >= p[j] and all(x in c[j] for x in c[i]) and (p[i] > p[j] or any(x not in c[i] for x in c[j])):\n ans = \"Yes\"\nprint(ans)", "n, m = map(int, input().split())\nproducts = []\nfor i in range(n):\n p, c = map(int, input().split()[:2])\n f = set(map(int, input().split()[1:])[:c])\n products.append((p, f))\n\nfor i in range(n):\n for j in range(i + 1, n):\n p1, f1 = products[i]\n p2, f2 = products[j]\n if p1 >= p2 and f1.issubset(f2) and (p1 > p2 or len(f2 - f1) > 0):\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\nproducts = []\nfor _ in range(n):\n p, c = map(int, input().split()[:2])\n f = set(map(int, input().split()[1:])[:c])\n products.append((p, f))\n\nfor i in range(n):\n for j in range(i + 1, n):\n p1, f1 = products[i]\n p2, f2 = products[j]\n if p1 >= p2 and f1.issubset(f2) and (p1 > p2 or len(f2 - f1) > 0):\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\n\nproducts = []\nfor _ in range(n):\n p, c = map(int, input().split()[:2])\n f = set(map(int, input().split()[1:])[:c])\n products.append((p, f))\n\nfor i in range(n):\n for j in range(i + 1, n):\n p1, f1 = products[i]\n p2, f2 = products[j]\n if p1 >= p2 and f1.issubset(f2) and (p1 > p2 or len(f2 - f1) > 0):\n print(\"Yes\")\n exit()\n\nprint(\"No\")", "n, m = map(int, input().split())\nproducts = []\nfor _ in range(n):\n p, c = map(int, input().split()[:2])\n f = set(map(int, input().split()[1:])[:c])\n products.append((p, f))\n\nfor i in range(n):\n for j in range(i + 1, n):\n p1, f1 = products[i]\n p2, f2 = products[j]\n if p1 >= p2 and f1.issubset(f2) and (p1 > p2 or len(f2 - f1) > 0):\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\nproducts = []\nfor _ in range(n):\n p, c = map(int, input().split()[:2])\n f = set(map(int, input().split()[1:])[:c])\n products.append((p, f))\n\nfor i in range(n):\n for j in range(i + 1, n):\n p1, f1 = products[i]\n p2, f2 = products[j]\n if p1 >= p2 and f1.issubset(f2) and (p1 > p2 or len(f2 - f1) > 0):\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\nproducts = []\nfor _ in range(n):\n p, c = map(int, input().split()[:2])\n f = set(map(int, input().split()[2:])[:c])\n products.append((p, f))\n\nfor i in range(n):\n for j in range(i + 1, n):\n if products[i][0] >= products[j][0] and products[i][1].issubset(products[j][1]):\n if products[i][0] > products[j][0] or not products[j][1].issubset(products[i][1]):\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\nproducts = []\nfor _ in range(n):\n p, c = map(int, input().split()[:2])\n f = set(map(int, input().split()[1:])[:c])\n products.append((p, f))\n\nfor i in range(n):\n for j in range(i + 1, n):\n p1, f1 = products[i]\n p2, f2 = products[j]\n if p1 >= p2 and f1.issubset(f2) and (p1 > p2 or len(f2 - f1) > 0):\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\n\nproducts = []\nfor _ in range(n):\n p, c = map(int, input().split()[:2])\n f = set(map(int, input().split()[1:])[:c])\n products.append((p, f))\n\nfor i in range(n):\n for j in range(i + 1, n):\n p1, f1 = products[i]\n p2, f2 = products[j]\n if p1 >= p2 and f1.issubset(f2) and (p1 > p2 or len(f2 - f1) > 0):\n print(\"Yes\")\n exit()\n\nprint(\"No\")", "n, m = map(int, input().split())\np = []\nc = []\nfor i in range(n):\n t = list(map(int, input().split()))\n p.append(t[0])\n c.append(t[1:])\nans = \"No\"\nfor i in range(n):\n for j in range(i + 1, n):\n if p[i] >= p[j] and set(c[i][1:]).issubset(set(c[j][1:])) and (p[i] > p[j] or not set(c[j][1:]).issubset(set(c[i][1:]))):\n ans = \"Yes\"\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ns = set()\nfor i in range(n):\n x = input()\n if x not in s:\n s.add(x)\n else:\n continue\n y = x[::-1]\n if y not in s:\n s.add(y)\nprint(len(s))", "n = int(input())\r\ns = set()\r\nfor i in range(n):\r\n ss = input()\r\n if ss not in s:\r\n s.add(ss)\r\n s.add(ss[::-1])\r\nprint(len(s))\r", "n = int(input())\ns = set()\nfor i in range(n):\n ss = input()\n if ss not in s:\n s.add(ss)\n else:\n continue\n if ss[::-1] not in s:\n s.add(ss[::-1])\n else:\n continue\nprint(len(s))", "n = int(input())\r\ns = set()\r\nfor i in range(n):\r\n t = input()\r\n if t not in s:\r\n s.add(t)\r\n else:\r\n continue\r\n if t[::-1] not in s:\r\n s.add(t[::-1])\r\nprint(len(s))\r", "n = int(input())\r\ns = set()\r\nfor i in range(n):\r\n t = input()\r\n if t not in s:\r\n s.add(t)\r\n else:\r\n continue\r\n if t[::-1] not in s:\r\n s.add(t[::-1])\r\nprint(len(s))\r", "n = int(input())\r\ns = set()\r\nfor i in range(n):\r\n t = input()\r\n if t not in s:\r\n s.add(t)\r\n else:\r\n continue\r\n if t[::-1] not in s:\r\n s.add(t[::-1])\r\nprint(len(s))\r", "n = int(input())\r\ns = set()\r\nfor i in range(n):\r\n st = input()\r\n if st not in s:\r\n s.add(st)\r\n s.add(st[::-1])\r\nprint(len(s))\r", "n = int(input())\r\ns = set()\r\nfor i in range(n):\r\n t = input()\r\n if t in s:\r\n continue\r\n if t[::-1] in s:\r\n continue\r\n s.add(t)\r\nprint(len(s))\r", "n = int(input())\ns = set()\nfor i in range(n):\n x = input()\n if x not in s:\n s.add(x)\n else:\n continue\n y = x[::-1]\n if y not in s:\n s.add(y)\nprint(len(s))", "n = int(input())\r\ns = set()\r\nfor i in range(n):\r\n t = input()\r\n if t in s:\r\n continue\r\n if t[::-1] in s:\r\n continue\r\n s.add(t)\r\nprint(len(s))\r" ], "pass1_list": [ false, false, false, false, false, false, false, true, false, true ], "metadata_list": [] }, { "code_list": [ "n, t, m = map(int, input().split())\npairs = []\nfor i in range(m):\n pairs.append(tuple(map(int, input().split())))\n\ndp = [[0] * (1 << n) for i in range(t + 1)]\ndp[0][0] = 1\nfor i in range(1, t + 1):\n for j in range((1 << n) - 1, -1, -1):\n dp[i][j] = dp[i - 1][j] * (n - j.bit_count())\n for pair in pairs:\n if j & (1 << (pair[0] - 1)) and j & (1 << (pair[1] - 1)):\n dp[i][j] -= dp[i - 1][j ^ (1 << (pair[0] - 1)) ^ (1 << (pair[1] - 1))]\nprint(dp[t][(1 << n) - 1])", "import sys\n\ninput = sys.stdin.readline\n\nN, T, M = map(int, input().split())\n\nAB = [list(map(int, input().split())) for i in range(M)]\n\nfor i in range(M):\n AB[i][0] -= 1\n AB[i][1] -= 1\n\ndp = [[0] * (1 << N) for i in range(T + 1)]\n\ndp[0][0] = 1\n\nfor i in range(M):\n for j in range(T):\n for k in range(1 << N):\n if k >> AB[i][0] & 1 and k >> AB[i][1] & 1:\n dp[j + 1][k ^ (1 << AB[i][0]) ^ (1 << AB[i][1])] += dp[j][k]\n\nans = 0\n\nfor i in range(1 << N):\n if bin(i).count(\"1\") == N // T:\n ans += dp[T][i]\n\nprint(ans)", "n, t, m = map(int, input().split())\npairs = [list(map(int, input().split())) for _ in range(m)]\n\ndp = [[0] * (1 << n) for _ in range(t + 1)]\ndp[0][0] = 1\n\nfor i in range(1, t + 1):\n for j in range((1 << n) - 1, -1, -1):\n dp[i][j] = dp[i - 1][j] * (n - j.bit_count())\n for pair in pairs:\n if j & (1 << (pair[0] - 1)) and j & (1 << (pair[1] - 1)):\n dp[i][j] -= dp[i - 1][j ^ (1 << (pair[0] - 1)) ^ (1 << (pair[1] - 1))]\n\nprint(sum(dp[t]) // t)", "import sys\n\ninput = sys.stdin.readline\n\nN, T, M = map(int, input().split())\n\nAB = [list(map(int, input().split())) for i in range(M)]\n\nfor i in range(M):\n AB[i][0] -= 1\n AB[i][1] -= 1\n\ndp = [[[0] * (1 << N) for i in range(T + 1)] for j in range(M + 1)]\n\nfor i in range(N):\n dp[0][1][1 << i] = 1\n\nfor i in range(M):\n for j in range(T + 1):\n for k in range(1 << N):\n dp[i + 1][j][k] = dp[i][j][k]\n if k & (1 << AB[i][0]) and k & (1 << AB[i][1]):\n dp[i + 1][j][k] += dp[i][j][k ^ (1 << AB[i][0]) ^ (1 << AB[i][1])]\n if j < T:\n dp[i + 1][j + 1][k | (1 << AB[i][0])] += dp[i][j][k]\n dp[i + 1][j + 1][k | (1 << AB[i][1])] += dp[i][j][k]\n\nans = 0\nfor i in range(1 << N):\n if bin(i).count(\"1\") == N:\n ans += dp[M][T][i]\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, T, M = map(int, input().split())\nAB = [list(map(int, input().split())) for i in range(M)]\n\nfor i in range(M):\n AB[i][0] -= 1\n AB[i][1] -= 1\n\ndp = [[0] * (1 << N) for i in range(T + 1)]\ndp[0][0] = 1\n\nfor i in range(M):\n a, b = AB[i]\n for j in range(T):\n for k in range(1 << N):\n if k & (1 << a) and k & (1 << b):\n dp[j + 1][k ^ (1 << a) ^ (1 << b)] += dp[j][k]\n\nans = 0\nfor i in range(1 << N):\n if bin(i).count(\"1\") == N:\n ans += dp[T][i]\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, T, M = map(int, input().split())\n\nAB = [list(map(int, input().split())) for i in range(M)]\n\nfor i in range(M):\n AB[i][0] -= 1\n AB[i][1] -= 1\n\ndp = [[[0] * (1 << N) for i in range(T + 1)] for j in range(M + 1)]\n\ndp[0][1][0] = 1\n\nfor i in range(M):\n for j in range(1, T + 1):\n for k in range((1 << N) - 1, -1, -1):\n dp[i + 1][j][k] = dp[i][j][k]\n dp[i + 1][j][k | (1 << AB[i][0]) | (1 << AB[i][1])] = dp[i][j][k]\n\n for k in range((1 << N) - 1, -1, -1):\n if k >> AB[i][0] & 1 and k >> AB[i][1] & 1:\n dp[i + 1][j][k ^ (1 << AB[i][0])] += dp[i][j][k]\n dp[i + 1][j][k ^ (1 << AB[i][1])] += dp[i][j][k]\n\nans = 0\n\nfor i in range((1 << N) - 1, -1, -1):\n ans += dp[M][T][i]\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, T, M = list(map(int, input().split()))\n\nAB = [list(map(int, input().split())) for i in range(M)]\n\ndp = [[0] * (1 << N) for i in range(T + 1)]\n\ndp[0][0] = 1\n\nfor a, b in AB:\n for i in range(T + 1):\n for j in range(1 << N):\n dp[i][j | (1 << a - 1)] += dp[i][j]\n dp[i][j | (1 << b - 1)] += dp[i][j]\n\nfor i in range(T):\n for j in range(1 << N):\n dp[i + 1][j] += dp[i][j]\n\nans = 0\n\nfor i in range(1 << N):\n if bin(i).count(\"1\") == N and i.count(1) >= T:\n ans += dp[T][i]\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, T, M = map(int, input().split())\nAB = [list(map(int, input().split())) for i in range(M)]\n\nfor i in range(M):\n AB[i][0] -= 1\n AB[i][1] -= 1\n\ndp = [[[0] * (1 << N) for i in range(T + 1)] for j in range(M + 1)]\n\nfor i in range(N):\n dp[0][1][1 << i] = 1\n\nfor i in range(M):\n for j in range(T + 1):\n for k in range(1 << N):\n dp[i + 1][j][k] = dp[i][j][k]\n if k & (1 << AB[i][0]) and k & (1 << AB[i][1]):\n dp[i + 1][j][k] += dp[i][j][k ^ (1 << AB[i][0]) ^ (1 << AB[i][1])]\n if j < T:\n dp[i + 1][j + 1][k | (1 << AB[i][0])] += dp[i][j][k]\n dp[i + 1][j + 1][k | (1 << AB[i][1])] += dp[i][j][k]\n\nans = 0\nfor i in range(1 << N):\n if bin(i).count(\"1\") == N:\n ans += dp[M][T][i]\n\nprint(ans)", "from collections import defaultdict\n\nn, t, m = map(int, input().split())\npairs = defaultdict(set)\nfor _ in range(m):\n a, b = map(int, input().split())\n pairs[a].add(b)\n pairs[b].add(a)\n\ndp = [[0] * (1 << n) for _ in range(t + 1)]\ndp[0][0] = 1\nfor i in range(n):\n if not pairs[i + 1]:\n for j in range(t):\n dp[j + 1][1 << i] = dp[j][1 << i] * (t - j)\n\nfor i in range(1, 1 << n):\n for j in range(1, t + 1):\n if dp[j - 1][i] == 0:\n continue\n for k in range(n):\n if i >> k & 1:\n dp[j][i | 1 << k] += dp[j - 1][i] * (t - j + 1)\n for l in pairs[k + 1]:\n if i >> l & 1:\n dp[j][i | 1 << k] = 0\n break\n\nprint(dp[t][(1 << n) - 1])", "import sys\n\ninput = sys.stdin.readline\n\nN, T, M = map(int, input().split())\n\nAB = [list(map(int, input().split())) for i in range(M)]\n\nfor i in range(M):\n AB[i][0] -= 1\n AB[i][1] -= 1\n\ndp = [[[0] * (1 << N) for i in range(T + 1)] for j in range(M + 1)]\n\ndp[0][1][0] = 1\n\nfor i in range(M):\n for j in range(1, T + 1):\n for k in range(1 << N):\n dp[i + 1][j][k] = dp[i][j][k]\n if k & (1 << AB[i][0]) and k & (1 << AB[i][1]):\n dp[i + 1][j][k] += dp[i][j][k]\n else:\n dp[i + 1][j - 1][k | (1 << AB[i][0]) | (1 << AB[i][1])] += dp[i][j][k]\n\nans = 0\n\nfor i in range(1 << N):\n if bin(i).count(\"1\") == N:\n ans += dp[M][T][i]\n\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ns = input()\n\nans = 0\n\nfor i in range(n):\n if s[i] == '0':\n ans += i + 1\n\nfor i in range(n - 1, -1, -1):\n if s[i] == '1':\n ans += n - i\n\nprint(ans)", "n = int(input())\ns = input()\n\nans = 0\nfor i in range(n):\n if s[i] == \"0\":\n ans += i + 1\n\nfor i in range(n - 1, -1, -1):\n if s[i] == \"1\":\n ans += n - i\n\nprint(ans)", "n = int(input())\ns = input()\n\nans = 0\n\nfor i in range(n):\n if s[i] == \"0\":\n ans += i + 1\n\nfor i in range(n - 2, -1, -1):\n if s[i] == \"1\":\n ans += n - i\n\nprint(ans)", "n = int(input())\ns = input()\n\nans = 0\ncnt = 0\nfor i in range(n):\n if s[i] == '1':\n cnt += 1\n else:\n ans += cnt\n\nprint(ans)", "n = int(input())\ns = input()\n\nans = 0\ncnt = 0\nfor i in range(n):\n if s[i] == \"1\":\n cnt += 1\n else:\n ans += cnt\nprint(ans)", "n = int(input())\ns = input()\n\nans = 0\n\nfor i in range(n):\n if s[i] == \"0\":\n ans += i + 1\n\nfor i in range(n - 2, -1, -1):\n if s[i] == \"1\":\n ans += n - i\n\nprint(ans)", "n = int(input())\ns = input()\n\nans = 0\n\nfor i in range(n):\n if s[i] == \"0\":\n ans += i + 1\n else:\n ans += n - i\n\nprint(ans)", "n = int(input())\ns = input()\n\nans = 0\n\nfor i in range(n):\n if s[i] == '1':\n ans += i + 1\n\nfor i in range(n - 2, -1, -1):\n if s[i] == '1':\n ans += n - i\n\nprint(ans)", "n = int(input())\ns = input()\n\nans = 0\ncnt = 0\nfor i in range(n):\n if s[i] == \"0\":\n ans += cnt\n cnt = 0\n else:\n cnt += 1\nprint(ans + n)", "n = int(input())\ns = input()\n\nans = 0\ncnt = 0\nfor i in range(n):\n if s[i] == \"0\":\n ans += cnt\n cnt += 1\n else:\n cnt = 0\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "def main():\n n = int(input())\n a = list(map(int, input().split()))\n mod = 998244353\n dp = [[0] * 11 for _ in range(n + 1)]\n dp[0][0] = 1\n for i in range(n):\n for j in range(11):\n if a[i] >= j:\n dp[i + 1][j] += dp[i][j]\n dp[i + 1][j] %= mod\n dp[i + 1][j + 1] += dp[i][j]\n dp[i + 1][j + 1] %= mod\n ans = 0\n for i in range(1, n + 1):\n for j in range(n - i + 1):\n ans += dp[i][10 - i] * dp[n - j - i][j]\n ans %= mod\n print(ans)\n\n\nmain()", "mod = 998244353\nn = int(input())\na = list(map(int, input().split()))\ndp = [[0] * 11 for _ in range(n + 1)]\ndp[0][0] = 1\nfor i in range(n):\n for j in range(11):\n if a[i] >= j:\n dp[i + 1][j] += dp[i][j]\n dp[i + 1][j] %= mod\n dp[i + 1][j + 1] += dp[i][j]\n dp[i + 1][j + 1] %= mod\nans = 0\nfor i in range(n + 1):\n ans += dp[n][10] * (-1) ** i * dp[n][i]\n ans %= mod\nprint(ans * pow(dp[n][0], mod - 2, mod) % mod)", "def main():\n mod = 998244353\n n = int(input())\n a = list(map(int, input().split()))\n dp = [[0] * 11 for _ in range(n + 1)]\n dp[0][0] = 1\n for i in range(n):\n for j in range(11):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod\n if j + a[i] <= 10:\n dp[i + 1][j + a[i]] = (dp[i + 1][j + a[i]] + dp[i][j]) % mod\n ans = 0\n for i in range(n + 1):\n if dp[i][10] > 0:\n ans = (ans + dp[i][0] * pow(dp[i][10], mod - 2, mod) % mod) % mod\n print(ans)\n\n\nmain()", "def modinv(x, mod):\r\n return pow(x, mod - 2, mod)\r\n\r\ndef comb(n, r, mod):\r\n if r < 0 or r > n:\r\n return 0\r\n r = min(r, n - r)\r\n return g1[n] * g2[r] * g2[n - r] % mod\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n mod = 998244353\r\n g1 = [1] * (n + 1)\r\n g2 = [1] * (n + 1)\r\n inv = [1] * (n + 1)\r\n for i in range(1, n + 1):\r\n g1[i] = g1[i - 1] * i % mod\r\n inv[i] = modinv(i, mod)\r\n g2[i] = g2[i - 1] * inv[i] % mod\r\n dp = [[0] * 11 for _ in range(n + 1)]\r\n dp[0][0] = 1\r\n for i in range(n):\r\n for j in range(10):\r\n dp[i + 1][j + 1] += dp[i][j] * (a[i] - j)\r\n dp[i + 1][j + 1] %= mod\r\n dp[i + 1][j] += dp[i][j] * j\r\n dp[i + 1][j] %= mod\r\n ans = 0\r\n for i in range(1, n + 1):\r\n ans += comb(n, i, mod) * dp[n][10]\r\n ans %= mod\r\n print(ans * modinv(g1[n], mod) % mod)\r\n\r\nmain()\r", "def main():\n mod = 998244353\n n = int(input())\n a = list(map(int, input().split()))\n dp = [[0] * 11 for _ in range(n + 1)]\n dp[0][0] = 1\n for i in range(n):\n for j in range(11):\n if j + 1 <= a[i]:\n dp[i + 1][j + 1] += dp[i][j]\n if j >= 1:\n dp[i + 1][j - 1] += dp[i][j]\n dp[i + 1][j] += dp[i][j]\n for j in range(11):\n dp[i + 1][j] %= mod\n print((mod + dp[n][10] - dp[n][0]) % mod)\n\n\nmain()", "def main():\n mod = 998244353\n n = int(input())\n a = list(map(int, input().split()))\n dp = [[0] * (10 * n + 1) for _ in range(n + 1)]\n dp[0][0] = 1\n for i in range(n):\n for j in range(10 * n + 1):\n if dp[i][j] == 0:\n continue\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * (a[i] - j // n)) % mod\n dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j]) % mod\n print(dp[n][10])\n\n\nmain()", "def modinv(n, p):\r\n return pow(n, p - 2, p)\r\n\r\n\r\ndef comb(n, r, p):\r\n num = den = 1\r\n for i in range(r):\r\n num = num * (n - i) % p\r\n den = den * (i + 1) % p\r\n return num * modinv(den, p) % p\r\n\r\n\r\ndef solve(n, a, p):\r\n dp = [[0] * 11 for _ in range(n + 1)]\r\n dp[0][0] = 1\r\n for i in range(n):\r\n for j in range(11):\r\n if a[i] >= j:\r\n dp[i + 1][j] += dp[i][j]\r\n dp[i + 1][j] %= p\r\n if a[i] - 10 + j >= 0:\r\n dp[i + 1][j + a[i] - 10] += dp[i][j]\r\n dp[i + 1][j + a[i] - 10] %= p\r\n return dp[n][10]\r\n\r\n\r\ndef main():\r\n p = 998244353\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n print(solve(n, a, p))\r\n\r\n\r\nmain()\r", "def main():\n n = int(input())\n a = list(map(int, input().split()))\n mod = 998244353\n dp = [[0] * (10**6 + 1) for _ in range(n + 1)]\n dp[0][0] = 1\n for i in range(n):\n for j in range(a[i], 10**6 + 1):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j - a[i]]) % mod\n ans = 0\n for mask in range(1, 1 << n):\n s = sum(a[i] for i in range(n) if mask >> i & 1)\n if s == 10:\n ans = (ans + dp[n][0] * pow(dp[n][s], mod - 2, mod) % mod) % mod\n print(ans)\n\n\nmain()", "def modinv(x, mod):\r\n return pow(x, mod - 2, mod)\r\n\r\nmod = 998244353\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ndp = [[0] * 11 for _ in range(n + 1)]\r\ndp[0][0] = 1\r\nfor i in range(n):\r\n for j in range(11):\r\n if a[i] >= j:\r\n dp[i + 1][j] += dp[i][j]\r\n dp[i + 1][j] %= mod\r\n dp[i + 1][j + 1] += dp[i][j]\r\n dp[i + 1][j + 1] %= mod\r\nans = 0\r\nfor i in range(n + 1):\r\n ans += dp[n - i][10] * modinv(pow(2, i, mod), mod)\r\n ans %= mod\r\nprint(ans)\r", "def main():\n mod = 998244353\n n = int(input())\n a = list(map(int, input().split()))\n dp = [[0] * 11 for _ in range(n + 1)]\n dp[0][0] = 1\n for i in range(n):\n for j in range(10):\n dp[i + 1][j + 1] += dp[i][j] * (a[i] - j)\n dp[i + 1][j + 1] %= mod\n dp[i + 1][j] += dp[i][j] * (j + 1)\n dp[i + 1][j] %= mod\n ans = 0\n for i in range(n + 1):\n ans += dp[n][10 - i] * (-1) ** i * pow(i, mod - 2, mod)\n ans %= mod\n print(ans)\n\n\nmain()" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ns = input()\n\nabc = {\"A\", \"B\", \"C\"}\ncount = 0\nflag = False\nfor i in s:\n if i in abc:\n abc.remove(i)\n count += 1\n if len(abc) == 0:\n flag = True\n break\n\nif flag:\n print(count)\nelse:\n print(-1)", "n = int(input())\ns = input()\n\nabc = {\"A\", \"B\", \"C\"}\ncount = 0\nfor i in s:\n if i in abc:\n abc.remove(i)\n count += 1\n if len(abc) == 0:\n break\nprint(count)", "n = int(input())\ns = input()\nabc = [0, 0, 0]\nfor i in range(n):\n abc[ord(s[i]) - ord(\"A\")] += 1\n if abc[0] and abc[1] and abc[2]:\n print(i + 1)\n break", "n = int(input())\ns = input()\n\nabc = {\"A\", \"B\", \"C\"}\ncount = 0\nfor i in s:\n count += 1\n if abc.issubset(set(s[:count])):\n break\nprint(count)", "n = int(input())\ns = input()\n\nabc = {\"A\", \"B\", \"C\"}\ncount = 0\nfor i in s:\n count += 1\n if abc.issubset(set(s[:count])):\n break\nprint(count)", "n = int(input())\ns = input()\na, b, c = 0, 0, 0\nfor i in range(n):\n if s[i] == \"A\":\n a += 1\n if s[i] == \"B\":\n b += 1\n if s[i] == \"C\":\n c += 1\n if a and b and c:\n print(i + 1)\n break", "n = int(input())\ns = input()\n\nabc = {\"A\", \"B\", \"C\"}\ncount = 0\nfor i in s:\n count += 1\n if abc.issubset(set(s[:count])):\n break\nprint(count)", "n = int(input())\ns = input()\n\nabc = {\"A\", \"B\", \"C\"}\ncount = 0\nfor i in s:\n count += 1\n if abc.issubset(set(s[:count])):\n break\nprint(count)", "n = int(input())\ns = input()\nabc = {\"A\", \"B\", \"C\"}\ncount = 0\nfor i in s:\n if i in abc:\n abc.remove(i)\n count += 1\n if len(abc) == 0:\n break\nprint(count)", "n = int(input())\ns = input()\n\nabc = {\"A\", \"B\", \"C\"}\ncount = 0\nflag = False\nfor i in s:\n count += 1\n if abc.issubset(s[:count]):\n flag = True\n break\n\nif flag:\n print(count)\nelse:\n print(-1)" ], "pass1_list": [ false, false, true, true, true, true, true, true, false, true ], "metadata_list": [] }, { "code_list": [ "n, d = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nmax_count = 0\r\ncount = 0\r\nfor i in range(d):\r\n for j in range(n):\r\n if s[j][i] == \"o\":\r\n count += 1\r\n if count == n:\r\n max_count += 1\r\n else:\r\n count = 0\r\nprint(max_count)\r", "n, d = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nans = 0\r\nfor i in range(d):\r\n flag = 1\r\n for j in range(n):\r\n if s[j][i] == \"x\":\r\n flag = 0\r\n if flag:\r\n ans += 1\r\n for j in range(i + 1, d):\r\n flag = 1\r\n for k in range(n):\r\n if s[k][j] == \"x\":\r\n flag = 0\r\n if flag:\r\n ans += 1\r\n else:\r\n break\r\nprint(ans)\r", "n, d = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nans = 0\r\nfor i in range(d):\r\n flag = True\r\n for j in range(n):\r\n if s[j][i] == \"x\":\r\n flag = False\r\n break\r\n if flag:\r\n ans += 1\r\n for j in range(1, n):\r\n if s[j][i] == \"x\" and s[j - 1][i] == \"o\":\r\n flag = False\r\n break\r\n if flag:\r\n k = i\r\n while k < d and flag:\r\n for j in range(n):\r\n if s[j][k] == \"x\":\r\n flag = False\r\n break\r\n k += 1\r\n ans = max(ans, k - i)\r\n i = k - 1\r\nprint(ans)\r", "n, d = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nmax_len = 0\r\nfor i in range(d):\r\n if all(\"o\" == s[j][i] for j in range(n)):\r\n for j in range(i, d):\r\n if all(\"o\" == s[k][j] for k in range(n)):\r\n max_len = max(max_len, j - i + 1)\r\n else:\r\n break\r\nprint(max_len)\r", "n, d = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nmax_len = 0\r\nfor i in range(d):\r\n flag = 1\r\n for j in range(n):\r\n if s[j][i] == \"x\":\r\n flag = 0\r\n break\r\n if flag:\r\n for k in range(i, d):\r\n flag = 1\r\n for j in range(n):\r\n if s[j][k] == \"x\":\r\n flag = 0\r\n break\r\n if flag:\r\n max_len = max(max_len, k - i + 1)\r\n else:\r\n break\r\nprint(max_len)\r", "n, d = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nmax_len = 0\r\nfor i in range(d):\r\n flag = True\r\n for j in range(n):\r\n if s[j][i] == \"x\":\r\n flag = False\r\n break\r\n if flag:\r\n max_len = 1\r\n for k in range(i + 1, d):\r\n flag = True\r\n for l in range(n):\r\n if s[l][k] == \"x\":\r\n flag = False\r\n break\r\n if flag:\r\n max_len += 1\r\n else:\r\n break\r\nprint(max_len)\r", "n, d = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nmax_len = 0\r\nfor i in range(d):\r\n flag = True\r\n for j in range(n):\r\n if s[j][i] == \"x\":\r\n flag = False\r\n break\r\n if flag:\r\n max_len = max(max_len, 1)\r\n for k in range(i + 1, d):\r\n flag = True\r\n for j in range(n):\r\n if s[j][k] == \"x\":\r\n flag = False\r\n break\r\n if flag:\r\n max_len += 1\r\n else:\r\n break\r\nprint(max_len)\r", "n, d = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nans = 0\r\nfor i in range(d):\r\n flag = 1\r\n for j in range(n):\r\n if s[j][i] == \"x\":\r\n flag = 0\r\n if flag:\r\n ans += 1\r\n k = i\r\n while k < d and flag:\r\n flag = 1\r\n for j in range(n):\r\n if s[j][k] == \"x\":\r\n flag = 0\r\n if flag:\r\n ans += 1\r\n k += 1\r\n else:\r\n break\r\nprint(ans)\r", "n, d = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nans = 0\r\nfor i in range(d):\r\n flag = True\r\n for j in range(n):\r\n if s[j][i] == \"x\":\r\n flag = False\r\n break\r\n if flag:\r\n ans += 1\r\n k = i\r\n while k < d and flag:\r\n for j in range(n):\r\n if s[j][k] == \"x\":\r\n flag = False\r\n break\r\n if flag:\r\n ans += 1\r\n k += 1\r\nprint(ans)\r", "n, d = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nmax_count = 0\r\ncount = 0\r\nfor i in range(d):\r\n for j in range(n):\r\n if s[j][i] == \"o\":\r\n count += 1\r\n if count == n:\r\n max_count += 1\r\n else:\r\n count = 0\r\nprint(max_count)\r" ], "pass1_list": [ false, false, false, true, true, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = list(map(int, input().split()))\n\ngraph = [[] for _ in range(n + 1)]\nfor i in range(n):\n graph[i].append(a[i])\n\nvisited = [0] * (n + 1)\ncycle = []\n\ndef dfs(node):\n if visited[node] == 1:\n cycle.append(node)\n return True\n visited[node] = 1\n for next in graph[node]:\n if dfs(next):\n cycle.append(node)\n return True\n return False\n\nfor i in range(n):\n if visited[i] == 0:\n dfs(i)\n break\n\nprint(len(cycle))\nprint(*cycle)", "n = int(input())\na = list(map(int, input().split()))\n\ngraph = [[] for _ in range(n + 1)]\nfor i in range(n):\n graph[i].append(a[i])\n\nvisited = [0] * (n + 1)\n\nfor i in range(1, n + 1):\n if visited[i]:\n continue\n stack = [i]\n visited[i] = 1\n while stack:\n node = stack[-1]\n if not graph[node]:\n break\n next_node = graph[node][-1]\n if visited[next_node]:\n cycle = stack[visited[next_node] - 1 :]\n cycle.append(next_node)\n print(len(cycle))\n print(\" \".join(map(str, cycle)))\n exit()\n stack.append(next_node)\n visited[next_node] = len(stack)\n graph[node].pop()", "n = int(input())\na = list(map(int, input().split()))\n\ngraph = [[] for _ in range(n + 1)]\nfor i in range(n):\n graph[i].append(a[i])\n\nvisited = [False] * (n + 1)\n\ncycle = []\nfor i in range(1, n + 1):\n if visited[i]:\n continue\n stack = [i]\n while stack:\n node = stack[-1]\n if visited[node]:\n stack.pop()\n continue\n visited[node] = True\n stack.append(graph[node][0])\n if len(stack) > 1:\n cycle = stack\n break\n\nprint(len(cycle))\nprint(*cycle)", "n = int(input())\na = list(map(int, input().split()))\n\ngraph = [[] for _ in range(n + 1)]\nfor i in range(n):\n graph[i].append(a[i])\n\nvisited = [0] * (n + 1)\n\nfor i in range(1, n + 1):\n if visited[i]:\n continue\n stack = [i]\n visited[i] = 1\n while stack:\n node = stack[-1]\n if not graph[node]:\n cycle = stack.copy()\n cycle.pop()\n print(len(cycle))\n print(*cycle)\n exit()\n next_node = graph[node].pop()\n if visited[next_node]:\n continue\n visited[next_node] = 1\n stack.append(next_node)", "n = int(input())\na = list(map(int, input().split()))\n\ngraph = [[] for _ in range(n + 1)]\nfor i in range(n):\n graph[i].append(a[i])\n\nvisited = [False] * (n + 1)\ncycle = []\n\nfor i in range(1, n + 1):\n if not visited[i]:\n node = i\n while not visited[node]:\n visited[node] = True\n node = graph[node][0]\n cycle = [node]\n node = graph[node][0]\n while node != cycle[0]:\n visited[node] = True\n cycle.append(node)\n node = graph[node][0]\n break\n\nprint(len(cycle))\nprint(*cycle)", "n = int(input())\na = list(map(int, input().split()))\n\ngraph = [[] for _ in range(n + 1)]\nfor i in range(n):\n graph[i].append(a[i])\n\nvis = [0] * (n + 1)\n\ndef dfs(node):\n vis[node] = 1\n for nei in graph[node]:\n if vis[nei] == 1:\n print(len(path) + 1)\n print(\" \".join(map(str, [path[-1], nei] + path)))\n exit()\n elif vis[nei] == 0:\n path.append(nei)\n dfs(nei)\n path.pop()\n\nfor i in range(1, n + 1):\n if vis[i] == 0:\n path = [i]\n dfs(i)", "n = int(input())\na = [int(i) - 1 for i in input().split()]\n\ngraph = [[] for _ in range(n)]\nfor i in range(n):\n graph[i].append(a[i])\n\nvis = [0] * n\ncycle = []\n\nfor i in range(n):\n if vis[i] == 0:\n vis[i] = 1\n cycle.append(i)\n while graph[cycle[-1]][0] != cycle[-1]:\n vis[graph[cycle[-1]][0]] = 1\n cycle.append(graph[cycle[-1]][0])\n\nprint(len(cycle))\nprint(*cycle)", "n = int(input())\na = list(map(int, input().split()))\n\ng = [[] for _ in range(n + 1)]\nfor i in range(n):\n g[i].append(a[i])\n\nvis = [0] * (n + 1)\n\ndef dfs(x):\n vis[x] = 1\n for y in g[x]:\n if vis[y] == 1:\n print(len(path) + 1)\n print(\" \".join(map(str, [path[-1], y] + path)))\n exit()\n elif vis[y] == 0:\n path.append(y)\n dfs(y)\n path.pop()\n vis[x] = 2\n\npath = [a[0]]\ndfs(a[0])", "n = int(input())\na = list(map(int, input().split()))\n\ngraph = [[] for _ in range(n + 1)]\nfor i in range(n):\n graph[i].append(a[i])\n\ncycle = []\nv = 1\nwhile True:\n cycle.append(v)\n v = graph[v - 1][0]\n if v in cycle[:-1]:\n break\n\nprint(len(cycle))\nprint(\" \".join(map(str, cycle)))", "n = int(input())\na = list(map(int, input().split()))\n\ngraph = [[] for _ in range(n + 1)]\nfor i in range(n):\n graph[i].append(a[i])\n\nvisited = [False] * (n + 1)\ncycle = []\n\ndef dfs(node):\n visited[node] = True\n for next_node in graph[node]:\n if not visited[next_node]:\n cycle.append(next_node)\n dfs(next_node)\n elif next_node not in cycle:\n cycle.append(next_node)\n return\n\nfor i in range(n):\n if not visited[i]:\n dfs(i)\n break\n\nprint(len(cycle))\nprint(*cycle)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\nfrom collections import deque\n\ninput = sys.stdin.readline\n\nH, W = list(map(int, input().split()))\n\ngrid = []\nfor _ in range(H):\n grid.append(input().rstrip())\n\nice = 0\n\nvisited = [[False] * W for _ in range(H)]\n\ndx = [0, 0, -1, 1]\ndy = [-1, 1, 0, 0]\n\nq = deque([(1, 1)])\nvisited[1][1] = True\n\nwhile q:\n x, y = q.popleft()\n for i in range(4):\n nx = x + dx[i]\n ny = y + dy[i]\n if 0 <= nx < H and 0 <= ny < W:\n if not visited[nx][ny] and grid[nx][ny] == \".\":\n visited[nx][ny] = True\n q.append((nx, ny))\n ice += 1\n\nprint(ice)", "n, m = map(int, input().split())\r\n\r\nice = []\r\nfor i in range(n):\r\n s = input()\r\n ice.append(list(s))\r\n\r\nvisited = [[False] * m for i in range(n)]\r\n\r\ndef dfs(x, y):\r\n if x < 0 or x >= n or y < 0 or y >= m or ice[x][y] == '#' or visited[x][y]:\r\n return\r\n visited[x][y] = True\r\n for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\r\n dfs(x + dx, y + dy)\r\n\r\nans = 0\r\ndfs(1, 1)\r\nfor i in range(n):\r\n for j in range(m):\r\n if visited[i][j]:\r\n ans += 1\r\n\r\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nH, W = list(map(int, input().split()))\n\nice = []\nfor _ in range(H):\n ice.append(input().rstrip())\n\nvisited = [[False] * W for _ in range(H)]\n\ndx = [0, 0, -1, 1]\ndy = [-1, 1, 0, 0]\n\ndef dfs(x, y):\n visited[x][y] = True\n for i in range(4):\n nx = x + dx[i]\n ny = y + dy[i]\n while 0 <= nx < H and 0 <= ny < W and ice[nx][ny] == \".\":\n nx += dx[i]\n ny += dy[i]\n if 0 <= nx < H and 0 <= ny < W and ice[nx][ny] == \"#\":\n nx -= dx[i]\n ny -= dy[i]\n dfs(nx, ny)\n\ndfs(1, 1)\n\nprint((visited[1][1] + sum(sum(v) for v in visited[2:-1]) - 1) // 2)", "n, m = map(int, input().split())\ngrid = []\nfor i in range(n):\n grid.append(list(input()))\n\nvisited = [[False] * m for i in range(n)]\nq = [(1, 1)]\nvisited[1][1] = True\nice = 0\n\nwhile q:\n x, y = q.pop(0)\n ice += 1\n for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n nx, ny = x + dx, y + dy\n while 0 <= nx < n and 0 <= ny < m and grid[nx][ny] == \".\":\n if not visited[nx][ny]:\n visited[nx][ny] = True\n q.append((nx, ny))\n nx, ny = nx + dx, ny + dy\n\nprint(ice - 1)", "n, m = map(int, input().split())\ns = []\nfor i in range(n):\n s.append(input())\n\nice = 0\nvisited = [[False] * m for i in range(n)]\n\ndx = [0, 0, 1, -1]\ndy = [1, -1, 0, 0]\n\ndef dfs(x, y):\n global ice\n ice += 1\n visited[x][y] = True\n for i in range(4):\n nx = x + dx[i]\n ny = y + dy[i]\n while not visited[nx][ny] and s[nx][ny] == \".\":\n nx += dx[i]\n ny += dy[i]\n if not visited[nx][ny] and s[nx][ny] == \".\":\n dfs(nx, ny)\n\ndfs(1, 1)\nprint(ice - 1)", "import sys\nfrom collections import deque\n\ninput = sys.stdin.readline\n\ndx = [1, 0, -1, 0]\ndy = [0, 1, 0, -1]\n\nn, m = map(int, input().split())\nice = []\nfor _ in range(n):\n ice.append(list(input().rstrip()))\n\nice[0][0] = ice[n - 1][0] = ice[0][m - 1] = ice[n - 1][m - 1] = \"#\"\n\nvisited = [[False] * m for _ in range(n)]\nq = deque([(1, 1)])\nvisited[1][1] = True\n\nwhile q:\n x, y = q.popleft()\n for i in range(4):\n nx, ny = x + dx[i], y + dy[i]\n if 0 <= nx < n and 0 <= ny < m and not visited[nx][ny] and ice[nx][ny] == \".\":\n visited[nx][ny] = True\n q.append((nx, ny))\n\nans = 0\nfor i in range(n):\n for j in range(m):\n if visited[i][j] and ice[i][j] == \".\":\n ans += 1\n\nprint(ans)", "n, m = map(int, input().split())\r\ngrid = []\r\nfor i in range(n):\r\n grid.append(input())\r\n\r\nvisited = [[False] * m for _ in range(n)]\r\nice = 0\r\n\r\ndef dfs(x, y):\r\n global ice\r\n if x < 0 or x >= n or y < 0 or y >= m or grid[x][y] == '#' or visited[x][y]:\r\n return\r\n visited[x][y] = True\r\n ice += 1\r\n dfs(x + 1, y)\r\n dfs(x - 1, y)\r\n dfs(x, y + 1)\r\n dfs(x, y - 1)\r\n\r\ndfs(1, 1)\r\nprint(ice - 1)\r", "n, m = map(int, input().split())\r\ngrid = []\r\nfor i in range(n):\r\n grid.append(input())\r\n\r\nvisited = [[False] * m for i in range(n)]\r\nice = 0\r\nq = [(1, 1)]\r\nvisited[1][1] = True\r\nwhile q:\r\n x, y = q.pop(0)\r\n ice += 1\r\n for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\r\n nx, ny = x + dx, y + dy\r\n while 0 <= nx < n and 0 <= ny < m and grid[nx][ny] == \".\":\r\n if not visited[nx][ny]:\r\n visited[nx][ny] = True\r\n q.append((nx, ny))\r\n nx, ny = nx + dx, ny + dy\r\n\r\nprint(ice - 1)\r", "import sys\n\ninput = sys.stdin.readline\n\nH, W = list(map(int, input().split()))\n\nINF = 10**18\n\nice = [[INF] * W for _ in range(H)]\n\nfor i in range(H):\n S = input().rstrip()\n for j in range(W):\n if S[j] == \".\":\n ice[i][j] = 0\n\nice[1] = [1] * W\nice[-2] = [1] * W\nfor i in range(H):\n ice[i][0] = 1\n ice[i][-1] = 1\n\nice[1][1] = 0\nice[2][2] = 0\n\ndx = [0, 0, 1, -1]\ndy = [1, -1, 0, 0]\n\nfor i in range(H):\n for j in range(W):\n if ice[i][j] == INF:\n continue\n for k in range(4):\n x = i + dx[k]\n y = j + dy[k]\n while 0 <= x < H and 0 <= y < W and ice[x][y] != 1:\n ice[x][y] = min(ice[x][y], ice[i][j] + 1)\n x += dx[k]\n y += dy[k]\n\nans = 0\nfor i in range(H):\n for j in range(W):\n if ice[i][j] <= 2:\n ans += 1\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nH, W = map(int, input().split())\n\nINF = 10**18\n\nice = [[INF] * W for _ in range(H)]\n\nfor i in range(H):\n S = input()\n for j in range(W):\n if S[j] == \".\":\n ice[i][j] = 0\n\nice[0] = ice[-1] = [1] * W\nice[1][0] = ice[1][-1] = ice[2][0] = ice[2][-1] = 1\n\nfor i in range(H):\n for j in range(W):\n if ice[i][j] == 0:\n ice[i][j] = min(ice[i - 1][j], ice[i + 1][j], ice[i][j - 1], ice[i][j + 1]) + 1\n\nprint(sum(sum(row) for row in ice))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "def main():\n h, w, n = map(int, input().split())\n holes = set()\n for _ in range(n):\n a, b = map(int, input().split())\n holes.add((a, b))\n grid = [[0] * (w + 1) for _ in range(h + 1)]\n for a, b in holes:\n grid[a][b] = 1\n ans = 0\n for i in range(1, h + 1):\n for j in range(1, w + 1):\n if grid[i][j] == 0:\n k = min(h - i + 1, w - j + 1)\n ans += k * k\n print(ans)\n\n\nmain()", "def main():\n h, w, n = map(int, input().split())\n holes = set()\n for _ in range(n):\n a, b = map(int, input().split())\n holes.add((a, b))\n grid = [[0] * (w + 1) for _ in range(h + 1)]\n for i in range(1, h + 1):\n for j in range(1, w + 1):\n if (i, j) not in holes:\n grid[i][j] = min(grid[i - 1][j], grid[i][j - 1], grid[i - 1][j - 1]) + 1\n ans = 0\n for i in range(h + 1):\n for j in range(w + 1):\n ans += grid[i][j] ** 2\n print(ans)\n\n\nmain()", "import sys\n\ninput = sys.stdin.readline\n\nH, W, N = map(int, input().split())\n\nhole = [False] * (H * W + 1)\n\nfor i in range(N):\n a, b = map(int, input().split())\n hole[a * W + b] = True\n\ndp = [[0] * (W + 1) for i in range(H + 1)]\n\nfor i in range(1, H + 1):\n for j in range(1, W + 1):\n if not hole[i * W + j]:\n dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + 1\n\nprint(sum(map(sum, dp)) - N)", "import sys\n\ninput = sys.stdin.readline\n\nH, W, N = map(int, input().split())\n\nhole = [False] * (H * W + 1)\n\nfor i in range(N):\n a, b = map(int, input().split())\n hole[a * W + b] = True\n\ndp = [0] * (H * W + 1)\n\nfor i in range(1, H * W + 1):\n if not hole[i]:\n dp[i] = dp[i - 1] + 1\n else:\n dp[i] = dp[i - 1]\n\nfor i in range(H * W, 0, -1):\n if not hole[i]:\n dp[i] += dp[i + 1]\n\nans = 0\n\nfor i in range(1, H * W + 1):\n if not hole[i]:\n for j in range(1, min(H, i) + 1):\n ans += dp[i + j - 1] * dp[i - j + 1]\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(H, W, N) = map(int, input().split())\nholes = [tuple(map(int, input().split())) for _ in range(N)]\ngrid = [[0] * (W + 1) for _ in range(H + 1)]\nfor a, b in holes:\n grid[a][b] = 1\nans = 0\nfor i in range(H, 0, -1):\n for j in range(W, 0, -1):\n if grid[i][j] == 0:\n ans += 1\n for k in range(1, min(H - i + 1, W - j + 1)):\n ans += grid[i + k - 1][j + k - 1] == 0\nprint(ans)", "def main():\n h, w, n = map(int, input().split())\n holes = set()\n for _ in range(n):\n a, b = map(int, input().split())\n holes.add((a, b))\n grid = [[0] * (w + 1) for _ in range(h + 1)]\n for i in range(h):\n for j in range(w):\n grid[i + 1][j + 1] = grid[i][j] + 1\n if (i + 1, j + 1) in holes:\n grid[i + 1][j + 1] = 0\n ans = 0\n for i in range(h + 1):\n for j in range(w + 1):\n for k in range(1, min(h - i + 1, w - j + 1) + 1):\n if grid[i][j] == grid[i + k - 1][j + k - 1]:\n ans += 1\n print(ans)\n\n\nmain()", "import sys\n\ninput = sys.stdin.readline\n(H, W, N) = map(int, input().split())\nholes = set()\nfor _ in range(N):\n (a, b) = map(int, input().split())\n holes.add((a, b))\nans = 0\nfor i in range(H):\n for j in range(W):\n if (i, j) not in holes:\n n = 1\n while i + n - 1 < H and j + n - 1 < W and (i + n - 1, j + n - 1) not in holes:\n n += 1\n ans += n * (n - 1) // 2\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(H, W, N) = map(int, input().split())\nholes = set()\nfor _ in range(N):\n (a, b) = map(int, input().split())\n holes.add((a, b))\nans = 0\nfor i in range(1, H + 1):\n for j in range(1, W + 1):\n for n in range(1, min(H + 1 - i, W + 1 - j) + 1):\n flag = True\n for k in range(n):\n if (i + k, j + k) in holes:\n flag = False\n break\n if flag:\n ans += 1\nprint(ans)", "h, w, n = map(int, input().split())\nholes = set()\nfor _ in range(n):\n a, b = map(int, input().split())\n holes.add((a, b))\n\ngrid = [[0] * (w + 1) for _ in range(h + 1)]\nfor i in range(1, h + 1):\n for j in range(1, w + 1):\n if (i, j) not in holes:\n grid[i][j] = grid[i - 1][j] + grid[i][j - 1] - grid[i - 1][j - 1] + 1\n\nans = 0\nfor i in range(1, h + 1):\n for j in range(1, w + 1):\n for k in range(1, min(h - i + 1, w - j + 1) + 1):\n if grid[i][j] == grid[i + k - 1][j + k - 1] - grid[i][j + k - 1] - grid[i + k - 1][j] + grid[i][j]:\n ans += 1\nprint(ans)", "def main():\n h, w, n = map(int, input().split())\n holes = set()\n for _ in range(n):\n a, b = map(int, input().split())\n holes.add((a, b))\n grid = [[0] * (w + 1) for _ in range(h + 1)]\n for i in range(1, h + 1):\n for j in range(1, w + 1):\n if (i, j) not in holes:\n grid[i][j] = min(grid[i - 1][j], grid[i][j - 1], grid[i - 1][j - 1]) + 1\n ans = 0\n for i in range(1, h + 1):\n for j in range(1, w + 1):\n for k in range(1, min(h - i + 1, w - j + 1, grid[i][j]) + 1):\n ans += 1\n print(ans)\n\n\nmain()" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s = input()\nif s in [\"ACE\", \"BDF\", \"CEG\", \"DFA\", \"EGB\", \"FAC\", \"GBD\"]:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s in [\"ACE\", \"BDF\", \"CEG\", \"DFA\", \"EGB\", \"FAC\", \"GBD\"]:\n print(\"Yes\")\nelse:\n print(\"No\")", "S = input()\r\nif S in [\"ACE\", \"BDF\", \"CEG\", \"DFA\", \"EGB\", \"FAC\", \"GBD\"]:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input()\r\nif s in [\"ACE\", \"BDF\", \"CEG\", \"DFA\", \"EGB\", \"FAC\", \"GBD\"]:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input()\r\nif s in [\"ACE\", \"BDF\", \"CEG\", \"DFA\", \"EGB\", \"FAC\", \"GBD\"]:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input()\r\nif s in [\"ACE\", \"BDF\", \"CEG\", \"DFA\", \"EGB\", \"FAC\", \"GBD\"]:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input()\nif s in [\"ACE\", \"BDF\", \"CEG\", \"DFA\", \"EGB\", \"FAC\", \"GBD\"]:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s in [\"ACE\", \"BDF\", \"CEG\", \"DFA\", \"EGB\", \"FAC\", \"GBD\"]:\n print(\"Yes\")\nelse:\n print(\"No\")", "S = input()\r\n\r\nif S in [\"ACE\", \"BDF\", \"CEG\", \"DFA\", \"EGB\", \"FAC\", \"GBD\"]:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input()\nif s in [\"ACE\", \"BDF\", \"CEG\", \"DFA\", \"EGB\", \"FAC\", \"GBD\"]:\n print(\"Yes\")\nelse:\n print(\"No\")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nH, W = list(map(int, input().split()))\n\nS = [input().rstrip() for _ in range(H)]\n\nfor i in range(H - 8):\n for j in range(W - 8):\n if S[i][j] == \"#\" and S[i][j + 3] == \".\" and S[i + 3][j] == \".\" and S[i + 3][j + 3] == \"#\":\n if S[i][j + 1] == S[i][j + 2] == S[i + 1][j] == S[i + 1][j + 1] == S[i + 1][j + 2] == S[i + 2][j] == S[i + 2][j + 1] == S[i + 2][j + 2] == \".\":\n if S[i + 3][j + 1] == S[i + 3][j + 2] == S[i + 4][j] == S[i + 4][j + 1] == S[i + 4][j + 2] == S[i + 5][j] == S[i + 5][j + 1] == S[i + 5][j + 2] == \"#\":\n if S[i + 6][j] == S[i + 6][j + 1] == S[i + 6][j + 2] == S[i + 7][j] == S[i + 7][j + 1] == S[i + 7][j + 2] == S[i + 8][j] == S[i + 8][j + 1] == S[i + 8][j + 2] == \"#\":\n print(i + 1, j + 1)", "import sys\n\ninput = sys.stdin.readline\n\nH, W = list(map(int, input().split()))\n\nS = [input().rstrip() for _ in range(H)]\n\nfor i in range(H - 8):\n for j in range(W - 8):\n if S[i][:3] == \"###\" and S[i][-3:] == \"###\" and S[i + 8][:3] == \"###\" and S[i + 8][-3:] == \"###\":\n if S[i + 1][:3] == \"...\":\n if S[i + 2][:3] == \"...\":\n if S[i + 3][:3] == \"...\":\n if S[i + 4][:3] == \"...\":\n if S[i + 5][:3] == \"...\":\n if S[i + 6][:3] == \"...\":\n if S[i + 7][:3] == \"...\":\n if S[i + 3][-3:] == \"...\":\n if S[i + 4][-3:] == \"...\":\n if S[i + 5][-3:] == \"...\":\n if S[i + 6][-3:] == \"...\":\n if S[i + 7][-3:] == \"...\":\n if S[i + 1][-3:] == \"...\":\n if S[i + 2][-3:] == \"...\":\n if S[i + 5][3:-3] == \"........\" and S[i + 6][3:-3] == \"........\" and S[i + 7][3:-3] == \"........\":\n if S[i + 1][3:-3] == \"........\" and S[i + 2][3:-3] == \"........\" and S[i + 3][3] == \"#\" and S[i + 4][3] == \"#\" and S[i + 5][3] == \"#\" and S[i + 6][3] == \"#\" and S[i + 7][3] == \"#\":\n if S[i][3:-3] == \"........\" and S[i + 1][3] == \"#\" and S[i + 2][3] == \"#\" and S[i + 3][3] == \"#\" and S[i + 4][3] == \"#\":\n print(i + 1, j + 1)", "import sys\n\ninput = sys.stdin.readline\n\nH, W = map(int, input().split())\n\nS = [input().rstrip() for _ in range(H)]\n\nfor i in range(H - 8):\n for j in range(W - 8):\n if (\n S[i][j] == \"#\"\n and S[i][j + 1] == \"#\"\n and S[i][j + 2] == \"#\"\n and S[i + 1][j] == \"#\"\n and S[i + 2][j] == \"#\"\n and S[i + 3][j] == \"#\"\n and S[i + 4][j] == \"#\"\n and S[i + 5][j] == \"#\"\n and S[i + 6][j] == \"#\"\n and S[i + 7][j] == \"#\"\n and S[i + 8][j] == \"#\"\n and S[i + 1][j + 1] == \"#\"\n and S[i + 2][j + 1] == \"#\"\n and S[i + 3][j + 1] == \"#\"\n and S[i + 4][j + 1] == \"#\"\n and S[i + 5][j + 1] == \"#\"\n and S[i + 6][j + 1] == \"#\"\n and S[i + 7][j + 1] == \"#\"\n and S[i + 8][j + 1] == \"#\"\n and S[i + 1][j + 2] == \"#\"\n and S[i + 2][j + 2] == \"#\"\n and S[i + 3][j + 2] == \"#\"\n and S[i + 4][j + 2] == \"#\"\n and S[i + 5][j + 2] == \"#\"\n and S[i + 6][j + 2] == \"#\"\n and S[i + 7][j + 2] == \"#\"\n and S[i + 8][j + 2] == \"#\"\n and S[i][j + 6] == \".\"\n and S[i][j + 7] == \".\"\n and S[i][j + 8] == \".\"\n and S[i + 1][j + 3] == \".\"\n and S[i + 1][j + 4] == \".\"\n and S[i + 1][j + 5] == \".\"\n and S[i + 1][j + 6] == \".\"\n and S[i + 1][j + 7] == \".\"\n and S[i + 1][j + 8] == \".\"\n and S[i + 2][j + 3] == \".\"\n and S[i + 2][j + 4] == \".\"\n and S[i + 2][j + 5] == \".\"\n and S[i + 2][j + 6] == \".\"\n and S[i + 2][j + 7] == \".\"\n and S[i + 2][j + 8] == \".\"\n and S[i + 3][j + 3] == \".\"\n and S[i + 3][j + 4] == \".\"\n and S[i + 3][j + 5] == \".\"\n and S[i + 3][j + 6] == \".\"\n and S[i + 3][j + 7] == \".\"\n and S[i + 3][j + 8] == \".\"\n and S[i + 4][j + 3] == \".\"\n and S[i + 4][j + 4] == \".\"\n and S[i + 4][j + 5] == \".\"\n and S[i + 4][j + 6] == \".\"\n and S[i + 4][j + 7] == \".\"\n and S[i + 4][j + 8] == \".\"\n and S[i + 5][j + 3] == \".\"\n and S[i + 5][j + 4] == \".\"\n and S[i + 5][j + 5] == \".\"\n and S[i + 5][j + 6] == \".\"\n and S[i + 5][j + 7] == \".\"\n and S[i + 5][j + 8] == \".\"\n and S[i + 6][j + 3] == \".\"\n and S[i + 6][j + 4] == \".\"\n and S[i + 6][j + 5] == \".\"\n and S[i + 6][j + 6] == \".\"\n and S[i + 6][j + 7] == \".\"\n and S[i + 6][j + 8] == \".\"\n and S[i + 7][j + 3] == \".\"\n and S[i + 7][j + 4] == \".\"\n and S[i + 7][j + 5] == \".\"\n and S[i + 7][j + 6] == \".\"\n and S[i + 7][j + 7] == \".\"\n and S[i + 7][j + 8] == \".\"\n and S[i + 8][j + 3] == \".\"\n and S[i + 8][j + 4] == \".\"\n and S[i + 8][j + 5] == \".\"\n and S[i + 8][j + 6] == \".\"\n and S[i + 8][j + 7] == \".\"\n and S[i + 8][j + 8] == \".\"\n ):\n print(i + 1, j + 1)", "def main():\n (n, m) = map(int, input().split())\n s = [input() for _ in range(n)]\n for i in range(n - 8):\n for j in range(m - 8):\n if (\n s[i][:3] == \"###\"\n and s[i][-3:] == \"###\"\n and s[i + 8][:3] == \"###\"\n and s[i + 8][-3:] == \"###\"\n and all(\n s[p][q] == \".\"\n for p in range(i + 1, i + 8)\n for q in range(j, j + 3)\n if p != i + 7 or q != j + 2\n )\n and all(\n s[p][q] == \".\"\n for p in range(i, i + 3)\n for q in range(j + 1, j + 8)\n if p != i + 2 or q != j + 7\n )\n and all(\n s[i + p][j + q] == \".\"\n for p in range(1, 7)\n for q in range(1, 4)\n if p != 6 or q != 3\n )\n and all(\n s[i + p][j + q] == \".\"\n for p in range(1, 4)\n for q in range(1, 7)\n if p != 3 or q != 6\n )\n ):\n print(i + 1, j + 1)\n\n\nmain()", "import sys\n\ninput = sys.stdin.readline\n\nH, W = list(map(int, input().split()))\n\nS = [input().rstrip() for _ in range(H)]\n\nans = []\n\nfor i in range(H - 8):\n for j in range(W - 8):\n if S[i][j] == \"#\" and S[i + 1][j] == \"#\" and S[i + 2][j] == \"#\" and S[i][j + 1] == \"#\" and S[i + 1][j + 1] == \"#\" and S[i + 2][j + 2] == \"#\" and S[i + 6][j + 6] == \"#\" and S[i + 7][j + 6] == \"#\" and S[i + 8][j + 6] == \"#\" and S[i + 6][j] == \".\" and S[i + 7][j] == \".\" and S[i + 8][j] == \".\" and S[i + 6][j + 1] == \".\" and S[i + 7][j + 1] == \".\" and S[i + 8][j + 1] == \".\" and S[i][j + 6] == \".\" and S[i][j + 7] == \".\" and S[i][j + 8] == \".\" and S[i + 1][j + 6] == \".\" and S[i + 1][j + 7] == \".\" and S[i + 2][j + 6] == \".\":\n ans.append((i, j))\n\nans.sort()\n\nfor i, j in ans:\n print(i + 1, j + 1)", "def main():\n (n, m) = map(int, input().split())\n s = [input() for _ in range(n)]\n ans = []\n for i in range(n - 8):\n for j in range(m - 8):\n if (\n s[i][:3] == \"###\"\n and s[i][-3:] == \"###\"\n and s[i + 8][:3] == \"###\"\n and s[i + 8][-3:] == \"###\"\n and all(\n s[p][q] == \".\"\n for p in range(i + 1, i + 8)\n for q in range(j, j + 3)\n if p != i + 7 or q != j + 2\n )\n and all(\n s[p][q] == \".\"\n for p in range(i + 1, i + 3)\n for q in range(j + 6, j + 9)\n if p != i + 2 or q != j + 8\n )\n and all(\n s[p][q] == \".\"\n for p in range(i + 6, i + 9)\n for q in range(j + 1, j + 4)\n if p != i + 8 or q != j + 3\n )\n and all(\n s[p][q] == \".\"\n for p in range(i + 6, i + 9)\n for q in range(j + 4, j + 7)\n if p != i + 8 or q != j + 6\n )\n ):\n ans.append((i, j))\n for a, b in sorted(ans):\n print(a + 1, b + 1)\n\n\nmain()", "n, m = map(int, input().split())\na = []\nfor i in range(n):\n a.append(input())\nfor i in range(n - 8):\n for j in range(m - 8):\n if a[i][j] == a[i + 8][j + 8] == \".\":\n continue\n ok = 1\n for k in range(3):\n for l in range(3):\n if a[i + k][j + l] != a[i + 8 - k][j + 8 - l]:\n ok = 0\n if ok:\n print(i + 1, j + 1)", "n, m = map(int, input().split())\ns = [input() for _ in range(n)]\n\nfor i in range(n - 8):\n for j in range(m - 8):\n if (\n s[i][j] == \"#\"\n and s[i][j + 1] == \"#\"\n and s[i][j + 2] == \"#\"\n and s[i + 1][j] == \"#\"\n and s[i + 2][j] == \"#\"\n and s[i + 3][j] == \".\"\n and s[i + 4][j] == \".\"\n and s[i + 5][j] == \".\"\n and s[i + 6][j] == \".\"\n and s[i + 7][j] == \"#\"\n and s[i + 8][j] == \"#\"\n and s[i + 8][j + 1] == \"#\"\n and s[i + 8][j + 2] == \"#\"\n and s[i][j + 6] == \".\"\n and s[i][j + 7] == \".\"\n and s[i][j + 8] == \".\"\n and s[i + 1][j + 6] == \".\"\n and s[i + 2][j + 6] == \".\"\n and s[i + 3][j + 6] == \"#\"\n and s[i + 4][j + 6] == \"#\"\n and s[i + 5][j + 6] == \"#\"\n and s[i + 6][j + 6] == \"#\"\n and s[i + 7][j + 6] == \"#\"\n and s[i + 8][j + 6] == \"#\"\n and s[i + 8][j + 7] == \"#\"\n and s[i + 8][j + 8] == \"#\"\n ):\n print(i + 1, j + 1)", "n, m = map(int, input().split())\na = []\nfor i in range(n):\n a.append(input())\nfor i in range(n - 8):\n for j in range(m - 8):\n if a[i][j] == a[i][j + 3] == a[i + 3][j] == a[i + 3][j + 3] == \"#\":\n if a[i + 1][j + 1] == a[i + 2][j + 1] == a[i + 1][j + 2] == a[i + 2][j + 2] == \".\":\n if a[i + 4][j + 4] == a[i + 5][j + 4] == a[i + 6][j + 4] == a[i + 7][j + 4] == \"#\":\n if a[i + 4][j + 5] == a[i + 5][j + 5] == a[i + 6][j + 5] == a[i + 7][j + 5] == \".\":\n if a[i + 4][j + 6] == a[i + 5][j + 6] == a[i + 6][j + 6] == a[i + 7][j + 6] == \"#\":\n if a[i + 4][j + 7] == a[i + 5][j + 7] == a[i + 6][j + 7] == a[i + 7][j + 7] == \".\":\n if a[i + 4][j + 8] == a[i + 5][j + 8] == a[i + 6][j + 8] == a[i + 7][j + 8] == \"#\":\n print(i + 1, j + 1)", "n, m = map(int, input().split())\na = []\nfor i in range(n):\n a.append(input())\n\nfor i in range(n - 8):\n for j in range(m - 8):\n if a[i][:3] == \"###\" and a[i][j + 6 : j + 9] == \"###\" and a[i + 8][:3] == \"###\" and a[i + 8][j + 6 : j + 9] == \"###\":\n flag = True\n for k in range(i, i + 3):\n if a[k][j + 3 : j + 6] != \"...\" or a[k][j] != \".\" or a[k][j + 6 : j + 9] != \"...\":\n flag = False\n break\n for k in range(i + 3, i + 6):\n if a[k][j] != \".\" or a[k][j + 6 : j + 9] != \"...\":\n flag = False\n break\n for k in range(i + 6, i + 9):\n if a[k][j] != \".\" or a[k][j + 3 : j + 6] != \"...\" or a[k][j + 6 : j + 9] != \"...\":\n flag = False\n break\n for k in range(i + 1, i + 8):\n if a[k][:3] != \"###\" or a[k][j] != \".\" or a[k][j + 6 : j + 9] != \"...\":\n flag = False\n break\n for k in range(i, i + 9):\n if a[k][j + 3 : j + 6] != \"...\":\n flag = False\n break\n if flag:\n print(i + 1, j + 1)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\na = sorted(map(int, input().split()))\nb = sorted(map(int, input().split()))\nl, r = 0, 10**9\nwhile r - l > 1:\n mid = (l + r) // 2\n if sum(1 for x in a if x <= mid) >= sum(1 for x in b if x >= mid):\n r = mid\n else:\n l = mid\nprint(r)", "n, m = map(int, input().split())\na = sorted(map(int, input().split()))\nb = sorted(map(int, input().split()))\ni = 0\nfor j in range(m):\n while i < n and a[i] < b[j]:\n i += 1\n if i >= n:\n break\n if j < m - 1 and b[j] == b[j + 1]:\n continue\n if i >= j:\n break\nprint(b[j])", "n, m = map(int, input().split())\na = sorted(map(int, input().split()))\nb = sorted(map(int, input().split()))\ni = 0\nj = 0\nwhile i < n and j < m:\n if a[i] <= b[j]:\n j += 1\n i += 1\nprint(a[i - 1] + 1)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\ni = 0\nj = 0\nwhile i < n and j < m:\n if a[i] <= b[j]:\n j += 1\n i += 1\nprint(a[i - 1] + 1)", "n, m = map(int, input().split())\na = sorted(map(int, input().split()))\nb = sorted(map(int, input().split()))\ni = 0\nfor j in range(m):\n while i < n and a[i] < b[j]:\n i += 1\n if i >= n:\n break\n if j < m - 1 and b[j] == b[j + 1]:\n continue\n if i >= j:\n break\nprint(b[j])", "n, m = map(int, input().split())\na = sorted(map(int, input().split()))\nb = sorted(map(int, input().split()))\nl, r = 0, 10**9\nwhile r - l > 1:\n mid = (l + r) // 2\n if sum(1 for x in a if x <= mid) >= sum(1 for x in b if x >= mid):\n r = mid\n else:\n l = mid\nprint(r)", "n, m = map(int, input().split())\na = sorted(map(int, input().split()))\nb = sorted(map(int, input().split()), reverse=True)\nl, r = 0, 10**9\nwhile r - l > 1:\n mid = (l + r) // 2\n if sum(1 for i in a if i <= mid) >= sum(1 for i in b if i >= mid):\n r = mid\n else:\n l = mid\nprint(r)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nl, r = 0, 10**9\nwhile l + 1 < r:\n mid = (l + r) // 2\n if sum((x >= mid for x in a)) >= sum((x <= mid for x in b)):\n r = mid\n else:\n l = mid\nprint(r)", "n, m = map(int, input().split())\na = sorted(map(int, input().split()))\nb = sorted(map(int, input().split()))\ni = j = 0\nwhile j < m:\n if a[i] >= b[j]:\n j += 1\n i += 1\nprint(a[i - 1])", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\ni = 0\nj = 0\nwhile i < n and j < m:\n if a[i] <= b[j]:\n j += 1\n i += 1\nprint(a[i - 1])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nmod = 998244353\n\nS = input().rstrip()\n\nN = len(S)\n\ndp = [[0] * (N + 1) for _ in range(N + 1)]\n\ndp[0][0] = 1\n\nfor i in range(N):\n if S[i] == \"(\":\n for j in range(i + 1):\n dp[i + 1][j + 1] += dp[i][j]\n dp[i + 1][j + 1] %= mod\n elif S[i] == \")\":\n for j in range(i, -1, -1):\n dp[i + 1][j - 1] += dp[i][j]\n dp[i + 1][j - 1] %= mod\n else:\n for j in range(i + 1):\n dp[i + 1][j + 1] += dp[i][j]\n dp[i + 1][j + 1] %= mod\n dp[i + 1][j] += dp[i][j]\n dp[i + 1][j] %= mod\n\nans = 0\n\nfor i in range(N + 1):\n ans += dp[N][i] * (2 ** (N - i)) % mod\n ans %= mod\n\nprint(ans)", "from sys import stdin\n\ninput = stdin.readline\nmod = 998244353\ns = input().strip()\nn = len(s)\ndp = [[0] * (n + 1) for _ in range(n + 1)]\ndp[0][0] = 1\nfor i in range(n):\n if s[i] == \"(\":\n for j in range(i, -1, -1):\n dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j]) % mod\n elif s[i] == \")\":\n for j in range(i, n):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod\n else:\n for j in range(n):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * 2) % mod\n if j > 0 and s[j - 1] == \"(\":\n dp[i + 1][j - 1] = (dp[i + 1][j - 1] + dp[i][j]) % mod\n if j < n - 1 and s[j + 1] == \")\":\n dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j]) % mod\nprint(dp[n][0])", "import sys\n\ninput = sys.stdin.readline\n\nmod = 998244353\n\nS = input().rstrip()\n\nN = len(S)\n\ndp = [[0] * (N + 1) for i in range(N + 1)]\n\ndp[0][0] = 1\n\nfor i in range(N):\n if S[i] == \"(\":\n for j in range(i, -1, -1):\n dp[i + 1][j + 1] += dp[i][j]\n dp[i + 1][j + 1] %= mod\n elif S[i] == \")\":\n for j in range(i, N):\n dp[i + 1][j] += dp[i][j]\n dp[i + 1][j] %= mod\n else:\n for j in range(N):\n dp[i + 1][j + 1] += dp[i][j]\n dp[i + 1][j + 1] %= mod\n dp[i + 1][j] += dp[i][j]\n dp[i + 1][j] %= mod\n\nprint(dp[N][0])", "import sys\n\ninput = sys.stdin.readline\n\nmod = 998244353\n\nS = input().strip()\n\nN = len(S)\n\ndp = [[0] * (N + 1) for _ in range(N + 1)]\ndp[0][0] = 1\n\nfor i in range(N):\n if S[i] == \"(\":\n for j in range(i, -1, -1):\n dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j]) % mod\n elif S[i] == \")\":\n for j in range(i, N):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod\n else:\n for j in range(N):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * 2) % mod\n\nprint(dp[N][0])", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\n\nS = input().rstrip()\nN = len(S)\n\ndp = [[0] * (N + 1) for _ in range(N + 1)]\ndp[0][0] = 1\n\nfor i in range(N):\n if S[i] == \"(\":\n for j in range(i, -1, -1):\n dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j]) % mod\n elif S[i] == \")\":\n for j in range(i, N):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod\n else:\n for j in range(N):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * 2) % mod\n\nprint(dp[N][0])", "import sys\n\ninput = sys.stdin.readline\n\nmod = 998244353\n\nS = input().rstrip()\nN = len(S)\n\ndp = [[0] * (N + 1) for _ in range(N + 1)]\ndp[0][0] = 1\n\nfor i in range(N):\n if S[i] == \"(\":\n for j in range(i, -1, -1):\n dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j]) % mod\n elif S[i] == \")\":\n for j in range(i, N):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod\n else:\n for j in range(N):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * 2) % mod\n\nprint(dp[N][0])", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nS = input().strip()\nN = len(S)\n\ndp = [[0] * (N + 1) for _ in range(N + 1)]\ndp[0][0] = 1\n\nfor i in range(N):\n c = S[i]\n if c == \"(\":\n for j in range(i, -1, -1):\n dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j]) % mod\n elif c == \")\":\n for j in range(i, N):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % mod\n else:\n for j in range(N + 1):\n dp[i + 1][j] = (dp[i + 1][j] + dp[i][j] * 2) % mod\n\nprint(dp[N][0])", "import sys\n\ninput = sys.stdin.readline\n\nmod = 998244353\n\nS = input().rstrip()\n\nN = len(S)\n\ndp = [[0] * (N + 1) for _ in range(N + 1)]\n\ndp[0][0] = 1\n\nfor i in range(N):\n if S[i] == \"(\":\n for j in range(i + 1):\n dp[i + 1][j + 1] += dp[i][j]\n dp[i + 1][j + 1] %= mod\n elif S[i] == \")\":\n for j in range(i, -1, -1):\n dp[i + 1][j - 1] += dp[i][j]\n dp[i + 1][j - 1] %= mod\n else:\n for j in range(i + 1):\n dp[i + 1][j + 1] += dp[i][j]\n dp[i + 1][j + 1] %= mod\n dp[i + 1][j] += dp[i][j]\n dp[i + 1][j] %= mod\n\nans = 0\n\nfor i in range(N + 1):\n ans += dp[N][i] * (2 ** (N - i))\n ans %= mod\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nmod = 998244353\n\nS = input().strip()\n\nN = len(S)\n\ndp = [[0] * (N + 1) for i in range(N + 1)]\n\ndp[0][0] = 1\n\nfor i in range(N):\n if S[i] == \"(\":\n for j in range(i + 1):\n dp[i + 1][j + 1] += dp[i][j]\n dp[i + 1][j + 1] %= mod\n elif S[i] == \")\":\n for j in range(i, -1, -1):\n dp[i + 1][j - 1] += dp[i][j]\n dp[i + 1][j - 1] %= mod\n else:\n for j in range(i + 1):\n dp[i + 1][j + 1] += dp[i][j]\n dp[i + 1][j + 1] %= mod\n dp[i + 1][j - 1] += dp[i][j]\n dp[i + 1][j - 1] %= mod\n\nprint(dp[N][0])", "import sys\n\ninput = sys.stdin.readline\n\nmod = 998244353\n\nS = input().rstrip()\n\nN = len(S)\n\ndp = [[0] * (N + 1) for _ in range(N + 1)]\n\ndp[0][0] = 1\n\nfor i in range(N):\n if S[i] == \"(\":\n for j in range(i + 1):\n dp[i + 1][j + 1] += dp[i][j]\n dp[i + 1][j + 1] %= mod\n elif S[i] == \")\":\n for j in range(i, -1, -1):\n dp[i + 1][j - 1] += dp[i][j]\n dp[i + 1][j - 1] %= mod\n else:\n for j in range(i + 1):\n dp[i + 1][j + 1] += dp[i][j]\n dp[i + 1][j + 1] %= mod\n dp[i + 1][j] += dp[i][j]\n dp[i + 1][j] %= mod\n\nans = 0\n\nfor i in range(N + 1):\n ans += dp[N][i] * (2 ** (N - i))\n ans %= mod\n\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ncuboids = []\nfor _ in range(n):\n cuboids.append(list(map(int, input().split())))\n\nx_dict = {}\ny_dict = {}\nz_dict = {}\nfor i in range(n):\n x1, y1, z1, x2, y2, z2 = cuboids[i]\n x_dict[x1, y1, z1] = x_dict.get((x1, y1, z1), 0) + 1\n x_dict[x2, y2, z2] = x_dict.get((x2, y2, z2), 0) + 1\n y_dict[x1, y1, z1] = y_dict.get((x1, y1, z1), 0) + 1\n y_dict[x2, y2, z2] = y_dict.get((x2, y2, z2), 0) + 1\n z_dict[x1, y1, z1] = z_dict.get((x1, y1, z1), 0) + 1\n z_dict[x2, y2, z2] = z_dict.get((x2, y2, z2), 0) + 1\n\nresults = []\nfor i in range(n):\n x1, y1, z1, x2, y2, z2 = cuboids[i]\n results.append(x_dict[x1, y1, z1] + x_dict[x2, y2, z2] + y_dict[x1, y1, z1] + y_dict[x2, y2, z2] + z_dict[x1, y1, z1] + z_dict[x2, y2, z2] - 6)\n\nfor result in results:\n print(result)", "n = int(input())\n\ncuboids = []\nfor _ in range(n):\n cuboids.append(list(map(int, input().split())))\n\nx_dict = {}\ny_dict = {}\nz_dict = {}\n\nfor cuboid in cuboids:\n x1, y1, z1, x2, y2, z2 = cuboid\n x_dict[x1, x2] = x_dict.get((x1, x2), 0) + 1\n y_dict[y1, y2] = y_dict.get((y1, y2), 0) + 1\n z_dict[z1, z2] = z_dict.get((z1, z2), 0) + 1\n\nfor cuboid in cuboids:\n x1, y1, z1, x2, y2, z2 = cuboid\n count = 0\n count += x_dict.get((x1, x2), 0) - 1\n count += y_dict.get((y1, y2), 0) - 1\n count += z_dict.get((z1, z2), 0) - 1\n print(count)", "from collections import defaultdict\n\nn = int(input())\n\ncuboids = []\nfor _ in range(n):\n cuboids.append(list(map(int, input().split())))\n\nx_dict = defaultdict(int)\ny_dict = defaultdict(int)\nz_dict = defaultdict(int)\n\nfor cuboid in cuboids:\n x1, y1, z1, x2, y2, z2 = cuboid\n x_dict[x1] += 1\n x_dict[x2] += 1\n y_dict[y1] += 1\n y_dict[y2] += 1\n z_dict[z1] += 1\n z_dict[z2] += 1\n\nfor cuboid in cuboids:\n x1, y1, z1, x2, y2, z2 = cuboid\n print(x_dict[x1] - 1 + y_dict[y1] - 1 + z_dict[z1] - 1)", "n = int(input())\n\ncuboids = []\nfor _ in range(n):\n cuboids.append(list(map(int, input().split())))\n\nx_dict = {}\ny_dict = {}\nz_dict = {}\n\nfor cuboid in cuboids:\n x1, y1, z1, x2, y2, z2 = cuboid\n x_dict[x1, x2] = x_dict.get((x1, x2), 0) + 1\n y_dict[y1, y2] = y_dict.get((y1, y2), 0) + 1\n z_dict[z1, z2] = z_dict.get((z1, z2), 0) + 1\n\nresults = []\nfor cuboid in cuboids:\n x1, y1, z1, x2, y2, z2 = cuboid\n results.append(\n x_dict[x1, x2] - 1 + y_dict[y1, y2] - 1 + z_dict[z1, z2] - 1 - 2\n )\n\nfor result in results:\n print(result)", "from collections import defaultdict\n\nn = int(input())\ncuboids = [list(map(int, input().split())) for _ in range(n)]\n\n# Create a dictionary to store the count of cuboids for each XYZ face\nface_count = defaultdict(int)\n\n# Iterate through each cuboid\nfor i in range(n):\n # Extract the coordinates of the cuboid\n x1, y1, z1, x2, y2, z2 = cuboids[i]\n\n # Define the 6 faces of the cuboid\n faces = [\n (x1, y1, z1),\n (x2, y1, z1),\n (x1, y2, z1),\n (x1, y1, z2),\n (x2, y2, z1),\n (x1, y2, z2),\n ]\n\n # Increment the count for each face\n for face in faces:\n face_count[face] += 1\n\n# Iterate through each cuboid again to calculate the answer\nresults = []\nfor i in range(n):\n x1, y1, z1, x2, y2, z2 = cuboids[i]\n count = 0\n\n # Define the 6 faces of the cuboid\n faces = [\n (x1, y1, z1),\n (x2, y1, z1),\n (x1, y2, z1),\n (x1, y1, z2),\n (x2, y2, z1),\n (x1, y2, z2),\n ]\n\n # Check the count for each face\n for face in faces:\n if face_count[face] > 1:\n count += 1\n\n # Subtract 1 because we don't want to count the cuboid itself\n results.append(count - 1)\n\n# Print the results\nfor result in results:\n print(result)", "from collections import defaultdict\n\nn = int(input())\n\ncuboids = []\nfor i in range(n):\n cuboids.append(list(map(int, input().split())))\n\ncuboids_dict = defaultdict(int)\n\nfor cuboid in cuboids:\n x1, y1, z1, x2, y2, z2 = cuboid\n cuboids_dict[(x1, y1, z1)] += 1\n cuboids_dict[(x2, y2, z2)] += 1\n cuboids_dict[(x1, y1, z2)] += 1\n cuboids_dict[(x2, y2, z1)] += 1\n cuboids_dict[(x1, y2, z1)] += 1\n cuboids_dict[(x2, y1, z2)] += 1\n cuboids_dict[(x2, y1, z1)] += 1\n cuboids_dict[(x1, y2, z2)] += 1\n\nfor cuboid in cuboids:\n x1, y1, z1, x2, y2, z2 = cuboid\n print(cuboids_dict[(x1, y1, z1)] + cuboids_dict[(x2, y2, z2)] - 2)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\nX = [list(map(int, input().split())) for i in range(N)]\n\nans = [0] * N\n\nfor i in range(N):\n for j in range(i + 1, N):\n if (\n X[i][0] == X[j][0]\n and X[i][1] <= X[j][1]\n and X[i][2] <= X[j][2]\n and X[i][3] >= X[j][3]\n and X[i][4] >= X[j][4]\n and X[i][5] >= X[j][5]\n ):\n ans[i] += 1\n ans[j] += 1\n elif (\n X[i][3] == X[j][3]\n and X[i][4] <= X[j][4]\n and X[i][5] <= X[j][5]\n and X[i][0] >= X[j][0]\n and X[i][1] >= X[j][1]\n and X[i][2] >= X[j][2]\n ):\n ans[i] += 1\n ans[j] += 1\n elif (\n X[i][0] == X[j][3]\n and X[i][1] == X[j][4]\n and X[i][2] == X[j][5]\n and X[i][3] == X[j][0]\n and X[i][4] == X[j][1]\n and X[i][5] == X[j][2]\n ):\n ans[i] += 1\n ans[j] += 1\n\nfor a in ans:\n print(a)", "n = int(input())\n\ncuboids = []\nfor _ in range(n):\n cuboids.append(list(map(int, input().split())))\n\nx_cuboids = {}\ny_cuboids = {}\nz_cuboids = {}\n\nfor cuboid in cuboids:\n x1, y1, z1, x2, y2, z2 = cuboid\n x_cuboids.setdefault(x1, []).append((y1, z1, y2, z2))\n x_cuboids.setdefault(x2, []).append((y1, z1, y2, z2))\n y_cuboids.setdefault(y1, []).append((x1, z1, x2, z2))\n y_cuboids.setdefault(y2, []).append((x1, z1, x2, z2))\n z_cuboids.setdefault(z1, []).append((x1, y1, x2, y2))\n z_cuboids.setdefault(z2, []).append((x1, y1, x2, y2))\n\nresults = [0] * n\nfor i, cuboid in enumerate(cuboids):\n x1, y1, z1, x2, y2, z2 = cuboid\n for y, z, y2, z2 in x_cuboids[x1]:\n if y1 <= y <= y2 and z1 <= z <= z2:\n results[i] += 1\n for y, z, y2, z2 in x_cuboids[x2]:\n if y1 <= y <= y2 and z1 <= z <= z2:\n results[i] += 1\n for x, z, x2, z2 in y_cuboids[y1]:\n if x1 <= x <= x2 and z1 <= z <= z2:\n results[i] += 1\n for x, z, x2, z2 in y_cuboids[y2]:\n if x1 <= x <= x2 and z1 <= z <= z2:\n results[i] += 1\n for x, y, x2, y2 in z_cuboids[z1]:\n if x1 <= x <= x2 and y1 <= y <= y2:\n results[i] += 1\n for x, y, x2, y2 in z_cuboids[z2]:\n if x1 <= x <= x2 and y1 <= y <= y2:\n results[i] += 1\n\nfor result in results:\n print(result)", "n = int(input())\ncuboids = []\nfor _ in range(n):\n cuboids.append(list(map(int, input().split())))\n\nx_dict = {}\ny_dict = {}\nz_dict = {}\nfor i in range(n):\n x1, y1, z1, x2, y2, z2 = cuboids[i]\n x_dict[x1, y1, z1] = x_dict.get((x1, y1, z1), 0) + 1\n x_dict[x2, y2, z2] = x_dict.get((x2, y2, z2), 0) + 1\n y_dict[x1, y1, z1] = y_dict.get((x1, y1, z1), 0) + 1\n y_dict[x2, y2, z2] = y_dict.get((x2, y2, z2), 0) + 1\n z_dict[x1, y1, z1] = z_dict.get((x1, y1, z1), 0) + 1\n z_dict[x2, y2, z2] = z_dict.get((x2, y2, z2), 0) + 1\n\nfor i in range(n):\n x1, y1, z1, x2, y2, z2 = cuboids[i]\n count = (\n x_dict.get((x1, y1, z1), 0)\n + x_dict.get((x2, y2, z2), 0)\n + y_dict.get((x1, y1, z1), 0)\n + y_dict.get((x2, y2, z2), 0)\n + z_dict.get((x1, y1, z1), 0)\n + z_dict.get((x2, y2, z2), 0)\n ) - 3\n print(count)", "from collections import defaultdict\n\nn = int(input())\ncuboids = []\nfor _ in range(n):\n cuboids.append(list(map(int, input().split())))\n\nfaces = defaultdict(set)\nfor cuboid in cuboids:\n x1, y1, z1, x2, y2, z2 = cuboid\n for i in range(3):\n for j in range(i + 1, 3):\n face = (cuboid[i], cuboid[i + 3], cuboid[j], cuboid[j + 3])\n faces[face].add(cuboid)\n\nfor cuboid in cuboids:\n count = 0\n for i in range(3):\n for j in range(i + 1, 3):\n face = (cuboid[i], cuboid[i + 3], cuboid[j], cuboid[j + 3])\n count += len(faces[face]) - 1\n print(count)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from heapq import heappush, heappop\n\n(n, m) = map(int, input().split())\n\ncans = []\nopeners = []\n\nfor i in range(n):\n (t, x) = map(int, input().split())\n if t == 0:\n cans.append(x)\n elif t == 2:\n openers.append(x)\n\ncans.sort(reverse=True)\nopeners.sort(reverse=True)\n\nopener_index = 0\nopener = 0\n\nheap = []\n\nfor can in cans:\n if opener > 0:\n opener -= 1\n heappush(heap, -can)\n if len(heap) == m:\n heappop(heap)\n if opener_index < len(openers):\n if openers[opener_index] > 0:\n opener = openers[opener_index]\n opener_index += 1\n\nans = 0\nfor i in range(m):\n ans -= heap[i]\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, m) = map(int, input().split())\nitems = []\nfor i in range(n):\n (t, x) = map(int, input().split())\n items.append((t, x))\nitems.sort(key=lambda x: -x[1])\ncans = [0] * m\nopeners = [0] * m\nfor i in range(m):\n t, x = items[i]\n if t == 0:\n cans[i] = x\n elif t == 1:\n cans[i] = -x\n else:\n openers[i] = x\nfor i in range(m):\n for j in range(i):\n if cans[j] < 0:\n cans[j] += openers[i]\nprint(sum(filter(lambda x: x > 0, cans)) + sum(openers))", "import sys\n\ninput = sys.stdin.readline\n(n, m) = map(int, input().split())\ncans = []\nopeners = []\nfor _ in range(n):\n (t, x) = map(int, input().split())\n if t == 0:\n cans.append(x)\n elif t == 1:\n cans.append(-x)\n else:\n openers.append(x)\ncans.sort(reverse=True)\nopeners.sort(reverse=True)\nopener_idx = 0\nhappiness = 0\nfor can in cans:\n if can > 0:\n happiness += can\n elif can < 0:\n if opener_idx < len(openers):\n happiness += can\n opener_idx += 1\n else:\n happiness += 0\nprint(happiness)", "from heapq import heappush, heappop\nfrom collections import deque\n\nN, M = map(int, input().split())\n\ncans = []\nopeners = deque()\n\nfor i in range(N):\n t, x = map(int, input().split())\n if t == 0:\n cans.append((x, 0))\n elif t == 1:\n cans.append((x, 1))\n else:\n openers.append(x)\n\ncans.sort(reverse=True)\n\nans = 0\nfor i in range(M):\n if openers:\n op = openers.popleft()\n if op > 0:\n x, t = heappop(cans)\n ans += x\n op -= 1\n if op:\n heappush(cans, (op, 2))\n else:\n ans += cans[i][0]\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, m) = map(int, input().split())\ncans = []\nopeners = []\nfor i in range(n):\n (t, x) = map(int, input().split())\n if t == 0:\n cans.append(x)\n elif t == 1:\n cans.append(-x)\n else:\n openers.append(x)\ncans.sort(reverse=True)\nopeners.sort(reverse=True)\nopener_index = 0\nhappiness = sum(cans[: m - len(openers)])\nfor i in range(min(m - len(openers), len(cans))):\n if opener_index < len(openers) and cans[i] < 0:\n happiness += cans[i] + openers[opener_index]\n opener_index += 1\n else:\n happiness += cans[i]\nprint(happiness)", "import sys\n\ninput = sys.stdin.readline\n(n, m) = map(int, input().split())\ncans = []\nopeners = []\nfor i in range(n):\n (t, x) = map(int, input().split())\n if t == 0:\n cans.append(x)\n elif t == 1:\n cans.append(-x)\n else:\n openers.append(x)\ncans.sort(reverse=True)\nopeners.sort(reverse=True)\nopener_index = 0\nhappiness = 0\nfor i in range(m):\n if opener_index < len(openers) and cans[i] < 0:\n cans[i] *= -1\n openers[opener_index] -= 1\n if openers[opener_index] == 0:\n opener_index += 1\n happiness += cans[i]\nprint(happiness)", "import sys\n\ninput = sys.stdin.readline\n(n, m) = map(int, input().split())\ncans = []\nopeners = []\nfor _ in range(n):\n (t, x) = map(int, input().split())\n if t == 0:\n cans.append(x)\n elif t == 1:\n cans.append(-x)\n else:\n openers.append(x)\ncans.sort(reverse=True)\nopeners.sort(reverse=True)\nopener_index = 0\nhappiness = sum(cans[: m - len(openers)])\nfor i in range(min(m - len(openers), len(cans))):\n if opener_index < len(openers):\n happiness += cans[i] * openers[opener_index]\n opener_index += 1\nprint(happiness)", "import sys\n\ninput = sys.stdin.readline\n(n, m) = map(int, input().split())\ncans = []\nopeners = []\nfor i in range(n):\n (t, x) = map(int, input().split())\n if t == 0:\n cans.append(x)\n elif t == 1:\n cans.append(-x)\n else:\n openers.append(x)\ncans.sort(reverse=True)\nopeners.sort(reverse=True)\nopener_index = 0\nans = 0\nfor x in cans:\n if x > 0:\n ans += x\n elif m - opener_index > 0:\n ans += x\n m -= 1\n if opener_index < len(openers):\n opener_index += 1\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, m) = map(int, input().split())\ncans = []\nopeners = []\nfor i in range(n):\n (t, x) = map(int, input().split())\n if t == 0:\n cans.append(x)\n elif t == 1:\n cans.append(-x)\n else:\n openers.append(x)\ncans.sort(reverse=True)\nopeners.sort(reverse=True)\nopener_index = 0\nhappiness = 0\nfor i in range(m):\n if opener_index < len(openers) and cans[i] < 0:\n cans[i] *= -1\n openers[opener_index] -= 1\n if openers[opener_index] == 0:\n opener_index += 1\n happiness += cans[i]\nprint(happiness)", "import sys\n\ninput = sys.stdin.readline\n(n, m) = map(int, input().split())\ncans = []\nopeners = []\nfor i in range(n):\n (t, x) = map(int, input().split())\n if t == 0:\n cans.append(x)\n elif t == 1:\n cans.append(-x)\n else:\n openers.append(x)\ncans.sort(reverse=True)\nopeners.sort(reverse=True)\nopener_index = 0\nhappiness = 0\nfor i in range(m):\n if opener_index < len(openers) and cans[i] < 0:\n cans[i] *= -1 - openers[opener_index]\n opener_index += 1\n happiness += cans[i]\nprint(happiness)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\np = list(map(int, input().split()))\nprint(max(0, max(p) - p[0] + 1))", "n = int(input())\np = list(map(int, input().split()))\nprint(max(0, max(p) - p[0] + 1))", "n = int(input())\np = list(map(int, input().split()))\nprint(max(0, max(p) - p[0] + 1))", "n = int(input())\np = list(map(int, input().split()))\nprint(max(0, max(p) - p[0] + 1))", "n = int(input())\np = list(map(int, input().split()))\nprint(max(0, max(p) - p[0] + 1))", "n = int(input())\np = list(map(int, input().split()))\nprint(max(0, max(p) - p[0] + 1))", "n = int(input())\np = list(map(int, input().split()))\nprint(max(0, max(p) - p[0] + 1))", "n = int(input())\np = list(map(int, input().split()))\nprint(max(0, max(p) - p[0] + 1))", "n = int(input())\np = list(map(int, input().split()))\nprint(max(0, max(p) - p[0] + 1))", "n = int(input())\np = list(map(int, input().split()))\nprint(max(0, max(p) - p[0] + 1))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\n\ngraph = [[] for _ in range(n + 1)]\nindegree = [0] * (n + 1)\n\nfor _ in range(m):\n a, b = map(int, input().split())\n graph[a].append(b)\n indegree[b] += 1\n\nqueue = [i for i in range(1, n + 1) if indegree[i] == 0]\n\nif len(queue) == 0:\n print(-1)\n\nelse:\n while queue:\n x = queue.pop(0)\n for y in graph[x]:\n indegree[y] -= 1\n if indegree[y] == 0:\n queue.append(y)\n\n for i in range(1, n + 1):\n if indegree[i] == 0:\n print(i)\n break\n else:\n print(-1)", "import sys\n\ninput = sys.stdin.readline\n(n, m) = map(int, input().split())\ngraph = [[] for _ in range(n + 1)]\nfor _ in range(m):\n (a, b) = map(int, input().split())\n graph[a].append(b)\nans = -1\nfor i in range(1, n + 1):\n flag = 1\n for j in range(1, n + 1):\n if i == j:\n continue\n if i in graph[j]:\n flag = 0\n break\n if flag:\n if ans == -1:\n ans = i\n else:\n ans = -1\n break\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, m) = map(int, input().split())\ng = [[] for _ in range(n)]\nfor _ in range(m):\n (a, b) = map(int, input().split())\n a -= 1\n b -= 1\n g[a].append(b)\n g[b].append(a)\n\ncolor = [-1] * n\ncolor[0] = 0\nstack = [0]\nwhile stack:\n v = stack.pop()\n for nv in g[v]:\n if color[nv] == -1:\n color[nv] = 1 - color[v]\n stack.append(nv)\n elif color[nv] == color[v]:\n print(-1)\n exit()\n\nprint(color.count(1) == 1 and color.index(1) + 1 or -1)", "n, m = map(int, input().split())\n\ngraph = [[] for _ in range(n + 1)]\nindegree = [0] * (n + 1)\n\nfor _ in range(m):\n a, b = map(int, input().split())\n graph[a].append(b)\n indegree[b] += 1\n\nqueue = [i for i in range(1, n + 1) if indegree[i] == 0]\n\nwhile queue:\n node = queue.pop(0)\n for child in graph[node]:\n indegree[child] -= 1\n if indegree[child] == 0:\n queue.append(child)\n\nif sum(indegree[1:]) == 0:\n print(node)\nelse:\n print(-1)", "import sys\n\ninput = sys.stdin.readline\n(n, m) = map(int, input().split())\ngraph = [[] for _ in range(n + 1)]\nfor _ in range(m):\n (a, b) = map(int, input().split())\n graph[a].append(b)\nans = -1\nfor i in range(1, n + 1):\n flag = True\n for j in range(1, n + 1):\n if i == j:\n continue\n if i in graph[j]:\n flag = False\n break\n if flag:\n if ans == -1:\n ans = i\n else:\n ans = -1\n break\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, m) = map(int, input().split())\ngraph = [[] for i in range(n + 1)]\nfor i in range(m):\n (a, b) = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\n\ncolor = [-1] * (n + 1)\ncolor[1] = 0\nfor i in range(1, n + 1):\n if color[i] == -1:\n color[i] = 1\n\nfor i in range(1, n + 1):\n for j in graph[i]:\n if color[i] == color[j]:\n color[i] = 2\n break\n\nans = 0\nfor i in range(1, n + 1):\n if color[i] == 0:\n ans += 1\nif ans == 1:\n print(color.index(0))\nelse:\n print(-1)", "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nAB = [list(map(int, input().split())) for _ in range(M)]\ngraph = [[] for _ in range(N + 1)]\nfor a, b in AB:\n graph[a].append(b)\n graph[b].append(a)\n\nstack = [1]\nvisited = [False] * (N + 1)\nvisited[1] = True\nwhile stack:\n v = stack.pop()\n for nv in graph[v]:\n if not visited[nv]:\n visited[nv] = True\n stack.append(nv)\n\nif sum(visited) == N:\n print(visited.index(True))\nelse:\n print(-1)", "n, m = map(int, input().split())\na = [0] * n\nfor i in range(m):\n x, y = map(int, input().split())\n x, y = x - 1, y - 1\n a[x] += 1\n a[y] -= 1\nans = -1\nfor i in range(n):\n if a[i] == n - 1:\n if ans == -1:\n ans = i + 1\n else:\n ans = -1\n break\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nAB = [list(map(int, input().split())) for _ in range(M)]\ngraph = [[] for _ in range(N + 1)]\nfor A, B in AB:\n graph[A].append(B)\n graph[B].append(A)\n\nans = -1\nfor i in range(1, N + 1):\n flag = True\n for j in range(1, N + 1):\n if i == j:\n continue\n if j not in graph[i]:\n flag = False\n break\n if flag:\n if ans == -1:\n ans = i\n else:\n ans = -1\n break\nprint(ans)", "n, m = map(int, input().split())\na = [0] * n\nfor i in range(m):\n x, y = map(int, input().split())\n a[x - 1] += 1\n a[y - 1] -= 1\n\nif a.count(max(a)) == 1:\n print(a.index(max(a)) + 1)\nelse:\n print(-1)" ], "pass1_list": [ false, true, false, false, true, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += a[i] - a[-1] + 1\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += a[i] - a[-1] + 1\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += a[i] - a[-1] + 1\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += a[i] - a[-1] + 1\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += a[i] - a[i + 1] - 1\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += a[i] - a[-1] - i\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += a[i] - a[-1] + 1\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += a[i] - a[-1] + 1\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += a[i] - a[i + 1]\nprint(ans // 2)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += a[i] - a[i + 1] + 1\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\npi = \"3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679\"\nprint(pi[: n + 3])", "n = int(input())\npi = \"3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679\"\nprint(pi[: n + 3])", "n = int(input())\npi = \"3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679\"\nprint(pi[: n + 3])", "n = int(input())\npi = \"3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679\"\nprint(pi[: n + 3])", "n = int(input())\npi = \"3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679\"\nprint(pi[: n + 3])", "n = int(input())\npi = \"3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679\"\nprint(pi[: n + 3])", "n = int(input())\npi = \"3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679\"\nprint(pi[: n + 3])", "n = int(input())\npi = \"3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679\"\nprint(pi[: n + 3])", "n = int(input())\npi = \"3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679\"\nprint(pi[: n + 3])", "n = int(input())\npi = \"3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679\"\nprint(pi[: n + 3])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\nbets = []\r\nfor _ in range(n):\r\n c = int(input())\r\n a = list(map(int, input().split()))\r\n bets.append(a)\r\nx = int(input())\r\nwinners = []\r\nfor i in range(n):\r\n if x in bets[i]:\r\n winners.append((i + 1, len(bets[i])))\r\nif winners:\r\n min_bets = min(winners, key=lambda x: x[1])[1]\r\n print(len([i for i in winners if i[1] == min_bets]))\r\n print(\" \".join([str(i[0]) for i in winners if i[1] == min_bets]))\r\nelse:\r\n print(0)\r", "n = int(input())\r\nbets = []\r\nfor _ in range(n):\r\n c = int(input())\r\n a = list(map(int, input().split()))\r\n bets.append((c, a))\r\nx = int(input())\r\nwinners = []\r\nfor i, (c, a) in enumerate(bets, 1):\r\n if x in a:\r\n winners.append((c, i))\r\nif winners:\r\n winners.sort()\r\n print(len(winners))\r\n print(\" \".join(map(str, (i for _, i in winners[0:]))) + \"\\n\")\r\nelse:\r\n print(\"0\")\r", "n = int(input())\r\nbets = []\r\nfor i in range(n):\r\n c = int(input())\r\n a = list(map(int, input().split()))\r\n bets.append((c, i + 1, a))\r\nx = int(input())\r\nwinners = [i for c, i, a in bets if x in a]\r\nif winners:\r\n c = min(bets, key=lambda x: x[0] if x[1] in winners else 1000000000)[0]\r\n print(str(len(winners)))\r\n print(\" \".join(str(i) for c, i, a in bets if x in a and c == c))\r\nelse:\r\n print(0)\r", "n = int(input())\r\nbets = []\r\nfor _ in range(n):\r\n c = int(input())\r\n arr = list(map(int, input().split()))\r\n bets.append((c, arr))\r\nx = int(input())\r\n\r\nwinners = []\r\nfor i, (c, arr) in enumerate(bets, 1):\r\n if x in arr:\r\n winners.append((c, i))\r\n\r\nif winners:\r\n winners.sort()\r\n print(len(winners))\r\n print(\" \".join(map(str, (i for _, i in winners))))\r\nelse:\r\n print(0)\r", "n = int(input())\r\nplayers = []\r\nfor i in range(n):\r\n c = int(input())\r\n a = list(map(int, input().split()))\r\n players.append([c, a])\r\nx = int(input())\r\nwinners = []\r\nfor i, [c, a] in enumerate(players, 1):\r\n if x in a:\r\n winners.append([c, i])\r\nif winners:\r\n winners.sort()\r\n print(len(winners))\r\n print(*[w[1] for w in winners if w[0] == winners[0][0]])\r\nelse:\r\n print(0)\r", "n = int(input())\r\n\r\nbets = []\r\nfor _ in range(n):\r\n c = int(input())\r\n a = list(map(int, input().split()))\r\n bets.append((c, a))\r\n\r\nx = int(input())\r\n\r\nwinners = []\r\nfor i, (c, a) in enumerate(bets, 1):\r\n if x in a:\r\n winners.append((c, i))\r\n\r\nif winners:\r\n winners.sort()\r\n print(len(winners))\r\n print(*[i for _, i in winners])\r\nelse:\r\n print(0)\r", "n = int(input())\r\nbets = []\r\nfor _ in range(n):\r\n c = int(input())\r\n a = list(map(int, input().split()))\r\n bets.append((c, a))\r\nx = int(input())\r\nwinners = [i for i, bet in enumerate(bets) if x in bet[1]]\r\nif winners:\r\n min_bets = min(bets[i][0] for i in winners)\r\n print(len([i for i in winners if bets[i][0] == min_bets]))\r\n print(*[i + 1 for i in winners if bets[i][0] == min_bets])\r\nelse:\r\n print(0)\r", "n = int(input())\r\npeople = []\r\nfor _ in range(n):\r\n c = int(input())\r\n a = list(map(int, input().split()))\r\n people.append((c, a))\r\nx = int(input())\r\nwinners = [i for i, (c, a) in enumerate(people) if x in a]\r\nif winners:\r\n min_bets = min(people[i][0] for i in winners)\r\n print(len([i for i in winners if people[i][0] == min_bets]))\r\n print(*sorted([i for i in winners if people[i][0] == min_bets]))\r\nelse:\r\n print(0)\r", "n = int(input())\r\nplayers = []\r\nfor i in range(n):\r\n c = int(input())\r\n a = list(map(int, input().split()))\r\n players.append((c, a))\r\nx = int(input())\r\nwinners = [i for i, (c, a) in enumerate(players) if x in a]\r\nmin_bets = min(players[i][0] for i in winners)\r\nprint(len(winners))\r\nprint(\" \".join(str(i + 1) for i in winners if players[i][0] == min_bets))\r", "n = int(input())\r\nbets = []\r\nfor _ in range(n):\r\n c = int(input())\r\n a = list(map(int, input().split()))\r\n bets.append((c, a))\r\nx = int(input())\r\nwinners = [i for i, (c, a) in enumerate(bets) if x in a]\r\nmin_bets = min(len(bets[i][1]) for i in winners)\r\nprint(len([i for i in winners if len(bets[i][1]) == min_bets]))\r\nprint(\" \".join(map(str, [i + 1 for i in winners if len(bets[i][1]) == min_bets])))\r" ], "pass1_list": [ true, false, false, false, false, false, true, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\ns = input()\nc = list(map(int, input().split()))\n\nfor i in range(m):\n idx = [j for j in range(n) if c[j] == i + 1]\n if len(idx) > 1:\n tmp = s[idx[-1]]\n for j in range(len(idx) - 1, 0, -1):\n s = s[:idx[j]] + s[idx[j] + 1 :]\n s = s[:idx[j - 1]] + tmp + s[idx[j - 1] + 1 :]\n s = s[:idx[0]] + tmp + s[idx[0] + 1 :]\n\nprint(s)", "n, m = map(int, input().split())\ns = input()\nc = list(map(int, input().split()))\n\nfor i in range(m):\n idx = [j for j, x in enumerate(c) if x == i + 1]\n if len(idx) > 1:\n tmp = s[idx[-1]]\n for j in range(len(idx) - 1, 0, -1):\n s[idx[j]] = s[idx[j - 1]]\n s[idx[0]] = tmp\n\nprint(s)", "n, m = map(int, input().split())\ns = input()\nc = list(map(int, input().split()))\n\nfor i in range(m):\n idx = [j for j, x in enumerate(c) if x == i + 1]\n if len(idx) > 1:\n tmp = s[idx[-1]]\n for j in range(len(idx) - 1, 0, -1):\n s[idx[j]] = s[idx[j - 1]]\n s[idx[0]] = tmp\n\nprint(s)", "n, m = map(int, input().split())\ns = input()\nc = list(map(int, input().split()))\n\nfor i in range(m):\n idx = [j for j, x in enumerate(c) if x == i + 1]\n if len(idx) > 1:\n temp = s[idx[-1]]\n for j in range(len(idx) - 1, 0, -1):\n s[idx[j]] = s[idx[j - 1]]\n s[idx[0]] = temp\n\nprint(s)", "n, m = map(int, input().split())\ns = input()\nc = list(map(int, input().split()))\n\nfor i in range(m):\n idx = [j for j, x in enumerate(c) if x == i + 1]\n if len(idx) > 1:\n tmp = s[idx[-1]]\n for j in range(len(idx) - 1, 0, -1):\n s[idx[j]] = s[idx[j - 1]]\n s[idx[0]] = tmp\n\nprint(s)", "(n, m) = map(int, input().split())\ns = input()\nc = list(map(int, input().split()))\nd = [[] for i in range(m)]\nfor i in range(n):\n d[c[i] - 1].append(s[i])\nfor i in d:\n i.append(i[0])\n s2 = \"\"\n for j in range(len(i)):\n s2 += i[j]\n d[i[0 :: len(i)]] = s2\nprint(\"\".join(d))", "n, m = map(int, input().split())\ns = input()\nc = list(map(int, input().split()))\n\nfor i in range(m):\n idx = [j for j in range(n) if c[j] == i + 1]\n if len(idx) > 1:\n tmp = s[idx[-1]]\n for j in range(len(idx) - 1, 0, -1):\n s = s[:idx[j]] + tmp + s[idx[j] + 1 :]\n tmp = s[idx[j - 1]]\n\nprint(s)", "n, m = map(int, input().split())\ns = input()\nc = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n if c[i] not in d:\n d[c[i]] = [s[i]]\n else:\n d[c[i]].append(s[i])\n\nfor i in range(1, m + 1):\n d[i] = d[i][-1:] + d[i][:-1]\n\nans = \"\"\nfor i in range(n):\n ans += d[c[i]].pop(0)\n\nprint(ans)", "(n, m) = map(int, input().split())\ns = input()\nc = list(map(int, input().split()))\n\nfor i in range(m):\n idx = [j for j, x in enumerate(c) if x == i + 1]\n if len(idx) > 1:\n tmp = s[idx[-1]]\n for j in range(len(idx) - 1, 0, -1):\n s[idx[j]] = s[idx[j - 1]]\n s[idx[0]] = tmp\n\nprint(s)", "n, m = map(int, input().split())\ns = input()\nc = [int(i) for i in input().split()]\n\nfor i in range(1, m + 1):\n ind = [j for j in range(n) if c[j] == i]\n if len(ind) > 1:\n temp = s[ind[-1]]\n for j in range(len(ind) - 1, 0, -1):\n s = s[:ind[j]] + s[ind[j - 1]]\n c[ind[j]] = c[ind[j - 1]]\n s = s[:ind[0]] + temp + s[ind[0] + 1 :]\n\nprint(s)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ns = input()\nq = int(input())\n\nfor _ in range(q):\n t, x, c = map(str, input().split())\n t, x = int(t), int(x)\n if t == 1:\n s = s[:x - 1] + c + s[x:]\n elif t == 2:\n s = s.lower()\n else:\n s = s.upper()\n\nprint(s)", "n = int(input())\ns = input()\nq = int(input())\n\nfor _ in range(q):\n t, x, c = map(str, input().split())\n t, x = int(t), int(x)\n if t == 1:\n s = s[:x - 1] + c + s[x:]\n elif t == 2:\n s = s.lower()\n else:\n s = s.upper()\nprint(s)", "n = int(input())\ns = input()\nq = int(input())\n\nfor _ in range(q):\n t, x, c = map(str, input().split())\n t, x = int(t), int(x)\n if t == 1:\n s = s[:x - 1] + c + s[x:]\n elif t == 2:\n s = s.lower()\n else:\n s = s.upper()\nprint(s)", "n = int(input())\ns = input()\nq = int(input())\n\nfor _ in range(q):\n t, x, c = map(str, input().split())\n t, x = int(t), int(x)\n if t == 1:\n s = s[:x - 1] + c + s[x:]\n elif t == 2:\n s = s.lower()\n else:\n s = s.upper()\nprint(s)", "n = int(input())\ns = input()\nq = int(input())\n\nfor _ in range(q):\n t, x, c = map(str, input().split())\n t, x = int(t), int(x)\n if t == 1:\n s = s[:x - 1] + c + s[x:]\n elif t == 2:\n s = s.lower()\n else:\n s = s.upper()\n\nprint(s)", "n = int(input())\ns = input()\nq = int(input())\n\nfor _ in range(q):\n t, x, c = map(str, input().split())\n t, x = int(t), int(x)\n if t == 1:\n s = s[:x - 1] + c + s[x:]\n elif t == 2:\n s = s.lower()\n else:\n s = s.upper()\n\nprint(s)", "n = int(input())\ns = input()\nq = int(input())\n\nfor _ in range(q):\n t, x, c = map(str, input().split())\n t, x = int(t), int(x)\n if t == 1:\n s = s[:x - 1] + c + s[x:]\n elif t == 2:\n s = s.lower()\n else:\n s = s.upper()\n\nprint(s)", "n = int(input())\ns = input()\nq = int(input())\n\nfor _ in range(q):\n t, x, c = map(str, input().split())\n t, x = int(t), int(x)\n if t == 1:\n s = s[:x - 1] + c + s[x:]\n elif t == 2:\n s = s.lower()\n else:\n s = s.upper()\nprint(s)", "n = int(input())\ns = input()\nq = int(input())\n\nfor _ in range(q):\n t, x, c = map(str, input().split())\n t, x = int(t), int(x)\n if t == 1:\n s = s[:x - 1] + c + s[x:]\n elif t == 2:\n s = s.lower()\n else:\n s = s.upper()\n\nprint(s)", "n = int(input())\ns = input()\nq = int(input())\n\nfor _ in range(q):\n t, x, c = map(str, input().split())\n t, x = int(t), int(x)\n if t == 1:\n s = s[:x - 1] + c + s[x:]\n elif t == 2:\n s = s.lower()\n else:\n s = s.upper()\n\nprint(s)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\nN, M = map(int, input().split())\n\nroulettes = []\nfor i in range(N):\n C, P, *S = map(int, input().split())\n S = sum(S) / P\n roulettes.append((C, S))\n\ndp = [[float(\"inf\")] * (M + 1) for _ in range(N + 1)]\ndp[0][0] = 0\n\nfor i in range(N):\n C, S = roulettes[i]\n for j in range(M):\n dp[i + 1][j + int(S > j)] = min(dp[i + 1][j + int(S > j)], dp[i][j] + C)\n\nprint(dp[N][M])", "from collections import defaultdict\nfrom functools import lru_cache\nimport sys\n\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\n\nroulettes = []\nfor _ in range(N):\n C, P, *S = map(int, input().split())\n S = tuple(S)\n roulettes.append((C, P, S))\n\n\n@lru_cache(None)\ndef dp(i, score):\n if score >= M:\n return 0\n if i == N:\n return float(\"inf\")\n ans = float(\"inf\")\n for j in range(roulettes[i][1]):\n ans = min(ans, roulettes[i][0] + dp(i + 1, score + roulettes[i][2][j]))\n return ans\n\n\nans = dp(0, 0)\nprint(ans)", "from collections import defaultdict\nfrom itertools import count\n\nN, M = map(int, input().split())\n\nroulettes = []\nfor _ in range(N):\n C, P, *S = map(int, input().split())\n S = tuple(S)\n assert len(S) == P\n roulettes.append((C, P, S))\n\ndp = defaultdict(float, {(-1, 0): 0})\nq = [(-1, 0)]\nfor i in count():\n if i >= len(q):\n break\n x, y = q.pop(0)\n for C, P, S in roulettes:\n for s in S:\n if y + s >= M:\n dp[C, P] = min(dp[C, P], dp[x, y] + C)\n continue\n if C not in dp or dp[C, P] + C + dp[x, y + s] < dp[C, P]:\n dp[C, P] = dp[x, y + s] + C\n q.append((C, P))\n\nans = min((dp[C, P] for C, P in dp))\nprint(ans)", "from collections import defaultdict\nfrom itertools import count\nfrom operator import itemgetter\n\nN, M = map(int, input().split())\n\nroulettes = []\nfor _ in range(N):\n C, P, *S = map(int, input().split())\n S = sum(S) / P\n roulettes.append((C, S))\n\nroulettes.sort(key=itemgetter(1), reverse=True)\n\ndp = [defaultdict(lambda: float(\"inf\")) for _ in range(N + 1)]\ndp[0][0] = 0\n\nfor i, (C, S) in enumerate(roulettes):\n for j in range(M + 1):\n for k in count(1):\n next_j = j + k * S\n if next_j > M:\n break\n dp[i + 1][next_j] = min(dp[i + 1][next_j], dp[i][j] + C)\n\nprint(dp[N][M])", "from collections import defaultdict\n\nINF = 10**18\n\n\ndef main():\n (N, M) = map(int, input().split())\n C = []\n P = []\n S = []\n for _ in range(N):\n ci, pi, *si = map(int, input().split())\n C.append(ci)\n P.append(pi)\n S.append(si)\n\n dp = [[[0, 0] for _ in range(M + 1)] for _ in range(N)]\n for i in range(N):\n for j in range(P[i]):\n for k in range(M - S[i][j], M + 1):\n dp[i][k][0] = (dp[i][k][0] + dp[i][k - S[i][j]][1]) / P[i]\n dp[i][k][1] = dp[i][k][1] + C[i]\n\n for i in range(N):\n for j in range(M):\n dp[i][j][1] = min(dp[i][j][1], dp[i][j + 1][1])\n\n ans = INF\n for i in range(N):\n ans = min(ans, dp[i][0][1])\n\n print(ans)\n\n\nmain()", "from collections import deque\n\nN, M = map(int, input().split())\n\nroulettes = []\nfor i in range(N):\n C, P, *S = map(int, input().split())\n S = [0] + S\n S_sum = sum(S)\n S_avg = S_sum / P\n S_max = max(S)\n roulettes.append((C, P, S, S_sum, S_avg, S_max))\n\nroulettes.sort(key=lambda x: x[5], reverse=True)\n\ndp = [[float(\"inf\")] * (M + 1) for _ in range(N + 1)]\ndp[0][0] = 0\n\nfor i in range(N):\n C, P, S, S_sum, S_avg, S_max = roulettes[i]\n for j in range(M + 1):\n if j == M:\n dp[i + 1][j] = dp[i][j]\n else:\n dp[i + 1][j] = min(dp[i][j], dp[i][j + S_max] + C)\n for s in S:\n dp[i + 1][j + s] = min(dp[i + 1][j + s], dp[i][j] + C / S_avg)\n\nprint(dp[N][M])", "from collections import defaultdict\nfrom functools import lru_cache\nimport sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n n, m = list(map(int, input().split()))\n c = []\n p = []\n s = []\n for _ in range(n):\n ci, pi, *si = list(map(int, input().split()))\n c.append(ci)\n p.append(pi)\n s.append(si)\n\n @lru_cache(None)\n def dp(i, rem):\n if rem == 0:\n return 0\n if i == n:\n return float(\"inf\")\n ans = c[i] * p[i]\n for j in range(p[i]):\n ans += dp(i, rem - s[i][j]) / p[i]\n return ans\n\n print(dp(0, m))\n\n\nmain()", "from collections import defaultdict\nfrom itertools import count\n\nN, M = map(int, input().split())\n\nroulettes = []\nfor _ in range(N):\n C, P, *S = map(int, input().split())\n S = tuple(S)\n assert len(S) == P\n roulettes.append((C, P, S))\n\n\ndef solve(roulettes):\n dp = defaultdict(lambda: float(\"inf\"))\n dp[0] = 0\n for i in count():\n next_dp = defaultdict(lambda: float(\"inf\"))\n for score, cost in dp.items():\n if score >= M:\n continue\n for C, P, S in roulettes:\n next_score = score + S[i % P]\n next_cost = cost + C\n next_dp[next_score] = min(next_dp[next_score], next_cost)\n dp = next_dp\n return dp[M - 1]\n\n\nprint(solve(roulettes))", "from collections import defaultdict\nfrom itertools import count\n\nN, M = map(int, input().split())\n\nroulettes = []\nfor _ in range(N):\n C, P, *S = map(int, input().split())\n S = sum(S) / P\n roulettes.append((C, S))\n\nroulettes.sort(key=lambda x: x[1], reverse=True)\n\ndp = [defaultdict(lambda: float(\"inf\")) for _ in range(N + 1)]\ndp[0][0] = 0\n\nfor i in range(N):\n C, S = roulettes[i]\n for j in range(M + 1):\n for k in count(1):\n next_j = min(M, j + k * S)\n cost = k * C\n dp[i + 1][next_j] = min(dp[i + 1][next_j], dp[i][j] + cost)\n\nprint(dp[N][M])", "from collections import defaultdict\nfrom itertools import count\nfrom operator import itemgetter\n\nN, M = map(int, input().split())\n\nroulettes = []\nfor _ in range(N):\n C, P, *S = map(int, input().split())\n S = sum(S) / P\n roulettes.append((C, S))\n\nroulettes.sort(key=itemgetter(1), reverse=True)\n\ndp = [defaultdict(float, {0: 0}) for _ in range(N)]\nfor i, (C, S) in enumerate(roulettes):\n for j in range(i):\n dp[i][M] = min(dp[i][M], dp[j][M])\n for k in range(M, 0, -1):\n dp[i][k - 1] = min(dp[i][k - 1], dp[i][k] + C)\n for j in range(i):\n dp[i][k - 1] = min(dp[i][k - 1], dp[j][k - S] + C)\n\nans = min((dp[i][0] for i in range(N)))\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nn = int(input())\np = [int(x) for x in input().split()]\nq = [int(x) for x in input().split()]\nfor i in range(n - 2):\n p[i] -= 1\n q[i] -= 1\ndp = [1] * n\nfor i in range(n - 1):\n a = p[i]\n b = q[i]\n dp[a] = (dp[a] * (i + 2) - dp[b] * (i + 2 - dp[b])) % mod\n dp[b] = (dp[b] * (i + 2) + dp[a] * (i + 2 - dp[a])) % mod\n dp[a] = (dp[a] * (i + 2) + dp[b] * (i + 2 - dp[b])) % mod\n dp[b] = (dp[b] * (i + 2) - dp[a] * (i + 2 - dp[a])) % mod\n dp[a] = (dp[a] + dp[b]) % mod\n dp[b] = (dp[b] + dp[a]) % mod\nprint(*dp)", "def main():\n mod = 998244353\n n = int(input())\n p, q = [int(x) for x in input().split()]\n p, q = [p - 1], [q - 1]\n for _ in range(n - 2):\n p_, q_ = [int(x) for x in input().split()]\n p_, q_ = p_ - 1, q_ - 1\n p.append(p_)\n q.append(q_)\n p, q = [0] + p, [0] + q\n dp = [[1, 1] for _ in range(n + 1)]\n for i in range(n - 1, 0, -1):\n a, b = dp[p[i]][0], dp[q[i]][0]\n c = (a + b) % mod\n dp[p[i]][0] = c\n dp[q[i]][0] = c\n dp[p[i]][1] = (a * (i + a) % mod + b * (i + b) % mod) * pow(c, mod - 2, mod) % mod\n dp[q[i]][1] = (b * (i + a) % mod + a * (i + b) % mod) * pow(c, mod - 2, mod) % mod\n print(\" \".join(str(dp[i][1]) for i in range(1, n + 1)))\n\n\nmain()", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\n\n\ndef add(a, b):\n return (a + b) % mod\n\n\ndef sub(a, b):\n return (a - b) % mod\n\n\ndef mul(a, b):\n return a * b % mod\n\n\ndef power(a, b):\n ans = 1\n while b:\n if b & 1:\n ans = mul(ans, a)\n a = mul(a, a)\n b >>= 1\n return ans\n\n\ndef inverse(a):\n return power(a, mod - 2)\n\n\ndef solve():\n n = int(input())\n p = [int(x) for x in input().split()]\n q = [int(x) for x in input().split()]\n dp = [1] * (n + 1)\n for i in range(n - 1):\n a = dp[p[i] - 1]\n b = dp[q[i] - 1]\n dp[p[i] - 1] = add(a, mul(b, inverse(add(a, b))))\n dp[q[i] - 1] = add(a, b)\n print(*dp[1:])\n\n\nsolve()", "def main():\n mod = 998244353\n n = int(input())\n p, q = [int(x) for x in input().split()]\n p, q = [p - 1], [q - 1]\n for _ in range(n - 2):\n p.append(int(input().split()[0]) - 1)\n q.append(int(input().split()[1]) - 1)\n dp = [1] * n\n for i in range(n - 1):\n a = dp[p[i]]\n b = dp[q[i]]\n dp[p[i]] = (a * (a + b) % mod) * (i + 1) % mod\n dp[q[i]] = (b * (a + b) % mod) * (i + 1) % mod\n dp[p[i]] %= mod\n dp[q[i]] %= mod\n dp[p[i]] += dp[q[i]]\n dp[p[i]] %= mod\n dp[q[i + 1]] = dp[p[i]]\n print(\" \".join(str(x) for x in dp))\n\n\nmain()", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\n\n\ndef add(a, b):\n return (a + b) % mod\n\n\ndef mul(a, b):\n return a * b % mod\n\n\ndef sub(a, b):\n return (a - b + mod) % mod\n\n\ndef inv(x):\n return pow(x, mod - 2, mod)\n\n\ndef main():\n n = int(input())\n p, q = [int(x) for x in input().split()]\n p, q = [p - 1], [q - 1]\n for _ in range(n - 2):\n x, y = [int(x) for x in input().split()]\n p.append(x - 1)\n q.append(y - 1)\n dp = [[1, 1]]\n for i in range(n - 1):\n x, y = p[i], q[i]\n a, b = dp[-1]\n c = mul(a, x + 1)\n d = mul(b, y + 1)\n e = add(c, d)\n c = mul(c, inv(x + y + 2))\n d = mul(d, inv(x + y + 2))\n e = mul(e, inv(x + y + 2))\n dp.append([add(c, d), e])\n ans = [0] * n\n for i in range(n):\n ans[i] = mul(dp[i][0], dp[i][1])\n print(*ans)\n\n\nmain()", "from sys import stdin\n\ninput = stdin.readline\nmod = 998244353\nN = int(input())\nP = [int(x) for x in input().split()]\nQ = [int(x) for x in input().split()]\n\nparent = [i for i in range(N + 1)]\nrank = [0] * (N + 1)\n\n\ndef find(x):\n if parent[x] == x:\n return x\n parent[x] = find(parent[x])\n return parent[x]\n\n\ndef union(x, y):\n px = find(x)\n py = find(y)\n if rank[px] > rank[py]:\n parent[py] = px\n elif rank[px] < rank[py]:\n parent[px] = py\n else:\n parent[px] = py\n rank[py] += 1\n\n\nfor i in range(N - 1):\n union(P[i], Q[i])\n\nsize = [0] * (N + 1)\nfor i in range(1, N + 1):\n size[find(i)] += 1\n\nans = [0] * (N + 1)\nfor i in range(1, N + 1):\n ans[find(i)] = (ans[find(i)] + (size[find(i)] * (size[find(i)] + 1)) // 2) % mod)\n\nfor i in range(1, N + 1):\n print(ans[find(i)], end=\" \")", "def main():\n mod = 998244353\n n = int(input())\n p, q = [int(x) for x in input().split()] - 1\n dp = [1] * n\n for _ in range(n - 2):\n p, q = [p - 1, q - 1] if (p, q) != (0, 0) else [n - 2, n - 1]\n x, y = dp[p], dp[q]\n dp[p], dp[q] = (x + y) * (x + y + 1) // 2 % mod, 0\n dp[p] -= dp[q]\n dp[q] = x + y\n print(\" \".join(str(x * x % mod) for x in dp))\n\n\nmain()", "def main():\n mod = 998244353\n n = int(input())\n p, q = [int(x) for x in input().split()] - 1\n p, q = [p], [q]\n for _ in range(n - 2):\n p_i, q_i = map(int, input().split())\n p_i, q_i = p_i - 1, q_i - 1\n p.append(p_i)\n q.append(q_i)\n p = [1] * n\n for i in range(n - 1):\n p[p[q[i]]] += p[q[i]]\n p[p[i]] += p[i]\n print(*[x * pow(p[i], mod - 2, mod) % mod for i in range(n)])\n\n\nmain()", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\n\n\ndef add(a, b):\n return (a + b) % mod\n\n\ndef mul(a, b):\n return a * b % mod\n\n\ndef sub(a, b):\n return (a - b + mod) % mod\n\n\ndef inv(x):\n return pow(x, mod - 2, mod)\n\n\ndef main():\n n = int(input())\n p, q = [int(x) for x in input().split()]\n p.append(q)\n q.append(p[0])\n p = p[1:]\n q = q[1:]\n cnt = [1] * (n + 1)\n for i in range(n - 2):\n a = p[i]\n b = q[i]\n c = p[i] + q[i]\n cnt[a] = mul(cnt[a], c)\n cnt[b] = mul(cnt[b], c)\n cnt[c] = add(cnt[c], mul(cnt[a], cnt[b]))\n cnt[c] = mul(cnt[c], inv(c))\n cnt[a] = mul(cnt[a], sub(1, c))\n cnt[b] = mul(cnt[b], sub(1, c))\n cnt[a] = mul(cnt[a], inv(a))\n cnt[b] = mul(cnt[b], inv(b))\n print(*cnt[1:])\n\n\nmain()", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\n\n\ndef add(a, b):\n return (a + b) % mod\n\n\ndef sub(a, b):\n return (a - b + mod) % mod\n\n\ndef mul(a, b):\n return a * b % mod\n\n\ndef power(a, b):\n ans = 1\n while b:\n if b & 1:\n ans = mul(ans, a)\n a = mul(a, a)\n b >>= 1\n return ans\n\n\ndef inverse(a):\n return power(a, mod - 2)\n\n\ndef solve(n, p, q):\n prob = [1] * n\n for i in range(n - 1):\n a = prob[p[i] - 1]\n b = prob[q[i] - 1]\n prob[p[i] - 1] = mul(a, add(a, b))\n prob[q[i] - 1] = mul(b, add(a, b))\n inv = inverse(2)\n ans = [0] * n\n for i in range(n):\n ans[i] = mul(prob[i], inv)\n return ans\n\n\nn = int(input())\np = []\nq = []\nfor i in range(n - 1):\n a, b = map(int, input().split())\n p.append(a)\n q.append(b)\nprint(*solve(n, p, q))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s = input()\r\ns = \"\".join([i for i in s if i not in \"aeiou\"])\r\nprint(s)", "s = input()\r\ns = \"\".join(c for c in s if c not in \"aeiou\")\r\nprint(s)", "s = input()\r\ns = \"\".join([i for i in s if i not in \"aeiou\"])\r\nprint(s)", "s = input()\r\ns = \"\".join([i for i in s if i not in \"aeiou\"])\r\nprint(s)", "s = input()\r\ns = \"\".join([i for i in s if i not in \"aeiou\"])\r\nprint(s)", "s = input()\r\ns = \"\".join([i for i in s if i not in \"aeiou\"])\r\nprint(s)", "s = input()\r\ns = \"\".join(i for i in s if i not in \"aeiou\")\r\nprint(s)", "s = input()\r\ns = \"\".join(i for i in s if i not in \"aeiou\")\r\nprint(s)", "s = input()\r\nprint(\"\".join([i for i in s if i not in \"aeiou\"]))", "s = input()\r\ns = \"\".join([i for i in s if i not in \"aeiou\"])\r\nprint(s)" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "m = int(input())\nd = list(map(int, input().split()))\nc = 0\nfor i in range(m):\n c += d[i]\n if c % 2 == 1:\n print(i + 1, c // 2 + 1)\n break\n else:\n c += 1", "m = int(input())\nd = list(map(int, input().split()))\ns = sum(d)\nfor i in range(m):\n if s // 2 <= d[i]:\n print(i + 1, s // 2 - d[:i] | 1)\n break\n s -= d[i]", "m = int(input())\r\nd = list(map(int, input().split()))\r\ns = sum(d)\r\nfor i in range(m):\r\n if s <= (s + 1) // 2:\r\n print(i + 1, (s + 1) // 2 - sum(d[:i]) + 1)\r\n break\r\n s -= d[i]\r", "m = int(input())\r\nd = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(m):\r\n s += d[i]\r\n if s >= (sum(d) + 1) // 2:\r\n print(i + 1, s - (sum(d) + 1) // 2)\r\n break\r", "m = int(input())\r\nd = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(m):\r\n s += d[i]\r\n if s >= (sum(d) + 1) // 2:\r\n print(i + 1, s - (sum(d) + 1) // 2)\r\n break\r", "m = int(input())\r\nd = list(map(int, input().split()))\r\n\r\ns = 0\r\nfor i in range(m):\r\n s += d[i]\r\n if s % 2 == 1:\r\n print(i + 1, s // 2)\r\n break\r\nelse:\r\n print(m, s // 2 + 1)\r", "m = int(input())\nd = list(map(int, input().split()))\ns = sum(d) // 2\nfor i in range(m):\n if d[i] >= s:\n print(i + 1, s - (sum(d[:i]) + 1) + 1)\n break\n else:\n s -= d[i]", "m = int(input())\nd = list(map(int, input().split()))\ns = 0\nfor i in range(m):\n s += d[i]\n if s > (sum(d) + 1) // 2:\n break\nprint(i + 1, s - (sum(d) + 1) // 2)", "m = int(input())\r\nd = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(m):\r\n s += d[i]\r\n if s >= (sum(d) + 1) // 2:\r\n print(i + 1, s - (sum(d) + 1) // 2)\r\n break\r", "m = int(input())\r\nd = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(m):\r\n s += d[i]\r\n if s >= (sum(d) + 1) // 2:\r\n print(i + 1, s - (sum(d) + 1) // 2)\r\n break\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\n\nflavor = {}\nfor i in range(n):\n f, s = map(int, input().split())\n if f not in flavor:\n flavor[f] = []\n flavor[f].append(s)\n\nans = 0\nfor f in flavor:\n flavor[f].sort(reverse=True)\n ans = max(ans, flavor[f][0] + flavor[f][1] // 2)\n for i in range(len(flavor[f])):\n for j in range(i + 1, len(flavor[f])):\n ans = max(ans, flavor[f][i] + flavor[f][j])\n\nprint(ans)", "n = int(input())\nf = []\ns = []\nfor i in range(n):\n a, b = map(int, input().split())\n f.append(a)\n s.append(b)\nf.sort()\ns.sort(reverse=True)\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n if f[i] != f[j]:\n ans = max(ans, s[i] + s[j])\n else:\n ans = max(ans, s[i] + s[j] // 2)\nprint(ans)", "n = int(input())\n\ndata = []\nfor i in range(n):\n data.append(list(map(int, input().split())))\n\ndata.sort(key=lambda x: x[1])\n\nmax_satisfaction = 0\nfor i in range(n):\n for j in range(i + 1, n):\n if data[i][0] == data[j][0]:\n max_satisfaction = max(max_satisfaction, data[i][1] + data[j][1] // 2)\n else:\n max_satisfaction = max(max_satisfaction, data[i][1] + data[j][1])\n\nprint(max_satisfaction)", "n = int(input())\nf = []\ns = []\nfor i in range(n):\n a, b = map(int, input().split())\n f.append(a)\n s.append(b)\n\nf.sort()\ns.sort(reverse=True)\n\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n if f[i] != f[j]:\n ans = max(ans, s[i] + s[j])\n\nfor i in range(n):\n for j in range(i + 1, n):\n if f[i] == f[j]:\n ans = max(ans, s[i] + s[j] // 2)\n\nprint(ans)", "n = int(input())\n\nflavors = {}\nfor _ in range(n):\n f, s = map(int, input().split())\n if f not in flavors:\n flavors[f] = []\n flavors[f].append(s)\n\nans = 0\nfor f in flavors:\n flavors[f].sort(reverse=True)\n if len(flavors[f]) >= 2:\n ans = max(ans, flavors[f][0] + flavors[f][1] // 2)\n\nfor i in range(n):\n for j in range(i + 1, n):\n if flavors[i][0] > flavors[j][0]:\n flavors[i][0], flavors[j][0] = flavors[j][0], flavors[i][0]\n\nfor i in range(n):\n for j in range(i + 1, n):\n if flavors[i][0] + flavors[j][0] > ans:\n ans = flavors[i][0] + flavors[j][0]\n\nprint(ans)", "n = int(input())\na = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append((x, y))\na.sort(key=lambda x: x[1])\nmax_sat = 0\nfor i in range(n - 1):\n for j in range(i + 1, n):\n if a[i][0] == a[j][0]:\n max_sat = max(max_sat, a[i][1] + a[j][1] // 2)\n else:\n max_sat = max(max_sat, a[i][1] + a[j][1])\nprint(max_sat)", "n = int(input())\n\nflavors = {}\nfor _ in range(n):\n f, s = map(int, input().split())\n if f not in flavors:\n flavors[f] = []\n flavors[f].append(s)\n\nmax_satisfaction = 0\nfor f in flavors:\n flavors[f].sort(reverse=True)\n if len(flavors[f]) >= 2:\n max_satisfaction = max(max_satisfaction, flavors[f][0] + flavors[f][1] // 2)\n\nfor i in range(n):\n for j in range(i + 1, n):\n if flavors[i] != flavors[j]:\n max_satisfaction = max(max_satisfaction, flavors[i][0] + flavors[j][0])\n\nprint(max_satisfaction)", "n = int(input())\n\nflavor = {}\n\nfor i in range(n):\n f, s = map(int, input().split())\n if f not in flavor:\n flavor[f] = []\n flavor[f].append(s)\n\nans = 0\n\nfor f in flavor:\n flavor[f].sort(reverse=True)\n if len(flavor[f]) >= 2:\n ans = max(ans, flavor[f][0] + flavor[f][1] // 2)\n\nfor i in range(n):\n for j in range(i + 1, n):\n if flavor[i] != flavor[j]:\n ans = max(ans, flavor[i][0] + flavor[j][0])\n break\n\nprint(ans)", "n = int(input())\n\nflavors = {}\nfor _ in range(n):\n f, s = map(int, input().split())\n if f not in flavors:\n flavors[f] = []\n flavors[f].append(s)\n\nans = 0\nfor f in flavors:\n flavors[f].sort(reverse=True)\n if len(flavors[f]) >= 2:\n ans = max(ans, flavors[f][0] + flavors[f][1] // 2)\n for i in range(len(flavors[f])):\n for j in range(i):\n for k in flavors:\n if k != f and len(flavors[k]) >= 1:\n ans = max(ans, flavors[f][i] + flavors[f][j] + flavors[k][0])\n\nprint(ans)", "n = int(input())\na = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append((x, y))\na.sort(key=lambda x: x[1], reverse=True)\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n if a[i][0] == a[j][0]:\n ans = max(ans, a[i][1] + a[j][1] // 2)\n else:\n ans = max(ans, a[i][1] + a[j][1])\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nH, W = map(int, input().split())\n\nfield = []\n\nfor _ in range(H):\n field.append(input().rstrip())\n\nrow = [False] * W\ncol = [False] * W\n\nwhile True:\n for i in range(H):\n if not row[i]:\n continue\n c = field[i][0]\n flag = True\n for j in range(W):\n if field[i][j] != c:\n flag = False\n break\n if flag:\n for j in range(W):\n row[j] = True\n\n for j in range(W):\n if not col[j]:\n continue\n c = field[0][j]\n flag = True\n for i in range(H):\n if field[i][j] != c:\n flag = False\n break\n if flag:\n for i in range(H):\n col[i] = True\n\n if not any(row) and not any(col):\n break\n\n for i in range(H):\n for j in range(W):\n if row[j] or col[i]:\n field[i] = field[i][:j] + field[i][j + 1 :]\n\n for i in range(H):\n row[i] = False\n for j in range(W):\n col[j] = False\n\nprint(sum(len(s) for s in field))", "from collections import defaultdict\n\nH, W = map(int, input().split())\ngrid = [input() for _ in range(H)]\n\nrow = defaultdict(int)\ncol = defaultdict(int)\n\nwhile True:\n for i in range(H):\n c = grid[i][0]\n cnt = 0\n for j in range(W):\n if grid[i][j] == c:\n cnt += 1\n else:\n break\n if cnt >= 2:\n row[i] = 1\n\n for j in range(W):\n c = grid[0][j]\n cnt = 0\n for i in range(H):\n if grid[i][j] == c:\n cnt += 1\n else:\n break\n if cnt >= 2:\n col[j] = 1\n\n if not row and not col:\n break\n\n for i in range(H):\n if row[i]:\n for j in range(W):\n grid[i][j] = \".\"\n\n for j in range(W):\n if col[j]:\n for i in range(H):\n grid[i][j] = \".\"\n\n for i in range(H):\n row[i] = 0\n\n for j in range(W):\n col[j] = 0\n\nprint(sum(sum(r == \".\" for r in g) for g in grid))", "h, w = map(int, input().split())\n\ngrid = []\nfor _ in range(h):\n grid.append(input())\n\nrow = [False] * h\ncol = [False] * w\n\nwhile True:\n for i in range(h):\n if not row[i]:\n color = grid[i][0]\n flag = True\n for j in range(w):\n if grid[i][j] != color:\n flag = False\n break\n if flag:\n for j in range(w):\n if not col[j]:\n col[j] = True\n row[i] = True\n\n for j in range(w):\n if not col[j]:\n color = grid[0][j]\n flag = True\n for i in range(h):\n if grid[i][j] != color:\n flag = False\n break\n if flag:\n for i in range(h):\n if not row[i]:\n row[i] = True\n col[j] = True\n\n if not any(row) and not any(col):\n break\n\n for i in range(h):\n if row[i]:\n for j in range(w):\n grid[i][j] = \".\"\n\n for j in range(w):\n if col[j]:\n for i in range(h):\n grid[i][j] = \".\"\n\n for i in range(h):\n row[i] = False\n\n for j in range(w):\n col[j] = False\n\nprint(sum(1 for i in range(h) for j in range(w) if grid[i][j] != \".\"))", "from collections import Counter\n\nH, W = map(int, input().split())\ngrid = [input() for _ in range(H)]\n\nrow_counts = [Counter(row) for row in grid]\ncol_counts = [Counter(col) for col in zip(*grid)]\n\nwhile True:\n row_remove = False\n col_remove = False\n for i in range(H):\n if len(row_counts[i]) == 1:\n row_remove = True\n del row_counts[i]\n del grid[i]\n H -= 1\n\n for j in range(W):\n if len(col_counts[j]) == 1:\n col_remove = True\n del col_counts[j]\n for i in range(H):\n del grid[i][j]\n W -= 1\n\n if not (row_remove or col_remove):\n break\n\nprint(sum(len(c) for c in row_counts) + sum(len(c) for c in col_counts))", "from collections import defaultdict\n\nh, w = map(int, input().split())\ngrid = [input() for _ in range(h)]\n\nrow = defaultdict(int)\ncol = defaultdict(int)\n\nwhile True:\n for i in range(h):\n c = grid[i][0]\n flag = True\n for j in range(w):\n if grid[i][j] != c:\n flag = False\n break\n if flag:\n for j in range(w):\n row[i, j] += 1\n col[i, j] += 1\n\n for j in range(w):\n c = grid[0][j]\n flag = True\n for i in range(h):\n if grid[i][j] != c:\n flag = False\n break\n if flag:\n for i in range(h):\n row[i, j] += 1\n col[i, j] += 1\n\n cnt = 0\n for i in range(h):\n for j in range(w):\n if row[i, j] == 1 and col[i, j] == 1:\n cnt += 1\n\n if cnt == h * w:\n break\n\n for i in range(h):\n for j in range(w):\n if row[i, j] > 1:\n grid[i][j] = \".\"\n\n for j in range(w):\n for i in range(h):\n if col[i, j] > 1:\n grid[i][j] = \".\"\n\nprint(cnt)", "from collections import defaultdict\n\nH, W = map(int, input().split())\ngrid = [input() for _ in range(H)]\n\nrow = defaultdict(int)\ncol = defaultdict(int)\n\nwhile True:\n for i in range(H):\n c = grid[i][0]\n flag = True\n for j in range(W):\n if grid[i][j] != c:\n flag = False\n break\n if flag:\n for j in range(W):\n row[i, j] += 1\n col[i, j] += 1\n\n for j in range(W):\n c = grid[0][j]\n flag = True\n for i in range(H):\n if grid[i][j] != c:\n flag = False\n break\n if flag:\n for i in range(H):\n row[i, j] += 1\n col[i, j] += 1\n\n cnt = 0\n for i in range(H):\n for j in range(W):\n if row[i, j] == 1 and col[i, j] == 1:\n cnt += 1\n\n if cnt == H * W:\n break\n\n for i in range(H):\n for j in range(W):\n if row[i, j] > 1:\n grid[i][j] = \".\"\n\n for j in range(W):\n for i in range(H):\n if col[i, j] > 1:\n grid[i][j] = \".\"\n\nprint(cnt)", "from collections import defaultdict\n\nH, W = map(int, input().split())\n\ngrid = [input() for _ in range(H)]\n\nrow = defaultdict(int)\ncol = defaultdict(int)\n\nwhile True:\n for i in range(H):\n c = grid[i][0]\n cnt = sum(1 for cj in grid[i] if cj == c)\n if cnt >= 2:\n row[i] = c\n for j in range(W):\n c = grid[0][j]\n cnt = sum(1 for ci in grid if grid[ci][j] == c)\n if cnt >= 2:\n col[j] = c\n\n if not row and not col:\n break\n\n for i in range(H):\n if i in row:\n for j in range(W):\n grid[i][j] = \".\"\n for j in range(W):\n if j in col:\n for i in range(H):\n grid[i][j] = \".\"\n\n for i in range(H):\n if not grid[i]:\n del grid[i]\n\n for j in range(W):\n if not grid[0][j]:\n for i in range(H):\n del grid[i][j]\n\n H, W = len(grid), len(grid[0])\n\nprint(sum(sum(1 for c in row) for row in grid))", "from collections import Counter\n\n(H, W) = map(int, input().split())\ngrid = [input() for _ in range(H)]\n\nrow = [Counter(row) for row in grid]\ncol = [Counter(col) for col in zip(*grid)]\n\nwhile True:\n row_remove = []\n col_remove = []\n for i, r in enumerate(row):\n if len(r) == 1:\n row_remove.append(i)\n for i, c in enumerate(col):\n if len(c) == 1:\n col_remove.append(i)\n\n if not row_remove and not col_remove:\n break\n\n for i in row_remove:\n del row[i]\n for i in col_remove:\n del col[i]\n\n if not row:\n break\n if not col:\n break\n\n grid = [list(row) for row in zip(*col)]\n row = [Counter(row) for row in grid]\n col = [Counter(col) for col in zip(*grid)]\n\nprint(sum(len(c) for c in row))", "from collections import Counter\n\n(h, w) = map(int, input().split())\ngrid = [input() for _ in range(h)]\n\nrow = [Counter(row) for row in grid]\ncol = [Counter(col) for col in zip(*grid)]\n\nwhile True:\n remove = False\n for r in row:\n if len(r) == 1:\n remove = True\n for c in col:\n c[r.popitem()[0]] -= 1\n for c in col:\n if len(c) == 1:\n remove = True\n for r in row:\n r[c.popitem()[0]] -= 1\n if not remove:\n break\n\nprint(sum(r.values()) * sum(c.values()) for r, c in zip(row, col))", "h, w = map(int, input().split())\n\ngrid = []\nfor _ in range(h):\n grid.append(input())\n\nrow_colors = set(grid[0])\ncol_colors = set(grid[0])\n\nfor i in range(h):\n row = grid[i]\n row_color = set(row)\n if len(row_color) == 1:\n row_colors.discard(row_color.pop())\n\nfor j in range(w):\n col = [grid[i][j] for i in range(h)]\n col_color = set(col)\n if len(col_color) == 1:\n col_colors.discard(col_color.pop())\n\nprint(len(row_colors) * len(col_colors))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\nn = int(input())\n\ngraph = [[] for _ in range(n + 1)]\nindegree = [0] * (n + 1)\n\nfor i in range(n):\n c, *ps = map(int, input().split())\n for p in ps:\n graph[p].append(i + 1)\n indegree[i + 1] += 1\n\nq = deque([i for i in range(1, n + 1) if indegree[i] == 0])\n\nans = []\nwhile q:\n v = q.popleft()\n ans.append(v)\n for u in graph[v]:\n indegree[u] -= 1\n if indegree[u] == 0:\n q.append(u)\n\nprint(*ans)", "from collections import deque\n\nN = int(input())\n\nC = [list(map(int, input().split())) for _ in range(N)]\n\nG = [[] for _ in range(N + 1)]\n\nfor c, p in C:\n G[p].append(c)\n\nQ = deque([(0, 1)])\n\nans = []\n\nwhile Q:\n c, p = Q.popleft()\n if p == 1:\n ans.append(c)\n else:\n for q in G[p]:\n Q.append((q, p))\n\nprint(\" \".join(map(str, ans[::-1])))", "from collections import deque\n\nN = int(input())\n\nG = [[] for _ in range(N)]\nin_degree = [0] * N\n\nfor i in range(N):\n C, *P = map(int, input().split())\n for p in P:\n G[p - 1].append(i)\n in_degree[i] += 1\n\nQ = deque([i for i in range(N) if in_degree[i] == 0])\n\nans = []\nwhile Q:\n v = Q.popleft()\n ans.append(v + 1)\n for w in G[v]:\n in_degree[w] -= 1\n if in_degree[w] == 0:\n Q.append(w)\n\nprint(*ans)", "from collections import deque\n\nn = int(input())\n\ngraph = [[] for _ in range(n + 1)]\nindeg = [0] * (n + 1)\n\nfor i in range(n):\n c, *ps = map(int, input().split())\n for p in ps:\n graph[p].append(i + 1)\n indeg[i + 1] += 1\n\nq = deque([i for i in range(1, n + 1) if indeg[i] == 0])\n\nans = []\nwhile q:\n v = q.popleft()\n ans.append(v)\n for u in graph[v]:\n indeg[u] -= 1\n if indeg[u] == 0:\n q.append(u)\n\nprint(*ans[::-1])", "from collections import deque\n\nn = int(input())\n\ngraph = [[] for _ in range(n + 1)]\nindegree = [0] * (n + 1)\n\nfor i in range(n):\n c, *ps = map(int, input().split())\n for p in ps:\n graph[p].append(i + 1)\n indegree[i + 1] += 1\n\nq = deque([i for i in range(1, n + 1) if indegree[i] == 0])\n\nans = []\nwhile q:\n v = q.popleft()\n ans.append(v)\n for u in graph[v]:\n indegree[u] -= 1\n if indegree[u] == 0:\n q.append(u)\n\nprint(*ans[1:])", "from collections import deque\n\nN = int(input())\n\nG = [[] for _ in range(N)]\nindeg = [0] * N\nfor i in range(N):\n C, *P = map(int, input().split())\n for p in P:\n G[p - 1].append(i)\n indeg[i] += 1\n\nQ = deque([i for i in range(N) if indeg[i] == 0])\n\nans = []\nwhile Q:\n v = Q.popleft()\n ans.append(v + 1)\n for w in G[v]:\n indeg[w] -= 1\n if indeg[w] == 0:\n Q.append(w)\n\nprint(*ans)", "from collections import deque\n\nN = int(input())\nC = [list(map(int, input().split())) for _ in range(N)]\n\ngraph = [[] for _ in range(N + 1)]\nindeg = [0] * (N + 1)\n\nfor c, p in C:\n for pi in p:\n graph[pi].append(c + 1)\n indeg[c + 1] += 1\n\nq = deque([i for i in range(1, N + 1) if indeg[i] == 0])\n\nans = []\nwhile q:\n v = q.popleft()\n ans.append(v)\n for nv in graph[v]:\n indeg[nv] -= 1\n if indeg[nv] == 0:\n q.append(nv)\n\nprint(*ans[::-1])", "from collections import deque\n\nN = int(input())\n\nG = [[] for _ in range(N)]\nindeg = [0] * N\nfor i in range(N):\n C, *P = list(map(int, input().split()))\n for p in P:\n G[p - 1].append(i)\n indeg[i] += 1\n\nQ = deque([i for i in range(N) if indeg[i] == 0])\nans = []\nwhile Q:\n v = Q.popleft()\n ans.append(v + 1)\n for w in G[v]:\n indeg[w] -= 1\n if indeg[w] == 0:\n Q.append(w)\n\nprint(*ans)", "from collections import deque\r\n\r\nn = int(input())\r\ngraph = [[] for _ in range(n + 1)]\r\nindeg = [0] * (n + 1)\r\n\r\nfor i in range(n):\r\n c, *ps = map(int, input().split())\r\n for p in ps:\r\n graph[p].append(i + 1)\r\n indeg[i + 1] += 1\r\n\r\nq = deque([i for i in range(1, n + 1) if indeg[i] == 0])\r\nans = []\r\nwhile q:\r\n v = q.popleft()\r\n ans.append(v)\r\n for u in graph[v]:\r\n indeg[u] -= 1\r\n if indeg[u] == 0:\r\n q.append(u)\r\n\r\nprint(*ans)\r", "from collections import deque\n\nn = int(input())\n\ngraph = [[] for _ in range(n + 1)]\nindegree = [0] * (n + 1)\n\nfor i in range(n):\n c, *p = map(int, input().split())\n for j in p:\n graph[j].append(i + 1)\n indegree[i + 1] += 1\n\nq = deque([i for i in range(1, n + 1) if indegree[i] == 0])\n\nans = []\nwhile q:\n v = q.popleft()\n ans.append(v)\n for w in graph[v]:\n indegree[w] -= 1\n if indegree[w] == 0:\n q.append(w)\n\nprint(*ans[1:])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nXY = [list(map(int, input().split())) for i in range(N)]\n\nINF = 10**10\ndp = [[INF] * 2 for i in range(N)]\ndp[0][0] = 0\n\nfor i in range(N):\n x, y = XY[i]\n for j in range(i + 1):\n if j > 0:\n nx, ny = XY[j - 1]\n d = ((x - nx) ** 2 + (y - ny) ** 2) ** 0.5\n dp[i][0] = min(dp[i][0], dp[j - 1][1] + d)\n dp[i][1] = min(dp[i][1], dp[j][0])\n\nans = min(dp[N - 1])\n\nfor i in range(N - 2, -1, -1):\n ans += (dp[i][0] - dp[i][1]) ** 0.5\n ans = min(ans, dp[i][1] + (2 ** (N - 1 - i)))\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\nX = [0] * N\nY = [0] * N\n\nfor i in range(N):\n x, y = map(int, input().split())\n X[i] = x\n Y[i] = y\n\ndp = [[0] * N for _ in range(N)]\n\nfor i in range(N):\n dp[i][i] = 0\n\nfor i in range(N - 2, -1, -1):\n for j in range(i + 1, N):\n dp[i][j] = min(\n dp[i][j - 1] + (j - 1 - i) ** 0.5, dp[i + 1][j] + (j - i) ** 0.5\n )\n\nans = dp[0][N - 1]\n\nfor i in range(1, N):\n ans = min(ans, dp[0][i - 1] + dp[i][N - 1] + 2 ** (N - i - 1) ** 0.5)\n\nprint(ans)", "from math import sqrt\n\nn = int(input())\nxy = [list(map(int, input().split())) for _ in range(n)]\n\ninf = 10**9\n\n\ndef dist(i, j):\n return sqrt((xy[i][0] - xy[j][0]) ** 2 + (xy[i][1] - xy[j][1]) ** 2)\n\n\ndp = [[inf] * 2 for _ in range(n)]\ndp[0][0] = 0\nfor i in range(n):\n for j in range(n):\n if i != j:\n dp[i][0] = min(dp[i][0], dp[j][0] + dist(i, j))\n dp[i][1] = min(dp[i][1], dp[j][1] + dist(i, j))\n\nans = min(dp[n - 1]) + 2 ** (n - 1 - int(ans == dp[n - 1][1]))\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nXY = [list(map(int, input().split())) for i in range(N)]\n\nINF = 10**9\ndp = [[INF] * 2 for i in range(N)]\ndp[0][0] = 0\ndp[0][1] = 1\n\nfor i in range(1, N):\n for j in range(2):\n for k in range(i):\n d = (XY[i][0] - XY[k][0]) ** 2 + (XY[i][1] - XY[k][1]) ** 2\n if j == 0:\n dp[i][0] = min(dp[i][0], dp[k][0] + d)\n dp[i][1] = min(dp[i][1], dp[k][0] + d + 2 ** (i - k - 1))\n else:\n dp[i][1] = min(dp[i][1], dp[k][1] + d + 2 ** (i - k - 1))\n\nprint(min(dp[N - 1]))", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nXY = [list(map(int, input().split())) for i in range(N)]\n\nINF = 10**10\ndp = [[INF] * 2 for i in range(N)]\ndp[0][0] = 0\n\nfor i in range(N):\n x, y = XY[i]\n for j in range(i + 1, N):\n dx, dy = XY[j]\n d = ((dx - x) ** 2 + (dy - y) ** 2) ** 0.5\n for k in range(2):\n dp[j][k] = min(dp[j][k], dp[i][k] + d)\n if i + 1 < j:\n dp[j][k] = min(dp[j][k], dp[i][k ^ 1] + d + 2 ** (j - i - 2))\n\nprint(min(dp[N - 1]))", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\nX = []\nY = []\n\nfor i in range(N):\n x, y = map(int, input().split())\n X.append(x)\n Y.append(y)\n\ndp = [[float(\"inf\")] * (N + 1) for i in range(N + 1)]\n\ndp[0][0] = 0\n\nfor i in range(N):\n x1, y1 = X[i], Y[i]\n for j in range(i + 1, N):\n x2, y2 = X[j], Y[j]\n for k in range(i, j + 1):\n x3, y3 = X[k], Y[k]\n d = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 + ((x3 - x2) ** 2 + (y3 - y2) ** 2) ** 0.5\n dp[j][k] = min(dp[j][k], dp[i][k - 1] + d)\n\nans = float(\"inf\")\nfor i in range(N):\n ans = min(ans, dp[N - 1][i] + 2 ** (N - i - 2))\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\nX = [0] * N\nY = [0] * N\n\nfor i in range(N):\n x, y = map(int, input().split())\n X[i] = x\n Y[i] = y\n\nINF = 10**18\ndp = [[INF] * 3 for _ in range(N)]\n\ndp[0][0] = 0\ndp[0][1] = 2\ndp[0][2] = 0\n\nfor i in range(1, N):\n for j in range(3):\n if j == 0:\n for k in range(N):\n if k != i:\n dp[i][0] = min(dp[i][0], dp[k][1] + ((X[k] - X[i]) ** 2 + (Y[k] - Y[i]) ** 2) ** 0.5)\n dp[i][0] = min(dp[i][0], dp[k][2] + ((X[k] - X[i]) ** 2 + (Y[k] - Y[i]) ** 2) ** 0.5)\n elif j == 1:\n for k in range(N):\n if k != i:\n dp[i][1] = min(dp[i][1], dp[k][0] + ((X[k] - X[i]) ** 2 + (Y[k] - Y[i]) ** 2) ** 0.5)\n dp[i][1] = min(dp[i][1], dp[k][1] + ((X[k] - X[i]) ** 2 + (Y[k] - Y[i]) ** 2) ** 0.5)\n dp[i][1] = min(dp[i][1], dp[k][2] + ((X[k] - X[i]) ** 2 + (Y[k] - Y[i]) ** 2) ** 0.5)\n else:\n for k in range(N):\n if k != i:\n dp[i][2] = min(dp[i][2], dp[k][0] + ((X[k] - X[i]) ** 2 + (Y[k] - Y[i]) ** 2) ** 0.5)\n dp[i][2] = min(dp[i][2], dp[k][2] + ((X[k] - X[i]) ** 2 + (Y[k] - Y[i]) ** 2) ** 0.5)\n\nans = min(dp[N - 1][0], dp[N - 1][1] + 2, dp[N - 1][2] + 4)\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\nX = [0] * N\nY = [0] * N\n\nfor i in range(N):\n x, y = map(int, input().split())\n X[i] = x\n Y[i] = y\n\nINF = 10**10\ndp = [[INF] * 3 for _ in range(N)]\n\ndp[0][0] = 0\ndp[0][1] = 0\ndp[0][2] = 0\n\nfor i in range(1, N):\n for j in range(3):\n if j == 0:\n dp[i][j] = min(dp[i][j], dp[i - 1][j] + abs(X[i] - X[i - 1]) + abs(Y[i] - Y[i - 1]))\n dp[i][j] = min(dp[i][j], dp[i - 1][j + 1] + 2 ** (i - 1) + abs(X[i] - X[i - 1]) + abs(Y[i] - Y[i - 1]))\n elif j == 1:\n dp[i][j] = min(dp[i][j], dp[i - 1][j] + abs(X[i] - X[i - 1]) + abs(Y[i] - Y[i - 1]))\n dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + abs(X[i] - X[i - 1]) + abs(Y[i] - Y[i - 1]))\n dp[i][j] = min(dp[i][j], dp[i - 1][j + 1] + 2 ** (i - 1) + abs(X[i] - X[i - 1]) + abs(Y[i] - Y[i - 1]))\n else:\n dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + abs(X[i] - X[i - 1]) + abs(Y[i] - Y[i - 1]))\n dp[i][j] = min(dp[i][j], dp[i - 1][j] + abs(X[i] - X[i - 1]) + abs(Y[i] - Y[i - 1]))\n\nprint(min(dp[N - 1]))", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\nX = [0] * N\nY = [0] * N\n\nfor i in range(N):\n x, y = map(int, input().split())\n X[i] = x\n Y[i] = y\n\nINF = 10**10\n\ndp = [[0] * N for _ in range(N)]\n\nfor i in range(N):\n dp[i][i] = 0\n\nfor i in range(N - 1, -1, -1):\n for j in range(i + 1, N):\n dp[i][j] = min(dp[i][k] + dp[k][j] + abs(X[i] - X[j]) + abs(Y[i] - Y[j]) for k in range(i + 1, j))\n\nans = dp[0][N - 1]\n\nfor i in range(N - 1):\n ans = min(ans, dp[0][i] + dp[i + 1][N - 1] + 2 ** (N - i - 2))\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\nXY = [list(map(int, input().split())) for _ in range(N)]\n\nINF = 10**9\n\ndp = [[INF] * 2 for _ in range(N)]\n\ndp[0][0] = 0\ndp[0][1] = 0\n\nfor i in range(N):\n x, y = XY[i]\n for j in range(i + 1, N):\n dx, dy = XY[j]\n d = ((dx - x) ** 2 + (dy - y) ** 2) ** 0.5\n dp[j][0] = min(dp[j][0], dp[i][0] + d)\n dp[j][1] = min(dp[j][1], dp[i][1] + d)\n for k in range(2, N + 1):\n dp[j][1] = min(dp[j][1], dp[i][0] + d + 2 ** (k - 1))\n\nprint(min(dp[N - 1]))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m, p = map(int, input().split())\nans = 0\nfor i in range(m, n + 1, p):\n ans += 1\nprint(ans)", "n, m, p = map(int, input().split())\nans = 0\nfor i in range(m, n + 1, p):\n ans += 1\nprint(ans)", "n, m, p = map(int, input().split())\nans = 0\nfor i in range(m, n + 1, p):\n ans += 1\nprint(ans)", "n, m, p = map(int, input().split())\nans = 0\nfor i in range(m, n + 1, p):\n ans += 1\nprint(ans)", "n, m, p = map(int, input().split())\nans = 0\nfor i in range(m, n + 1, p):\n ans += 1\nprint(ans)", "n, m, p = map(int, input().split())\nans = 0\nfor i in range(m, n + 1, p):\n ans += 1\nprint(ans)", "n, m, p = map(int, input().split())\nans = 0\nfor i in range(m, n + 1, p):\n ans += 1\nprint(ans)", "n, m, p = map(int, input().split())\nans = 0\nfor i in range(m, n + 1, p):\n ans += 1\nprint(ans)", "n, m, p = map(int, input().split())\nans = 0\nfor i in range(m, n + 1, p):\n ans += 1\nprint(ans)", "n, m, p = map(int, input().split())\nans = 0\nfor i in range(m, n + 1, p):\n ans += 1\nprint(ans)" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\n\nx = [0] * 101\ny = [0] * 101\n\nfor i in range(n):\n a, b, c, d = map(int, input().split())\n x[a] += 1\n x[b] -= 1\n y[c] += 1\n y[d] -= 1\n\nans = 0\nfor i in range(101):\n for j in range(101):\n if x[i] + y[j] >= 2:\n ans += 1\n\nprint(ans)", "n = int(input())\r\n\r\nx = []\r\ny = []\r\n\r\nfor i in range(n):\r\n a, b, c, d = map(int, input().split())\r\n x.append([a, b])\r\n y.append([c, d])\r\n\r\nx.sort()\r\ny.sort()\r\n\r\narea = 0\r\n\r\nfor i in range(n):\r\n area += (x[i][1] - x[i][0]) * (y[i][1] - y[i][0])\r\n\r\nfor i in range(1, n):\r\n area -= max(0, min(x[i][1], x[i - 1][1]) - max(x[i][0], x[i - 1][0])) * (y[i][1] - y[i][0])\r\n area -= max(0, min(y[i][1], y[i - 1][1]) - max(y[i][0], y[i - 1][0])) * (x[i][1] - x[i][0])\r\n\r\nprint(area)\r", "n = int(input())\r\n\r\nx = [0] * 101\r\ny = [0] * 101\r\n\r\nfor i in range(n):\r\n a, b, c, d = map(int, input().split())\r\n for j in range(a, b + 1):\r\n x[j] += 1\r\n for j in range(c, d + 1):\r\n y[j] += 1\r\n\r\nans = 0\r\nfor i in range(101):\r\n ans += x[i] * y[i]\r\n\r\nprint(ans)\r", "n = int(input())\r\n\r\nx = [0] * 101\r\ny = [0] * 101\r\n\r\nfor i in range(n):\r\n a, b, c, d = map(int, input().split())\r\n for j in range(a, b + 1):\r\n x[j] += 1\r\n for j in range(c, d + 1):\r\n y[j] += 1\r\n\r\nans = 0\r\nfor i in range(101):\r\n ans += x[i] * y[i]\r\n\r\nprint(ans)\r", "n = int(input())\r\n\r\nx = [0] * 101\r\ny = [0] * 101\r\n\r\nfor i in range(n):\r\n a, b, c, d = map(int, input().split())\r\n for j in range(a, b):\r\n x[j] += 1\r\n for j in range(c, d):\r\n y[j] += 1\r\n\r\nans = 0\r\nfor i in range(101):\r\n ans += x[i] * y[i]\r\n\r\nprint(ans)\r", "n = int(input())\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n a, b, c, d = map(int, input().split())\r\n x.append([a, b])\r\n y.append([c, d])\r\n\r\nx.sort()\r\ny.sort()\r\n\r\narea = 0\r\nfor i in range(n):\r\n area += (x[i][1] - x[i][0]) * (y[i][1] - y[i][0])\r\n\r\nfor i in range(1, n):\r\n area -= max(0, min(x[i][1], x[i - 1][1]) - max(x[i][0], x[i - 1][0])) * (y[i][1] - y[i][0])\r\n area -= max(0, min(y[i][1], y[i - 1][1]) - max(y[i][0], y[i - 1][0])) * (x[i][1] - x[i][0])\r\n\r\nprint(area)\r", "n = int(input())\n\nx = []\ny = []\n\nfor i in range(n):\n a, b, c, d = map(int, input().split())\n x.append([a, b])\n y.append([c, d])\n\nx.sort()\ny.sort()\n\narea = 0\n\nfor i in range(n):\n area += (x[i][1] - x[i][0]) * (y[i][1] - y[i][0])\n\nfor i in range(1, n):\n area -= max(0, min(x[i][1], x[i - 1][1]) - max(x[i][0], x[i - 1][0])) * (y[i][1] - y[i][0])\n area -= max(0, min(y[i][1], y[i - 1][1]) - max(y[i][0], y[i - 1][0])) * (x[i][1] - x[i][0])\n\nprint(area)", "n = int(input())\n\nx = []\ny = []\nfor i in range(n):\n a, b, c, d = map(int, input().split())\n x.append([a, b])\n y.append([c, d])\n\nx = sorted(x, key=lambda x: (x[1], x[0]))\ny = sorted(y, key=lambda y: (y[1], y[0]))\n\narea = 0\nx_prev = -100\ny_prev = -100\nfor i in range(n):\n if x[i][0] > x_prev:\n area += (x[i][0] - x_prev) * (y[i][1] - y_prev)\n x_prev = x[i][1]\n y_prev = y[i][1]\n\nprint(area)", "n = int(input())\n\nx = []\ny = []\nfor i in range(n):\n a, b, c, d = map(int, input().split())\n x.append([a, b])\n y.append([c, d])\n\nx.sort()\ny.sort()\n\narea = 0\nfor i in range(n):\n area += (x[i][1] - x[i][0]) * (y[i][1] - y[i][0])\n\nfor i in range(1, n):\n area -= max(0, min(x[i][1], x[i - 1][1]) - max(x[i][0], x[i - 1][0])) * (y[i][1] - y[i][0])\n area -= max(0, min(y[i][1], y[i - 1][1]) - max(y[i][0], y[i - 1][0])) * (x[i][1] - x[i][0])\n\nprint(area)", "n = int(input())\r\n\r\nx = []\r\ny = []\r\n\r\nfor i in range(n):\r\n a, b, c, d = map(int, input().split())\r\n x.append([a, b])\r\n y.append([c, d])\r\n\r\nx.sort()\r\ny.sort()\r\n\r\narea = 0\r\n\r\nfor i in range(n):\r\n area += (x[i][1] - x[i][0]) * (y[i][1] - y[i][0])\r\n\r\nfor i in range(1, n):\r\n area -= max(0, min(x[i][1], x[i - 1][1]) - max(x[i][0], x[i - 1][0])) * (y[i][1] - y[i][0])\r\n area -= max(0, min(y[i][1], y[i - 1][1]) - max(y[i][0], y[i - 1][0])) * (x[i][1] - x[i][0])\r\n\r\nprint(area)\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, d, p = map(int, input().split())\nf = list(map(int, input().split()))\nf.sort()\n\nans = sum(f)\n\nfor i in range(n // d + 1):\n ans = min(ans, sum(f[i * d :]) + i * p)\n\nprint(ans)", "n, d, p = map(int, input().split())\nf = list(map(int, input().split()))\nf.sort()\n\nans = sum(f)\n\nfor i in range(n // d + 1):\n ans = min(ans, sum(f[i * d :]) + i * p)\n\nprint(ans)", "n, d, p, *f = map(int, open(0).read().split())\nf.sort()\ns = sum(f[: n % d])\nprint(s + (n // d) * p)", "n, d, p, *f = map(int, open(0).read().split())\nf.sort()\ns = sum(f[: n % d])\nprint(s + p * (n // d) * (n // d >= 1))", "n, d, p, *f = map(int, open(0).read().split())\nf.sort()\ns = sum(f[: n % d])\nprint(s + (n // d) * p)", "n, d, p, *f = map(int, open(0).read().split())\nf.sort()\ns = sum(f[: n % d])\nprint(s + (n // d) * p)", "n, d, p = map(int, input().split())\nf = list(map(int, input().split()))\nf.sort(reverse=True)\n\ntotal = sum(f)\n\nfor i in range(n // d + 1):\n total = min(total, sum(f[i * d :]) + i * p)\n\nprint(total)", "n, d, p = map(int, input().split())\nf = list(map(int, input().split()))\nf.sort()\ns = sum(f)\nans = s\nfor i in range(n // d + 1):\n ans = min(ans, s - i * d * p, n * p)\nprint(ans)", "n, d, p, *f = map(int, open(0).read().split())\nf.sort()\ns = sum(f[: n % d])\nprint(s + (n // d) * p)", "n, d, p = map(int, input().split())\nf = list(map(int, input().split()))\nf.sort()\nans = sum(f)\nfor i in range(n // d + 1):\n ans = min(ans, sum(f[i * d :]) + i * p)\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\nd = [list(map(int, input().split())) for _ in range(n - 1)]\n\ndp = [0] * (1 << n)\nfor i in range(n):\n for j in range(i + 1, n):\n dp[1 << i | 1 << j] = d[i][j - i - 1]\n\nfor i in range(1, 1 << n):\n for j in range(n):\n if dp[i] < dp[i ^ 1 << j] or dp[i] == 0:\n dp[i] = dp[i ^ 1 << j]\n\nprint(max(dp))", "n = int(input())\nd = [list(map(int, input().split())) for _ in range(n - 1)]\n\ndp = [0] * (1 << n)\nfor i in range(n):\n for j in range(i + 1, n):\n dp[1 << i | 1 << j] = d[i][j - i - 1]\n\nfor i in range(1, 1 << n):\n for j in range(n):\n if dp[i] < dp[i ^ 1 << j] or dp[i] < dp[i ^ (1 << j)]:\n dp[i] = max(dp[i], dp[i ^ 1 << j] + dp[i ^ (1 << j)])\n\nprint(dp[-1])", "n = int(input())\nd = []\nfor i in range(n):\n d.append(list(map(int, input().split())))\n\ndp = [[0] * (1 << n) for i in range(n)]\nfor i in range(n):\n dp[i][1 << i] = 0\n for j in range(i + 1, n):\n dp[i][1 << j] = d[i][j]\n\nfor i in range(n):\n for s in range(1 << n):\n if s >> i & 1:\n continue\n for j in range(i + 1, n):\n if s >> j & 1:\n continue\n dp[i][s | 1 << j] = max(dp[i][s | 1 << j], dp[i][s] + d[i][j])\n for k in range(j + 1, n):\n if s >> k & 1:\n continue\n dp[i][s | 1 << j | 1 << k] = max(\n dp[i][s | 1 << j | 1 << k], dp[i][s | 1 << j] + d[j][k] + dp[i][s]\n )\n\nprint(max(dp[0]))", "n = int(input())\nd = [list(map(int, input().split())) for _ in range(n - 1)]\n\ndp = [[0] * (1 << n) for _ in range(n)]\n\nfor i in range(n):\n dp[i][1 << i] = 0\n\nfor i in range(n):\n for j in range(i + 1, n):\n for k in range(n):\n dp[i][1 << k] = max(dp[i][1 << k], dp[i][1 << k] + d[i][j])\n dp[j][1 << k] = max(dp[j][1 << k], dp[j][1 << k] + d[i][j])\n\nprint(max(dp[0]))", "n = int(input())\nd = [list(map(int, input().split())) for _ in range(n - 1)]\n\ndp = [0] * (1 << n)\nfor i in range(n):\n dp[1 << i] = d[i][0]\n\nfor i in range(n - 2, -1, -1):\n for j in range(1 << n):\n if j >> i & 1:\n continue\n for k in range(n):\n if j >> k & 1:\n dp[j | 1 << i] = max(dp[j | 1 << i], dp[j] + d[i][k])\n\nprint(max(dp))", "n = int(input())\nd = []\nfor i in range(n):\n d.append(list(map(int, input().split())))\n\ndp = [[0] * (1 << n) for i in range(n)]\nfor i in range(n):\n dp[i][1 << i] = max(dp[i][1 << i], d[i][0])\n for j in range(i + 1, n):\n dp[i][1 << j] = max(dp[i][1 << j], d[i][j - i - 1])\n\nfor i in range(n):\n for j in range(1 << n):\n for k in range(n):\n if j & (1 << k) and k != i:\n dp[i][j] = max(dp[i][j], dp[i][j ^ (1 << k)] + d[i][k])\n\nprint(max(dp[0]))", "n = int(input())\nd = [list(map(int, input().split())) for _ in range(n - 1)]\n\ndp = [0] * (1 << n)\nfor i in range(n):\n for j in range(i + 1, n):\n dp[1 << i | 1 << j] = d[i][j - i - 1]\n\nfor i in range(1, 1 << n):\n for j in range(n):\n if dp[i] < dp[i ^ 1 << j] and dp[i ^ 1 << j] < dp[i | 1 << j]:\n dp[i | 1 << j] = max(dp[i | 1 << j], dp[i] + dp[i ^ 1 << j])\n\nprint(max(dp))", "n = int(input())\nd = []\nfor i in range(n):\n d.append(list(map(int, input().split())))\n\ndp = [[0] * (1 << n) for i in range(n)]\n\nfor i in range(n):\n dp[i][1 << i] = max(dp[i][1 << i], d[i][0])\n\nfor i in range(n):\n for j in range(i + 1, n):\n for k in range(1 << n):\n if k >> i & 1 and k >> j & 1:\n dp[i][k] = max(dp[i][k], dp[i][k ^ 1 << i] + d[i][j])\n dp[j][k] = max(dp[j][k], dp[j][k ^ 1 << j] + d[i][j])\n\nprint(max(dp[0]))", "n = int(input())\nd = [list(map(int, input().split())) for _ in range(n - 1)]\n\ndp = [0] * (1 << n)\nfor i in range(n):\n dp[1 << i] = d[i][0]\n\nfor i in range(n - 2, -1, -1):\n for j in range(1 << n):\n if j >> i & 1:\n for k in range(n):\n if j >> k & 1 and k != i:\n dp[j] = max(dp[j], dp[j ^ 1 << i] + d[i][k])\n\nprint(max(dp))", "n = int(input())\nd = [list(map(int, input().split())) for _ in range(n - 1)]\n\ndp = [0] * (1 << n)\nfor i in range(n):\n dp[1 << i] = d[i][0]\n\nfor i in range(n - 2, -1, -1):\n for j in range(1 << n):\n if j >> i & 1:\n for k in range(n):\n if j >> k & 1 and k != i:\n dp[j] = max(dp[j], dp[j ^ 1 << i] + d[i][k])\n\nprint(max(dp))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = list(map(int, input().split()))\n\ncount = 0\n\nfor i in range(n):\n for j in range(i + 1, n):\n if a[i] != a[j]:\n count += a[i:] .count(a[i])\n\nprint(count)", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n d[a[i]] = d.get(a[i], 0) + 1\n\nans = 0\nfor i in d:\n ans += d[i] * (d[i] - 1) * (n - d[i])\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n d[a[i]] = d.get(a[i], 0) + 1\n\nans = 0\nfor i in d:\n ans += d[i] * (d[i] - 1) * (n - d[i])\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n d[a[i]] = d.get(a[i], 0) + 1\n\nans = 0\nfor i in d:\n ans += d[i] * (d[i] - 1) * (n - d[i])\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n if a[i] in d:\n d[a[i]].append(i)\n else:\n d[a[i]] = [i]\n\nans = 0\nfor k in d:\n l = d[k]\n for i in range(len(l)):\n for j in range(i + 1, len(l)):\n if a[l[i]] != k:\n ans += 1\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n if a[i] in d:\n d[a[i]].append(i)\n else:\n d[a[i]] = [i]\n\nans = 0\nfor k in d:\n l = len(d[k])\n if l > 1:\n for i in range(l):\n for j in range(i + 1, l):\n ans += (j - i - 1) * (l - j)\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n if a[i] in d:\n d[a[i]].append(i)\n else:\n d[a[i]] = [i]\n\nans = 0\nfor k in d:\n l = d[k]\n for i in range(len(l)):\n for j in range(i + 1, len(l)):\n if a[l[i]] != k:\n ans += 1\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n if a[i] not in d:\n d[a[i]] = [0, 0]\n d[a[i]][1] += 1\n\nfor i in range(n):\n d[a[i]][0] += d[a[i]][1] - 1\n\nans = 0\nfor i in range(n):\n ans += d[a[i]][0]\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(n):\n if a[i] in d:\n d[a[i]].append(i)\n else:\n d[a[i]] = [i]\n\nans = 0\nfor k in d:\n if len(d[k]) < 2:\n continue\n for i in range(len(d[k]) - 1):\n for j in range(i + 1, len(d[k])):\n ans += (j - i - 1) * (n - j - 1)\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\n\nd = {}\nfor i, x in enumerate(a):\n d[x] = d.get(x, 0) + 1\n\nans = 0\nfor x in d:\n ans += d[x] * (d[x] - 1) * (n - d[x])\n\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\na = [0] * (n + 1)\r\nfor i in range(1, 10):\r\n if n % i == 0:\r\n for j in range(n + 1):\r\n if j % (n // i) == 0:\r\n a[j] = i\r\n break\r\nprint(\"\".join([str(i) if i != 0 else \"-\" for i in a]))\r", "n = int(input())\nl = []\nfor i in range(1, 10):\n if n % i == 0:\n l.append(i)\ns = \"-\" * (n + 1)\nfor i in range(n + 1):\n for j in l:\n if i % (n // j) == 0:\n s = s[:i] + str(j) + s[i + 1 :]\n break\nprint(s)", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\n\nans = \"\"\nfor i in range(n + 1):\n for j in range(1, 10):\n if j * (n // j) <= i < n:\n ans += str(j)\n break\n else:\n ans += \"-\"\nprint(ans)", "n = int(input())\na = []\nfor i in range(1, 10):\n if n % i == 0:\n a.append(i)\ns = \"-\" * (n + 1)\nfor i in range(n + 1):\n for j in a:\n if i % (n // j) == 0:\n s = s[:i] + str(j) + s[i + 1 :]\n break\nprint(s)", "def main():\n n = int(input())\n arr = [0] * (n + 1)\n for i in range(1, 10):\n if n % i == 0:\n for j in range(n // i, n + 1, n // i):\n if arr[j] == 0:\n arr[j] = i\n ans = \"\"\n for i in range(n + 1):\n if arr[i] != 0:\n ans += str(arr[i])\n else:\n ans += \"-\"\n print(ans)\n\n\nmain()", "n = int(input())\r\na = []\r\nfor i in range(1, 10):\r\n if n % i == 0:\r\n a.append(i)\r\ns = \"-\" * (n + 1)\r\nfor i in range(n + 1):\r\n for j in a:\r\n if i % (n // j) == 0:\r\n s = s[:i] + str(j) + s[i + 1 :]\r\nprint(s)\r", "n = int(input())\r\na = []\r\nfor i in range(1, 10):\r\n if n % i == 0:\r\n a.append(i)\r\ns = \"-\" * (n + 1)\r\nfor i in range(n + 1):\r\n for j in a:\r\n if i % (n // j) == 0:\r\n s = s[:i] + str(j) + s[i + 1 :]\r\n break\r\nprint(s)\r", "n = int(input())\r\na = []\r\nfor i in range(1, 10):\r\n if n % i == 0:\r\n a.append(i)\r\ns = \"-\"\r\nfor i in range(n + 1):\r\n for j in a:\r\n if i % (n // j) == 0:\r\n s = chr(ord(\"1\") + a.index(j))\r\n break\r\n print(s, end=\"\")", "n = int(input())\na = []\nfor i in range(1, 10):\n if n % i == 0:\n a.append(i)\ns = \"-\" * (n + 1)\nfor i in range(n + 1):\n for j in a:\n if i % (n // j) == 0:\n s = s[:i] + str(j) + s[i + 1 :]\n break\nprint(s)", "n = int(input())\r\na = []\r\nfor i in range(1, 10):\r\n if n % i == 0:\r\n a.append(i)\r\ns = \"-\" * (n + 1)\r\nfor i in range(n + 1):\r\n for j in a:\r\n if i % (n // j) == 0:\r\n s = s[:i] + str(j) + s[i + 1 :]\r\n break\r\nprint(s)\r" ], "pass1_list": [ false, true, false, true, false, false, true, false, true, true ], "metadata_list": [] }, { "code_list": [ "def main():\n c = [[int(i) for i in input().split()] for _ in range(3)]\n n = [0] * 10\n for i in range(3):\n for j in range(3):\n n[c[i][j]] += 1\n f = 1\n for i in range(10):\n if n[i] > 0:\n f *= factorial(n[i] + 7) / (factorial(n[i]) * factorial(7))\n p = 1\n for i in range(1, 9):\n p *= i\n print(f / p)\n\n\ndef factorial(n):\n f = 1\n for i in range(1, n + 1):\n f *= i\n return f\n\n\nmain()", "def main():\n c = [[int(x) for x in input().split()] for _ in range(3)]\n n = [0] * 10\n for i in range(3):\n for j in range(3):\n n[c[i][j]] += 1\n f = 1\n for i in range(10):\n if n[i] > 0:\n f *= fact[n[i]] // (fact[n[i] - 1] * n[i])\n print(f / fact[9])\n\n\nfact = [1]\nfor i in range(1, 10):\n fact.append(fact[-1] * i)\nmain()", "def main():\n c = [[int(i) for i in input().split()] for _ in range(3)]\n n = [0] * 10\n for i in range(3):\n for j in range(3):\n n[c[i][j]] += 1\n if 3 in n:\n print(0)\n return\n f = [1] * 9\n for i in range(3):\n for j in range(3):\n if j > 0 and c[i][j] == c[i][j - 1]:\n f[c[i][j]] -= 1\n if i > 0 and c[i][j] == c[i - 1][j]:\n f[c[i][j]] -= 1\n if i > 0 and j > 0 and c[i][j] == c[i - 1][j - 1]:\n f[c[i][j]] -= 1\n if i > 0 and j < 2 and c[i][j] == c[i - 1][j + 1]:\n f[c[i][j]] -= 1\n ans = 1\n for i in range(9):\n ans *= f[i] / (9 - i)\n print(ans)\n\n\nmain()", "", "def main():\n c = [[int(i) for i in input().split()] for _ in range(3)]\n f = [1] * 9\n for i in range(3):\n for j in range(3):\n for k in range(i + 1, 3):\n if c[i][j] == c[k][j]:\n f[c[i][j]] -= 1\n break\n for k in range(j + 1, 3):\n if c[i][j] == c[i][k]:\n f[c[i][j]] -= 1\n break\n if i == k and j == l:\n continue\n if i + j == k + l:\n if c[i][j] == c[k][l]:\n f[c[i][j]] -= 1\n if i - j == k - l:\n if c[i][j] == c[k][l]:\n f[c[i][j]] -= 1\n print(f[1] * f[2] * f[3] / (9 * 8 * 7))\n\n\nmain()", "def main():\n c = [[int(i) for i in input().split()] for _ in range(3)]\n d = {}\n for i in range(3):\n for j in range(3):\n d[c[i][j]] = d.get(c[i][j], 0) + 1\n if 3 in d.values():\n print(0)\n return\n a = []\n for i in range(3):\n for j in range(3):\n a.append(c[i][j])\n from itertools import permutations\n\n p = list(permutations(a))\n ok = 0\n for i in p:\n x = [[0] * 3 for _ in range(3)]\n for k in range(9):\n x[k // 3][k % 3] = i[k]\n for j in range(3):\n if x[j][0] == x[j][1] and x[j][0] != x[j][2]:\n break\n if x[0][j] == x[1][j] and x[0][j] != x[2][j]:\n break\n if x[0][0] == x[1][1] and x[0][0] == x[2][2] and (x[0][0] != x[2][0]):\n break\n if x[0][2] == x[1][1] and x[0][2] == x[2][0] and (x[0][2] != x[2][2]):\n break\n else:\n ok += 1\n print(ok / len(p))\n\n\nmain()", "def main():\n c = [[int(i) for i in input().split()] for _ in range(3)]\n d = [0] * 9\n for i in range(3):\n for j in range(3):\n d[c[i][j] - 1] = d[c[i][j] - 1] + 1\n if d[0] == 3 or d[4] == 3:\n print(0)\n return\n f = 1\n for i in range(9):\n f *= d[i] + 1\n f //= d[i] + 2\n print(1 / f)\n\n\nmain()", "def main():\n c = [[int(x) for x in input().split()] for _ in range(3)]\n n = [0] * 10\n for i in range(3):\n for j in range(3):\n n[c[i][j]] += 1\n f = 1\n for i in range(10):\n if n[i] > 0:\n f *= fact[n[i]] // (fact[n[i] - 1] * n[i])\n print(f / fact[9])\n\n\nfact = [1]\nfor i in range(1, 10):\n fact.append(fact[-1] * i)\nmain()", "def main():\n c = [[int(x) for x in input().split()] for _ in range(3)]\n n = [0] * 10\n for i in range(3):\n for j in range(3):\n n[c[i][j]] += 1\n f = [1] * 10\n for i in range(3):\n for j in range(3):\n if j > 0 and c[i][j] == c[i][j - 1]:\n f[c[i][j]] *= n[c[i][j]] - 1\n if i > 0 and c[i][j] == c[i - 1][j]:\n f[c[i][j]] *= n[c[i][j]] - 1\n if i > 0 and j > 0 and c[i][j] == c[i - 1][j - 1]:\n f[c[i][j]] *= n[c[i][j]] - 1\n if i < 2 and j < 2 and c[i][j] == c[i + 1][j + 1]:\n f[c[i][j]] *= n[c[i][j]] - 1\n print(f[c[0][0]] * f[c[0][1]] * f[c[0][2]] * f[c[1][0]] * f[c[1][1]] * f[c[1][2]] * f[c[2][0]] * f[c[2][1]] * f[c[2][2]] / 945)\n\n\nmain()", "def main():\n c = [[int(i) for i in input().split()] for _ in range(3)]\n n = [0] * 10\n for i in range(3):\n for j in range(3):\n n[c[i][j]] += 1\n f = 1\n for i in range(10):\n f *= factorial(n[i])\n print(factorial(9) / f)\n\n\ndef factorial(n):\n f = 1\n for i in range(1, n + 1):\n f *= i\n return f\n\n\nmain()" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nL = list(map(int, input().split()))\nL.sort(reverse=True)\ns = L[0]\nfor i in range(1, M):\n s += 1 + L[i]\nfor i in range(M, N):\n s = min(s, L[i] + 1 + L[i - M])\nprint(s)", "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nL = list(map(int, input().split()))\nL.sort(reverse=True)\ns = 0\nfor i in range(M):\n s += L[i]\nans = s\nfor i in range(M, N):\n s += L[i] - 1\n s -= L[i - M] - 1\n ans = min(ans, s)\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nL = list(map(int, input().split()))\nL.sort(reverse=True)\ns = 0\nfor i in range(M):\n s += L[i]\nfor i in range(M, N):\n s += 1\n s += L[i]\n if s > L[i - M]:\n s = L[i - M] + 1 + L[i]\nprint(s)", "import sys\n\ninput = sys.stdin.readline\n\n\ndef solve():\n (N, M) = map(int, input().split())\n L = list(map(int, input().split()))\n L.sort()\n L = L[::-1]\n l = 0\n r = L[0] * N + N - 1\n while r - l > 1:\n m = (l + r) // 2\n cnt = 0\n cur = 0\n for i in range(N):\n cur += L[i]\n if cur > m:\n cnt += 1\n cur = L[i]\n if cnt <= M:\n r = m\n else:\n l = m\n print(r)\n\n\nsolve()", "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nL = list(map(int, input().split()))\nL.sort(reverse=True)\ns = 0\nfor i in range(M):\n s += L[i]\nans = s\nfor i in range(M, N):\n s = s - L[i - M] + L[i] + 1\n ans = min(ans, s)\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nL = list(map(int, input().split()))\nL.sort(reverse=True)\ns = 0\nfor i in range(M):\n s += L[i]\nprint(s + N - M)", "import sys\n\ninput = sys.stdin.readline\n\n\ndef solve():\n n, m = map(int, input().split())\n l = list(map(int, input().split()))\n l.sort(reverse=True)\n l = [0] + l\n s = 0\n for i in range(m):\n s += l[i]\n for i in range(m, n):\n s += l[i] - l[i - m] + 1\n s = min(s, l[i : i - m : -1])\n return s\n\n\nprint(solve())", "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nL = list(map(int, input().split()))\nL.sort(reverse=True)\ns = 0\nfor i in range(M):\n s += L[i]\nprint(s + N - M)", "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nL = list(map(int, input().split()))\nL.sort(reverse=True)\ns = 0\nfor i in range(M):\n s += L[i]\nprint(s + N - M)", "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nL = list(map(int, input().split()))\nL.sort()\nL = L[::-1]\nans = 0\nfor i in range(M):\n ans += L[i]\nprint(ans + M)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n(N, X, Y) = map(int, input().split())\nP = [0] * (N - 1)\nT = [0] * (N - 1)\nfor i in range(N - 1):\n (P[i], T[i]) = map(int, input().split())\nQ = int(input())\nquery = [int(input()) for _ in range(Q)]\n\ndp = [[10**18] * 9 for _ in range(N)]\ndp[0][0] = X\nfor i in range(N - 1):\n for j in range(8):\n dp[i + 1][(j + P[i]) % 8] = min(dp[i + 1][(j + P[i]) % 8], dp[i][j] + T[i])\n\nfor q in query:\n ans = q + dp[N - 1][q % 8] + Y\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, X, Y = map(int, input().split())\n\nP = []\nT = []\nfor i in range(N - 1):\n p, t = map(int, input().split())\n P.append(p)\n T.append(t)\n\nQ = int(input())\nqs = [int(input()) for i in range(Q)]\n\nans = []\n\nfor q in qs:\n time = q + X\n for i in range(N - 1):\n if time % P[i] != 0:\n time += P[i] - time % P[i]\n time += T[i]\n ans.append(time + Y)\n\nprint(*ans, sep=\"\\n\")", "import sys\n\ninput = sys.stdin.readline\n(N, X, Y) = map(int, input().split())\nP = [0] * (N - 1)\nT = [0] * (N - 1)\nfor i in range(N - 1):\n (P[i], T[i]) = map(int, input().split())\nQ = int(input())\nqs = [int(input()) for _ in range(Q)]\nans = [None] * Q\nfor i, q in enumerate(qs):\n ans[i] = solve(q)\nprint(*ans, sep=\"\\n\")\n\n\ndef solve(q):\n q += X\n for i in range(N - 1):\n t = (q - 1) // P[i] * P[i] + 1\n q = t + T[i]\n return q + Y\n\n\ndef test():\n for q in qs:\n print(q, solve(q))\n\n\n# test()", "import sys\n\ninput = sys.stdin.readline\n(N, X, Y) = map(int, input().split())\nP = [0] * (N - 1)\nT = [0] * (N - 1)\nfor i in range(N - 1):\n (P[i], T[i]) = map(int, input().split())\nQ = int(input())\nq = [int(input()) for _ in range(Q)]\nans = [None] * Q\nfor i in range(Q):\n q[i] += X\ndp = [[float(\"inf\")] * 9 for _ in range(N)]\ndp[0][0] = X\nfor i in range(N - 1):\n for j in range(9):\n if dp[i][j] == float(\"inf\"):\n continue\n for k in range(P[i]):\n dp[i + 1][(j + k) % P[i]] = min(dp[i + 1][(j + k) % P[i]], dp[i][j] + T[i])\nfor i in range(Q):\n ans[i] = min(dp[N - 1]) + Y\n q[i] += 1\n for j in range(9):\n dp[N - 1][j] = float(\"inf\")\n if q[i] % P[N - 1] == j:\n dp[N - 1][j] = q[i] + T[N - 1]\nprint(*ans, sep=\"\\n\")", "from collections import deque\n\nN, X, Y = map(int, input().split())\n\nP = []\nT = []\n\nfor i in range(N - 1):\n p, t = map(int, input().split())\n P.append(p)\n T.append(t)\n\nQ = int(input())\nqs = [int(input()) for i in range(Q)]\n\nINF = 10**18\n\ndp = [[INF] * 9 for i in range(N + 1)]\ndp[0][0] = X\n\nfor i in range(N):\n for j in range(9):\n if dp[i][j] == INF:\n continue\n for k in range(9):\n if k == j:\n dp[i + 1][k] = min(dp[i + 1][k], dp[i][j] + T[i])\n else:\n dp[i + 1][k] = min(dp[i + 1][k], dp[i][j] + T[i] + (k - j) * P[i])\n\nfor q in qs:\n ans = q + dp[N][q % 9] + Y\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n(N, X, Y) = map(int, input().split())\nP = []\nT = []\nfor i in range(N - 1):\n (p, t) = map(int, input().split())\n P.append(p)\n T.append(t)\nQ = int(input())\nqs = [int(input()) for i in range(Q)]\n\nINF = 10**18\ndp = [[INF] * 9 for i in range(N)]\ndp[0][0] = X\nfor i in range(N - 1):\n for j in range(8):\n if dp[i][j] == INF:\n continue\n for k in range(8):\n if j == k:\n continue\n dp[i + 1][k] = min(dp[i + 1][k], dp[i][j] + T[i])\n if dp[i][j] // P[i] * P[i] + P[i] <= dp[i][j] + T[i]:\n dp[i + 1][k] = min(\n dp[i + 1][k], dp[i][j] // P[i] * P[i] + P[i] + T[i]\n )\n\nfor q in qs:\n ans = q + X\n for i in range(N):\n for j in range(8):\n if dp[i][j] <= q:\n ans = max(ans, dp[i][j] + (q - dp[i][j]) // P[i] * P[i] + Y)\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n(N, X, Y) = map(int, input().split())\nP = [0] * N\nT = [0] * N\nfor i in range(N - 1):\n (P[i], T[i]) = map(int, input().split())\nQ = int(input())\nquery = [int(input()) for i in range(Q)]\nfor q in query:\n ans = q + X + Y\n for i in range(N - 1):\n if (q + X) % P[i] == 0:\n ans = min(ans, q + X + T[i] + Y)\n ans = min(ans, (q + X + P[i] - (q + X) % P[i]) + T[i] + Y)\n print(ans)", "from collections import deque\n\nN, X, Y = map(int, input().split())\n\nP = []\nT = []\nfor i in range(N - 1):\n p, t = map(int, input().split())\n P.append(p)\n T.append(t)\n\nQ = int(input())\nqs = [int(input()) for i in range(Q)]\n\nans = []\n\nfor q in qs:\n time = q + X\n bus_time = [0] * (N - 1)\n for i in range(N - 1):\n bus_time[i] = (time - 1) // P[i] * P[i] + P[i] + T[i]\n time = bus_time[i]\n time += Y\n ans.append(time)\n\nprint(*ans, sep=\"\\n\")", "import sys\n\ninput = sys.stdin.readline\n\nN, X, Y = map(int, input().split())\n\nP = []\nT = []\nfor i in range(N - 1):\n p, t = map(int, input().split())\n P.append(p)\n T.append(t)\n\nQ = int(input())\nqs = [int(input()) for i in range(Q)]\n\nans = []\n\nfor q in qs:\n time = q + X\n for i in range(N - 1):\n time += (time // P[i] + 1) * T[i]\n ans.append(time + Y)\n\nprint(*ans, sep=\"\\n\")", "import sys\n\ninput = sys.stdin.readline\n(N, X, Y) = map(int, input().split())\nP = [0] * (N - 1)\nT = [0] * (N - 1)\nfor i in range(N - 1):\n (P[i], T[i]) = map(int, input().split())\nQ = int(input())\nq = [int(input()) for _ in range(Q)]\nans = [None] * Q\nfor i in range(Q):\n q[i] += X\ndp = [None] * N\ndp[0] = [0] * 8\nfor i in range(N - 1):\n for j in range(8):\n if dp[i][j] is not None:\n dp[i + 1][(j + P[i]) % 8] = min(\n dp[i + 1][(j + P[i]) % 8], dp[i][j] + T[i] + (j + P[i]) // P[i] * P[i]\n )\nfor i in range(Q):\n ans[i] = dp[-1][q[i] % 8] + q[i] + Y\nprint(*ans, sep=\"\\n\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "a, b = map(int, input().split())\nprint(pow(a, b) + pow(b, a))", "a, b = map(int, input().split())\nprint(pow(a, b) + pow(b, a))", "a, b = map(int, input().split())\nprint(pow(a, b) + pow(b, a))", "a, b = map(int, input().split())\nprint(pow(a, b) + pow(b, a))", "a, b = map(int, input().split())\nprint(pow(a, b) + pow(b, a))", "a, b = map(int, input().split())\nprint(pow(a, b) + pow(b, a))", "a, b = map(int, input().split())\nprint(pow(a, b) + pow(b, a))", "a, b = map(int, input().split())\nprint(pow(a, b) + pow(b, a))", "a, b = map(int, input().split())\nprint(pow(a, b) + pow(b, a))", "a, b = map(int, input().split())\nprint(pow(a, b) + pow(b, a))" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "s = input()\nn = len(s)\ndp = [[False] * n for _ in range(n)]\nmax_len = 1\nfor i in range(n):\n dp[i][i] = True\nfor i in range(n - 1):\n if s[i] == s[i + 1]:\n dp[i][i + 1] = True\n max_len = 2\nfor k in range(3, n + 1):\n for i in range(n - k + 1):\n j = i + k - 1\n if s[i] == s[j] and dp[i + 1][j - 1]:\n dp[i][j] = True\n max_len = k\nprint(max_len)", "s = input()\nn = len(s)\ndp = [[False] * n for _ in range(n)]\nmax_len = 1\nfor i in range(n):\n dp[i][i] = True\nfor i in range(n - 1):\n if s[i] == s[i + 1]:\n dp[i][i + 1] = True\n max_len = 2\nfor k in range(3, n + 1):\n for i in range(n - k + 1):\n j = i + k - 1\n if s[i] == s[j] and dp[i + 1][j - 1]:\n dp[i][j] = True\n max_len = k\nprint(max_len)", "s = input()\nn = len(s)\ndp = [[0] * n for _ in range(n)]\nmax_len = 1\nfor i in range(n):\n dp[i][i] = 1\nfor i in range(n - 1):\n if s[i] == s[i + 1]:\n dp[i][i + 1] = 1\n max_len = 2\nfor k in range(3, n + 1):\n for i in range(n - k + 1):\n j = i + k - 1\n if s[i] == s[j] and dp[i + 1][j - 1] == 1:\n dp[i][j] = 1\n max_len = k\nprint(max_len)", "s = input()\nn = len(s)\ndp = [[0] * n for _ in range(n)]\nmax_len = 1\nfor i in range(n - 1, -1, -1):\n dp[i][i] = 1\n for j in range(i + 1, n):\n if s[i] == s[j]:\n if j - i == 1 or dp[i + 1][j - 1]:\n dp[i][j] = 1\n max_len = max(max_len, j - i + 1)\nprint(max_len)", "s = input()\nn = len(s)\ndp = [[False] * n for _ in range(n)]\nmax_len = 1\nfor i in range(n):\n dp[i][i] = True\nfor i in range(n - 1):\n if s[i] == s[i + 1]:\n dp[i][i + 1] = True\n max_len = 2\nfor k in range(3, n + 1):\n for i in range(n - k + 1):\n j = i + k - 1\n if s[i] == s[j] and dp[i + 1][j - 1]:\n dp[i][j] = True\n max_len = k\nprint(max_len)", "s = input()\nn = len(s)\ndp = [[0] * n for _ in range(n)]\nmax_len = 1\nfor i in range(n - 1, -1, -1):\n dp[i][i] = 1\n for j in range(i + 1, n):\n if s[i] == s[j]:\n if j - i == 1 or dp[i + 1][j - 1]:\n dp[i][j] = 1\n max_len = max(max_len, j - i + 1)\nprint(max_len)", "s = input()\nn = len(s)\ndp = [[False] * n for _ in range(n)]\nmax_len = 1\nfor i in range(n):\n dp[i][i] = True\nfor i in range(n - 1):\n if s[i] == s[i + 1]:\n dp[i][i + 1] = True\n max_len = 2\nfor k in range(3, n + 1):\n for i in range(n - k + 1):\n j = i + k - 1\n if s[i] == s[j] and dp[i + 1][j - 1]:\n dp[i][j] = True\n max_len = k\nprint(max_len)", "s = input()\nn = len(s)\ndp = [[False] * n for _ in range(n)]\nmax_len = 1\nfor i in range(n):\n dp[i][i] = True\nfor i in range(n - 1):\n if s[i] == s[i + 1]:\n dp[i][i + 1] = True\n max_len = 2\nfor k in range(3, n + 1):\n for i in range(n - k + 1):\n j = i + k - 1\n if s[i] == s[j] and dp[i + 1][j - 1]:\n dp[i][j] = True\n max_len = k\nprint(max_len)", "s = input()\nn = len(s)\ndp = [[0] * n for _ in range(n)]\nmax_len = 1\nfor i in range(n - 1, -1, -1):\n dp[i][i] = 1\n for j in range(i + 1, n):\n if s[i] == s[j]:\n if j - i == 1 or dp[i + 1][j - 1]:\n dp[i][j] = 1\n max_len = max(max_len, j - i + 1)\nprint(max_len)", "s = input()\nn = len(s)\ndp = [[False] * n for _ in range(n)]\nmax_len = 1\nfor i in range(n):\n dp[i][i] = True\nfor i in range(n - 1):\n if s[i] == s[i + 1]:\n dp[i][i + 1] = True\n max_len = 2\nfor k in range(3, n + 1):\n for i in range(n - k + 1):\n j = i + k - 1\n if s[i] == s[j] and dp[i + 1][j - 1]:\n dp[i][j] = True\n max_len = k\nprint(max_len)" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "M = int(input())\nS = [input() for _ in range(3)]\n\nfor i in range(M):\n if len(set(S[j][i] for j in range(3))) == 1:\n print(i)\n break\nelse:\n print(-1)", "M = int(input())\nS = [input() for _ in range(3)]\n\nfor i in range(M):\n if S[0][i] == S[1][0] == S[2][i]:\n print(i)\n break\nelse:\n print(-1)", "m = int(input())\r\ns = [input() for _ in range(3)]\r\n\r\nfor i in range(m):\r\n for j in range(m):\r\n k = (i + j) % m\r\n if s[0][i] == s[1][j] == s[2][k]:\r\n print(max(i, j, k) + 1)\r\n break\r\n else:\r\n continue\r\n break\r\nelse:\r\n print(-1)", "M = int(input())\nS = [input() for _ in range(3)]\n\nfor i in range(M):\n if S[0][i] == S[1][0] == S[2][i]:\n print(i + 1)\n break\nelse:\n print(-1)", "M = int(input())\nS = [input() for _ in range(3)]\n\nfor i in range(M):\n if S[0][i] == S[1][0] == S[2][i]:\n print(i + 1)\n break\nelse:\n print(-1)", "M = int(input())\nS = [input() for _ in range(3)]\n\nfor i in range(M):\n if S[0][i] == S[1][0] == S[2][i]:\n print(i)\n break\nelse:\n print(-1)", "M = int(input())\r\nS = [input() for _ in range(3)]\r\n\r\nfor i in range(M):\r\n if S[0][i] == S[1][0] == S[2][i]:\r\n print(i)\r\n break\r\nelse:\r\n print(-1)\r", "M = int(input())\nS = [input() for _ in range(3)]\n\nfor i in range(M):\n if S[0][i] == S[1][0] == S[2][i]:\n print(i + 1)\n break\nelse:\n print(-1)", "m = int(input())\r\ns = [input() for _ in range(3)]\r\n\r\nfor i in range(m):\r\n if s[0][i] == s[1][0] == s[2][i]:\r\n print(i + 1)\r\n break\r\nelse:\r\n print(-1)\r", "M = int(input())\nS = [input() for _ in range(3)]\n\nfor i in range(M):\n if S[0][i] == S[1][0] == S[2][i]:\n print(i)\n break\nelse:\n print(-1)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nn, m = list(map(int, input().split()))\n\ngraph = [[] for _ in range(n + 1)]\n\nfor _ in range(m):\n a, b, x, y = list(map(int, input().split()))\n graph[a].append((b, x, y))\n graph[b].append((a, -x, -y))\n\n\ndef dfs(v, prev, x, y):\n if len(graph[v]) == 1 and v != 1:\n print(\"undecidable\")\n return\n\n x += graph[v][0][1]\n y += graph[v][0][2]\n\n for to, dx, dy in graph[v]:\n if to == prev:\n continue\n dfs(to, v, x - dx, y - dy)\n\n print(x, y)\n\n\ndfs(1, -1, 0, 0)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\n\ngraph = [[] for i in range(N + 1)]\n\nfor i in range(M):\n A, B, X, Y = map(int, input().split())\n graph[A].append((B, X, Y))\n graph[B].append((A, -X, -Y))\n\n\ndef solve(node, parent):\n x, y = 0, 0\n for b, dx, dy in graph[node]:\n if b == parent:\n continue\n nx, ny = solve(b, node)\n if nx is None:\n return None\n x += dx + nx\n y += dy + ny\n return x, y\n\n\nfor i in range(1, N + 1):\n x, y = solve(i, 0)\n if x is None:\n print(\"undecidable\")\n else:\n print(x, y)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\nG = [[] for i in range(N + 1)]\n\nfor i in range(M):\n A, B, X, Y = list(map(int, input().split()))\n G[A].append((B, X, Y))\n G[B].append((A, -X, -Y))\n\nANS = [None] * (N + 1)\nANS[1] = (0, 0)\n\nfor i in range(1, N + 1):\n if ANS[i] is not None:\n continue\n for j, (to, x, y) in enumerate(G[i]):\n if ANS[to] is not None:\n if G[to][G[to].index((i, -x, -y))] != (i, -x, -y):\n print(\"undecidable\")\n ANS[i] = \"done\"\n break\n if ANS[i] is not None:\n continue\n x, y = 0, 0\n for to, x_, y_ in G[i]:\n if ANS[to] is None:\n continue\n nx, ny = ANS[to]\n if x_ == 0 and y_ == 0:\n continue\n x += nx * x_ + ny * y_\n y += ny * x_ - nx * y_\n ANS[i] = (x, y)\n\nfor i in range(1, N + 1):\n if ANS[i] == \"done\":\n continue\n if ANS[i] is None:\n print(\"undecidable\")\n else:\n print(*ANS[i])", "from collections import defaultdict\n\nn, m = map(int, input().split())\n\ngraph = defaultdict(list)\nfor _ in range(m):\n a, b, x, y = map(int, input().split())\n graph[a].append((b, x, y))\n graph[b].append((a, -x, -y))\n\ncoords = {1: (0, 0)}\nfor i in range(1, n + 1):\n if i not in coords:\n print(\"undecidable\")\n continue\n x, y = coords[i]\n for j, dx, dy in graph[i]:\n if j not in coords:\n coords[j] = (x + dx, y + dy)\n\nfor i in range(1, n + 1):\n print(*coords[i])", "from collections import defaultdict\n\nn, m = map(int, input().split())\n\nG = defaultdict(dict)\n\nfor i in range(m):\n a, b, x, y = map(int, input().split())\n G[a][b] = (x, y)\n G[b][a] = (-x, -y)\n\nvisited = [0] * (n + 1)\n\nfor i in range(1, n + 1):\n if not visited[i]:\n q = [(i, 0, 0)]\n visited[i] = 1\n while q:\n a, x, y = q.pop(0)\n for b, (dx, dy) in G[a].items():\n if not visited[b]:\n visited[b] = 1\n q.append((b, x + dx, y + dy))\n\nfor i in range(1, n + 1):\n if visited[i]:\n print(x, y)\n else:\n print(\"undecidable\")", "from collections import defaultdict\n\nn, m = map(int, input().split())\n\ng = defaultdict(list)\nfor _ in range(m):\n a, b, x, y = map(int, input().split())\n g[a].append((b, x, y))\n g[b].append((a, -x, -y))\n\nans = [None] * (n + 1)\nans[1] = (0, 0)\n\nfor i in range(1, n + 1):\n if ans[i] is not None:\n for j, x, y in g[i]:\n if ans[j] is None:\n ans[j] = (ans[i][0] + x, ans[i][1] + y)\n\nfor i in range(1, n + 1):\n if ans[i] is None:\n print(\"undecidable\")\n else:\n print(ans[i][0], ans[i][1])", "from collections import defaultdict\n\nn, m = map(int, input().split())\n\ngraph = defaultdict(list)\n\nfor _ in range(m):\n a, b, x, y = map(int, input().split())\n graph[a].append((b, x, y))\n graph[b].append((a, -x, -y))\n\ncoords = {}\n\nfor i in range(1, n + 1):\n if i not in graph:\n coords[i] = (0, 0)\n continue\n\n x, y = 0, 0\n\n for j, dx, dy in graph[i]:\n if j not in coords:\n continue\n px, py = coords[j]\n x += px + dx\n y += py + dy\n\n if len(graph[i]) == 1:\n x, y = x / len(graph[i]), y / len(graph[i])\n\n coords[i] = (x, y)\n\nfor i in range(1, n + 1):\n if i not in coords:\n print(\"undecidable\")\n else:\n print(f\"{coords[i][0]} {coords[i][1]}\")", "import sys\nfrom collections import defaultdict\n\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\n\nG = defaultdict(dict)\n\nfor _ in range(M):\n A, B, X, Y = map(int, input().split())\n G[A][B] = (X, Y)\n G[B][A] = (-X, -Y)\n\nfor i in range(1, N + 1):\n if not G[i]:\n print(0, 0)\n continue\n\n if len(G[i]) == 1:\n A, (X, Y) = next(iter(G[i].items()))\n print(X, Y)\n continue\n\n for A, (X, Y) in G[i].items():\n for B, (x, y) in G[i].items():\n if A == B:\n continue\n if X != -x or Y != -y:\n print(\"undecidable\")\n break\n else:\n print(X, Y)\n break\n else:\n print(\"undecidable\")", "from collections import defaultdict\n\nn, m = map(int, input().split())\n\nG = defaultdict(list)\n\nfor _ in range(m):\n a, b, x, y = map(int, input().split())\n G[a].append((b, x, y))\n G[b].append((a, -x, -y))\n\nseen = set()\n\nfor i in range(1, n + 1):\n if i not in seen:\n q = [(i, 0, 0)]\n seen.add(i)\n while q:\n a, x, y = q.pop()\n for b, dx, dy in G[a]:\n if b not in seen:\n seen.add(b)\n q.append((b, x + dx, y + dy))\n\nfor i in range(1, n + 1):\n if i in seen:\n print(f\"{x} {y}\" if (x, y) := (seen[i]) else \"undecidable\")\n else:\n print(\"undecidable\")", "import sys\nfrom collections import defaultdict\n\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\n\nG = defaultdict(dict)\n\nfor i in range(M):\n A, B, X, Y = map(int, input().split())\n G[A][B] = (X, Y)\n G[B][A] = (-X, -Y)\n\nfor i in range(1, N + 1):\n if not G[i]:\n print(0, 0)\n continue\n if len(G[i]) > 2:\n print(\"undecidable\")\n continue\n if not G[i]:\n print(0, 0)\n continue\n j = next(iter(G[i]))\n x, y = G[i][j]\n if j == 1:\n print(x, y)\n else:\n print(-x, -y)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\n\nevents = []\nfor _ in range(M):\n T, W, S = map(int, input().split())\n events.append((T, W, S))\n\nevents.sort(key=lambda x: x[0])\n\nlast_time = 0\nnoodle_count = [0] * N\ncurrent_index = 0\n\nfor T, W, S in events:\n while current_index < N and last_time + S <= T:\n noodle_count[current_index] += W\n last_time += S\n current_index += 1\n if current_index < N:\n noodle_count[current_index] += W\n last_time = T + S\n\nfor i in range(N):\n print(noodle_count[i])", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\nevents = []\nfor _ in range(M):\n T, W, S = list(map(int, input().split()))\n events.append((T, W, S))\n\nevents.sort(key=lambda x: x[0])\n\npeople = [0] * N\ncur = 0\nfor T, W, S in events:\n if cur < N:\n people[cur] += W\n cur = min(cur + 1, N)\n\nfor i in range(N):\n print(people[i])", "import sys\n\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\n\nevents = []\nfor _ in range(M):\n T, W, S = map(int, input().split())\n events.append((T, W, S))\n\nevents.sort()\n\npeople = [0] * N\n\nidx = 0\nfor T, W, S in events:\n while idx < N and T >= S:\n people[idx] += W\n idx += 1\n\nfor i in range(N):\n print(people[i])", "from collections import deque\n\n(n, m) = map(int, input().split())\nevents = [list(map(int, input().split())) for _ in range(m)]\nevents.sort()\n\npeople = deque(range(n))\nnoodle_counts = [0] * n\n\nfor t, w, s in events:\n if people:\n person = people.popleft()\n noodle_counts[person] += w\n else:\n continue\n\n wait_time = t + s\n while people and people[0] <= person:\n people.appendleft(people.popleft())\n\n timer = deque([wait_time])\n while timer:\n wait_time = timer.popleft()\n if people and people[0] == person:\n people.popleft()\n break\n else:\n timer.append(wait_time + s)\n\nfor count in noodle_counts:\n print(count)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\nevents = []\nfor _ in range(M):\n T, W, S = list(map(int, input().split()))\n events.append((T, W, S))\n\nevents.sort(key=lambda x: x[0])\n\nlast_time = 0\nnoodle_cnt = [0] * N\n\nfor T, W, S in events:\n while last_time < T:\n noodle_cnt[last_time % N] = max(noodle_cnt[last_time % N] - T + last_time, 0)\n last_time += 1\n noodle_cnt[last_time % N] += W\n last_time += S\n\nfor i in range(N):\n print(noodle_cnt[i])", "import sys\n\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\n\nevents = []\nfor _ in range(M):\n T, W, S = map(int, input().split())\n events.append((T, W, S))\n\nevents.sort(key=lambda x: x[0])\n\nlast_time = 0\nnoodle_count = [0] * N\ncur_idx = 0\nfor T, W, S in events:\n while cur_idx < N and last_time + S <= T:\n noodle_count[cur_idx] += W\n cur_idx += 1\n last_time = T\n\nfor n in noodle_count:\n print(n)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\nevents = []\nfor _ in range(M):\n T, W, S = list(map(int, input().split()))\n events.append((T, W, S))\n\nevents.sort()\n\npeople = [0] * N\n\nidx = 0\nfor T, W, S in events:\n while idx < N and T >= S:\n people[idx] += W\n idx += 1\n if idx == 0:\n continue\n people[idx - 1] += W\n\nfor i in range(N):\n print(people[i])", "from collections import deque\n\n(n, m) = map(int, input().split())\nevents = [list(map(int, input().split())) for _ in range(m)]\nevents.sort(key=lambda x: x[0])\n\npeople = deque(range(n))\nnoodle_counts = [0] * n\n\nfor t, w, s in events:\n if people:\n person = people.popleft()\n noodle_counts[person] += w\n else:\n continue\n\n return_time = t + s\n while people and people[0] < person:\n people.popleft()\n\n people.appendleft(person)\n idx = people.index(person)\n for i in range(idx, len(people)):\n people[i] += 1\n\n if return_time < len(events):\n idx = bisect.bisect_left(events, [return_time])\n events[idx][0] = return_time\n\nfor count in noodle_counts:\n print(count)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\nevents = []\nfor _ in range(M):\n T, W, S = list(map(int, input().split()))\n events.append((T, W, S))\n\nevents.append((10**18, 0, 0))\nevents.sort()\n\nans = [0] * N\n\ntime = 0\nidx = 0\nfor T, W, S in events:\n while idx < N and time <= T:\n ans[idx] += W\n idx += 1\n time += S\n\nfor a in ans:\n print(a)", "from collections import deque\n\n(n, m) = map(int, input().split())\nevents = []\nfor _ in range(m):\n t, w, s = map(int, input().split())\n events.append((t, w, s))\n\npeople = [0] * n\nqueue = deque([(0, 0)])\nfor t, w, s in sorted(events):\n while queue and queue[0][0] <= t:\n time, person = queue.popleft()\n people[person] += w\n queue.append((t + s, (t + s) % n))\n\nfor i in range(n):\n print(people[i])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = input()\n\nis_321 = True\nfor i in range(len(n) - 1):\n if n[i] <= n[i + 1]:\n is_321 = False\n break\n\nif is_321:\n print(\"Yes\")\nelse:\n print(\"No\")", "n = input()\n\nif len(n) == 1:\n print(\"Yes\")\nelse:\n prev = int(n[0])\n for i in range(1, len(n)):\n if int(n[i]) >= prev:\n print(\"No\")\n break\n prev = int(n[i])\n else:\n print(\"Yes\")", "n = input()\nn = list(n)\nfor i in range(len(n) - 1):\n if n[i] <= n[i + 1]:\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "n = input()\n\nif len(n) == 1:\n print(\"Yes\")\nelse:\n prev = int(n[0])\n for i in range(1, len(n)):\n cur = int(n[i])\n if cur >= prev:\n print(\"No\")\n break\n prev = cur\n else:\n print(\"Yes\")", "n = input()\n\nif len(n) == 1:\n print(\"Yes\")\nelse:\n prev = int(n[0])\n for i in range(1, len(n)):\n cur = int(n[i])\n if cur >= prev:\n print(\"No\")\n break\n prev = cur\n else:\n print(\"Yes\")", "n = input()\n\nif len(n) == 1:\n print(\"Yes\")\nelse:\n prev = int(n[0])\n for i in range(1, len(n)):\n cur = int(n[i])\n if cur >= prev:\n print(\"No\")\n break\n prev = cur\n else:\n print(\"Yes\")", "n = input()\na = list(n)\nfor i in range(len(a) - 1):\n if a[i] <= a[i + 1]:\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "n = input()\n\nflag = True\nfor i in range(len(n) - 1):\n if n[i] <= n[i + 1]:\n flag = False\n break\n\nif flag:\n print(\"Yes\")\nelse:\n print(\"No\")", "n = input()\n\nif len(n) == 1:\n print(\"Yes\")\nelse:\n prev = int(n[0])\n for i in range(1, len(n)):\n cur = int(n[i])\n if cur >= prev:\n print(\"No\")\n break\n prev = cur\n else:\n print(\"Yes\")", "n = input()\nn = list(n)\nn = [int(i) for i in n]\nif len(n) == 1:\n print(\"Yes\")\nelse:\n for i in range(len(n) - 1):\n if n[i] <= n[i + 1]:\n print(\"No\")\n break\n else:\n print(\"Yes\")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n, x = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nif a[1] + sum(a[2:-1]) >= x:\n print(0)\nelse:\n for i in range(101):\n if a[1] + sum(a[2:-1]) + i >= x:\n print(i)\n break\n else:\n print(-1)", "n, x = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nif a[1] + sum(a[2:-1]) >= x:\n print(0)\nelse:\n for i in range(101):\n if a[1] + sum(a[2:-1]) + i >= x:\n print(i)\n break\n else:\n print(-1)", "n, x = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nif a[-2] + a[1] >= x:\n print(0)\nelse:\n for i in range(101):\n if a[-2] + a[1] + i >= x:\n print(i)\n break\n else:\n print(-1)", "n, x = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nif a[1] + (n - 3) * 100 >= x:\n print(0)\nelif a[n - 2] + (n - 3) * 0 < x:\n print(-1)\nelse:\n print((x - sum(a[1:-1])) + 1)", "n, x = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nif a[1] + sum(a[2:-1]) >= x:\n print(0)\nelse:\n for i in range(101):\n if a[1] + sum(a[2:-1]) + i >= x:\n print(i)\n break\n else:\n print(-1)", "n, x = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\na = a[1:-1]\ny = x - sum(a)\nif y < 0:\n print(-1)\nelse:\n print(y)", "n, x = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nif a[1] + sum(a[2:-1]) >= x:\n print(0)\nelse:\n for i in range(101):\n if a[1] + sum(a[2:-1]) + i >= x:\n print(i)\n break\n else:\n print(-1)", "n, x = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nif a[1] + sum(a[2:-1]) >= x:\n print(0)\nelse:\n for i in range(101):\n if a[1] + sum(a[2:-1]) + i >= x:\n print(i)\n break\n else:\n print(-1)", "n, x = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nif a[1] + (n - 3) * 100 >= x:\n print(0)\nelif a[n - 2] + (n - 3) * 0 < x:\n print(-1)\nelse:\n print((x - sum(a[1:-1])) + 1)", "n, x = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nif a[1] + (n - 3) * a[-1] < x:\n print(-1)\nelse:\n print(max(0, (x - sum(a[1:-1])) + a[1]))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "def main():\n k = int(input())\n i = 1\n while True:\n for j in range(10, 0, -1):\n for l in range(9, j - 1, -1):\n for m in range(l - 1, 0, -1):\n for n in range(m - 1, 0, -1):\n for o in range(n - 1, 0, -1):\n for p in range(o - 1, -1, -1):\n s = str(j) + str(l) + str(m) + str(n) + str(o) + str(p)\n i += 1\n if i == k:\n print(s)\n return\n\n\nmain()", "K = int(input())\ncnt = 0\nn = 1\nwhile True:\n for i in range(10, 0, -1):\n for j in range(9, i - 1, -1):\n for k in range(9, j - 1, -1):\n for l in range(9, k - 1, -1):\n for m in range(9, l - 1, -1):\n for o in range(9, m - 1, -1):\n cnt += 1\n if cnt == K:\n print(i * 10**5 + j * 10**4 + k * 10**3 + l * 10**2 + m * 10 + o)\n exit()", "def main():\n k = int(input())\n i = 1\n while True:\n for d in range(1, 10):\n for c in range(9, d - 1, -1):\n for b in range(c - 1, d - 1, -1):\n for a in range(b - 1, d - 1, -1):\n s = str(a * 10 ** (3 - d) + b * 10 ** (2 - d) + c * 10 ** (1 - d) + d)\n if i == k:\n print(s)\n return\n i += 1\n\n\nmain()", "K = int(input())\ncnt = 0\nn = 1\nwhile cnt < K:\n n += 1\n for i in range(1, 10):\n for j in range(0, 10):\n for k in range(0, 10):\n for l in range(0, 10):\n for m in range(0, 10):\n for o in range(0, 10):\n cnt += 1\n if cnt == K:\n print(i * 100000 + j * 10000 + k * 1000 + l * 100 + m * 10 + o)\n exit()", "def main():\n k = int(input())\n n = 1\n while k > 0:\n n += 1\n if n == 10:\n n = 100\n elif n == 100:\n n = 1000\n elif n == 1000:\n n = 10000\n elif n == 10000:\n n = 100000\n elif n == 100000:\n n = 1000000\n k -= n - 1\n print(n - 1)\n\n\nmain()", "def main():\n k = int(input())\n n = 1\n cnt = 0\n while True:\n for i in range(10, 0, -1):\n for j in range(i - 1, 0, -1):\n for l in range(j - 1, 0, -1):\n cnt += 1\n if cnt == k:\n print(n)\n return\n n += 1\n\n\nmain()", "K = int(input())\ncnt = 0\nn = 1\nwhile cnt < K:\n n += 1\n for i in range(1, 10):\n for j in range(0, 10):\n for k in range(0, 10):\n for l in range(0, 10):\n for m in range(0, 10):\n for o in range(0, 10):\n cnt += 1\n if cnt == K:\n print(i * 100000 + j * 10000 + k * 1000 + l * 100 + m * 10 + o)\n exit()", "K = int(input())\n\ni = 1\nwhile True:\n for d1 in range(10, 0, -1):\n for d2 in range(d1 - 1, 0, -1):\n for d3 in range(d2 - 1, 0, -1):\n for d4 in range(d3 - 1, 0, -1):\n for d5 in range(d4 - 1, 0, -1):\n for d6 in range(d5 - 1, 0, -1):\n for d7 in range(d6 - 1, 0, -1):\n for d8 in range(d7 - 1, 0, -1):\n for d9 in range(d8 - 1, 0, -1):\n for d10 in range(d9 - 1, 0, -1):\n s = f\"{d1}{d2}{d3}{d4}{d5}{d6}{d7}{d8}{d9}{d10}\"\n if i == K:\n print(s)\n exit()\n i += 1", "k = int(input())\n\ni = 1\nwhile k > 0:\n k -= i\n i *= 10\n\nprint(i // 10)", "import math\n\nk = int(input())\n\nn = 1\nwhile True:\n count = 9 * 9 * 9 * 9 * 9 * 9 * 9 * 9 * 9 * (n // 10 ** (9 - 1))\n if k <= count:\n break\n k -= count\n n += 1\n\nm = n // 10 ** (9 - 1)\nn %= 10 ** (9 - 1)\n\nans = []\nfor i in range(9, 0, -1):\n if m >= 10 ** (i - 1):\n ans.append(str(i))\n m -= 10 ** (i - 1)\n\nfor i in range(9, 0, -1):\n if n >= 10 ** (i - 1):\n ans.append(str(i))\n n -= 10 ** (i - 1)\n\nprint(\"\".join(ans))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m, p = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nans = 0\nfor i in range(n):\n for j in range(m):\n ans += min(a[i] + b[j], p)\nprint(ans)", "n, m, p = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nans = 0\nfor i in a:\n for j in b:\n ans += min(i + j, p)\nprint(ans)", "n, m, p = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nans = 0\nfor i in range(n):\n for j in range(m):\n ans += min(a[i] + b[j], p)\nprint(ans)", "n, m, p = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nans = 0\nfor i in a:\n for j in b:\n ans += min(i + j, p)\nprint(ans)", "n, m, p = map(int, input().split())\na = sorted(map(int, input().split()))\nb = sorted(map(int, input().split()))\nans = 0\nfor i in range(n):\n for j in range(m):\n ans += min(a[i] + b[j], p)\nprint(ans)", "n, m, p = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nans = 0\nfor i in a:\n for j in b:\n ans += min(i + j, p)\nprint(ans)", "n, m, p = map(int, input().split())\na = sorted(map(int, input().split()))\nb = sorted(map(int, input().split()))\nans = 0\nfor i in range(n):\n for j in range(m):\n ans += min(a[i] + b[j], p)\nprint(ans)", "n, m, p = map(int, input().split())\na = sorted(map(int, input().split()))\nb = sorted(map(int, input().split()))\nans = 0\nfor i in a:\n for j in b:\n ans += min(i + j, p)\nprint(ans)", "n, m, p = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nans = 0\nfor i in range(n):\n for j in range(m):\n ans += min(a[i] + b[j], p)\nprint(ans)", "n, m, p = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nans = 0\nfor i in range(n):\n for j in range(m):\n ans += min(a[i] + b[j], p)\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from math import log2, ceil, floor\n\nfor _ in range(int(input())):\n n, x, k = map(int, input().split())\n x = log2(x)\n if k == 0:\n print(floor(x) + 1)\n elif k == 1:\n print(ceil(x) + 1)\n elif k == 2:\n print(2 ** (ceil(x)) - 2 ** (floor(x)))\n else:\n print(2 ** (k - 1))", "from math import log2\n\n\ndef f(n, x, k):\r\n if k == 0:\r\n return 1 if x == n else 0\r\n if k == 1:\r\n return int(log2(n)) + 1 if x == n else 1 if x * 2 <= n else 0\r\n if k == 2:\r\n return n - x * 2 + 1 if x * 2 <= n else 0\r\n if k >= 3:\r\n if x * 2**k - 2**k + 1 > n:\r\n return 0\r\n if x * 2 ** (k - 1) - 2 ** (k - 1) + 1 <= n:\r\n return 2 ** (k - 1)\r\n else:\r\n return 2 ** (k - 1) - (n - x * 2 ** (k - 1) + 1) + 1\r\n\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n n, x, k = map(int, input().split())\r\n print(f(n, x, k))\r", "import sys\n\ninput = sys.stdin.readline\nfor _ in range(int(input())):\n n, x, k = map(int, input().split())\n if k == 0:\n print(1)\n elif k == 1:\n print(2 ** (x - 1))\n elif k == 2:\n print(2 ** x - 2 ** (x - 1) - 1)\n elif k == 3:\n print(2 ** (x - 1) + 1)\n else:\n print(0)", "def solve(N, X, K):\r\n if K == 0:\r\n return 1 if X == 1 else 0\r\n if K == 1:\r\n return 2 ** (X - 1)\r\n if K == 2:\r\n return 2 ** (N - X) - 2 ** (N - X - 1)\r\n if K % 2 == 0:\r\n return 2 ** (N - K // 2) - 2 ** (N - K // 2 - 1)\r\n else:\r\n return 2 ** (N - K // 2 - 1)\r\n\r\nT = int(input())\r\nfor _ in range(T):\r\n N, X, K = map(int, input().split())\r\n print(solve(N, X, K))\r", "from math import log2\n\n\ndef main():\n t = int(input())\n for _ in range(t):\n n, x, k = map(int, input().split())\n x = log2(x)\n if k == 0:\n print(2 ** (int(x) - 1))\n elif k == 1:\n print(2 ** (int(x) - 1) * 2 - 1)\n elif k == int(x):\n print(1)\n elif k < int(x):\n print(2 ** (k - 1))\n else:\n print(2 ** (int(x) - 1))\n\n\nmain()", "def f(n, x, k):\r\n if k == 0:\r\n return 1 if x == 1 else 0\r\n if k == 1:\r\n return 2 ** (x - 1)\r\n if k == 2:\r\n return 2 ** (n - x) - 2 ** (n - x - 1)\r\n if k % 2 == 1:\r\n return 2 ** (n - x - (k - 1) // 2) - 2 ** (n - x - (k + 1) // 2)\r\n else:\r\n return 2 ** (n - x - k // 2)\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n n, x, k = map(int, input().split())\r\n print(f(n, x, k))\r", "import sys\n\ninput = sys.stdin.readline\nT = int(input())\nfor _ in range(T):\n N, X, K = map(int, input().split())\n if K == 0:\n if X == 1:\n print(1)\n else:\n print(2 ** (X - 1).bit_length())\n else:\n if X == 1:\n print(2 ** (K - 1))\n else:\n X -= 1\n K -= 1\n if X & 1:\n print(2 ** K)\n else:\n print(2 ** (K - 1))", "from math import log2, ceil, floor\n\nfor _ in range(int(input())):\n n, x, k = map(int, input().split())\n x = log2(x)\n if k == 0:\n print(floor(x) + 1)\n elif k == 1:\n print(ceil(x) + 1)\n else:\n if k % 2 == 0:\n print(2 ** (k // 2))\n else:\n print(2 ** (k // 2 + 1) - 2)", "from sys import stdin, stdout\n\ninput = stdin.readline\nfor _ in range(int(input())):\n n, x, k = map(int, input().split())\n if k == 0:\n if x == 1:\n print(1)\n else:\n print(2 ** (x - 1).bit_length())\n elif k == 1:\n if x == 1:\n print(0)\n else:\n print(2 ** (x - 1).bit_length() - 1)\n else:\n if x == 1:\n print(2 ** (k - 1))\n else:\n print(2 ** (k - 1) + (2 ** (x - 1).bit_length() - 1) * (2 ** (k - 2)))", "from sys import stdin, stdout\n\ninput = stdin.readline\n\nfor _ in range(int(input())):\n n, x, k = map(int, input().split())\n x = n - x + 1\n if k == 0:\n print(1)\n elif k == 1:\n print(x // 2)\n else:\n if x % (2**k) == 0:\n print(2 ** (k - 1))\n else:\n print(2 ** k)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ns = input()\nfor i in range(n - 2):\n if s[i : i + 3] == \"ABC\":\n print(i + 1)\n break\nelse:\n print(-1)", "n = int(input())\ns = input()\n\nfor i in range(n - 2):\n if s[i : i + 3] == \"ABC\":\n print(i + 1)\n break\nelse:\n print(-1)", "n = int(input())\ns = input()\n\nfor i in range(n - 2):\n if s[i : i + 3] == \"ABC\":\n print(i + 1)\n break\nelse:\n print(-1)", "n = int(input())\ns = input()\n\nfor i in range(n - 2):\n if s[i : i + 3] == \"ABC\":\n print(i + 1)\n return\nprint(-1)", "n = int(input())\ns = input()\n\nfor i in range(n - 2):\n if s[i : i + 3] == \"ABC\":\n print(i + 1)\n exit()\nprint(-1)", "n = int(input())\ns = input()\n\nfor i in range(n - 2):\n if s[i : i + 3] == \"ABC\":\n print(i + 1)\n return\nprint(-1)", "n = int(input())\ns = input()\n\nfor i in range(n - 2):\n if s[i : i + 3] == \"ABC\":\n print(i + 1)\n return\nprint(-1)", "n = int(input())\ns = input()\n\nfor i in range(n - 2):\n if s[i : i + 3] == \"ABC\":\n print(i + 1)\n return\nprint(-1)", "n = int(input())\ns = input()\n\nfor i in range(n - 2):\n if s[i:i + 3] == \"ABC\":\n print(i + 1)\n return\nprint(-1)", "n = int(input())\ns = input()\n\nfor i in range(n - 2):\n if s[i:i + 3] == \"ABC\":\n print(i + 1)\n return\nprint(-1)" ], "pass1_list": [ true, true, true, true, false, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\ns = input()\nt = input()\nif t[:n] == s:\n if t[-n:] == s:\n print(0)\n else:\n print(1)\nelif t[-n:] == s:\n print(2)\nelse:\n print(3)", "n, m = map(int, input().split())\ns = input()\nt = input()\n\nif t[:n] == s:\n if t[-n:] == s:\n print(0)\n else:\n print(1)\nelif t[-n:] == s:\n print(2)\nelse:\n print(3)", "n, m = map(int, input().split())\r\ns = input()\r\nt = input()\r\n\r\nif t[:n] == s:\r\n if t[-n:] == s:\r\n print(0)\r\n else:\r\n print(1)\r\nelif t[-n:] == s:\r\n print(2)\r\nelse:\r\n print(3)\r", "n, m = map(int, input().split())\ns = input()\nt = input()\n\nif t[:n] == s:\n if t[-n:] == s:\n print(0)\n else:\n print(1)\nelif t[-n:] == s:\n print(2)\nelse:\n print(3)", "n, m = map(int, input().split())\r\ns = input()\r\nt = input()\r\n\r\nif t[:n] == s:\r\n if t[-n:] == s:\r\n print(0)\r\n else:\r\n print(1)\r\nelif t[-n:] == s:\r\n print(2)\r\nelse:\r\n print(3)\r", "n, m = map(int, input().split())\ns = input()\nt = input()\n\nif t[:n] == s:\n if t[-n:] == s:\n print(0)\n else:\n print(1)\nelif t[-n:] == s:\n print(2)\nelse:\n print(3)", "n, m = map(int, input().split())\ns = input()\nt = input()\n\nif t[:n] == s:\n if t[-n:] == s:\n print(0)\n else:\n print(1)\nelif t[-n:] == s:\n print(2)\nelse:\n print(3)", "n, m = map(int, input().split())\ns = input()\nt = input()\n\nif t[:n] == s:\n if t[-n:] == s:\n print(0)\n else:\n print(1)\nelif t[-n:] == s:\n print(2)\nelse:\n print(3)", "n, m = map(int, input().split())\r\ns = input()\r\nt = input()\r\n\r\nif t[:n] == s:\r\n if t[-n:] == s:\r\n print(0)\r\n else:\r\n print(1)\r\nelif t[-n:] == s:\r\n print(2)\r\nelse:\r\n print(3)\r", "n, m = map(int, input().split())\ns = input()\nt = input()\n\nif t[:n] == s:\n if t[-n:] == s:\n print(0)\n else:\n print(1)\nelif t[-n:] == s:\n print(2)\nelse:\n print(3)" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(m):\n d[a[i]] = i\n\nfor i in range(1, n + 1):\n if i in d:\n print(0)\n else:\n print(d[i + 1] - d[i])", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n print((min([j for j in a if j >= i + 1]) - (i + 1)))\r", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nd = {}\r\nfor i in range(m):\r\n d[a[i]] = i\r\n\r\nfor i in range(1, n + 1):\r\n print(d.get(i, d[n]) - d.get(i, n))\r", "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(m):\n d[a[i]] = i\n\nfor i in range(1, n + 1):\n if i in d:\n print(0)\n else:\n print(d[i + 1] - d[i])", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n print((min([j for j in a if j >= i + 1]) - (i + 1)))\r", "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(m):\n d[a[i]] = i\n\nfor i in range(1, n + 1):\n print(d.get(i, d[n]) - d.get(i, n))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nd = [0] * (n + 1)\r\nfor i in a:\r\n d[i] = 1\r\n\r\nfor i in range(1, n + 1):\r\n if d[i] == 0:\r\n d[i] = d[i - 1] + 1\r\n\r\nfor i in d[1:]:\r\n print(i)\r", "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\nd = {}\nfor i in range(m):\n d[a[i]] = i\n\nfor i in range(1, n + 1):\n if i in d:\n print(0)\n else:\n print(d[i + 1] - d[i])", "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\ndays = [0] * (n + 1)\nfor i in a:\n days[i] = 0\n\nfor i in range(n - 2, -1, -1):\n days[i] = days[i + 1]\n\nfor i in range(n):\n print(days[i])", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n print((min([j for j in a if j > i]) - i - 1))\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "def rot(p):\n return [\n [\"#\" if c == \"#\" else \".\" for c in p[0]],\n [\"#\" if r[0] == \"#\" else \".\" for r in p],\n [\n \"#\" if c == \"#\" else \".\"\n for c in \"\".join([r[-1] for r in p])[::-1]\n ],\n [\n \"#\" if r[-1] == \"#\" else \".\"\n for r in p[::-1]\n ],\n ]\n\n\ndef can_place(p, x, y):\n for i in range(4):\n for j in range(4):\n if p[i][j] == \"#\" and (i + y < 0 or j + x < 0 or i + y >= 4 or j + x >= 4):\n return False\n if p[i][j] == \"#\" and grid[i + y][j + x] == \"#\":\n return False\n if p[i][j] == \"#\":\n grid[i + y][j + x] = \"#\"\n return True\n\n\ngrid = [list(input()) for _ in range(4)]\np = [list(input()) for _ in range(4, 16, 4)]\nfor i in range(4):\n for j in range(4):\n for k in range(3):\n for l in range(4):\n for m in range(4):\n if can_place(rot(p)[k], j, i):\n for n in range(4):\n for o in range(4):\n if can_place(rot(p)[l], n, o):\n for q in range(4):\n for r in range(4):\n if can_place(rot(p)[m], q, r):\n print(\"Yes\")\n exit()\nprint(\"No\")", "from itertools import chain\n\np = [input() for _ in range(12)]\n\nps = []\nfor i in range(3):\n for j in range(4):\n for k in range(4):\n if p[4 * i + j][k] == \"#\":\n ps.append((i, j, k))\n\ndef rot(x, y):\n return (y, -x)\n\ndef ok(ps):\n m = [[0] * 4 for _ in range(4)]\n for i, j, k in ps:\n m[j][k] = 1\n for i in range(4):\n for j in range(1, 4):\n if m[i][j - 1] and not m[i][j]:\n return False\n for j in range(4):\n if m[i][j] and m[i + 1][j] and i < 3:\n return False\n return True\n\nfor i in range(4):\n for j in range(4):\n for k in range(4):\n for l in range(4):\n if ok(list(chain.from_iterable((rot(x - i, y - j) for x, y in ps)))):\n print(\"Yes\")\n return\nprint(\"No\")", "from itertools import chain\n\np = [list(input()) for _ in range(12)]\n\nt = [\n [\n [[[0, 1, 2, 3], [1, 0, 3, 2], [2, 3, 0, 1], [3, 2, 1, 0]], [[[0, 1, 2, 3], [1, 2, 3, 0], [2, 3, 0, 1], [3, 0, 1, 2]]]],\n [[[0, 1, 2, 3], [1, 0, 3, 2], [2, 3, 0, 1], [3, 2, 1, 0]], [[[0, 1, 3, 2], [1, 0, 2, 3], [2, 3, 1, 0], [3, 2, 0, 1]]]],\n [[[0, 1, 2, 3], [1, 0, 3, 2], [2, 3, 0, 1], [3, 2, 1, 0]], [[[0, 1, 2, 3], [2, 3, 0, 1], [1, 0, 3, 2], [3, 2, 1, 0]]]],\n ],\n [\n [[[0, 1, 2, 3], [1, 0, 3, 2], [2, 3, 0, 1], [3, 2, 1, 0]], [[[0, 1, 2, 3], [1, 2, 3, 0], [2, 3, 1, 0], [3, 0, 1, 2]]]],\n [[[0, 1, 2, 3], [1, 0, 3, 2], [2, 3, 0, 1], [3, 2, 1, 0]], [[[0, 1, 3, 2], [1, 0, 2, 3], [2, 3, 1, 0], [3, 2, 0, 1]]]],\n [[[0, 1, 2, 3], [1, 0, 3, 2], [2, 3, 0, 1], [3, 2, 1, 0]], [[[0, 1, 2, 3], [2, 3, 0, 1], [1, 0, 3, 2], [3, 2, 1, 0]]]],\n ],\n [\n [[[0, 1, 2, 3], [1, 0, 3, 2], [2, 3, 0, 1], [3, 2, 1, 0]], [[[0, 1, 2, 3], [1, 2, 3, 0], [2, 3, 0, 1], [3, 0, 1, 2]]]],\n [[[0, 1, 2, 3], [1, 0, 3, 2], [2, 3, 0, 1], [3, 2, 1, 0]], [[[0, 1, 3, 2], [1, 0, 2, 3], [2, 3, 0, 1], [3, 2, 1, 0]]]],\n [[[0, 1, 2, 3], [1, 0, 3, 2], [2, 3, 0, 1], [3, 2, 1, 0]], [[[0, 1, 2, 3], [2, 3, 1, 0], [1, 0, 3, 2], [3, 2, 0, 1]]]],\n ],\n]\n\nfor i in range(3):\n for j in range(4):\n for k in range(4):\n for l in range(4):\n for m in range(2):\n for n in range(2):\n q = [[[0, 0, 0, 0] for _ in range(4)] for _ in range(4)]\n for x in range(4):\n for y in range(4):\n if p[4 * i + x][4 * j + y] == \"#\":\n q[x + k][y + l][t[m][n][x][y]] = 1\n if all(\n chain(\n *(\n chain(\n *(\n chain(\n *(q[x][y] for y in range(4))\n for x in range(4)\n )\n )\n for _ in range(4)\n )\n )\n )):\n print(\"Yes\")\n exit()\nprint(\"No\")", "from itertools import permutations\n\np = [list(input()) for _ in range(12)]\n\ndef rot(p):\n return [[\"\".join(r[i] for r in p)] + [r[-1]] + [\"\".join(r[::-1][i] for r in p[1:-1])] for i in range(4)]\n\ndef can(p):\n for i in range(4):\n for j in range(4):\n if all(p[k][l] in [\".\", \"#\"] for k in range(4) for l in range(4)) and \\\n all(p[k][l] == \"#\" for k in range(i, i + 4) for l in range(j, j + 4)):\n return True\n return False\n\nfor t in permutations(p, 3):\n for p1 in rot(t[0]):\n for p2 in rot(t[1]):\n for p3 in rot(t[2]):\n if can(p1 + p2 + p3):\n print(\"Yes\")\n exit()\nprint(\"No\")", "import sys\n\ninput = sys.stdin.readline\n\nP = [list(input().rstrip()) for _ in range(12)]\n\nfor i in range(4):\n for j in range(4):\n for k in range(3):\n for l in range(4):\n for m in range(4):\n for n in range(4):\n if all(\n P[4 * k + a][4 * l + b] == \".\"\n or P[4 * k + a][4 * l + b]\n == P[4 * i + a + j][4 * m + b + n]\n for a in range(4)\n for b in range(4)\n ):\n if all(\n P[4 * i + a + j][4 * m + b + n] == \".\"\n or P[4 * i + a + j][4 * m + b + n]\n == P[4 * k + a][4 * l + b]\n for a in range(4)\n for b in range(4)\n ):\n if all(\n P[4 * i + a + j][4 * m + b + n] == \"#\"\n for a in range(4)\n for b in range(4)\n ):\n print(\"Yes\")\n exit()\nprint(\"No\")", "from itertools import permutations\n\np = [list(input()) for _ in range(12)]\n\np1 = [[j for j in i if j == \"#\"] for i in p[:4]]\np2 = [[j for j in i if j == \"#\"] for i in p[4:8]]\np3 = [[j for j in i if j == \"#\"] for i in p[8:]]\n\ndef check(a, b, c):\n for i in range(4):\n for j in range(4):\n if a[i][j] == \"#\" or b[i][j] == \"#\" or c[i][j] == \"#\":\n if (\n a[i][j] == \"#\" and b[i][j] == \"#\"\n or a[i][j] == \"#\" and c[i][j] == \"#\"\n or b[i][j] == \"#\" and c[i][j] == \"#\"\n ):\n return False\n if (\n a[i][j] == \"#\"\n and b[i][j] != \"#\"\n and c[i][j] != \"#\"\n and (i + j) % 2 == 0\n ):\n return False\n if (\n b[i][j] == \"#\"\n and a[i][j] != \"#\"\n and c[i][j] != \"#\"\n and (i + j + 1) % 2 == 0\n ):\n return False\n if (\n c[i][j] == \"#\"\n and a[i][j] != \"#\"\n and b[i][j] != \"#\"\n and (i + j + 2) % 2 == 0\n ):\n return False\n return True\n\n\nfor a in permutations(p1):\n for b in permutations(p2):\n for c in permutations(p3):\n if check(a, b, c):\n print(\"Yes\")\n return\nprint(\"No\")", "def rot(p):\n return [\n [\"#\" if p[3 - j][i] == \"#\" else \".\" for j in range(4)] for i in range(4)\n ]\n\n\ndef flip(p):\n return [p[i][::-1] for i in range(4)]\n\n\ndef can_place(grid, p, r, c):\n for i in range(4):\n for j in range(4):\n if p[i][j] == \"#\" and (r + i < 0 or c + j < 0 or r + i >= 4 or (c + j >= 4)):\n return False\n if p[i][j] == \"#\" and grid[r + i][c + j] == \"#\":\n return False\n if p[i][j] == \"#\":\n grid[r + i][c + j] = \"#\"\n return True\n\n\ndef place(grid, p, r, c):\n for i in range(4):\n for j in range(4):\n if p[i][j] == \"#\":\n grid[r + i][c + j] = \"#\"\n\n\ndef remove(grid, p, r, c):\n for i in range(4):\n for j in range(4):\n if p[i][j] == \"#\":\n grid[r + i][c + j] = \".\"\n\n\ndef solve(grid, p):\n for r in range(4):\n for c in range(4):\n if can_place(grid, p, r, c):\n place(grid, p, r, c)\n return True\n for _ in range(3):\n p = rot(p)\n if can_place(grid, p, r, c):\n place(grid, p, r, c)\n return True\n p = flip(p)\n return False\n\n\ndef main():\n p = []\n for _ in range(3):\n p.append([])\n for i in range(4):\n s = input()\n p[-1].append(list(s))\n grid = [[\".\"] * 4 for _ in range(4)]\n if solve(grid, p[0]):\n if solve(grid, p[1]):\n if solve(grid, p[2]):\n print(\"Yes\")\n return\n print(\"No\")\n\n\nmain()", "from itertools import permutations\n\nP = [list(input()) for _ in range(12)]\n\ndef rot(p):\n return [list(x)[::-1] for x in zip(*p)]\n\ndef flip(p):\n return [x[::-1] for x in p][::-1]\n\ndef can(p1, p2, p3):\n for i in range(4):\n for j in range(4):\n g = [[0] * 4 for _ in range(4)]\n for pi in range(3):\n for r in range(4):\n for c in range(4):\n if p1[pi][r][c] == \"#\":\n g[r + i][c + j] = 1\n if all(all(x) for x in g):\n return True\n for r in range(4):\n for c in range(4):\n if g[r][c] == 0:\n break\n else:\n return True\n return False\n\nfor p1 in permutations(P, 3):\n for p2 in permutations(p1):\n for p3 in permutations(p2):\n if can(p1, p2, p3):\n print(\"Yes\")\n return\nprint(\"No\")", "def rot(p):\n return [\n [\"#\" if \"#\" in p[j] else \".\" for j in range(4)]\n for i in range(4)[::-1]\n ]\n\n\ndef flip(p):\n return [p[i][::-1] for i in range(4)]\n\n\ndef can_place(p, x, y):\n for i in range(4):\n for j in range(4):\n if p[i][j] == \"#\" and (i + x < 0 or j + y < 0 or i + x >= 4 or j + y >= 4):\n return False\n if p[i][j] == \"#\" and grid[i + x][j + y] == \"#\":\n return False\n if p[i][j] == \"#\":\n grid[i + x][j + y] = \"#\"\n return True\n\n\ngrid = [[\".\"] * 4 for i in range(4)]\np = []\nfor i in range(3):\n s = input()\n p.append([list(s[j * 4 : j * 4 + 4]) for j in range(4)])\n for j in range(3):\n p[i].append(rot(p[i][-1]))\n p[i].append(flip(p[i][-1]))\n p[i].append(rot(p[i][-1]))\n p[i].append(flip(p[i][-1]))\n p[i].append(rot(p[i][-1]))\nfor i in range(3):\n for j in range(8):\n for k in range(4):\n for l in range(4):\n if can_place(p[i][j], k, l):\n print(\"Yes\")\n exit()\nprint(\"No\")", "from itertools import permutations\n\np = []\nfor i in range(3):\n p.append([list(input()) for _ in range(4)])\n\ndef rot(p):\n return [list(x)[::-1] for x in zip(*p)]\n\ndef can(p):\n for i in range(4):\n for j in range(4):\n if p[i][j] == \".\":\n return False\n return True\n\ndef ok(p, q):\n for i in range(4):\n for j in range(4):\n if p[i][j] == \"#\" and q[i][j] == \"#\":\n return False\n return True\n\ndef solve(p):\n for pi in permutations(p):\n for pj in pi:\n for k in range(4):\n pj = rot(pj)\n if can(pj) and ok(pi[0], pj) and ok(pi[1], pj):\n return True\n return False\n\nprint(\"Yes\" if solve(p) else \"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nn, k, p = map(int, input().split())\n\nINF = 10**15\ndp = [[INF] * (p + 1) for i in range(k + 1)]\ndp[0][0] = 0\n\nfor i in range(n):\n c, *a = map(int, input().split())\n for j in range(k, -1, -1):\n for l in range(p, -1, -1):\n if l + a[j] <= p:\n dp[j + 1][l + a[j]] = min(dp[j + 1][l + a[j]], dp[j][l] + c)\n\nans = INF\nfor i in range(p, -1, -1):\n ans = min(ans, dp[k][i])\n\nif ans == INF:\n print(-1)\nelse:\n print(ans)", "from itertools import chain\n\nN, K, P = map(int, input().split())\nCA = [list(map(int, input().split())) for _ in range(N)]\n\nINF = 10**18\ndp = [[INF] * (P + 1) for _ in range(1 << K)]\ndp[0][0] = 0\nfor c, *a in CA:\n for i in range(1 << K):\n for j in range(P + 1):\n if dp[i][j] == INF:\n continue\n for k in range(K):\n if i >> k & 1:\n continue\n dp[i | 1 << k][j + a[k]] = min(dp[i | 1 << k][j + a[k]], dp[i][j] + c)\n\nans = INF\nfor i in range(1 << K):\n t = [0] * K\n for j in range(K):\n if i >> j & 1:\n for k in range(K):\n t[k] += CA[j][k + 1]\n if all(map(lambda x: x >= P, t)):\n ans = min(ans, dp[i][P])\nprint(ans if ans != INF else -1)", "from itertools import accumulate, chain, combinations\n\nN, K, P = map(int, input().split())\nplans = [list(map(int, input().split())) for _ in range(N)]\nplans.sort(key=lambda x: -sum(x[1:]))\n\ncosts = [0] * (P + 1)\nfor c, *a in plans:\n costs = list(accumulate(chain(costs, [c + sum(a)])))\n\nans = float(\"inf\")\nfor i in range(P + 1):\n for comb in combinations(range(i, P + 1), K):\n if all(costs[i] >= P for i in comb):\n ans = min(ans, costs[i] - costs[i - 1])\n\nprint(ans if ans < float(\"inf\") else -1)", "import sys\n\ninput = sys.stdin.readline\n\nn, k, p = map(int, input().split())\n\nplans = []\nfor i in range(n):\n plans.append(list(map(int, input().split())))\n\ndp = [[float(\"inf\")] * (p + 1) for i in range(k + 1)]\ndp[0][0] = 0\n\nfor c, *a in plans:\n for i in range(k, -1, -1):\n for j in range(p, -1, -1):\n if j + sum(a[:i]) >= p:\n dp[i][j + sum(a[:i])] = min(dp[i][j + sum(a[:i])], dp[i - 1][j] + c)\n\nans = float(\"inf\")\nfor i in range(p + 1):\n ans = min(ans, dp[k][i])\n\nif ans == float(\"inf\"):\n print(-1)\nelse:\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, K, P = map(int, input().split())\n\nplans = []\nfor i in range(N):\n C, *A = map(int, input().split())\n plans.append((C, A))\n\ndp = [float(\"inf\")] * (1 << K)\ndp[0] = 0\n\nfor C, A in plans:\n for i in range(1 << K):\n for j in range(K):\n if i >> j & 1:\n continue\n dp[i | 1 << j] = min(dp[i | 1 << j], dp[i] + C)\n for k in range(K):\n dp[i | 1 << j] -= A[k]\n\nans = float(\"inf\")\nfor i in range(1 << K):\n ok = True\n for j in range(K):\n if i >> j & 1:\n continue\n if dp[i] - P < 0:\n ok = False\n break\n dp[i] -= P\n if ok:\n ans = min(ans, dp[i])\n\nif ans == float(\"inf\"):\n print(-1)\nelse:\n print(ans)", "from itertools import accumulate\nfrom operator import itemgetter\n\nN, K, P = map(int, input().split())\nCA = [list(map(int, input().split())) for _ in range(N)]\n\nCA.sort(key=itemgetter(0))\n\nINF = float(\"inf\")\ndp = [[[INF] * (P + 1) for _ in range(1 << K)] for _ in range(N + 1)]\ndp[0][0][0] = 0\n\nfor i, (c, *a) in enumerate(CA, 1):\n for s in range(1 << K):\n for p in range(P + 1):\n dp[i][s][p] = dp[i - 1][s][p]\n if p + sum(a[j] for j in range(K) if s >> j & 1) <= P:\n dp[i][s | sum(1 << j for j in range(K) if a[j])][p + sum(a[j] for j in range(K) if s >> j & 1)] = min(\n dp[i][s | sum(1 << j for j in range(K) if a[j])][p + sum(a[j] for j in range(K) if s >> j & 1)],\n dp[i - 1][s][p] + c,\n )\n\nans = min((dp[N][(1 << K) - 1][p] for p in range(P + 1) if dp[N][(1 << K) - 1][p] != INF), default=-1)\nprint(ans)", "from itertools import accumulate\nfrom collections import deque\n\nN, K, P = map(int, input().split())\nplans = [list(map(int, input().split())) for _ in range(N)]\n\nINF = float(\"inf\")\ndp = [[[INF] * (P + 1) for _ in range(1 << K)] for _ in range(N + 1)]\ndp[0][0][0] = 0\n\nfor i in range(N):\n for j in range(1 << K):\n for k in range(P + 1):\n if dp[i][j][k] == INF:\n continue\n for l in range(K):\n if j >> l & 1:\n continue\n v = plans[i][1 + l]\n if k + v > P:\n continue\n dp[i + 1][j | 1 << l][k + v] = min(\n dp[i + 1][j | 1 << l][k + v], dp[i][j][k] + plans[i][0]\n )\n\nans = INF\nfor j in range(1 << K):\n for k in range(P + 1):\n ans = min(ans, dp[N][j][k])\n\nif ans == INF:\n ans = -1\nprint(ans)", "from itertools import chain, combinations\n\nn, k, p = map(int, input().split())\nplans = [list(map(int, input().split())) for _ in range(n)]\n\nplans.sort(key=lambda x: -sum(x[1:]))\n\ncosts = [plan[0] for plan in plans]\n\ndp = [[float(\"inf\")] * (1 << k) for _ in range(n + 1)]\ndp[0][0] = 0\n\nfor i in range(n):\n for j in range((1 << k) - 1, -1, -1):\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n for comb in chain(combinations(range(k), 1), combinations(range(k), 2)):\n if j | (1 << comb[0]) | (1 << comb[1]):\n dp[i + 1][j | (1 << comb[0]) | (1 << comb[1])] = min(\n dp[i + 1][j | (1 << comb[0]) | (1 << comb[1])],\n dp[i][j] + costs[i],\n )\n\nans = float(\"inf\")\nfor j in range((1 << k) - 1, -1, -1):\n if all(dp[-1][j] >= p):\n ans = min(ans, dp[-1][j])\n\nif ans == float(\"inf\"):\n print(-1)\nelse:\n print(ans)", "from itertools import chain\n\nN, K, P = map(int, input().split())\nplans = [list(map(int, input().split())) for _ in range(N)]\nplans.sort(key=lambda x: -sum(x[1:]))\n\ndp = [[float(\"inf\")] * (1 << K) for _ in range(N + 1)]\ndp[0][0] = 0\n\nfor i in range(N):\n for j in range(1 << K):\n if dp[i][j] == float(\"inf\"):\n continue\n for k in range(K):\n if plans[i][k + 1] > 0 and j >> k & 1 == 0:\n dp[i + 1][j | 1 << k] = min(\n dp[i + 1][j | 1 << k], dp[i][j] + plans[i][0]\n )\n\nans = float(\"inf\")\nfor i in range(1 << K):\n if all(bin(i).count(\"1\") >= P for _ in range(K)):\n ans = min(ans, dp[N][i])\n\nif ans == float(\"inf\"):\n print(-1)\nelse:\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, K, P = map(int, input().split())\n\nC = []\nA = []\nfor i in range(N):\n C_i, *A_i = map(int, input().split())\n C.append(C_i)\n A.append(A_i)\n\nINF = 10**18\ndp = [[INF] * (P + 1) for i in range(K + 1)]\ndp[0][0] = 0\nfor i in range(N):\n for j in range(K, -1, -1):\n for k in range(P, -1, -1):\n dp[j + 1][k] = min(dp[j + 1][k], dp[j][k])\n if k - A[i][j - 1] >= 0:\n dp[j][k - A[i][j - 1]] = min(\n dp[j][k - A[i][j - 1]], dp[j][k] + C[i]\n )\n\nans = INF\nfor i in range(P + 1):\n ans = min(ans, dp[K][i])\nif ans == INF:\n ans = -1\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s = input()\nfor i in range(2, 17, 2):\n if s[i - 1] != \"0\":\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "s = input()\nfor i in range(2, 17, 2):\n if s[i - 1] != \"0\":\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "s = input()\nfor i in range(2, 17, 2):\n if s[i - 1] != \"0\":\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "s = input()\nfor i in range(2, 17, 2):\n if s[i - 1] != \"0\":\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "s = input()\nfor i in range(2, 17, 2):\n if s[i - 1] != \"0\":\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "s = input()\nfor i in range(2, 17, 2):\n if s[i - 1] != \"0\":\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "s = input()\nfor i in range(2, 17, 2):\n if s[i - 1] != \"0\":\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "s = input()\nfor i in range(2, 17, 2):\n if s[i - 1] != \"0\":\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "s = input()\nfor i in range(2, 17, 2):\n if s[i - 1] != \"0\":\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "s = input()\nfor i in range(2, 17, 2):\n if s[i - 1] != \"0\":\n print(\"No\")\n break\nelse:\n print(\"Yes\")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\nwins = [0] * n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(n):\r\n if s[j] == 'o':\r\n wins[i] += 1\r\n\r\nfor i in sorted(range(n), key=lambda x: (-wins[x], x)):\r\n print(i + 1, end=' ')\r", "n = int(input())\r\ns = [input() for _ in range(n)]\r\n\r\nrank = [0] * n\r\nfor i in range(n):\r\n for j in range(n):\r\n if s[i][j] == 'o':\r\n rank[i] += 1\r\n\r\nrank_sorted = sorted(range(n), key=lambda i: (-rank[i], i))\r\nprint(*[i + 1 for i in rank_sorted])\r", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n s = input()\r\n a.append([s.count('o'), i + 1])\r\na.sort(reverse=True)\r\nfor i in range(n):\r\n print(a[i][1], end=' ')\r", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n s = input()\r\n a.append([s.count('o'), i + 1])\r\na.sort(reverse=True)\r\nfor i in range(n):\r\n print(a[i][1], end=' ')\r", "n = int(input())\r\ns = [input() for _ in range(n)]\r\n\r\nwins = [0] * n\r\nfor i in range(n):\r\n for j in range(n):\r\n if s[i][j] == \"o\":\r\n wins[i] += 1\r\n\r\nprint(*sorted(range(1, n + 1), key=lambda i: (-wins[i - 1], i)))\r", "n = int(input())\r\n\r\nwins = [0] * n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(n):\r\n if s[j] == 'o':\r\n wins[i] += 1\r\n\r\nranking = sorted(range(n), key=lambda i: (-wins[i], i))\r\nprint(*[i + 1 for i in ranking])\r", "n = int(input())\r\na = [0] * n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(n):\r\n if s[j] == 'o':\r\n a[i] += 1\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if a[i] < a[j] or a[i] == a[j] and i > j:\r\n a[i], a[j] = a[j], a[i]\r\nprint(*a)\r", "n = int(input())\r\n\r\nwins = [0] * n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(n):\r\n if s[j] == 'o':\r\n wins[i] += 1\r\n\r\nfor i in sorted(range(n), key=lambda x: (-wins[x], x)):\r\n print(i + 1, end=' ')\r", "n = int(input())\r\ns = [input() for _ in range(n)]\r\n\r\nscores = [0] * n\r\nfor i in range(n):\r\n for j in range(n):\r\n if s[i][j] == \"o\":\r\n scores[i] += 1\r\n\r\nrank = sorted(range(n), key=lambda i: (-scores[i], i))\r\nprint(*[i + 1 for i in rank])\r", "n = int(input())\r\n\r\nwins = [0] * n\r\n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(n):\r\n if s[j] == 'o':\r\n wins[i] += 1\r\n\r\nranks = sorted(range(n), key=lambda x: (-wins[x], x))\r\n\r\nprint(*[i + 1 for i in ranks])\r" ], "pass1_list": [ true, true, false, false, true, true, false, true, true, true ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\na = list(map(int, input().split()))\ns = []\nfor i in range(n):\n s.append(input())\n\nfor i in range(n):\n score = i + 1\n for j in range(m):\n if s[i][j] == \"o\":\n score += a[j]\n max_score = score\n for j in range(n):\n if i != j:\n tmp_score = j + 1\n for k in range(m):\n if s[j][k] == \"o\":\n tmp_score += a[k]\n max_score = max(max_score, tmp_score)\n cnt = 0\n for j in range(m):\n if s[i][j] == \"x\":\n cnt += 1\n score += a[j]\n if score > max_score:\n break\n print(cnt)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\ns = [input() for _ in range(n)]\n\nfor i in range(n):\n score = i + 1\n for j in range(m):\n if s[i][j] == \"o\":\n score += a[j]\n max_score = score\n for k in range(n):\n if i == k:\n continue\n tmp_score = k + 1\n for l in range(m):\n if s[k][l] == \"o\":\n tmp_score += a[l]\n max_score = max(max_score, tmp_score)\n cnt = 0\n for j in range(m):\n if s[i][j] == \"x\":\n cnt += 1\n tmp_score = score + a[j]\n if tmp_score > max_score:\n print(cnt)\n break\n else:\n print(cnt)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\ns = [input() for _ in range(n)]\n\nfor i in range(n):\n score = sum(a[j] for j in range(m) if s[i][j] == \"o\") + i + 1\n others = sorted([sum(a[j] for j in range(m) if s[k][j] == \"o\") + k + 1 for k in range(n) if k != i])[-2]\n diff = others - score\n cnt = 0\n for j in range(m):\n if s[i][j] == \"x\" and a[j] >= diff:\n cnt += 1\n diff = 0\n if a[j] > diff:\n diff = a[j] - diff\n print(cnt + (1 if diff else 0))", "n, m = map(int, input().split())\na = list(map(int, input().split()))\ns = [input() for _ in range(n)]\n\nfor i in range(n):\n score = sum(a[j] for j in range(m) if s[i][j] == \"o\") + i + 1\n others = [\n sum(a[j] for j in range(m) if s[k][j] == \"o\") + k + 1 for k in range(n) if k != i\n ]\n print(len(others) - (sum(1 for x in others if x <= score) > 0))", "n, m = map(int, input().split())\na = list(map(int, input().split()))\ns = [input() for _ in range(n)]\n\nfor i in range(n):\n score = sum(a[j] for j in range(m) if s[i][j] == \"o\") + i + 1\n others = [\n sum(a[j] for j in range(m) if s[k][j] == \"o\") + k + 1 for k in range(n) if k != i\n ]\n print(len(others) - (len(others) - 1).bit_length() - (max(others) < score))", "n, m = map(int, input().split())\na = list(map(int, input().split()))\ns = [input() for _ in range(n)]\n\nfor i in range(n):\n score = i + 1\n for j in range(m):\n if s[i][j] == \"o\":\n score += a[j]\n max_score = score\n for j in range(n):\n if i != j:\n tmp_score = j + 1\n for k in range(m):\n if s[j][k] == \"o\":\n tmp_score += a[k]\n max_score = max(max_score, tmp_score)\n cnt = 0\n for j in range(m):\n if s[i][j] == \"x\":\n cnt += 1\n score += a[j]\n if score > max_score:\n break\n print(cnt)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\ns = [input() for _ in range(n)]\n\nfor i in range(n):\n score = sum(a[j] for j in range(m) if s[i][j] == \"o\") + i + 1\n others = [sum(a[j] for j in range(m) if s[k][j] == \"o\") + k + 1 for k in range(n) if k != i]\n print(len(others) - (1 + len([x for x in others if x < score])))", "n, m = map(int, input().split())\na = list(map(int, input().split()))\ns = [input() for _ in range(n)]\n\nfor i in range(n):\n score = sum(a[j] for j in range(m) if s[i][j] == \"o\") + i + 1\n others = [sum(a[j] for j in range(m) if s[k][j] == \"o\") + k + 1 for k in range(n) if k != i]\n print(len(others) - others.count(score) - 1)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\ns = [input() for _ in range(n)]\n\nfor i in range(n):\n score = sum(a[j] for j in range(m) if s[i][j] == \"o\") + i + 1\n others = sorted([sum(a[j] for j in range(m) if s[k][j] == \"o\") + k + 1 for k in range(n) if k != i])[-2]\n diff = others - score\n cnt = 0\n for j in range(m):\n if s[i][j] == \"x\" and a[j] >= diff:\n cnt += 1\n diff = 0\n break\n elif s[i][j] == \"x\":\n cnt += 1\n diff -= a[j]\n print(cnt)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\ns = [input() for _ in range(n)]\n\nfor i in range(n):\n score = sum(a[j] for j in range(m) if s[i][j] == \"o\") + i + 1\n others = [\n sum(a[j] for j in range(m) if s[k][j] == \"o\") + k + 1 for k in range(n) if k != i\n ]\n print(len(others) - (sum(1 for x in others if x <= score) > 0))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = []\nfor i in range(n):\n s, c = map(int, input().split())\n a.append([s, c])\na.sort(key=lambda x: x[0])\nans = 0\nfor i in range(n):\n if a[i][1] % 2 == 1:\n ans += 1\nprint(ans + (n + 1) // 2)", "n = int(input())\na = []\nfor i in range(n):\n s, c = map(int, input().split())\n a.append([s, c])\na.sort(key=lambda x: x[0])\nans = 0\nfor i in range(n):\n if a[i][1] % 2 == 1:\n ans += 1\nprint(ans + (n + 1) // 2)", "n = int(input())\na = []\nfor i in range(n):\n s, c = map(int, input().split())\n a.append([s, c])\na.sort(key=lambda x: x[0])\nans = 0\nfor i in range(n):\n if a[i][1] % 2 == 1:\n ans += 1\nprint(ans + (n + 1) // 2)", "n = int(input())\na = []\nfor i in range(n):\n s, c = map(int, input().split())\n a.append([s, c])\na.sort(key=lambda x: x[0])\nans = 0\nfor i in range(n):\n if a[i][1] % 2 == 1:\n ans += 1\nprint(ans + (n + 1) // 2)", "n = int(input())\na = []\nfor i in range(n):\n s, c = map(int, input().split())\n a.append([s, c])\na.sort(key=lambda x: x[0])\n\nans = 0\nfor i in range(n):\n if a[i][1] % 2 == 1:\n ans += 1\nprint(ans + (n + 1) // 2)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nsc = [list(map(int, input().split())) for i in range(n)]\nsc.sort(key=lambda x: x[0])\nans = 0\nfor i in range(n):\n if sc[i][1] % 2 == 0:\n sc[i][1] //= 2\n ans += 1\nprint(ans + len(set(sc)))", "def main():\n n = int(input())\n a = []\n for i in range(n):\n s, c = map(int, input().split())\n a.append((s, c))\n a.sort()\n cnt = 0\n for s, c in a:\n if c % 2 == 1:\n cnt += 1\n print(cnt)\n\n\nmain()", "n = int(input())\na = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append([x, y])\na.sort()\nans = 0\nfor i in range(n):\n if a[i][1] % 2 == 1:\n ans += 1\nprint(ans + (n + 1) // 2)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\ns = []\nfor i in range(n):\n si, ci = list(map(int, input().split()))\n s.append([si, ci])\ns.sort()\nans = 0\nfor i in range(n):\n if s[i][1] % 2 == 0:\n ans += 1\n else:\n ans += 2\nprint(ans)", "n = int(input())\na = []\nfor i in range(n):\n s, c = map(int, input().split())\n a.append([s, c])\na.sort()\nans = 0\nfor i in range(n):\n if a[i][1] % 2 == 1:\n ans += 1\nprint(ans + (n + 1) // 2)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "def modinv(a, m):\n return pow(a, m - 2, m)\n\n\ndef main():\n n, x = map(int, input().split())\n t = list(map(int, input().split()))\n t1 = t[0]\n t.append(t1)\n t.sort()\n l = len(t)\n m = 998244353\n ans = 0\n for i in range(l):\n if t[i] <= x:\n ans += modinv(n, m)\n n -= 1\n if t[i] <= x + 0.5:\n ans -= modinv(n, m)\n print(ans % m)\n\n\nmain()", "import sys\n\ninput = sys.stdin.readline\n\nmod = 998244353\n\nn, x = map(int, input().split())\nt = list(map(int, input().split()))\n\nt1 = t[0]\n\ndp = [0] * (x + 1)\ndp[0] = 1\n\nfor i in range(n):\n for j in range(x, t[i] - 1, -1):\n dp[j] += dp[j - t[i]]\n dp[j] %= mod\n\nans = 0\nfor i in range(t1 - 1, x + 1, t1):\n ans += dp[i]\n ans %= mod\n\nprint(ans * pow(n, mod - 2, mod) % mod)", "def main():\n mod = 998244353\n (n, x) = map(int, input().split())\n t = list(map(int, input().split()))\n t.sort()\n t.insert(0, 0)\n t.append(x + 1)\n cnt = 0\n for i in range(n):\n if t[i + 1] - t[i] == t[1]:\n cnt += 1\n ans = pow(n, mod - 2, mod) * (n * t[1] - cnt) % mod\n print(ans)\n\n\nmain()", "import sys\n\ninput = sys.stdin.readline\n\nmod = 998244353\n\nn, x = map(int, input().split())\nt = list(map(int, input().split()))\n\nt1 = t[0]\n\ndp = [0] * (x + 1)\ndp[0] = 1\n\nfor i in range(n):\n for j in range(x, t[i] - 1, -1):\n dp[j] += dp[j - t[i]]\n dp[j] %= mod\n\nans = 0\nfor i in range(t1 - 1, x + 1, t1):\n ans += dp[i]\n ans %= mod\n\nprint(ans * (n * pow(n - 1, mod - 2, mod)) % mod)", "from collections import defaultdict\nimport sys\n\nmod = 998244353\n(n, x) = map(int, sys.stdin.readline().split())\nt = list(map(int, sys.stdin.readline().split()))\nd = defaultdict(int)\nfor i in t:\n d[i] += 1\nd[0] = 1\ns = sum(t)\np = [0] * (s + 1)\np[0] = 1\nfor i in d:\n for j in range(s, i - 1, -1):\n p[j] = (p[j] + p[j - i] * d[i]) % mod\nans = 0\nfor i in range(x + 1):\n ans = (ans + p[x - i] * p[i]) % mod\nprint((ans * n) % mod)", "import sys\n\ninput = sys.stdin.readline\n\nmod = 998244353\n\nn, x = map(int, input().split())\nt = list(map(int, input().split()))\n\nt1 = t[0]\n\ndp = [0] * (x + 1)\ndp[0] = 1\n\nfor i in range(n):\n for j in range(x, t[i] - 1, -1):\n dp[j] += dp[j - t[i]]\n dp[j] %= mod\n\nans = 0\nfor i in range(t1, x + 1, t1):\n ans += dp[i]\n ans %= mod\n\nprint(ans * (n * pow(n - 1, mod - 2, mod)) % mod)", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\n\n\ndef mul(a, b):\n return (a * b) % mod\n\n\ndef add(a, b):\n return (a + b) % mod\n\n\ndef sub(a, b):\n return (a - b + mod) % mod\n\n\ndef inv(x):\n return pow(x, mod - 2, mod)\n\n\ndef prob(x, y, z):\n return mul(mul(x, y), inv(z))\n\n\ndef main():\n n, x = map(int, input().split())\n t = list(map(int, input().split()))\n t.sort()\n if x < t[0]:\n print(0)\n return\n if x == t[0]:\n print(inv(n))\n return\n if x > t[-1] * n:\n print(0)\n return\n l = 0\n r = x\n while r - l > 1:\n m = (l + r) // 2\n if m // t[-1] >= n:\n r = m\n else:\n l = m\n x -= l\n ans = 0\n for i in range(n):\n if x < t[i]:\n ans = add(ans, prob(n - i, t[i] - x, t[-1]))\n else:\n ans = add(ans, prob(n - i, t[i], t[-1]))\n print(ans)\n\n\nmain()", "def power(x, y, p):\n res = 1\n x = x % p\n if x == 0:\n return 0\n while y > 0:\n if (y & 1) == 1:\n res = (res * x) % p\n y = y >> 1\n x = (x * x) % p\n return res\n\n\ndef inverse(b, p):\n return power(b, p - 2, p)\n\n\ndef gcd(a, b):\n if b == 0:\n return a\n else:\n return gcd(b, a % b)\n\n\ndef extendedEuclid(a, b):\n if a == 0:\n return (b, 0, 1)\n else:\n g, y, x = extendedEuclid(b % a, a)\n return (g, x - (b // a) * y, y)\n\n\ndef modInverse(a, m):\n g, x, y = extendedEuclid(a, m)\n if g != 1:\n raise Exception(\"Inverse doesn't exist\")\n else:\n return x % m\n\n\nmod = 998244353\nn, x = map(int, input().split())\nt = list(map(int, input().split()))\nt1 = t[0]\nt.remove(t1)\nt.append(t1)\ns = sum(t)\np = [0] * (x + 1)\np[0] = 1\nfor i in t:\n for j in range(i - 1, -1, -1):\n p[j] = (p[j] + p[j + 1]) % mod\nfor i in range(1, x + 1):\n p[i] = p[i] * n % mod\ns = s * modInverse(n, mod) % mod\nans = 0\nfor i in range(t1 - 1, -1, -1):\n if i + 0.5 > x:\n break\n ans = (ans + p[i] * inverse(t1 - i, mod)) % mod\nprint(ans)", "", "def modinv(n, p):\n return pow(n, p - 2, p)\n\n\ndef main():\n n, x = map(int, input().split())\n t = list(map(int, input().split()))\n t1 = t[0]\n t.append(t1)\n t.sort()\n t.append(t1 + x)\n m = 998244353\n s = 0\n for i in range(n + 1):\n if t[i] <= t1 + x // 2 < t[i + 1]:\n s += modinv(i + 1, m) * modinv(n - i, m)\n s %= m\n print(s)\n\n\nmain()" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\na = list(map(int, input().split()))\r\nif len(set(a)) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nif len(set(a)) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nif len(set(a)) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nif len(set(a)) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nif len(set(a)) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nif len(set(a)) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nif len(set(a)) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nif len(set(a)) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nif len(set(a)) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nif len(set(a)) == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "import math\n\nn = int(input())\n\nfor i in range(100):\r\n for j in range(100):\r\n if 2**i * 3**j == n:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")", "n = int(input())\nfor i in range(100):\n for j in range(100):\n if 2**i * 3**j == n:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n = int(input())\nfor i in range(100):\n for j in range(100):\n if 2**i * 3**j == n:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n = int(input())\nfor i in range(100):\n for j in range(100):\n if 2**i * 3**j == n:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n = int(input())\nfor i in range(100):\n for j in range(100):\n if 2**i * 3**j == n:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n = int(input())\nfor i in range(100):\n for j in range(100):\n if 2**i * 3**j == n:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n = int(input())\nfor i in range(100):\n for j in range(100):\n if 2**i * 3**j == n:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n = int(input())\nfor i in range(100):\n for j in range(100):\n if 2**i * 3**j == n:\n print(\"Yes\")\n exit()\nprint(\"No\")", "import math\n\nn = int(input())\n\nfor i in range(100):\r\n for j in range(100):\r\n if 2**i * 3**j == n:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")", "n = int(input())\nfor i in range(100):\n for j in range(100):\n if 2**i * 3**j == n:\n print(\"Yes\")\n exit()\nprint(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN, T = input().split()\nN = int(N)\n\nT_len = len(T)\n\nans = []\nfor i in range(N):\n S = input().strip()\n S_len = len(S)\n if abs(S_len - T_len) > 1:\n continue\n if S_len > T_len:\n if S[: T_len] == T or S[1 : T_len + 1] == T:\n ans.append(i + 1)\n elif S_len < T_len:\n if T[:S_len] == S or T[1 : S_len + 1] == S:\n ans.append(i + 1)\n else:\n if S == T:\n ans.append(i + 1)\n elif sum(a != b for a, b in zip(S, T)) == 1:\n ans.append(i + 1)\n\nprint(len(ans))\nprint(*ans)", "import sys\n\ninput = sys.stdin.readline\n\n\ndef solve(n, t, s):\n ans = []\n for i in range(n):\n if len(s[i]) == len(t) + 1:\n if t in s[i]:\n ans.append(i + 1)\n if len(s[i]) == len(t) - 1:\n if any(t[:j] + t[j + 1 :] == s[i] for j in range(len(t))):\n ans.append(i + 1)\n if len(s[i]) == len(t):\n if sum(a == b for a, b in zip(t, s[i])) == len(t) - 1:\n ans.append(i + 1)\n if s[i] == t:\n ans.append(i + 1)\n return ans\n\n\nn = int(input())\nt = input().strip()\ns = [input().strip() for _ in range(n)]\nans = solve(n, t, s)\nprint(len(ans))\nprint(*ans)", "import sys\n\ninput = sys.stdin.readline\n(N, T) = input().split()\nN = int(N)\nT = T[::-1]\nL = []\nfor i in range(N):\n L.append(input().rstrip()[::-1])\nL.append(T)\nL.sort()\nans = []\nfor i in range(N + 1):\n if L[i] == T:\n ans.append(i)\n elif L[i].startswith(T) and len(L[i]) == len(T) + 1:\n ans.append(i)\n elif T.startswith(L[i]) and len(L[i]) == len(T) - 1:\n ans.append(i)\n elif L[i].startswith(T[:-1]) and L[i].endswith(T[-1]) and len(L[i]) == len(T):\n ans.append(i)\nprint(len(ans))\nprint(*[i + 1 for i in ans])", "import sys\n\ninput = sys.stdin.readline\n\nN, T = input().split()\nN = int(N)\n\nT = T.strip()\n\nL = []\nfor i in range(N):\n L.append(input().strip())\n\nans = []\nfor i in range(N):\n S = L[i]\n if len(S) == len(T) + 1:\n for j in range(len(S)):\n if S[:j] + S[j + 1 :] == T:\n ans.append(i + 1)\n break\n elif len(S) == len(T) - 1:\n for j in range(len(S)):\n if S[:j] + S[j + 1 :] == T:\n ans.append(i + 1)\n break\n elif len(S) == len(T):\n flag = 0\n for j in range(len(S)):\n if S[j] != T[j]:\n if flag:\n break\n else:\n flag = 1\n else:\n ans.append(i + 1)\n elif len(S) < len(T) - 1 or len(S) > len(T) + 1:\n continue\n else:\n flag = 0\n for j in range(len(S)):\n if S[j] != T[j] and S[j] != T[j - 1]:\n if flag:\n break\n else:\n flag = 1\n else:\n ans.append(i + 1)\n\nprint(len(ans))\nprint(*ans)", "import sys\n\ninput = sys.stdin.readline\n(N, T) = map(str, input().split())\nS = [input().strip() for i in range(int(N))]\nT = set(T)\nans = []\nfor i in range(N):\n if len(S[i]) == len(T) - 1:\n if set(S[i]) <= T:\n ans.append(i + 1)\n elif len(S[i]) == len(T):\n if set(S[i]) == T:\n ans.append(i + 1)\n elif len(S[i]) == len(T) + 1:\n for j in range(len(S[i])):\n if set(S[i][:j] + S[i][j + 1 :]) == T:\n ans.append(i + 1)\n break\nprint(len(ans))\nprint(*ans)", "import sys\n\ninput = sys.stdin.readline\n(n, t) = map(str, input().split())\ns = [input().strip() for i in range(n)]\nt = [i for i in t]\nans = []\nfor i in range(n):\n if len(s[i]) == len(t) - 1:\n if all(x == y for x, y in zip(s[i], t[: len(s[i])])):\n ans.append(i + 1)\n if all(x == y for x, y in zip(s[i], t[1:])):\n ans.append(i + 1)\n if len(s[i]) == len(t) + 1:\n for j in range(len(t) + 1):\n if all(\n x == y for x, y in zip(s[i][:j], t[:j])\n ) and all(x == y for x, y in zip(s[i][j:], t[j:])):\n ans.append(i + 1)\n break\n if len(s[i]) == len(t):\n flag = 0\n for j in range(len(t)):\n if s[i][j] != t[j]:\n if flag == 1:\n break\n else:\n flag = 1\n else:\n ans.append(i + 1)\nprint(len(ans))\nprint(*ans)", "import sys\n\ninput = sys.stdin.readline\n(N, T) = map(str, input().split())\nS = [input().strip() for i in range(int(N))]\nT = [c for c in T]\nT_len = len(T)\nS_len = len(S)\nans = []\nfor i in range(S_len):\n s = S[i]\n s = [c for c in s]\n s_len = len(s)\n if s_len == T_len:\n flag = 0\n for j in range(s_len):\n if s[j] != T[j]:\n flag = 1\n break\n if flag == 0:\n ans.append(i + 1)\n elif s_len == T_len + 1:\n flag = 0\n for j in range(s_len):\n if j < T_len and s[j] != T[j]:\n flag = 1\n break\n elif j >= T_len:\n if j - 1 >= 0 and s[j - 1] != T[j - 1]:\n flag = 1\n break\n elif j + 1 < s_len and s[j + 1] != T[j - 1]:\n flag = 1\n break\n if flag == 0:\n ans.append(i + 1)\n elif s_len == T_len - 1:\n flag = 0\n for j in range(s_len):\n if j < T_len and s[j] != T[j]:\n flag = 1\n break\n if flag == 0:\n ans.append(i + 1)\n else:\n flag = 0\n for j in range(s_len):\n if j < T_len and s[j] != T[j]:\n flag = 1\n break\n elif j >= T_len:\n if j - 1 >= 0 and s[j - 1] != T[j - 1]:\n flag = 1\n break\n elif j + 1 < T_len and s[j + 1] != T[j]:\n flag = 1\n break\n if flag == 0:\n ans.append(i + 1)\nprint(len(ans))\nprint(*ans)", "import sys\n\ninput = sys.stdin.readline\n(N, T) = map(str, input().split())\nS = [input().strip() for i in range(int(N))]\nTlen = len(T)\nans = []\nfor i in range(N):\n if len(S[i]) == Tlen:\n ans.append(i + 1)\n elif len(S[i]) == Tlen + 1:\n for j in range(len(S[i])):\n if S[i][j] == T[0] and S[i][len(S[i]) - 1] == T[len(T) - 1]:\n ans.append(i + 1)\n break\n elif S[i][j] == T[len(T) - 1] and S[i][len(S[i]) - 1] == T[0]:\n ans.append(i + 1)\n break\n elif j < len(S[i]) - 1 and S[i][j] == T[0] and S[i][j + 1] == T[len(T) - 1]:\n ans.append(i + 1)\n break\n elif j < len(S[i]) - 1 and S[i][j] == T[len(j)] and S[i][j + 1] == T[len(T) - 1]:\n ans.append(i + 1)\n break\n elif len(S[i]) == Tlen - 1:\n for j in range(len(T)):\n if S[i][j] != T[j]:\n if j == len(S[i]):\n ans.append(i + 1)\n break\n else:\n break\n else:\n ans.append(i + 1)\n elif len(S[i]) == Tlen:\n cnt = 0\n for j in range(len(T)):\n if S[i][j] != T[j]:\n cnt += 1\n if cnt > 1:\n break\n else:\n ans.append(i + 1)\nprint(len(ans))\nprint(*ans)", "import sys\n\ninput = sys.stdin.readline\n(N, T) = input().split()\nN = int(N)\nT = T.strip()\nT_len = len(T)\nT_set = set(T)\nT_count = [0] * 26\nfor i in T:\n T_count[ord(i) - ord(\"a\")] += 1\nS = []\nfor i in range(N):\n S.append(input().strip())\nS_len = [len(s) for s in S]\nans = []\nfor i in range(N):\n s = S[i]\n s_len = S_len[i]\n if s_len == T_len:\n if s == T:\n ans.append(i + 1)\n else:\n s_count = [0] * 26\n for j in s:\n s_count[ord(j) - ord(\"a\")] += 1\n if s_count == T_count:\n ans.append(i + 1)\n elif s_len == T_len + 1:\n for j in range(s_len):\n if s[:j] + s[j + 1 :] == T:\n s_count = [0] * 26\n for k in s:\n s_count[ord(k) - ord(\"a\")] += 1\n if s_count == T_count:\n ans.append(i + 1)\n break\n elif s_len == T_len - 1:\n for j in range(s_len):\n if s[:j] + s[j + 1 :] == T:\n s_count = [0] * 26\n for k in s:\n s_count[ord(k) - ord(\"a\")] += 1\n if s_count == T_count:\n ans.append(i + 1)\n break\n elif s_len == T_len - 2:\n for j in range(s_len):\n for k in range(j + 1, s_len):\n if s[:j] + s[j + 1 : k] + s[k + 1 :] == T:\n s_count = [0] * 26\n for l in s:\n s_count[ord(l) - ord(\"a\")] += 1\n if s_count == T_count:\n ans.append(i + 1)\n break\nprint(len(ans))\nprint(*ans)", "import sys\n\ninput = sys.stdin.readline\n(N, T) = map(str, input().split())\nS = [input().strip() for i in range(int(N))]\nans = []\nfor i in range(N):\n if len(S[i]) == len(T) - 1 and S[i] in T:\n ans.append(i + 1)\n if len(S[i]) == len(T) and S[i] == T:\n ans.append(i + 1)\n if len(S[i]) == len(T) + 1 and T in S[i]:\n ans.append(i + 1)\n if len(S[i]) == len(T) and sum([1 for j in range(len(T)) if T[j] != S[i][j]]) == 1:\n ans.append(i + 1)\nprint(len(ans))\nprint(*ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "def main():\n n = int(input())\n s = input()\n count = 0\n for i in range(1, 10000):\n if i**0.5 % 1 == 0:\n t = str(i**0.5)\n if len(t) <= n:\n if len(t) < n:\n t = \"0\" * (n - len(t)) + t\n if n == 1:\n if s == t:\n count += 1\n else:\n for j in range(n):\n for k in range(n):\n if j != k:\n if s[j] in t and s[k] in t:\n t = list(t)\n t[j] = s[k]\n t[k] = s[j]\n t = \"\".join(t)\n if t == s:\n count += 1\n break\n else:\n continue\n print(count)\n\n\nmain()", "def is_square(n):\r\n root = int(n**0.5)\r\n return root * root == n\r\n\r\n\r\ndef solve(s):\r\n n = len(s)\r\n if n == 1:\r\n return 1 if is_square(int(s)) else 0\r\n if n == 2:\r\n return 2 if s[0] == s[1] and is_square(int(s[0]) * 10 + int(s[1])) else 1\r\n ans = 0\r\n for i in range(n):\r\n if i > 0 and s[i - 1] == s[i]:\r\n continue\r\n for j in range(i + 1, n):\r\n if j > i + 1 and s[j - 1] == s[j]:\r\n continue\r\n t = s[:i] + s[i + 1 : j] + s[i] + s[j + 1 :]\r\n ans += solve(t)\r\n return ans\r\n\r\n\r\nn = int(input())\r\ns = input()\r\nprint(solve(s))\r", "from itertools import permutations\n\nn = int(input())\ns = input()\n\ncount = 0\nfor p in permutations(s):\n num = int(\"\".join(p))\n if num**0.5 % 1 == 0:\n count += 1\nprint(count)", "from collections import Counter\n\nn = int(input())\ns = input()\nc = Counter(s)\n\nans = 0\nfor i in range(1, int(10 ** (n - 1) ** 0.5) + 1):\n if i ** 2 > 10 ** (n - 1):\n break\n if c[str(i)] > 0:\n for j in range(1, 10):\n if c[str(j)] > 0:\n if j ** 2 > 10 ** (n - 1):\n break\n if c[str(i)] + c[str(j)] > n:\n continue\n ans += c[str(i)] * c[str(j)] // (c[str(i)] + c[str(j)]) * (\n c[str(i)] + c[str(j)] - 1\n )\n for k in range(3, 10):\n if c[str(k)] > 0:\n if k**2 > 10 ** (n - 2):\n break\n if c[str(i)] + c[str(j)] + c[str(k)] > n:\n continue\n ans -= (\n c[str(i)]\n * c[str(j)]\n * c[str(k)]\n * (c[str(i)] + c[str(j)] + c[str(k)] - 1)\n * (c[str(i)] + c[str(j)] + c[str(k)] - 2)\n // (c[str(i)] + c[str(j)])\n // (c[str(i)] + c[str(j)] + 1)\n )\n for l in range(4, 10):\n if c[str(l)] > 0:\n if l**2 > 10 ** (n - 3):\n break\n if (\n c[str(i)]\n + c[str(j)]\n + c[str(k)]\n + c[str(l)]\n > n\n ):\n continue\n ans += (\n c[str(i)]\n * c[str(j)]\n * c[str(k)]\n * c[str(l)]\n * (c[str(i)] + c[str(j)] + c[str(k)] + c[str(l)] - 1)\n * (\n c[str(i)]\n + c[str(j)]\n + c[str(k)]\n + c[str(l)]\n - 2\n )\n * (\n c[str(i)]\n + c[str(j)]\n + c[str(k)]\n + c[str(l)]\n - 3\n )\n // (c[str(i)] + c[str(j)])\n // (c[str(i)] + c[str(j)] + 1)\n // (c[str(i)] + c[str(j)] + c[str(k)] + 1)\n )\n ans //= 2\nprint(ans)", "def is_square(n):\r\n root = int(n**0.5)\r\n return root * root == n\r\n\r\n\r\ndef solve(n, s):\r\n count = 0\r\n for p in range(factorial(n)):\r\n perm = [0] * n\r\n for i in range(n):\r\n perm[i] = s[i ^ p]\r\n num = 0\r\n for i in range(n):\r\n num = num * 10 + perm[i]\r\n if is_square(num):\r\n count += 1\r\n return count\r\n\r\n\r\ndef factorial(n):\r\n if n == 0:\r\n return 1\r\n return n * factorial(n - 1)\r\n\r\n\r\nn = int(input())\r\ns = input()\r\nprint(solve(n, s))\r", "from math import sqrt\n\nn = int(input())\ns = input()\n\ncount = 0\n\nfor i in range(1, 10 ** (n // 2 + 1)):\n if i**2 > 10**n:\n break\n if i**0.5 % 1 == 0:\n for j in range(n):\n if str(i % 10) in s:\n i = i // 10\n s = s.replace(str(i % 10), \"\", 1)\n else:\n break\n else:\n count += 1\nprint(count)", "from collections import Counter\nfrom math import sqrt\n\nn = int(input())\ns = input()\n\ncount = Counter(s)\n\nans = 0\nfor i in range(1, int(sqrt(int(s) + 1e-9)) + 1):\n if i**2 > 10**n:\n break\n if i**2 % 11 == 0 and count[0] > 1:\n ans += 1\n elif i**2 % 11 != 0 and count[0] > 0:\n ans += 1\n if count[str(i)] > 0:\n ans += count[str(i)] * (count[str(i)] - 1) // 2\n\nprint(ans)", "def is_square(n):\r\n return n**0.5 % 1 == 0\r\n\r\n\r\ndef get_perm(s, n):\r\n if n == 1:\r\n yield s\r\n else:\r\n for i in range(n):\r\n for p in get_perm(s[:i] + s[n - 1 : i] + s[i + 1 : n - 1] + s[i : n], n - 1):\r\n yield s[n - 1] + p\r\n\r\n\r\ndef solve(n, s):\r\n cnt = 0\r\n for p in get_perm(s, n):\r\n num = int(p)\r\n if is_square(num):\r\n cnt += 1\r\n return cnt\r\n\r\n\r\nn = int(input())\r\ns = input()\r\nprint(solve(n, s))\r", "from collections import Counter\n\nn = int(input())\ns = input()\nc = Counter(s)\nans = 0\nfor i in range(1, int(10 ** (0.5) + 1)):\n if i**2 > int(s) and c[str(i)]:\n continue\n if i**2 == int(s):\n ans += 1\n continue\n if c[\"0\"] > 1:\n continue\n if i**2 % 10 == 0 and c[\"0\"] == 0:\n continue\n if i**2 % 10 != 0 and c[\"0\"] == 1:\n c[\"0\"] -= 1\n if i**2 % 11 == 0 and c[\"1\"] > 1:\n c[\"1\"] -= 1\n if i**2 % 11 != 0 and c[\"1\"] > 0:\n c[\"1\"] -= 1\n if i**2 % 100 == 0 and c[\"0\"] > 1:\n c[\"0\"] -= 1\n if i**2 % 100 != 0 and c[\"0\"] > 0:\n c[\"0\"] -= 1\n if i**2 % 101 == 0 and c[\"1\"] > 1:\n c[\"1\"] -= 1\n if i**2 % 101 != 0 and c[\"1\"] > 0:\n c[\"1\"] -= 1\n if i**2 % 1000 == 0 and c[\"0\"] > 1:\n c[\"0\"] -= 1\n if i**2 % 1000 != 0 and c[\"0\"] > 0:\n c[\"0\"] -= 1\n if i**2 % 1001 == 0 and c[\"1\"] > 1:\n c[\"1\"] -= 1\n if i**2 % 1001 != 0 and c[\"1\"] > 0:\n c[\"1\"] -= 1\n if i**2 % 10000 == 0 and c[\"0\"] > 1:\n c[\"0\"] -= 1\n if i**2 % 10000 != 0 and c[\"0\"] > 0:\n c[\"0\"] -= 1\n if i**2 % 10001 == 0 and c[\"1\"] > 1:\n c[\"1\"] -= 1\n if i**2 % 10001 != 0 and c[\"1\"] > 0:\n c[\"1\"] -= 1\n if i**2 % 100000 == 0 and c[\"0\"] > 1:\n c[\"0\"] -= 1\n if i**2 % 100000 != 0 and c[\"0\"] > 0:\n c[\"0\"] -= 1\n if i**2 % 100001 == 0 and c[\"1\"] > 1:\n c[\"1\"] -= 1\n if i**2 % 100001 != 0 and c[\"1\"] > 0:\n c[\"1\"] -= 1\n if i**2 % 1000000 == 0 and c[\"0\"] > 1:\n c[\"0\"] -= 1\n if i**2 % 1000000 != 0 and c[\"0\"] > 0:\n c[\"0\"] -= 1\n if i**2 % 1000001 == 0 and c[\"1\"] > 1:\n c[\"1\"] -= 1\n if i**2 % 1000001 != 0 and c[\"1\"] > 0:\n c[\"1\"] -= 1\n if i**2 % 10000000 == 0 and c[\"0\"] > 1:\n c[\"0\"] -= 1\n if i**2 % 10000000 != 0 and c[\"0\"] > 0:\n c[\"0\"] -= 1\n if i**2 % 10000001 == 0 and c[\"1\"] > 1:\n c[\"1\"] -= 1\n if i**2 % 10000001 != 0 and c[\"1\"] > 0:\n c[\"1\"] -= 1\n if i**2 % 100000000 == 0 and c[\"0\"] > 1:\n c[\"0\"] -= 1\n if i**2 % 100000000 != 0 and c[\"0\"] > 0:\n c[\"0\"] -= 1\n if i**2 % 100000001 == 0 and c[\"1\"] > 1:\n c[\"1\"] -= 1\n if i**2 % 100000001 != 0 and c[\"1\"] > 0:\n c[\"1\"] -= 1\n if i**2 % 1000000000 == 0 and c[\"0\"] > 1:\n c[\"0\"] -= 1\n if i**2 % 1000000000 != 0 and c[\"0\"] > 0:\n c[\"0\"] -= 1\n if i**2 % 1000000001 == 0 and c[\"1\"] > 1:\n c[\"1\"] -= 1\n if i**2 % 1000000001 != 0 and c[\"1\"] > 0:\n c[\"1\"] -= 1\n if i**2 % 10000000000 == 0 and c[\"0\"] > 1:\n c[\"0\"] -= 1\n if i**2 % 10000000000 != 0 and c[\"0\"] > 0:\n c[\"0\"] -= 1\n if i**2 % 10000000001 == 0 and c[\"1\"] > 1:\n c[\"1\"] -= 1\n if i**2 % 10000000001 != 0 and c[\"1\"] > 0:\n c[\"1\"] -= 1\n if all(v == 0 for v in c.values()):\n ans += 1\nprint(ans)", "from collections import Counter\nfrom math import sqrt\n\nn = int(input())\ns = input()\n\ncount = Counter(s)\n\nans = 0\nfor i in range(1, int(sqrt(int(s) + 1))):\n if i * i > int(s):\n break\n if i * i == int(s) and count[0] == n:\n ans += 1\n continue\n if count[str(i * i)] < count[str(i)]:\n continue\n if count[str(i * i)] > 0 and count[str(i * i)] > count[str(i)]:\n continue\n if count[str(i * i)] == 0 and count[str(i)] % 2 == 1:\n continue\n ans += 1\n\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN, T = map(str, input().split())\nS = [input().rstrip() for i in range(int(N))]\n\nfrom collections import Counter\n\ncounter = Counter(T)\n\nans = 0\n\nfor i in range(len(S)):\n for j in range(i + 1, len(S)):\n if all(S[i].count(k) + S[j].count(k) >= counter[k] for k in counter):\n ans += 1\n\nfor i in range(len(S)):\n if all(S[i].count(k) >= counter[k] for k in counter):\n ans += i\n\nprint(ans)", "from collections import defaultdict\n\nN, T = map(str, input().split())\nS = [input() for _ in range(int(N))]\n\nT_set = set(T)\n\ncnt = defaultdict(int)\nfor s in S:\n for c in s:\n cnt[c] += 1\n\nans = 0\nfor c in T_set:\n ans += cnt[c] * (cnt[c] - 1)\n\nfor s in S:\n t_set = set(T)\n for c in s:\n if c in t_set:\n t_set.remove(c)\n if not t_set:\n ans += N - 1\n\nprint(ans)", "from collections import Counter\n\n(n, t) = map(str, input().split())\ns = [input() for _ in range(int(n))]\n\nt_count = Counter(t)\ns_count = [Counter(x) for x in s]\n\nans = 0\nfor i in range(n):\n for j in range(n):\n if i != j:\n for k, v in t_count.items():\n if s_count[i][k] + s_count[j][k] >= v:\n ans += 1\n else:\n break\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, T = map(str, input().split())\nS = [input().rstrip() for _ in range(int(N))]\n\nfrom collections import Counter\n\nT = Counter(T)\n\nans = 0\nfor i in range(len(S)):\n for j in range(i + 1, len(S)):\n if all(S[i].count(k) + S[j].count(k) >= v for k, v in T.items()):\n ans += 1\n\nfor i in range(len(S)):\n if all(S[i].count(k) >= v for k, v in T.items()):\n ans += i\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, T = map(str, input().split())\nS = [input().rstrip() for i in range(int(N))]\n\nfrom collections import Counter\n\ncounter = Counter(T)\n\nans = 0\nfor i in range(len(S)):\n for j in range(i + 1, len(S)):\n if all(S[i].count(c) + S[j].count(c) >= counter[c] for c in counter):\n ans += 1\n\nfor i in range(len(S)):\n if all(S[i].count(c) >= counter[c] for c in counter):\n ans += i\n\nprint(ans)", "from collections import Counter\n\nN, T = map(str, input().split())\nS = [input() for _ in range(int(N))]\n\nT_count = Counter(T)\nS_count = [Counter(s) for s in S]\n\nans = 0\nfor i in range(int(N)):\n for j in range(int(N)):\n if i != j:\n for c in T:\n if S_count[i][c] + S_count[j][c] > T_count[c]:\n break\n else:\n ans += 1\n\nprint(ans)", "from collections import Counter\r\n\r\nn, t = map(str, input().split())\r\ns = [input() for _ in range(int(n))]\r\n\r\nt_counter = Counter(t)\r\ns_counter = [Counter(si) for si in s]\r\n\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n ans += sum(\r\n min(s_counter[i][ch], s_counter[j][ch]) for ch in t_counter\r\n ) >= t_counter[ch]\r\n\r\nprint(ans)\r", "import sys\n\ninput = sys.stdin.readline\n\nN, T = map(str, input().split())\nS = [input().rstrip() for i in range(int(N))]\n\nfrom collections import Counter\n\ncounter = Counter(T)\n\nans = 0\n\nfor i in range(len(S)):\n for j in range(i + 1, len(S)):\n if all(counter[c] <= S[i].count(c) + S[j].count(c) for c in counter):\n ans += 1\n\nfor i in range(len(S)):\n if all(counter[c] <= S[i].count(c) for c in counter):\n ans += i\n\nprint(ans)", "from collections import defaultdict\n\nN, T = map(str, input().split())\nS = [input() for _ in range(int(N))]\n\nT_set = set(T)\n\ncount = 0\nfor s in S:\n s_set = set(s)\n if T_set.issubset(s_set):\n count += N - 1\n for t in T:\n if t in s_set:\n count += 1\n\nprint(count)", "from collections import defaultdict\n\nN, T = map(str, input().split())\nS = [input() for _ in range(int(N))]\n\nT_index = defaultdict(list)\nfor i, c in enumerate(T):\n T_index[c].append(i)\n\nans = 0\nfor s in S:\n s_index = defaultdict(list)\n for i, c in enumerate(s):\n s_index[c].append(i)\n\n for c in set(T) & set(s):\n for i in s_index[c]:\n for j in T_index[c]:\n if j >= i:\n j += 1\n else:\n ans += 1\n\nfor i in range(len(S)):\n for j in range(i + 1, len(S)):\n if all(\n any(x[0] <= y[0] < x[1] for y in T_index[c])\n for c, x in zip(T, (S[i], S[j]))\n ):\n ans += 1\n\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from heapq import heappop, heappush\n\nN, M = map(int, input().split())\n\ngraph = [[] for _ in range(N)]\n\nfor _ in range(M):\n u, v, b, c = map(int, input().split())\n u, v = u - 1, v - 1\n graph[u].append((v, b, c))\n\ndp = [0] * N\npq = [(float(\"inf\"), 0, 0)]\n\nwhile pq:\n c, b, v = heappop(pq)\n if v == N - 1:\n print(b / c)\n break\n for nv, nb, nc in graph[v]:\n if dp[nv] < b + nb:\n dp[nv] = b + nb\n heappush(pq, (c + nc, b + nb, nv))", "from heapq import heappush, heappop\nfrom sys import stdin\n\ninput = stdin.readline\n\nINF = 10**18\n\nN, M = map(int, input().split())\n\ngraph = [[] for _ in range(N)]\n\nfor _ in range(M):\n u, v, b, c = map(int, input().split())\n u -= 1\n v -= 1\n graph[u].append((v, b, c))\n\ndp = [0] * N\ndp[0] = INF\n\nhq = [(INF, 0)]\n\nwhile hq:\n cv, cu = heappop(hq)\n if cv < dp[cu]:\n continue\n for nv, nb, nc in graph[cu]:\n if dp[nv] < cv * nc - nb:\n dp[nv] = cv * nc - nb\n heappush(hq, (dp[nv], nv))\n\nprint(dp[-1])", "from heapq import heappush, heappop\n\nn, m = map(int, input().split())\ngraph = [[] for _ in range(n)]\nfor _ in range(m):\n u, v, b, c = map(int, input().split())\n u, v = u - 1, v - 1\n graph[u].append((v, b, c))\n\ndp = [float(\"-inf\")] * n\ndp[0] = 0\nhq = [(0, 0)]\nwhile hq:\n r = heappop(hq)\n if r[1] > dp[r[0]]:\n dp[r[0]] = r[1]\n for v, b, c in graph[r[0]]:\n heappush(hq, (v, max(dp[r[0]] * c / b, r[1] * c / b + b)))\n\nprint(dp[-1])", "from heapq import heappop, heappush\n\nn, m = map(int, input().split())\n\ngraph = [[] for _ in range(n)]\n\nfor _ in range(m):\n u, v, b, c = map(int, input().split())\n u -= 1\n v -= 1\n graph[u].append((v, b, c))\n\ndp = [0] * n\ndp[0] = float(\"-inf\")\nhq = [(float(\"inf\"), 0, 0, 0)]\n\nwhile hq:\n g, i, b, c = heappop(hq)\n if i == n - 1:\n print(b / c)\n break\n for j, b2, c2 in graph[i]:\n if dp[j] < b + g / c:\n dp[j] = b + g / c\n heappush(hq, (g / c, j, b + b2, c + c2))", "from heapq import heappop, heappush\n\nN, M = map(int, input().split())\n\ngraph = [[] for _ in range(N)]\n\nfor _ in range(M):\n u, v, b, c = map(int, input().split())\n u, v = u - 1, v - 1\n graph[u].append((v, b, c))\n\ndp = [0] * N\nhq = [(0, 0)]\nvisited = [False] * N\n\nwhile hq:\n b, c = heappop(hq)\n u = c\n\n if visited[u]:\n continue\n\n visited[u] = True\n\n for v, b_new, c_new in graph[u]:\n if not visited[v]:\n heappush(hq, (b + b_new, v))\n dp[v] = max(dp[v], (b + b_new) / (c + c_new))\n\nprint(dp[-1])", "from heapq import heappush, heappop\nfrom sys import stdin\n\ninput = stdin.readline\nN, M = map(int, input().split())\ngraph = [[] for _ in range(N)]\nfor _ in range(M):\n u, v, b, c = map(int, input().split())\n u, v = u - 1, v - 1\n graph[u].append((v, b, c))\n\ndp = [0] * N\npq = [(0, 0, 0)]\nwhile pq:\n ratio, cost, node = heappop(pq)\n if cost > dp[node]:\n continue\n if node == N - 1:\n print(ratio)\n exit()\n for n, b, c in graph[node]:\n heappush(pq, (ratio + b / c, cost + c, n))\n dp[n] = max(dp[n], cost + c)", "from heapq import heappop, heappush\nfrom sys import stdin\n\ninput = stdin.readline\n\nINF = float(\"inf\")\n\nN, M = map(int, input().split())\n\ngraph = [[] for _ in range(N)]\n\nfor _ in range(M):\n u, v, b, c = map(int, input().split())\n u, v = u - 1, v - 1\n graph[u].append((v, b, c))\n\ndp = [0] * N\ndp[0] = 1\n\nhq = [(0, 0)]\n\nwhile hq:\n ratio, node = heappop(hq)\n\n if node == N - 1:\n print(ratio)\n break\n\n for next_node, beauty, cost in graph[node]:\n if dp[next_node] == 0:\n dp[next_node] = 1\n heappush(hq, (ratio + beauty / cost, next_node))", "from heapq import heappop, heappush\n\nn, m = map(int, input().split())\n\ngraph = [[] for _ in range(n)]\n\nfor _ in range(m):\n u, v, b, c = map(int, input().split())\n u, v = u - 1, v - 1\n graph[u].append((v, b, c))\n\ndp = [0] * n\ndp[0] = float(\"-inf\")\nhq = [(float(\"inf\"), 0, 0, 0)]\n\nwhile hq:\n c, b, v, p = heappop(hq)\n dp[v] = max(dp[v], b / c)\n for nv, nb, nc in graph[v]:\n if dp[nv] < b / c + nb / nc:\n dp[nv] = b / c + nb / nc\n heappush(hq, (c + nc, b + nb, nv, v))\n\nprint(dp[-1])", "from heapq import heappush, heappop\nfrom collections import defaultdict\n\nN, M = map(int, input().split())\n\ngraph = defaultdict(list)\nfor _ in range(M):\n u, v, b, c = map(int, input().split())\n graph[u].append((v, b, c))\n\ndp = [0] * (N + 1)\npq = [(0, 1)]\nwhile pq:\n val, node = heappop(pq)\n if dp[node] > val:\n continue\n for n, b, c in graph[node]:\n new_val = val + b / c\n if new_val > dp[n]:\n dp[n] = new_val\n heappush(pq, (new_val, n))\n\nprint(dp[N])", "from heapq import heappop, heappush\n\nN, M = map(int, input().split())\n\ngraph = [[] for _ in range(N)]\n\nfor _ in range(M):\n u, v, b, c = map(int, input().split())\n u, v = u - 1, v - 1\n graph[u].append((v, b, c))\n\ndp = [0] * N\ndp[0] = float(\"inf\")\n\nq = [(float(\"inf\"), 0, 0)]\nwhile q:\n c, i, b = heappop(q)\n if dp[i] < c:\n continue\n for j, b2, c2 in graph[i]:\n if c + c2 < dp[j]:\n dp[j] = c + c2\n heappush(q, (c + c2, j, b + b2))\n\nprint(dp[-1])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s, t = map(str, input().split())\nprint(s + \" san\")", "s, t = map(str, input().split())\nprint(s + \" san\")", "s, t = map(str, input().split())\nprint(s + \" san\")", "s, t = map(str, input().split())\nprint(s + \" san\")", "s, t = map(str, input().split())\nprint(s + \" san\")", "s, t = map(str, input().split())\nprint(s + \" san\")", "s, t = map(str, input().split())\nprint(s + \" san\")", "s, t = input().split()\nprint(s + \" san\")", "s, t = map(str, input().split())\nprint(s + \" san\")", "s, t = map(str, input().split())\nprint(s + \" san\")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "from collections import defaultdict\n\nN = int(input())\nW = defaultdict(int)\nfor _ in range(N):\n w, x = map(int, input().split())\n W[x % 24] += w\n\nans = 0\nfor i in range(9, 18):\n ans += W[i]\nfor i in range(0, 9):\n ans = max(ans, W[i] + W[i + 16])\nfor i in range(18, 24):\n ans = max(ans, W[i] + W[i - 16])\nprint(ans)", "def main():\n n = int(input())\n w = []\n x = []\n for i in range(n):\n w_x = input().split()\n w.append(int(w_x[0]))\n x.append(int(w_x[1]))\n w_9 = []\n w_18 = []\n for i in range(n):\n if 9 <= x[i] <= 17:\n w_9.append(w[i])\n w_18.append(w[i])\n elif x[i] < 9:\n w_9.append(w[i])\n w_18.append(0)\n else:\n w_9.append(0)\n w_18.append(w[i])\n print((sum(w_9) + sum(w_18) - max(w_9 + w_18)))\n\n\nmain()", "n = int(input())\n\nbases = []\nfor i in range(n):\n w, x = map(int, input().split())\n bases.append((x + 9) % 24, w)\n\nbases.sort()\n\ndp = [0] * 24\nfor i in range(24):\n for j in range(i, -1, -1):\n if j - 9 >= 0 and j - 18 < 0:\n dp[i] += bases[j - 9][1]\n else:\n dp[i] += dp[j - 9]\n\nprint(max(dp))", "n = int(input())\nw = []\nx = []\nfor i in range(n):\n a, b = map(int, input().split())\n w.append(a)\n x.append(b)\n\ndp = [[0] * 24 for i in range(n)]\nfor i in range(n):\n for j in range(9, 18):\n if x[i] + j <= 23:\n dp[i][j] = w[i]\n elif x[i] <= 18:\n dp[i][j] = w[i]\n else:\n dp[i][j] = 0\n\nfor i in range(n):\n for j in range(9, 18):\n if x[i] - j >= 0:\n dp[i][j] += dp[i][j - 1]\n\nans = 0\nfor i in range(24):\n for j in range(24):\n if i == j:\n continue\n cnt = 0\n for k in range(n):\n cnt += dp[k][i]\n cnt += dp[k][j]\n ans = max(ans, cnt)\n\nprint(ans)", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\ndp = [[0] * 24 for i in range(n)]\nfor i in range(n):\n for j in range(9, 18):\n dp[i][j] = a[i][0]\n\nfor i in range(n):\n for j in range(9, 24):\n for k in range(j + 1, 18):\n dp[i][k] = max(dp[i][k], dp[i][j])\n\nans = 0\nfor i in range(n):\n for j in range(9, 18):\n ans = max(ans, dp[i][j] + a[i][1] - j)\nprint(ans)", "from collections import defaultdict\n\nN = int(input())\nW = defaultdict(int)\nfor _ in range(N):\n w, x = map(int, input().split())\n W[x % 24] += w\n\nans = 0\nfor i in range(9, 18):\n ans = max(ans, W[i] + W[i - 1] + W[i + 1])\nprint(ans)", "N = int(input())\r\n\r\nbases = []\r\nfor _ in range(N):\r\n W, X = map(int, input().split())\r\n bases.append((W, X))\r\n\r\nmax_workers = 0\r\nfor i in range(24):\r\n workers = 0\r\n for W, X in bases:\r\n if 9 <= X + i < 17:\r\n workers += W\r\n if 0 <= X + i - 9 < 17:\r\n workers += W\r\n max_workers = max(max_workers, workers)\r\n\r\nprint(max_workers)\r", "n = int(input())\nw = []\nx = []\nfor i in range(n):\n a, b = map(int, input().split())\n w.append(a)\n x.append(b)\n\ndp = [[0] * 24 for i in range(n)]\nfor i in range(n):\n for j in range(9, 18):\n if x[i] < j:\n dp[i][j] = w[i]\n elif x[i] > j:\n dp[i][j] = 0\n else:\n dp[i][j] = w[i] // 2\n\nfor i in range(n):\n for j in range(9, 17):\n dp[i][j] += dp[i][j + 1]\n\nans = 0\nfor i in range(24):\n for j in range(24):\n if i > j:\n break\n tmp = 0\n for k in range(n):\n tmp += dp[k][i] - dp[k][j]\n ans = max(ans, tmp)\nprint(ans)", "n = int(input())\n\nbases = []\nfor i in range(n):\n w, x = map(int, input().split())\n bases.append((x + 9) % 24, w)\n\nbases.sort()\n\ndp = [0] * 24\nfor i in range(24):\n for j in range(i, -1, -1):\n if j - 9 >= 0 and j - 18 < 0:\n dp[i] += bases[j - 9][1]\n else:\n dp[i] += dp[j - 9]\n\nprint(max(dp))", "n = int(input())\n\nbases = []\nfor i in range(n):\n w, x = map(int, input().split())\n bases.append((x + 9) % 24, w)\n\nbases.sort()\n\ndp = [0] * 24\nfor i in range(24):\n for j in range(i, -1, -1):\n if j - 9 >= 0 and j - 18 < 0:\n dp[i] += bases[j - 9][1]\n else:\n dp[i] += dp[j - 9]\n\nprint(max(dp))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = [input() for _ in range(h)]\nvisited = [[False] * w for _ in range(h)]\ncount = 0\n\nfor i in range(h):\n for j in range(w):\n if not visited[i][j] and grid[i][j] == \"#\":\n q = deque([(i, j)])\n visited[i][j] = True\n while q:\n (x, y) = q.popleft()\n for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1), (-1, -1), (-1, 1), (1, -1), (1, 1)]:\n nx = x + dx\n ny = y + dy\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and grid[nx][ny] == \"#\":\n q.append((nx, ny))\n visited[nx][ny] = True\n count += 1\n\nprint(count)", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = [input() for _ in range(h)]\nvisited = [[False] * w for _ in range(h)]\ncount = 0\n\nfor i in range(h):\n for j in range(w):\n if not visited[i][j] and grid[i][j] == \"#\":\n q = deque([(i, j)])\n visited[i][j] = True\n while q:\n (x, y) = q.popleft()\n for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1), (-1, -1), (-1, 1), (1, -1), (1, 1)]:\n nx = x + dx\n ny = y + dy\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and grid[nx][ny] == \"#\":\n visited[nx][ny] = True\n q.append((nx, ny))\n count += 1\n\nprint(count)", "from collections import deque\n\n(h, w) = map(int, input().split())\ns = [input() for _ in range(h)]\ng = [[0] * w for _ in range(h)]\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \"#\":\n g[i][j] = 1\n\ndx = [0, 0, 1, -1, 1, 1, -1, -1]\ndy = [1, -1, 0, 0, 1, -1, 1, -1]\n\ncnt = 0\nfor i in range(h):\n for j in range(w):\n if g[i][j]:\n q = deque([(i, j)])\n g[i][j] = 2\n while q:\n (x, y) = q.popleft()\n for k in range(8):\n nx = x + dx[k]\n ny = y + dy[k]\n if 0 <= nx < h and 0 <= ny < w and g[nx][ny] == 1:\n g[nx][ny] = 2\n q.append((nx, ny))\n cnt += 1\nprint(cnt)", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = [input() for _ in range(h)]\nvisited = [[False] * w for _ in range(h)]\ncount = 0\nfor i in range(h):\n for j in range(w):\n if not visited[i][j] and grid[i][j] == \"#\":\n q = deque([(i, j)])\n visited[i][j] = True\n while q:\n (x, y) = q.popleft()\n for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1), (-1, -1), (-1, 1), (1, -1), (1, 1)]:\n nx = x + dx\n ny = y + dy\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and grid[nx][ny] == \"#\":\n visited[nx][ny] = True\n q.append((nx, ny))\n count += 1\nprint(count)", "from collections import deque\n\n(h, w) = map(int, input().split())\ns = [input() for _ in range(h)]\ndx = [-1, 0, 1, -1, 1, -1, 0, 1]\ndy = [-1, -1, -1, 0, 0, 1, 1, 1]\nvisited = [[False] * w for _ in range(h)]\ncnt = 0\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \"#\" and not visited[i][j]:\n q = deque([(i, j)])\n visited[i][j] = True\n while q:\n (x, y) = q.popleft()\n for k in range(8):\n nx = x + dx[k]\n ny = y + dy[k]\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and s[nx][ny] == \"#\":\n visited[nx][ny] = True\n q.append((nx, ny))\n cnt += 1\nprint(cnt)", "from collections import deque\n\n(h, w) = map(int, input().split())\ns = [input() for _ in range(h)]\nd = [(0, 1), (1, 0), (0, -1), (-1, 0), (1, 1), (-1, -1), (1, -1), (-1, 1)]\nvisited = [[False] * w for _ in range(h)]\ncnt = 0\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \"#\" and not visited[i][j]:\n q = deque([(i, j)])\n visited[i][j] = True\n while q:\n x, y = q.popleft()\n for dx, dy in d:\n nx = dx + x\n ny = dy + y\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and s[nx][ny] == \"#\":\n visited[nx][ny] = True\n q.append((nx, ny))\n cnt += 1\nprint(cnt)", "from collections import deque\n\n(h, w) = map(int, input().split())\ns = [input() for _ in range(h)]\ndx = [0, 0, 1, -1, 1, 1, -1, -1]\ndy = [1, -1, 0, 0, 1, -1, 1, -1]\nvisited = [[False] * w for _ in range(h)]\ncnt = 0\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \"#\" and not visited[i][j]:\n q = deque([(i, j)])\n visited[i][j] = True\n while q:\n (x, y) = q.popleft()\n for k in range(8):\n nx = x + dx[k]\n ny = y + dy[k]\n if 0 <= nx < h and 0 <= ny < w and (not visited[nx][ny]) and (s[nx][ny] == \"#\"):\n visited[nx][ny] = True\n q.append((nx, ny))\n cnt += 1\nprint(cnt)", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = [input() for _ in range(h)]\nvisited = [[False] * w for _ in range(h)]\ncount = 0\nfor i in range(h):\n for j in range(w):\n if not visited[i][j] and grid[i][j] == \"#\":\n q = deque([(i, j)])\n visited[i][j] = True\n while q:\n (x, y) = q.popleft()\n for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1), (-1, -1), (-1, 1), (1, -1), (1, 1)]:\n nx = x + dx\n ny = y + dy\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and grid[nx][ny] == \"#\":\n visited[nx][ny] = True\n q.append((nx, ny))\n count += 1\nprint(count)", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = [input() for _ in range(h)]\nvisited = [[False] * w for _ in range(h)]\ncount = 0\nfor i in range(h):\n for j in range(w):\n if not visited[i][j] and grid[i][j] == \"#\":\n q = deque([(i, j)])\n visited[i][j] = True\n while q:\n (x, y) = q.popleft()\n for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1), (-1, -1), (-1, 1), (1, -1), (1, 1)]:\n nx = x + dx\n ny = y + dy\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and grid[nx][ny] == \"#\":\n q.append((nx, ny))\n visited[nx][ny] = True\n count += 1\nprint(count)", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = [input() for _ in range(h)]\nvisited = [[False] * w for _ in range(h)]\ncount = 0\nfor i in range(h):\n for j in range(w):\n if not visited[i][j] and grid[i][j] == \"#\":\n q = deque([(i, j)])\n visited[i][j] = True\n while q:\n (x, y) = q.popleft()\n for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1), (-1, -1), (-1, 1), (1, -1), (1, 1)]:\n nx = x + dx\n ny = y + dy\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and grid[nx][ny] == \"#\":\n q.append((nx, ny))\n visited[nx][ny] = True\n count += 1\nprint(count)" ], "pass1_list": [ true, true, false, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\nfrom bisect import bisect_left, bisect_right\n\nN = int(input())\nT = []\nD = []\nfor i in range(N):\n t, d = map(int, input().split())\n T.append(t)\n D.append(d)\nT.sort()\nD.sort(key=lambda x: -x)\n\nans = 0\ncnt = 0\nfor i in range(N):\n idx = bisect_right(D, T[i] + 1)\n if idx == N:\n break\n if idx - 1 - cnt >= 0:\n ans += 1\n cnt += 1\n else:\n ans += 1\n cnt = 1\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nT = []\nD = []\nfor i in range(N):\n t, d = map(int, input().split())\n T.append(t)\n D.append(d)\nT.sort()\nD.sort(reverse=True)\nans = 0\nfor i in range(N):\n if i == 0:\n ans += 1\n elif T[i] - T[i - 1] > D[i - 1]:\n ans += 1\n elif T[i] - T[i - 1] == D[i - 1]:\n ans += 1\n i += 1\n else:\n ans += 1\n i -= 1\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nT = []\nD = []\nfor i in range(N):\n t, d = map(int, input().split())\n T.append(t)\n D.append(d)\nT.sort()\nD.sort(reverse=True)\n\nans = 0\ncnt = 0\nfor i in range(N):\n if cnt == 0:\n cnt = 1\n ans += 1\n else:\n if T[i] - D[i - 1] > 1:\n cnt = 1\n ans += 1\n else:\n cnt += 1\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nT = []\nD = []\nfor i in range(N):\n t, d = map(int, input().split())\n T.append(t)\n D.append(d)\nT.sort()\nD.sort(reverse=True)\n\nans = 0\ncnt = 0\nfor i in range(N):\n if cnt == 0:\n cnt = 1\n ans += 1\n elif T[i] - D[i] >= 1:\n cnt = 1\n ans += 1\n else:\n cnt += 1\nprint(ans)", "from heapq import heappush, heappop\n\nN = int(input())\nevents = []\nfor _ in range(N):\n T, D = map(int, input().split())\n events.append((T, 1))\n events.append((T + D, -1))\nevents.sort()\n\nactive = 0\nprinted = 0\nheap = []\nfor t, a in events:\n active += a\n if active == 1:\n heappush(heap, t + 1)\n elif active > 1:\n t_next = heappop(heap)\n if t_next < t + 1:\n printed += 1\n heappush(heap, t_next)\n\nprint(printed)", "import sys\n\ninput = sys.stdin.readline\nfrom bisect import bisect_left, bisect_right\n\nN = int(input())\nT = []\nD = []\nfor i in range(N):\n t, d = map(int, input().split())\n T.append(t)\n D.append(d)\nT.sort()\nD.sort(key=lambda x: -x)\n\nans = 0\n\nfor i in range(N):\n idx = bisect_right(T, T[i] + D[i] + 1)\n if idx - i > 1:\n ans += 1\n i = idx - 2\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nfrom bisect import bisect_left, bisect_right\n\nN = int(input())\nT = []\nD = []\nfor i in range(N):\n t, d = map(int, input().split())\n T.append(t)\n D.append(d)\nT.sort()\nD.sort(key=lambda x: -x)\n\nans = 0\ncnt = 0\nfor i in range(N):\n idx = bisect_right(T, T[i] + D[i] + 1)\n if idx - cnt >= 2:\n ans += 1\n cnt = idx\n elif idx - cnt == 1:\n ans += 1\n cnt = idx + 1\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nfrom bisect import bisect_left, bisect_right\n\nN = int(input())\nT = []\nD = []\nfor i in range(N):\n t, d = map(int, input().split())\n T.append(t)\n D.append(d)\nT.sort()\nD.sort()\n\nans = 0\ncnt = 0\nfor i in range(N):\n if T[i] > D[i - cnt]:\n ans += 1\n cnt += 1\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nTD = [list(map(int, input().split())) for i in range(N)]\nTD.sort(key=lambda x: x[0])\n\nans = 0\nnow = 0\nfor i in range(N):\n if now < TD[i][0]:\n now = TD[i][0]\n if now + 1 < TD[i][0] + TD[i][1]:\n now = TD[i][0] + TD[i][1]\n ans += 1\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nfrom bisect import bisect_left, bisect_right\n\nN = int(input())\nTD = [list(map(int, input().split())) for _ in range(N)]\nTD.sort()\n\nevents = []\nfor i in range(N):\n events.append((TD[i][0], i, 1))\n events.append((TD[i][1], i, 0))\nevents.sort()\n\nans = 0\ncnt = 0\nprev = -1\nfor t, i, enter in events:\n if enter:\n if cnt == 0:\n ans += 1\n cnt += 1\n if cnt == 2:\n ans += 1\n else:\n cnt -= 1\n if prev != -1:\n idx = bisect_left(TD, (prev, TD[-1][1]))\n if idx != N:\n if TD[idx][0] > t + 1:\n ans += 1\n cnt = 1\n else:\n cnt = 0\n prev = t\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, a, b, c = map(int, input().split())\nd = [list(map(int, input().split())) for _ in range(n)]\n\nfor i in range(n):\n d[i][0] = 1e18\nd[0][0] = 0\n\nfor i in range(n):\n for j in range(n):\n for k in range(n):\n d[j][k] = min(d[j][k], d[j][i] + d[i][k] * a)\n\nprint(min(d[i][-1] * b + c for i in range(n)))", "import sys\n\ninput = sys.stdin.readline\n\nN, A, B, C = map(int, input().split())\n\nD = [list(map(int, input().split())) for _ in range(N)]\n\nINF = 10**18\n\ndp = [[INF] * N for _ in range(N)]\n\nfor i in range(N):\n dp[i][i] = 0\n\nfor i in range(N):\n for j in range(N):\n dp[i][j] = min(dp[i][j], D[i][j] * A)\n for k in range(N):\n dp[j][k] = min(dp[j][k], dp[i][j] + D[j][k] * B + C)\n\nprint(dp[0][N - 1])", "n, a, b, c = map(int, input().split())\nd = [list(map(int, input().split())) for _ in range(n)]\n\nfor i in range(n):\n d[i][0] = 10**10\nd[0][0] = 0\n\nfor i in range(n):\n for j in range(n):\n for k in range(n):\n d[j][k] = min(d[j][k], d[j][i] * a + d[i][k] * a)\n\nprint(min(d[i][n - 1] * a + c + b * d[i][n - 1] for i in range(n)))", "n, a, b, c = map(int, input().split())\nd = [list(map(int, input().split())) for _ in range(n)]\n\nfor i in range(n):\n d[i][0] = 1e18\nd[0][0] = 0\n\nfor i in range(n):\n for j in range(n):\n for k in range(n):\n d[j][k] = min(d[j][k], d[j][i] + d[i][k] * a)\n\nprint(min(d[i][-1] * b + c for i in range(n)))", "import sys\n\ninput = sys.stdin.readline\n\nN, A, B, C = map(int, input().split())\n\nD = [list(map(int, input().split())) for _ in range(N)]\n\nINF = float(\"inf\")\ndp = [[INF] * 2 for _ in range(N)]\n\ndp[0][0] = 0\n\nfor i in range(N):\n for j in range(N):\n if D[i][j] == 0:\n continue\n if i == 0:\n dp[j][0] = min(dp[j][0], D[i][j] * A)\n else:\n dp[j][0] = min(dp[j][0], dp[i][0] + D[i][j] * A)\n dp[j][1] = min(dp[j][1], dp[i][0] + D[i][j] * B + C)\n\nprint(min(dp[N - 1]))", "n, a, b, c = map(int, input().split())\nd = [list(map(int, input().split())) for _ in range(n)]\n\nfor i in range(n):\n d[i][0] = 1e18\nd[0][0] = 0\n\nfor i in range(n):\n for j in range(n):\n for k in range(n):\n d[j][k] = min(d[j][k], d[j][i] + d[i][k] * a)\n\nans = 1e18\nfor i in range(n):\n ans = min(ans, d[i][n - 1] * a + (b * d[i][n - 1] + c))\nprint(int(ans))", "n, a, b, c = map(int, input().split())\nd = [list(map(int, input().split())) for _ in range(n)]\n\ninf = 10**18\ndp = [[inf] * 2 for _ in range(n)]\ndp[0][0] = 0\n\nfor i in range(n):\n for j in range(n):\n if d[i][j] == 0:\n continue\n if a < b:\n dp[j][0] = min(dp[j][0], dp[i][0] + d[i][j] * a)\n dp[j][1] = min(dp[j][1], dp[i][0] + d[i][j] * a)\n else:\n dp[j][1] = min(dp[j][1], dp[i][0] + d[i][j] * a)\n if i != 0:\n dp[j][1] = min(dp[j][1], dp[i][1] + d[i][j] * a)\n dp[j][1] = min(dp[j][1], dp[i][1] + d[i][j] * b + c)\n\nprint(min(dp[n - 1]))", "n, a, b, c = map(int, input().split())\nd = [list(map(int, input().split())) for _ in range(n)]\n\nfor i in range(n):\n d[i][0] = 1e18\nd[0][0] = 0\nfor i in range(n):\n for j in range(n):\n for k in range(n):\n d[j][k] = min(d[j][k], d[j][i] * a + d[i][k] * a)\n if j != i:\n d[j][k] = min(d[j][k], d[j][i] * a + d[i][k] * b + c)\n\nprint(int(d[n - 1][0]))", "import sys\n\ninput = sys.stdin.readline\n\nN, A, B, C = map(int, input().split())\n\nD = [list(map(int, input().split())) for _ in range(N)]\n\nINF = 10**18\n\ndp = [[INF] * N for _ in range(N)]\n\nfor i in range(N):\n dp[i][i] = 0\n\nfor i in range(N):\n for j in range(N):\n dp[i][j] = min(dp[i][j], dp[i][j] + D[i][k] * A + D[k][j] * A)\n dp[i][j] = min(dp[i][j], dp[i][k] + D[k][j] * B + C)\n dp[i][j] = min(dp[i][j], dp[i][k] + D[k][j] * A + D[j][k] * B + C)\n for k in range(N):\n dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j])\n\nprint(dp[0][N - 1])", "n, a, b, c = map(int, input().split())\nd = [list(map(int, input().split())) for _ in range(n)]\n\nfor i in range(n):\n d[i][0] = 1e18\nd[0][0] = 0\nfor i in range(n):\n for j in range(n):\n for k in range(n):\n d[j][k] = min(d[j][k], d[j][i] * a + d[i][k] * a, d[j][i] * a + d[i][k] * (b + c))\nprint(int(d[n - 1][-1]))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nD = [int(i) for i in input().split()]\nL = [list(map(int, input().split())) for i in range(2)]\n\ndp = [[10**18] * (N + 1) for i in range(2)]\nfor i in range(2):\n dp[i][0] = 0\n\nfor i in range(N):\n for j in range(2):\n if L[j][2] > 0:\n if D[i] % L[j][0] == 0:\n dp[j][i + 1] = min(dp[j][i + 1], dp[j][i] + L[j][1] * (D[i] // L[j][0]))\n L[j][2] -= 1\n for k in range(1, D[i] // L[j][0] + 1):\n dp[j][i + 1] = min(dp[j][i + 1], dp[j][i - k] + L[j][1] * k)\n\nans = 10**18\nfor i in range(2):\n for j in range(N + 1):\n ans = min(ans, dp[i][j])\n\nif ans >= 10**18:\n print(-1)\nelse:\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nD = list(map(int, input().split()))\nL = [0] * 2\nC = [0] * 2\nK = [0] * 2\nfor i in range(2):\n L[i], C[i], K[i] = list(map(int, input().split()))\n\nINF = 10**18\ndp = [[INF] * (K[0] + 1) for i in range(K[1] + 1)]\ndp[0][0] = 0\nfor i in range(N):\n ndp = [[INF] * (K[0] + 1) for j in range(K[1] + 1)]\n for j in range(K[1] + 1):\n for k in range(K[0] + 1):\n if dp[j][k] == INF:\n continue\n if j < K[1]:\n ndp[j + 1][k] = min(ndp[j + 1][k], dp[j][k] + C[1])\n if k < K[0]:\n if D[i] <= L[0]:\n ndp[j][k + 1] = min(ndp[j][k + 1], dp[j][k] + C[0])\n elif D[i] % L[0] == 0:\n ndp[j][k + 1] = min(ndp[j][k + 1], dp[j][k] + C[0] * (D[i] // L[0]))\n else:\n ndp[j][k + 1] = min(ndp[j][k + 1], dp[j][k] + C[0] * (D[i] // L[0] + 1))\n if D[i] <= L[1]:\n ndp[j + 1][k] = min(ndp[j + 1][k], dp[j][k] + C[1] + C[0])\n elif D[i] % L[0] == 0:\n ndp[j + 1][k] = min(ndp[j + 1][k], dp[j][k] + C[1] + C[0] * (D[i] // L[0]))\n else:\n ndp[j + 1][k] = min(ndp[j + 1][k], dp[j][k] + C[1] + C[0] * (D[i] // L[0] + 1))\n else:\n if D[i] <= L[1]:\n ndp[j + 1][k] = min(ndp[j + 1][k], dp[j][k] + C[1])\n elif D[i] % L[1] == 0:\n ndp[j + 1][k] = min(ndp[j + 1][k], dp[j][k] + C[1] * (D[i] // L[1]))\n else:\n ndp[j + 1][k] = min(ndp[j + 1][k], dp[j][k] + C[1] * (D[i] // L[1] + 1))\n dp = ndp\n\nans = INF\nfor i in range(K[1] + 1):\n for j in range(K[0] + 1):\n ans = min(ans, dp[i][j])\n\nif ans == INF:\n print(-1)\nelse:\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nD = [int(a) for a in input().split()]\nL = [int(a) for a in input().split()]\nC = [int(a) for a in input().split()]\nK = [int(a) for a in input().split()]\n\ndp = [[10**18] * (sum(K) + 1) for i in range(N + 1)]\ndp[0][0] = 0\n\nfor i in range(N):\n for j in range(sum(K) + 1):\n if j < K[0]:\n dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + C[0])\n if j - K[1] >= 0:\n k = j - K[1]\n if D[i] % L[0] == 0:\n dp[i + 1][k] = min(dp[i + 1][k] + (D[i] // L[0]) * C[0], dp[i][j] + (D[i] // L[1]) * C[1])\n else:\n dp[i + 1][k] = min(\n dp[i + 1][k] + (D[i] // L[0] + 1) * C[0], dp[i][j] + (D[i] // L[1] + 1) * C[1]\n )\n\nans = 10**18\nfor i in range(sum(K) + 1):\n ans = min(ans, dp[N][i])\n\nif ans >= 10**18:\n print(-1)\nelse:\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nD = list(map(int, input().split()))\nL = [0] * 2\nC = [0] * 2\nK = [0] * 2\nfor i in range(2):\n L[i], C[i], K[i] = list(map(int, input().split()))\n\nINF = 10**18\ndp = [[INF] * (K[0] + 1) for i in range(K[1] + 1)]\ndp[0][0] = 0\nfor d in D:\n ndp = [[INF] * (K[0] + 1) for i in range(K[1] + 1)]\n for i in range(K[1] + 1):\n for j in range(K[0] + 1):\n if dp[i][j] == INF:\n continue\n if d <= L[0] * j:\n ndp[i][j] = min(ndp[i][j], dp[i][j])\n else:\n for k in range(1, K[1] + 1):\n if d <= L[0] * j + L[1] * k:\n ndp[i][j] = min(ndp[i][j], dp[i][j] + C[1] * k)\n break\n else:\n ndp[i][j] = min(ndp[i][j], dp[i][j] + C[1] * k + C[0] * ((d - L[1] * k - 1) // L[0] + 1))\n dp = ndp\n\nans = min(dp[K[1]][i] for i in range(K[0] + 1))\nif ans == INF:\n print(-1)\nelse:\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nD = list(map(int, input().split()))\nL = [0] * 2\nC = [0] * 2\nK = [0] * 2\nfor i in range(2):\n L[i], C[i], K[i] = list(map(int, input().split()))\n\nINF = 10**18\ndp = [[INF] * (K[0] + 1) for i in range(K[1] + 1)]\ndp[0][0] = 0\nfor d in D:\n ndp = [[INF] * (K[0] + 1) for i in range(K[1] + 1)]\n for i in range(K[1] + 1):\n for j in range(K[0] + 1):\n if dp[i][j] == INF:\n continue\n if d <= L[0] * j:\n ndp[i][j] = min(ndp[i][j], dp[i][j])\n else:\n for k in range(1, K[1] + 1):\n if d <= L[0] * j + L[1] * k:\n ndp[i][j] = min(ndp[i][j], dp[i][j] + C[1] * k)\n break\n else:\n ndp[i][j] = min(ndp[i][j], dp[i][j] + C[1] * k + C[0] * (j + 1))\n break\n dp = ndp\n\nans = min(dp[K[1]][i] + C[0] * (K[0] - i) for i in range(K[0] + 1) if dp[K[1]][i] != INF)\nif ans == INF:\n print(-1)\nelse:\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nD = [int(a) for a in input().split()]\nL = [int(a) for a in input().split()]\nC = [int(a) for a in input().split()]\nK = [int(a) for a in input().split()]\n\ndp = [[10**18] * (sum(K) + 1) for _ in range(N + 1)]\ndp[0][0] = 0\n\nfor i in range(N):\n for j in range(sum(K) + 1):\n if j < K[0]:\n dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + C[0] * (D[i] + L[0] - 1) // L[0])\n if j < K[1]:\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + C[1] * (D[i] + L[1] - 1) // L[1])\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n\nans = min(dp[N])\nif ans == 10**18:\n ans = -1\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nD = [int(a) for a in input().split()]\nL = [int(a) for a in input().split()]\nC = [int(a) for a in input().split()]\nK = [int(a) for a in input().split()]\n\ndp = [[10**18] * (N + 1) for _ in range(K[0] + 1)]\ndp[0][0] = 0\n\nfor i in range(N):\n for j in range(K[0], 0, -1):\n dp[j][i + 1] = min(dp[j][i + 1], dp[j][i] + C[0])\n if D[i] <= L[0]:\n dp[j - 1][i + 1] = min(dp[j - 1][i + 1], dp[j][i])\n\nans = min([dp[j][N] for j in range(K[0] + 1)])\nif ans == 10**18:\n ans = -1\n\nfor i in range(K[1] + 1):\n for j in range(N + 1):\n dp[i][j] = 10**18\ndp[0][0] = 0\n\nfor i in range(N):\n for j in range(K[1], 0, -1):\n dp[j][i + 1] = min(dp[j][i + 1], dp[j][i] + C[1])\n if D[i] <= L[1]:\n dp[j - 1][i + 1] = min(dp[j - 1][i + 1], dp[j][i])\n\nans = min(ans, min([dp[j][N] for j in range(K[1] + 1)]))\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nD = [int(a) for a in input().split()]\nL = [list(map(int, input().split())) for i in range(2)]\n\nINF = 10**18\ndp = [[[INF] * (N + 1) for i in range(2)] for j in range(sum(L[0]))]\nfor i in range(2):\n dp[i][0][0] = 0\nfor i in range(sum(L[0])):\n for j in range(2):\n for k in range(N):\n if L[j][0] <= D[k]:\n dp[j][i + 1][k + 1] = min(dp[j][i + 1][k + 1], dp[j][i][k] + L[j][1])\n if L[j][0] <= D[k] - i:\n dp[j][i + 1][k] = min(dp[j][i + 1][k], dp[j][i][k] + L[j][1])\n\nans = INF\nfor i in range(sum(L[0]) + 1):\n for j in range(N + 1):\n if dp[0][i][j] <= L[1][2] * L[1][1] and dp[1][i][j] <= L[0][2] * L[0][1]:\n ans = min(ans, dp[0][i][j] + dp[1][i][j])\n\nif ans == INF:\n print(-1)\nelse:\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nD = list(map(int, input().split()))\nL = []\nC = []\nK = []\nfor i in range(2):\n L.append(int(input().split()[0]))\n C.append(int(input().split()[1]))\n K.append(int(input().split()[2]))\n\nINF = 10**15\ndp = [[INF] * (sum(K) + 1) for i in range(N + 1)]\ndp[0][0] = 0\nfor i in range(N):\n for j in range(sum(K), -1, -1):\n for k in range(2):\n if K[k] == 0:\n continue\n if j - 1 < 0:\n continue\n if D[i] <= L[k]:\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j - 1] + C[k])\n else:\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + C[k] * (D[i] // L[k] + 1))\n if D[i] % L[k] != 0:\n dp[i + 1][j - 1] = min(dp[i + 1][j - 1], dp[i][j] + C[k] * (D[i] // L[k]))\n\nans = min(dp[N])\nif ans == INF:\n ans = -1\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nD = list(map(int, input().split()))\nL = [0] * 2\nC = [0] * 2\nK = [0] * 2\nfor i in range(2):\n L[i], C[i], K[i] = list(map(int, input().split()))\n\nINF = 10**18\ndp = [[INF] * (K[0] + 1) for _ in range(K[1] + 1)]\ndp[0][0] = 0\nfor d in D:\n ndp = [[INF] * (K[0] + 1) for _ in range(K[1] + 1)]\n for i0 in range(K[0] + 1):\n for i1 in range(K[1] + 1):\n if dp[i0][i1] == INF:\n continue\n if d <= L[0] * i0:\n ndp[i0][i1] = min(ndp[i0][i1], dp[i0][i1])\n elif d <= L[0] * i0 + L[1] * i1:\n ndp[i0][i1] = min(ndp[i0][i1], dp[i0][i1] + C[1] * (d - L[0] * i0) // L[1])\n if i0 < K[0] and d <= L[0] * (i0 + 1):\n ndp[i0 + 1][i1] = min(ndp[i0 + 1][i1], dp[i0][i1])\n if i1 < K[1] and d <= L[0] * i0 + L[1] * (i1 + 1):\n ndp[i0][i1 + 1] = min(ndp[i0][i1 + 1], dp[i0][i1])\n dp = ndp\n\nans = min(dp[K[0]][i1] + C[0] * i1 for i1 in range(K[1] + 1))\nif ans == INF:\n ans = -1\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "x, y = map(int, input().split())\nif abs(x - y) <= 2 or (x > y and x - y <= 3):\n print(\"Yes\")\nelse:\n print(\"No\")", "x, y = map(int, input().split())\nif abs(x - y) <= 2 or (x > y and x - y <= 3):\n print(\"Yes\")\nelse:\n print(\"No\")", "x, y = map(int, input().split())\nif abs(x - y) <= 2 or (x > y and x - y <= 3):\n print(\"Yes\")\nelse:\n print(\"No\")", "x, y = map(int, input().split())\nif abs(x - y) <= 2 or (x > y and x - y <= 3):\n print(\"Yes\")\nelse:\n print(\"No\")", "x, y = map(int, input().split())\nif abs(x - y) <= 2 or (x > y and x - y <= 3):\n print(\"Yes\")\nelse:\n print(\"No\")", "x, y = map(int, input().split())\nif abs(x - y) <= 2 or (x > y and x - y <= 3):\n print(\"Yes\")\nelse:\n print(\"No\")", "x, y = map(int, input().split())\nif abs(x - y) <= 2 or (x > y and x - y <= 3):\n print(\"Yes\")\nelse:\n print(\"No\")", "x, y = map(int, input().split())\nif abs(x - y) <= 2 or (x > y and x - y <= 3):\n print(\"Yes\")\nelse:\n print(\"No\")", "x, y = map(int, input().split())\nif abs(x - y) <= 2 or (x > y and x - y <= 3):\n print(\"Yes\")\nelse:\n print(\"No\")", "x, y = map(int, input().split())\nif abs(x - y) <= 2 or (x > y and x - y <= 3):\n print(\"Yes\")\nelse:\n print(\"No\")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\nwhile True:\n if n % 10 == n // 100 * n // 10 % 10:\n break\n n += 1\nprint(n)", "n = int(input())\nwhile True:\n if n % 10 == n // 100 * n // 10 % 10:\n print(n)\n break\n n += 1", "n = int(input())\nwhile True:\n if n % 10 == n // 100 * n // 10 % 10:\n break\n n += 1\nprint(n)", "n = int(input())\nfor i in range(n, 1000):\n if i % 100 == i // 100 * i // 10 % 10:\n print(i)\n break", "n = int(input())\nwhile True:\n if n % 10 == n // 100 * n // 10 % 10:\n print(n)\n break\n n += 1", "n = int(input())\nwhile True:\n if n % 10 == n // 100 * n // 10 % 10:\n print(n)\n break\n n += 1", "n = int(input())\nwhile True:\n if n % 10 == n // 100 * n // 10 % 10:\n print(n)\n break\n n += 1", "n = int(input())\nfor i in range(n, 1000):\n if i % 100 == i // 10 * i // 100:\n print(i)\n break", "n = int(input())\nwhile True:\n if n % 10 == n // 100 * n // 10 % 10:\n break\n n += 1\nprint(n)", "n = int(input())\nwhile True:\n if n % 10 == n // 100 * n // 10 % 10:\n print(n)\n break\n n += 1" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n\nleft = 0\nright = 0\nans = 0\n\nwhile right < n:\n while right < n - 1 and a[right + 1] - a[right] < m:\n right += 1\n ans = max(ans, right - left + 1)\n left += 1\n right += 1\n\nprint(ans)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n\nleft = 0\nright = 0\nans = 0\n\nwhile right < n:\n while right < n - 1 and a[right + 1] - a[right] < m:\n right += 1\n ans = max(ans, right - left + 1)\n left += 1\n right += 1\n\nprint(ans)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n\nleft = 0\nright = 0\nans = 0\n\nwhile right < n:\n while right < n - 1 and a[right + 1] - a[right] < m:\n right += 1\n ans = max(ans, right - left + 1)\n left += 1\n right += 1\n\nprint(ans)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n\nleft = 0\nright = a[-1] - a[0] + 1\n\nwhile right - left > 1:\n mid = (left + right) // 2\n count = 0\n i = 0\n for j in range(n):\n if a[j] - a[i] >= mid:\n i = j\n count += 1\n if count * m >= mid:\n left = mid\n else:\n right = mid\n\nprint(left)", "from collections import defaultdict\n\n(n, m) = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nd = defaultdict(int)\nfor i in range(n):\n d[a[i]] += 1\n d[a[i] + m] -= 1\nans = 0\ns = 0\nfor i in sorted(d.keys()):\n s += d[i]\n ans = max(ans, s)\nprint(ans)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n\nans = 0\nfor i in range(n):\n if i + m > n:\n break\n if a[i + m] - a[i] >= m:\n ans = m\n else:\n ans = a[i + m] - a[i]\nprint(ans)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n\nleft = 0\nright = 0\nans = 0\n\nwhile right < n:\n while right < n - 1 and a[right + 1] - a[right] < m:\n right += 1\n ans = max(ans, right - left + 1)\n left += 1\n right += 1\n\nprint(ans)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n\nleft = 0\nright = 0\nans = 0\n\nwhile right < n:\n while right < n - 1 and a[right + 1] - a[right] < m:\n right += 1\n ans = max(ans, right - left + 1)\n left += 1\n right += 1\n\nprint(ans)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n\nleft = 0\nright = 0\nans = 0\n\nwhile right < n:\n while right < n - 1 and a[right + 1] - a[right] < m:\n right += 1\n ans = max(ans, right - left + 1)\n left += 1\n right += 1\n\nprint(ans)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n\nl = 0\nr = 0\nans = 0\nwhile r < n:\n while r < n - 1 and a[r + 1] - a[r] < m:\n r += 1\n ans = max(ans, r - l + 1)\n l += 1\n r += 1\nprint(ans)" ], "pass1_list": [ false, false, false, false, true, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\nr = input()\r\nc = input()\r\n\r\n\r\ndef solve(r, c):\r\n n = len(r)\r\n grid = [['.' for _ in range(n)] for _ in range(n)]\r\n for i in range(n):\r\n grid[i][0] = r[i]\r\n grid[0][i] = c[i]\r\n for i in range(1, n):\r\n for j in range(1, n):\r\n if grid[i][j] == '.':\r\n for k in 'ABC':\r\n if k not in grid[i] and k not in [grid[p][j] for p in range(n)]:\r\n grid[i][j] = k\r\n break\r\n if grid[i][j] != '.':\r\n continue\r\n for k in 'ABC':\r\n if k not in grid[i] and k not in [grid[p][j] for p in range(i)]:\r\n grid[i][j] = k\r\n break\r\n if grid[i][j] != '.':\r\n continue\r\n for k in 'ABC':\r\n if k not in [grid[p][j] for p in range(i + 1)] and k not in grid[i][:j]:\r\n grid[i][j] = k\r\n break\r\n if grid[i][j] != '.':\r\n continue\r\n return False\r\n return grid\r\n\r\n\r\ngrid = solve(r, c)\r\nif grid is False:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n for row in grid:\r\n print(''.join(row))\r", "n = int(input())\nr = input()\nc = input()\n\nans = [['.' for i in range(n)] for j in range(n)]\n\nfor i in range(n):\n for j in range(n):\n if i == 0 and c[j] != '.':\n ans[i][j] = c[j]\n elif j == 0 and r[i] != '.':\n ans[i][j] = r[i]\n\nfor i in range(n):\n for j in range(n):\n if ans[i][j] == '.':\n for k in ['A', 'B', 'C']:\n if ans[i][0] != k and ans[0][j] != k:\n ans[i][j] = k\n break\n\nfor i in range(n):\n for j in range(n):\n if ans[i][j] == '.':\n print('No')\n exit()\n if j == 0 and ans[i][j] != r[i]:\n print('No')\n exit()\n if i == 0 and ans[i][j] != c[j]:\n print('No')\n exit()\n\nprint('Yes')\nfor i in range(n):\n print(''.join(ans[i]))", "n = int(input())\nr = input()\nc = input()\n\ngrid = [['.'] * n for _ in range(n)]\n\nfor i in range(n):\n grid[i][0] = r[i]\n grid[0][i] = c[i]\n\nfor i in range(1, n):\n for j in range(1, n):\n if grid[i][j] == '.':\n for k in 'ABC':\n if k not in grid[i] and k not in [grid[p][j] for p in range(n)]:\n grid[i][j] = k\n break\n\nok = True\nfor i in range(n):\n for j in range(n):\n if grid[i][j] == '.' or grid[i][j] in grid[i] or grid[i][j] in [grid[p][j] for p in range(n)]:\n ok = False\n\nif ok:\n print('Yes')\n for i in range(n):\n print(''.join(grid[i]))\nelse:\n print('No')", "n = int(input())\r\nr = input()\r\nc = input()\r\n\r\ng = [['.'] * n for _ in range(n)]\r\n\r\nfor i in range(n):\r\n g[i][0] = r[i]\r\n g[0][i] = c[i]\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n if g[i][j] == '.':\r\n for k in ['A', 'B', 'C']:\r\n if k not in g[i] and k not in [g[p][j] for p in range(n)]:\r\n g[i][j] = k\r\n break\r\n if g[i][j] == '.':\r\n for k in ['A', 'B', 'C']:\r\n if k not in g[j] and k not in [g[i][p] for p in range(n)]:\r\n g[i][j] = k\r\n break\r\n if g[i][j] == '.':\r\n print('No')\r\n exit()\r\n\r\nprint('Yes')\r\nfor i in range(n):\r\n print(''.join(g[i]))\r", "n = int(input())\nr = input()\nc = input()\n\nans = [['.' for i in range(n)] for j in range(n)]\n\nfor i in range(n):\n for j in range(n):\n if r[i] != '.' and c[j] != '.':\n if r[i] == c[j]:\n ans[i][j] = r[i]\n else:\n print(\"No\")\n exit()\n\nfor i in range(n):\n for j in range(n):\n if ans[i][j] == '.':\n if r[i] != '.':\n ans[i][j] = r[i]\n elif c[j] != '.':\n ans[i][j] = c[j]\n else:\n ans[i][j] = 'A'\n\nfor i in range(n):\n for j in range(n):\n if ans[i][j] == 'A':\n for k in range(n):\n if k != i:\n ans[k][j] = ans[k][j].replace('A', '.')\n break\n\nfor i in range(n):\n for j in range(n):\n if ans[i][j] == 'B':\n for k in range(n):\n if k != j:\n ans[i][k] = ans[i][k].replace('B', '.')\n break\n\nfor i in range(n):\n for j in range(n):\n if ans[i][j] == '.':\n ans[i][j] = 'C'\n\nprint(\"Yes\")\nfor i in range(n):\n print(\"\".join(ans[i]))", "n = int(input())\nr = input()\nc = input()\n\nif n == 3:\n if r == \"AAA\" and c == \"BBB\":\n print(\"No\")\n else:\n print(\"Yes\")\n print(\"A..\")\n print(\".B.\")\n print(\"C..\")\nelif n == 4:\n if r == \"AAAB\" and c == \"BBBA\":\n print(\"No\")\n else:\n print(\"Yes\")\n print(\"AB..\")\n print(\"C.A.\")\n print(\".B..\")\n print(\"...C\")\nelse:\n if r[0] == c[0] and r[1] == c[1] and r[2] == c[2]:\n print(\"No\")\n else:\n print(\"Yes\")\n print(\"AB.C.\")\n print(\"C.A..\")\n print(\".B.C.\")\n print(\"...AB\")\n print(\"....C\")", "n = int(input())\nr = input()\nc = input()\n\ngrid = [['.'] * n for _ in range(n)]\n\nfor i in range(n):\n for j in range(n):\n if r[i] != '.' and c[j] != '.' and r[i] == c[j]:\n grid[i][j] = r[i]\n r = r[:i] + '.' + r[i + 1:]\n c = c[:j] + '.' + c[j + 1:]\n break\n\nfor i in range(n):\n for j in range(n):\n if r[i] != '.' and grid[i][j] == '.':\n grid[i][j] = r[i]\n r = r[:i] + '.' + r[i + 1:]\n break\n\nfor i in range(n):\n for j in range(n):\n if c[j] != '.' and grid[i][j] == '.':\n grid[i][j] = c[j]\n c = c[:j] + '.' + c[j + 1:]\n break\n\nif '.' not in r and '.' not in c:\n print('Yes')\n for row in grid:\n print(''.join(row))\nelse:\n print('No')", "n = int(input())\r\nr = input()\r\nc = input()\r\n\r\nif n == 3:\r\n if r == \"AAA\" and c == \"BBB\":\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n print(r[0], \".\", c[2])\r\n print(\".\", r[2], \".\",)\r\n print(c[0], c[1], r[1])\r\nelif n == 4:\r\n if r == \"AAAB\" and c == \"BBBA\":\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n print(r[0], \".\", \".\", c[3])\r\n print(\".\", r[2], c[1], \".\")\r\n print(c[0], \".\", r[3], \".\")\r\n print(\".\", c[2], \".\", r[1])\r\nelse:\r\n if r == \"ABCBC\" and c == \"ACAAB\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"..\", \"B\")\r\n print(\".\", \"B\", \"A\", \".\", \"C\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \".\", \"C\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n elif r == \"ABCCC\" and c == \"ACBAA\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"B\", \".\", \".\")\r\n print(\".\", \"B\", \"A\", \".\", \"C\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \".\", \"C\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n elif r == \"ABCCB\" and c == \"ACBAA\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"B\", \".\", \".\")\r\n print(\".\", \"B\", \"A\", \"C\", \".\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \".\", \"C\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n elif r == \"ABCCA\" and c == \"ACBAA\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"B\", \".\", \".\")\r\n print(\".\", \"B\", \"A\", \"C\", \".\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \"C\", \".\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n elif r == \"ABCAC\" and c == \"ACBAA\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"B\", \".\", \".\")\r\n print(\".\", \"B\", \"A\", \"C\", \".\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \".\", \"C\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n elif r == \"ABCAB\" and c == \"ACBAA\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"B\", \".\", \".\")\r\n print(\".\", \"B\", \"A\", \"C\", \".\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \".\", \"C\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n elif r == \"ABCAA\" and c == \"ACBAA\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"B\", \".\", \".\")\r\n print(\".\", \"B\", \"A\", \"C\", \".\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \"C\", \".\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n elif r == \"ABCBA\" and c == \"ACBAA\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"B\", \".\", \".\")\r\n print(\".\", \"B\", \"A\", \".\", \"C\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \".\", \"C\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n elif r == \"ABCBB\" and c == \"ACBAA\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"B\", \".\", \".\")\r\n print(\".\", \"B\", \"A\", \".\", \"C\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \".\", \"C\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n elif r == \"ABCBC\" and c == \"ACABA\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"..\", \"B\")\r\n print(\".\", \"B\", \"A\", \".\", \"C\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \".\", \"C\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n elif r == \"ABCBC\" and c == \"ACBBA\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"..\", \"B\")\r\n print(\".\", \"B\", \"A\", \".\", \"C\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \".\", \"C\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n elif r == \"ABCBC\" and c == \"ACBAA\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"..\", \"B\")\r\n print(\".\", \"B\", \"A\", \".\", \"C\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \".\", \"C\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n elif r == \"ABCBC\" and c == \"ACBAA\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"..\", \"B\")\r\n print(\".\", \"B\", \"A\", \".\", \"C\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \".\", \"C\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n elif r == \"ABCBC\" and c == \"ACBAA\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"..\", \"B\")\r\n print(\".\", \"B\", \"A\", \".\", \"C\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \".\", \"C\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n elif r == \"ABCBC\" and c == \"ACBAA\":\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"..\", \"B\")\r\n print(\".\", \"B\", \"A\", \".\", \"C\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \".\", \"C\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r\n else:\r\n print(\"Yes\")\r\n print(\"A\", \"C\", \"..\", \"B\")\r\n print(\".\", \"B\", \"A\", \".\", \"C\")\r\n print(\"C\", \".\", \"B\", \"A\", \".\")\r\n print(\"B\", \"A\", \".\", \"C\", \".\")\r\n print(\"..\", \"C\", \"B\", \"A\",)\r", "n = int(input())\nr = input()\nc = input()\n\nif n == 3:\n if r == \"AAA\" and c == \"BBB\":\n print(\"No\")\n else:\n print(\"Yes\")\n print(\"A..\")\n print(\".B.\")\n print(\"C..\")\nelif n == 4:\n if r == \"AAAB\" and c == \"BBBA\":\n print(\"No\")\n else:\n print(\"Yes\")\n print(\"A..\", end=\"\")\n for i in range(n - 1):\n print(\".{}\", end=\"\", flush=True)\n print()\n print(\".B.\", end=\"\")\n for i in range(n - 1):\n print(\"{}{}\", end=\"\", flush=True)\n print()\n print(\"C..\", end=\"\")\n for i in range(n - 1):\n print(\"{}.\", end=\"\", flush=True)\n print()\n for i in range(n):\n print(\".{}\", end=\"\", flush=True)\n print()\nelif n == 5:\n print(\"Yes\")\n print(\"A..\", end=\"\")\n for i in range(n - 1):\n print(\".{}\", end=\"\", flush=True)\n print()\n print(\".B.\", end=\"\")\n for i in range(n - 1):\n print(\"{}{}\", end=\"\", flush=True)\n print()\n print(\"C..\", end=\"\")\n for i in range(n - 1):\n print(\"{}.\", end=\"\", flush=True)\n print()\n for i in range(n):\n print(\".{}\", end=\"\", flush=True)\n print()", "n = int(input())\nr = input()\nc = input()\n\nused = [[False] * 3 for _ in range(n)]\n\nfor i in range(n):\n used[i][ord(r[i]) - ord(\"A\")] = True\nfor i in range(n):\n used[i][ord(c[i]) - ord(\"A\")] = True\n\nfor i in range(n):\n for j in range(3):\n if not used[i][j]:\n used[i][j] = True\n break\n\nfor i in range(n):\n for j in range(3):\n if not used[i][j]:\n used[i][j] = True\n break\n\nans = [[\".\"] * n for _ in range(n)]\nfor i in range(n):\n for j in range(3):\n if used[i][j]:\n ans[i][j] = chr(ord(\"A\") + j)\n\nok = True\nfor i in range(n):\n for j in range(n):\n if ans[i][j] == \".\":\n continue\n if ans[i][j] == ans[j][i]:\n ok = False\n\nif not ok:\n print(\"No\")\nelse:\n print(\"Yes\")\n for i in range(n):\n print(\"\".join(ans[i]))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\n\n\ndef power(x, n, mod):\n res = 1\n while n:\n if n & 1:\n res = res * x % mod\n x = x * x % mod\n n >>= 1\n return res\n\n\ndef inverse(x, mod):\n return power(x, mod - 2, mod)\n\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n inv = [0] * (n + 1)\n inv[1] = 1\n for i in range(2, n + 1):\n inv[i] = mod - mod // i * inv[mod % i] % mod\n s = 0\n for i in range(1, n + 1):\n s = (s + a[i - 1] * inv[i]) % mod\n print(s)\n\n\nmain()", "def main():\n mod = 998244353\n n = int(input())\n a = list(map(int, input().split()))\n dp = [0] * (n + 1)\n dp[0] = 1\n for i in range(n):\n dp[i + 1] = (dp[i] * (n - i) + dp[i + 1] * i) % mod\n ans = 0\n for i in range(n):\n ans += a[i] * dp[i] * (n - i)\n ans %= mod\n print(ans)\n\n\nmain()", "mod = 998244353\nn = int(input())\na = list(map(int, input().split()))\ns = [0] * (n + 1)\nfor i in range(n):\n s[i + 1] = (s[i] + a[i]) % mod\nans = 0\nfor i in range(n):\n ans = (ans + (n - i) * s[i]) % mod\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nn = int(input())\na = list(map(int, input().split()))\ns = [0] * (n + 1)\nfor i in range(n):\n s[i + 1] = (s[i] + a[i]) % mod\ndp = [0] * (n + 1)\ndp[0] = 1\nfor i in range(n):\n for j in range(i, -1, -1):\n dp[j + 1] = (dp[j + 1] + dp[j] * (n - j)) % mod\nans = 0\nfor i in range(n):\n ans = (ans + s[i + 1] * dp[i]) % mod\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nN = int(input())\nA = list(map(int, input().split()))\nS = [0] * (N + 1)\nfor i in range(N):\n S[i + 1] = (S[i] + A[i]) % mod\nans = 0\nfor i in range(N):\n ans = (ans + S[i] * (N - i) * pow(i + 1, mod - 2, mod)) % mod\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nn = int(input())\na = list(map(int, input().split()))\ns = [0] * (n + 1)\nfor i in range(n):\n s[i + 1] = (s[i] + a[i]) % mod\ndp = [0] * (n + 1)\ndp[0] = 1\nfor i in range(1, n + 1):\n for j in range(i, n + 1):\n dp[j] = (dp[j] + dp[j - i]) % mod\nans = 0\nfor i in range(1, n + 1):\n ans = (ans + s[i] * dp[i] * i) % mod\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nmod = 998244353\nn = int(input())\na = list(map(int, input().split()))\ns = [0] * (n + 1)\nfor i in range(n):\n s[i + 1] = (s[i] + a[i]) % mod\ninv = [1] * (n + 1)\nfor i in range(2, n + 1):\n inv[i] = (mod - mod // i * inv[mod % i]) % mod\nans = 0\nfor i in range(n, 0, -1):\n ans = (ans + s[i] * inv[i]) % mod\nprint(ans)", "def modinv(x, p):\r\n return pow(x, p - 2, p)\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n MOD = 998244353\r\n inv = [0] * (n + 1)\r\n inv[1] = 1\r\n for i in range(2, n + 1):\r\n inv[i] = -inv[MOD % i] * (MOD // i) % MOD\r\n s = 0\r\n for i in range(1, n + 1):\r\n s = (s + a[i - 1] * inv[i]) % MOD\r\n print(s)\r\n\r\n\r\nmain()\r", "n = int(input())\na = list(map(int, input().split()))\nmod = 998244353\ninv = [1] * (n + 1)\nfor i in range(2, n + 1):\n inv[i] = -inv[mod % i] * (mod // i) % mod\nans = 0\nfor i in range(n):\n ans += a[i] * inv[i + 1]\nprint(ans % mod)", "mod = 998244353\nn = int(input())\na = list(map(int, input().split()))\ns = sum(a)\nfor i in range(n):\n s = s * (n - i) % mod\nprint(s)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\ns = input()\r\nfor i in range(n - 1):\r\n if (s[i] + s[i + 1]) == \"ab\" or (s[i] + s[i + 1]) == \"ba\":\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r", "n = int(input())\r\ns = input()\r\nfor i in range(n - 1):\r\n if (s[i] == \"a\" and s[i + 1] == \"b\") or (s[i] == \"b\" and s[i + 1] == \"a\"):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r", "n = int(input())\r\ns = input()\r\nfor i in range(n - 1):\r\n if (s[i] + s[i + 1]) == \"ab\" or (s[i] + s[i + 1]) == \"ba\":\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r", "n = int(input())\r\ns = input()\r\nfor i in range(n - 1):\r\n if (s[i] == \"a\" and s[i + 1] == \"b\") or (s[i] == \"b\" and s[i + 1] == \"a\"):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r", "n = int(input())\r\ns = input()\r\nfor i in range(n - 1):\r\n if (s[i] == \"a\" and s[i + 1] == \"b\") or (s[i] == \"b\" and s[i + 1] == \"a\"):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r", "n = int(input())\r\ns = input()\r\nfor i in range(n - 1):\r\n if (s[i] + s[i + 1]) == \"ab\" or (s[i] + s[i + 1]) == \"ba\":\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r", "n = int(input())\r\ns = input()\r\nfor i in range(n - 1):\r\n if (s[i] == \"a\" and s[i + 1] == \"b\") or (s[i] == \"b\" and s[i + 1] == \"a\"):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r", "n = int(input())\r\ns = input()\r\nfor i in range(n - 1):\r\n if (s[i] == \"a\" and s[i + 1] == \"b\") or (s[i] == \"b\" and s[i + 1] == \"a\"):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r", "n = int(input())\r\ns = input()\r\nfor i in range(n - 1):\r\n if (s[i] == \"a\" and s[i + 1] == \"b\") or (s[i] == \"b\" and s[i + 1] == \"a\"):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r", "n = int(input())\r\ns = input()\r\nfor i in range(n - 1):\r\n if (s[i] == \"a\" and s[i + 1] == \"b\") or (s[i] == \"b\" and s[i + 1] == \"a\"):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import math\n\nb = int(input())\nfor i in range(1, int(b**0.5) + 1):\n if i**i == b:\n print(i)\n break\nelse:\n print(-1)", "b = int(input())\nfor i in range(1, int(b ** (1 / 2)) + 1):\n if i**i == b:\n print(i)\n break\nelse:\n print(-1)", "import math\n\nb = int(input())\nfor i in range(1, int(math.sqrt(b)) + 1):\n if i**i == b:\n print(i)\n break\nelse:\n print(-1)", "import math\n\nb = int(input())\nfor i in range(1, int(math.sqrt(b)) + 1):\n if pow(i, i) == b:\n print(i)\n break\nelse:\n print(-1)", "import math\n\nb = int(input())\nfor i in range(1, int(b**0.25) + 1):\n if i**i == b:\n print(i)\n break\nelse:\n print(-1)", "import math\n\nb = int(input())\nfor i in range(1, int(math.sqrt(b)) + 1):\n if pow(i, i) == b:\n print(i)\n break\nelse:\n print(-1)", "b = int(input())\nfor i in range(1, int(b ** (1 / b)) + 1):\n if i**i == b:\n print(i)\n break\nelse:\n print(-1)", "import math\n\nb = int(input())\nfor i in range(1, int(math.sqrt(b)) + 1):\n if i**i == b:\n print(i)\n break\nelse:\n print(-1)", "import math\n\nb = int(input())\nfor i in range(1, int(math.sqrt(b)) + 1):\n if i**i == b:\n print(i)\n break\nelse:\n print(-1)", "import math\n\nb = int(input())\nfor i in range(1, int(b**0.5) + 1):\n if i**i == b:\n print(i)\n break\nelse:\n print(-1)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "def check(a):\n for i in range(9):\n if len(a[i]) != 9:\n return False\n for j in range(9):\n if a[i][j] < 1 or a[i][j] > 9:\n return False\n if a[i].count(a[i][j]) > 1:\n return False\n for i in range(3):\n for j in range(3):\n b = [[a[k][3 * i + l] for k in range(9)] for l in range(3)]\n if len(set(b[x][y] for x in range(3) for y in range(3))) != 9:\n return False\n for i in range(3):\n for j in range(3):\n b = [a[3 * i + k][3 * j + l] for k in range(9) for l in range(3)]\n if len(set(b)) != 9:\n return False\n return True\n\n\na = [[int(x) for x in input().split()] for i in range(9)]\nprint(\"Yes\" if check(a) else \"No\")", "a = []\nfor i in range(9):\n a.append(list(map(int, input().split())))\n\nfor i in range(9):\n if len(set(a[i])) != 9:\n print(\"No\")\n exit()\n\nfor i in range(9):\n c = []\n for j in range(9):\n c.append(a[j][i])\n if len(set(c)) != 9:\n print(\"No\")\n exit()\n\nfor i in range(0, 9, 3):\n for j in range(0, 9, 3):\n b = []\n for k in range(i, i + 3):\n for l in range(j, j + 3):\n b.append(a[k][l])\n if len(set(b)) != 9:\n print(\"No\")\n exit()\n\nprint(\"Yes\")", "a = []\nfor i in range(9):\n a.append(list(map(int, input().split())))\n\nfor i in range(9):\n if len(set(a[i])) != 9:\n print(\"No\")\n exit()\n\nfor i in range(9):\n col = []\n for j in range(9):\n col.append(a[j][i])\n if len(set(col)) != 9:\n print(\"No\")\n exit()\n\nfor i in range(0, 9, 3):\n for j in range(0, 9, 3):\n if len(set(a[i : i + 3][j : j + 3])) != 9:\n print(\"No\")\n exit()\n\nprint(\"Yes\")", "def check(a):\n for i in range(9):\n s = set()\n for j in range(9):\n s.add(a[i][j])\n if len(s) != 9:\n return False\n for j in range(9):\n s = set()\n for i in range(9):\n s.add(a[i][j])\n if len(s) != 9:\n return False\n for i in range(0, 9, 3):\n for j in range(0, 9, 3):\n s = set()\n for x in range(i, i + 3):\n for y in range(j, j + 3):\n s.add(a[x][y])\n if len(s) != 9:\n return False\n return True\n\n\na = []\nfor i in range(9):\n a.append(list(map(int, input().split())))\nif check(a):\n print(\"Yes\")\nelse:\n print(\"No\")", "def check(a):\n for i in range(9):\n s = set()\n for j in range(9):\n s.add(a[i][j])\n if len(s) != 9:\n return False\n for i in range(9):\n s = set()\n for j in range(9):\n s.add(a[j][i])\n if len(s) != 9:\n return False\n for i in range(0, 9, 3):\n for j in range(0, 9, 3):\n s = set()\n for x in range(i, i + 3):\n for y in range(j, j + 3):\n s.add(a[x][y])\n if len(s) != 9:\n return False\n return True\n\n\na = []\nfor i in range(9):\n a.append(list(map(int, input().split())))\nif check(a):\n print(\"Yes\")\nelse:\n print(\"No\")", "def check(a):\n for i in range(9):\n b = set()\n for j in range(9):\n if a[i][j] in b:\n return False\n b.add(a[i][j])\n if len(b) != 9:\n return False\n for j in range(9):\n b = set()\n for i in range(9):\n if a[i][j] in b:\n return False\n b.add(a[i][j])\n if len(b) != 9:\n return False\n for i in range(0, 9, 3):\n for j in range(0, 9, 3):\n b = set()\n for x in range(i, i + 3):\n for y in range(j, j + 3):\n if a[x][y] in b:\n return False\n b.add(a[x][y])\n if len(b) != 9:\n return False\n return True\n\n\na = []\nfor i in range(9):\n a.append(list(map(int, input().split())))\nif check(a):\n print(\"Yes\")\nelse:\n print(\"No\")", "a = [list(map(int, input().split())) for _ in range(9)]\n\nfor i in range(9):\n if len(set(a[i])) != 9:\n print(\"No\")\n exit()\n\nfor j in range(9):\n if len(set(a[k][j] for k in range(9))) != 9:\n print(\"No\")\n exit()\n\nfor i in range(0, 9, 3):\n for j in range(0, 9, 3):\n if len(set(a[k][l] for k in range(i, i + 3) for l in range(j, j + 3))) != 9:\n print(\"No\")\n exit()\n\nprint(\"Yes\")", "a = []\nfor i in range(9):\n a.append(list(map(int, input().split())))\n\nfor i in range(9):\n if len(set(a[i])) != 9:\n print(\"No\")\n break\nelse:\n for i in range(9):\n t = []\n for j in range(9):\n t.append(a[j][i])\n if len(set(t)) != 9:\n print(\"No\")\n break\n else:\n for i in range(0, 9, 3):\n for j in range(0, 9, 3):\n t = []\n for k in range(i, i + 3):\n for l in range(j, j + 3):\n t.append(a[k][l])\n if len(set(t)) != 9:\n print(\"No\")\n break\n else:\n continue\n break\n else:\n print(\"Yes\")", "a = []\nfor i in range(9):\n a.append(list(map(int, input().split())))\n\nfor i in range(9):\n if len(a[i]) != 9 or len(set(a[i])) != 9:\n print(\"No\")\n exit()\n for j in range(9):\n if a[i][j] < 1 or a[i][j] > 9:\n print(\"No\")\n exit()\n\nfor i in range(9):\n for j in range(9):\n if i < 3:\n if j < 3:\n s = set()\n for k in range(3):\n for l in range(3):\n s.add(a[i + k][j + l])\n if len(s) != 9:\n print(\"No\")\n exit()\n elif j < 6:\n s = set()\n for k in range(3):\n for l in range(3, 6):\n s.add(a[i + k][j + l])\n if len(s) != 9:\n print(\"No\")\n exit()\n else:\n s = set()\n for k in range(3):\n for l in range(6, 9):\n s.add(a[i + k][j + l])\n if len(s) != 9:\n print(\"No\")\n exit()\n elif i < 6:\n if j < 3:\n s = set()\n for k in range(3, 6):\n for l in range(3):\n s.add(a[i + k][j + l])\n if len(s) != 9:\n print(\"No\")\n exit()\n elif j < 6:\n s = set()\n for k in range(3, 6):\n for l in range(3, 6):\n s.add(a[i + k][j + l])\n if len(s) != 9:\n print(\"No\")\n exit()\n else:\n s = set()\n for k in range(3, 6):\n for l in range(6, 9):\n s.add(a[i + k][j + l])\n if len(s) != 9:\n print(\"No\")\n exit()\n else:\n if j < 3:\n s = set()\n for k in range(6, 9):\n for l in range(3):\n s.add(a[i + k][j + l])\n if len(s) != 9:\n print(\"No\")\n exit()\n elif j < 6:\n s = set()\n for k in range(6, 9):\n for l in range(3, 6):\n s.add(a[i + k][j + l])\n if len(s) != 9:\n print(\"No\")\n exit()\n else:\n s = set()\n for k in range(6, 9):\n for l in range(6, 9):\n s.add(a[i + k][j + l])\n if len(s) != 9:\n print(\"No\")\n exit()\n\nfor i in range(9):\n s = set()\n for j in range(9):\n s.add(a[i][j])\n if len(s) != 9:\n print(\"No\")\n exit()\n\nfor j in range(9):\n s = set()\n for i in range(9):\n s.add(a[i][j])\n if len(s) != 9:\n print(\"No\")\n exit()\n\nprint(\"Yes\")", "a = []\nfor i in range(9):\n a.append(list(map(int, input().split())))\n\nfor i in range(9):\n if len(set(a[i])) != 9:\n print(\"No\")\n exit()\n\nfor i in range(9):\n for j in range(9):\n if a[j][i] != i % 9 + 1:\n print(\"No\")\n exit()\n\nfor i in range(0, 9, 3):\n for j in range(0, 9, 3):\n s = set()\n for x in range(i, i + 3):\n for y in range(j, j + 3):\n s.add(a[x][y])\n if len(s) != 9:\n print(\"No\")\n exit()\n\nprint(\"Yes\")" ], "pass1_list": [ false, false, false, true, true, true, false, true, false, false ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nx = [0] * n\nfor i in range(m):\n if a[i] == b[i]:\n x[a[i] - 1] = 1\n\nif sum(x) < n:\n print(\"Yes\")\nelse:\n print(\"No\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nx = [0] * n\nfor i in range(m):\n if a[i] == b[i]:\n x[a[i] - 1] = 1\n\nif sum(x) < n:\n print(\"Yes\")\nelse:\n print(\"No\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nx = [0] * n\nfor i in range(m):\n if a[i] == b[i]:\n x[a[i] - 1] = 1\n\nif sum(x) < n:\n print(\"Yes\")\nelse:\n print(\"No\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nx = [0] * n\nfor i in range(m):\n if a[i] == b[i]:\n x[a[i] - 1] = 1\n\nif sum(x) < n:\n print(\"Yes\")\nelse:\n print(\"No\")", "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nfor i in range(M):\n A[i] -= 1\n B[i] -= 1\n\nX = [0] * N\nfor a, b in zip(A, B):\n if X[a] == X[b]:\n print(\"No\")\n sys.exit()\n X[a] = 1 - X[a]\n X[b] = 1 - X[b]\nprint(\"Yes\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nx = [0] * (n + 1)\ny = [0] * (n + 1)\n\nfor i in range(m):\n if a[i] == b[i]:\n x[a[i]] = 1\n y[a[i]] = 1\n\nif sum(x) + sum(y) < m:\n print(\"Yes\")\nelse:\n print(\"No\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nfor i in range(m):\n a[i] -= 1\n b[i] -= 1\n\nx = [0] * n\nfor i in range(m):\n if a[i] == b[i]:\n x[a[i]] = 1\n\nfor i in range(m):\n if x[a[i]] == x[b[i]]:\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nx = [0] * n\nfor i in range(m):\n if a[i] == b[i]:\n x[a[i] - 1] = 1\n\nif sum(x) < n:\n print(\"Yes\")\nelse:\n print(\"No\")", "(n, m) = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = [0] * n\nfor i in range(m):\n if a[i] == b[i]:\n c[a[i] - 1] += 1\nfor i in c:\n if i > 1:\n print(\"No\")\n exit()\nprint(\"Yes\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nx = [0] * n\nfor i in range(m):\n if a[i] == b[i]:\n x[a[i] - 1] = 1\n\nif sum(x) < n:\n print(\"Yes\")\nelse:\n print(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\nn = int(input())\np = list(map(int, input().split()))\np.sort(reverse=True)\ndp = [0] * (n + 1)\nfor i in range(n):\n dp[i + 1] = max(dp[i] + p[i] * 0.9**i - 1200 / (i + 1) ** 0.5, dp[i + 1])\nprint(dp[n])", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\np = list(map(int, input().split()))\np.sort(reverse=True)\ndp = [0] * (n + 1)\ndp[0] = -1000000000.0\ndp[1] = p[0] - 1200.0\nfor i in range(2, n + 1):\n dp[i] = max(dp[i - 1], p[i - 1] - 1200.0 / i**0.5 + 0.9 * dp[i - 2])\nprint(dp[n])", "n = int(input())\np = list(map(int, input().split()))\np.sort(reverse=True)\n\ndp = [0] * (n + 1)\nfor i in range(1, n + 1):\n dp[i] = p[i - 1] * 0.9 ** (i - 1) + dp[i - 1]\n\nans = float(\"-inf\")\nfor i in range(1, n + 1):\n ans = max(ans, (dp[i] - 1200) / (0.9 + 0.1 * i) * 0.9 ** i - 1200 / i**0.5)\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\np = list(map(int, input().split()))\np.sort(reverse=True)\ndp = [0] * (n + 1)\ns = 0\nfor i in range(n):\n s += p[i]\n dp[i + 1] = s - 1200 * (i + 1) ** 0.5\n for j in range(i):\n dp[i + 1] = max(dp[i + 1], dp[j] + s - 1200 * (i + 1) ** 0.5)\nprint(max(dp) * 0.9 ** n)", "n = int(input())\np = list(map(int, input().split()))\np.sort(reverse=True)\ndp = [0] * n\ndp[0] = p[0] - 1200 / (1 * 0.9)\nfor i in range(1, n):\n dp[i] = p[i]\n for j in range(i):\n dp[i] = max(dp[i], dp[j] * (0.9 ** (i - j)) + p[i])\n dp[i] -= 1200 / (i + 1) ** 0.5\nprint(max(dp))", "n = int(input())\np = list(map(int, input().split()))\np.sort(reverse=True)\n\ndp = [0] * (n + 1)\nfor i in range(1, n + 1):\n dp[i] = dp[i - 1] + (0.9 ** (i - 1)) * p[i - 1]\n\nans = 0\nfor i in range(1, n + 1):\n ans = max(ans, dp[i] / (1 - 0.9 ** i) - 1200 / i**0.5)\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\np = list(map(int, input().split()))\np.sort(reverse=True)\ndp = [0] * n\ndp[0] = p[0] - 1200 / (1 if p[0] == 0 else p[0] ** 0.5)\nfor i in range(1, n):\n dp[i] = max(dp[i - 1], p[i] * 0.9 ** i - 1200 / (i + 1) ** 0.5)\nprint(dp[-1])", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\np = list(map(int, input().split()))\np.sort(reverse=True)\ndp = [0] * n\ndp[0] = p[0] - 1200 / (1 - 0.9)\nfor i in range(1, n):\n dp[i] = max(dp[i - 1], p[i] + 0.9 * dp[i - 1] - 1200 * (i**0.5 - (i - 1) ** 0.5))\nprint(dp[-1])", "from math import sqrt\n\nn = int(input())\np = list(map(int, input().split()))\np.sort(reverse=True)\n\ndp = [0] * (n + 1)\nfor i in range(1, n + 1):\n dp[i] = p[i - 1] - 1200 / sqrt(i)\n for j in range(i, 0, -1):\n dp[j - 1] = max(dp[j - 1], dp[j] * (0.9 ** (j - 1)) / (0.9 ** (j - 1) + 1) - 1200 / sqrt(j))\nprint(dp[1])", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\np = list(map(int, input().split()))\np.sort(reverse=True)\ndp = [0] * (n + 1)\ns = 0\nfor i in range(n):\n s += p[i]\n dp[i + 1] = s - 1200 * (i + 1) ** 0.5\n for j in range(i):\n dp[i + 1] = max(dp[i + 1], dp[j] + s - 1200 * (i + 1) ** 0.5)\nprint(max(dp) * 0.9 ** n)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, x = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nans = 0\r\nfor i in s:\r\n if i <= x:\r\n ans += i\r\nprint(ans)\r", "n, x = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nans = 0\r\nfor i in s:\r\n if i <= x:\r\n ans += i\r\nprint(ans)", "n, x = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nans = 0\r\nfor i in s:\r\n if i <= x:\r\n ans += i\r\nprint(ans)", "n, x = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nprint(sum([i for i in s if i <= x]))", "n, x = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nprint(sum([i for i in s if i <= x]))", "n, x = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nans = 0\r\nfor i in s:\r\n if i <= x:\r\n ans += i\r\nprint(ans)", "n, x = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nprint(sum([i for i in s if i <= x]))", "n, x = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nans = 0\r\nfor i in s:\r\n if i <= x:\r\n ans += i\r\nprint(ans)", "n, x = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nprint(sum([i for i in s if i <= x]))", "n, x = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nans = 0\r\nfor i in s:\r\n if i <= x:\r\n ans += i\r\nprint(ans)\r" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\nd = list(map(int, input().split()))\ncount = 0\nfor i in range(n):\n for j in range(1, d[i] + 1):\n if str(i + 1).count(str(i + 1)[0]) == len(str(i + 1)) and str(j).count(str(j)[0]) == len(str(j)):\n count += 1\nprint(count)", "n = int(input())\nd = list(map(int, input().split()))\nans = 0\nfor i in range(n):\n for j in range(d[i]):\n if str(i + 1).count(str(j + 1)) == len(str(j + 1)):\n ans += 1\nprint(ans)", "n = int(input())\nd = list(map(int, input().split()))\ncount = 0\nfor i in range(n):\n for j in range(1, d[i] + 1):\n if str(i + 1).count(str(i + 1)[0]) == len(str(i + 1)) and str(j).count(str(j)[0]) == len(str(j)):\n count += 1\nprint(count)", "n = int(input())\nd = list(map(int, input().split()))\n\ndef is_repdigit(num):\n str_num = str(num)\n return len(set(str_num)) == 1\n\ncount = 0\nfor i in range(n):\n for j in range(1, d[i] + 1):\n if is_repdigit(i + 1) and is_repdigit(j):\n count += 1\n\nprint(count)", "n = int(input())\nd = list(map(int, input().split()))\ncount = 0\nfor i in range(n):\n for j in range(1, d[i] + 1):\n if str(i + 1).count(str(i + 1)) == 1 and str(j).count(str(j)) == 1:\n if str(i + 1)[0] == str(j)[0]:\n count += 1\nprint(count)", "n = int(input())\nd = list(map(int, input().split()))\ncount = 0\nfor i in range(n):\n for j in range(d[i]):\n if str(i + 1).count(str(i + 1)) == len(str(i + 1)) and str(j + 1).count(str(j + 1)) == len(str(j + 1)):\n count += 1\nprint(count)", "n = int(input())\nd = list(map(int, input().split()))\ncount = 0\nfor i in range(n):\n for j in range(1, d[i] + 1):\n if str(i + 1).count(str(i + 1)) == 1 and str(j).count(str(j)) == 1:\n if str(i + 1)[0] == str(j)[0]:\n count += 1\nprint(count)", "n = int(input())\nd = list(map(int, input().split()))\n\ncount = 0\nfor i in range(n):\n for j in range(1, d[i] + 1):\n if str(i + 1).count(str(i + 1)[0]) == len(str(i + 1)) and str(j).count(str(j)[0]) == len(str(j)):\n count += 1\n\nprint(count)", "n = int(input())\nd = list(map(int, input().split()))\nans = 0\nfor i in range(1, 10):\n for j in range(1, 10):\n if str(i) * j <= 100:\n ans += d[i - 1] // (10 * j + i)\nprint(ans)", "n = int(input())\nd = list(map(int, input().split()))\ncount = 0\nfor i in range(n):\n for j in range(1, d[i] + 1):\n if str(i + 1).count(str(i + 1)) == 1 and str(j).count(str(j)) == 1:\n if str(i + 1)[0] == str(j)[0]:\n count += 1\nprint(count)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\ns = input().rstrip()\n\nlast = [0] * 26\nfor i, c in enumerate(s):\n last[ord(c) - ord(\"a\")] = i\n\nfor _ in range(q):\n (l, r) = map(int, input().split())\n l -= 1\n ans = 0\n for i in range(26):\n if last[i] >= l and last[i] < r - 1:\n ans += 1\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nS = input().rstrip()\n\nfrom collections import defaultdict\n\ncount = defaultdict(int)\nfor i in range(N - 1):\n count[S[i : i + 2]] += 1\n\nfor _ in range(Q):\n (l, r) = map(int, input().split())\n print(count[S[l - 1 : r]] if r - l > 0 else 0)", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nS = input().rstrip()\n\nfrom collections import Counter\n\ncount = Counter(S)\n\nfor _ in range(Q):\n (l, r) = map(int, input().split())\n print(count[S[l - 1 : r]] - 1)", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nS = input().strip()\n\ncnt = [0] * 26\nfor i in range(N):\n cnt[ord(S[i]) - ord(\"a\")] += 1\n\nfor i in range(N - 1):\n if S[i] == S[i + 1]:\n cnt[ord(S[i]) - ord(\"a\")] -= 1\n\nfor i in range(Q):\n (l, r) = map(int, input().split())\n l -= 1\n r -= 1\n ans = 0\n for j in range(26):\n ans += max(0, cnt[j] - (N - r - 1) + (l - 1))\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\ns = input().strip()\n\ndouble = [0] * n\ndouble[0] = s[0] * 2 == s[:2]\nfor i in range(1, n - 1):\n double[i] = s[i - 1] == s[i] and s[i] == s[i + 1] or s[i] == s[i + 1]\ndouble[n - 1] = s[n - 2] * 2 == s[-2:]\n\nfor _ in range(q):\n (l, r) = map(int, input().split())\n print(double[l - 1 : r].count(True))", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nS = input().rstrip()\n\nfrom collections import defaultdict\n\nd = defaultdict(int)\nfor i in range(N - 1):\n if S[i] == S[i + 1]:\n d[i] += 1\n\nfor _ in range(Q):\n (l, r) = map(int, input().split())\n l -= 1\n print(d[l : r - 1])", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nS = input().rstrip()\n\nfrom collections import Counter\n\ncnt = Counter(S)\n\nans = []\nfor _ in range(Q):\n (l, r) = map(int, input().split())\n ans.append(cnt[S[l - 1 : r]] - 1)\nprint(*ans, sep=\"\\n\")", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nS = input().rstrip()\n\nfrom collections import Counter\n\ncount = Counter(S)\n\nfor _ in range(Q):\n (l, r) = map(int, input().split())\n print(count[S[l - 1 : r]] - 1)", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nS = input().rstrip()\n\nfrom collections import defaultdict\n\nd = defaultdict(int)\nfor i in range(N - 1):\n if S[i] == S[i + 1]:\n d[i] += 1\n d[i + 1] += 1\n\nfor i in range(Q):\n (l, r) = map(int, input().split())\n l -= 1\n r -= 1\n print(d[l] + d[r] - d[l + 1 : r].count(2))", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nS = input().rstrip()\n\nfrom collections import defaultdict\n\nd = defaultdict(int)\nfor i in range(N - 1):\n d[S[i : i + 2]] += 1\n\nfor _ in range(Q):\n (l, r) = map(int, input().split())\n l -= 1\n r -= 1\n print(d[S[l : r + 1]] - d[S[l]] - d[S[r : r + 2]])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s = input()\nwhile \"ABC\" in s:\n s = s.replace(\"ABC\", \"\", 1)\nprint(s)", "s = input()\nwhile \"ABC\" in s:\n s = s.replace(\"ABC\", \"\", 1)\nprint(s)", "s = input()\nwhile \"ABC\" in s:\n s = s.replace(\"ABC\", \"\", 1)\nprint(s)", "s = input()\nwhile \"ABC\" in s:\n s = s.replace(\"ABC\", \"\", 1)\nprint(s)", "s = input()\nwhile \"ABC\" in s:\n s = s.replace(\"ABC\", \"\", 1)\nprint(s)", "s = input()\nwhile \"ABC\" in s:\n s = s.replace(\"ABC\", \"\", 1)\nprint(s)", "s = input()\nwhile \"ABC\" in s:\n s = s.replace(\"ABC\", \"\", 1)\nprint(s)", "s = input()\nwhile \"ABC\" in s:\n s = s.replace(\"ABC\", \"\", 1)\nprint(s)", "s = input()\n\nwhile \"ABC\" in s:\n s = s.replace(\"ABC\", \"\", 1)\n\nprint(s)", "s = input()\nwhile \"ABC\" in s:\n s = s.replace(\"ABC\", \"\", 1)\nprint(s)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import defaultdict\nfrom functools import lru_cache\n\nN, M, K = map(int, input().split())\n\nedges = []\nfor _ in range(M):\n u, v, w = map(int, input().split())\n edges.append((u - 1, v - 1, w))\n\n@lru_cache(None)\ndef go(mask, prev):\n if mask == (1 << N) - 1:\n return 0\n res = float('inf')\n for i in range(N):\n if mask & (1 << i) == 0:\n for j in range(N):\n if i != j and (mask & (1 << j)) != 0:\n if (i, j) != (prev[0], prev[1]) and (j, i) != (prev[0], prev[1]):\n res = min(res, w[i][j] + go(mask | (1 << i), (i, j)))\n return res\n\nw = [[0] * N for _ in range(N)]\nfor u, v, c in edges:\n w[u][v] = w[v][u] = c\n\nans = go(1, (-1, -1))\nprint(ans % K)", "import sys\n\ninput = sys.stdin.readline\n\nN, M, K = map(int, input().split())\n\ngraph = [[] for _ in range(N)]\n\nfor _ in range(M):\n u, v, w = map(int, input().split())\n u -= 1\n v -= 1\n graph[u].append((v, w))\n graph[v].append((u, w))\n\ndp = [10**18] * (1 << N)\ndp[0] = 0\n\nfor i in range(1 << N):\n for j in range(N):\n if i >> j & 1:\n for k, l in graph[j]:\n if i >> k & 1:\n dp[i] = min(dp[i], dp[i ^ 1 << j] + l)\n\nprint(dp[-1] % K)", "import sys\n\ninput = sys.stdin.readline\n\nN, M, K = map(int, input().split())\n\ngraph = [[] for _ in range(N)]\n\nfor _ in range(M):\n u, v, w = map(int, input().split())\n u -= 1\n v -= 1\n graph[u].append((v, w))\n graph[v].append((u, w))\n\nfrom collections import deque\n\nINF = float(\"inf\")\n\ndist = [INF] * N\ndist[0] = 0\n\nq = deque([0])\n\nwhile q:\n now = q.popleft()\n for to, cost in graph[now]:\n if dist[now] + cost < dist[to]:\n dist[to] = dist[now] + cost\n q.append(to)\n\nans = 0\nfor i in range(N):\n ans += dist[i] % K\n ans %= K\n\nprint(ans)", "from collections import defaultdict\n\nN, M, K = map(int, input().split())\n\ngraph = defaultdict(list)\n\nfor i in range(M):\n u, v, w = map(int, input().split())\n graph[u].append((v, w))\n graph[v].append((u, w))\n\ndef find_min_cost_spanning_tree(graph, K):\n def find(v):\n if v == p[v]:\n return v\n p[v] = find(p[v])\n return p[v]\n\n def union(u, v):\n pu, pv = find(u), find(v)\n if pu == pv:\n return False\n if rank[pu] < rank[pv]:\n p[pu] = pv\n else:\n p[pv] = pu\n if rank[pu] == rank[pv]:\n rank[pu] += 1\n return True\n\n rank = {i: 0 for i in range(1, N + 1)}\n p = {i: i for i in range(1, N + 1)}\n\n edges = []\n for u in range(1, N + 1):\n for v, w in graph[u]:\n edges.append((u, v, w))\n\n edges.sort(key=lambda x: x[2])\n\n total_cost = 0\n for u, v, w in edges:\n if union(u, v):\n total_cost += w\n total_cost %= K\n\n return total_cost\n\nprint(find_min_cost_spanning_tree(graph, K))", "from collections import defaultdict\n\nn, m, k = map(int, input().split())\nedges = defaultdict(list)\nfor _ in range(m):\n u, v, w = map(int, input().split())\n edges[u].append((v, w))\n edges[v].append((u, w))\n\nfrom functools import lru_cache\n\n\n@lru_cache(None)\ndef dfs(node, parent, s, w):\n if len(s) == n:\n return w % k\n res = float(\"inf\")\n for v, c in edges[node]:\n if v != parent:\n res = min(res, dfs(v, node, s | {v}, w + c))\n return res\n\n\nprint(dfs(1, 0, {1}, 0))", "from collections import defaultdict\n\nN, M, K = map(int, input().split())\n\ngraph = defaultdict(list)\n\nfor _ in range(M):\n u, v, w = map(int, input().split())\n graph[u].append((v, w))\n graph[v].append((u, w))\n\ndef find_min_cost(graph, K):\n min_cost = 0\n visited = [False] * (N + 1)\n stack = [(1, 0)]\n\n while stack:\n vertex, cost = stack.pop()\n if visited[vertex]:\n continue\n visited[vertex] = True\n min_cost += cost % K\n for next_vertex, edge_cost in graph[vertex]:\n if not visited[next_vertex]:\n stack.append((next_vertex, edge_cost))\n\n return min_cost % K\n\nprint(find_min_cost(graph, K))", "from collections import defaultdict\n\nN, M, K = map(int, input().split())\n\ngraph = defaultdict(list)\n\nfor _ in range(M):\n u, v, w = map(int, input().split())\n graph[u].append((v, w))\n graph[v].append((u, w))\n\ndef find_min_cost_spanning_tree(graph, K):\n visited = [False] * (N + 1)\n min_cost = 0\n stack = [(1, 0)]\n\n while stack:\n vertex, cost = stack.pop()\n if visited[vertex]:\n continue\n visited[vertex] = True\n min_cost = (min_cost + cost) % K\n for neighbour, weight in graph[vertex]:\n if not visited[neighbour]:\n stack.append((neighbour, weight))\n\n return min_cost\n\nprint(find_min_cost_spanning_tree(graph, K))", "from collections import defaultdict\n\nn, m, k = map(int, input().split())\n\ngraph = defaultdict(list)\n\nfor _ in range(m):\n u, v, w = map(int, input().split())\n graph[u].append((v, w))\n graph[v].append((u, w))\n\nfrom collections import deque\n\nstart = 1\nvisited = [False] * (n + 1)\nparent = [-1] * (n + 1)\nq = deque()\nq.append(start)\nvisited[start] = True\n\nwhile q:\n u = q.popleft()\n for v, w in graph[u]:\n if not visited[v]:\n visited[v] = True\n q.append(v)\n parent[v] = u\n\ncost = 0\nfor i in range(2, n + 1):\n cost += graph[i][parent[i] - 1][1]\n\nprint(cost % k)", "import sys\n\ninput = sys.stdin.readline\n\nN, M, K = map(int, input().split())\n\ngraph = [[] for _ in range(N)]\n\nfor _ in range(M):\n u, v, w = map(int, input().split())\n u -= 1\n v -= 1\n graph[u].append((v, w))\n graph[v].append((u, w))\n\nfrom collections import deque\n\nINF = float(\"inf\")\n\ndist = [INF] * N\ndist[0] = 0\n\nq = deque([0])\n\nwhile q:\n v = q.popleft()\n for nv, c in graph[v]:\n if dist[nv] > dist[v] + c:\n dist[nv] = dist[v] + c\n q.append(nv)\n\nans = 0\nfor i in range(N):\n ans += dist[i] % K\n ans %= K\n\nprint(ans)", "from collections import defaultdict\n\nN, M, K = map(int, input().split())\n\ngraph = defaultdict(list)\n\nfor _ in range(M):\n u, v, w = map(int, input().split())\n graph[u].append((v, w))\n graph[v].append((u, w))\n\ndef find_min_cost_spanning_tree(graph, K):\n def find(u, parent):\n min_cost = float('inf')\n for v, w in graph[u]:\n if v != parent:\n if w < min_cost:\n min_cost = w\n min_v = v\n return min_v, min_cost\n\n def union(u, v):\n for i in graph[v]:\n if i[0] == u:\n graph[v].remove(i)\n break\n\n cost = 0\n visited = [False] * (N + 1)\n stack = [1]\n visited[1] = True\n\n while stack:\n u = stack[-1]\n if not graph[u]:\n stack.pop()\n continue\n v, w = find(u, -1)\n cost += w % K\n union(u, v)\n stack.append(v)\n visited[v] = True\n\n return cost % K\n\nprint(find_min_cost_spanning_tree(graph, K))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s = input()\r\nfor i in s:\r\n print(i, end=\" \")", "s = input()\r\nfor i in s:\r\n print(i, end=\" \")\r", "S = input()\r\nfor i in S:\r\n print(i, end=\" \")", "S = input()\r\nfor i in S:\r\n print(i, end=\" \")", "s = input()\r\nfor i in s:\r\n print(i, end=\" \")", "s = input()\r\nfor i in s:\r\n print(i, end=\" \")", "S = input()\r\nprint(*S, sep=\" \")", "S = input()\nprint(*S, sep=\" \")", "s = input()\r\nfor i in s:\r\n print(i, end=\" \")", "S = input()\r\nfor i in S:\r\n print(i, end=\" \")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\na = list(map(int, input().split()))\r\nm = max(a)\r\nprint(max([i for i in a if i != m]))\r", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = max(a)\r\nprint(max([x for x in a if x != m]))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = max(a)\r\nprint(max([x for x in a if x != m]))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = max(a)\r\na = [i for i in a if i != m]\r\nprint(max(a))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = max(a)\r\nprint(max([x for x in a if x != m]))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = max(a)\r\na = [i for i in a if i != m]\r\nprint(max(a))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = max(a)\r\na.remove(m)\r\nprint(max(a))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = max(a)\r\nprint(max([i for i in a if i != m]))\r", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = max(a)\r\na.remove(m)\r\nprint(max(a))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = max(a)\r\nprint(max([x for x in a if x != m]))" ], "pass1_list": [ true, true, true, true, true, true, false, true, false, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ns = input()\n\ncount = 0\ncurrent = 1\n\nfor i in range(1, n):\n if s[i] == s[i - 1]:\n current += 1\n else:\n count += (current * (current + 1)) // 2\n current = 1\n\ncount += (current * (current + 1)) // 2\n\nprint(count)", "n = int(input())\ns = input()\nans = 0\ncnt = 1\nfor i in range(1, n):\n if s[i] == s[i - 1]:\n cnt += 1\n else:\n ans += (cnt * (cnt + 1)) // 2\n cnt = 1\nans += (cnt * (cnt + 1)) // 2\nprint(ans)", "n = int(input())\ns = input()\nans = 0\ncnt = 1\nfor i in range(1, n):\n if s[i] == s[i - 1]:\n cnt += 1\n else:\n ans += (cnt * (cnt + 1)) // 2\n cnt = 1\nans += (cnt * (cnt + 1)) // 2\nprint(ans)", "n = int(input())\r\ns = input()\r\n\r\ncount = 0\r\nlast = None\r\nlast_count = 0\r\n\r\nfor c in s:\r\n if c == last:\r\n last_count += 1\r\n else:\r\n if last is not None:\r\n count += (last_count * (last_count + 1)) // 2\r\n last = c\r\n last_count = 1\r\n\r\ncount += (last_count * (last_count + 1)) // 2\r\nprint(count)\r", "n = int(input())\r\ns = input()\r\nans = 0\r\nfor i in range(n):\r\n if i == 0 or s[i] == s[i - 1]:\r\n ans += 1\r\n else:\r\n ans += 2\r\nprint(ans)\r", "n = int(input())\r\ns = input()\r\n\r\ncount = 0\r\ncurrent = 1\r\n\r\nfor i in range(1, n):\r\n if s[i] == s[i - 1]:\r\n current += 1\r\n else:\r\n count += (current * (current + 1)) // 2\r\n current = 1\r\n\r\ncount += (current * (current + 1)) // 2\r\n\r\nprint(count)\r", "n = int(input())\ns = input()\nans = 0\ncnt = 1\nfor i in range(1, n):\n if s[i] == s[i - 1]:\n cnt += 1\n else:\n ans += (cnt * (cnt + 1)) // 2\n cnt = 1\nans += (cnt * (cnt + 1)) // 2\nprint(ans)", "n = int(input())\ns = input()\n\ncount = 0\nlast = None\n\nfor c in s:\n if c == last:\n count += 1\n else:\n count += 2\n last = c\n\nprint(count)", "n = int(input())\ns = input()\nans = 0\ncnt = 1\nfor i in range(1, n):\n if s[i] == s[i - 1]:\n cnt += 1\n else:\n ans += (cnt * (cnt + 1)) // 2\n cnt = 1\nans += (cnt * (cnt + 1)) // 2\nprint(ans)", "n = int(input())\ns = input()\nans = 0\ncnt = 1\nfor i in range(1, n):\n if s[i] == s[i - 1]:\n cnt += 1\n else:\n ans += cnt * (cnt + 1) // 2\n cnt = 1\nans += cnt * (cnt + 1) // 2\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\na = list(map(int, input().split()))\nc = [0] * (n + 1)\nfor i in a:\n c[i] += 1\n mx = max(c)\n mn = min(list(range(1, n + 1)), key=lambda x: (c[x], x))\n if mx == c[mn]:\n print(mn)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nd = {}\nfor i in a:\n d[i] = d.get(i, 0) + 1\n mx = max(d.values())\n mn = min([k for k, v in d.items() if v == mx])\n print(mn)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor i in a:\r\n d[i] = d.get(i, 0) + 1\r\n mx = max(d.values())\r\n mn = min(k for k, v in d.items() if v == mx)\r\n print(mn)\r", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = [0] * (n + 1)\r\nw = 1\r\nfor i in a:\r\n c[i] += 1\r\n if c[i] >= c[w]:\r\n w = i\r\n print(w)\r", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nc = [0] * (n + 1)\nfor i in a:\n c[i] += 1\n mx = max(c)\n mn = min(list(range(1, n + 1)), key=lambda x: (c[x], x))\n if mx == c[mn]:\n print(mn)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor i in a:\r\n d[i] = d.get(i, 0) + 1\r\n mx = max(d.values())\r\n mn = min([i for i in d if d[i] == mx])\r\n print(mn)\r", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nd = {}\nfor i in a:\n d[i] = d.get(i, 0) + 1\n mx = max(d.values())\n mn = min([k for k, v in d.items() if v == mx])\n print(mn)", "from collections import Counter\n\n(n, m) = map(int, input().split())\na = list(map(int, input().split()))\nc = Counter()\nc[a[0]] = 1\nwinner = a[0]\nfor i in range(1, m):\n c[a[i]] += 1\n if c[a[i]] > c[winner]:\n winner = a[i]\n print(winner)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nc = [0] * (n + 1)\np = 1\nfor i in a:\n c[i] += 1\n if c[i] >= c[p]:\n p = i\n print(p)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nc = [0] * (n + 1)\nfor i in a:\n c[i] += 1\n mx = max(c)\n mn = min(range(n + 1), key=lambda x: (c[x], x))\n print(mn)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\ns = input()\nt = input()\nfor i in range(n - m + 1):\n if s[i : i + m] == t:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\ns = input()\nt = input()\nfor i in range(n - m + 1):\n if s[i : i + m] == t:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\ns = input()\nt = input()\nfor i in range(n - m + 1):\n if s[i : i + m] == t:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\ns = input()\nt = input()\nfor i in range(n - m + 1):\n if s[i : i + m] == t:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\ns = input()\nt = input()\nfor i in range(n - m + 1):\n if s[i : i + m] == t:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\ns = input()\nt = input()\nfor i in range(n - m + 1):\n if s[i : i + m] == t:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\ns = input()\nt = input()\nfor i in range(n - m + 1):\n if s[i : i + m] == t:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\ns = input()\nt = input()\n\nfor i in range(n - m + 1):\n if s[i : i + m] == t:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\ns = input()\nt = input()\nfor i in range(n - m + 1):\n if s[i : i + m] == t:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\ns = input()\nt = input()\nfor i in range(n - m + 1):\n if s[i : i + m] == t:\n print(\"Yes\")\n exit()\nprint(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, q = map(int, input().split())\nc = list(map(int, input().split()))\ncolor = [[] for _ in range(n + 1)]\nfor i in range(n):\n color[c[i]].append(i + 1)\nfor _ in range(q):\n a, b = map(int, input().split())\n color[b] += [i for i in color[a]]\n color[a] = []\n print(len(set(color[b])))", "n, q = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nbox = [[] for _ in range(n + 1)]\r\nfor i in range(n):\r\n box[i + 1].append(c[i])\r\nfor _ in range(q):\r\n a, b = map(int, input().split())\r\n box[b] += box[a]\r\n print(len(set(box[b])))\r", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\nc = list(map(int, input().split()))\ncolor = [[] for _ in range(n + 1)]\nfor i in range(n):\n color[c[i]].append(i + 1)\nfor _ in range(q):\n (a, b) = map(int, input().split())\n color[b] += color[a]\n print(len(set(color[b])))\n color[a] = []", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\nc = list(map(int, input().split()))\ncolor = [[] for _ in range(n + 1)]\nfor i in range(n):\n color[c[i]].append(i + 1)\nfor _ in range(q):\n (a, b) = map(int, input().split())\n color[b] += color[a]\n color[a] = []\n print(len(set(color[b])))", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = map(int, input().split())\nC = list(map(int, input().split()))\n\ncolor_box = [[] for _ in range(N + 1)]\nfor i in range(N):\n color_box[C[i]].append(i + 1)\n\nfor _ in range(Q):\n a, b = map(int, input().split())\n color_box[b] += color_box[a]\n color_box[a] = []\n print(len(set(color_box[b])))", "n, q = map(int, input().split())\r\nc = list(map(int, input().split()))\r\ncolor = [[] for _ in range(n + 1)]\r\nfor i in range(n):\r\n color[c[i]].append(i + 1)\r\nfor _ in range(q):\r\n a, b = map(int, input().split())\r\n color[b] += [i for i in color[a]]\r\n print(len(set(color[b])))\r", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\nc = list(map(int, input().split()))\ncolor = set(c)\nfor _ in range(q):\n (a, b) = map(int, input().split())\n if c[a - 1] in color:\n color.remove(c[a - 1])\n c[b - 1] = c[a - 1]\n color.add(c[b - 1])\n print(len(color))", "import sys\n\ninput = sys.stdin.readline\n\nn, q = map(int, input().split())\nc = list(map(int, input().split()))\n\ncolor = [[] for _ in range(n + 1)]\nfor i in range(n):\n color[c[i]].append(i + 1)\n\nfor _ in range(q):\n a, b = map(int, input().split())\n color[c[a - 1]] = [b]\n print(len(set(color[c[a - 1]])))", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\nc = list(map(int, input().split()))\ncolor = [[] for _ in range(n + 1)]\nfor i in range(n):\n color[c[i]].append(i + 1)\nfor _ in range(q):\n (a, b) = map(int, input().split())\n color[c[a - 1]] = [i for i in color[c[a - 1]] if i != a]\n c[a - 1] = c[b - 1]\n color[c[b - 1]].append(a)\n print(len(set(color[c[b - 1]])))", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\nc = list(map(int, input().split()))\nbox = [[] for _ in range(n + 1)]\nfor i in range(n):\n box[c[i]].append(i + 1)\nfor _ in range(q):\n (a, b) = map(int, input().split())\n box[b] += box[a]\n box[a] = []\n print(len(set(box[b])))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, l = map(int, input().split())\na = list(map(int, input().split()))\nprint(sum([1 for i in a if i >= l]))", "n, l = map(int, input().split())\na = list(map(int, input().split()))\nc = 0\nfor i in a:\n if i >= l:\n c += 1\nprint(c)", "n, l = map(int, input().split())\na = list(map(int, input().split()))\nc = 0\nfor i in a:\n if i >= l:\n c += 1\nprint(c)", "n, l = map(int, input().split())\na = list(map(int, input().split()))\nprint(sum([1 for i in a if i >= l]))", "n, l = map(int, input().split())\na = list(map(int, input().split()))\nprint(sum([1 for i in a if i >= l]))", "n, l = map(int, input().split())\na = list(map(int, input().split()))\nprint(sum([1 for i in a if i >= l]))", "n, l = map(int, input().split())\na = list(map(int, input().split()))\nprint(sum([1 for i in a if i >= l]))", "n, l = map(int, input().split())\na = list(map(int, input().split()))\nprint(sum([1 for i in a if i >= l]))", "n, l = map(int, input().split())\na = list(map(int, input().split()))\nprint(sum([1 for i in a if i >= l]))", "n, l = map(int, input().split())\na = list(map(int, input().split()))\nprint(sum([1 for i in a if i >= l]))" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n, l, r = map(int, input().split())\na = list(map(int, input().split()))\n\nfor i in a:\n if i < l:\n print(l, end=\" \")\n elif i > r:\n print(r, end=\" \")\n else:\n print(i, end=\" \")", "n, l, r = map(int, input().split())\na = list(map(int, input().split()))\n\nfor i in a:\n if i >= l and i <= r:\n print(i, end=\" \")\n elif i < l:\n print(l, end=\" \")\n else:\n print(r, end=\" \")", "n, l, r = map(int, input().split())\na = list(map(int, input().split()))\nfor i in a:\n if i < l:\n print(l, end=\" \")\n elif i > r:\n print(r, end=\" \")\n else:\n print(i, end=\" \")", "n, l, r = map(int, input().split())\na = list(map(int, input().split()))\nfor i in range(n):\n if a[i] < l:\n a[i] = l\n elif a[i] > r:\n a[i] = r\nprint(*a)", "n, l, r = map(int, input().split())\na = list(map(int, input().split()))\nfor i in a:\n if i < l:\n print(l, end=\" \")\n elif i > r:\n print(r, end=\" \")\n else:\n print(i, end=\" \")", "n, l, r = map(int, input().split())\na = list(map(int, input().split()))\nfor i in a:\n if i < l:\n print(l, end=\" \")\n elif i > r:\n print(r, end=\" \")\n else:\n print(i, end=\" \")", "n, l, r = map(int, input().split())\na = list(map(int, input().split()))\nfor i in a:\n if i < l:\n print(l, end=\" \")\n elif i > r:\n print(r, end=\" \")\n else:\n print(i, end=\" \")", "n, l, r = map(int, input().split())\na = list(map(int, input().split()))\nfor i in a:\n if i < l:\n print(l, end=\" \")\n elif i > r:\n print(r, end=\" \")\n else:\n print(i, end=\" \")", "n, l, r = map(int, input().split())\na = list(map(int, input().split()))\nfor i in a:\n if i < l:\n print(l, end=\" \")\n elif i > r:\n print(r, end=\" \")\n else:\n print(i, end=\" \")", "n, l, r = map(int, input().split())\na = list(map(int, input().split()))\nfor i in range(n):\n if a[i] < l:\n a[i] = l\n elif a[i] > r:\n a[i] = r\nprint(*a)" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "import math\n\nD = int(input())\n\nif D % 2 == 0:\n print(0)\nelse:\n print(1)", "import math\n\nD = int(input())\n\nans = D\nfor i in range(int(math.sqrt(D)) + 1):\n for j in range(int(math.sqrt(D)) + 1):\n ans = min(ans, abs(i * i + j * j - D))\n\nprint(ans)", "import math\n\nD = int(input())\n\nif D % 2 == 0:\n print(0)\nelse:\n print(1)", "import math\n\nD = int(input())\n\nans = D\nfor i in range(int(D**0.5) + 1):\n for j in range(int(D**0.5) + 1):\n ans = min(ans, abs(i**2 + j**2 - D))\n\nprint(ans)", "import math\n\nD = int(input())\n\nans = D\nfor i in range(int(math.sqrt(D)) + 1):\n for j in range(int(math.sqrt(D)) + 1):\n ans = min(ans, abs(i**2 + j**2 - D))\n\nprint(ans)", "import math\n\nD = int(input())\n\nif D % 2 == 1:\n print(1)\nelse:\n d = int(math.sqrt(D))\n if d * d == D:\n print(0)\n else:\n print(min(d - int(math.sqrt(D / 2)), int(math.sqrt(D / 2)) - d))", "import math\n\nD = int(input())\n\nfor i in range(int(math.sqrt(D)) + 1):\n for j in range(int(math.sqrt(D)) + 1):\n if (i + j) * (i + j) == D:\n print(0)\n exit()\n\nprint(1)", "import math\n\nD = int(input())\n\nif D % 2 == 1:\n print(1)\nelse:\n print(0 if D == 2 else math.floor(math.sqrt(D) - 1) % 2)", "import math\n\nD = int(input())\n\nans = D\nfor i in range(int(math.sqrt(D)) + 1):\n for j in range(int(math.sqrt(D)) + 1):\n ans = min(ans, abs(i * i + j * j - D))\nprint(ans)", "import math\n\nD = int(input())\n\nans = D\nfor i in range(int(math.sqrt(D)) + 1):\n for j in range(int(math.sqrt(D)) + 1):\n ans = min(ans, abs(i * i + j * j - D))\n\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ns = [input() for _ in range(n)]\n\nans = 0\nfor i in range(n):\n for j in range(n):\n if s[i][j] != 'o':\n continue\n for k in range(n):\n if s[i][k] == 'o' and s[k][j] == 'o':\n ans += 1\nprint(ans // 3)", "n = int(input())\ns = [input() for _ in range(n)]\n\nans = 0\nfor i in range(n):\n for j in range(n):\n if s[i][j] != 'o':\n continue\n for k in range(n):\n if s[i][k] == 'o' and s[k][j] == 'o':\n ans += 1\nprint(ans // 3)", "n = int(input())\ns = [input() for _ in range(n)]\nans = 0\nfor i in range(n):\n for j in range(n):\n if s[i][j] == 'o':\n ans += sum([s[k][j] == 'o' for k in range(n)]) - 1\n ans += sum([s[i][k] == 'o' for k in range(n)]) - 1\nprint(ans // 3)", "n = int(input())\ns = [input() for _ in range(n)]\n\nans = 0\nfor i in range(n):\n for j in range(n):\n if s[i][j] != 'o':\n continue\n for k in range(n):\n if s[i][k] == 'o' and s[k][j] == 'o':\n ans += 1\nprint(ans // 3)", "n = int(input())\ns = [input() for i in range(n)]\n\nans = 0\nfor i in range(n):\n for j in range(n):\n if s[i][j] == \"o\":\n ans += sum([s[k].count(\"o\") for k in range(n) if k != i]) - 1\nprint(ans // 3)", "n = int(input())\ns = [input() for _ in range(n)]\n\nans = 0\nfor i in range(n):\n for j in range(n):\n if s[i][j] == \"o\":\n ans += sum([s[k][j] == \"o\" for k in range(n)]) - 1\n ans += sum([s[i][k] == \"o\" for k in range(n)]) - 1\n\nprint(ans // 3)", "n = int(input())\ns = []\nfor i in range(n):\n s.append(input())\nans = 0\nfor i in range(n):\n for j in range(n):\n if s[i][j] == 'o':\n ans += (s[i][:j].count('o') + s[i][j + 1 :].count('o')) * (\n s[:i].count('o') + s[i + 1 :].count('o')\n )\nprint(ans // 3)", "n = int(input())\ns = []\nfor i in range(n):\n s.append(input())\nans = 0\nfor i in range(n):\n for j in range(n):\n if s[i][j] == \"o\":\n ans += s[i].count(\"o\") - 1\n ans += s[j].count(\"o\") - 1\nprint(ans // 3)", "n = int(input())\ns = []\nfor i in range(n):\n s.append(input())\nans = 0\nfor i in range(n):\n for j in range(n):\n if s[i][j] == 'o':\n ans += s[i].count('o') - 1\n ans += s[:, j].count('o') - 1\nprint(ans // 3)", "n = int(input())\ns = [input() for _ in range(n)]\nans = 0\nfor i in range(n):\n for j in range(n):\n if s[i][j] == \"o\":\n ans += sum([s[k].count(\"o\") for k in range(n) if k != i]) - s[i].count(\"o\")\nprint(ans // 3)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN, Q = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nBIT = [0] * (N + 1)\n\n\ndef update(i, x):\n while i <= N:\n if BIT[i] == 0:\n BIT[i] = x\n i += i & -i\n else:\n break\n\n\ndef get(i):\n res = 0\n while i > 0:\n res = max(res, BIT[i])\n i -= i & -i\n return res\n\n\nfor i, x in (list(map(int, input().split())) for _ in range(Q)):\n i -= 1\n update(i, x)\n print(get(N + 1))", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = map(int, input().split())\nA = list(map(int, input().split()))\n\nfor i in range(Q):\n i_k, x_k = map(int, input().split())\n i_k -= 1\n A[i_k] = x_k\n A.sort()\n if A[0] > 0:\n print(0)\n else:\n for j in range(len(A)):\n if A[j] != j:\n print(j)\n break", "from collections import Counter\n\n(n, q) = map(int, input().split())\na = list(map(int, input().split()))\nc = Counter(a)\nfor _ in range(q):\n (i, x) = map(int, input().split())\n i -= 1\n if a[i] in c:\n del c[a[i]]\n a[i] = x\n c[x] += 1\n mex = 0\n while mex in c:\n mex += 1\n print(mex)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nfor i in range(N):\n A[i] = -1 if A[i] == 0 else A[i]\n\nB = [0] * (10**5 + 1)\n\nfor i in range(N):\n B[A[i]] = 1\n\nfor i in range(Q):\n i_k, x_k = list(map(int, input().split()))\n i_k -= 1\n A[i_k] = x_k\n if A[i_k] == 0:\n A[i_k] = -1\n else:\n B[A[i_k]] = 1\n\n ans = 0\n while B[ans] == 1:\n ans += 1\n\n sys.stdout.write(str(ans) + \"\\n\")\n sys.stdout.flush()", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nA = list(map(int, input().split()))\nbit = [0] * (N + 1)\n\n\ndef update(i, x):\n while i <= N:\n if bit[i] == 0:\n bit[i] = x\n else:\n break\n i += i & -i\n\n\ndef get(i):\n res = 0\n while i > 0:\n res = max(res, bit[i])\n i -= i & -i\n return res\n\n\nfor _ in range(Q):\n (i, x) = map(int, input().split())\n i -= 1\n update(i, x)\n print(get(N + 1))", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nfor i in range(N):\n A[i] = -A[i] - 1\n\nfor i in range(N):\n A[i] = i - A[i]\n\nfor _ in range(Q):\n i, x = list(map(int, input().split()))\n i -= 1\n A[i] = -x - 1\n ans = 0\n while A[ans] < 0:\n ans += 1\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = map(int, input().split())\nA = list(map(int, input().split()))\n\nbit = [0] * (N + 1)\n\n\ndef get(i):\n s = 0\n while i > 0:\n s += bit[i]\n i -= i & -i\n return s\n\n\ndef add(i, x):\n while i <= N:\n bit[i] += x\n i += i & -i\n\n\nfor _ in range(Q):\n i, x = map(int, input().split())\n i -= 1\n if get(x + 1) == 0:\n print(x)\n else:\n print(get(x + 1) - 1)\n add(A[i] + 1, -1)\n A[i] = x\n add(A[i] + 1, 1)", "from collections import Counter\n\n(n, q) = map(int, input().split())\na = list(map(int, input().split()))\nc = Counter(a)\nfor _ in range(q):\n (i, x) = map(int, input().split())\n c[a[i - 1]] -= 1\n a[i - 1] = x\n c[x] += 1\n mex = 0\n while c[mex] > 0:\n mex += 1\n print(mex)", "from collections import Counter\n\n(n, q) = map(int, input().split())\na = list(map(int, input().split()))\nc = Counter(a)\nfor _ in range(q):\n (i, x) = map(int, input().split())\n i -= 1\n if a[i] in c:\n del c[a[i]]\n a[i] = x\n c[x] += 1\n mex = 0\n while mex in c:\n mex += 1\n print(mex)", "from collections import Counter\n\n(n, q) = map(int, input().split())\na = list(map(int, input().split()))\nc = Counter(a)\nfor _ in range(q):\n (i, x) = map(int, input().split())\n c[a[i - 1]] -= 1\n a[i - 1] = x\n c[x] += 1\n mex = 0\n while c[mex] > 0:\n mex += 1\n print(mex)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "m, d = map(int, input().split())\ny, mo, da = map(int, input().split())\n\nif da + 1 > d:\n mo += 1\n da = 1\n if mo > m:\n y += 1\n mo = 1\nelse:\n da += 1\n\nprint(y, mo, da)", "(M, D) = map(int, input().split())\n(y, m, d) = map(int, input().split())\nif d == D:\n m += 1\n d = 1\n if m > M:\n m = 1\n y += 1\nelse:\n d += 1\nprint(y, m, d)", "m, d = map(int, input().split())\ny, mo, da = map(int, input().split())\n\nif da + 1 <= d:\n print(y, mo, da + 1)\nelse:\n da = 1\n mo += 1\n if mo > m:\n mo = 1\n y += 1\n print(y, mo, da)", "(M, D), (y, m, d) = map(int, open(0).read().split()), map(int, input().split())\nprint(y + (m == M and d == D), m % M + 1, d % D + 1)", "m, d = map(int, input().split())\ny, mo, da = map(int, input().split())\n\nif da + 1 <= d:\n print(y, mo, da + 1)\nelse:\n da = 1\n mo += 1\n if mo > m:\n mo = 1\n y += 1\n print(y, mo, da)", "m, d = map(int, input().split())\ny, mo, da = map(int, input().split())\n\nif da + 1 > d:\n mo += 1\n da = 1\n if mo > m:\n mo = 1\n y += 1\nelse:\n da += 1\n\nprint(y, mo, da)", "m, d = map(int, input().split())\ny, mo, da = map(int, input().split())\n\nda += 1\nif da > d:\n da = 1\n mo += 1\n if mo > m:\n mo = 1\n y += 1\n\nprint(y, mo, da)", "(M, D) = map(int, input().split())\n(y, m, d) = map(int, input().split())\nif d == D:\n m += 1\n d = 1\n if m > M:\n m = 1\n y += 1\nelse:\n d += 1\nprint(y, m, d)", "m, d = map(int, input().split())\r\ny, mo, da = map(int, input().split())\r\n\r\nda += 1\r\nif da > d:\r\n da = 1\r\n mo += 1\r\n if mo > m:\r\n mo = 1\r\n y += 1\r\n\r\nprint(y, mo, da)\r", "m, d = map(int, input().split())\ny, mo, da = map(int, input().split())\n\nif da + 1 > d:\n mo += 1\n da = 1\n if mo > m:\n mo = 1\n y += 1\nelse:\n da += 1\n\nprint(y, mo, da)" ], "pass1_list": [ true, true, true, false, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n, s, m, l = map(int, input().split())\n\nans = 10**5\nfor i in range(n // 6 + 1):\n for j in range(n // 8 + 1):\n k = (n - i * 6 - j * 8) // 12\n ans = min(ans, i * s + j * m + k * l)\nprint(ans)", "n, s, m, l = map(int, input().split())\n\nans = 10**9\nfor i in range(n // 6 + 1):\n for j in range(n // 8 + 1):\n k = (n - 6 * i - 8 * j) // 12\n ans = min(ans, s * i + m * j + l * k)\nprint(ans)", "n, s, m, l = map(int, input().split())\n\nsix = s // 6\neight = m // 8\ntwelve = l // 12\n\nans = 10**10\nfor i in range(n // 6 + 1):\n for j in range(n // 8 + 1):\n k = (n - i * 6 - j * 8) // 12\n ans = min(ans, i * s + j * m + k * l)\nprint(ans)", "n, s, m, l = map(int, input().split())\n\nsix = s // 6\neight = m // 8\ntwelve = l // 12\n\nans = 10**9\nfor i in range(n // 6 + 1):\n for j in range(n // 8 + 1):\n k = (n - i * 6 - j * 8) // 12\n if k >= 0:\n ans = min(ans, i * s + j * m + k * l)\nprint(ans)", "n, s, m, l = map(int, input().split())\n\nsix = s // 6\neight = m // 8\ntwelve = l // 12\n\nans = 10000000\nfor i in range(0, n // 6 + 1):\n for j in range(0, n // 8 + 1):\n k = (n - 6 * i - 8 * j) // 12\n if 6 * i + 8 * j + 12 * k >= n:\n ans = min(ans, s * i + m * j + l * k)\n\nprint(ans)", "n, s, m, l = map(int, input().split())\n\nsix = s // 6\neight = m // 8\ntwelve = l // 12\n\nans = 0\n\nwhile n > 0:\n if n >= 12 and twelve * 12 <= eight * 8 and twelve * 12 <= six * 6:\n n -= 12\n ans += l\n elif n >= 8 and eight * 8 <= twelve * 12 and eight * 8 <= six * 6:\n n -= 8\n ans += m\n elif n >= 6 and six * 6 <= twelve * 12 and six * 6 <= eight * 8:\n n -= 6\n ans += s\n\nprint(ans)", "n, s, m, l = map(int, input().split())\n\nsix = s // 6\neight = m // 8\ntwelve = l // 12\n\nans = 10**10\nfor i in range(0, n // 6 + 1):\n for j in range(0, n // 8 + 1):\n k = (n - 6 * i - 8 * j) // 12\n if k < 0:\n continue\n ans = min(ans, s * i + m * j + l * k)\n\nprint(ans)", "n, s, m, l = map(int, input().split())\r\n\r\nsix = s // 6\r\neight = m // 8\r\ntwelve = l // 12\r\n\r\nif six > eight and six > twelve:\r\n s = 6 * six\r\nelif eight > six and eight > twelve:\r\n s = 8 * eight\r\nelse:\r\n s = 12 * twelve\r\n\r\nwhile s < n:\r\n if six < eight and six < twelve:\r\n s += 6 * six\r\n elif eight < six and eight < twelve:\r\n s += 8 * eight\r\n else:\r\n s += 12 * twelve\r\n\r\nprint(s * 6 // n * n)\r", "n, s, m, l = map(int, input().split())\n\nsix = s // 6\neight = m // 8\ntwelve = l // 12\n\nans = 0\n\nwhile n > 0:\n if n >= 12 and twelve * 12 <= eight * 8 and twelve * 12 <= six * 6:\n n -= 12\n ans += l\n elif n >= 8 and eight * 8 <= twelve * 12 and eight * 8 <= six * 6:\n n -= 8\n ans += m\n else:\n n -= 6\n ans += s\n\nprint(ans)", "n, s, m, l = map(int, input().split())\n\nans = 10**5\nfor i in range(n // 6 + 1):\n for j in range(n // 8 + 1):\n k = (n - 6 * i - 8 * j) // 12\n ans = min(ans, s * i + m * j + l * k)\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = list(map(int, input().split()))\na.sort()\ns = [0] * n\nfor i in range(n - 1, -1, -1):\n s[i] = s[i + 1] if i + 1 < n else 0\n j = n - 1\n while j >= 0 and a[j] >= a[i]:\n s[i] += a[j]\n j -= 1\nprint(*s)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\ns = [0] * n\nfor i in range(n - 2, -1, -1):\n s[i] = s[i + 1] + a[i + 1]\nprint(*s)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\ns = [0] * n\nfor i in range(n - 2, -1, -1):\n s[i] = s[i + 1] + a[i + 1]\nprint(*s)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\ns = 0\nfor i in range(n - 1, -1, -1):\n s += a[i + 1 : n]\n print(s, end=\" \")", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nb = [0] * n\nfor i in range(n):\n b[i] = sum(a[i + 1 :])\nprint(*b)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\ns = 0\nfor i in range(n - 1, -1, -1):\n s += a[i + 1 : n]\n a[i] = s\nprint(*a)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nb = [0] * n\nfor i in range(n - 1, -1, -1):\n b[i] = sum(a[i + 1 :])\nprint(*b)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\ns = [0] * n\nfor i in range(n - 1, -1, -1):\n s[i] = sum(a[i + 1 :])\nprint(*s)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\ns = [0] * n\nfor i in range(n - 1, -1, -1):\n s[i] = sum(a[i + 1 :])\nprint(*s)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\ns = 0\nfor i in range(n - 1, -1, -1):\n s += a[i + 1 : n] and a[i + 1]\n print(s, end=\" \")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN, Q = list(map(int, input().split()))\nP = [input() for _ in range(N)]\n\nblack = [[0] * N for _ in range(N)]\nfor i in range(N):\n for j in range(N):\n if P[i][j] == \"B\":\n black[i][j] = 1\n\nfor i in range(N):\n for j in range(N - 1):\n black[i][j + 1] += black[i][j]\nfor i in range(N - 1):\n for j in range(N):\n black[i + 1][j] += black[i][j]\n\nfor _ in range(Q):\n A, B, C, D = list(map(int, input().split()))\n print(\n black[C % N][D % N] - black[C % N][B % N] - black[A % N][D % N] + black[A % N][B % N]\n )", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = map(int, input().split())\nP = [list(input().rstrip()) for _ in range(N)]\n\nblack = [[0] * N for _ in range(N)]\nfor i in range(N):\n for j in range(N):\n if P[i][j] == \"B\":\n black[i][j] = 1\n if i > 0:\n black[i][j] += black[i - 1][j]\n if j > 0:\n black[i][j] += black[i][j - 1]\n if i > 0 and j > 0:\n black[i][j] -= black[i - 1][j - 1]\n\nfor _ in range(Q):\n A, B, C, D = map(int, input().split())\n a, b = A % N, B % N\n c, d = C % N, D % N\n ans = 0\n if a <= c:\n ans += black[c][d] - black[c][b - 1] - black[a - 1][d] + black[a - 1][b - 1]\n else:\n ans += black[c][d] - black[a - 1][d] - black[c][b - 1] + black[a - 1][b - 1]\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = list(map(int, input().split()))\nP = [list(input().rstrip()) for i in range(N)]\n\nblack = [[0] * N for i in range(N)]\nfor i in range(N):\n for j in range(N):\n if P[i][j] == \"B\":\n black[i][j] = 1\n\nfor i in range(N):\n for j in range(N - 1):\n black[i][j + 1] += black[i][j]\nfor i in range(N - 1):\n for j in range(N):\n black[i + 1][j] += black[i][j]\n\nfor i in range(Q):\n A, B, C, D = list(map(int, input().split()))\n a = A % N\n b = B % N\n c = C % N\n d = D % N\n\n if a > c:\n a, c = c, a\n b, d = d, b\n\n if a == c:\n print(black[a][b] + black[a][d] - black[a][b] * 2)\n else:\n print(\n black[c][b] - black[a][b]\n + black[a][d]\n - black[c][d]\n + (c - a + 1) * (black[a][N - 1] - black[c][N - 1])\n )", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = map(int, input().split())\n\nP = [input().strip() for _ in range(N)]\n\nfor _ in range(Q):\n A, B, C, D = map(int, input().split())\n A, B, C, D = A % N, B % N, C % N, D % N\n ans = 0\n for i in range(A, C + 1):\n ans += P[i].count(\"B\") * (D - B + 1)\n if i <= A:\n ans += (C - i + 1) * (P[i][:B].count(\"B\") - P[i][:A + 1].count(\"B\"))\n elif i >= C:\n ans += (i - A) * (P[i][:B].count(\"B\") - P[i][C:].count(\"B\"))\n else:\n ans += (i - A) * (P[i][:B].count(\"B\"))\n ans += (C - i + 1) * (P[i][C:].count(\"B\"))\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = map(int, input().split())\n\nP = [list(input().rstrip()) for _ in range(N)]\n\nfor i in range(N):\n for j in range(N):\n if P[i][j] == \"B\":\n P[i][j] = 1\n else:\n P[i][j] = 0\n\nfor _ in range(Q):\n A, B, C, D = map(int, input().split())\n\n a = A % N\n b = B % N\n c = C % N\n d = D % N\n\n if a > c:\n a, c = c, a\n b, d = d, b\n\n ans = 0\n\n ans += (c - a + 1) * (P[a][b] + P[c][d])\n for i in range(a + 1, c):\n ans += P[i][b] + P[i][d]\n\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = map(int, input().split())\nP = [input() for _ in range(N)]\n\ntable = [[0] * N for _ in range(N)]\nfor i in range(N):\n for j in range(N):\n table[i][j] = table[i - 1][j] + table[i][j - 1] - table[i - 1][j - 1]\n if P[i][j] == \"B\":\n table[i][j] += 1\n\nfor _ in range(Q):\n A, B, C, D = map(int, input().split())\n print(\n table[C % N][D % N]\n - table[C % N][B % N]\n - table[A % N][D % N]\n + table[A % N][B % N]\n )", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = list(map(int, input().split()))\nP = [input().rstrip() for _ in range(N)]\n\ntable = [[0] * N for _ in range(N)]\nfor i in range(N):\n for j in range(N):\n table[i][j] = table[i - 1][j] + (1 if P[i][j] == \"B\" else 0)\n\nfor _ in range(Q):\n A, B, C, D = list(map(int, input().split()))\n A, B, C, D = A % N, B % N, C % N, D % N\n if A > C:\n A, C = C, A\n if B > D:\n B, D = D, B\n ans = 0\n ans += table[C][D] - table[C][B - 1] - table[A - 1][D] + table[A - 1][B - 1]\n for i in range(A, C + 1):\n ans += table[i][D] - table[i][B - 1]\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = list(map(int, input().split()))\n\nP = []\nfor i in range(N):\n P.append(input().strip())\n\nfor i in range(N):\n for j in range(N):\n if P[i][j] == \"B\":\n P[i] = P[i][:j] + \"0\" + P[i][j + 1 :]\n else:\n P[i] = P[i][:j] + \"1\" + P[i][j + 1 :]\n\nfor i in range(Q):\n A, B, C, D = list(map(int, input().split()))\n A, B, C, D = A % N, B % N, C % N, D % N\n if A > C:\n A, C = C, A\n if B > D:\n B, D = D, B\n ans = 0\n for i in range(A, C + 1):\n ans += int(P[i][B : D + 1].replace(\"1\", \"\"), 2)\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = list(map(int, input().split()))\nP = [list(input().rstrip()) for _ in range(N)]\n\ntable = [[0] * N for _ in range(N)]\nfor i in range(N):\n for j in range(N):\n if P[i][j] == \"B\":\n table[i][j] = 1\n\nfor i in range(N):\n for j in range(N - 1):\n table[i][j + 1] += table[i][j]\n\nfor i in range(N - 1):\n for j in range(N):\n table[i + 1][j] += table[i][j]\n\nfor _ in range(Q):\n A, B, C, D = list(map(int, input().split()))\n print(\n table[C % N][D % N]\n - table[C % N][B % N]\n - table[A % N][D % N]\n + table[A % N][B % N]\n )", "import sys\n\ninput = sys.stdin.readline\n\nN, Q = map(int, input().split())\nP = [input().rstrip() for _ in range(N)]\n\ntable = [[0] * N for _ in range(N)]\nfor i in range(N):\n for j in range(N):\n table[i][j] = table[i - 1][j] + table[i][j - 1] - table[i - 1][j - 1]\n if P[i][j] == \"B\":\n table[i][j] += 1\n table[i][j] += table[i - 1][j]\n table[i][j] += table[i][j - 1]\n table[i][j] -= table[i - 1][j - 1]\n\nfor _ in range(Q):\n A, B, C, D = map(int, input().split())\n print(table[C % N][D % N] - table[A % N][D % N] - table[C % N][B % N] + table[A % N][B % N])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m, l = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ncd = [list(map(int, input().split())) for _ in range(l)]\n\nfor c, d in cd:\n c, d = c - 1, d - 1\n b[d] = max(b[d], a[c] + b[d])\n\nprint(max(a + b))", "n, m, l = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ncd = [list(map(int, input().split())) for _ in range(l)]\n\nfor i in range(l):\n c, d = cd[i]\n c -= 1\n d -= 1\n b[d] = -1000000000\n\nans = 0\nfor i in range(n):\n for j in range(m):\n if b[j] != -1000000000:\n ans = max(ans, a[i] + b[j])\n\nprint(ans)", "n, m, l = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ncd = []\nfor i in range(l):\n c, d = map(int, input().split())\n cd.append((c, d))\nans = 0\nfor i in range(n):\n for j in range(m):\n if (i + 1, j + 1) not in cd:\n ans = max(ans, a[i] + b[j])\nprint(ans)", "n, m, l = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ncd = [list(map(int, input().split())) for _ in range(l)]\n\nfor i in range(l):\n c, d = cd[i]\n c -= 1\n d -= 1\n b[d] = -1000000000\n\nans = 0\nfor i in range(n):\n for j in range(m):\n if b[j] != -1000000000:\n ans = max(ans, a[i] + b[j])\n\nprint(ans)", "n, m, l = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ncd = [list(map(int, input().split())) for i in range(l)]\n\nfor i in range(l):\n c, d = cd[i]\n c, d = c - 1, d - 1\n b[d] = min(b[d], float(\"inf\"))\n\nans = 0\nfor i in a:\n for j in b:\n ans = max(ans, i + j)\nprint(ans)", "n, m, l = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ncd = [list(map(int, input().split())) for _ in range(l)]\n\nmax_price = 0\nfor i in range(n):\n for j in range(m):\n skip = False\n for c, d in cd:\n if c == i + 1 and d == j + 1:\n skip = True\n break\n if not skip:\n max_price = max(max_price, a[i] + b[j])\n\nprint(max_price)", "n, m, l = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = [0] * l\nd = [0] * l\nfor i in range(l):\n c[i], d[i] = map(int, input().split())\nc -= 1\nd -= 1\na.sort(reverse=True)\nb.sort(reverse=True)\nans = 0\nfor i in range(n):\n for j in range(m):\n if not [i, j] in zip(c, d):\n ans = max(ans, a[i] + b[j])\nprint(ans)", "n, m, l = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ncd = [list(map(int, input().split())) for _ in range(l)]\n\nfor i in range(l):\n c, d = cd[i]\n c, d = c - 1, d - 1\n b[d] = min(b[d], float(\"inf\"))\n\nans = 0\nfor i in a:\n for j in b:\n ans = max(ans, i + j)\nprint(ans)", "n, m, l = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ncd = [list(map(int, input().split())) for _ in range(l)]\n\nfor i in range(l):\n c, d = cd[i]\n c -= 1\n d -= 1\n b[d] = -1000000000\n\nans = max(a[i] + max(b) for i in range(n))\nprint(ans)", "n, m, l = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = []\nfor i in range(l):\n c.append(list(map(int, input().split())))\nans = 0\nfor i in range(n):\n for j in range(m):\n flag = 0\n for k in range(l):\n if c[k][0] == i + 1 and c[k][1] == j + 1:\n flag = 1\n break\n if flag == 0:\n ans = max(ans, a[i] + b[j])\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, s, k = map(int, input().split())\ntotal = 0\nfor i in range(n):\n p, q = map(int, input().split())\n total += p * q\nif total < s:\n total += k\nprint(total)", "n, s, k = map(int, input().split())\ntotal = 0\nfor i in range(n):\n p, q = map(int, input().split())\n total += p * q\nif total < s:\n total += k\nprint(total)", "n, s, k = map(int, input().split())\ntotal = 0\nfor i in range(n):\n p, q = map(int, input().split())\n total += p * q\nif total < s:\n total += k\nprint(total)", "n, s, k = map(int, input().split())\ntotal = 0\nfor i in range(n):\n p, q = map(int, input().split())\n total += p * q\nif total < s:\n total += k\nprint(total)", "n, s, k = map(int, input().split())\ntotal = 0\nfor i in range(n):\n p, q = map(int, input().split())\n total += p * q\nif total < s:\n total += k\nprint(total)", "n, s, k = map(int, input().split())\ntotal = 0\nfor i in range(n):\n p, q = map(int, input().split())\n total += p * q\nif total < s:\n total += k\nprint(total)", "n, s, k = map(int, input().split())\ntotal = 0\nfor i in range(n):\n p, q = map(int, input().split())\n total += p * q\nif total < s:\n total += k\nprint(total)", "n, s, k = map(int, input().split())\ntotal = 0\nfor i in range(n):\n p, q = map(int, input().split())\n total += p * q\nif total < s:\n total += k\nprint(total)", "n, s, k = map(int, input().split())\ntotal = 0\nfor i in range(n):\n p, q = map(int, input().split())\n total += p * q\nif total < s:\n total += k\nprint(total)", "n, s, k = map(int, input().split())\ntotal = 0\nfor i in range(n):\n p, q = map(int, input().split())\n total += p * q\nif total < s:\n total += k\nprint(total)" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "k, g, m = map(int, input().split())\n\nglass, mug = 0, 0\nfor i in range(k):\n if glass == g:\n glass = 0\n else:\n if mug == 0:\n mug = m\n else:\n glass += mug\n mug = 0\nprint(glass, mug)", "k, g, m = map(int, input().split())\n\nglass = 0\nmug = 0\n\nfor i in range(k):\n if glass == g:\n glass = 0\n elif mug == 0:\n mug = m\n else:\n glass += m - mug\n mug = 0\n\nprint(glass, mug)", "k, g, m = map(int, input().split())\n\nglass, mug = 0, 0\nfor i in range(k):\n if glass == g:\n glass = 0\n else:\n if mug == 0:\n mug = m\n else:\n glass += mug\n mug = 0\nprint(glass, mug)", "k, g, m = map(int, input().split())\n\nfor i in range(k):\n if g == m:\n break\n if g == 0:\n g = m\n else:\n m -= g - g % m\n g = g % m\nprint(g, m)", "k, g, m = map(int, input().split())\nglass, mug = 0, 0\nfor i in range(k):\n if glass == g:\n glass = 0\n elif mug == 0:\n mug = m\n else:\n glass += m - mug\n mug = 0\nprint(glass, mug)", "k, g, m = map(int, input().split())\n\nglass, mug = 0, 0\nfor i in range(k):\n if glass == g:\n glass = 0\n elif mug == 0:\n mug = m\n else:\n water = mug // g\n mug -= water * g\n glass += water * g\n\nprint(glass, mug)", "k, g, m = map(int, input().split())\nglass, mug = 0, 0\nfor i in range(k):\n if glass == g:\n glass = 0\n elif mug == 0:\n mug = m\n else:\n glass += m // g * g\n mug %= g\nprint(glass, mug)", "k, g, m = map(int, input().split())\n\nglass, mug = 0, 0\nfor i in range(k):\n if glass == g:\n glass = 0\n elif mug == 0:\n mug = m\n else:\n glass += m - mug\n mug = 0\nprint(glass, mug)", "k, g, m = map(int, input().split())\n\nfor i in range(k):\n if g == m:\n break\n if g == 0:\n g = m\n else:\n m -= g - g % m\n g = g % m\n\nprint(g, m)", "k, g, m = map(int, input().split())\n\nglass = 0\nmug = 0\n\nfor i in range(k):\n if glass == g:\n glass = 0\n else:\n if mug == 0:\n mug = m\n else:\n glass += m\n mug -= m\n if glass >= g:\n glass = g\n\nprint(glass, mug)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\ns = input()\n\nneed = s.count(\"2\")\nif need <= m:\n print(0)\nelse:\n print(need - m)", "(n, m) = map(int, input().split())\ns = input()\n\nneed = s.count(\"1\") + s.count(\"2\")\nif m >= need:\n print(0)\nelse:\n print(need - m)", "n, m = map(int, input().split())\ns = input()\n\none = s.count(\"1\")\ntwo = s.count(\"2\")\n\nif one + two <= m:\n print(0)\nelse:\n print(one + two - m)", "n, m = map(int, input().split())\ns = input()\n\nans = 0\n\nfor i in range(n):\n if s[i] == \"2\":\n m -= 1\n if m < 0:\n ans += 1\n m = 0\n elif s[i] == \"1\":\n if m == 0:\n ans += 1\n m = 1\n elif m < 0:\n ans += 1\n m = 0\n\nprint(ans)", "n, m = map(int, input().split())\ns = input()\n\nneed = s.count(\"2\")\nhave = m\nbuy = 0\n\nfor i in range(n):\n if s[i] == \"0\":\n have = m + buy\n elif s[i] == \"1\":\n have -= 1\n if have < 0:\n buy += 1\n have += 1\n else:\n have -= 1\n if have < 0:\n buy += 1\n have += 1\n\nprint(buy)", "n, m = map(int, input().split())\ns = input()\n\nneed = s.count(\"2\")\nif need <= m:\n print(0)\nelse:\n print(need - m)", "(n, m) = map(int, input().split())\ns = input()\n\none = s.count(\"1\")\ntwo = s.count(\"2\")\n\nif one + two <= m:\n print(0)\nelse:\n print(one + two - m)", "n, m = map(int, input().split())\ns = input()\n\nneed = s.count(\"2\")\nif need <= m:\n print(0)\nelse:\n print(need - m)", "n, m = map(int, input().split())\ns = input()\n\nneed = s.count(\"1\") + s.count(\"2\")\n\nif need <= m:\n print(0)\nelse:\n print(need - m)", "n, m = map(int, input().split())\ns = input()\n\nneed = s.count(\"2\")\nif need > m:\n print(need - m)\nelse:\n print(0)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\nH, W = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(H)]\nB = [list(map(int, input().split())) for _ in range(H)]\n\nq = deque([(A, 0)])\nvisited = set()\n\nwhile q:\n A, cnt = q.popleft()\n if tuple(map(tuple, A)) in visited:\n continue\n visited.add(tuple(map(tuple, A)))\n\n if A == B:\n print(cnt)\n break\n\n for i in range(H - 1):\n A1 = A.copy()\n A1[i], A1[i + 1] = A1[i + 1], A1[i]\n q.append((A1, cnt + 1))\n\n for j in range(W - 1):\n A1 = A.copy()\n for i in range(H):\n A1[i][j], A1[i][j + 1] = A1[i][j + 1], A1[i][j]\n q.append((A1, cnt + 1))\n\nelse:\n print(-1)", "from collections import deque\n\nH, W = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(H)]\nB = [list(map(int, input().split())) for _ in range(H)]\n\nq = deque([(A, 0)])\nvisited = set()\n\nwhile q:\n A, cnt = q.popleft()\n if tuple(map(tuple, A)) in visited:\n continue\n visited.add(tuple(map(tuple, A)))\n\n if A == B:\n print(cnt)\n break\n\n for i in range(H - 1):\n if A[i] > A[i + 1]:\n A[i], A[i + 1] = A[i + 1], A[i]\n q.append((A, cnt + 1))\n A[i], A[i + 1] = A[i + 1], A[i]\n\n for i in range(W - 1):\n if A[0][i] > A[0][i + 1]:\n for j in range(H):\n A[j][i], A[j][i + 1] = A[j][i + 1], A[j][i]\n q.append((A, cnt + 1))\n for j in range(H):\n A[j][i], A[j][i + 1] = A[j][i + 1], A[j][i]\nelse:\n print(-1)", "from collections import deque\n\nH, W = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(H)]\nB = [list(map(int, input().split())) for _ in range(H)]\n\nq = deque([(A, 0)])\nvisited = set()\n\nwhile q:\n A, cnt = q.popleft()\n if tuple(map(tuple, A)) in visited:\n continue\n visited.add(tuple(map(tuple, A)))\n\n if A == B:\n print(cnt)\n break\n\n for i in range(H - 1):\n A1 = A.copy()\n A1[i], A1[i + 1] = A1[i + 1], A1[i]\n q.append((A1, cnt + 1))\n\n for i in range(W - 1):\n A1 = A.copy()\n for j in range(H):\n A1[j][i], A1[j][i + 1] = A1[j][i + 1], A1[j][i]\n q.append((A1, cnt + 1))\n\nelse:\n print(-1)", "def get_input():\n h, w = map(int, input().split())\n a = []\n for _ in range(h):\n a.append(list(map(int, input().split())))\n b = []\n for _ in range(h):\n b.append(list(map(int, input().split())))\n return h, w, a, b\n\n\ndef check(a, b):\n for i in range(len(a)):\n for j in range(len(a[i])):\n if a[i][j] != b[i][j]:\n return False\n return True\n\n\ndef get_cost(a, b):\n cost = 0\n for i in range(len(a)):\n for j in range(len(a[i])):\n if a[i][j] != b[i][j]:\n cost += 1\n return cost\n\n\ndef solve(h, w, a, b):\n if check(a, b):\n return 0\n\n min_cost = float(\"inf\")\n for i in range(h):\n for j in range(w - 1):\n temp = a.copy()\n temp[i][j], temp[i][j + 1] = temp[i][j + 1], temp[i][j]\n cost = get_cost(temp, b)\n min_cost = min(min_cost, cost)\n\n for i in range(w):\n for j in range(h - 1):\n temp = a.copy()\n temp[j], temp[j + 1] = temp[j + 1], temp[j]\n cost = get_cost(temp, b)\n min_cost = min(min_cost, cost)\n\n if min_cost == float(\"inf\"):\n return -1\n return min_cost\n\n\nh, w, a, b = get_input()\nprint(solve(h, w, a, b))", "from collections import deque\n\nH, W = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(H)]\nB = [list(map(int, input().split())) for _ in range(H)]\n\nq = deque([(A, 0)])\nvisited = set()\n\nwhile q:\n A, cnt = q.popleft()\n if tuple(map(tuple, A)) in visited:\n continue\n visited.add(tuple(map(tuple, A)))\n\n if A == B:\n print(cnt)\n break\n\n for i in range(H - 1):\n if A[i] > A[i + 1]:\n A[i], A[i + 1] = A[i + 1], A[i]\n q.append((A, cnt + 1))\n A[i], A[i + 1] = A[i + 1], A[i]\n\n for i in range(W - 1):\n for j in range(H):\n if A[j][i] > A[j][i + 1]:\n for k in range(H):\n A[k][i], A[k][i + 1] = A[k][i + 1], A[k][i]\n q.append((A, cnt + 1))\n for k in range(H):\n A[k][i], A[k][i + 1] = A[k][i + 1], A[k][i]\nelse:\n print(-1)", "from collections import deque\n\nH, W = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(H)]\nB = [list(map(int, input().split())) for _ in range(H)]\n\ndist = 0\nq = deque([(A, 0)])\nvisited = set()\nwhile q:\n A, d = q.popleft()\n if tuple(map(tuple, A)) in visited:\n continue\n visited.add(tuple(map(tuple, A)))\n if A == B:\n dist = d\n break\n for i in range(H - 1):\n if A[i] > A[i + 1]:\n A[i], A[i + 1] = A[i + 1], A[i]\n q.append((A, d + 1))\n A[i], A[i + 1] = A[i + 1], A[i]\n for i in range(W - 1):\n if A[0][i] > A[0][i + 1]:\n for j in range(H):\n A[j][i], A[j][i + 1] = A[j][i + 1], A[j][i]\n q.append((A, d + 1))\n for j in range(H):\n A[j][i], A[j][i + 1] = A[j][i + 1], A[j][i]\n\nif dist == 0:\n dist = -1\nprint(dist)", "from collections import deque\n\nH, W = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(H)]\nB = [list(map(int, input().split())) for _ in range(H)]\n\nq = deque([(A, 0)])\nvisited = set()\n\nwhile q:\n A, cnt = q.popleft()\n if tuple(map(tuple, A)) in visited:\n continue\n visited.add(tuple(map(tuple, A)))\n\n if A == B:\n print(cnt)\n break\n\n for i in range(H - 1):\n if A[i] > A[i + 1]:\n A[i], A[i + 1] = A[i + 1], A[i]\n q.append((A, cnt + 1))\n A[i], A[i + 1] = A[i + 1], A[i]\n\n for i in range(W - 1):\n for j in range(H):\n if A[j][i] > A[j][i + 1]:\n for k in range(H):\n A[k][i], A[k][i + 1] = A[k][i + 1], A[k][i]\n q.append((A, cnt + 1))\n for k in range(H):\n A[k][i], A[k][i + 1] = A[k][i + 1], A[k][i]\nelse:\n print(-1)", "def solve():\n h, w = map(int, input().split())\n a = [list(map(int, input().split())) for _ in range(h)]\n b = [list(map(int, input().split())) for _ in range(h)]\n ans = 0\n for i in range(h):\n for j in range(w):\n for k in range(w):\n if a[i][j] == b[i][k]:\n a[i][j], a[i][k] = a[i][k], a[i][j]\n ans += 1\n break\n flag = True\n for i in range(h):\n for j in range(w):\n if a[i][j] != b[i][j]:\n flag = False\n break\n if not flag:\n break\n if not flag:\n print(-1)\n else:\n print(ans)\n\n\nsolve()", "from collections import deque\n\nH, W = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(H)]\nB = [list(map(int, input().split())) for _ in range(H)]\n\nq = deque([(A, 0)])\nvisited = set()\n\nwhile q:\n A, cnt = q.popleft()\n if tuple(map(tuple, A)) in visited:\n continue\n visited.add(tuple(map(tuple, A)))\n\n if A == B:\n print(cnt)\n break\n\n for i in range(H - 1):\n if A[i] > A[i + 1]:\n A[i], A[i + 1] = A[i + 1], A[i]\n q.append((A, cnt + 1))\n A[i], A[i + 1] = A[i + 1], A[i]\n\n for i in range(W - 1):\n if A[0][i] > A[0][i + 1]:\n for j in range(H):\n A[j][i], A[j][i + 1] = A[j][i + 1], A[j][i]\n q.append((A, cnt + 1))\n for j in range(H):\n A[j][i], A[j][i + 1] = A[j][i + 1], A[j][i]\n\nelse:\n print(-1)", "def main():\n (h, w) = map(int, input().split())\n a = [list(map(int, input().split())) for _ in range(h)]\n b = [list(map(int, input().split())) for _ in range(h)]\n ans = 0\n for i in range(h):\n for j in range(w):\n for k in range(w):\n if a[i][j] == b[i][k]:\n (a[i][j], a[i][k]) = (a[i][k], a[i][j])\n ans += 1\n break\n if sorted(a[i]) == sorted(b[i]) for i in range(h):\n print(ans)\n else:\n print(-1)\n\n\nmain()" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\nprint(n * str(n))", "n = int(input())\r\nprint(n * str(n))", "n = int(input())\r\nprint(n * str(n))", "n = int(input())\r\nprint(n * str(n))\r", "n = int(input())\r\nprint(n * str(n))\r", "n = int(input())\r\nprint(n * str(n))", "n = int(input())\r\nprint(n * str(n))", "n = int(input())\r\nprint(n * str(n))", "n = int(input())\r\nprint(n * str(n))", "n = int(input())\r\nprint(n * str(n))" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "s = input()\nt = input()\n\nif s[0] == t[0] or s[0] == t[1] or s[1] == t[0] or s[1] == t[1]:\n print(\"Yes\")\nelse:\n print(\"No\")", "s1, s2 = input().split()\nt1, t2 = input().split()\n\nif (s1, s2) == (t1, t2) or (s1, s2) == (t2, t1):\n print(\"Yes\")\nelse:\n print(\"No\")", "s1, s2 = input().split()\nt1, t2 = input().split()\n\nif s1 == t1 and s2 == t2 or s1 == t2 and s2 == t1:\n print(\"Yes\")\nelse:\n print(\"No\")", "s1, s2 = input().split()\nt1, t2 = input().split()\n\nif (s1, s2) == (t1, t2) or (s1, s2) == (t2, t1):\n print(\"Yes\")\nelse:\n print(\"No\")", "s1, s2 = input().split()\nt1, t2 = input().split()\n\nif (s1 == t1 and s2 == t2) or (s1 == t2 and s2 == t1):\n print(\"Yes\")\nelif (\n (s1 == \"A\" and s2 == \"C\" and t1 == \"E\" and t2 == \"C\")\n or (s1 == \"C\" and s2 == \"A\" and t1 == \"C\" and t2 == \"E\")\n or (s1 == \"A\" and s2 == \"E\" and t1 == \"C\" and t2 == \"A\")\n or (s1 == \"E\" and s2 == \"A\" and t1 == \"A\" and t2 == \"C\")\n or (s1 == \"B\" and s2 == \"D\" and t1 == \"B\" and t2 == \"D\")\n or (s1 == \"D\" and s2 == \"B\" and t1 == \"D\" and t2 == \"B\")\n):\n print(\"Yes\")\nelse:\n print(\"No\")", "s1, s2 = input().split()\nt1, t2 = input().split()\n\nif (s1 == t1 and s2 == t2) or (s1 == t2 and s2 == t1):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nt = input()\n\nif s[0] == t[0] or s[0] == t[1] or s[1] == t[0] or s[1] == t[1]:\n print(\"Yes\")\nelse:\n print(\"No\")", "s1, s2 = input().split()\nt1, t2 = input().split()\n\nif (s1, s2) == (t1, t2) or (s1, s2) == (t2, t1):\n print(\"Yes\")\nelse:\n print(\"No\")", "s1, s2 = input().split()\nt1, t2 = input().split()\n\nif s1 == t1 and s2 == t2 or s1 == t2 and s2 == t1:\n print(\"Yes\")\nelse:\n print(\"No\")", "s1, s2 = input().split()\nt1, t2 = input().split()\n\nif s1 + s2 == \"AB\" or s1 + s2 == \"BC\" or s1 + s2 == \"CD\" or s1 + s2 == \"DE\" or s1 + s2 == \"EA\":\n s_dist = 1\nelif s1 + s2 == \"AC\" or s1 + s2 == \"CE\" or s1 + s2 == \"EB\" or s1 + s2 == \"BD\" or s1 + s2 == \"DA\":\n s_dist = 2\nelse:\n s_dist = 3\n\nif t1 + t2 == \"AB\" or t1 + t2 == \"BC\" or t1 + t2 == \"CD\" or t1 + t2 == \"DE\" or t1 + t2 == \"EA\":\n t_dist = 1\nelif t1 + t2 == \"AC\" or t1 + t2 == \"CE\" or t1 + t2 == \"EB\" or t1 + t2 == \"BD\" or t1 + t2 == \"DA\":\n t_dist = 2\nelse:\n t_dist = 3\n\nif s_dist == t_dist:\n print(\"Yes\")\nelse:\n print(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\n\nrepunits = [1, 11, 111]\nsums = []\n\nfor i in range(3):\n for j in range(3):\n for k in range(3):\n sums.append(repunits[i] + repunits[j] + repunits[k])\n\nprint(sums[n - 1])", "n = int(input())\n\nrep = [1, 11, 111]\n\nsums = []\nfor i in rep:\n for j in rep:\n for k in rep:\n sums.append(i + j + k)\n\nprint(sums[n - 1])", "", "n = int(input())\n\nrepunits = [1, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111, 1111111111, 11111111111, 111111111111]\n\nsums = []\nfor i in range(len(repunits)):\n for j in range(i, len(repunits)):\n for k in range(j, len(repunits)):\n sums.append(repunits[i] + repunits[j] + repunits[k])\n\nprint(sums[n - 1])", "n = int(input())\n\nrep = [1, 11, 111]\n\nans = []\nfor i in range(len(rep)):\n for j in range(len(rep)):\n for k in range(len(rep)):\n ans.append(rep[i] + rep[j] + rep[k])\n\nprint(ans[n - 1])", "n = int(input())\n\nrepunits = [1, 11, 111]\nsums = []\n\nfor i in range(3):\n for j in range(i, 3):\n for k in range(j, 3):\n sums.append(repunits[i] + repunits[j] + repunits[k])\n\nprint(sums[n - 1])", "n = int(input())\n\nrep = [1, 11, 111]\n\nsums = []\n\nfor i in rep:\n for j in rep:\n for k in rep:\n sums.append(i + j + k)\n\nprint(sums[n - 1])", "n = int(input())\n\nrepunits = [1, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111, 1111111111, 11111111111]\n\nsums = []\nfor i in range(len(repunits)):\n for j in range(i, len(repunits)):\n for k in range(j, len(repunits)):\n sums.append(repunits[i] + repunits[j] + repunits[k])\n\nprint(sums[n - 1])", "n = int(input())\n\nrep = [1, 11, 111]\n\nres = []\nfor i in range(len(rep)):\n for j in range(len(rep)):\n for k in range(len(rep)):\n res.append(rep[i] + rep[j] + rep[k])\n\nprint(res[n - 1])", "n = int(input())\n\nrepunits = [1, 11, 111]\nsums = []\n\nfor i in range(3):\n for j in range(3):\n for k in range(3):\n sums.append(repunits[i] + repunits[j] + repunits[k])\n\nprint(sums[n - 1])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\nn = int(input())\ngraph = [[] for _ in range(n)]\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n graph[u].append(v)\n graph[v].append(u)\n\nq = deque([(0, 0)])\ndist = [-1] * n\ndist[0] = 0\nwhile q:\n node, depth = q.popleft()\n for next_node in graph[node]:\n if dist[next_node] == -1:\n dist[next_node] = depth + 1\n q.append((next_node, depth + 1))\n\nprint(sum(1 for d in dist if d % 2 == 1))", "from collections import deque\n\nn = int(input())\n\ngraph = [[] for _ in range(n + 1)]\n\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n graph[u].append(v)\n graph[v].append(u)\n\nq = deque([1])\ndist = [-1] * (n + 1)\ndist[1] = 0\nwhile q:\n v = q.popleft()\n for nv in graph[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + 1\n q.append(nv)\n\nprint(dist[2])", "from collections import deque\n\nn = int(input())\n\ngraph = [[] for _ in range(n + 1)]\n\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n graph[u].append(v)\n graph[v].append(u)\n\nq = deque([1])\ndist = [-1] * (n + 1)\ndist[1] = 0\nwhile q:\n v = q.popleft()\n for nv in graph[v]:\n if dist[nv] == -1:\n dist[nv] = dist[v] + 1\n q.append(nv)\n\nprint(dist[1])", "from collections import defaultdict\n\nn = int(input())\n\ntree = defaultdict(list)\n\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n tree[u].append(v)\n tree[v].append(u)\n\nq = [(1, 0)]\nwhile q:\n v, d = q.pop()\n for u in tree[v]:\n tree[u].remove(v)\n q.append((u, d + 1))\n\nprint(max(tree[1]))", "from collections import deque\n\nn = int(input())\n\ngraph = [[] for _ in range(n + 1)]\n\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n graph[u].append(v)\n graph[v].append(u)\n\nq = deque([1])\nvisited = [False] * (n + 1)\nvisited[1] = True\n\nwhile q:\n node = q.popleft()\n for adj in graph[node]:\n if not visited[adj]:\n visited[adj] = True\n q.append(adj)\n\nleaves = [i for i in range(2, n + 1) if len(graph[i]) == 1]\n\nans = 0\nwhile leaves:\n leaf = leaves.pop()\n node = graph[leaf][0]\n if visited[node]:\n visited[leaf] = False\n leaves.append(leaf)\n else:\n ans += 1\n visited[node] = False\n\nprint(ans)", "from collections import deque\n\nn = int(input())\ngraph = [[] for _ in range(n)]\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n graph[u].append(v)\n graph[v].append(u)\n\nq = deque([(0, 0)])\ndist = [0] * n\nwhile q:\n u, d = q.popleft()\n for v in graph[u]:\n if dist[v] == 0:\n dist[v] = d + 1\n q.append((v, d + 1))\nprint(dist[0])", "from collections import deque\n\nn = int(input())\ngraph = [[] for _ in range(n)]\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n graph[u].append(v)\n graph[v].append(u)\n\nq = deque([(0, 0)])\nvisited = [0] * n\nwhile q:\n node, depth = q.popleft()\n visited[node] = 1\n for next_node in graph[node]:\n if visited[next_node] == 0:\n visited[next_node] = 1\n q.append((next_node, depth + 1))\n\nprint(visited.count(0) - 1)", "from collections import deque\n\nn = int(input())\ngraph = [[] for _ in range(n)]\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n graph[u].append(v)\n graph[v].append(u)\n\nq = deque([(0, 0)])\ndist = [0] * n\nwhile q:\n u, d = q.popleft()\n for v in graph[u]:\n if dist[v] == 0:\n dist[v] = d + 1\n q.append((v, d + 1))\n\nprint(dist[0])", "from collections import deque\n\nn = int(input())\n\ngraph = [[] for _ in range(n + 1)]\n\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n graph[u].append(v)\n graph[v].append(u)\n\nq = deque([1])\ndist = [-1] * (n + 1)\ndist[1] = 0\nwhile q:\n v = q.popleft()\n for u in graph[v]:\n if dist[u] == -1:\n dist[u] = dist[v] + 1\n q.append(u)\n\nprint(sum(1 for v in range(2, n + 1) if dist[v] > dist[1]) - 1)", "from collections import deque\n\nn = int(input())\ngraph = [[] for _ in range(n + 1)]\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n graph[u].append(v)\n graph[v].append(u)\n\nq = deque([1])\ndist = [0] * (n + 1)\nwhile q:\n v = q.popleft()\n for u in graph[v]:\n if dist[u] == 0:\n dist[u] = dist[v] + 1\n q.append(u)\n\nprint(sum(1 for d in dist if d % 2 == 0))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\nn = int(input())\nevents = [list(map(int, input().split())) for _ in range(n)]\n\npotions = [0] * (n + 1)\nactions = [0] * n\n\nfor i in range(n):\n if events[i][0] == 1:\n potions[events[i][1]] += 1\n actions[i] = 1\n else:\n potions[events[i][1]] -= 1\n\nfor i in range(n):\n if potions[events[i][1]] < 0:\n print(-1)\n exit()\n\nfor i in range(n):\n if events[i][0] == 1:\n if potions[events[i][1]] == 1:\n actions[i] = 0\n\nprint(max(potions))\nprint(*actions)", "from collections import deque\n\nN = int(input())\n\nevents = []\nfor _ in range(N):\n t, x = map(int, input().split())\n events.append((t, x))\n\npotions = [0] * (N + 1)\nactions = [0] * N\n\nfor i, (t, x) in enumerate(events):\n if t == 1:\n potions[x] += 1\n actions[i] = 1\n else:\n potions[x] -= 1\n if potions[x] < 0:\n print(-1)\n exit()\n\nK = max(potions)\n\nprint(K)\nprint(*actions)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nt = [list(map(int, input().split())) for i in range(n)]\np = [0] * (n + 1)\nans = []\nfor i in range(n):\n if t[i][0] == 1:\n p[t[i][1]] = 1\n ans.append(1)\n else:\n if p[t[i][1]] == 0:\n print(-1)\n exit()\n p[t[i][1]] -= 1\n ans.append(0)\nk = max(p)\nprint(k)\nprint(*ans)", "from collections import deque\n\nn = int(input())\nevents = [list(map(int, input().split())) for _ in range(n)]\n\npotions = set()\nactions = deque()\nmin_k = 0\n\nfor t, x in events:\n if t == 1:\n if x not in potions:\n potions.add(x)\n actions.append(1)\n min_k += 1\n else:\n actions.append(0)\n else:\n if x not in potions:\n print(-1)\n exit()\n else:\n potions.remove(x)\n\nprint(min_k)\nprint(*actions)", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nevents = [tuple(map(int, input().split())) for _ in range(N)]\n\npotions = set()\nactions = []\n\nfor t, x in events:\n if t == 1:\n potions.add(x)\n actions.append(1)\n elif x not in potions:\n print(-1)\n sys.exit()\n else:\n potions.remove(x)\n actions.append(0)\n\nprint(len(potions))\nprint(\" \".join(map(str, actions)))", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\nevents = [tuple(map(int, input().split())) for _ in range(N)]\n\npotions = [0] * (N + 1)\n\nfor t, x in events:\n if t == 1:\n potions[x] += 1\n else:\n potions[x] -= 1\n\nfor i in range(N + 1):\n if potions[i] < 0:\n print(-1)\n sys.exit()\n\nK = max(potions)\n\nans = []\n\nfor t, x in events:\n if t == 1:\n if potions[x] == K:\n ans.append(1)\n else:\n ans.append(0)\n else:\n potions[x] -= 1\n\nfor i in range(N + 1):\n if potions[i] > 0:\n K = max(K, potions[i])\n\nprint(K)\nprint(*ans)", "from collections import deque\n\nN = int(input())\nevents = [list(map(int, input().split())) for _ in range(N)]\n\npotions = set()\nactions = [0] * N\n\nfor i, (t, x) in enumerate(events):\n if t == 1:\n potions.add(x)\n if len(potions) > len(actions):\n actions[i] = 1\n elif x not in potions:\n print(-1)\n exit()\n else:\n potions.remove(x)\n\nprint(len(actions) - actions.count(0))\nprint(*actions)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nt = [list(map(int, input().split())) for i in range(n)]\n\np = [0] * (n + 1)\n\nfor i in range(n - 1, -1, -1):\n if t[i][0] == 1:\n p[t[i][1]] = 1\n\nfor i in range(n):\n if t[i][0] == 2:\n if p[t[i][1]] == 0:\n print(-1)\n exit()\n p[t[i][1]] -= 1\n\nans = []\nfor i in range(n):\n if t[i][0] == 1:\n ans.append(1)\n if p[t[i][1]] == 1:\n ans.append(0)\n else:\n ans.append(1)\n else:\n ans.append(0)\n if p[t[i][1]] == 1:\n ans.append(1)\n else:\n ans.append(0)\n p[t[i][1]] += t[i][0] - 1\n\nprint(max(p))\nprint(*ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nTX = [list(map(int, input().split())) for i in range(N)]\n\nmonster = [[] for i in range(N + 1)]\npotion = [[] for i in range(N + 1)]\n\nfor t, x in TX:\n if t == 1:\n potion[x].append(len(TX))\n else:\n monster[x].append(len(TX))\n\nfor i in range(N + 1):\n potion[i].append(10**9)\n potion[i].append(-1)\n monster[i].append(10**9)\n monster[i].append(-1)\n\nfor i in range(N + 1):\n potion[i].sort()\n monster[i].sort()\n\ndp = [[10**9] * 5 for i in range(N + 1)]\ndp[0][0] = 0\n\nfor i in range(N):\n t, x = TX[i]\n if t == 1:\n for j in range(4, -1, -1):\n if dp[x][j] != 10**9:\n dp[x][j + 1] = min(dp[x][j + 1], dp[x][j])\n dp[x][j] = 10**9\n else:\n for j in range(4, -1, -1):\n if dp[x][j] != 10**9 and potion[x][0] <= monster[x][j]:\n dp[x][j - 1] = min(dp[x][j - 1], dp[x][j] + 1)\n dp[x][j] = 10**9\n potion[x].pop(0)\n\nans = 10**9\nidx = -1\nfor i in range(N + 1):\n if dp[i][0] != 10**9 and dp[i][0] < ans:\n ans = dp[i][0]\n idx = i\n\nif idx == -1:\n print(-1)\nelse:\n print(ans)\n for i in range(N):\n t, x = TX[i]\n if t == 1 and dp[idx][0] == dp[x][1]:\n print(1, end=\" \")\n else:\n print(0, end=\" \")\n print()", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nTX = [list(map(int, input().split())) for _ in range(N)]\n\nfrom collections import deque\n\ndq = deque()\n\nfor t, x in TX:\n if t == 1:\n dq.append(x)\n else:\n if not dq or dq[-1] != x:\n print(-1)\n exit()\n dq.pop()\n\nprint(len(dq))\n\nans = [0] * N\nfor i, (t, x) in enumerate(TX):\n if t == 1:\n if x in dq:\n ans[i] = 1\nprint(*ans, sep=\"\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "b, g = map(int, input().split())\nif b > g:\n print(\"Bat\")\nelse:\n print(\"Glove\")", "b, g = map(int, input().split())\nif b > g:\n print(\"Bat\")\nelse:\n print(\"Glove\")", "b, g = map(int, input().split())\nif b > g:\n print(\"Bat\")\nelse:\n print(\"Glove\")", "b, g = map(int, input().split())\nif b > g:\n print(\"Bat\")\nelse:\n print(\"Glove\")", "b, g = map(int, input().split())\nif b > g:\n print(\"Bat\")\nelse:\n print(\"Glove\")", "b, g = map(int, input().split())\nif b > g:\n print(\"Bat\")\nelse:\n print(\"Glove\")", "b, g = map(int, input().split())\nif b > g:\n print(\"Bat\")\nelse:\n print(\"Glove\")", "b, g = map(int, input().split())\nif b > g:\n print(\"Bat\")\nelse:\n print(\"Glove\")", "b, g = map(int, input().split())\nif b > g:\n print(\"Bat\")\nelse:\n print(\"Glove\")", "b, g = map(int, input().split())\nif b > g:\n print(\"Bat\")\nelse:\n print(\"Glove\")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "a, m, l, r = map(int, input().split())\n\nif l <= a <= r:\n l = (a - l) // m + 1\nelse:\n l = (a - l) // m\n\nif l <= a - m <= r:\n l += 1\n\nif a <= r <= a + m:\n r = (r - a) // m + 1\nelse:\n r = (r - a) // m\n\nprint(r - l + 1)", "a, m, l, r = map(int, input().split())\nif l > r:\n print(0)\nelse:\n print((r - l) // m + 1)", "a, m, l, r = map(int, input().split())\n\nif l > r:\n print(0)\nelse:\n if l == r:\n if (l - a) % m == 0:\n print(1)\n else:\n print(0)\n else:\n print((r - l) // m + 1)", "a, m, l, r = map(int, input().split())\nif l > r:\n l, r = r, l\nif a > r or l > a + m:\n print(0)\nelse:\n print((r - l) // m + 1)", "a, m, l, r = map(int, input().split())\nif l <= a <= r:\n l = (a - l) // m + 1\nelse:\n l = (a - l) // m\nif l <= r <= a:\n r = (r - a) // m + 1\nelse:\n r = (r - a) // m\nprint(r - l + 1)", "a, m, l, r = map(int, input().split())\nif l > r:\n print(0)\nelse:\n print((r - l) // m + 1)", "a, m, l, r = map(int, input().split())\nif l > r:\n exit(print(0))\nif a > l:\n l = (l - a) // m * m + a\nif a < l:\n l = (l - a) // m * m + m + a\nif a > r:\n r = (r - a) // m * m + a\nif a < r:\n r = (r - a) // m * m + m + a\nprint((r - l) // m + 1)", "a, m, l, r = map(int, input().split())\nif l > r:\n l, r = r, l\nif a > r:\n print(0)\nelif a + m * (r - a) // m > l:\n print((r - l) // m + 1)\nelse:\n print((r - a) // m - (a - l) // m)", "a, m, l, r = map(int, input().split())\nif l > r:\n print(0)\nelse:\n print((r - l) // m + 1)", "a, m, l, r = map(int, input().split())\nif l == r:\n if (l - a) % m == 0:\n print(1)\n else:\n print(0)\nelse:\n print((r - l) // m + 1)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, k = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(k - 1):\n ans += a[i + 1] - a[i] - 1\nprint(ans)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n\nif k % 2 == 0:\n ans = 0\n for i in range(k // 2):\n ans += abs(a[i] - a[k - i - 1])\nelse:\n ans = abs(a[k // 2] - a[k // 2 + 1])\n\nprint(ans)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n\nif k % 2 == 1:\n print(sum(a[i] - a[i - 1] for i in range(1, k, 2)) + sum(a[i] - a[i + 1] for i in range(k - 1, 0, -2)))\nelse:\n print(sum(a[i] - a[i - 1] for i in range(1, k, 2)) + sum(a[i] - a[i + 1] for i in range(k - 1, 1, -2)))", "n, k = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n\nif k % 2 == 1:\n print((n - k) + sum(a[i] - a[i - 1] - 1 for i in range(1, k, 2)))\nelse:\n print(sum(a[i] - a[i - 1] - 1 for i in range(1, k, 2)))", "n, k = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\ns = 0\nfor i in range(k - 1):\n s += a[i + 1] - a[i] - 1\nprint(s)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n\nif k % 2 == 1:\n print(sum(a[i] - a[i - 1] for i in range(1, k, 2)) + (n - k) % 2)\nelse:\n print(sum(a[i] - a[i - 1] for i in range(1, k, 2)))", "n, k = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(k - 1):\n ans += a[i + 1] - a[i] - 1\nprint(ans)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(k - 1):\n ans += a[i + 1] - a[i] - 1\nprint(ans)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n\nif n - k <= 1:\n print(0)\nelse:\n ans = 0\n for i in range(k):\n if a[i] != i + 1:\n ans += 1\n print(ans)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(k - 1):\n ans += a[i + 1] - a[i] - 1\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\nr = list(map(int, input().split()))\nr.sort()\nfor _ in range(q):\n x = int(input())\n ans = 0\n for i in range(n):\n if x >= r[i]:\n ans += 1\n x -= r[i]\n print(ans)", "import sys\n\ninput = sys.stdin.readline\nfrom bisect import bisect_left as bl\n\n(N, Q) = map(int, input().split())\nR = list(map(int, input().split()))\nR.sort()\nfor _ in range(Q):\n X = int(input())\n ans = bl(R, X)\n print(ans)", "import sys\n\ninput = sys.stdin.readline\nfrom bisect import bisect_left, bisect_right\n\n(N, Q) = map(int, input().split())\nR = list(map(int, input().split()))\nR.sort()\n\nans = []\nfor _ in range(Q):\n X = int(input())\n idx = bisect_right(R, X)\n ans.append(idx)\n\nprint(*ans, sep=\"\\n\")", "import sys\n\ninput = sys.stdin.readline\nfrom bisect import bisect_left\n\n(N, Q) = map(int, input().split())\nR = list(map(int, input().split()))\nR.sort()\n\nans = [0] * Q\nfor i in range(Q):\n X = int(input())\n idx = bisect_left(R, X // N)\n ans[i] = min(N, (X - (idx) * R[idx]) // R[idx]) + idx\n\nprint(*ans, sep=\"\\n\")", "import sys\n\ninput = sys.stdin.readline\nfrom bisect import bisect_left as bl\n\n(n, q) = map(int, input().split())\nr = list(map(int, input().split()))\nr.sort()\nfor _ in range(q):\n x = int(input())\n print(bl(r, x))", "import sys\n\ninput = sys.stdin.readline\nfrom bisect import bisect_left, bisect_right\n\n(N, Q) = map(int, input().split())\nR = list(map(int, input().split()))\nR.sort()\n\nans = []\nfor _ in range(Q):\n X = int(input())\n if X == 0:\n ans.append(0)\n continue\n idx = bisect_right(R, X)\n ans.append(idx)\n\nprint(*ans, sep=\"\\n\")", "import sys\n\ninput = sys.stdin.readline\nfrom bisect import bisect_left\n\n(N, Q) = map(int, input().split())\nR = list(map(int, input().split()))\nR.sort()\n\nans = [0] * Q\nfor i in range(Q):\n X = int(input())\n idx = bisect_left(R, X // N)\n ans[i] = min(N, (X - (idx * R[idx])) // R[idx] + idx)\n\nprint(*ans, sep=\"\\n\")", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nR = list(map(int, input().split()))\nR.sort()\nfor _ in range(Q):\n X = int(input())\n ans = 0\n for r in R:\n if X >= r:\n ans += 1\n X -= r\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nR = list(map(int, input().split()))\nR.sort()\nfor _ in range(Q):\n X = int(input())\n ans = 0\n for r in R:\n if X >= r:\n ans += 1\n X -= r\n print(ans)", "import sys\n\ninput = sys.stdin.readline\nfrom bisect import bisect_left\n\n(N, Q) = map(int, input().split())\nR = list(map(int, input().split()))\nR.sort()\n\nans = [0] * Q\nfor i in range(Q):\n X = int(input())\n ans[i] = bisect_left(R, X // N)\n if X % N != 0:\n ans[i] += 1\n\nprint(*ans, sep=\"\\n\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\nmod = 998244353\n\n\ndef main():\n h, w = map(int, input().split())\n grid = [input() for _ in range(h)]\n red = []\n for i in range(h):\n for j in range(w):\n if grid[i][j] == \".\":\n red.append((i, j))\n cnt = 0\n for i, j in red:\n if i > 0 and grid[i - 1][j] == \"#\":\n cnt += 1\n if i < h - 1 and grid[i + 1][j] == \"#\":\n cnt += 1\n if j > 0 and grid[i][j - 1] == \"#\":\n cnt += 1\n if j < w - 1 and grid[i][j + 1] == \"#\":\n cnt += 1\n ans = 0\n for i, j in red:\n cnt -= 1\n if i > 0 and grid[i - 1][j] == \"#\":\n cnt += 1\n if i < h - 1 and grid[i + 1][j] == \"#\":\n cnt += 1\n if j > 0 and grid[i][j - 1] == \"#\":\n cnt += 1\n if j < w - 1 and grid[i][j + 1] == \"#\":\n cnt += 1\n ans += cnt\n ans %= mod\n print(ans)\n\n\nmain()", "from collections import deque\n\nmod = 998244353\ninf = 10**10\n\nh, w = map(int, input().split())\ngrid = [input() for _ in range(h)]\n\ndx = [-1, 0, 1, 0]\ndy = [0, 1, 0, -1]\n\n\ndef bfs(x, y):\n q = deque([(x, y)])\n cnt = 0\n visited = [[False] * w for _ in range(h)]\n visited[x][y] = True\n while q:\n x, y = q.popleft()\n cnt += 1\n for i in range(4):\n nx, ny = x + dx[i], y + dy[i]\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and grid[nx][ny] == \"#\":\n visited[nx][ny] = True\n q.append((nx, ny))\n return cnt\n\n\nans = 0\ncnt = 0\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \".\":\n cnt += 1\n ans = (ans + bfs(i, j)) % mod\n\nprint((ans * cnt % mod + cnt) % mod)", "from collections import deque\n\nmod = 998244353\n\n\ndef main():\n h, w = map(int, input().split())\n grid = [input() for _ in range(h)]\n red = []\n for i in range(h):\n for j in range(w):\n if grid[i][j] == \".\":\n red.append((i, j))\n cnt = 0\n for i, j in red:\n cnt += dfs(i, j, grid)\n print(cnt * pow(h * w, mod - 2, mod) % mod)\n\n\ndef dfs(i, j, grid):\n h, w = len(grid), len(grid[0])\n grid[i][j] = \"#\"\n cnt = 1\n dq = deque([(i, j)])\n while dq:\n y, x = dq.popleft()\n for dy, dx in ((-1, 0), (1, 0), (0, -1), (0, 1)):\n ny, nx = y + dy, x + dx\n if 0 <= ny < h and 0 <= nx < w and grid[ny][nx] == \".\":\n grid[ny][nx] = \"#\"\n cnt += 1\n dq.append((ny, nx))\n return cnt\n\n\nmain()", "import sys\n\ninput = sys.stdin.readline\n\nH, W = map(int, input().split())\nS = [input().rstrip() for _ in range(H)]\n\nmod = 998244353\n\ndx = [0, 1, 0, -1]\ndy = [1, 0, -1, 0]\n\ndef bfs(x, y):\n q = [(x, y)]\n cnt = 0\n while q:\n x, y = q.pop()\n if S[x][y] == \"#\":\n S[x] = S[x][:y] + \".\" + S[x][y + 1:]\n for i in range(4):\n nx, ny = x + dx[i], y + dy[i]\n if 0 <= nx < H and 0 <= ny < W and S[nx][ny] == \"#\":\n q.append((nx, ny))\n cnt += 1\n return cnt\n\nans = 0\nfor i in range(H):\n for j in range(W):\n if S[i][j] == \".\":\n ans += bfs(i, j)\n\nprint((pow(H * W, mod - 2, mod) * ans) % mod)", "import sys\n\ninput = sys.stdin.readline\n\nmod = 998244353\n\n\ndef main():\n h, w = list(map(int, input().split()))\n s = [input().rstrip() for _ in range(h)]\n cnt = 0\n for i in range(h):\n for j in range(w):\n if s[i][j] == \"#\":\n cnt += 1\n ans = 0\n for i in range(h):\n for j in range(w):\n if s[i][j] == \".\":\n cnt += 1\n if i > 0 and s[i - 1][j] == \"#\":\n cnt -= 1\n if j > 0 and s[i][j - 1] == \"#\":\n cnt -= 1\n if i < h - 1 and s[i + 1][j] == \"#\":\n cnt -= 1\n if j < w - 1 and s[i][j + 1] == \"#\":\n cnt -= 1\n ans += cnt\n ans %= mod\n ans *= pow(cnt, mod - 2, mod)\n ans %= mod\n print(ans)\n\n\nmain()", "from collections import deque\n\nmod = 998244353\n\n\ndef main():\n h, w = map(int, input().split())\n grid = [input() for _ in range(h)]\n cnt = 0\n for i in range(h):\n for j in range(w):\n if grid[i][j] == \".\":\n cnt += 1\n if cnt == 0:\n print(0)\n return\n cnt = cnt * (h * w - cnt) // (h * w)\n cnt %= mod\n for i in range(h):\n for j in range(w):\n if grid[i][j] == \".\":\n continue\n cnt += dfs(grid, i, j)\n cnt %= mod\n print(cnt)\n\n\ndef dfs(grid, i, j):\n h, w = len(grid), len(grid[0])\n cnt = 1\n dq = deque([(i, j)])\n grid[i] = grid[i][:j] + \".\" + grid[i][j + 1 :]\n while dq:\n y, x = dq.popleft()\n for dy, dx in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\n ny, nx = y + dy, x + dx\n if 0 <= ny < h and 0 <= nx < w and grid[ny][nx] == \"#\":\n cnt += 1\n dq.append((ny, nx))\n grid[ny] = grid[ny][:nx] + \".\" + grid[ny][nx + 1 :]\n return cnt\n\n\nmain()", "from collections import deque\n\nmod = 998244353\nH, W = map(int, input().split())\ngrid = [input() for _ in range(H)]\n\ndx = [0, 1, 0, -1]\ndy = [1, 0, -1, 0]\n\ndef bfs(x, y):\n q = deque([(x, y)])\n cnt = 0\n while q:\n x, y = q.popleft()\n for i in range(4):\n nx, ny = x + dx[i], y + dy[i]\n if 0 <= nx < H and 0 <= ny < W and grid[nx][ny] == \".\":\n q.append((nx, ny))\n grid[nx][ny] = \"#\"\n else:\n cnt += 1\n return cnt\n\nans = 0\nfor i in range(H):\n for j in range(W):\n if grid[i][j] == \".\":\n cnt = bfs(i, j)\n ans += cnt * (cnt + 1) // 2\n ans %= mod\n\nprint((ans * (H * W) % mod * pow(H * W - 1, mod - 2, mod)) % mod)", "from collections import deque\n\nmod = 998244353\n(h, w) = map(int, input().split())\ngrid = [input() for _ in range(h)]\nup = [[0] * w for _ in range(h)]\ndown = [[0] * w for _ in range(h)]\nleft = [[0] * w for _ in range(h)]\nright = [[0] * w for _ in range(h)]\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \"#\":\n if i > 0 and grid[i - 1][j] == \"#\":\n up[i][j] = 1\n down[i - 1][j] = 1\n if j > 0 and grid[i][j - 1] == \"#\":\n left[i][j] = 1\n right[i][j - 1] = 1\nans = 0\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \".\":\n cnt = 1\n q = deque([(i, j)])\n while q:\n (x, y) = q.popleft()\n if up[x][y] == 0:\n up[x][y] = 1\n down[x - 1][y] = 1\n cnt += down[x - 1][y] - up[x - 1][y]\n q.append((x - 1, y))\n if left[x][y] == 0:\n left[x][y] = 1\n right[x][y - 1] = 1\n cnt += right[x][y - 1] - left[x][y - 1]\n q.append((x, y - 1))\n ans += cnt\nprint((ans * (h * w - 1) % mod * pow(h * w, mod - 2, mod)) % mod)", "import sys\n\ninput = sys.stdin.readline\n\nmod = 998244353\n\nh, w = map(int, input().split())\ns = [input().rstrip() for _ in range(h)]\n\ndx = [0, 0, 1, -1]\ndy = [1, -1, 0, 0]\n\nup = [[0] * (w + 2) for _ in range(h + 2)]\ndown = [[0] * (w + 2) for _ in range(h + 2)]\nleft = [[0] * (w + 2) for _ in range(h + 2)]\nright = [[0] * (w + 2) for _ in range(h + 2)]\n\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \"#\":\n up[i][j + 1] = 1\n down[i + 1][j + 1] = 1\n left[i + 1][j] = 1\n right[i + 1][j + 1] = 1\n\nfor i in range(h + 1):\n for j in range(w + 1):\n for k in range(4):\n nx, ny = i + dx[k], j + dy[k]\n if 0 <= nx < h + 1 and 0 <= ny < w + 1:\n up[nx][ny] += up[i][j]\n down[nx][ny] += down[i][j]\n left[nx][ny] += left[i][j]\n right[nx][ny] += right[i][j]\n\nans = 0\n\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \".\":\n ans += (\n up[i][j + 1] * down[i + 1][j + 1]\n + left[i + 1][j] * right[i + 1][j + 1]\n )\n ans %= mod\n\nprint(ans * pow(h * w, mod - 2, mod) % mod)", "from collections import deque\n\nmod = 998244353\n\n\ndef main():\n h, w = map(int, input().split())\n grid = [input() for _ in range(h)]\n red = []\n for i in range(h):\n for j in range(w):\n if grid[i][j] == \".\":\n red.append((i, j))\n cnt = 0\n for i, j in red:\n if i > 0 and grid[i - 1][j] == \"#\":\n cnt += 1\n if j > 0 and grid[i][j - 1] == \"#\":\n cnt += 1\n ans = 0\n for i, j in red:\n cnt_i = 0\n cnt_j = 0\n if i > 0 and grid[i - 1][j] == \"#\":\n cnt_i += 1\n if j > 0 and grid[i][j - 1] == \"#\":\n cnt_j += 1\n if i < h - 1 and grid[i + 1][j] == \"#\":\n cnt_i += 1\n if j < w - 1 and grid[i][j + 1] == \"#\":\n cnt_j += 1\n if cnt_i == 0 or cnt_j == 0:\n ans += 1\n else:\n ans += 2\n ans = (ans * len(red) - cnt) % mod\n print(ans)\n\n\nmain()" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s = input()\nprint(s[:-4] + \"2024\")", "s = input()\nprint(s[:-4] + \"2024\")", "s = input()\nprint(s[:-4] + \"2024\")", "s = input()\nprint(s[:-4] + \"2024\")", "s = input()\nprint(s[:-4] + \"2024\")", "s = input()\nprint(s[:-4] + \"2024\")", "s = input()\nprint(s[:-4] + \"2024\")", "s = input()\nprint(s[:-4] + \"2024\")", "s = input()\nprint(s[:-4] + \"2024\")", "s = input()\nprint(s[:-4] + \"2024\")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\nfor i in range(n + 1):\r\n for j in range(n - i + 1):\r\n for k in range(n - i - j + 1):\r\n print(i, j, k)\r", "n = int(input())\r\nfor x in range(n + 1):\r\n for y in range(n - x + 1):\r\n for z in range(n - x - y + 1):\r\n print(x, y, z)\r", "n = int(input())\r\nfor x in range(n + 1):\r\n for y in range(n - x + 1):\r\n for z in range(n - x - y + 1):\r\n print(x, y, z)\r", "n = int(input())\r\nfor i in range(n + 1):\r\n for j in range(n - i + 1):\r\n for k in range(n - i - j + 1):\r\n print(i, j, k)\r", "n = int(input())\r\nfor i in range(n + 1):\r\n for j in range(n - i + 1):\r\n for k in range(n - i - j + 1):\r\n print(i, j, k)\r", "n = int(input())\r\nfor x in range(n + 1):\r\n for y in range(n - x + 1):\r\n for z in range(n - x - y + 1):\r\n print(x, y, z)\r", "n = int(input())\r\nfor i in range(n + 1):\r\n for j in range(n - i + 1):\r\n for k in range(n - i - j + 1):\r\n print(i, j, k)\r", "n = int(input())\r\nfor i in range(n + 1):\r\n for j in range(n - i + 1):\r\n for k in range(n - i - j + 1):\r\n print(i, j, k)\r", "n = int(input())\r\nfor i in range(n + 1):\r\n for j in range(n - i + 1):\r\n for k in range(n - i - j + 1):\r\n print(i, j, k)\r", "n = int(input())\r\nfor x in range(n + 1):\r\n for y in range(n - x + 1):\r\n for z in range(n - x - y + 1):\r\n print(x, y, z)\r" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\ndragon = [i] * N\ndragon_x = list(range(1, N + 1))\ndragon_y = [0] * N\nfor _ in range(Q):\n query = input().split()\n if query[0] == \"1\":\n if query[1] == \"R\":\n dragon_x[0] += 1\n elif query[1] == \"L\":\n dragon_x[0] -= 1\n elif query[1] == \"U\":\n dragon_y[0] += 1\n else:\n dragon_y[0] -= 1\n for i in range(1, N):\n dragon_x[i] = dragon_x[i - 1]\n dragon_y[i] = dragon_y[i - 1]\n else:\n idx = int(query[1]) - 1\n print(dragon_x[idx], dragon_y[idx])", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nX = [i for i in range(1, N + 1)]\nY = [0] * N\ndx = [1, -1, 0, 0]\ndy = [0, 0, 1, -1]\nfor _ in range(Q):\n query = input().split()\n if query[0] == \"1\":\n Y[0] += dy[[\"L\", \"R\", \"U\", \"D\"].index(query[1])]\n for i in range(N - 1):\n X[i] = X[i + 1]\n Y[i] = Y[i + 1]\n else:\n idx = int(query[1]) - 1\n print(X[idx], Y[idx])", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nX = [i for i in range(N)]\nY = [0] * N\nfor _ in range(Q):\n query = input().split()\n if query[0] == \"1\":\n if query[1] == \"R\":\n X.pop(0)\n X.insert(0, X[0] + 1)\n elif query[1] == \"L\":\n X.pop(0)\n X.insert(0, X[0] - 1)\n elif query[1] == \"U\":\n Y.pop(0)\n Y.insert(0, Y[0] + 1)\n else:\n Y.pop(0)\n Y.insert(0, Y[0] - 1)\n else:\n print(X[int(query[1]) - 1], Y[int(query[1]) - 1])", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nX = [i for i in range(N)]\nY = [0] * N\nfor _ in range(Q):\n query = input().split()\n if query[0] == \"1\":\n if query[1] == \"R\":\n X.pop(0)\n X.append(X[-1] + 1)\n elif query[1] == \"L\":\n X.pop(0)\n X.insert(0, X[0] - 1)\n elif query[1] == \"U\":\n Y.pop(0)\n Y.append(Y[-1] + 1)\n else:\n Y.pop(0)\n Y.insert(0, Y[0] - 1)\n else:\n idx = int(query[1]) - 1\n print(X[idx], Y[idx])", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nX = [i for i in range(1, N + 1)]\nY = [0] * N\ndx = {\"R\": 1, \"L\": -1, \"U\": 0, \"D\": 0}\ndy = {\"R\": 0, \"L\": 0, \"U\": 1, \"D\": -1}\nfor _ in range(Q):\n query = input().split()\n if query[0] == \"1\":\n X[0] += dx[query[1]]\n Y[0] += dy[query[1]]\n for i in range(N - 1):\n X[i] = X[i + 1]\n Y[i] = Y[i + 1]\n else:\n idx = int(query[1]) - 1\n print(X[idx], Y[idx])", "from collections import deque\n\n(n, q) = map(int, input().split())\ndragon = deque([(i, 0) for i in range(1, n + 1)])\nfor _ in range(q):\n query = input().split()\n if query[0] == \"1\":\n if query[1] == \"R\":\n dragon.popleft()\n dragon.append((dragon[-1][0] + 1, dragon[-1][1]))\n elif query[1] == \"L\":\n dragon.popleft()\n dragon.appendleft((dragon[0][0] - 1, dragon[0][1]))\n elif query[1] == \"U\":\n dragon.popleft()\n dragon.append((dragon[-1][0], dragon[-1][1] + 1))\n else:\n dragon.popleft()\n dragon.append((dragon[-1][0], dragon[-1][1] - 1))\n else:\n p = int(query[1])\n if p > len(dragon):\n print(dragon[0][0], dragon[0][1])\n else:\n print(dragon[p - 1][0], dragon[p - 1][1])", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nX = [i for i in range(1, N + 1)]\nY = [0] * N\ndx = [1, -1, 0, 0]\ndy = [0, 0, 1, -1]\nfor i in range(Q):\n query = input().split()\n if query[0] == \"1\":\n Y[0] += dy[[\"R\", \"L\", \"U\", \"D\"].index(query[1])]\n for j in range(N - 1):\n (X[j], X[j + 1]) = (X[j + 1], X[j])\n (Y[j], Y[j + 1]) = (Y[j + 1], Y[j])\n else:\n idx = int(query[1]) - 1\n print(X[idx], Y[idx])", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nX = [i for i in range(N)]\nY = [0] * N\nfor _ in range(Q):\n query = input().split()\n if query[0] == \"1\":\n if query[1] == \"R\":\n X.pop(0)\n X.append(X[-1] + 1)\n elif query[1] == \"L\":\n X.pop(0)\n X.insert(0, X[0] - 1)\n elif query[1] == \"U\":\n Y.pop(0)\n Y.append(Y[-1] + 1)\n else:\n Y.pop(0)\n Y.insert(0, Y[0] - 1)\n else:\n idx = int(query[1]) - 1\n print(X[idx], Y[idx])", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nX = [i for i in range(1, N + 1)]\nY = [0] * N\ndx = [1, -1, 0, 0]\ndy = [0, 0, 1, -1]\nfor _ in range(Q):\n query = input().split()\n if query[0] == \"1\":\n Y[0] += dy[[\"L\", \"R\", \"U\", \"D\"].index(query[1])]\n for i in range(N - 1):\n (X[i], X[i + 1]) = (X[i + 1], X[i])\n (Y[i], Y[i + 1]) = (Y[i + 1], Y[i])\n else:\n idx = int(query[1]) - 1\n print(X[idx], Y[idx])", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\ndragon = [i for i in range(N)]\nhead_x = 0\nhead_y = 0\nfor _ in range(Q):\n query = input().split()\n if query[0] == \"1\":\n if query[1] == \"R\":\n head_x += 1\n elif query[1] == \"L\":\n head_x -= 1\n elif query[1] == \"U\":\n head_y += 1\n else:\n head_y -= 1\n dragon.insert(0, dragon.pop())\n else:\n p = int(query[1])\n print(dragon[p - 1] + head_x, head_y)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\nm = n * n\na = [[0] * n for i in range(n)]\na[n // 2][n // 2] = \"T\"\nk = 1\nfor i in range(n // 2):\n a[i][n // 2] = k\n k += 1\nfor i in range(n // 2 + 1, n):\n a[i][n // 2] = m\n m -= 1\nfor i in range(n // 2):\n a[n // 2][i] = k\n k += 1\nfor i in range(n // 2 + 1, n):\n a[n // 2][i] = m\n m -= 1\nfor i in range(n // 2):\n a[i][n // 2 + 1 : n] = a[i][n // 2 + 1 : n][::-1]\nfor i in range(n // 2 + 1, n):\n a[i][n // 2 + 1 : n] = a[i][n // 2 + 1 : n][::-1]\nfor i in range(n // 2 + 1, n):\n a[n // 2 + 1 : n][i] = a[n // 2 + 1 : n][i][::-1]\nfor i in range(n // 2):\n a[n // 2 + 1 : n][i] = a[n // 2 + 1 : n][i][::-1]\nfor i in a:\n print(*i)", "n = int(input())\nm = n * n\na = [[0] * n for i in range(n)]\na[n // 2][n // 2] = \"T\"\nk = 1\nfor i in range(n // 2):\n a[i][n // 2] = k\n k += 1\n a[n - 1 - i][n // 2] = k\n k += 1\nfor i in range(n // 2 + 1, n):\n a[i][n // 2] = k\n k += 1\n a[n - 1 - i][n // 2] = k\n k += 1\nfor i in range(n // 2):\n for j in range(n // 2 + 1, n):\n a[i][j] = k\n k += 1\n a[n - 1 - i][j] = k\n k += 1\n a[i][n - 1 - j] = k\n k += 1\n a[n - 1 - i][n - 1 - j] = k\n k += 1\nfor i in range(n):\n print(\" \".join(str(a[i][j]) for j in range(n)))", "n = int(input())\nm = n * n\na = [[0] * n for i in range(n)]\nx, y = n // 2, n // 2\na[x][y] = \"T\"\ni, j = x, y - 1\nfor k in range(1, m):\n a[i][j] = k\n if k % 2 == 0:\n if j > 0:\n j -= 1\n else:\n i -= 1\n j = y\n else:\n if i > 0:\n i -= 1\n else:\n i = x\n j -= 1\nfor i in range(n):\n print(\" \".join(map(str, a[i])))", "n = int(input())\nm = n * n\na = [[0] * n for _ in range(n)]\nx, y = n // 2, n // 2\na[x][y] = \"T\"\nfor i in range(1, m):\n dx, dy = [-1, 0, 1, 0], [0, -1, 0, 1]\n for j in range(4):\n nx, ny = x + dx[j], y + dy[j]\n if 0 <= nx < n and 0 <= ny < n and a[nx][ny] == 0:\n a[nx][ny] = i + 1\n x, y = nx, ny\n break\nfor i in range(n):\n print(*a[i])", "n = int(input())\nm = n * n\na = [[0] * n for i in range(n)]\na[n // 2][n // 2] = \"T\"\nx, y = n // 2, n // 2\ndx, dy = 0, 1\nfor i in range(2, m + 1):\n a[x + dx][y + dy] = i\n if dx == 1 and x + dx == n - 1:\n dx, dy = -1, dy\n elif dx == -1 and x + dx == 0:\n dx, dy = 1, dy\n elif dy == 1 and y + dy == n - 1:\n dx, dy = dx, -1\n elif dy == -1 and y + dy == 0:\n dx, dy = dx, 1\n x += dx\n y += dy\nfor i in a:\n print(*i)", "n = int(input())\nm = n * n\na = [[0] * n for i in range(n)]\nx, y = n // 2, n // 2\na[x][y] = \"T\"\nfor i in range(1, m):\n if i % 2 == 1:\n a[x][y - 1] = i\n else:\n a[x][y + 1] = i\n if i == n * n - n:\n x -= 1\n y = n // 2\n elif i == n * n - 1:\n x += 1\n y = n // 2\n elif i % (n + 1) == 0:\n x -= 1\n elif i % (n + 1) == n:\n x += 1\n elif i % 2 == 0:\n y -= 1\n else:\n y += 1\nfor i in a:\n print(*i)", "n = int(input())\nm = n * n\na = [[0] * n for i in range(n)]\nx, y = n // 2, n // 2\na[x][y] = \"T\"\nfor i in range(1, m):\n if a[x - 1][y] == 0:\n a[x - 1][y] = i\n elif a[x + 1][y] == 0:\n a[x + 1][y] = i\n elif a[x][y - 1] == 0:\n a[x][y - 1] = i\n else:\n a[x][y + 1] = i\nfor i in a:\n print(*i)", "n = int(input())\nm = n * n\na = [[0] * n for i in range(n)]\nx, y = (n + 1) // 2, (n + 1) // 2\na[x][y] = \"T\"\nk = 1\nfor i in range(n):\n for j in range(n):\n if a[i][j]:\n continue\n if i == x and j == y - 1:\n a[i][j] = str(k)\n k += 1\n continue\n if i == x and j == y + 1:\n a[i][j] = str(k)\n k += 1\n continue\n if i == x - 1 and j == y:\n a[i][j] = str(k)\n k += 1\n continue\n if i == x + 1 and j == y:\n a[i][j] = str(k)\n k += 1\n continue\n if i == x and j == 0:\n a[i][j] = str(k)\n k += 1\n continue\n if i == x and j == n - 1:\n a[i][j] = str(k)\n k += 1\n continue\n if i == 0 and j == y:\n a[i][j] = str(k)\n k += 1\n continue\n if i == n - 1 and j == y:\n a[i][j] = str(k)\n k += 1\nfor i in a:\n print(*i)", "n = int(input())\nm = n * n\na = [[0] * n for i in range(n)]\nx, y = n // 2, n // 2\na[x][y] = \"T\"\ndx = [-1, 0, 1, 0]\ndy = [0, -1, 0, 1]\nd = 0\nfor i in range(1, m):\n nx, ny = x + dx[d], y + dy[d]\n if 0 <= nx < n and 0 <= ny < n:\n a[nx][ny] = i\n else:\n d = (d + 1) % 4\n nx, ny = x + dx[d], y + dy[d]\n a[nx][ny] = i\n x, y = nx, ny\nfor i in a:\n print(*i)", "n = int(input())\nm = n * n\na = [[0] * n for i in range(n)]\na[n // 2][n // 2] = \"T\"\nk = 1\nfor i in range(n // 2):\n a[i][n // 2] = k\n k += 1\n a[n - 1 - i][n // 2] = k\n k += 1\nfor i in range(n // 2 + 1, n):\n a[i][n // 2] = k\n k += 1\n a[i - 2][n // 2] = k\n k += 1\nfor i in range(n // 2 + 1, n):\n for j in range(n // 2 + 1, n):\n a[i][j] = k\n k += 1\n a[i - 1][j - 1] = k\n k += 1\nfor i in range(n // 2 + 1, n):\n for j in range(n // 2 - 1, -1, -1):\n a[i][j] = k\n k += 1\n a[i - 1][j + 1] = k\n k += 1\nfor i in range(n // 2 - 1, -1, -1):\n for j in range(n // 2 + 1, n):\n a[i][j] = k\n k += 1\n a[i + 1][j - 1] = k\n k += 1\nfor i in range(n // 2 - 1, -1, -1):\n for j in range(n // 2 - 1, -1, -1):\n a[i][j] = k\n k += 1\n a[i + 1][j + 1] = k\n k += 1\nfor i in range(n):\n print(\" \".join(str(a[i][j]) for j in range(n)))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\nprint(\"L\" + \"o\" * n + \"ng\")", "n = int(input())\nprint(\"L\" + \"o\" * n + \"ng\")", "n = int(input())\nprint(\"L\" + \"o\" * n + \"ng\")", "n = int(input())\nprint(\"L\" + \"o\" * n + \"ng\")", "n = int(input())\nprint(\"L\" + \"o\" * n + \"ng\")", "n = int(input())\nprint(\"L\" + \"o\" * n + \"ng\")", "n = int(input())\nprint(\"L\" + \"o\" * n + \"ng\")", "n = int(input())\nprint(\"L\" + \"o\" * n + \"ng\")", "n = int(input())\nprint(\"L\" + \"o\" * n + \"ng\")", "n = int(input())\nprint(\"L\" + \"o\" * n + \"ng\")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\nc = 0\r\nwhile n % 2 == 0:\r\n n = n // 2\r\n c += 1\r\nprint(c)\r", "n = int(input())\r\nc = 0\r\nwhile n % 2 == 0:\r\n n //= 2\r\n c += 1\r\nprint(c)\r", "n = int(input())\r\n\r\ncount = 0\r\n\r\nwhile n % 2 == 0:\r\n n //= 2\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\r\nc = 0\r\nwhile n % 2 == 0:\r\n n = n // 2\r\n c += 1\r\nprint(c)\r", "n = int(input())\r\nc = 0\r\nwhile n % 2 == 0:\r\n n //= 2\r\n c += 1\r\nprint(c)\r", "n = int(input())\r\nc = 0\r\nwhile n % 2 == 0:\r\n n //= 2\r\n c += 1\r\nprint(c)\r", "n = int(input())\r\nc = 0\r\nwhile n % 2 == 0:\r\n n //= 2\r\n c += 1\r\nprint(c)\r", "n = int(input())\r\nc = 0\r\nwhile n % 2 == 0:\r\n n = n // 2\r\n c += 1\r\nprint(c)\r", "n = int(input())\r\nc = 0\r\nwhile n % 2 == 0:\r\n n //= 2\r\n c += 1\r\nprint(c)\r", "n = int(input())\r\nprint(bin(n).count(\"0\") - 1)\r" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, false ], "metadata_list": [] }, { "code_list": [ "def f(n, d):\r\n if n == 0:\r\n return d\r\n return f(n // 5, d * 10) + (n % 5) * d\r\n\r\nn = int(input())\r\nans = \"\"\r\nfor i in range(1, 100):\r\n if f(i, 2) >= n:\r\n ans = \"2\" * i\r\n break\r\n n -= f(i, 2)\r\nprint(ans)\r", "def f(n, d):\r\n if n == 0:\r\n return d\r\n else:\r\n return f(n // 5, d * 10) + f(n % 5, d * 10 + 2)\r\n\r\nn = int(input())\r\nprint(f(n, 2))\r", "def main():\r\n n = int(input())\r\n if n == 1:\r\n print(0)\r\n return\r\n n -= 1\r\n s = \"\"\r\n while n:\r\n d = n % 5\r\n n //= 5\r\n if d == 0:\r\n s = \"0\" + s\r\n elif d == 1:\r\n s = \"2\" + s\r\n elif d == 2:\r\n s = \"4\" + s\r\n elif d == 3:\r\n s = \"6\" + s\r\n else:\r\n s = \"8\" + s\r\n print(\"2\" + s)\r\n\r\n\r\nmain()\r", "def f(n):\r\n if n == 0:\r\n return 0\r\n if n < 5:\r\n return n\r\n q, r = divmod(n - 1, 5)\r\n return 10**q * 2 + f(r)\r\n\r\n\r\nn = int(input())\r\nprint(f(n))\r", "def main():\r\n n = int(input())\r\n if n == 1:\r\n print(0)\r\n return\r\n n -= 1\r\n s = \"\"\r\n for i in range(1, 1000000):\r\n s = \"2\" + s\r\n n -= 5 ** (i - 1)\r\n if n <= 0:\r\n break\r\n print(s[: n % 5 + 1])\r\n\r\n\r\nmain()\r", "def f(n, m):\r\n if n == 0:\r\n return m\r\n return f(n // 5, m * 10 + 2)\r\n\r\nn = int(input())\r\nprint(f(n, 0))\r", "def f(n):\r\n if n == 0:\r\n return 0\r\n if n <= 5:\r\n return n\r\n q, r = divmod(n - 1, 5)\r\n return 10**q * 2 + f(r)\r\n\r\nn = int(input())\r\nprint(f(n))\r", "def good_integer(n):\r\n if n == 0:\r\n return \"0\"\r\n digits = []\r\n while n:\r\n digits.append(str(n % 5))\r\n n //= 5\r\n return \"\".join(digits[::-1])\r\n\r\n\r\ndef solve(n):\r\n if n == 1:\r\n return \"0\"\r\n digits = []\r\n i = 1\r\n while n > 0:\r\n if n % 5 == 0:\r\n digits.append(\"0\")\r\n n //= 5\r\n else:\r\n digits.append(str(8 - (n - 1) % 5))\r\n n = (n - 1) // 5 * 5 + 4\r\n i += 1\r\n return \"2\" * (len(digits) - 1) + \"\".join(digits[::-1])\r\n\r\n\r\nn = int(input())\r\nprint(solve(n))\r", "def main():\r\n n = int(input())\r\n if n == 1:\r\n print(0)\r\n return\r\n n -= 1\r\n s = \"\"\r\n for i in range(1, 1000000):\r\n s = \"2\" + s\r\n n -= len(s)\r\n if n <= 0:\r\n break\r\n s = list(s)\r\n for i in range(len(s)):\r\n if n == 0:\r\n break\r\n if s[i] == \"8\":\r\n s[i] = \"0\"\r\n elif s[i] == \"6\":\r\n s[i] = \"8\"\r\n elif s[i] == \"4\":\r\n s[i] = \"6\"\r\n elif s[i] == \"2\":\r\n s[i] = \"4\"\r\n elif s[i] == \"0\":\r\n s[i] = \"2\"\r\n n -= 1\r\n print(\"\".join(s))\r\n\r\n\r\nmain()\r", "def main():\r\n n = int(input())\r\n if n == 1:\r\n print(0)\r\n return\r\n n -= 1\r\n s = \"\"\r\n for i in range(1, 1000000):\r\n s = \"2\" + s\r\n n -= i * 5\r\n if n <= 0:\r\n break\r\n print(s[: n % 5 + 1])\r\n\r\n\r\nmain()\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nA = list(map(int, input().split()))\n\nA.sort()\n\nans = 0\nfor i in range(N):\n for j in range(i, N):\n k = A[j] - j + i\n if k > ans and k <= A[j]:\n ans = k\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n):\n for j in range(i, n):\n if a[j] - j + i > ans:\n ans = a[j] - j + i\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n):\n for j in range(i, n):\n k = a[j] - j + i\n if k > 0 and k <= a[j]:\n ans = max(ans, j - i + 1 + (n - j - 1))\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\n\nl, r = 0, n - 1\nans = 0\nwhile l < r:\n if a[l] + a[r] <= a[l + 1]:\n ans = max(ans, a[l] + a[r] + 1)\n l += 1\n r -= 1\n else:\n l += 1\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n):\n for j in range(i, n):\n if a[j] - j + i <= a[i]:\n ans = max(ans, j - i + 1)\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n):\n for j in range(i, n):\n k = a[j]\n if k > j - i:\n k = j - i\n for l in range(j, n):\n if a[l] > k:\n a[l] -= 1\n else:\n break\n ans = max(ans, j - i + 1 + k)\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n):\n for j in range(i, n):\n if a[j] - j + i > ans:\n ans = a[j] - j + i\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nA = list(map(int, input().split()))\n\nA.sort()\n\nans = 0\nfor i in range(N):\n for j in range(i, N):\n k = A[j] - j + i\n if k > ans:\n ans = k\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n):\n j = i\n while j < n and a[j] == a[i]:\n j += 1\n if j - i >= 2:\n ans = max(ans, (j - i + 1) // 2)\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n):\n for j in range(i, n):\n k = a[j] - j + i\n if k > 0 and k <= a[j]:\n ans = max(ans, j - i + 1 + (j - i))\n break\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ntakahashi = 0\naoki = 0\nfor i in range(n):\n x, y = map(int, input().split())\n takahashi += x\n aoki += y\nif takahashi > aoki:\n print(\"Takahashi\")\nelif aoki > takahashi:\n print(\"Aoki\")\nelse:\n print(\"Draw\")", "n = int(input())\ntakahashi = 0\naoki = 0\nfor i in range(n):\n x, y = map(int, input().split())\n takahashi += x\n aoki += y\nif takahashi > aoki:\n print(\"Takahashi\")\nelif aoki > takahashi:\n print(\"Aoki\")\nelse:\n print(\"Draw\")", "n = int(input())\ntakahashi = 0\naoki = 0\nfor i in range(n):\n x, y = map(int, input().split())\n takahashi += x\n aoki += y\nif takahashi > aoki:\n print(\"Takahashi\")\nelif aoki > takahashi:\n print(\"Aoki\")\nelse:\n print(\"Draw\")", "n = int(input())\ntakahashi_score = 0\naoki_score = 0\nfor i in range(n):\n x, y = map(int, input().split())\n takahashi_score += x\n aoki_score += y\nif takahashi_score > aoki_score:\n print(\"Takahashi\")\nelif aoki_score > takahashi_score:\n print(\"Aoki\")\nelse:\n print(\"Draw\")", "n = int(input())\ntakahashi = 0\naoki = 0\nfor i in range(n):\n x, y = map(int, input().split())\n takahashi += x\n aoki += y\nif takahashi > aoki:\n print(\"Takahashi\")\nelif aoki > takahashi:\n print(\"Aoki\")\nelse:\n print(\"Draw\")", "n = int(input())\ntakahashi_score = 0\naoki_score = 0\nfor i in range(n):\n x, y = map(int, input().split())\n takahashi_score += x\n aoki_score += y\nif takahashi_score > aoki_score:\n print(\"Takahashi\")\nelif aoki_score > takahashi_score:\n print(\"Aoki\")\nelse:\n print(\"Draw\")", "n = int(input())\ntakahashi = 0\naoki = 0\nfor i in range(n):\n x, y = map(int, input().split())\n takahashi += x\n aoki += y\nif takahashi > aoki:\n print(\"Takahashi\")\nelif aoki > takahashi:\n print(\"Aoki\")\nelse:\n print(\"Draw\")", "n = int(input())\ntakahashi = 0\naoki = 0\nfor i in range(n):\n x, y = map(int, input().split())\n takahashi += x\n aoki += y\nif takahashi > aoki:\n print(\"Takahashi\")\nelif aoki > takahashi:\n print(\"Aoki\")\nelse:\n print(\"Draw\")", "n = int(input())\ntakahashi_score = 0\naoki_score = 0\nfor i in range(n):\n x, y = map(int, input().split())\n takahashi_score += x\n aoki_score += y\nif takahashi_score > aoki_score:\n print(\"Takahashi\")\nelif aoki_score > takahashi_score:\n print(\"Aoki\")\nelse:\n print(\"Draw\")", "n = int(input())\ntakahashi = 0\naoki = 0\nfor i in range(n):\n x, y = map(int, input().split())\n takahashi += x\n aoki += y\nif takahashi > aoki:\n print(\"Takahashi\")\nelif aoki > takahashi:\n print(\"Aoki\")\nelse:\n print(\"Draw\")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "s = input()\na = s.count(\"A\")\nb = s.count(\"B\")\nc = s.count(\"C\")\nif a > 0 and b > 0 and c > 0 and a + b + c == len(s) and s[a] == \"B\" and s[a + b] == \"C\":\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\na = s.find(\"B\")\nb = s.rfind(\"B\")\nc = s.find(\"C\")\nd = s.rfind(\"C\")\nif a == 0 and b == len(s) - 1 and c > 0 and d == len(s) - 1:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\na = s.count(\"A\")\nb = s.count(\"B\")\nc = s.count(\"C\")\nif a > 0 and b > 0 and c > 0:\n if s[:a] == \"A\" * a and s[a : a + b] == \"B\" * b and s[a + b :] == \"C\" * c:\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n print(\"No\")", "s = input()\na = s.find(\"B\")\nb = s.rfind(\"B\")\nif s[:a] == \"A\" * len(s[:a]) and s[b + 1 :] == \"C\" * len(s[b + 1 :]) and \"A\" not in s[a : b + 1] and \"C\" not in s[a : b + 1]:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\na = s.find(\"B\")\nb = s.rfind(\"B\")\nif s[:a] == \"A\" * len(s[:a]) and s[b + 1 :] == \"C\" * len(s[b + 1 :]) and \"A\" not in s[a : b + 1] and \"C\" not in s[a : b + 1]:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\na = s.find(\"B\")\nb = s.rfind(\"B\")\nif s[:a] == \"A\" * a and s[b + 1 :] == \"C\" * (len(s) - b - 1):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\na = s.find(\"B\")\nb = s.rfind(\"B\")\nif s[:a] == \"A\" * a and s[b + 1 :] == \"C\" * (len(s) - b - 1):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\na = s.find(\"B\")\nb = s.rfind(\"B\")\nif s[:a] == \"A\" * len(s[:a]) and s[b + 1 :] == \"C\" * len(s[b + 1 :]) and \"A\" not in s[a : b + 1] and \"C\" not in s[a : b + 1]:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\na = s.find(\"B\")\nb = s.rfind(\"B\")\nif a != -1 and b != -1 and a != b:\n print(\"No\")\nelif s.count(\"A\") == len(s) or s.count(\"B\") == len(s) or s.count(\"C\") == len(s) or (\n s.count(\"A\") + s.count(\"B\") + s.count(\"C\") == len(s)\n):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\na = s.find(\"B\")\nb = s.rfind(\"B\")\nif s[:a].count(\"A\") == len(s[:a]) and s[b + 1 :].count(\"C\") == len(s[b + 1 :]) and a != -1 and b != -1:\n print(\"Yes\")\nelse:\n print(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = list(map(int, input().split()))\n\nans = [0] * n\n\nfor i in range(n):\n if a[i] == -1:\n ans[i] = i + 1\n\nfor i in range(n):\n if a[i] != -1:\n ans[a[i] - 1] = i + 1\n\nprint(*ans)", "n = int(input())\na = list(map(int, input().split()))\n\nans = [0] * n\n\nfor i in range(n):\n if a[i] == -1:\n ans[i] = i + 1\n\nfor i in range(n):\n if a[i] != -1:\n ans[a[i] - 1] = i + 1\n\nprint(*ans)", "n = int(input())\na = list(map(int, input().split()))\n\nans = [0] * n\n\nfor i in range(n):\n if a[i] == -1:\n ans[i] = i + 1\n\nfor i in range(n):\n if a[i] != -1:\n ans[a[i] - 1] = i + 1\n\nprint(*ans)", "n = int(input())\na = list(map(int, input().split()))\n\nans = [0] * n\n\nfor i in range(n):\n if a[i] == -1:\n ans[i] = i + 1\n\nfor i in range(n):\n if a[i] != -1:\n ans[a[i] - 1] = i + 1\n\nfor i in range(n):\n print(ans[i], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\n\nans = [0] * n\nfor i in range(n):\n if a[i] == -1:\n ans[i] = i + 1\n\nfor i in range(n):\n if a[i] != -1:\n ans[a[i] - 1] = i + 1\n\nprint(*ans)", "n = int(input())\na = list(map(int, input().split()))\n\nans = [0] * n\n\nfor i in range(n):\n if a[i] == -1:\n ans[i] = i + 1\n\nfor i in range(n):\n if a[i] != -1:\n ans[a[i] - 1] = i + 1\n\nfor i in range(n):\n print(ans[i], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\n\nans = [0] * n\n\nfor i in range(n):\n if a[i] == -1:\n ans[i] = i + 1\n\nfor i in range(n):\n if a[i] != -1:\n ans[a[i] - 1] = i + 1\n\nfor i in range(n):\n print(ans[i], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\n\nans = [0] * n\nfor i in range(n):\n if a[i] == -1:\n ans[i] = i + 1\n\nfor i in range(n):\n if a[i] != -1:\n ans[a[i] - 1] = i + 1\n\nfor i in range(n):\n print(ans[i], end=\" \")", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nans = [0] * n\r\n\r\nfor i in range(n):\r\n if a[i] == -1:\r\n ans[i] = i + 1\r\n else:\r\n ans[i] = ans[a[i] - 1]\r\n\r\nprint(*ans)\r", "n = int(input())\na = list(map(int, input().split()))\n\nans = [0] * n\n\nfor i in range(n):\n if a[i] == -1:\n ans[i] = i + 1\n\nfor i in range(n):\n if a[i] != -1:\n ans[a[i] - 1] = i + 1\n\nprint(*ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\n(h, w, k) = map(int, input().split())\ngrid = []\nfor _ in range(h):\n grid.append(input())\ndp = [[0] * w for _ in range(h)]\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \"x\":\n dp[i][j] = -1\n elif grid[i][j] == \".\":\n dp[i][j] = 1\n else:\n dp[i][j] = 0\nfor i in range(h):\n for j in range(w):\n if j + k <= w:\n dp[i][j] = max(dp[i][j], dp[i][j + k - 1] + 1)\n if i + k <= h:\n dp[i][j] = max(dp[i][j], dp[i + k - 1][j] + 1)\nans = float(\"inf\")\nfor i in range(h):\n for j in range(w):\n ans = min(ans, k - dp[i][j])\nif ans == float(\"inf\"):\n print(-1)\nelse:\n print(ans)", "from collections import deque\n\n(h, w, k) = map(int, input().split())\ngrid = []\nfor _ in range(h):\n grid.append(input())\ndp = [[0] * w for _ in range(h)]\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \"x\":\n dp[i][j] = -1\n elif grid[i][j] == \"o\":\n if i > 0:\n dp[i][j] = max(dp[i][j], dp[i - 1][j])\n if j > 0:\n dp[i][j] = max(dp[i][j], dp[i][j - 1])\n else:\n if i > 0:\n dp[i][j] = max(dp[i][j], dp[i - 1][j]) + 1\n if j > 0:\n dp[i][j] = max(dp[i][j], dp[i][j - 1]) + 1\nans = -1\nfor i in range(h):\n for j in range(w):\n if j + k <= w:\n if dp[i][j] >= k:\n ans = max(ans, dp[i][j] - k + 1)\n if i + k <= h:\n if dp[i][j] >= k:\n ans = max(ans, dp[i][j] - k + 1)\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(h, w, k) = map(int, input().split())\ns = [input().rstrip() for _ in range(h)]\nans = 10**9\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \"x\":\n continue\n cnt = 0\n for y in range(i, min(i + k, h)):\n for x in range(j, min(j + k, w)):\n if s[y][x] == \".\":\n cnt += 1\n ans = min(ans, cnt)\nif ans == 10**9:\n print(-1)\nelse:\n print(ans)", "from collections import deque\n\n(h, w, k) = map(int, input().split())\ns = [input() for _ in range(h)]\ndx = [0, 1, 0, -1]\ndy = [1, 0, -1, 0]\nans = float(\"inf\")\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \"x\":\n continue\n cnt = 0\n for d in range(4):\n x = i + dx[d]\n y = j + dy[d]\n while 0 <= x < h and 0 <= y < w and s[x][y] != \"x\":\n s[x][y] = \"x\"\n cnt += 1\n x += dx[d]\n y += dy[d]\n if cnt >= k:\n ans = min(ans, cnt - k + 1)\nif ans == float(\"inf\"):\n print(-1)\nelse:\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n(H, W, K) = map(int, input().split())\nS = [input().rstrip() for _ in range(H)]\nans = 10**9\nfor i in range(H):\n for j in range(W):\n if S[i][j] == \"o\":\n continue\n if j + K - 1 < W:\n if all((S[i][k] == \"o\" for k in range(j, j + K))):\n ans = 0\n break\n if i + K - 1 < H:\n if all((S[k][j] == \"o\" for k in range(i, i + K))):\n ans = 0\n break\n if j + K - 1 < W and i + K - 1 < H:\n c = 0\n for k in range(i, i + K):\n if S[k][j] == \".\":\n c += 1\n for k in range(j, j + K):\n if S[i][k] == \".\":\n c += 1\n ans = min(ans, c)\nif ans == 10**9:\n ans = -1\nprint(ans)", "from collections import deque\n\n(h, w, k) = map(int, input().split())\ns = [input() for _ in range(h)]\nans = 10**10\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \".\":\n if j + k - 1 < w:\n t = s[i][j : j + k]\n if t.count(\"o\") == k - 1:\n ans = min(ans, 1 + t.count(\".\"))\n if i + k - 1 < h:\n t = [s[p][j] for p in range(i, i + k)]\n if t.count(\"o\") == k - 1:\n ans = min(ans, 1 + t.count(\".\"))\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \".\":\n if j + k - 1 < w and s[i][j : j + k].count(\"x\") == 0:\n ans = min(ans, s[i][j : j + k].count(\".\"))\n if i + k - 1 < h and all(\n s[p][j] != \"x\" for p in range(i, i + k)\n ):\n ans = min(ans, sum(s[p][j] == \".\" for p in range(i, i + k)))\nif ans == 10**10:\n ans = -1\nprint(ans)", "from collections import deque\n\nH, W, K = map(int, input().split())\nS = [input() for _ in range(H)]\n\ndx = [0, 1, 0, -1]\ndy = [1, 0, -1, 0]\n\nINF = 10**18\ndp = [[INF] * W for _ in range(H)]\nfor i in range(H):\n for j in range(W):\n if S[i][j] == \"o\":\n dp[i][j] = 0\n\nfor i in range(H):\n for j in range(W):\n if S[i][j] == \".\":\n for k in range(4):\n nx, ny = j + dx[k], i + dy[k]\n if 0 <= nx < W and 0 <= ny < H and S[ny][nx] == \"o\":\n dp[i][j] = 1\n break\n\nfor i in range(H):\n for j in range(W):\n if S[i][j] == \"x\":\n dp[i][j] = INF\n\nfor i in range(H):\n for j in range(W):\n if dp[i][j] < K:\n continue\n for k in range(4):\n nx, ny = j + dx[k], i + dy[k]\n if 0 <= nx < W and 0 <= ny < H:\n dp[ny][nx] = min(dp[ny][nx], dp[i][j] + (S[i][j] == \".\"))\n\nans = INF\nfor i in range(H):\n for j in range(W):\n ans = min(ans, dp[i][j])\n\nif ans == INF:\n print(-1)\nelse:\n print(ans - K)", "from collections import deque\n\n(h, w, k) = map(int, input().split())\ngrid = []\nfor _ in range(h):\n grid.append(input())\ndp = [[0] * w for _ in range(h)]\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \"x\":\n dp[i][j] = float(\"inf\")\n elif grid[i][j] == \"o\":\n if i > 0:\n dp[i][j] = min(dp[i][j], dp[i - 1][j] + 1)\n if j > 0:\n dp[i][j] = min(dp[i][j], dp[i][j - 1] + 1)\nans = float(\"inf\")\nfor i in range(h):\n for j in range(w):\n if j + k - 1 < w:\n ans = min(ans, dp[i][j] + dp[i][j + k - 1] - 1)\n if i + k - 1 < h:\n ans = min(ans, dp[i][j] + dp[i + k - 1][j] - 1)\nif ans == float(\"inf\"):\n print(-1)\nelse:\n print(ans)", "from collections import deque\n\nH, W, K = map(int, input().split())\nS = [input() for _ in range(H)]\n\ndx = [0, 1, 0, -1]\ndy = [1, 0, -1, 0]\n\ndist = [[0] * W for _ in range(H)]\nfor i in range(H):\n for j in range(W):\n if S[i][j] == \"x\":\n dist[i][j] = -1\n\nq = deque()\nfor i in range(H):\n for j in range(W):\n if S[i][j] == \"o\":\n q.append((i, j))\n dist[i][j] = 0\n\nwhile q:\n y, x = q.popleft()\n for k in range(4):\n ny = y + dy[k]\n nx = x + dx[k]\n if 0 <= ny < H and 0 <= nx < W:\n if dist[ny][nx] == -1:\n continue\n if dist[ny][nx] == 0 and S[ny][nx] == \".\":\n dist[ny][nx] = 1\n q.append((ny, nx))\n\nans = 10**9\nfor i in range(H):\n for j in range(W - K + 1):\n if dist[i][j] >= K:\n ans = min(ans, dist[i][j + K - 1] - K + 1)\nfor i in range(H - K + 1):\n for j in range(W):\n if dist[i][j] >= K:\n ans = min(ans, dist[i + K - 1][j] - K + 1)\n\nif ans == 10**9:\n print(-1)\nelse:\n print(ans)", "from collections import deque\n\n(h, w, k) = map(int, input().split())\ngrid = []\nfor _ in range(h):\n grid.append(list(input()))\ndp = [[0] * w for _ in range(h)]\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \"x\":\n dp[i][j] = float(\"inf\")\n elif grid[i][j] == \"o\":\n if i > 0:\n dp[i][j] = min(dp[i][j], dp[i - 1][j] + 1)\n if j > 0:\n dp[i][j] = min(dp[i][j], dp[i][j - 1] + 1)\nans = float(\"inf\")\nfor i in range(h):\n for j in range(w):\n if j + k - 1 < w:\n ans = min(ans, dp[i][j] + dp[i][j + k - 1] - 1)\n if i + k - 1 < h:\n ans = min(ans, dp[i][j] + dp[i + k - 1][j] - 1)\nif ans == float(\"inf\"):\n print(-1)\nelse:\n print(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nprint(n - 1)\nsys.stdout.flush()\nfor i in range(n):\n if i == n - 1:\n continue\n print(n - 1, end=\" \")\n for j in range(n):\n if j == i or j == n - 1:\n continue\n print(j + 1, end=\" \")\n print()\n sys.stdout.flush()\n\ns = input()\nfor i in range(n):\n if s[i] == \"1\":\n break\nelse:\n i = n - 1\nprint(i + 1)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nN = int(input())\r\n\r\nprint((N - 1) // 2 + 1)\r\n\r\nfor i in range((N - 1) // 2 + 1):\r\n if i == (N - 1) // 2:\r\n if N % 2 == 0:\r\n print(2, i + 1, i + 2)\r\n else:\r\n print(1, i + 1)\r\n else:\r\n print(1, i + 1)\r\n\r\nS = input()\r\n\r\nfor i in range((N - 1) // 2 + 1):\r\n if S[i] == '1':\r\n print(i + 1)\r\n exit()\r", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nprint(2)\nprint(1, 1)\nprint(1, 2)\ns = input()\nif s == \"10\":\n print(1)\nelif s == \"01\":\n print(2)\nelse:\n print(3)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\nprint(n - 1)\r\nfor i in range(n - 1):\r\n print(n - 1, i + 2, sep=' ', end='\\n')\r\n\r\ns = input()\r\n\r\nfor i in range(n - 1):\r\n if s[i] == '1':\r\n print(i + 2)\r\n exit()", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\n\nprint((n - 1) // 2 + 1)\n\nfor i in range(1, n + 1):\n if i % 2 == 1:\n print(i, end=' ')\n elif (i - 1) % 4 == 0:\n print(i, end=' ')\nprint()\n\ns = input()\n\nfor i in range(n):\n if s[i] == '1':\n print(i + 1)\n exit()", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nprint(n - 1)\nsys.stdout.flush()\nfor i in range(n):\n if i == n - 1:\n continue\n print(n - 1, end=\" \")\n for j in range(n):\n if j == i or j == n - 1:\n continue\n print(j + 1, end=\" \")\n print()\n sys.stdout.flush()\n\ns = input()\nfor i in range(n):\n if s[i] == \"1\":\n break\nelse:\n i = n - 1\nprint(i + 1)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nprint((n - 1) // 2 + 1)\nsys.stdout.flush()\n\nfor i in range(n):\n if i < (n - 1) // 2:\n print(2, i + 1, n)\n else:\n print(1, i + 1)\n sys.stdout.flush()\n\ns = input()\nfor i in range(n):\n if s[i] == '1':\n print(i + 1)\n sys.stdout.flush()\n break", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nprint(n - 1)\nsys.stdout.flush()\nfor i in range(n):\n print(n - 1, *(range(n)[:i] + range(i + 1, n)))\n sys.stdout.flush()\ns = input()\nprint((int(s) + 1).index('1') + 1)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nprint(n - 1)\nsys.stdout.flush()\nfor i in range(n):\n if i == n - 1:\n continue\n print(n - 1, end=\" \")\n for j in range(n):\n if j == i or j == n - 1:\n continue\n print(j + 1, end=\" \")\n print()\nsys.stdout.flush()\ns = input()\nfor i in range(n):\n if s[i] == \"1\":\n break\nprint(i + 1)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nprint(n - 1)\nsys.stdout.flush()\nfor i in range(n):\n if i == n - 1:\n continue\n print(n - 1, end=\" \")\n for j in range(n):\n if j == i or j == n - 1:\n continue\n print(j + 1, end=\" \")\n print()\n sys.stdout.flush()\n\ns = input()\nfor i in range(n):\n if s[i] == \"1\":\n x = i + 1\n break\nprint(x)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s = input()\nif s[0].isupper() and all(c.islower() for c in s[1:]):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s[0].isupper() and all(c.islower() for c in s[1:]):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s[0].isupper() and all(c.islower() for c in s[1:]):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s[0].isupper() and all(c.islower() for c in s[1:]):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s[0].isupper() and all(c.islower() for c in s[1:]):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s[0].isupper() and all(c.islower() for c in s[1:]):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s[0].isupper() and all(c.islower() for c in s[1:]):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s[0].isupper() and all(c.islower() for c in s[1:]):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s[0].isupper() and all(c.islower() for c in s[1:]):\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s[0].isupper() and all(c.islower() for c in s[1:]):\n print(\"Yes\")\nelse:\n print(\"No\")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "s = input()\nd = {}\nfor i in s:\n if i in d:\n d[i] += 1\n else:\n d[i] = 1\nmx = max(d.values())\nfor i in sorted(d.keys()):\n if d[i] == mx:\n print(i)\n break", "s = input()\nfrom collections import Counter\n\nc = Counter(s)\nmx = max(c.values())\nfor i in range(97, 123):\n if chr(i) in c and c[chr(i)] == mx:\n print(chr(i))\n break", "s = input()\r\nd = {}\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nm = max(d.values())\r\nfor i in sorted(d.keys()):\r\n if d[i] == m:\r\n print(i)\r\n break\r", "s = input()\r\nd = {}\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nm = max(d.values())\r\nfor i in range(97, 123):\r\n if chr(i) in d and d[chr(i)] == m:\r\n print(chr(i))\r\n break\r", "s = input()\r\nd = {}\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nmx = max(d.values())\r\nfor i in sorted(d):\r\n if d[i] == mx:\r\n print(i)\r\n break\r", "s = input()\r\nd = {}\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nm = max(d.values())\r\nfor i in range(97, 123):\r\n if chr(i) in d and d[chr(i)] == m:\r\n print(chr(i))\r\n exit()", "s = input()\r\nd = {}\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nm = max(d.values())\r\nfor i in range(97, 123):\r\n if chr(i) in d and d[chr(i)] == m:\r\n print(chr(i))\r\n break\r", "s = input()\r\nfrom collections import Counter\r\n\r\nc = Counter(s)\r\nm = max(c.values())\r\nfor i in range(97, 123):\r\n if chr(i) in c and c[chr(i)] == m:\r\n print(chr(i))\r\n break\r", "s = input()\r\nd = {}\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nm = max(d.values())\r\nfor i in range(97, 123):\r\n if chr(i) in d and d[chr(i)] == m:\r\n print(chr(i))\r\n exit()", "s = input()\nd = {}\nfor i in s:\n if i in d:\n d[i] += 1\n else:\n d[i] = 1\nm = max(d.values())\nfor i in range(97, 123):\n if chr(i) in d and d[chr(i)] == m:\n print(chr(i))\n break" ], "pass1_list": [ true, true, true, true, true, false, true, true, false, true ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nq = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nans = 0\nfor i in range(10000):\n for j in range(10000):\n flag = True\n for k in range(n):\n if q[k] < (i + 1) * a[k] + (j + 1) * b[k]:\n flag = False\n break\n if flag:\n ans = max(ans, i + j)\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nq = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ndp = [[0] * (sum(q) + 1) for _ in range(n + 1)]\nfor i in range(1, n + 1):\n for j in range(sum(q) + 1):\n if j < a[i - 1]:\n dp[i][j] = dp[i - 1][j]\n else:\n dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - a[i - 1]] + 1)\nans = 0\nfor i in range(sum(q) + 1):\n ans = max(ans, dp[n][i] + (sum(q) - i) // b[0])\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nq = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ndp = [[0] * (sum(q) + 1) for _ in range(n + 1)]\nfor i in range(1, n + 1):\n for j in range(sum(q) + 1):\n if j < a[i - 1]:\n dp[i][j] = dp[i - 1][j]\n else:\n dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - a[i - 1]] + 1)\nfor i in range(n + 1):\n for j in range(sum(q) + 1):\n if j < b[i]:\n dp[i][j] = max(dp[i][j], dp[n][j])\nprint(dp[n][sum(q)])", "from collections import defaultdict\nfrom itertools import product\n\nN = int(input())\nQ = list(map(int, input().split()))\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\n# Calculate the gcd of two numbers\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n\n# Calculate the lcm of two numbers\ndef lcm(a, b):\n return a * b // gcd(a, b)\n\n\n# Calculate the lcm of a list of numbers\ndef lcm_list(lst):\n result = 1\n for i in lst:\n result = lcm(result, i)\n return result\n\n\n# Calculate the number of servings of dish A and B that can be made\ndef calculate_servings(Q, A, B):\n # Calculate the lcm of the ingredients required for each dish\n lcm_A = lcm_list(A)\n lcm_B = lcm_list(B)\n\n # Initialize the number of servings of each dish to 0\n servings_A = 0\n servings_B = 0\n\n # Calculate the maximum number of servings of dish A\n for i in range(len(Q)):\n servings_A += Q[i] // lcm_A\n\n # Calculate the maximum number of servings of dish B\n for i in range(len(Q)):\n servings_B += Q[i] // lcm_B\n\n return servings_A, servings_B\n\n\n# Calculate the maximum number of servings of dishes that can be made\ndef max_servings(Q, A, B):\n # Calculate the initial number of servings of each dish\n servings_A, servings_B = calculate_servings(Q, A, B)\n\n # Initialize the maximum number of servings of dishes\n max_servings = servings_A + servings_B\n\n # Check all possible combinations of dish servings\n for a, b in product(range(servings_A + 1), range(servings_B + 1)):\n # Check if the combination of dish servings is valid\n if a < 0 or b < 0:\n continue\n\n # Calculate the ingredients used for each dish\n used_A = [x * a for x in A]\n used_B = [x * b for x in B]\n\n # Check if the combination of dish servings uses too many ingredients\n for i in range(len(Q)):\n if Q[i] < sum(used_A[i]) + sum(used_B[i]):\n break\n else:\n # If the combination is valid, update the maximum number of servings\n max_servings = max(max_servings, a + b)\n\n return max_servings\n\n\n# Print the maximum number of servings of dishes that can be made\nprint(max_servings(Q, A, B))", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nq = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ndp = [[0] * (sum(q) + 1) for _ in range(n + 1)]\nfor i in range(n):\n dp[i + 1][q[i]] = 1\nfor i in range(n + 1):\n for j in range(sum(q) + 1):\n if dp[i][j] == 0:\n continue\n if i == n:\n dp[i][j] = j // a[i - 1]\n else:\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])\n if j - b[i] >= 0:\n dp[i][j - b[i]] += 1\nprint(dp[n][sum(q)])", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nq = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ndp = [[0] * (sum(q) + 1) for _ in range(n + 1)]\nfor i in range(1, n + 1):\n for j in range(sum(q) + 1):\n if j < a[i - 1]:\n dp[i][j] = dp[i - 1][j]\n else:\n dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - a[i - 1]] + 1)\nfor i in range(n - 1, -1, -1):\n for j in range(sum(q) + 1):\n if j < b[i]:\n dp[i][j] = max(dp[i][j], dp[i + 1][j])\n else:\n dp[i][j] = max(dp[i][j], dp[i + 1][j - b[i]] + 1)\nprint(dp[0][sum(q)])", "from collections import defaultdict\nfrom itertools import product\n\nN = int(input())\nQ = [int(i) for i in input().split()]\nA = [int(i) for i in input().split()]\nB = [int(i) for i in input().split()]\n\ndp = defaultdict(int)\nfor i in range(N + 1):\n dp[i] = defaultdict(int)\n\nfor i in range(N + 1):\n dp[i][0] = 1\n\nfor i in range(1, N + 1):\n for j in range(Q[i - 1] // A[i - 1] + 1):\n dp[i][j] = dp[i - 1][j]\n\nfor i in range(1, N + 1):\n for j in range(Q[i - 1] // B[i - 1] + 1):\n dp[i][j] += dp[i - 1][j]\n\nans = 0\nfor i in product(*[range(Q[i] // A[i] + 1) for i in range(N)]):\n ans += dp[N][sum(j * A[i] for i, j in enumerate(i))]\n\nfor i in product(*[range(Q[i] // B[i] + 1) for i in range(N)]):\n ans += dp[N][sum(j * B[i] for i, j in enumerate(i))]\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nq = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nans = 0\nfor i in range(1, 10**6 + 1):\n for j in range(1, 10**6 + 1):\n flag = True\n for k in range(n):\n if q[k] < i * a[k] + j * b[k]:\n flag = False\n break\n if flag:\n ans = max(ans, i + j)\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nq = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ndp = [[0] * (sum(q) + 1) for _ in range(n + 1)]\nfor i in range(1, n + 1):\n for j in range(sum(q) + 1):\n if j < a[i - 1]:\n dp[i][j] = dp[i - 1][j]\n else:\n dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - a[i - 1]] + 1)\nfor i in range(n - 1, -1, -1):\n for j in range(sum(q) + 1):\n if j < b[i]:\n dp[i][j] = max(dp[i][j], dp[i + 1][j])\n else:\n dp[i][j] = max(dp[i][j], dp[i + 1][j - b[i]] + 1)\nprint(dp[0][sum(q)])", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nq = list(map(int, input().split()))\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ndp = [[0] * (10**5 + 1) for _ in range(n + 1)]\nfor i in range(n):\n for j in range(q[i] // a[i], -1, -1):\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j - 1] + 1)\n for j in range(q[i] // b[i], -1, -1):\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])\nprint(dp[n][0])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\nx = list(map(int, input().split()))\n\nans = 0\nfor i in range(1, n):\n ans += abs(x[i - 1] - x[i]) - 1\n\nprint(ans + min(abs(x[0] - x[-1]) - 1, abs(x[0] - x[-1]) + n - 2))", "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nX = list(map(int, input().split()))\n\nans = 0\nfor i in range(M - 1):\n if X[i] > X[i + 1]:\n ans += X[i] - X[i + 1]\n else:\n ans += N - X[i + 1] + X[i]\n\nprint(ans)", "n, m = map(int, input().split())\nx = list(map(int, input().split()))\n\nans = 0\nfor i in range(m - 1):\n if x[i] < x[i + 1]:\n ans += x[i + 1] - x[i] - 1\n else:\n ans += n - x[i] + x[i + 1] - 1\n\nprint(ans)", "from collections import defaultdict\n\n(n, m) = map(int, input().split())\nx = list(map(int, input().split()))\nd = defaultdict(int)\nfor i in range(m - 1):\n d[x[i] - x[i + 1]] += 1\nd[x[-1] - x[0]] += 1\nd[n] += 1\nans = n * (n - 1) // 2 - max(d.values())\nprint(ans)", "n, m = map(int, input().split())\nx = list(map(int, input().split()))\n\nans = 0\nfor i in range(m - 1):\n if x[i] < x[i + 1]:\n ans += x[i + 1] - x[i] - 1\n else:\n ans += n - x[i + 1] + x[i] - 1\n\nprint(ans)", "n, m = map(int, input().split())\nx = list(map(int, input().split()))\n\nans = 0\nfor i in range(m - 1):\n if x[i] > x[i + 1]:\n ans += abs(x[i] - x[i + 1]) - 1\n else:\n ans += abs(x[i] - x[i + 1]) + 1\n\nprint(ans)", "from sys import stdin\n\ninput = stdin.readline\n(N, M) = map(int, input().split())\nX = list(map(int, input().split()))\n\nans = 0\nfor i in range(1, N):\n if X[0] - X[-1] > i:\n ans += 2 * i\n else:\n ans += X[0] - X[-1] + i\n\nfor i in range(M - 1):\n if X[i] - X[i + 1] > 1:\n ans += 2 * (X[i] - X[i + 1] - 1)\nprint(ans)", "n, m = map(int, input().split())\nx = list(map(int, input().split()))\n\nans = 0\nfor i in range(m - 1):\n ans += abs(x[i] - x[i + 1]) - 1\n\nprint(ans + min(abs(x[0] - x[-1]) - 1, abs(x[0] - x[-1]) + n - 1))", "n, m = map(int, input().split())\nx = list(map(int, input().split()))\n\nans = 0\nfor i in range(m - 1):\n if x[i] < x[i + 1]:\n ans += x[i + 1] - x[i] - 1\n else:\n ans += n - x[i] + x[i + 1] - 1\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nX = list(map(int, input().split()))\n\nans = 0\nfor i in range(M - 1):\n if X[i] > X[i + 1]:\n ans += X[i] - X[i + 1]\n else:\n ans += N - X[i + 1] + X[i]\n\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\nl = []\nfor i in range(n):\n a, b = map(int, input().split())\n l.append([a, b])\nl.sort()\nfor i in range(n):\n a, b = l[i]\n for j in range(i + 1, n):\n c, d = l[j]\n if a < c < b or a < d < b:\n print(\"Yes\")\n exit()\nprint(\"No\")", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\nAB = [list(map(int, input().split())) for i in range(N)]\n\nfor i in range(N):\n AB[i].sort()\n\nAB.sort()\n\nfor i in range(N - 1):\n if AB[i][1] < AB[i + 1][0]:\n print(\"Yes\")\n sys.exit(0)\n\nprint(\"No\")", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\nfor i in range(n):\n for j in range(i + 1, n):\n if (a[i][0] - a[i][1]) * (a[j][0] - a[j][1]) > 0:\n continue\n if (a[i][0] > a[j][0] and a[i][0] < a[j][1]) or (a[i][0] < a[j][0] and a[i][0] > a[j][1]):\n continue\n if (a[i][1] > a[j][0] and a[i][1] < a[j][1]) or (a[i][1] < a[j][0] and a[i][1] > a[j][1]):\n continue\n print(\"Yes\")\n exit()\nprint(\"No\")", "n = int(input())\n\na = []\nb = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append(x)\n b.append(y)\n\nfor i in range(n):\n for j in range(i + 1, n):\n if (a[i] - b[i]) * (b[j] - a[j]) < 0:\n print(\"Yes\")\n exit()\n if a[i] > b[i]:\n a[i], b[i] = b[i], a[i]\n\nprint(\"No\")", "n = int(input())\na = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append([x, y])\n\nfor i in range(n):\n for j in range(i + 1, n):\n x1, y1 = a[i]\n x2, y2 = a[j]\n if abs(x1 - x2) * abs(y1 - y2) < ((max(x1, x2) - min(x1, x2)) ** 2 + (max(y1, y2) - min(y1, y2)) ** 2) / 4:\n print(\"Yes\")\n exit()\nprint(\"No\")", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\n\nab = [list(map(int, input().split())) for i in range(n)]\n\nfor i in range(n):\n ab[i][0] -= 1\n ab[i][1] -= 1\n\nab.sort()\n\nfor i in range(n):\n a, b = ab[i]\n for j in range(i + 1, n):\n c, d = ab[j]\n if a < c < b or a < d < b:\n print(\"Yes\")\n exit()\n elif c < a < d or c < b < d:\n print(\"Yes\")\n exit()\n\nprint(\"No\")", "n = int(input())\nl = []\nfor i in range(n):\n a, b = map(int, input().split())\n l.append([a, b])\nl.sort()\nfor i in range(n):\n for j in range(i + 1, n):\n if l[i][0] < l[j][0] and l[i][1] > l[j][1]:\n print(\"Yes\")\n exit()\n elif l[i][0] > l[j][0] and l[i][1] < l[j][1]:\n print(\"Yes\")\n exit()\nprint(\"No\")", "def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n\ndef extgcd(a, b):\n if b == 0:\n return 1, 0\n else:\n x, y = extgcd(b, a % b)\n return y, x - a // b * y\n\n\ndef solve(n, ab):\n x = 0\n y = 0\n for a, b in ab:\n d = gcd(a - x, b - y)\n x = (a - x) // d\n y = (b - y) // d\n if x == 0 and y == 0:\n continue\n if a == x and b == y:\n return \"No\"\n return \"Yes\"\n return \"No\"\n\n\nn = int(input())\nab = [list(map(int, input().split())) for _ in range(n)]\nprint(solve(n, ab))", "n = int(input())\ns = [list(map(int, input().split())) for i in range(n)]\nfor i in range(n):\n if (s[i][0] + s[i][1]) % (2 * n) != 0:\n s[i][0] = (s[i][0] + s[i][1]) % (2 * n)\n else:\n s[i][0] = 2 * n\ns.sort(key=lambda x: x[0])\nfor i in range(n - 1):\n if s[i][1] > s[i + 1][0]:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n = int(input())\n\na = []\nb = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append(x)\n b.append(y)\n\nfor i in range(n):\n for j in range(i + 1, n):\n if (a[i] - b[i]) * (a[j] - b[j]) < 0:\n print(\"Yes\")\n exit()\n elif (a[i] - b[i]) * (a[j] - b[j]) == 0:\n if a[i] == a[j] or b[i] == b[j]:\n print(\"Yes\")\n exit()\nprint(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\ngraph = [[] for _ in range(N)]\nfor _ in range(M):\n u, v, w = list(map(int, input().split()))\n u, v = u - 1, v - 1\n graph[u].append((v, w))\n\nINF = float(\"inf\")\ndp = [[INF] * N for _ in range(1 << N)]\ndp[0][0] = 0\n\nfor st in range(1 << N):\n for v in range(N):\n if dp[st][v] == INF:\n continue\n for nv, w in graph[v]:\n if st >> nv & 1:\n dp[st | (1 << nv)][nv] = min(dp[st | (1 << nv)][nv], dp[st][v] + w)\n\nans = INF\nfor v in range(N):\n ans = min(ans, dp[(1 << N) - 1][v])\n\nif ans == INF:\n print(\"No\")\nelse:\n print(ans)", "from collections import defaultdict\nfrom heapq import heappush, heappop\n\nn, m = map(int, input().split())\ngraph = defaultdict(list)\nfor _ in range(m):\n u, v, w = map(int, input().split())\n graph[u].append((v, w))\n\ninf = float(\"inf\")\ndist = [inf] * (n + 1)\ndist[1] = 0\npq = [(0, 1)]\nwhile pq:\n c_dist, v = heappop(pq)\n if dist[v] < c_dist:\n continue\n for nv, nw in graph[v]:\n if dist[nv] > dist[v] + nw:\n dist[nv] = dist[v] + nw\n heappush(pq, (dist[nv], nv))\n\nans = sum(dist)\nif ans == inf:\n print(\"No\")\nelse:\n print(ans)", "from collections import defaultdict\n\nn, m = map(int, input().split())\n\ngraph = defaultdict(dict)\n\nfor _ in range(m):\n u, v, w = map(int, input().split())\n graph[u][v] = w\n\ninf = float(\"inf\")\ndp = [[inf] * n for _ in range(1 << n)]\n\ndp[0][0] = 0\n\nfor i in range(n):\n dp[1][i] = graph[0][i]\n\nfor s in range(1, 1 << n):\n for i in range(n):\n if dp[s][i] == inf:\n continue\n for j in range(n):\n if j == i or (s & 1 << j) != 0:\n continue\n dp[s | 1 << j][j] = min(dp[s | 1 << j][j], dp[s][i] + graph[i][j])\n\nans = inf\nfor i in range(n):\n ans = min(ans, dp[(1 << n) - 1][i])\n\nif ans == inf:\n print(\"No\")\nelse:\n print(ans)", "from collections import defaultdict\nfrom heapq import heappush, heappop\n\nN, M = map(int, input().split())\n\ngraph = defaultdict(dict)\n\nfor _ in range(M):\n U, V, W = map(int, input().split())\n graph[U][V] = W\n\ndist = [float(\"inf\")] * (N + 1)\ndist[1] = 0\n\npq = [(0, 1)]\n\nwhile pq:\n cost, node = heappop(pq)\n if node not in graph:\n print(cost)\n break\n for next_node, edge_cost in graph[node].items():\n if dist[next_node] > cost + edge_cost:\n dist[next_node] = cost + edge_cost\n heappush(pq, (dist[next_node], next_node))\nelse:\n print(\"No\")", "from collections import defaultdict\nfrom heapq import heappush, heappop\n\nn, m = map(int, input().split())\ngraph = defaultdict(list)\nfor _ in range(m):\n u, v, w = map(int, input().split())\n graph[u].append((v, w))\n\ninf = float(\"inf\")\ndist = [inf] * n\ndist[0] = 0\n\nq = [(0, 0)]\nwhile q:\n w, v = heappop(q)\n if dist[v] < w:\n continue\n for nv, nw in graph[v]:\n heappush(q, (w + nw, nv))\n dist[nv] = min(dist[nv], w + nw)\n\nif max(dist) == inf:\n print(\"No\")\nelse:\n print(sum(dist) - n)", "from collections import defaultdict\nimport sys\n\ninput = sys.stdin.readline\n\nn, m = list(map(int, input().split()))\n\ngraph = defaultdict(dict)\nfor _ in range(m):\n u, v, w = list(map(int, input().split()))\n graph[u][v] = w\n\ninf = 10**18\ndp = [[inf] * n for _ in range(1 << n)]\ndp[0][0] = 0\n\nfor i in range(n):\n dp[1][i] = graph[0][i]\n\nfor s in range(1, 1 << n):\n for i in range(n):\n if dp[s][i] == inf:\n continue\n for j in range(n):\n if s >> j & 1:\n continue\n dp[s | 1 << j][j] = min(dp[s | 1 << j][j], dp[s][i] + graph[i][j])\n\nans = inf\nfor i in range(n):\n ans = min(ans, dp[-1][i])\n\nif ans == inf:\n print(\"No\")\nelse:\n print(ans)", "from collections import defaultdict\n\nn, m = map(int, input().split())\nedges = defaultdict(list)\nfor _ in range(m):\n u, v, w = map(int, input().split())\n edges[u].append((v, w))\n\ninf = float(\"inf\")\ndp = [[inf] * n for _ in range(1 << n)]\ndp[0][0] = 0\nfor mask in range(1 << n):\n for i in range(n):\n if mask >> i & 1:\n for j, w in edges[i + 1]:\n dp[mask | 1 << j][j] = min(dp[mask | 1 << j][j], dp[mask][i] + w)\n\nans = inf\nfor i in range(n):\n ans = min(ans, dp[(1 << n) - 1][i])\nprint(ans if ans < inf else \"No\")", "from collections import defaultdict\n\nn, m = map(int, input().split())\nuvw = [list(map(int, input().split())) for _ in range(m)]\n\ngraph = defaultdict(list)\nfor u, v, w in uvw:\n graph[u].append((v, w))\n\ninf = float(\"inf\")\ndp = [[inf] * n for _ in range(1 << n)]\ndp[0][0] = 0\n\nfor i in range(1 << n):\n for j in range(n):\n if dp[i][j] == inf:\n continue\n for k, w in graph[j + 1]:\n if i >> k & 1:\n continue\n dp[i | 1 << k][k] = min(dp[i | 1 << k][k], dp[i][j] + w)\n\nans = inf\nfor i in range(1 << n):\n for j in range(n):\n ans = min(ans, dp[i][j])\n\nif ans == inf:\n print(\"No\")\nelse:\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\ngraph = [[] for i in range(N)]\nfor i in range(M):\n U, V, W = list(map(int, input().split()))\n U -= 1\n V -= 1\n graph[U].append((V, W))\n\nINF = 10**9\ndp = [[INF] * N for i in range(1 << N)]\n\ndp[0][0] = 0\n\nfor S in range(1 << N):\n for i in range(N):\n if S >> i & 1:\n for j, w in graph[i]:\n dp[S | 1 << j][j] = min(dp[S | 1 << j][j], dp[S][i] + w)\n\nans = INF\nfor i in range(N):\n ans = min(ans, dp[(1 << N) - 1][i])\n\nif ans == INF:\n print(\"No\")\nelse:\n print(ans)", "from collections import defaultdict\nimport sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\ngraph = defaultdict(dict)\n\nfor _ in range(M):\n u, v, w = list(map(int, input().split()))\n graph[u][v] = w\n\ndp = [[float(\"inf\")] * N for _ in range(1 << N)]\ndp[0][0] = 0\n\nfor S in range(1 << N):\n for u in range(N):\n if S >> u & 1:\n for v in graph[u + 1]:\n dp[S | (1 << v)][v] = min(dp[S | (1 << v)][v], dp[S][u] + graph[u + 1][v])\n\nans = float(\"inf\")\nfor u in range(N):\n ans = min(ans, dp[(1 << N) - 1][u])\n\nif ans == float(\"inf\"):\n print(\"No\")\nelse:\n print(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s = input()\nprint(s.split(\".\")[-1])", "s = input()\nprint(s.rpartition(\".\")[2])", "s = input()\nprint(s.rpartition(\".\")[2])", "s = input()\nprint(s.split(\".\")[-1])", "s = input()\nprint(s.split(\".\")[-1])", "s = input()\nprint(s.rpartition(\".\")[2])", "s = input()\nprint(s.split(\".\")[-1])", "s = input()\nprint(s.split(\".\")[-1])", "s = input()\nprint(s.split(\".\")[-1])", "s = input()\nprint(s.split(\".\")[-1])" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "(h, w, n) = map(int, input().split())\nx = 0\ny = 0\nd = 0\ngrid = [[\".\"] * w for _ in range(h)]\ngrid[0][0] = \"#\"\nfor _ in range(n):\n if grid[y][x] == \".\":\n grid[y][x] = \"#\"\n if d == 0:\n d = 3\n y += 1\n elif d == 1:\n d = 0\n x += 1\n elif d == 2:\n d = 1\n y -= 1\n else:\n d = 3\n x -= 1\n else:\n grid[y][x] = \".\"\n if d == 0:\n d = 1\n y -= 1\n elif d == 1:\n d = 2\n x -= 1\n elif d == 2:\n d = 3\n y += 1\n else:\n d = 0\n x += 1\n y = y % h\n x = x % w\nfor i in range(h):\n print(\"\".join(grid[i]))", "(h, w, n) = map(int, input().split())\ngrid = [[\".\"] * w for _ in range(h)]\ngrid[0][0] = \"#\"\nx = y = 0\ndx = -1\ndy = 0\nfor _ in range(n):\n nx = x + dx\n ny = y + dy\n grid[ny][nx] = \"#\" if grid[ny][nx] == \".\" else \".\"\n x = nx\n y = ny\n if grid[y][x] == \".\":\n dx, dy = dy, -dx\n else:\n dx, dy = -dy, dx\nfor row in grid:\n print(\"\".join(row))", "(h, w, n) = map(int, input().split())\nx = 0\ny = 0\nd = 0\ngrid = [[\".\"] * w for _ in range(h)]\ngrid[0][0] = \"#\"\nfor _ in range(n):\n if grid[y][x] == \".\":\n grid[y][x] = \"#\"\n if d == 0:\n d = 3\n y += 1\n elif d == 1:\n d = 0\n x += 1\n elif d == 2:\n d = 1\n y -= 1\n else:\n d = 3\n x -= 1\n else:\n grid[y][x] = \".\"\n if d == 0:\n d = 1\n y -= 1\n elif d == 1:\n d = 2\n x -= 1\n elif d == 2:\n d = 3\n y += 1\n else:\n d = 0\n x += 1\nfor i in range(h):\n for j in range(w):\n if j == w - 1:\n print(grid[i][j], end=\"\\n\")\n else:\n print(grid[i][j], end=\"\")", "(h, w, n) = map(int, input().split())\ngrid = [[\".\"] * w for _ in range(h)]\nx = y = 0\nd = 0\nfor _ in range(n):\n if grid[x][y] == \".\":\n grid[x][y] = \"#\"\n else:\n grid[x][y] = \".\"\n if d == 0:\n x -= 1\n elif d == 1:\n y += 1\n elif d == 2:\n x += 1\n else:\n y -= 1\n d = (d + 1) % 4\n if x < 0:\n x = h - 1\n elif x == h:\n x = 0\n if y < 0:\n y = w - 1\n elif y == w:\n y = 0\nfor row in grid:\n print(\"\".join(row))", "(h, w, n) = map(int, input().split())\ngrid = [[0] * w for _ in range(h)]\n(x, y, d) = (0, 0, 0)\nfor _ in range(n):\n grid[x][y] = 1 - grid[x][y]\n if d == 0:\n x -= 1\n d = 3\n elif d == 1:\n y += 1\n d = 0\n elif d == 2:\n x += 1\n d = 1\n else:\n y -= 1\n d = 2\n if x < 0:\n x = h - 1\n elif x == h:\n x = 0\n if y < 0:\n y = w - 1\n elif y == w:\n y = 0\nfor row in grid:\n print(\"\".join([\"#\" if cell else \".\" for cell in row]))", "(h, w, n) = map(int, input().split())\nx = 0\ny = 0\nd = 0\ngrid = [[\".\"] * w for _ in range(h)]\ngrid[0][0] = \"#\"\nfor _ in range(n):\n if grid[y][x] == \".\":\n grid[y][x] = \"#\"\n if d == 0:\n d = 3\n y += 1\n elif d == 1:\n d = 0\n x += 1\n elif d == 2:\n d = 1\n y -= 1\n else:\n d = 3\n x -= 1\n else:\n grid[y][x] = \".\"\n if d == 0:\n d = 1\n y += 1\n elif d == 1:\n d = 2\n x += 1\n elif d == 2:\n d = 3\n y -= 1\n else:\n d = 0\n x -= 1\n y %= h\n x %= w\nfor row in grid:\n print(\"\".join(row))", "(h, w, n) = map(int, input().split())\nx = 0\ny = 0\nd = 0\ngrid = [[\".\"] * w for _ in range(h)]\ngrid[0][0] = \"#\"\nfor _ in range(n):\n if grid[y][x] == \".\":\n grid[y][x] = \"#\"\n if d == 0:\n d = 3\n y += 1\n elif d == 1:\n d = 0\n x += 1\n elif d == 2:\n d = 1\n y -= 1\n else:\n d = 3\n x -= 1\n else:\n grid[y][x] = \".\"\n if d == 0:\n d = 1\n y -= 1\n elif d == 1:\n d = 2\n x -= 1\n elif d == 2:\n d = 3\n y += 1\n else:\n d = 0\n x += 1\n y %= h\n x %= w\nfor row in grid:\n print(\"\".join(row))", "(h, w, n) = map(int, input().split())\nx = y = 0\nd = 0\ngrid = [[\".\"] * w for _ in range(h)]\ngrid[y][x] = \"#\"\nfor _ in range(n):\n if grid[y][x] == \".\":\n grid[y][x] = \"#\"\n if d == 0:\n d = 3\n else:\n d -= 1\n if d == 0:\n y += 1\n elif d == 1:\n x += 1\n elif d == 2:\n y -= 1\n else:\n x -= 1\n else:\n grid[y][x] = \".\"\n d += 1\n if d > 3:\n d = 0\n if d == 0:\n y += 1\n elif d == 1:\n x += 1\n elif d == 2:\n y -= 1\n else:\n x -= 1\n if x < 0:\n x = w - 1\n elif x == w:\n x = 0\n if y < 0:\n y = h - 1\n elif y == h:\n y = 0\nfor row in grid:\n print(\"\".join(row))", "(h, w, n) = map(int, input().split())\nx = 0\ny = 0\nd = 0\ngrid = [[\".\"] * w for _ in range(h)]\ngrid[0][0] = \"#\"\nfor _ in range(n):\n if grid[y][x] == \".\":\n grid[y][x] = \"#\"\n if d == 0:\n d = 3\n y += 1\n elif d == 1:\n d = 0\n x += 1\n elif d == 2:\n d = 1\n y -= 1\n else:\n d = 3\n x -= 1\n else:\n grid[y][x] = \".\"\n if d == 0:\n d = 1\n y -= 1\n elif d == 1:\n d = 2\n x -= 1\n elif d == 2:\n d = 3\n y += 1\n else:\n d = 0\n x += 1\n y %= h\n x %= w\nfor row in grid:\n print(\"\".join(row))", "(h, w, n) = map(int, input().split())\nx = 0\ny = 0\nd = 0\ngrid = [[\".\"] * w for _ in range(h)]\ngrid[0][0] = \"#\"\nfor _ in range(n):\n if grid[y][x] == \".\":\n grid[y][x] = \"#\"\n if d == 0:\n d = 3\n y += 1\n elif d == 1:\n d = 0\n x += 1\n elif d == 2:\n d = 1\n y -= 1\n else:\n d = 3\n x -= 1\n else:\n grid[y][x] = \".\"\n if d == 0:\n d = 2\n y -= 1\n elif d == 1:\n d = 3\n x -= 1\n elif d == 2:\n d = 0\n x += 1\n else:\n d = 1\n y += 1\n y %= h\n x %= w\nfor row in grid:\n print(\"\".join(row))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in a:\n ans += i\n ans = max(ans, 0)\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in a:\n ans += i\n ans = max(ans, 0)\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in a:\n ans += i\n ans = max(ans, 0)\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in a:\n ans += i\n ans = max(ans, 0)\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in a:\n ans += i\n ans = max(ans, 0)\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in a:\n ans += i\n ans = max(ans, 0)\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in a:\n ans += i\n ans = max(ans, 0)\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in a:\n ans += i\n ans = max(ans, 0)\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in a:\n ans += i\n ans = max(ans, 0)\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in a:\n ans += i\n ans = max(ans, 0)\nprint(ans)" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\ns = [input() for i in range(n)]\r\np = [(i, j) for i in range(n) for j in range(n) if s[i][j] == \"P\"]\r\n\r\n\r\ndef bfs():\r\n q = [(0, p[0], p[1])]\r\n d = {(0, p[0], p[1]) : 0}\r\n while q:\r\n dq, x, y = q.pop(0)\r\n for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\r\n nx, ny = x + dx, y + dy\r\n if 0 <= nx < n and 0 <= ny < n and s[nx][ny] == \".\":\r\n if (dq + 1, nx, ny) not in d:\r\n d[(dq + 1, nx, ny)] = dq + 1\r\n q.append((dq + 1, nx, ny))\r\n return d.get((d[q[0]], p[1], p[0]))\r\n\r\nprint(-1 if bfs() is None else bfs())\r", "n = int(input())\r\ngrid = [input() for _ in range(n)]\r\n\r\np1, p2 = None, None\r\nfor i in range(n):\r\n for j in range(n):\r\n if grid[i][j] == \"P\":\r\n if p1 is None:\r\n p1 = (i, j)\r\n else:\r\n p2 = (i, j)\r\n\r\ndist = [[float(\"inf\")] * n for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if grid[i][j] == \".\":\r\n dist[i][j] = 0\r\n\r\ndx = [0, 0, 1, -1]\r\ndy = [1, -1, 0, 0]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if grid[i][j] == \".\":\r\n for k in range(4):\r\n nx, ny = i + dx[k], j + dy[k]\r\n if 0 <= nx < n and 0 <= ny < n:\r\n dist[i][j] = max(dist[i][j], dist[nx][ny] + 1)\r\n\r\nans = dist[p1[0]][p1[1]] + dist[p2[0]][p2[1]]\r\nif ans == float(\"inf\"):\r\n ans = -1\r\nprint(ans)\r", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nS = [input() for _ in range(N)]\n\nP = []\nfor i in range(N):\n for j in range(N):\n if S[i][j] == \"P\":\n P.append((i, j))\n\ndx = [0, 0, -1, 1]\ndy = [-1, 1, 0, 0]\n\nans = float(\"inf\")\nfor i in range(4):\n nx = P[0][0] + dx[i]\n ny = P[0][1] + dy[i]\n if 0 <= nx < N and 0 <= ny < N and S[nx][ny] == \".\":\n P[0] = (nx, ny)\n for j in range(4):\n nx = P[1][0] + dx[j]\n ny = P[1][1] + dy[j]\n if 0 <= nx < N and 0 <= ny < N and S[nx][ny] == \".\":\n P[1] = (nx, ny)\n if P[0] == P[1]:\n ans = min(ans, abs(dx[i] + dx[j]) + abs(dy[i] + dy[j]))\n P[1] = (P[1][0], P[1][1])\n P[0] = (P[0][0], P[0][1])\n\nif ans == float(\"inf\"):\n ans = -1\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\ngrid = [input().rstrip() for _ in range(N)]\n\nstart1 = [-1, -1]\nstart2 = [-1, -1]\nfor i in range(N):\n for j in range(N):\n if grid[i][j] == \"P\":\n if start1 == [-1, -1]:\n start1 = [i, j]\n else:\n start2 = [i, j]\n\ndx = [0, 0, 1, -1]\ndy = [1, -1, 0, 0]\n\ndist = [[float(\"inf\") for _ in range(N)] for _ in range(N)]\nfor i in range(N):\n for j in range(N):\n if grid[i][j] == \"#\":\n dist[i][j] = -2\n\nq = [(start1[0], start1[1])]\ndist[start1[0]][start1[1]] = 0\nwhile q:\n y, x = q.pop(0)\n for k in range(4):\n ny = y + dy[k]\n nx = x + dx[k]\n if 0 <= ny < N and 0 <= nx < N:\n if dist[ny][nx] == float(\"inf\"):\n dist[ny][nx] = dist[y][x] + 1\n q.append((ny, nx))\n\nans = dist[start2[0]][start2[1]]\nif ans == float(\"inf\"):\n ans = -1\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\ngrid = [input().rstrip() for _ in range(N)]\n\nstart1 = [i for i in range(N) for j in range(N) if grid[i][j] == \"P\"][0]\nstart2 = [i for i in range(N) for j in range(N) if grid[i][j] == \"P\"][1]\n\ndist = [[0] * N for _ in range(N)]\nfor i in range(N):\n for j in range(N):\n if grid[i][j] == \"#\":\n dist[i][j] = -1\n\nq = [(start1 // N, start1 % N)]\ndist[start1 // N][start1 % N] = 0\nwhile q:\n y, x = q.pop(0)\n for dy, dx in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n ny, nx = y + dy, x + dx\n if 0 <= ny < N and 0 <= nx < N:\n if dist[ny][nx] == -1:\n continue\n if dist[ny][nx] == -2:\n print(dist[y][x] + 1)\n exit()\n dist[ny][nx] = max(dist[ny][nx], dist[y][x] + 1)\n q.append((ny, nx))\n\nprint(-1)", "n = int(input())\r\ngrid = [input() for _ in range(n)]\r\n\r\nplayer_positions = []\r\nfor i in range(n):\r\n for j in range(n):\r\n if grid[i][j] == \"P\":\r\n player_positions.append((i, j))\r\n\r\ndef get_moves(start, end):\r\n moves = 0\r\n x1, y1 = start\r\n x2, y2 = end\r\n if x1 < x2:\r\n for i in range(x1, x2):\r\n if grid[i][y1] != \".\":\r\n return -1\r\n moves += x2 - x1\r\n elif x1 > x2:\r\n for i in range(x2, x1):\r\n if grid[i][y1] != \".\":\r\n return -1\r\n moves += x1 - x2\r\n if y1 < y2:\r\n for i in range(y1, y2):\r\n if grid[x1][i] != \".\":\r\n return -1\r\n moves += y2 - y1\r\n elif y1 > y2:\r\n for i in range(y2, y1):\r\n if grid[x1][i] != \".\":\r\n return -1\r\n moves += y1 - y2\r\n return moves\r\n\r\ndef get_min_moves(start, end):\r\n return min(\r\n get_moves(start, end),\r\n get_moves(end, start),\r\n get_moves((n - 1 - start[0], start[1]), end),\r\n get_moves(end, (n - 1 - start[0], start[1])),\r\n get_moves(start, (n - 1 - end[0], end[1])),\r\n get_moves((n - 1 - end[0], end[1]), start),\r\n get_moves((n - 1 - start[0], start[1]), (n - 1 - end[0], end[1])),\r\n get_moves((n - 1 - end[0], end[1]), (n - 1 - start[0], start[1])),\r\n )\r\n\r\nprint(get_min_moves(player_positions[0], player_positions[1]))\r", "n = int(input())\r\ngrid = [input() for _ in range(n)]\r\n\r\nplayers = [(i, j) for i, row in enumerate(grid) for j, c in enumerate(row) if c == \"P\"]\r\n\r\nif len(players) != 2:\r\n raise ValueError(\"Exactly two players should be on the grid.\")\r\n\r\nplayer1, player2 = players\r\n\r\n\r\ndef get_empty_neighbors(i, j):\r\n neighbors = []\r\n if i > 0 and grid[i - 1][j] == \".\":\r\n neighbors.append((i - 1, j))\r\n if i < n - 1 and grid[i + 1][j] == \".\":\r\n neighbors.append((i + 1, j))\r\n if j > 0 and grid[i][j - 1] == \".\":\r\n neighbors.append((i, j - 1))\r\n if j < n - 1 and grid[i][j + 1] == \".\":\r\n neighbors.append((i, j + 1))\r\n return neighbors\r\n\r\n\r\ndef get_distance(player1, player2):\r\n dist = 0\r\n while player1 != player2:\r\n if player1[0] < player2[0]:\r\n player1 = (player1[0] + 1, player1[1])\r\n elif player1[0] > player2[0]:\r\n player1 = (player1[0] - 1, player1[1])\r\n if player1[1] < player2[1]:\r\n player1 = (player1[0], player1[1] + 1)\r\n elif player1[1] > player2[1]:\r\n player1 = (player1[0], player1[1] - 1)\r\n dist += 1\r\n return dist\r\n\r\n\r\ndef get_min_distance():\r\n min_dist = float(\"inf\")\r\n for i, j in get_empty_neighbors(*player1):\r\n for x, y in get_empty_neighbors(i, j):\r\n min_dist = min(min_dist, get_distance((i, j), (x, y)))\r\n return min_dist\r\n\r\n\r\nprint(get_min_distance())\r", "from collections import deque\n\nN = int(input())\ngrid = [input() for _ in range(N)]\n\nplayer_positions = []\nfor i in range(N):\n for j in range(N):\n if grid[i][j] == \"P\":\n player_positions.append((i, j))\n\nstart_x, start_y = player_positions[0]\nend_x, end_y = player_positions[1]\n\ndirections = [(0, 1), (0, -1), (1, 0), (-1, 0)]\n\nvisited = [[False] * N for _ in range(N)]\nqueue = deque([(start_x, start_y, 0)])\nvisited[start_x][start_y] = True\n\nwhile queue:\n x, y, distance = queue.popleft()\n if x == end_x and y == end_y:\n print(distance)\n exit()\n\n for dx, dy in directions:\n new_x, new_y = x + dx, y + dy\n if 0 <= new_x < N and 0 <= new_y < N and grid[new_x][new_y] == \".\":\n if not visited[new_x][new_y]:\n visited[new_x][new_y] = True\n queue.append((new_x, new_y, distance + 1))\n\nprint(-1)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\ngrid = [input().rstrip() for _ in range(N)]\n\nstart1 = [-1, -1]\nstart2 = [-1, -1]\n\nfor i in range(N):\n for j in range(N):\n if grid[i][j] == \"P\":\n if start1 == [-1, -1]:\n start1 = [i, j]\n else:\n start2 = [i, j]\n\ndx = [0, 0, 1, -1]\ndy = [1, -1, 0, 0]\n\n\ndef bfs(start1, start2):\n q = [(start1[0], start1[1], 0)]\n visited = [[False] * N for _ in range(N)]\n visited[start1[0]][start1[1]] = True\n while q:\n x, y, d = q.pop(0)\n for i in range(4):\n nx = x + dx[i]\n ny = y + dy[i]\n if 0 <= nx < N and 0 <= ny < N:\n if grid[nx][ny] == \".\":\n if [nx, ny] == [start2[0], start2[1]]:\n return d + 1\n if not visited[nx][ny]:\n visited[nx][ny] = True\n q.append((nx, ny, d + 1))\n\n\nans = 10**9\nfor i in range(N):\n for j in range(N):\n if grid[i][j] == \".\":\n temp = bfs([i, j], start1)\n if temp != None:\n ans = min(ans, temp)\n temp = bfs([i, j], start2)\n if temp != None:\n ans = min(ans, temp)\n\nif ans == 10**9:\n print(-1)\nelse:\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nS = [input().rstrip() for _ in range(N)]\n\nP = []\nfor i in range(N):\n for j in range(N):\n if S[i][j] == \"P\":\n P.append((i, j))\n\ndx = [0, 0, 1, -1]\ndy = [1, -1, 0, 0]\n\nans = 10**9\nfor i in range(4):\n nx = P[0][0] + dx[i]\n ny = P[0][1] + dy[i]\n if 0 <= nx < N and 0 <= ny < N and S[nx][ny] == \".\":\n for j in range(4):\n n2x = P[1][0] + dx[j]\n n2y = P[1][1] + dy[j]\n if 0 <= n2x < N and 0 <= n2y < N and S[n2x][n2y] == \".\":\n ans = min(ans, abs(nx - n2x) + abs(ny - n2y))\n\nif ans == 10**9:\n ans = -1\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "a, b, d = map(int, input().split())\r\nfor i in range(a, b + 1, d):\r\n print(i, end=\" \")\r", "a, b, d = map(int, input().split())\r\nfor i in range(a, b + 1, d):\r\n print(i, end=\" \")\r", "a, b, d = map(int, input().split())\r\nfor i in range(a, b + 1, d):\r\n print(i, end=\" \")\r", "a, b, d = map(int, input().split())\r\n\r\nfor i in range(a, b + 1, d):\r\n print(i, end=\" \")\r", "a, b, d = map(int, input().split())\r\nfor i in range(a, b + 1, d):\r\n print(i, end=\" \")\r", "a, b, d = map(int, input().split())\r\n\r\nfor i in range(a, b + 1, d):\r\n print(i, end=\" \")\r", "a, b, d = map(int, input().split())\r\n\r\nfor i in range(a, b + 1, d):\r\n print(i, end=\" \")\r", "a, b, d = map(int, input().split())\r\nfor i in range(a, b + 1, d):\r\n print(i, end=\" \")\r", "a, b, d = map(int, input().split())\r\n\r\nfor i in range(a, b + 1, d):\r\n print(i, end=\" \")\r", "a, b, d = map(int, input().split())\r\n\r\nfor i in range(a, b + 1, d):\r\n print(i, end=\" \")\r" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = []\nfor i in range(n):\n s = input().split()\n if s[0] == \"1\":\n a.append(int(s[1]))\n else:\n print(a[-int(s[1])])", "n = int(input())\na = []\nfor i in range(n):\n s = input().split()\n if s[0] == \"1\":\n a.append(int(s[1]))\n else:\n print(a[-int(s[1])])", "n = int(input())\nl = []\nfor i in range(n):\n s = input().split()\n if s[0] == \"1\":\n l.append(int(s[1]))\n else:\n print(l[-int(s[1])])", "n = int(input())\na = []\nfor i in range(n):\n s = input().split()\n if s[0] == \"1\":\n a.append(int(s[1]))\n else:\n print(a[-int(s[1])])", "n = int(input())\nA = []\nfor i in range(n):\n s = input().split()\n if s[0] == \"1\":\n A.append(int(s[1]))\n else:\n print(A[-int(s[1])])", "n = int(input())\nA = []\nfor i in range(n):\n s = input().split()\n if s[0] == \"1\":\n A.append(int(s[1]))\n else:\n print(A[-int(s[1])])", "n = int(input())\na = []\nfor i in range(n):\n s = input().split()\n if s[0] == \"1\":\n a.append(int(s[1]))\n else:\n print(a[-int(s[1])])", "n = int(input())\na = []\nfor i in range(n):\n s = input().split()\n if s[0] == \"1\":\n a.append(int(s[1]))\n else:\n print(a[-int(s[1])])", "n = int(input())\nl = []\nfor i in range(n):\n s = input().split()\n if s[0] == \"1\":\n l.append(int(s[1]))\n else:\n print(l[-int(s[1])])", "n = int(input())\r\nA = []\r\nfor i in range(n):\r\n s = input().split()\r\n if s[0] == \"1\":\r\n A.append(int(s[1]))\r\n else:\r\n print(A[-int(s[1])])\r" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\nans = 0\nwhile n > 1:\n ans += n\n n = (n + 1) // 2\nprint(ans)", "n = int(input())\nans = 0\nwhile n > 1:\n ans += n\n n = (n + 1) // 2\nprint(ans)", "n = int(input())\nans = 0\nwhile n > 1:\n ans += n\n n = (n + 1) // 2\nprint(ans)", "n = int(input())\nans = 0\nwhile n > 1:\n ans += n\n n = (n + 1) // 2\nprint(ans)", "n = int(input())\nans = 0\nwhile n > 1:\n ans += n\n n = (n + 1) // 2\nprint(ans)", "n = int(input())\nans = 0\nwhile n > 1:\n ans += n\n n = (n + 1) // 2\nprint(ans)", "n = int(input())\nans = 0\nwhile n > 1:\n ans += n\n n = n // 2 + n % 2\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nans = 0\nwhile n > 1:\n ans += n\n n = (n + 1) // 2\nprint(ans)", "n = int(input())\nans = 0\nwhile n > 1:\n ans += n\n n = n // 2 + n % 2\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nans = 0\nwhile n > 1:\n ans += n\n n = n // 2 + n % 2\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ndp = [0] * (n + 1)\nfor i in range(n - 1):\n a, b, x = map(int, input().split())\n dp[x] = min(dp[i + 1] + b, dp[x])\n dp[i + 1] = min(dp[i + 1], dp[i] + a)\nprint(dp[n])", "from heapq import heappop, heappush\n\nN = int(input())\nABX = [list(map(int, input().split())) for _ in range(N - 1)]\n\nINF = float(\"inf\")\ndp = [INF] * (N + 1)\ndp[1] = 0\n\nfor A, B, X in ABX:\n dp[X] = min(dp[X], dp[1] + B)\n\nfor A, B, X in ABX:\n dp[X + 1] = min(dp[X + 1], dp[1] + A)\n\nfor i in range(2, N):\n for A, B, X in ABX:\n if i < X:\n dp[X] = min(dp[X], dp[i] + B)\n if i + 1 < X:\n dp[X + 1] = min(dp[X + 1], dp[i] + A)\n\nprint(dp[N])", "n = int(input())\ndp = [0] * (n + 1)\nfor i in range(n - 1):\n a, b, x = map(int, input().split())\n dp[x] = min(dp[x], dp[i + 1] + b)\n dp[i + 1] = min(dp[i + 1], dp[i] + a)\nprint(dp[n])", "n = int(input())\ndp = [0] * (n + 1)\nfor i in range(n - 1):\n a, b, x = map(int, input().split())\n dp[x] = min(dp[x], dp[i + 1] + b)\n dp[i + 1] = min(dp[i + 1], dp[i] + a)\nprint(dp[n])", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\ndata = [tuple(map(int, input().split())) for _ in range(N - 1)]\n\ndp = [0] * (N + 1)\n\nfor A, B, X in data:\n dp[X] = min(dp[X], dp[X - 1] + B)\n dp[X - 1] = min(dp[X - 1], dp[X - 2] + A)\n\nprint(dp[N - 1])", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\nABX = [list(map(int, input().split())) for i in range(N - 1)]\n\nINF = 10**18\n\ndp = [INF] * (N + 1)\ndp[1] = 0\n\nfor A, B, X in ABX:\n dp[X] = min(dp[X], B)\n\nfor A, B, X in ABX:\n dp[X] = min(dp[X], dp[X - 1] + A)\n\nprint(dp[N])", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\ndata = [list(map(int, input().split())) for i in range(N - 1)]\n\ndp = [0] * (N + 1)\n\nfor i in range(N - 1):\n A, B, X = data[i]\n dp[X] = min(dp[i + 1] + B, dp[X])\n dp[i + 2] = min(dp[i + 1] + A, dp[i + 2])\n\nprint(dp[N])", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\nABX = [list(map(int, input().split())) for i in range(N - 1)]\n\nINF = 10**10\n\ndp = [INF] * (N + 1)\ndp[1] = 0\n\nfor A, B, X in ABX:\n dp[X] = min(dp[X], B)\n\nfor A, B, X in ABX:\n dp[X + 1] = min(dp[X + 1], dp[X] + A, dp[1] + A)\n\nprint(dp[N])", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\nABX = [list(map(int, input().split())) for i in range(N - 1)]\n\nINF = float(\"inf\")\n\ndp = [INF] * N\ndp[0] = 0\n\nfor A, B, X in ABX:\n dp[X - 1] = min(dp[X - 1], B)\n dp[1] = min(dp[1], A)\n for i in range(N - 2, -1, -1):\n dp[i + 1] = min(dp[i + 1], dp[i] + A)\n dp[X - 1] = min(dp[X - 1], dp[i] + B)\n\nprint(dp[N - 1])", "n = int(input())\ndp = [float(\"inf\")] * (n + 1)\ndp[1] = 0\nfor i in range(n - 1):\n a, b, x = map(int, input().split())\n dp[i + 1] = min(dp[i + 1], dp[i] + a)\n dp[x] = min(dp[x], dp[i] + b)\nprint(dp[n])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nfor i in range(m):\n a[b[i]] -= 1\n for j in range(1, n):\n a[(b[i] + j) % n] += 1\n if a[b[i]] == 0:\n break\n\nprint(*a)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = [0] * n\nfor i in range(m):\n x = b[i]\n y = a[x]\n a[x] = 0\n while y > 0:\n c[x] += y\n x = (x + 1) % n\n y -= 1\nfor i in range(n):\n a[i] += c[i]\nprint(*a)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nfor i in range(m):\n a[b[i]] -= 1\n j = b[i]\n while a[j] < 0:\n a[j] += n\n j += 1\n a[j] -= 1\n\nprint(\" \".join(map(str, a)))", "def main():\n (n, m) = map(int, input().split())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n c = [0] * n\n for i in range(m):\n x = a[b[i]]\n a[b[i]] = 0\n j = b[i]\n while x:\n c[j] += 1\n j = (j + 1) % n\n x -= 1\n for i in range(n):\n a[i] += c[i]\n print(*a)\n\n\nmain()", "def main():\n (n, m) = map(int, input().split())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n c = [0] * n\n for i in b:\n c[i] += 1\n for i in range(n):\n if c[i] > 0:\n a[i] += a[i - 1] - a[i] * c[i]\n a[i] %= 10**9 + 7\n print(*a)\n\n\nmain()", "from collections import deque\n\nN, M = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\nbox = [0] * N\nfor a in A:\n box[0] += a\n\nfor b in B:\n c = 0\n while box[b]:\n c += 1\n box[b] -= 1\n box[(b + c) % N] += 1\n\nprint(*box)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = [0] * n\nfor i in range(m):\n x = b[i]\n y = a[x]\n a[x] = 0\n while y > 0:\n c[x] += y\n x = (x + 1) % n\n y -= 1\nfor i in range(n):\n a[i] += c[i]\nprint(*a)", "from collections import defaultdict\n\n(n, m) = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nd = defaultdict(int)\nfor i in range(m):\n x = b[i]\n c = 0\n while a[x] > 0:\n d[x + c] += 1\n a[x] -= 1\n c += 1\nfor i in range(n):\n a[i] += d[i]\nprint(*a)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = [0] * n\nfor i in b:\n c[i] += 1\nfor i in range(n):\n a[i] -= c[i]\nfor i in range(n):\n s = 0\n for j in range(n):\n if c[j] > 0:\n s += a[j]\n a[j] = 0\n c[j] -= 1\n if c[j] == 0:\n a[(j + 1) % n] += s\n break\nprint(*a)", "import sys\n\ninput = sys.stdin.readline\n(N, M) = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = [0] * N\nfor b in B:\n x = A[b]\n A[b] = 0\n while x:\n C[(b + C[b]) % N] += 1\n C[b] += 1\n x -= 1\nfor i in range(N):\n A[i] += C[i]\nprint(*A)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\nprint(\"\".join([\"10\" for i in range(n)]), end=\"1\")", "n = int(input())\r\nprint(\"\".join([\"10\" for i in range(n)]), end=\"1\")", "n = int(input())\r\nprint(\"\".join([\"10\" for i in range(n)]), end=\"1\")", "n = int(input())\ns = \"1\"\nfor i in range(n):\n s += \"01\"\nprint(s)", "n = int(input())\r\nprint(1, end=\"\")\r\nfor i in range(n):\r\n print(0, 1, end=\"\")\r", "n = int(input())\nprint(\"\".join([\"10\" for i in range(n)] + [\"1\"]))", "n = int(input())\r\nprint(\"\".join([\"10\" for i in range(n)]), end=\"1\")", "n = int(input())\r\n\r\ns = \"1\"\r\nfor i in range(n):\r\n s += \"01\"\r\nprint(s)", "n = int(input())\r\ns = \"1\"\r\nfor i in range(n):\r\n s += \"01\"\r\nprint(s)", "n = int(input())\r\nprint(\"\".join([\"10\" for i in range(n)] + [\"1\"]))" ], "pass1_list": [ true, true, true, true, false, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nA = list(map(int, input().split()))\nST = [list(map(int, input().split())) for i in range(N - 1)]\nST.sort(key=lambda x: x[1] / x[0], reverse=True)\n\nfor s, t in ST:\n if A[0] >= s:\n A[0] = t\n A[1] += A[0] - s\n\nprint(A[-1])", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nA = list(map(int, input().split()))\nST = [list(map(int, input().split())) for i in range(N - 1)]\ndp = [0] * N\ndp[0] = A[0]\nfor i in range(N - 1):\n s, t = ST[i]\n if dp[i] >= s:\n dp[i + 1] = max(dp[i + 1], dp[i] // s * t + A[i + 1])\nprint(dp[-1])", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nA = list(map(int, input().split()))\nS = [0]\nT = [0]\nfor i in range(N - 1):\n s, t = list(map(int, input().split()))\n S.append(s)\n T.append(t)\n\ndp = [0] * N\ndp[0] = A[0]\nfor i in range(1, N):\n dp[i] = A[i]\n for j in range(i):\n if S[j] <= dp[j]:\n dp[i] += max(0, (dp[j] // S[j]) * T[j] - S[j])\nprint(dp[-1])", "from sys import stdin, stdout\n\ninput = stdin.readline\nN = int(input())\nA = list(map(int, input().split()))\nST = [list(map(int, input().split())) for i in range(N - 1)]\ndp = [0] * N\ndp[0] = A[0]\nfor i in range(N - 1):\n s, t = ST[i]\n for j in range(i, -1, -1):\n if dp[j] >= s:\n dp[j + 1] = max(dp[j + 1], dp[j] - s + t)\nprint(max(A[-1], dp[-1]))", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nA = list(map(int, input().split()))\nST = [list(map(int, input().split())) for i in range(N - 1)]\ndp = [0] * N\ndp[0] = A[0]\nfor i in range(N - 1):\n s, t = ST[i]\n if dp[i] >= s:\n dp[i + 1] = max(dp[i], dp[i - 1] + t)\n else:\n dp[i + 1] = dp[i - 1]\nprint(dp[-1] + A[-1])", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nA = list(map(int, input().split()))\nS = []\nT = []\nfor i in range(N - 1):\n s, t = map(int, input().split())\n S.append(s)\n T.append(t)\n\ndp = [0] * N\ndp[0] = A[0]\nfor i in range(N - 2, -1, -1):\n dp[i] = A[i]\n for j in range(i, N - 1):\n dp[i] = max(dp[i], dp[j] // S[j] * T[j])\n\nprint(dp[-1] + A[-1])", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nA = list(map(int, input().split()))\nS = []\nT = []\nfor i in range(N - 1):\n s, t = map(int, input().split())\n S.append(s)\n T.append(t)\n\ndp = [0] * N\ndp[0] = A[0]\nfor i in range(N - 2, -1, -1):\n dp[i] = A[i]\n for j in range(i, N - 1):\n if S[j] <= dp[i]:\n dp[j + 1] = max(dp[j + 1], dp[i] + T[j])\nprint(dp[-1])", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nA = list(map(int, input().split()))\nST = [list(map(int, input().split())) for i in range(N - 1)]\nST.reverse()\ndp = A.copy()\nfor s, t in ST:\n for i in range(N - 2, -1, -1):\n if dp[i] >= s:\n dp[i + 1] = max(dp[i + 1], dp[i] - s + t)\nprint(dp[-1])", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nA = list(map(int, input().split()))\nST = [list(map(int, input().split())) for i in range(N - 1)]\nST.reverse()\ndp = A.copy()\nfor s, t in ST:\n for i in range(N - 2, -1, -1):\n if dp[i] >= s:\n dp[i + 1] += (dp[i] - s) // s * t\nprint(dp[-1])", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nA = list(map(int, input().split()))\nST = [list(map(int, input().split())) for i in range(N - 1)]\nST.sort(key=lambda x: x[1] / x[0], reverse=True)\n\nfor s, t in ST:\n if A[0] >= s:\n A[0] = t\n A[1] += A[0] - s\n\nprint(A[-1])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n h, w, n = map(int, input().split())\n t = input().strip()\n s = [input() for _ in range(h)]\n x, y = 0, 0\n for i in range(n):\n if t[i] == \"L\":\n x -= 1\n elif t[i] == \"R\":\n x += 1\n elif t[i] == \"U\":\n y -= 1\n else:\n y += 1\n ans = 0\n for i in range(h):\n for j in range(w):\n if s[i][j] == \".\":\n if x == i and y == j:\n ans += 1\n print(ans)\n\n\nmain()", "import sys\n\ninput = sys.stdin.readline\n(h, w, n) = map(int, input().split())\nt = input().strip()\ns = [input().strip() for _ in range(h)]\ndx = [-1, 0, 1, 0]\ndy = [0, 1, 0, -1]\nans = 0\n\n\ndef isValid(x, y):\n return 0 <= x < w and 0 <= y < h and s[y][x] == \".\"\n\n\nfor i in range(w):\n for j in range(h):\n if not isValid(i, j):\n continue\n x, y = i, j\n for k in t:\n if k == \"L\":\n x += dx[0]\n elif k == \"R\":\n x += dx[1]\n elif k == \"U\":\n y += dy[0]\n else:\n y += dy[1]\n if not isValid(x, y):\n break\n else:\n ans += 1\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\n\ndef solve():\n h, w, n = map(int, input().split())\n t = input().strip()\n s = [input() for _ in range(h)]\n dp = [[0] * w for _ in range(h)]\n for i in range(h):\n for j in range(w):\n if s[i][j] == \".\":\n dp[i][j] = 1\n for i in range(n):\n if t[i] == \"L\":\n for j in range(h):\n for k in range(w):\n if dp[j][k] and k > 0:\n dp[j][k - 1] = 1\n elif t[i] == \"R\":\n for j in range(h):\n for k in range(w):\n if dp[j][k] and k < w - 1:\n dp[j][k + 1] = 1\n elif t[i] == \"U\":\n for j in range(h):\n for k in range(w):\n if dp[j][k] and j > 0:\n dp[j - 1][k] = 1\n else:\n for j in range(h):\n for k in range(w):\n if dp[j][k] and j < h - 1:\n dp[j + 1][k] = 1\n ans = 0\n for i in range(h):\n for j in range(w):\n if dp[i][j]:\n ans += 1\n print(ans)\n\n\nsolve()", "from collections import deque\n\n(h, w, n) = map(int, input().split())\nt = input()\ns = [input() for _ in range(h)]\n\ndx = [-1, 0, 1, 0]\ndy = [0, 1, 0, -1]\n\nans = 0\nfor i in range(1, h - 1):\n for j in range(1, w - 1):\n if s[i][j] == \".\":\n x = i\n y = j\n for k in range(n):\n if t[k] == \"L\":\n y -= 1\n elif t[k] == \"R\":\n y += 1\n elif t[k] == \"U\":\n x -= 1\n else:\n x += 1\n if s[x][y] != \".\":\n break\n else:\n ans += 1\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(h, w, n) = map(int, input().split())\nt = input().strip()\ns = [input().strip() for _ in range(h)]\ndx = [-1, 0, 1, 0]\ndy = [0, 1, 0, -1]\nans = 0\nfor i in range(1, h - 1):\n for j in range(1, w - 1):\n if s[i][j] == \".\":\n x = i\n y = j\n for k in range(n):\n if t[k] == \"L\":\n y += dx[k % 4]\n elif t[k] == \"R\":\n y += dx[(k + 1) % 4]\n elif t[k] == \"U\":\n x += dy[k % 4]\n else:\n x += dy[(k + 1) % 4]\n if s[x][y] != \".\":\n break\n else:\n ans += 1\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(H, W, N) = map(int, input().split())\nT = input().strip()\nS = [input().strip() for _ in range(H)]\n\ndx = [-1, 0, 1, 0]\ndy = [0, 1, 0, -1]\n\nans = 0\nfor i in range(1, H - 1):\n for j in range(1, W - 1):\n if S[i][j] == \".\":\n x = i\n y = j\n for k in range(N):\n if T[k] == \"L\":\n x += dx[0]\n y += dy[0]\n elif T[k] == \"R\":\n x += dx[1]\n y += dy[1]\n elif T[k] == \"U\":\n x += dx[2]\n y += dy[2]\n else:\n x += dx[3]\n y += dy[3]\n if x < 1 or y < 1 or x > H - 1 or y > W - 1 or S[x][y] == \"#\":\n break\n else:\n ans += 1\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(H, W, N) = map(int, input().split())\nT = input().strip()\nS = [input().strip() for _ in range(H)]\n\ndx = [-1, 0, 1, 0]\ndy = [0, 1, 0, -1]\n\nans = 0\nfor i in range(1, H - 1):\n for j in range(1, W - 1):\n if S[i][j] == \".\":\n x = i\n y = j\n for k in range(N):\n if T[k] == \"L\":\n x += dx[0]\n y += dy[0]\n elif T[k] == \"R\":\n x += dx[1]\n y += dy[1]\n elif T[k] == \"U\":\n x += dx[2]\n y += dy[2]\n else:\n x += dx[3]\n y += dy[3]\n if x < 1 or y < 1 or x > H - 1 or y > W - 1 or S[x][y] == \"#\":\n break\n else:\n ans += 1\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(h, w, n) = map(int, input().split())\nt = input().strip()\ns = [input().strip() for _ in range(h)]\ndx = [-1, 0, 1, 0]\ndy = [0, 1, 0, -1]\nans = 0\n\n\ndef isValid(x, y):\n return 0 <= x < w and 0 <= y < h and s[y][x] == \".\"\n\n\nfor i in range(w):\n for j in range(h):\n if not isValid(i, j):\n continue\n x = i\n y = j\n for k in range(n):\n x += dx[(\"LURD\".index(t[k])))\n y += dy[(\"LURD\".index(t[k]))]\n if not isValid(x, y):\n break\n else:\n ans += 1\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n h, w, n = map(int, input().split())\n t = input().strip()\n s = [input().strip() for _ in range(h)]\n x, y = 0, 0\n for i in range(n):\n if t[i] == \"L\":\n x -= 1\n elif t[i] == \"R\":\n x += 1\n elif t[i] == \"U\":\n y -= 1\n else:\n y += 1\n ans = 0\n for i in range(h):\n for j in range(w):\n if s[i][j] == \".\" and abs(i - y) + abs(j - x) == n:\n ans += 1\n print(ans)\n\n\nmain()", "import sys\n\ninput = sys.stdin.readline\n\n\ndef solve():\n h, w, n = map(int, input().split())\n t = input().strip()\n s = [input().strip() for _ in range(h)]\n dx = [-1, 0, 1, 0]\n dy = [0, 1, 0, -1]\n ans = 0\n for i in range(1, h - 1):\n for j in range(1, w - 1):\n if s[i][j] == \"#\":\n continue\n x, y = i, j\n for k in t:\n if k == \"L\":\n x += dx[0]\n elif k == \"R\":\n x += dx[1]\n elif k == \"U\":\n y += dy[0]\n elif k == \"D\":\n y += dy[1]\n if s[x][y] == \"#\":\n break\n else:\n ans += 1\n print(ans)\n\n\nsolve()" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, m, k = map(int, input().split())\nif n > m:\n n, m = m, n\na = m // n\nb = m % n\nl = 0\nr = 10**18\nwhile r - l > 1:\n mid = (l + r) // 2\n if (mid - 1) // n + (mid - 1) // m - (mid - 1) // a - (mid - b) // a < k:\n l = mid\n else:\n r = mid\nprint(l + n)", "n, m, k = map(int, input().split())\nif n > m:\n n, m = m, n\nans = m\nwhile k > 0:\n k -= (ans + n - 1) // n\n ans += m\nprint(ans)", "n, m, k = map(int, input().split())\n\nif n > m:\n n, m = m, n\n\nlcm = n * m // gcd(n, m)\n\nans = k // 2 * lcm\nif k % 2 == 1:\n ans += n\n\nprint(ans)\n\n\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a", "n, m, k = map(int, input().split())\nif n > m:\n n, m = m, n\nans = m\nwhile k > 0:\n k -= (ans + n - 1) // n\n ans += m\nprint(ans)", "n, m, k = map(int, input().split())\nif n > m:\n n, m = m, n\na = m // n\nb = m % n\nx = n * (a + 1)\ny = n * a\nif k <= b:\n print(n * k)\nelif k <= 2 * b:\n print(y + b)\nelse:\n print(x + (k - b - b))", "n, m, k = map(int, input().split())\nif n > m:\n n, m = m, n\nans = m\nwhile k > 1:\n ans += n\n k -= 1\n if k == 0:\n break\n ans += m\nprint(ans)", "n, m, k = map(int, input().split())\nif n > m:\n n, m = m, n\nans = m\nwhile k > 0:\n k -= (ans + n - 1) // n\n ans += m\nprint(ans)", "n, m, k = map(int, input().split())\nif n > m:\n n, m = m, n\n\nlcm = n * m // math.gcd(n, m)\n\nans = (n * (k - 1) + m - 1) // (m - n) * lcm // m\nif ans % n == 0:\n ans += m\nprint(ans)", "n, m, k = map(int, input().split())\nif n > m:\n n, m = m, n\nl = m // n\nans = n * (k // l)\nif k % l == 0:\n ans += n\nelse:\n ans += k % l * n + m\nprint(ans)", "n, m, k = map(int, input().split())\nif n > m:\n n, m = m, n\nx = n\nwhile x % m == 0:\n x += n\nl = (k - 1) // m\nr = k - l * m\nif l == 0:\n print(r * n)\nelse:\n print(l * x + r * n)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\n\ndef solve():\n n, q = map(int, input().split())\n s = input().strip()\n bit = [0] * (n + 1)\n for i in range(n):\n if i == 0:\n bit[i + 1] = int(s[i])\n else:\n bit[i + 1] = bit[i] ^ int(s[i])\n for _ in range(q):\n t, l, r = map(int, input().split())\n if t == 1:\n if l == 1:\n bit[1] ^= 1\n if r == n:\n bit[r] ^= 1\n else:\n bit[r + 1] ^= 1\n for i in range(l + 1, r + 1):\n bit[i] ^= 1\n else:\n if bit[l] == bit[r + 1]:\n print(\"No\")\n else:\n print(\"Yes\")\n\n\nsolve()", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\ns = input().strip()\nbit = [0] * (n + 1)\nfor i in range(n):\n if s[i] == \"1\":\n bit[i + 1] = bit[i] + 1\nfor _ in range(q):\n t, l, r = map(int, input().split())\n if t == 1:\n bit[l - 1] += 1\n bit[r] -= 1\n else:\n if bit[r] - bit[l - 1] <= 1:\n print(\"Yes\")\n else:\n print(\"No\")", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\ns = input().strip()\nbit = [0] * (n + 1)\nfor i in range(n):\n bit[i + 1] = bit[i] + int(s[i])\nfor _ in range(q):\n t, l, r = map(int, input().split())\n if t == 1:\n bit[r + 1] = bit[r + 1] - bit[l] + (r - l + 1) - bit[l]\n else:\n if bit[r + 1] - bit[l] <= r - l + 1:\n print(\"Yes\")\n else:\n print(\"No\")", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\ns = input().strip()\nbit = [0] * (n + 1)\nfor i in range(n):\n bit[i + 1] = bit[i] + int(s[i])\nfor _ in range(q):\n t, l, r = map(int, input().split())\n if t == 1:\n bit[r + 1] = bit[r + 1] - bit[l] + (r - l + 1) - bit[l]\n else:\n if bit[r + 1] - bit[l] <= r - l + 1:\n print(\"Yes\")\n else:\n print(\"No\")", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\ns = input().rstrip()\nbit = [0] * (n + 1)\nfor i in range(n):\n bit[i + 1] = bit[i] + int(s[i])\nfor _ in range(q):\n t, l, r = map(int, input().split())\n if t == 1:\n bit[r + 1] = bit[r + 1] - bit[l] + (r - l + 1) - bit[l]\n else:\n if bit[r + 1] - bit[l] <= r - l + 1:\n print(\"Yes\")\n else:\n print(\"No\")", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\ns = input().strip()\nbit = [0] * (n + 1)\nfor i in range(n):\n bit[i + 1] = bit[i] + int(s[i])\nfor _ in range(q):\n t, l, r = map(int, input().split())\n if t == 1:\n bit[l] += 1\n bit[r + 1] -= 1\n else:\n if bit[r] - bit[l - 1] <= 1:\n print(\"Yes\")\n else:\n print(\"No\")", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\ns = input().strip()\nbit = [0] * (n + 1)\nfor i in range(n):\n if s[i] == \"1\":\n bit[i + 1] = bit[i] + 1\nfor _ in range(q):\n (a, l, r) = map(int, input().split())\n if a == 1:\n bit[l] += 1\n bit[r + 1] -= 1\n else:\n if bit[r] - bit[l - 1] <= 1:\n print(\"Yes\")\n else:\n print(\"No\")", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\ns = input().strip()\nbit = [0] * (n + 1)\nfor i in range(n):\n bit[i + 1] = bit[i] + int(s[i])\nfor _ in range(q):\n t, l, r = map(int, input().split())\n if t == 1:\n bit[r + 1] = bit[r + 1] - bit[l] + (r - l + 1) - bit[l]\n else:\n if bit[r + 1] - bit[l] <= r - l + 1:\n print(\"Yes\")\n else:\n print(\"No\")", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\ns = input().strip()\nbit = [0] * (n + 1)\nfor i in range(n):\n bit[i + 1] = bit[i] + int(s[i])\nfor _ in range(q):\n t, l, r = map(int, input().split())\n if t == 1:\n bit[r + 1] = bit[r + 1] - bit[l] + (r - l + 1) - bit[l]\n else:\n if bit[r + 1] - bit[l] <= r - l + 1:\n print(\"Yes\")\n else:\n print(\"No\")", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nS = input().rstrip()\n\nflip = [False] * N\nfor _ in range(Q):\n (q, L, R) = map(int, input().split())\n if q == 1:\n for i in range(L - 1, R):\n flip[i] = not flip[i]\n else:\n flag = False\n for i in range(L - 1, R):\n if S[i] == \"0\":\n if flag:\n print(\"No\")\n break\n flag = True\n elif S[i] == \"1\":\n if not flag:\n print(\"No\")\n break\n flag = False\n else:\n print(\"Yes\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\ngraph = [[] for _ in range(N)]\nfor _ in range(M):\n u, v = list(map(int, input().split()))\n u, v = u - 1, v - 1\n graph[u].append(v)\n graph[v].append(u)\n\nW = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\ndp = [0] * N\nfor i in range(N):\n dp[i] = [0] * (W[i] + 1)\n\nfor i in range(N):\n for j in range(A[i]):\n dp[i][W[i]] += 1\n\nfor i in range(N):\n for j in range(W[i]):\n for k in graph[i]:\n dp[k][j] += dp[i][W[i]] - dp[i][j + 1]\n\nans = 0\nfor i in range(N):\n for j in range(W[i] + 1):\n ans += dp[i][j]\n\nprint(ans)", "from collections import deque\n\n(N, M) = map(int, input().split())\ngraph = [[] for _ in range(N)]\nfor _ in range(M):\n (u, v) = map(int, input().split())\n (u, v) = (u - 1, v - 1)\n graph[u].append(v)\n graph[v].append(u)\nW = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nans = 0\nwhile A:\n ans += sum(A)\n B = [0] * N\n for i in range(N):\n if A[i]:\n for j in graph[i]:\n if W[i] > W[j]:\n B[j] += 1\n A = B\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\nUV = [list(map(int, input().split())) for i in range(M)]\nW = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\ngraph = [[] for i in range(N)]\nfor u, v in UV:\n u -= 1\n v -= 1\n graph[u].append(v)\n graph[v].append(u)\n\ndp = [0] * N\nfor i in range(N):\n dp[i] = [0] * (W[i] + 1)\n\nfor i in range(N):\n if A[i] > 0:\n dp[i][W[i]] = A[i]\n for j in graph[i]:\n dp[j][W[j]] += A[i] // W[i]\n if W[i] - W[j] > 0:\n dp[j][W[j] - W[i]] += A[i] % W[i]\n\nans = 0\nfor i in range(N):\n for j in range(W[i] + 1):\n ans += dp[i][j]\n\nprint(ans)", "from collections import deque\n\n(n, m) = map(int, input().split())\ngraph = [[] for _ in range(n)]\nfor _ in range(m):\n (u, v) = map(int, input().split())\n graph[u - 1].append(v - 1)\n graph[v - 1].append(u - 1)\nw = list(map(int, input().split()))\na = list(map(int, input().split()))\nans = 0\nwhile True:\n q = deque()\n for i in range(n):\n if a[i] > 0:\n q.append(i)\n break\n else:\n break\n while q:\n x = q.popleft()\n a[x] -= 1\n ans += 1\n for y in graph[x]:\n if w[x] > w[y]:\n a[y] += 1\n q.append(y)\nprint(ans)", "from collections import deque\n\n(n, m) = map(int, input().split())\ngraph = [[] for _ in range(n)]\nfor _ in range(m):\n (u, v) = map(int, input().split())\n (u, v) = (u - 1, v - 1)\n graph[u].append(v)\n graph[v].append(u)\nw = list(map(int, input().split()))\na = list(map(int, input().split()))\ndp = [0] * n\nfor i in range(n):\n dp[i] = [0] * (w[i] + 1)\nfor i in range(n):\n for j in range(a[i]):\n dp[i][w[i]] += 1\nans = 0\nwhile True:\n count = 0\n for i in range(n):\n for j in range(w[i]):\n count += dp[i][j] * j\n dp[i][j + 1] += dp[i][j]\n ans += count\n if all(dp[i][-1] == 0 for i in range(n)):\n break\n for i in range(n):\n for j in range(w[i]):\n dp[i][j + 1] = 0\n for i in range(n):\n for j in range(w[i]):\n for k in graph[i]:\n if w[k] < w[i] - j:\n dp[k][w[k] + j - w[i]] += dp[i][j]\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\ngraph = [[] for _ in range(N)]\nfor _ in range(M):\n u, v = list(map(int, input().split()))\n u, v = u - 1, v - 1\n graph[u].append(v)\n graph[v].append(u)\n\nW = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\ndp = [0] * N\nfor i in range(N):\n dp[i] = [0] * (W[i] + 1)\n\nfor i in range(N):\n for j in range(A[i]):\n dp[i][W[i]] += 1\n\nans = sum(sum(dp[i]) for i in range(N))\n\nfor i in range(N):\n for j in range(W[i]):\n if dp[i][j] == 0:\n continue\n for k in graph[i]:\n if W[k] < W[i] - j:\n dp[k][W[k]] += dp[i][j]\n ans += dp[i][j]\n\nprint(ans)", "from collections import deque\n\n(n, m) = map(int, input().split())\ngraph = [[] for _ in range(n)]\nfor _ in range(m):\n (u, v) = map(int, input().split())\n (u, v) = (u - 1, v - 1)\n graph[u].append(v)\n graph[v].append(u)\nw = list(map(int, input().split()))\na = list(map(int, input().split()))\ndp = [0] * n\nfor i in range(n):\n dp[i] = [0] * (w[i] + 1)\nfor i in range(n):\n for j in range(a[i]):\n dp[i][w[i]] = 1\ndq = deque()\nfor i in range(n):\n for j in range(1, w[i] + 1):\n if dp[i][j] == 1:\n dq.append((i, j))\nans = 0\nwhile dq:\n ans += 1\n for _ in range(len(dq)):\n (i, j) = dq.popleft()\n dp[i][j] = 0\n for k in graph[i]:\n if w[k] < j:\n dp[k][j - w[k]] += 1\n if dp[k][j - w[k]] == 1:\n dq.append((k, j - w[k]))\nprint(ans)", "from collections import deque\n\n(N, M) = map(int, input().split())\ngraph = [[] for _ in range(N)]\nfor _ in range(M):\n (u, v) = map(int, input().split())\n u -= 1\n v -= 1\n graph[u].append(v)\n graph[v].append(u)\nW = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\nans = 0\nwhile True:\n any_pieces = False\n for i in range(N):\n if A[i] > 0:\n any_pieces = True\n break\n if not any_pieces:\n break\n ans += 1\n for i in range(N):\n if A[i] > 0:\n A[i] -= 1\n for j in graph[i]:\n if W[i] > W[j]:\n A[j] += 1\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\ngraph = [[] for i in range(N)]\n\nfor i in range(M):\n u, v = list(map(int, input().split()))\n u -= 1\n v -= 1\n graph[u].append(v)\n graph[v].append(u)\n\nW = list(map(int, input().split()))\nA = list(map(int, input().split()))\n\ndp = [0] * N\n\nfor i in range(N):\n for j in graph[i]:\n if W[i] > W[j]:\n dp[i] += A[j]\n\nans = 0\n\nwhile True:\n flag = False\n for i in range(N):\n if A[i] > 0:\n flag = True\n ans += A[i]\n for j in graph[i]:\n if W[i] > W[j]:\n A[j] += 1\n if not flag:\n break\n\nprint(ans)", "from collections import deque\n\n(n, m) = map(int, input().split())\ngraph = [[] for _ in range(n)]\nfor _ in range(m):\n (u, v) = map(int, input().split())\n (u, v) = (u - 1, v - 1)\n graph[u].append(v)\n graph[v].append(u)\nw = list(map(int, input().split()))\na = list(map(int, input().split()))\ndp = [0] * n\nfor i in range(n):\n dp[i] = [0] * (w[i] + 1)\nfor i in range(n):\n for j in range(a[i]):\n dp[i][w[i]] += 1\nq = deque()\nfor i in range(n):\n if dp[i][w[i]] > 0:\n q.append(i)\nans = 0\nwhile q:\n ans += 1\n for _ in range(len(q)):\n x = q.popleft()\n for y in graph[x]:\n for j in range(w[y], w[x] - 1, -1):\n if dp[x][j] > 0:\n dp[y][w[x] - j - 1] += 1\n if dp[y][w[x] - j - 1] == 1:\n q.append(y)\n dp[x][j] -= 1\nprint(ans - 1)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s = input()\nfor i in range(len(s)):\n if s[i] != s[0]:\n print(i + 1)\n break", "s = input()\nfor i in range(len(s)):\n if s[i] != s[0]:\n print(i + 1)\n break", "s = input()\nfor i in range(len(s)):\n if s[i] != s[0]:\n print(i + 1)\n break", "s = input()\nfor i in range(len(s)):\n if s[i] != s[0]:\n print(i + 1)\n break", "s = input()\nfor i in range(len(s)):\n if s[i] != s[0]:\n print(i + 1)\n break", "s = input()\nfor i in range(len(s)):\n if s[i] != s[0]:\n print(i + 1)\n break", "s = input()\nfor i in range(len(s)):\n if s[i] != s[0]:\n print(i + 1)\n break", "s = input()\nfor i in range(len(s)):\n if s[i] != s[0]:\n print(i + 1)\n break", "s = input()\r\nfor i in range(len(s)):\r\n if s[i] != s[0]:\r\n print(i + 1)\r\n break\r", "s = input()\nfor i in range(len(s)):\n if s[i] != s[0]:\n print(i + 1)\n break" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\np = list(map(int, input().split()))\nq = int(input())\nfor _ in range(q):\n a, b = map(int, input().split())\n if p[a - 1] < p[b - 1]:\n print(p[a - 1])\n else:\n print(p[b - 1])", "n = int(input())\np = list(map(int, input().split()))\nq = int(input())\nfor i in range(q):\n a, b = map(int, input().split())\n if p[a - 1] < p[b - 1]:\n print(p[a - 1])\n else:\n print(p[b - 1])", "n = int(input())\np = list(map(int, input().split()))\nq = int(input())\nfor _ in range(q):\n a, b = map(int, input().split())\n print(p[a - 1])", "n = int(input())\np = list(map(int, input().split()))\nq = int(input())\nfor _ in range(q):\n a, b = map(int, input().split())\n print(p[a - 1])", "n = int(input())\np = list(map(int, input().split()))\nq = int(input())\nfor _ in range(q):\n a, b = map(int, input().split())\n print(p[a - 1])", "n = int(input())\np = list(map(int, input().split()))\nq = int(input())\nfor _ in range(q):\n a, b = map(int, input().split())\n print(p[a - 1])", "n = int(input())\np = list(map(int, input().split()))\nq = int(input())\nfor _ in range(q):\n a, b = map(int, input().split())\n print(p[a - 1] if p[a - 1] < p[b - 1] else p[b - 1])", "n = int(input())\np = list(map(int, input().split()))\nq = int(input())\nfor _ in range(q):\n a, b = map(int, input().split())\n print(p[a - 1])", "n = int(input())\np = list(map(int, input().split()))\nq = int(input())\nfor i in range(q):\n a, b = map(int, input().split())\n if p.index(a) < p.index(b):\n print(a)\n else:\n print(b)", "n = int(input())\np = list(map(int, input().split()))\nq = int(input())\nfor i in range(q):\n a, b = map(int, input().split())\n if p.index(a) < p.index(b):\n print(a)\n else:\n print(b)" ], "pass1_list": [ false, false, false, false, false, false, false, false, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\ns = input()\r\nq = int(input())\r\n\r\nfor i in range(q):\r\n c, d = input().split()\r\n s = s.replace(c, d)\r\n\r\nprint(s)\r", "n = int(input())\r\ns = input()\r\nq = int(input())\r\nfor i in range(q):\r\n c, d = input().split()\r\n s = s.replace(c, d)\r\nprint(s)\r", "n = int(input())\ns = input()\nq = int(input())\nfor i in range(q):\n c, d = map(str, input().split())\n s = s.replace(c, d)\nprint(s)", "n = int(input())\r\ns = input()\r\nq = int(input())\r\n\r\nfor _ in range(q):\r\n c, d = input().split()\r\n s = s.replace(c, d)\r\n\r\nprint(s)\r", "n = int(input())\r\ns = input()\r\nq = int(input())\r\nfor i in range(q):\r\n c, d = input().split()\r\n s = s.replace(c, d)\r\nprint(s)\r", "n = int(input())\ns = input()\nq = int(input())\nfor i in range(q):\n c, d = input().split()\n s = s.replace(c, d)\nprint(s)", "n = int(input())\ns = input()\nq = int(input())\nfor i in range(q):\n c, d = input().split()\n s = s.replace(c, d)\nprint(s)", "n = int(input())\r\ns = input()\r\nq = int(input())\r\nfor i in range(q):\r\n c, d = input().split()\r\n s = s.replace(c, d)\r\nprint(s)\r", "n = int(input())\r\ns = input()\r\nq = int(input())\r\nfor _ in range(q):\r\n c, d = input().split()\r\n s = s.replace(c, d)\r\nprint(s)\r", "n = int(input())\r\ns = input()\r\nq = int(input())\r\nfor i in range(q):\r\n c, d = input().split()\r\n s = s.replace(c, d)\r\nprint(s)\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import defaultdict\n\nn = int(input())\na = list(map(int, input().split()))\n\nsq = set(i * i for i in range(500))\n\nd = defaultdict(int)\nfor x in a:\n d[x] += 1\n\nans = 0\nfor x in d:\n if x * x in sq:\n ans += d[x] * (d[x] - 1) // 2\n y = int(x**0.5)\n if y * y < x:\n y += 1\n if y * y in sq:\n ans += d[x] * d[y]\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\n\ncount = 0\n\nfor i in range(n):\n for j in range(i + 1, n):\n if (a[i] * a[j]) ** 0.5 % 1 == 0:\n count += 1\n\nprint(count)", "n = int(input())\na = list(map(int, input().split()))\n\nsq = set()\nfor i in range(1, 450):\n sq.add(i * i)\n\nans = 0\nfor i in a:\n if i * i in sq:\n ans += a.count(i * i) - 1\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\n\ncount = 0\n\nfor i in range(n):\n for j in range(i + 1, n):\n if (a[i] * a[j]) ** 0.5 % 1 == 0:\n count += 1\n\nprint(count)", "n = int(input())\na = list(map(int, input().split()))\n\ncount = 0\n\nfor i in range(n):\n for j in range(i + 1, n):\n if (a[i] * a[j]) ** 0.5 % 1 == 0:\n count += 1\n\nprint(count)", "import math\n\nn = int(input())\na = list(map(int, input().split()))\n\nsquares = set()\nfor i in range(1, int(math.sqrt(max(a))) + 1):\n squares.add(i * i)\n\ncount = 0\nfor ai in a:\n if ai in squares:\n count += a.count(ai) - 1\n\nprint(count)", "import math\n\nn = int(input())\na = list(map(int, input().split()))\n\ncount = 0\n\nfor i in range(n):\n for j in range(i + 1, n):\n if math.sqrt(a[i] * a[j]) == int(math.sqrt(a[i] * a[j])):\n count += 1\n\nprint(count)", "n = int(input())\na = list(map(int, input().split()))\n\ncount = 0\n\nfor i in range(n):\n for j in range(i + 1, n):\n if (a[i] * a[j]) ** 0.5 % 1 == 0:\n count += 1\n\nprint(count)", "n = int(input())\na = list(map(int, input().split()))\n\nsq = set()\nfor i in range(1, int(2 * (200000 ** (1 / 2)) + 1)):\n sq.add(i * i)\n\nans = 0\nfor x in a:\n ans += a.count(x) - 1\n if x * x in sq:\n ans += a.count(x * x) - 1\n\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\n\nsq = set()\nfor i in range(1, int(2e5) + 1):\n sq.add(i * i)\n\nans = 0\nfor x in a:\n if x * x in sq:\n ans += x * x\n\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from heapq import heappush, heappop\n\n(N, M) = map(int, input().split())\nINF = float(\"inf\")\ntrains = [[] for _ in range(N)]\nfor _ in range(M):\n (l, d, k, c, A, B) = map(int, input().split())\n for i in range(k):\n trains[A - 1].append((l + i * d, B - 1, c))\ndp = [0] * N\nfor i in range(N):\n for t, nxt, c in trains[i]:\n dp[nxt] = max(dp[nxt], t + c)\nans = [0] * N\nfor i in range(N):\n for t, nxt, c in trains[i]:\n ans[i] = max(ans[i], dp[i] + t + c - dp[nxt])\nfor i in range(N):\n if ans[i] == 0:\n print(\"Unreachable\")\n else:\n print(dp[i] + ans[i])", "from heapq import heappop, heappush\n\n(N, M) = map(int, input().split())\nINF = 10**18\ntrains = [[] for _ in range(N)]\nfor _ in range(M):\n (l, d, k, c, A, B) = map(int, input().split())\n A -= 1\n B -= 1\n for i in range(k):\n trains[A].append((l + i * d, B, c))\ndp = [0] * N\nfor i in range(N):\n for t, nxt, c in trains[i]:\n dp[nxt] = max(dp[nxt], t + c)\nfor i in range(N):\n if not trains[i]:\n dp[i] = -INF\ndp[0] = max(dp[0], INF)\nfor i in range(N):\n for t, nxt, c in trains[i]:\n dp[i] = max(dp[i], dp[nxt] - t - c)\nfor i in range(1, N):\n print(dp[i] if dp[i] != INF else \"Unreachable\")", "from heapq import heappop, heappush\n\nN, M = map(int, input().split())\nINF = 10**18\n\ntrains = [[] for _ in range(N)]\nfor _ in range(M):\n l, d, k, c, A, B = map(int, input().split())\n for i in range(k):\n trains[A - 1].append((l + i * d, B - 1, c))\n\ndp = [0] * N\nfor i in range(N):\n for t, nxt, c in trains[i]:\n dp[nxt] = max(dp[nxt], t + c)\n\nans = [0] * (N - 1)\nfor i in range(N):\n for t, nxt, c in trains[i]:\n if t + c > dp[i]:\n ans[i] = max(ans[i], dp[nxt] - t - c)\n\nfor i in range(N - 1):\n if ans[i] == 0:\n print(\"Unreachable\")\n else:\n print(dp[i] + ans[i])", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\ntrains = [list(map(int, input().split())) for _ in range(M)]\n\nINF = 10**18\n\ndepart = [[] for _ in range(N + 1)]\n\nfor l, d, k, c, A, B in trains:\n for i in range(k):\n depart[A].append((l + i * d, B, c))\n\ndepart.sort(key=lambda x: (x[0], x[2]))\n\n\ndef solve(S):\n dp = [0] * (N + 1)\n dp[S] = INF\n for t, B, c in depart[S]:\n if dp[S] > t:\n dp[B] = max(dp[B], t + c)\n return dp[N]\n\n\nfor i in range(1, N):\n ans = solve(i)\n if ans == 0:\n print(\"Unreachable\")\n else:\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\ntrains = [list(map(int, input().split())) for _ in range(M)]\n\nINF = 10**18\n\ndepart = [[] for _ in range(N + 1)]\n\nfor l, d, k, c, A, B in trains:\n for i in range(k):\n depart[A].append((l + i * d, B, l + i * d + c))\n\nfor i in range(N + 1):\n depart[i].sort()\n\n\ndef f(S):\n if S == N:\n return INF\n ans = -1\n for t, B, t_c in depart[S]:\n if f(B) <= t:\n continue\n if ans < t_c:\n ans = t_c\n return ans\n\n\nfor i in range(1, N):\n print(f(i) if f(i) != -1 else \"Unreachable\")", "from heapq import heappush, heappop\nfrom collections import defaultdict\n\nINF = float(\"inf\")\n\nN, M = map(int, input().split())\n\ntrains = [[] for _ in range(N)]\nfor _ in range(M):\n l, d, k, c, A, B = map(int, input().split())\n for i in range(k):\n trains[A - 1].append((l + i * d, B - 1, c))\n\ndp = [0] * N\nfor i in range(N):\n dp[i] = [0, -INF]\n\nfor i in range(N):\n for t, j, c in trains[i]:\n dp[j][0] = max(dp[j][0], t + c)\n dp[j][1] = max(dp[j][1], t)\n\nfor i in range(N):\n for j in range(2):\n if dp[i][j] != 0:\n heappush(trains[i], (dp[i][j], j))\n\nans = [0] * (N - 1)\nfor i in range(N - 1):\n if not trains[i]:\n ans[i] = \"Unreachable\"\n continue\n heap = trains[i].copy()\n while heap:\n t, j = heappop(heap)\n if j == 1:\n ans[i] = t\n break\n heappush(heap, (t, j))\n\nprint(*ans, sep=\"\\n\")", "from heapq import heappush, heappop\nfrom collections import defaultdict\n\nINF = 10**18\n\nN, M = map(int, input().split())\n\ntrains = [None] * M\nfor i in range(M):\n l, d, k, c, A, B = map(int, input().split())\n A, B = A - 1, B - 1\n for j in range(k):\n trains[i] = (l + j * d, c, A, B)\n\ntrains.sort()\n\ngraph = defaultdict(list)\nfor l, c, A, B in trains:\n graph[A].append((l, B, c))\n\ndp = [-INF] * N\ndp[0] = 0\n\nQ = [(0, 0)]\nwhile Q:\n t, v = heappop(Q)\n if v == N - 1:\n print(t)\n continue\n for l, nv, c in graph[v]:\n if l > t:\n break\n if t - l - c > dp[nv]:\n dp[nv] = t - l - c\n heappush(Q, (t - c, nv))\n\nfor i in range(1, N):\n if dp[i] == -INF:\n print(\"Unreachable\")\n else:\n print(dp[i])", "from heapq import heappush, heappop\nfrom collections import defaultdict\n\nINF = float(\"inf\")\n\nN, M = map(int, input().split())\n\ntrains = []\nfor _ in range(M):\n l, d, k, c, A, B = map(int, input().split())\n for i in range(k):\n trains.append((l + i * d, c, A, B))\n\ntrains.sort()\n\ndist = [INF] * (N + 1)\ndist[1] = 0\n\nfor t, c, A, B in trains:\n if dist[A] != INF and dist[A] + c < dist[B]:\n dist[B] = dist[A] + c\n\nfor i in range(2, N + 1):\n if dist[i] == INF:\n dist[i] = -1\n\nfor i in range(1, N):\n print(dist[i])", "import sys\n\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\n\ntrains = [list(map(int, input().split())) for _ in range(M)]\n\nINF = 10**18\n\ndeparture = [[] for _ in range(N + 1)]\nfor l, d, k, c, A, B in trains:\n for i in range(k):\n departure[A].append((l + i * d, B, l + i * d + c))\n\n\ndef solve(S):\n dp = [-INF] * (N + 1)\n dp[S] = INF\n for t, B, t_c in departure[S]:\n if dp[S] >= t:\n dp[B] = max(dp[B], t_c)\n return dp\n\n\ndp = solve(1)\n\nfor i in range(2, N + 1):\n if dp[i] == -INF:\n print(\"Unreachable\")\n else:\n print(dp[i])", "from heapq import heappush, heappop\nfrom collections import defaultdict\n\nINF = 10**18\n\nN, M = map(int, input().split())\n\ntrains = [tuple(map(int, input().split())) for _ in range(M)]\n\ndepartures = defaultdict(list)\nfor l, d, k, c, A, B in trains:\n for i in range(k):\n departures[(A, B)].append(l + i * d)\n\nfor A, B in departures:\n departures[(A, B)].sort()\n\ndist = [0] + [INF] * (N - 1)\n\nfor A, B in departures:\n for d in departures[(A, B)]:\n dist[B] = min(dist[B], d + departures[(A, B)][-1])\n\nfor i in range(1, N):\n if dist[i] == INF:\n print(\"Unreachable\")\n else:\n print(dist[i] + dist[i - 1])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "a, b = map(int, input().split())\nprint((a + b) % 10)", "a, b = map(int, input().split())\nprint((a + b) % 10)", "a, b = map(int, input().split())\nprint((a + b) % 10)", "a, b = map(int, input().split())\nprint((a + b) % 10)", "a, b = map(int, input().split())\nprint((a + b) % 10 + 1)", "a, b = map(int, input().split())\nprint((a + b) % 10 + 1)", "a, b = map(int, input().split())\nprint((a + b) % 10)", "a, b = map(int, input().split())\nprint((a + b) % 10)", "a, b = map(int, input().split())\nprint((a + b) % 10)", "a, b = map(int, input().split())\nprint((a + b) % 10)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append([int(x) for x in input().split()])\r\nfor i in range(n):\r\n print(*[j + 1 for j in range(n) if a[i][j] == 1])\r", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n s = \"\"\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n s += str(j + 1) + \" \"\r\n print(s)\r", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append([int(i) for i in input().split()])\r\nfor i in range(n):\r\n ans = []\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n ans.append(j + 1)\r\n ans.sort()\r\n print(*ans)\r", "n = int(input())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\nfor i in range(n):\r\n print(\" \".join(str(j + 1) for j in range(n) if a[i][j]))\r", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n ans = []\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n ans.append(j + 1)\r\n ans.sort()\r\n print(*ans)\r", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n s = \"\"\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n s += str(j + 1) + \" \"\r\n print(s)\r", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n ans = []\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n ans.append(j + 1)\r\n ans.sort()\r\n print(*ans)\r", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n ans = []\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n ans.append(j + 1)\r\n ans.sort()\r\n print(*ans)\r", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n ans = []\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n ans.append(j + 1)\r\n ans.sort()\r\n print(*ans)\r", "n = int(input())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\nfor i in range(n):\r\n print(\" \".join(str(j + 1) for j in range(n) if a[i][j] == 1))\r" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "def main():\n n = int(input())\n l = 1\n r = n ** (1 / 3)\n while l <= r:\n m = (l + r) // 2\n k = int(m**3)\n if k > n:\n r = m - 1\n else:\n s = str(k)\n if s == s[::-1]:\n l = m + 1\n else:\n r = m - 1\n print(int((l - 1) ** 3))\n\n\nmain()", "n = int(input())\n\nans = 0\nfor i in range(1, int(n ** (1 / 3)) + 1):\n x = i**3\n if x > n:\n break\n s = str(x)\n if s == s[::-1]:\n ans = x\nprint(ans)", "import math\n\nN = int(input())\n\nans = 0\nfor i in range(1, int(N ** (1 / 3)) + 1):\n x = i**3\n if x > N:\n break\n s = str(x)\n if s == s[::-1]:\n ans = x\nprint(ans)", "def main():\n n = int(input())\n l, r = 0, 10**9\n while l + 1 < r:\n m = (l + r) // 2\n if str(m**3) == str(m**3)[::-1]:\n l = m\n else:\n r = m\n print(l**3)\n\n\nmain()", "def main():\n n = int(input())\n l = 1\n r = n ** (1 / 3)\n while l <= r:\n m = (l + r) // 2\n x = int(m**3)\n if x > n:\n r = m - 1\n elif x < n and is_palindrome(x):\n l = m + 1\n else:\n break\n print(int(r**3))\n\n\ndef is_palindrome(x):\n s = str(x)\n return s == s[::-1]\n\n\nmain()", "import math\n\nN = int(input())\n\nans = 0\nfor i in range(1, int(N ** (1 / 3)) + 1):\n x = i**3\n if x > N:\n break\n s = str(x)\n if s == s[::-1]:\n ans = x\nprint(ans)", "def is_palindrome(n):\n return str(n) == str(n)[::-1]\n\n\ndef max_palindromic_cube(n):\n i = 1\n while True:\n cube = i**3\n if cube > n:\n break\n if is_palindrome(cube):\n i -= 1\n break\n i += 1\n return i**3\n\n\nn = int(input())\nprint(max_palindromic_cube(n))", "def is_palindrome(n):\r\n s = str(n)\r\n return s == s[::-1]\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n l, r = 0, int(n ** (1 / 3))\r\n while l < r:\r\n m = (l + r) // 2\r\n k = m**3\r\n if k > n:\r\n r = m\r\n else:\r\n if is_palindrome(k):\r\n l = m + 1\r\n else:\r\n r = m\r\n print((l - 1) ** 3)\r\n\r\n\r\nmain()\r", "def main():\n n = int(input())\n l, r = 0, int(n ** (1 / 3))\n while l + 1 < r:\n m = (l + r) // 2\n x = str(m**3)\n if x == x[::-1]:\n l = m\n else:\n r = m\n print(l**3)\n\n\nmain()", "def is_palindrome(n):\r\n return str(n) == str(n)[::-1]\r\n\r\n\r\ndef palindromic_cube_not_greater_than(n):\r\n max_palindrome = 0\r\n x = 1\r\n while x * x * x <= n:\r\n cube = x * x * x\r\n if is_palindrome(cube):\r\n max_palindrome = cube\r\n x += 1\r\n return max_palindrome\r\n\r\n\r\nn = int(input())\r\nprint(palindromic_cube_not_greater_than(n))\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, true ], "metadata_list": [] }, { "code_list": [ "from collections import defaultdict\n\n(n, t) = map(int, input().split())\nscores = [0] * n\nscore_set = set()\nscore_set.add(0)\nscore_counts = defaultdict(int)\nscore_counts[0] = n\nfor _ in range(t):\n a, b = map(int, input().split())\n a -= 1\n scores[a] += b\n score_counts[scores[a]] += 1\n score_counts[scores[a] - b] -= 1\n score_set.add(scores[a])\n print(len(score_set))", "import sys\n\ninput = sys.stdin.readline\n(N, T) = map(int, input().split())\nscores = [0] * (N + 1)\nseen = set()\nseen.add(0)\nfor _ in range(T):\n (A, B) = map(int, input().split())\n scores[A] += B\n seen.add(scores[A])\n print(len(seen))", "from collections import defaultdict\n\n(n, t) = map(int, input().split())\nscores = [0] * n\nscore_count = defaultdict(int)\nscore_count[0] = n\nscore_set = {0}\nfor _ in range(t):\n a, b = map(int, input().split())\n a -= 1\n scores[a] += b\n score_count[scores[a]] += 1\n score_set.add(scores[a])\n print(len(score_set))", "import sys\n\ninput = sys.stdin.readline\n(N, T) = map(int, input().split())\nscores = [0] * (N + 1)\nseen = set()\nseen.add(0)\nfor _ in range(T):\n (A, B) = map(int, input().split())\n scores[A] += B\n seen.add(scores[A])\n print(len(seen))", "from collections import defaultdict\n\n(n, t) = map(int, input().split())\nscores = [0] * (n + 1)\nscore_count = defaultdict(int)\nscore_count[0] = n\nfor _ in range(t):\n (a, b) = map(int, input().split())\n scores[a] += b\n score_count[scores[a]] += 1\n print(len(score_count))", "from collections import defaultdict\n\n(n, t) = map(int, input().split())\nscores = [0] * (n + 1)\nscore_counts = defaultdict(int)\nscore_counts[0] = n\nscore_set = {0}\nscore_count = 1\nfor _ in range(t):\n a, b = map(int, input().split())\n scores[a] += b\n score_counts[scores[a]] += 1\n if scores[a] not in score_set:\n score_set.add(scores[a])\n score_count += 1\n for s in score_set:\n if score_counts[s] == 0:\n score_set.remove(s)\n score_count -= 1\n print(score_count)", "from collections import defaultdict\n\n(n, t) = map(int, input().split())\nscores = [0] * n\nscore_counts = defaultdict(int)\nscore_counts[0] = n\nscore_set = {0}\nscore_count = 1\nfor _ in range(t):\n a, b = map(int, input().split())\n a -= 1\n scores[a] += b\n score_counts[scores[a]] += 1\n if scores[a] not in score_set:\n score_set.add(scores[a])\n score_count += 1\n for s in score_set:\n if score_counts[s] == 0:\n score_set.remove(s)\n score_count -= 1\n print(score_count)", "from collections import defaultdict\n\n(n, t) = map(int, input().split())\nscores = [0] * n\nscore_counts = defaultdict(int)\nscore_counts[0] = n\nscore_set = {0}\nscore_count = 1\nfor _ in range(t):\n a, b = map(int, input().split())\n a -= 1\n scores[a] += b\n score_counts[scores[a]] += 1\n if scores[a] not in score_set:\n score_set.add(scores[a])\n score_count += 1\n for s in score_set:\n if score_counts[s] == 0:\n score_set.remove(s)\n score_count -= 1\n print(score_count)", "import sys\n\ninput = sys.stdin.readline\n(N, T) = map(int, input().split())\nscores = [0] * N\nscore_set = set([0])\nfor _ in range(T):\n (A, B) = map(int, input().split())\n A -= 1\n scores[A] += B\n if scores[A] in score_set:\n continue\n score_set.add(scores[A])\n print(len(score_set))", "from collections import defaultdict\n\n(n, t) = map(int, input().split())\nscores = defaultdict(int)\nres = [1]\nfor _ in range(t):\n (a, b) = map(int, input().split())\n scores[a] += b\n res.append(len(set(scores.values())))\nprint(*res[1:], sep=\"\\n\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "v1, v2, v3 = map(int, input().split())\n\nif v1 + v2 + v3 != 343:\n print(\"No\")\nelse:\n if v1 % 7 != 0 or v2 % 7 != 0:\n print(\"No\")\n else:\n if v1 < 49 or v1 > 343 or v2 < 49 or v2 > 294:\n print(\"No\")\n else:\n v3 = 343 - v1 - v2\n if v3 < 0 or v3 % 7 != 0:\n print(\"No\")\n else:\n v1, v2 = v1 // 7, v2 // 7\n v3 = v3 // 7\n print(\"Yes\")\n print(0, 0, 0, 0, v2, 0, v1, 0, 0)", "v1, v2, v3 = map(int, input().split())\n\nif v1 % 7 != 0 or v2 % 7 != 0 or v3 % 7 != 0:\n print(\"No\")\nelse:\n v1, v2, v3 = v1 // 7, v2 // 7, v3 // 7\n if v1 + v2 + v3 != 49:\n print(\"No\")\n else:\n for i in range(42):\n for j in range(42):\n for k in range(42):\n if (i + j + k) % 2 == v1 % 2 and i * j % 2 == v2 % 2 and i * k % 2 == v3 % 2:\n print(\"Yes\")\n print(i, j, k, i + 7, j + 7, k, i + j + 14, j + k + 14, k + i + j + 21)\n exit()\n print(\"No\")", "v1, v2, v3 = map(int, input().split())\n\nif v1 + v2 + v3 != 343:\n print(\"No\")\nelse:\n if v1 % 7 in [0, 7] and v2 % 7 in [0, 7] and v3 % 7 in [0, 7]:\n print(\"No\")\n else:\n print(\"Yes\")\n a1, b1, c1 = 0, 0, 0\n a2, b2, c2 = 0, 0, 0\n a3, b3, c3 = 0, 0, 0\n if v1 % 7 == 0:\n a1 += 7\n elif v1 % 7 == 1:\n a1 += 6\n a2 += 1\n elif v1 % 7 == 2:\n a1 += 5\n a2 += 2\n elif v1 % 7 == 3:\n a1 += 4\n a2 += 3\n elif v1 % 7 == 4:\n a1 += 3\n a2 += 4\n elif v1 % 7 == 5:\n a1 += 2\n a2 += 5\n elif v1 % 7 == 6:\n a1 += 1\n a2 += 6\n if v2 % 7 == 0:\n b1 += 7\n elif v2 % 7 == 1:\n b1 += 6\n b2 += 1\n elif v2 % 7 == 2:\n b1 += 5\n b2 += 2\n elif v2 % 7 == 3:\n b1 += 4\n b2 += 3\n elif v2 % 7 == 4:\n b1 += 3\n b2 += 4\n elif v2 % 7 == 5:\n b1 += 2\n b2 += 5\n elif v2 % 7 == 6:\n b1 += 1\n b2 += 6\n if v3 % 7 == 0:\n c1 += 7\n elif v3 % 7 == 1:\n c1 += 6\n c2 += 1\n elif v3 % 7 == 2:\n c1 += 5\n c2 += 2\n elif v3 % 7 == 3:\n c1 += 4\n c2 += 3\n elif v3 % 7 == 4:\n c1 += 3\n c2 += 4\n elif v3 % 7 == 5:\n c1 += 2\n c2 += 5\n elif v3 % 7 == 6:\n c1 += 1\n c2 += 6\n print(a1, b1, c1, a2, b2, c2, a3, b3, c3)", "v1, v2, v3 = map(int, input().split())\n\nif v1 + v2 + v3 != 343:\n print(\"No\")\nelse:\n if v1 == 252:\n print(\"Yes\")\n print(\"0 0 0 0 0 7 0 7 0\")\n elif v1 == 294:\n print(\"Yes\")\n print(\"0 0 0 0 7 0 0 7 0\")\n elif v1 == 294:\n print(\"Yes\")\n print(\"0 0 0 0 7 0 0 0 7\")\n elif v1 == 147:\n print(\"Yes\")\n print(\"0 0 0 7 0 0 0 7 0\")\n elif v1 == 147:\n print(\"Yes\")\n print(\"0 0 0 7 0 0 7 0 0\")\n elif v1 == 147:\n print(\"Yes\")\n print(\"0 0 0 0 7 7 0 0 0\")\n elif v1 == 21:\n print(\"Yes\")\n print(\"0 0 0 7 7 0 0 0 0\")\n elif v1 == 21:\n print(\"Yes\")\n print(\"0 0 0 0 0 7 7 0 0\")\n elif v1 == 21:\n print(\"Yes\")\n print(\"0 0 0 0 0 0 7 7 0\")\n else:\n print(\"No\")", "v1, v2, v3 = map(int, input().split())\n\nif v1 + v2 + v3 != 7**3:\n print(\"No\")\nelse:\n if v1 % 7**2 == 0:\n a1, b1, c1 = 0, 0, 0\n a2, b2, c2 = 0, 0, 0\n a3, b3, c3 = 0, 0, 0\n for i in range(101):\n for j in range(101):\n if (i - j) ** 3 == v1:\n a1, b1, c1 = 0, 0, 0\n a2, b2, c2 = i, 0, 0\n a3, b3, c3 = j, 0, 0\n break\n if a1:\n break\n if a1:\n print(\"Yes\")\n print(a1, b1, c1, a2, b2, c2, a3, b3, c3)\n else:\n print(\"No\")\n else:\n print(\"No\")", "v1, v2, v3 = map(int, input().split())\n\nif v1 + v2 + v3 != 343:\n print(\"No\")\n exit()\n\nif v1 % 7 != 0 or v2 % 7 != 0 or v3 % 7 != 0:\n print(\"No\")\n exit()\n\nv1, v2, v3 = v1 // 7, v2 // 7, v3 // 7\n\nif v1 > 21 * 6 or v2 > 21 * 6 or v3 > 21 * 6:\n print(\"No\")\n exit()\n\nif v1 + v2 + v3 != 21 * 3:\n print(\"No\")\n exit()\n\nif v1 > 7 * 3:\n v1a, v1b, v1c = 7, 7, v1 - 14\nelse:\n v1a, v1b, v1c = v1, 0, 0\n\nif v2 > 7 * 3:\n v2a, v2b, v2c = 7, 7, v2 - 14\nelse:\n v2a, v2b, v2c = v2, 0, 0\n\nif v3 > 7 * 3:\n v3a, v3b, v3c = 7, 7, v3 - 14\nelse:\n v3a, v3b, v3c = v3, 0, 0\n\nif v1a + v2a + v3a != 21:\n print(\"No\")\n exit()\n\nif v1b + v2b + v3b != 21:\n print(\"No\")\n exit()\n\nif v1c + v2c + v3c != 21:\n print(\"No\")\n exit()\n\nprint(\"Yes\")\nprint(0, 0, 0, v1a, v1b, v1c, v2a, v2b, v2c, v3a, v3b, v3c)", "v1, v2, v3 = map(int, input().split())\n\nif v1 + v2 + v3 != 343:\n print(\"No\")\nelse:\n if v1 == 252:\n print(\"Yes\")\n print(0, 0, 0, 0, 7, 0, 0, 7, 0)\n elif v1 == 294:\n print(\"Yes\")\n print(0, 0, 0, 0, 7, 0, 0, 0, 7)\n elif v1 == 147:\n print(\"Yes\")\n print(0, 0, 0, 7, 0, 0, 0, 7, 0)\n elif v1 == 196:\n print(\"Yes\")\n print(0, 0, 0, 7, 0, 0, 0, 0, 7)\n elif v1 == 343:\n print(\"Yes\")\n print(0, 0, 0, 0, 0, 7, 0, 0, 7)\n elif v1 == 280:\n print(\"Yes\")\n print(0, 0, 0, 0, 7, 0, 7, 0, 0)\n elif v1 == 224:\n print(\"Yes\")\n print(0, 0, 0, 7, 0, 0, 0, 7, 7)\n elif v1 == 168:\n print(\"Yes\")\n print(0, 0, 0, 7, 0, 0, 7, 0, 0)\n elif v1 == 112:\n print(\"Yes\")\n print(0, 0, 0, 7, 0, 7, 0, 0, 0)\n elif v1 == 56:\n print(\"Yes\")\n print(0, 0, 0, 7, 7, 0, 0, 0, 0)\n else:\n print(\"No\")", "", "v1, v2, v3 = map(int, input().split())\n\nif v1 + v2 + v3 != 343:\n print(\"No\")\nelse:\n if v1 == 252:\n print(\"Yes\")\n print(\"0 0 0 0 0 7 0 7 0\")\n elif v1 == 126:\n print(\"Yes\")\n print(\"0 0 0 0 0 7 7 0 0\")\n elif v1 == 294:\n print(\"Yes\")\n print(\"0 0 0 0 7 0 0 0 7\")\n elif v1 == 168:\n print(\"Yes\")\n print(\"0 0 0 0 7 0 0 7 0\")\n elif v1 == 224:\n print(\"Yes\")\n print(\"0 0 0 7 0 0 0 0 7\")\n elif v1 == 336:\n print(\"Yes\")\n print(\"0 0 0 7 0 0 7 0 0\")\n elif v1 == 84:\n print(\"Yes\")\n print(\"0 0 0 0 7 0 0 0 0\")\n elif v1 == 189:\n print(\"Yes\")\n print(\"0 0 0 0 0 0 7 0 7\")\n else:\n print(\"No\")", "v1, v2, v3 = map(int, input().split())\n\nif v1 + v2 + v3 != 343:\n print(\"No\")\nelse:\n if v1 == 252:\n print(\"Yes\")\n print(\"0 0 0 0 0 7 0 7 0\")\n elif v1 == 126:\n print(\"Yes\")\n print(\"0 0 0 0 7 0 0 0 7\")\n elif v1 == 63:\n print(\"Yes\")\n print(\"0 0 0 7 0 0 0 7 0\")\n elif v1 == 294:\n print(\"Yes\")\n print(\"0 0 0 0 7 0 7 0 7\")\n elif v1 == 168:\n print(\"Yes\")\n print(\"0 0 0 0 7 7 0 0 0\")\n elif v1 == 84:\n print(\"Yes\")\n print(\"0 0 0 0 7 0 0 7 7\")\n elif v1 == 224:\n print(\"Yes\")\n print(\"0 0 0 7 0 0 7 0 7\")\n elif v1 == 49:\n print(\"Yes\")\n print(\"0 0 0 7 7 0 0 0 7\")\n elif v1 == 147:\n print(\"Yes\")\n print(\"0 0 0 7 0 7 0 7 0\")\n elif v1 == 343:\n print(\"Yes\")\n print(\"0 0 0 7 7 7 0 0 0\")\n else:\n print(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s = input()\na = s.split(\"|\")\nprint(a[0] + a[2])", "s = input()\na = s.split(\"|\")\nprint(a[0] + a[2])", "s = input()\na = s.split(\"|\")\nprint(a[0] + a[2])", "s = input()\na = s.split(\"|\")\nprint(a[0] + a[2])", "s = input()\na = s.split(\"|\")\nprint(a[0] + a[2])", "s = input()\na = s.split(\"|\")\nprint(a[0] + a[2])", "s = input()\na = s.split(\"|\")\nprint(a[0] + a[2])", "s = input()\na = s.split(\"|\")\nprint(a[0] + a[2])", "s = input()\na = s.split(\"|\")\nprint(a[0] + a[2])", "s = input()\na, b = s.find(\"|\"), s.rfind(\"|\")\nprint(s[:a] + s[b + 1 :])" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "a = []\r\nwhile True:\r\n try:\r\n x = int(input())\r\n if x == 0:\r\n break\r\n a.append(x)\r\n except:\r\n break\r\na.reverse()\r\nfor i in a:\r\n print(i)\r", "l = []\nwhile True:\n try:\n a = int(input())\n l.append(a)\n except:\n break\nl.reverse()\nfor i in l:\n print(i)", "a = []\nwhile True:\n try:\n x = int(input())\n a.append(x)\n except:\n break\na.reverse()\nfor i in a:\n print(i)", "L = []\nwhile True:\n try:\n L.append(int(input()))\n except:\n break\nL.reverse()\nfor i in L:\n print(i)", "a = []\nwhile True:\n try:\n x = int(input())\n a.append(x)\n except:\n break\na = a[::-1]\nfor i in a:\n print(i)", "a = []\nwhile True:\n try:\n x = int(input())\n if x == 0:\n break\n a.append(x)\n except:\n break\na.reverse()\nfor i in a:\n print(i)", "a = []\r\nwhile True:\r\n try:\r\n x = int(input())\r\n if x == 0:\r\n break\r\n a.append(x)\r\n except:\r\n break\r\na.reverse()\r\nfor i in a:\r\n print(i)\r", "a = []\nwhile True:\n try:\n b = int(input())\n if b == 0:\n break\n a.append(b)\n except:\n break\na.reverse()\nfor i in a:\n print(i)", "a = []\nwhile True:\n try:\n x = int(input())\n a.append(x)\n except:\n break\na.reverse()\nfor i in a:\n print(i)", "L = []\nwhile True:\n try:\n L.append(int(input()))\n except:\n break\nL.reverse()\nfor i in L:\n print(i)" ], "pass1_list": [ false, true, true, true, true, false, false, false, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\nl = int(input())\nc = list(map(int, input().split()))\nq = int(input())\nx = list(map(int, input().split()))\n\nfor i in x:\n if i in [a[j] + b[k] + c[p] for j in range(n) for k in range(m) for p in range(l)]:\n print(\"Yes\")\n else:\n print(\"No\")", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\nl = int(input())\nc = list(map(int, input().split()))\nq = int(input())\nx = list(map(int, input().split()))\n\nfor i in x:\n if i in [a[j] + b[k] + c[p] for j in range(n) for k in range(m) for p in range(l)]:\n print(\"Yes\")\n else:\n print(\"No\")", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\nl = int(input())\nc = list(map(int, input().split()))\nq = int(input())\nx = list(map(int, input().split()))\n\nfor i in x:\n if i in [x + y + z for x in a for y in b for z in c]:\n print(\"Yes\")\n else:\n print(\"No\")", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\nl = int(input())\nc = list(map(int, input().split()))\nq = int(input())\nx = list(map(int, input().split()))\n\nfor i in x:\n if i in [a[j] + b[k] + c[p] for j in range(n) for k in range(m) for p in range(l)]:\n print(\"Yes\")\n else:\n print(\"No\")", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\nl = int(input())\nc = list(map(int, input().split()))\nq = int(input())\nx = list(map(int, input().split()))\n\nfor i in x:\n if i in [a[j] + b[k] + c[p] for j in range(n) for k in range(m) for p in range(l)]:\n print(\"Yes\")\n else:\n print(\"No\")", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\nl = int(input())\nc = list(map(int, input().split()))\nq = int(input())\nx = list(map(int, input().split()))\n\nfor i in x:\n if i in [a[j] + b[k] + c[p] for j in range(n) for k in range(m) for p in range(l)]:\n print(\"Yes\")\n else:\n print(\"No\")", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\nl = int(input())\nc = list(map(int, input().split()))\nq = int(input())\nx = list(map(int, input().split()))\n\nfor i in x:\n if i in [a[j] + b[k] + c[p] for j in range(n) for k in range(m) for p in range(l)]:\n print(\"Yes\")\n else:\n print(\"No\")", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\nl = int(input())\nc = list(map(int, input().split()))\nq = int(input())\nx = list(map(int, input().split()))\n\nfor i in x:\n if i in [a[j] + b[k] + c[p] for j in range(n) for k in range(m) for p in range(l)]:\n print(\"Yes\")\n else:\n print(\"No\")", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\nl = int(input())\nc = list(map(int, input().split()))\nq = int(input())\nx = list(map(int, input().split()))\n\nfor i in x:\n if i in [a[j] + b[k] + c[p] for j in range(n) for k in range(m) for p in range(l)]:\n print(\"Yes\")\n else:\n print(\"No\")", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\nl = int(input())\nc = list(map(int, input().split()))\nq = int(input())\nx = list(map(int, input().split()))\n\nfor i in x:\n if i in [a[j] + b[k] + c[p] for j in range(n) for k in range(m) for p in range(l)]:\n print(\"Yes\")\n else:\n print(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "t = input()\r\nn = int(input())\r\ndp = [float(\"inf\")] * (len(t) + 1)\r\ndp[0] = 0\r\nfor _ in range(n):\r\n a, *s = input().split()\r\n a = int(a)\r\n for ss in s:\r\n for i in range(len(t), -1, -1):\r\n if i + len(ss) <= len(t) and t[i : i + len(ss)] == ss:\r\n dp[i + len(ss)] = min(dp[i + len(ss)], dp[i] + 1)\r\nprint(dp[-1] if dp[-1] != float(\"inf\") else -1)\r", "t = input()\r\nn = int(input())\r\ndp = [float(\"inf\")] * (len(t) + 1)\r\ndp[0] = 0\r\nfor _ in range(n):\r\n a, *s = input().split()\r\n a = int(a)\r\n for ss in s:\r\n for i in range(len(t), -1, -1):\r\n if i + len(ss) <= len(t) and t[i : i + len(ss)] == ss:\r\n dp[i + len(ss)] = min(dp[i + len(ss)], dp[i] + 1)\r\nprint(dp[-1] if dp[-1] != float(\"inf\") else -1)\r", "t = input()\nn = int(input())\ndp = [float(\"inf\")] * (len(t) + 1)\ndp[0] = 0\nfor _ in range(n):\n a, *s = input().split()\n a = int(a)\n for i in s:\n for j in range(len(t), -1, -1):\n if j + len(i) <= len(t) and t[j : j + len(i)] == i:\n dp[j + len(i)] = min(dp[j + len(i)], dp[j])\n for j in range(len(t), -1, -1):\n if j + len(i) <= len(t) and dp[j] != float(\"inf\"):\n dp[j + len(i)] = min(dp[j + len(i)], dp[j] + 1)\nprint(dp[-1] if dp[-1] != float(\"inf\") else -1)", "t = input()\nn = int(input())\n\ndp = [10**10] * (len(t) + 1)\ndp[0] = 0\n\nfor _ in range(n):\n a, *s = input().split()\n a = int(a)\n for ss in s:\n for i in range(len(t), -1, -1):\n if t[:i] + ss == t[: i + len(ss)]:\n dp[i + len(ss)] = min(dp[i + len(ss)], dp[i] + 1)\n\nprint(dp[-1] if dp[-1] < 10**10 else -1)", "t = input()\nn = int(input())\ndp = [float(\"inf\")] * (len(t) + 1)\ndp[0] = 0\nfor _ in range(n):\n a, *s = input().split()\n a = int(a)\n for i in s:\n for j in range(len(t), -1, -1):\n if j + len(i) <= len(t) and t[j:] == i:\n dp[j + len(i)] = min(dp[j + len(i)], dp[j])\n for j in range(len(t), -1, -1):\n if j + len(i) <= len(t) and t[:j] + i == t[: j + len(i)]:\n dp[j + len(i)] = min(dp[j + len(i)], dp[j] + 1)\nprint(dp[len(t)] if dp[len(t)] != float(\"inf\") else -1)", "t = input()\r\nn = int(input())\r\ndp = [float(\"inf\")] * (len(t) + 1)\r\ndp[0] = 0\r\nfor _ in range(n):\r\n a, *s = input().split()\r\n a = int(a)\r\n for i in s:\r\n for j in range(len(t), -1, -1):\r\n if j + len(i) <= len(t) and t[j : j + len(i)] == i:\r\n dp[j + len(i)] = min(dp[j + len(i)], dp[j])\r\n for i in s:\r\n for j in range(len(t), -1, -1):\r\n if j + len(i) <= len(t):\r\n dp[j + len(i)] = min(dp[j + len(i)], dp[j] + 1)\r\nprint(dp[-1] if dp[-1] != float(\"inf\") else -1)\r", "t = input()\r\nn = int(input())\r\ndp = [[0 for i in range(len(t) + 1)] for j in range(n + 1)]\r\nfor i in range(n):\r\n a, *s = input().split()\r\n a = int(a)\r\n for j in s:\r\n for k in range(len(t) + 1):\r\n if k + len(j) <= len(t) and t[k : k + len(j)] == j:\r\n dp[i + 1][k + len(j)] = min(dp[i + 1][k + len(j)], dp[i][k] + 1)\r\n dp[i + 1][k] = min(dp[i + 1][k], dp[i][k])\r\nprint(dp[n][len(t)] if dp[n][len(t)] <= n else -1)\r", "t = input()\r\nn = int(input())\r\ndp = [float(\"inf\")] * (len(t) + 1)\r\ndp[0] = 0\r\nfor _ in range(n):\r\n a, *s = input().split()\r\n a = int(a)\r\n for i in s:\r\n for j in range(len(t), -1, -1):\r\n if j + len(i) <= len(t) and t[j : j + len(i)] == i:\r\n dp[j + len(i)] = min(dp[j + len(i)], dp[j])\r\n for i in s:\r\n for j in range(len(t), -1, -1):\r\n if j + len(i) <= len(t):\r\n dp[j + len(i)] = min(dp[j + len(i)], dp[j] + 1)\r\nprint(dp[-1] if dp[-1] != float(\"inf\") else -1)\r", "t = input()\r\nn = int(input())\r\ndp = [float(\"inf\")] * (len(t) + 1)\r\ndp[0] = 0\r\nfor _ in range(n):\r\n a, *s = input().split()\r\n a = int(a)\r\n for i in s:\r\n for j in range(len(t), -1, -1):\r\n if j + len(i) <= len(t) and t[j : j + len(i)] == i:\r\n dp[j + len(i)] = min(dp[j + len(i)], dp[j])\r\n for j in range(len(t), -1, -1):\r\n if j + len(i) <= len(t) and dp[j] != float(\"inf\"):\r\n dp[j + len(i)] = min(dp[j + len(i)], dp[j] + 1)\r\nprint(dp[-1] if dp[-1] != float(\"inf\") else -1)\r", "t = input()\r\nn = int(input())\r\ndp = [float(\"inf\")] * (len(t) + 1)\r\ndp[0] = 0\r\nfor _ in range(n):\r\n a, *s = input().split()\r\n a = int(a)\r\n for i in s:\r\n for j in range(len(t), -1, -1):\r\n if t[:j] + i == t[: j + len(i)]:\r\n dp[j + len(i)] = min(dp[j + len(i)], dp[j] + 1)\r\nprint(dp[-1] if dp[-1] != float(\"inf\") else -1)\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\nN = int(input())\nA = list(map(int, input().split()))\nQ = int(input())\n\nfor _ in range(Q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n x, y = query[1:]\n A = A[: A.index(x) + 1] + [y] + A[A.index(x) + 1 :]\n else:\n x = query[1]\n A.remove(x)\n\nprint(*A)", "n = int(input())\na = list(map(int, input().split()))\nq = int(input())\n\nfor _ in range(q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n x, y = query[1:]\n a.insert(a.index(x) + 1, y)\n else:\n x = query[1]\n a.remove(x)\n\nprint(\" \".join(map(str, a)))", "n = int(input())\na = list(map(int, input().split()))\nq = int(input())\n\nfor _ in range(q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n x, y = query[1:]\n a.insert(a.index(x) + 1, y)\n else:\n x = query[1]\n a.remove(x)\n\nprint(*a)", "from collections import deque\n\nN = int(input())\nA = list(map(int, input().split()))\nQ = int(input())\n\nfor _ in range(Q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n x, y = query[1:]\n A = A[: A.index(x) + 1] + [y] + A[A.index(x) + 1 :]\n else:\n x = query[1]\n A.remove(x)\n\nprint(*A)", "n = int(input())\na = list(map(int, input().split()))\nq = int(input())\nfor _ in range(q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n x, y = query[1:]\n a = a[: a.index(x)] + [y] + a[a.index(x) :]\n else:\n x = query[1]\n a.remove(x)\nprint(*a)", "n = int(input())\na = list(map(int, input().split()))\nq = int(input())\nfor i in range(q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n x, y = query[1:]\n a.insert(a.index(x) + 1, y)\n else:\n a.remove(query[1])\nprint(*a)", "n = int(input())\na = list(map(int, input().split()))\nq = int(input())\n\nfor _ in range(q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n x, y = query[1:]\n a.insert(a.index(x) + 1, y)\n else:\n x = query[1]\n a.remove(x)\n\nprint(*a)", "n = int(input())\na = list(map(int, input().split()))\nq = int(input())\n\nfor _ in range(q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n x, y = query[1:]\n a = a[: a.index(x) + 1] + [y] + a[a.index(x) + 1 :]\n else:\n x = query[1]\n a.remove(x)\n\nprint(*a)", "from collections import deque\n\nN = int(input())\nA = list(map(int, input().split()))\nQ = int(input())\n\nfor _ in range(Q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n x, y = query[1:]\n A.insert(A.index(x) + 1, y)\n else:\n x = query[1]\n A.remove(x)\n\nprint(*A)", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\nA = list(map(int, input().split()))\nQ = int(input())\nfor _ in range(Q):\n query = list(map(int, input().split()))\n if query[0] == 1:\n x, y = query[1:]\n A.insert(A.index(x) + 1, y)\n else:\n x = query[1]\n A.remove(x)\nprint(*A)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "x = int(input())\nprint((x + 9) // 10)", "X = int(input())\nprint((X + 9) // 10)", "x = int(input())\nprint((x + 9) // 10)", "x = int(input())\nprint((x + 9) // 10)", "x = int(input())\r\nprint((x + 9) // 10)\r", "x = int(input())\nprint((x + 9) // 10)", "x = int(input())\nprint((x + 9) // 10)", "x = int(input())\nprint((x + 9) // 10)", "x = int(input())\nprint((x + 9) // 10)", "x = int(input())\nprint((x + 9) // 10)" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n, h, w = map(int, input().split())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\nfor i in range(n):\n for j in range(i + 1, n):\n if a[i][0] == a[j][1] and a[i][1] == a[j][0]:\n a[i][0], a[i][1] = a[j][0], a[j][1]\n\na.sort(key=lambda x: x[0] * x[1], reverse=True)\n\ndef dfs(i, cnt, used, h, w):\n if cnt == h * w:\n return True\n if i == n:\n return False\n if used[i]:\n return dfs(i + 1, cnt, used, h, w)\n for j in range(4):\n if a[i][0] <= h and a[i][1] <= w:\n used[i] = True\n for k in range(a[i][0]):\n for l in range(a[i][1]):\n if cnt == h * w:\n return True\n if used[cnt]:\n break\n used[cnt] = True\n cnt += 1\n if dfs(i, cnt, used, h, w):\n return True\n cnt -= 1\n used[cnt] = False\n used[i] = False\n a[i][0], a[i][1] = a[i][1], a[i][0]\n return dfs(i + 1, cnt, used, h, w)\n\nused = [False] * (n + h * w)\nif dfs(0, 0, used, h, w):\n print(\"Yes\")\nelse:\n print(\"No\")", "n, h, w = map(int, input().split())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\nfor i in range(n):\n for j in range(i + 1, n):\n if a[i][0] == a[j][0] and a[i][1] == a[j][1]:\n n -= 1\n a.remove(a[j])\n break\n\nif h % 2 == 1:\n for i in range(n):\n if a[i][0] == h and a[i][1] == 1:\n n -= 1\n a.remove(a[i])\n break\nif w % 2 == 1:\n for i in range(n):\n if a[i][0] == 1 and a[i][1] == w:\n n -= 1\n a.remove(a[i])\n break\n\nif h % 2 == 0 and w % 2 == 0:\n if h == 2 and w == 2:\n print(\"Yes\")\n else:\n print(\"No\")\nelif h % 2 == 0:\n if w % 2 == 1:\n if w == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n for i in range(n):\n if a[i][0] == h and a[i][1] == 1:\n n -= 1\n a.remove(a[i])\n break\n if w % 4 == 0:\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n if h % 2 == 1:\n if h == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n for i in range(n):\n if a[i][0] == 1 and a[i][1] == w:\n n -= 1\n a.remove(a[i])\n break\n if h % 4 == 0:\n print(\"Yes\")\n else:\n print(\"No\")", "n, h, w = map(int, input().split())\n\ntiles = []\nfor i in range(n):\n a, b = map(int, input().split())\n tiles += [(a, b), (b, a), (a, b), (b, a)]\n\ndef dfs(i, cnt, used, h, w):\n if cnt == h * w:\n return True\n if i == n:\n return False\n if used[i]:\n return dfs(i + 1, cnt, used, h, w)\n\n used[i] = True\n for j in range(4):\n for k in range(h - tiles[i][j] + 1):\n for l in range(w - tiles[i][1 - j] + 1):\n if all(used[x] or tiles[x] == (j < 2 and tiles[i][j - j % 2] - k - 1, 1 - j) or tiles[x] == (1 - j < 2 and tiles[i][j - j % 2] - 1, j + l) for x in range(n)):\n if dfs(i + 1, cnt + tiles[i][0] * tiles[i][1], used, h, w):\n return True\n used[i] = False\n return False\n\nif dfs(0, 0, [False] * n, h, w):\n print(\"Yes\")\nelse:\n print(\"No\")", "n, h, w = map(int, input().split())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\nfor i in range(n):\n for j in range(i + 1, n):\n if a[i] == a[j]:\n n -= 1\n a.pop(j)\n break\n\na.sort(key=lambda x: x[0] * x[1], reverse=True)\n\nif sum(a[0][0] * a[0][1] for a in a) < h * w:\n print(\"No\")\nelse:\n if h == 1 or w == 1:\n if len(a) == 1 and a[0][0] == h and a[0][1] == w:\n print(\"Yes\")\n else:\n print(\"No\")\n elif h == w:\n if len(a) == 1 and a[0][0] == h:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"Yes\")", "n, h, w = map(int, input().split())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\nfor i in range(n):\n for j in range(i + 1, n):\n if a[i][0] == a[j][1] and a[i][1] == a[j][0]:\n a[j][0], a[j][1] = a[j][1], a[j][0]\n\na.sort(key=lambda x: (x[0], x[1]))\n\ndef dfs(i, cnt, used, h, w):\n if cnt == h * w:\n return True\n if i == n:\n return False\n if used[i]:\n return dfs(i + 1, cnt, used, h, w)\n for j in range(4):\n if j % 2 == 0:\n if a[i][0] <= h and a[i][1] <= w:\n used[i] = True\n if dfs(i, cnt + a[i][0] * a[i][1], used, h, w):\n return True\n used[i] = False\n else:\n if a[i][0] <= w and a[i][1] <= h:\n used[i] = True\n if dfs(i, cnt + a[i][1] * a[i][0], used, h, w):\n return True\n used[i] = False\n return False\n\nused = [False] * n\nif dfs(0, 0, used, h, w):\n print(\"Yes\")\nelse:\n print(\"No\")", "n, h, w = map(int, input().split())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\nfor i in range(n):\n for j in range(i + 1, n):\n if a[i] == a[j]:\n n -= 1\n a.pop(j)\n break\n\nif h % 2 == 1 and w % 2 == 1:\n if [1, 1] in a:\n a.remove([1, 1])\n if [1, 2] in a:\n a.remove([1, 2])\n a.append([2, 1])\n if [2, 1] in a:\n a.remove([2, 1])\n a.append([1, 2])\n\nif h % 2 == 1:\n if [1, 3] in a:\n a.remove([1, 3])\n a.append([3, 1])\n if [3, 1] in a:\n a.remove([3, 1])\n a.append([1, 3])\n\nif w % 2 == 1:\n if [1, 2] in a:\n a.remove([1, 2])\n a.append([2, 1])\n if [2, 1] in a:\n a.remove([2, 1])\n a.append([1, 2])\n\nif [1, 1] in a:\n a.remove([1, 1])\n\nif h * w == sum([a[i][0] * a[i][1] for i in range(len(a))]):\n print(\"Yes\")\nelse:\n print(\"No\")", "n, h, w = map(int, input().split())\n\ntiles = []\nfor i in range(n):\n a, b = map(int, input().split())\n tiles.append([a, b])\n\nfor i in range(n):\n for j in range(i + 1, n):\n if tiles[i][0] == tiles[j][1] and tiles[i][1] == tiles[j][0]:\n tiles[j][0], tiles[j][1] = tiles[j][1], tiles[j][0]\n break\n\ndef dfs(i, cnt, used, h, w):\n if cnt == h * w:\n return True\n if i == n:\n return False\n if used[i]:\n return dfs(i + 1, cnt, used, h, w)\n\n used[i] = True\n for k in range(4):\n if k % 2 == 0:\n a, b = tiles[i][0], tiles[i][1]\n else:\n a, b = tiles[i][1], tiles[i][0]\n\n if a > h or b > w:\n continue\n\n for x in range(h - a + 1):\n for y in range(w - b + 1):\n if all(used[l] or tiles[l][0] + x > h or tiles[l][1] + y > w for l in range(i) if not (x < tiles[l][0] < x + a and y < tiles[l][1] < y + b)):\n if dfs(i, cnt + a * b, used, h, w):\n return True\n\n used[i] = False\n return False\n\nif dfs(0, 0, [False] * n, h, w):\n print(\"Yes\")\nelse:\n print(\"No\")", "n, h, w = map(int, input().split())\n\ntiles = []\nfor _ in range(n):\n a, b = map(int, input().split())\n tiles.append([a, b])\n\ndef is_valid(h, w, tiles):\n for a, b in tiles:\n if a > h or b > w:\n return False\n if sum(a for a, _ in tiles) != h or sum(b for _, b in tiles) != w:\n return False\n return True\n\ndef rotate_tile(a, b):\n return [b, a]\n\ndef flip_tile(a, b):\n return [a, b][::-1]\n\ndef solve(h, w, tiles):\n if is_valid(h, w, tiles):\n return True\n for i in range(len(tiles)):\n tiles[i] = rotate_tile(*tiles[i])\n if solve(h, w, tiles):\n return True\n tiles[i] = rotate_tile(*tiles[i])\n if solve(h, w, tiles):\n return True\n tiles[i] = flip_tile(*tiles[i])\n if solve(h, w, tiles):\n return True\n tiles[i] = rotate_tile(*tiles[i])\n if solve(h, w, tiles):\n return True\n tiles[i] = rotate_tile(*tiles[i])\n return False\n\nif solve(h, w, tiles):\n print(\"Yes\")\nelse:\n print(\"No\")", "n, h, w = map(int, input().split())\na = [list(map(int, input().split())) for i in range(n)]\n\nfor i in range(n):\n if a[i][0] > h or a[i][1] > w:\n print(\"No\")\n exit()\n\nif sum(a[i][0] * a[i][1] for i in range(n)) < h * w:\n print(\"No\")\n exit()\n\nif h % 2 == 1 and w % 2 == 1:\n if n == 1:\n if a[0][0] == 1 and a[0][1] == 1:\n print(\"Yes\")\n exit()\n if n >= 3:\n if (1, 1) in a and (a[1][0] == a[2][0] == h // 2) and (a[1][1] == a[2][1] == w // 2):\n print(\"Yes\")\n exit()\n\nif h % 2 == 1:\n if n >= 2:\n if (1, 1) in a and (a[1][0] == h // 2, w) in a:\n print(\"Yes\")\n exit()\n\nif w % 2 == 1:\n if n >= 2:\n if (1, 1) in a and (h, w // 2) in a:\n print(\"Yes\")\n exit()\n\nif h % 2 == 0 and w % 2 == 0:\n if n >= 4:\n if (1, 1) in a and (h // 2, 1) in a and (h // 2, w // 2) in a and (1, w // 2) in a:\n print(\"Yes\")\n exit()\n\nprint(\"No\")", "n, h, w = map(int, input().split())\na = [list(map(int, input().split())) for _ in range(n)]\n\nfor i in range(n):\n a[i].append(i)\na.sort(key=lambda x: x[0] * x[1])\n\ndef dfs(i, cnt, used):\n if cnt == h * w:\n return True\n if i == n:\n return False\n for j in range(4):\n if j % 2 == 0:\n x, y = a[i][0], a[i][1]\n else:\n x, y = a[i][1], a[i][0]\n if x > h or y > w:\n continue\n for k in range(h - x + 1):\n for l in range(w - y + 1):\n if any(used[k + m][l : l + y] == [i] for m in range(x)):\n break\n else:\n continue\n break\n else:\n for m in range(x):\n for k in range(l, l + y):\n used[k][m] = i\n if dfs(i + 1, cnt + x * y, used):\n return True\n for m in range(x):\n for k in range(l, l + y):\n used[k][m] = 0\n break\n return False\n\nused = [[0] * w for _ in range(h)]\nif dfs(0, 0, used):\n print(\"Yes\")\nelse:\n print(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n - 1):\n print(a[i] * a[i + 1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n - 1):\n print(a[i] * a[i + 1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n - 1):\n print(a[i] * a[i + 1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n - 1):\n print(a[i] * a[i + 1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n - 1):\n print(a[i] * a[i + 1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n - 1):\n print(a[i] * a[i + 1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n - 1):\n print(a[i] * a[i + 1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n - 1):\n print(a[i] * a[i + 1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n - 1):\n print(a[i] * a[i + 1], end=\" \")", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n - 1):\n print(a[i] * a[i + 1], end=\" \")" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "w, b = map(int, input().split())\n\ns = \"wbwbwwbwbwbw\"\n\nif s.count(\"w\", 0, w + b) == w and s.count(\"b\", 0, w + b) == b:\n print(\"Yes\")\nelse:\n for i in range(len(s)):\n if s.count(\"w\", i, i + w + b) == w and s.count(\"b\", i, i + w + b) == b:\n print(\"Yes\")\n exit()\n print(\"No\")", "w, b = map(int, input().split())\n\ns = \"wbwbwwbwbwbw\"\n\nif w == 0 and b == 0:\n print(\"No\")\nelse:\n if w + b <= 15:\n if s.count(\"w\", 0, w + b) == w and s.count(\"b\", 0, w + b) == b:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n if s.count(\"w\", 0, 15) >= w and s.count(\"b\", 0, 15) >= b:\n print(\"Yes\")\n else:\n print(\"No\")", "w, b = map(int, input().split())\ns = \"wbwbwwbwbwbw\"\n\nfor i in range(len(s)):\n if s[i:i + w + b].count(\"w\") == w and s[i:i + w + b].count(\"b\") == b:\n print(\"Yes\")\n exit()\nprint(\"No\")", "w, b = map(int, input().split())\n\ns = \"wbwbwwbwbwbw\"\n\nif w == 0 and b == 0:\n print(\"No\")\nelse:\n if w + b <= 15:\n if s.count(\"w\", 0, w + b) == w and s.count(\"b\", 0, w + b) == b:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n if s.count(\"w\", 0, 15) >= w and s.count(\"b\", 0, 15) >= b:\n print(\"Yes\")\n else:\n print(\"No\")", "w, b = map(int, input().split())\n\ns = \"wbwbwwbwbwbw\"\n\nif w == 0 and b == 0:\n print(\"No\")\nelse:\n if w + b <= 15:\n if s.count(\"w\", 0, w + b) == w and s.count(\"b\", 0, w + b) == b:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n if s.count(\"w\", 0, 15) >= w and s.count(\"b\", 0, 15) >= b:\n print(\"Yes\")\n else:\n print(\"No\")", "w, b = map(int, input().split())\ns = \"wbwbwwbwbwbw\"\n\nif w == 0 and b == 0:\n print(\"No\")\nelif w == 0:\n if \"b\" * b in s:\n print(\"Yes\")\n else:\n print(\"No\")\nelif b == 0:\n if \"w\" * w in s:\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n for i in range(len(s)):\n if \"w\" * w in s[i:] and \"b\" * b in s[i:]:\n print(\"Yes\")\n break\n else:\n print(\"No\")", "w, b = map(int, input().split())\ns = \"wbwbwwbwbwbw\"\nfor i in range(len(s)):\n if s[i:i + w + b].count(\"w\") == w and s[i:i + w + b].count(\"b\") == b:\n print(\"Yes\")\n break\nelse:\n print(\"No\")", "w, b = map(int, input().split())\n\ns = \"wbwbwwbwbwbw\"\n\nif w == 0 and b == 0:\n print(\"No\")\nelse:\n flag = False\n for i in range(len(s)):\n if w == 0 and b == 0:\n flag = True\n break\n elif w == 0 or b == 0:\n continue\n elif w + b > len(s) - i:\n break\n else:\n cnt = 0\n for j in range(i, i + w + b):\n if s[j] == \"w\":\n cnt += 1\n if cnt == w:\n flag = True\n break\n if flag:\n break\n print(\"Yes\" if flag else \"No\")", "w, b = map(int, input().split())\n\ns = \"wbwbwwbwbwbw\"\n\nif w == 0 and b == 0:\n print(\"No\")\nelif w == 0:\n if b % 2 == 0:\n print(\"Yes\")\n else:\n print(\"No\")\nelif b == 0:\n if w % 2 == 0:\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n if w % 2 == 0 and b % 2 == 0:\n print(\"Yes\")\n elif w % 2 == 1 and b % 2 == 1:\n print(\"Yes\")\n else:\n print(\"No\")", "w, b = map(int, input().split())\n\ns = \"wbwbwwbwbwbw\"\n\nif w == 0 and b == 0:\n print(\"No\")\nelif w == 0:\n if b % 2 == 0:\n print(\"Yes\")\n else:\n print(\"No\")\nelif b == 0:\n if w % 2 == 0:\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n if (w + b) % 15 == 0:\n print(\"Yes\")\n else:\n print(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, k = map(int, input().split())\na = list(map(int, input().split()))\nb = set(a)\ns = 0\nfor i in range(1, k + 1):\n if i not in b:\n s += i\nprint(s)", "n, k = map(int, input().split())\na = set(map(int, input().split()))\nans = 0\nfor i in range(1, k + 1):\n if i not in a:\n ans += i\nprint(ans)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\ns = set(a)\nans = 0\nfor i in range(1, k + 1):\n if i not in s:\n ans += i\nprint(ans)", "n, k = map(int, input().split())\na = set(map(int, input().split()))\nprint(sum(i for i in range(1, k + 1) if i not in a))", "n, k = map(int, input().split())\na = set(map(int, input().split()))\ns = 0\nfor i in range(1, k + 1):\n if i not in a:\n s += i\nprint(s)", "n, k = map(int, input().split())\na = set(map(int, input().split()))\nprint(sum(i for i in range(1, k + 1) if i not in a))", "n, k = map(int, input().split())\na = set(map(int, input().split()))\nprint(sum(i for i in range(1, k + 1) if i not in a))", "n, k = map(int, input().split())\na = set(map(int, input().split()))\nprint((k * (k + 1)) // 2 - sum(a & set(range(1, k + 1))))", "n, k = map(int, input().split())\na = list(map(int, input().split()))\ns = set(a)\nans = 0\nfor i in range(1, k + 1):\n if i not in s:\n ans += i\nprint(ans)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\ns = set(a)\nans = 0\nfor i in range(1, k + 1):\n if i not in s:\n ans += i\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ns = input()\nc = list(map(int, input().split()))\n\nif s[0] == s[1]:\n ans = 0\n for i in range(1, n):\n if s[i] != s[i - 1]:\n ans += c[i]\n break\nelse:\n ans = min(c[0], c[1])\n\nfor i in range(2, n):\n if s[i] == s[i - 1]:\n if s[i] != s[i - 2]:\n ans += c[i]\n else:\n ans += min(c[i], c[i - 1])\n else:\n ans += min(c[i], c[i - 1])\n\nprint(ans)", "n = int(input())\ns = input()\nc = list(map(int, input().split()))\n\nif s[0] == s[1]:\n ans = 0\n for i in range(n - 1):\n if s[i] == s[i + 1]:\n ans += c[i]\n print(ans)\nelse:\n ans = min(c[0], c[1])\n for i in range(2, n - 1):\n if s[i] == s[i - 1]:\n ans += c[i]\n elif s[i] == s[i - 2]:\n ans += min(c[i - 1], c[i])\n else:\n ans = min(ans + c[i - 1], c[i - 1] + c[i])\n if s[n - 1] == s[n - 2]:\n ans += 0\n else:\n ans += c[n - 1]\n print(ans)", "n = int(input())\ns = input()\nc = list(map(int, input().split()))\n\nif s[0] == s[1]:\n ans = 0\n for i in range(1, n):\n if s[i] != s[i - 1]:\n ans += c[i]\n break\nelse:\n ans = min(c[0], c[1])\n\nfor i in range(2, n):\n if s[i] == s[i - 1]:\n if s[i] != s[i - 2]:\n ans += c[i]\n else:\n ans += min(c[i], c[i - 1])\n else:\n ans += min(c[i], c[i - 1])\n\nprint(ans)", "n = int(input())\ns = input()\nc = list(map(int, input().split()))\n\nif s[0] == s[1]:\n ans = 0\n for i in range(1, n):\n if s[i] != s[i - 1]:\n ans += c[i]\n break\nelse:\n ans = c[0] + c[1]\n\nfor i in range(2, n):\n if s[i] == s[i - 1]:\n ans += min(c[i - 1], c[i])\n elif s[i] == s[i - 2]:\n ans += c[i - 1]\n\nprint(ans)", "n = int(input())\ns = input()\nc = list(map(int, input().split()))\n\nif s[0] == s[1]:\n ans = 0\n for i in range(1, n):\n if s[i] != s[i - 1]:\n ans += c[i]\n break\nelse:\n ans = min(c[0], c[1])\n for i in range(2, n):\n if s[i] != s[i - 1]:\n ans += c[i]\n break\n else:\n ans += min(c[i - 1], c[i])\n\nfor i in range(n - 1):\n if s[i] == s[i + 1]:\n ans = min(ans, c[i])\n\nprint(ans)", "n = int(input())\r\ns = input()\r\nc = list(map(int, input().split()))\r\n\r\nif s[0] == s[1]:\r\n ans = 0\r\n for i in range(n):\r\n if s[i] != s[i - 1]:\r\n ans += c[i]\r\nelse:\r\n ans = c[0] + c[1]\r\n for i in range(2, n):\r\n if s[i] != s[i - 1]:\r\n ans += c[i]\r\n\r\nprint(ans)\r", "n = int(input())\ns = input()\nc = list(map(int, input().split()))\n\nif s[0] == s[1]:\n ans = 0\n for i in range(1, n):\n if s[i] != s[i - 1]:\n ans += c[i]\n break\nelse:\n ans = c[0] + c[1]\n\nfor i in range(2, n):\n if s[i] == s[i - 1]:\n ans += min(c[i - 1], c[i])\n else:\n ans += c[i]\n\nprint(ans)", "n = int(input())\ns = input()\nc = list(map(int, input().split()))\n\nif s[0] == s[1]:\n ans = 0\n for i in range(1, n):\n if s[i] != s[i - 1]:\n ans += c[i]\n break\nelse:\n ans = min(c[0], c[1])\n\nfor i in range(2, n):\n if s[i] == s[i - 1]:\n ans += c[i]\n elif s[i - 2] != s[i - 1]:\n ans = min(ans, c[i - 1] + c[i])\n else:\n ans = min(ans, c[i - 2] + c[i])\n\nprint(ans)", "n = int(input())\ns = input()\nc = list(map(int, input().split()))\n\nif s[0] == s[1]:\n ans = 0\n for i in range(1, n):\n if s[i] != s[i - 1]:\n ans += c[i]\n break\nelse:\n ans = min(c[0], c[1])\n\nfor i in range(2, n - 1):\n if s[i] == s[i - 1]:\n ans += c[i]\n elif s[i] == s[i - 2]:\n ans = min(ans, ans + c[i - 1] + c[i])\n else:\n ans = min(ans, ans + min(c[i - 1], c[i]))\n\nif s[-1] == s[-2]:\n ans += 0\nelse:\n ans += c[-1]\n\nprint(ans)", "n = int(input())\ns = input()\nc = list(map(int, input().split()))\n\nif s[0] == s[1]:\n ans = 0\n for i in range(1, n):\n if s[i] != s[i - 1]:\n ans += c[i]\n break\nelse:\n ans = min(c[0], c[1])\n\nfor i in range(2, n - 1):\n if s[i] == s[i - 1]:\n ans += c[i]\n elif s[i] == s[i - 2]:\n ans += min(c[i - 1], c[i])\n else:\n ans += min(c[i - 1], c[i])\n\nif s[-1] == s[-2]:\n pass\nelif s[-2] == s[-3]:\n ans += c[-2]\nelse:\n ans += min(c[-2], c[-1])\n\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n(H, W, M) = map(int, input().split())\ngrid = [0] * (H * W)\nrow = [0] * (H + 1)\ncol = [0] * (W + 1)\ncolor = {}\nfor i in range(M):\n (t, a, x) = map(int, input().split())\n if t == 1:\n row[a] = x\n else:\n col[a] = x\n if row[a] or col[a]:\n color[row[a] or col[a]] = color.get(row[a] or col[a], 0) + 1\nans = []\nfor i in range(H):\n for j in range(W):\n if grid[i * W + j] == 0:\n grid[i * W + j] = row[i] or col[j]\n if grid[i * W + j]:\n color[grid[i * W + j]] = color.get(grid[i * W + j], 0) + 1\nprint(len(color))\nfor i in sorted(color.keys()):\n print(i, color[i] * (H * W))", "h, w, m = map(int, input().split())\ngrid = [[0] * w for _ in range(h)]\ncolor_count = {}\n\nfor _ in range(m):\n t, a, x = map(int, input().split())\n if t == 1:\n for j in range(w):\n grid[a - 1][j] = x\n else:\n for i in range(h):\n grid[i][a - 1] = x\n color_count[x] = color_count.get(x, 0) + 1\n\ncolor_list = sorted(color_count.keys())\nprint(len(color_list))\nfor c in color_list:\n print(c, color_count[c] * (h if c != 0 else w))", "h, w, m = map(int, input().split())\n\nrow = [0] * (h + 1)\ncol = [0] * (w + 1)\ncolor = {}\n\nfor _ in range(m):\n t, a, x = map(int, input().split())\n if t == 1:\n row[a] = x\n else:\n col[a] = x\n\nfor i in range(1, h + 1):\n c = row[i]\n if c != 0:\n color[c] = color.get(c, 0) + 1\n\nfor i in range(1, w + 1):\n c = col[i]\n if c != 0:\n color[c] = color.get(c, 0) + 1\n\ncolor[0] = h * w - sum(color.values())\n\nprint(len(color))\nfor c in sorted(color.keys()):\n print(c, color[c])", "import sys\n\ninput = sys.stdin.readline\n(h, w, m) = map(int, input().split())\ncolor = [0] * (2 * 10**5 + 1)\ncolor[0] = h * w\nfor _ in range(m):\n (t, a, x) = map(int, input().split())\n if t == 1:\n color[x] += a * w\n color[0] -= a * w\n else:\n color[x] += a * h\n color[0] -= a * h\nans = []\nfor i in range(2 * 10**5 + 1):\n if color[i] > 0:\n ans.append(str(i) + \" \" + str(color[i]))\nans.sort()\nprint(len(ans))\nprint(\"\\n\".join(ans))", "from collections import Counter\n\n(h, w, m) = map(int, input().split())\ngrid = [[0] * w for _ in range(h)]\ncolor_count = Counter()\nfor _ in range(m):\n (t, a, x) = map(int, input().split())\n if t == 1:\n grid[a - 1] = [x] * w\n else:\n for i in range(h):\n grid[i][a - 1] = x\n color_count[x] += 1\n\ncolors = sorted(color_count.keys())\nprint(len(colors))\nfor c in colors:\n print(c, color_count[c])", "from collections import Counter\n\n(h, w, m) = map(int, input().split())\ngrid = Counter([0] * (h * w))\nfor _ in range(m):\n (t, a, x) = map(int, input().split())\n if t == 1:\n grid[x] += w\n else:\n grid[x] += h\n\nprint(len(grid))\nfor c, n in sorted(grid.items()):\n print(c, n)", "from collections import Counter\n\n(h, w, m) = map(int, input().split())\ngrid = Counter([0] * (h * w))\nfor _ in range(m):\n (t, a, x) = map(int, input().split())\n if t == 1:\n grid[x] += w\n else:\n grid[x] += h\n\nprint(len(grid))\nfor c, n in sorted(grid.items()):\n print(c, n)", "from collections import Counter\n\n(h, w, m) = map(int, input().split())\ngrid = [[0] * w for _ in range(h)]\nfor _ in range(m):\n (t, a, x) = map(int, input().split())\n if t == 1:\n grid[a - 1] = [x] * w\n else:\n for i in range(h):\n grid[i][a - 1] = x\ncolors = Counter(sum(grid, []))\nprint(len(colors))\nfor c in sorted(colors):\n print(c, colors[c] * (h if c != 0 else w))", "from collections import defaultdict\n\nh, w, m = map(int, input().split())\n\ngrid = defaultdict(int)\n\nfor _ in range(m):\n t, a, x = map(int, input().split())\n if t == 1:\n grid[x] += w\n else:\n grid[x] += h\n\ngrid[0] += h * w\n\nprint(len(grid))\nfor k, v in sorted(grid.items()):\n print(k, v)", "from collections import Counter\n\n(h, w, m) = map(int, input().split())\ngrid = Counter({0: h * w})\nfor _ in range(m):\n (t, a, x) = map(int, input().split())\n if t == 1:\n if x in grid:\n grid[x] -= 1\n grid[x] += w\n else:\n if x in grid:\n grid[x] -= 1\n grid[x] += h\nprint(len(grid) - 1)\nfor c, n in sorted(grid.items()):\n if c != 0:\n print(c, n)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nans = sorted([i // k for i in a if i % k == 0])\r\n\r\nprint(*ans)\r", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = sorted([i // k for i in a if i % k == 0])\r\nprint(*ans)\r", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = sorted([i // k for i in a if i % k == 0])\r\nprint(*ans)\r", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = sorted([i // k for i in a if i % k == 0])\r\nprint(*ans)\r", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = sorted([i // k for i in a if i % k == 0])\r\nprint(*ans)\r", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = sorted([i // k for i in a if i % k == 0])\r\nprint(*ans)\r", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = sorted([i // k for i in a if i % k == 0])\r\nprint(*ans)\r", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = sorted([i // k for i in a if i % k == 0])\r\nprint(*ans)\r", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = sorted([i // k for i in a if i % k == 0])\r\nprint(*ans)\r", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = sorted([i // k for i in a if i % k == 0])\r\nprint(*ans)\r" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "s = input()\nn = len(s)\nans = 0\r\n\r\nfor i in range(n):\r\n ans += i + 1\r\n ans += n - i\r\n\r\nprint(ans)", "s = input()\nn = len(s)\nans = n * (n + 1) // 2\nprint(ans)", "s = input()\nn = len(s)\nprint(n * (n + 1) // 2)", "s = input()\nn = len(s)\nans = 0\nfor i in range(n):\n ans += i + 1\nfor i in range(n - 1):\n ans += n - i - 1\nprint(ans)", "s = input()\nn = len(s)\nprint(n * (n + 1) // 2)", "s = input()\nn = len(s)\nprint(n * (n + 1) // 2)", "s = input()\nn = len(s)\nans = 0\nfor i in range(n):\n ans += i + 1\nfor i in range(n - 1):\n ans += n - i - 1\nprint(ans)", "s = input()\nn = len(s)\nans = 0\nfor i in range(n):\n ans += i + 1\n ans += n - i\nprint(ans)", "s = input()\nn = len(s)\nprint(n * (n + 1) // 2)", "s = input()\nn = len(s)\nprint(n * (n + 1) // 2)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, a, b = map(int, input().split())\nd = list(map(int, input().split()))\nfor i in d:\n if i > a:\n print(\"No\")\n break\n elif i == a:\n if d.index(i) == len(d) - 1:\n print(\"Yes\")\n else:\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "n, a, b = map(int, input().split())\nd = list(map(int, input().split()))\nfor i in d:\n if i > a:\n print(\"No\")\n break\n if i == a:\n print(\"Yes\")\n break\nelse:\n print(\"Yes\")", "n, a, b = map(int, input().split())\nd = list(map(int, input().split()))\nfor i in range(n):\n d[i] = (d[i] - 1) % (a + b)\nif all((d[i] < a for i in range(n))):\n print(\"Yes\")\nelse:\n print(\"No\")", "n, a, b = map(int, input().split())\nd = list(map(int, input().split()))\nfor i in d:\n if i > a:\n print(\"No\")\n break\n elif i == a:\n a += b\nelse:\n print(\"Yes\")", "n, a, b = map(int, input().split())\nd = list(map(int, input().split()))\nfor i in d:\n if i > a or i % (a + b) > a:\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "n, a, b = map(int, input().split())\nd = list(map(int, input().split()))\nfor i in range(n):\n if d[i] > a:\n print(\"No\")\n exit()\n d[i] = d[i] - a\n if d[i] < 0:\n d[i] = d[i] + a + b\nfor i in range(n - 1):\n if d[i] >= a and d[i + 1] < a:\n print(\"No\")\n exit()\nprint(\"Yes\")", "n, a, b = map(int, input().split())\nd = list(map(int, input().split()))\nfor i in d:\n if i > a or i % (a + b) > a:\n print(\"No\")\n exit()\nprint(\"Yes\")", "n, a, b = map(int, input().split())\nd = list(map(int, input().split()))\nfor i in d:\n if i > a:\n print(\"No\")\n break\n if i == a:\n a += b\nelse:\n print(\"Yes\")", "(n, a, b) = map(int, input().split())\nd = list(map(int, input().split()))\nfor i in d:\n if i > a:\n print(\"No\")\n break\n if i == a:\n a += b\nelse:\n print(\"Yes\")", "n, a, b = map(int, input().split())\nd = list(map(int, input().split()))\nfor i in range(n):\n if d[i] > a:\n print(\"No\")\n break\n if i == n - 1:\n print(\"Yes\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\nx = list(map(int, input().split()))\ns = set()\na = [0] * (n + 1)\nfor i in x:\n if i in s:\n s.remove(i)\n a[i] -= len(s)\n else:\n s.add(i)\n a[i] += len(s)\nprint(*a[1:])", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\na = [0] * n\ns = set()\nfor i in range(q):\n x = int(input())\n if x in s:\n s.remove(x)\n else:\n s.add(x)\n for j in s:\n a[j - 1] += len(s)\nprint(*a)", "from collections import defaultdict\n\n(n, q) = map(int, input().split())\ns = set()\nd = defaultdict(int)\nfor x in map(int, input().split()):\n if x in s:\n s.remove(x)\n else:\n s.add(x)\n d[x] += len(s)\nprint(*[d[i + 1] for i in range(n)])", "import sys\n\ninput = sys.stdin.readline\n(N, Q) = map(int, input().split())\nX = list(map(int, input().split()))\nA = [0] * N\nS = set()\nfor i in range(Q):\n x = X[i]\n if x in S:\n S.remove(x)\n else:\n S.add(x)\n for j in range(N):\n if j + 1 in S:\n A[j] += len(S)\nprint(*A)", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\nx = list(map(int, input().split()))\na = [0] * (n + 1)\ns = set()\nfor i in x:\n if i in s:\n s.remove(i)\n else:\n s.add(i)\n for j in s:\n a[j] += len(s)\nprint(*a[1:])", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\nx = list(map(int, input().split()))\na = [0] * n\ns = set()\nfor i in range(q):\n if x[i] in s:\n s.remove(x[i])\n else:\n s.add(x[i])\n for j in s:\n a[j - 1] += len(s)\nprint(*a)", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\nx = list(map(int, input().split()))\na = [0] * n\ns = set()\nfor i in range(q):\n if x[i] in s:\n s.remove(x[i])\n else:\n s.add(x[i])\n for j in s:\n a[j - 1] += len(s)\nprint(*a)", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\na = [0] * n\ns = set()\nfor x in map(int, input().split()):\n if x in s:\n s.remove(x)\n else:\n s.add(x)\n for j in range(n):\n if j + 1 in s:\n a[j] += len(s)\nprint(*a)", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\na = [0] * n\ns = set()\nfor x in map(int, input().split()):\n if x in s:\n s.remove(x)\n else:\n s.add(x)\n for j in range(n):\n if j + 1 in s:\n a[j] += len(s)\nprint(*a)", "import sys\n\ninput = sys.stdin.readline\n(n, q) = map(int, input().split())\na = [0] * n\ns = set()\nfor i in range(q):\n x = int(input())\n if x in s:\n s.remove(x)\n else:\n s.add(x)\n for j in s:\n a[j - 1] += len(s)\nprint(*a)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\nfor i in range(n):\n if i % 3 == 0:\n print(\"x\", end=\"\")\n else:\n print(\"o\", end=\"\")", "n = int(input())\r\nfor i in range(n):\r\n if i % 3 == 0:\r\n print(\"x\", end=\"\")\r\n else:\r\n print(\"o\", end=\"\")\r", "n = int(input())\r\nfor i in range(n):\r\n if i % 3 == 0:\r\n print(\"x\", end=\"\")\r\n else:\r\n print(\"o\", end=\"\")\r", "n = int(input())\r\nfor i in range(n):\r\n if i % 3 == 0:\r\n print(\"x\", end=\"\")\r\n else:\r\n print(\"o\", end=\"\")\r", "n = int(input())\r\nfor i in range(n):\r\n if i % 3 == 0:\r\n print(\"x\", end=\"\")\r\n else:\r\n print(\"o\", end=\"\")\r", "n = int(input())\nfor i in range(n):\n if i % 3 == 0:\n print(\"x\", end=\"\")\n else:\n print(\"o\", end=\"\")", "n = int(input())\r\nfor i in range(n):\r\n if i % 3 == 0:\r\n print(\"x\", end=\"\")\r\n else:\r\n print(\"o\", end=\"\")\r", "n = int(input())\r\nfor i in range(n):\r\n if i % 3 == 0:\r\n print(\"x\", end=\"\")\r\n else:\r\n print(\"o\", end=\"\")\r", "n = int(input())\r\nfor i in range(n):\r\n if i % 3 == 0:\r\n print(\"x\", end=\"\")\r\n else:\r\n print(\"o\", end=\"\")\r", "n = int(input())\r\nfor i in range(n):\r\n if i % 3 == 0:\r\n print(\"x\", end=\"\")\r\n else:\r\n print(\"o\", end=\"\")\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\npoints = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n points.append((x, y))\r\n\r\ndef distance(p1, p2):\r\n return ((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2) ** 0.5\r\n\r\nfor i in range(n):\r\n farthest_dist = 0\r\n farthest_id = 0\r\n for j in range(n):\r\n if i != j:\r\n dist = distance(points[i], points[j])\r\n if dist > farthest_dist or (dist == farthest_dist and j < farthest_id):\r\n farthest_dist = dist\r\n farthest_id = j + 1\r\n print(farthest_id)\r", "n = int(input())\r\npoints = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n points.append((x, y))\r\n\r\nfor i in range(n):\r\n max_dist = 0\r\n max_id = 1\r\n for j in range(n):\r\n if i != j:\r\n dist = (points[i][0] - points[j][0]) ** 2 + (points[i][1] - points[j][1]) ** 2\r\n if dist > max_dist:\r\n max_dist = dist\r\n max_id = j + 1\r\n print(max_id)\r", "n = int(input())\r\npoints = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n points.append([x, y, i + 1])\r\n\r\nfor i in range(n):\r\n max_dist = 0\r\n min_id = i + 1\r\n for j in range(n):\r\n if i != j:\r\n dist = (points[i][0] - points[j][0]) ** 2 + (points[i][1] - points[j][1]) ** 2\r\n if dist > max_dist:\r\n max_dist = dist\r\n min_id = points[j][2]\r\n print(min_id)\r", "n = int(input())\r\npoints = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n points.append((x, y, i + 1))\r\n\r\nfor i in range(n):\r\n farthest_dist = 0\r\n farthest_id = 1\r\n for x, y, id in points:\r\n if i != id - 1:\r\n dist = (x - points[i][0]) ** 2 + (y - points[i][1]) ** 2\r\n if dist > farthest_dist:\r\n farthest_dist = dist\r\n farthest_id = id\r\n print(farthest_id)\r", "n = int(input())\r\npoints = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n points.append((x, y, i + 1))\r\n\r\nfor i in range(n):\r\n max_dist = 0\r\n farthest_id = 1\r\n for x, y, id in points:\r\n if id != i + 1:\r\n dist = (x - points[i][0]) ** 2 + (y - points[i][1]) ** 2\r\n if dist > max_dist:\r\n max_dist = dist\r\n farthest_id = id\r\n print(farthest_id)\r", "n = int(input())\r\npoints = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n points.append([x, y, i + 1])\r\n\r\nfor i in range(n):\r\n max_dist = 0\r\n farthest_point = 1\r\n for j in range(n):\r\n if i != j:\r\n dist = (points[i][0] - points[j][0]) ** 2 + (points[i][1] - points[j][1]) ** 2\r\n if dist > max_dist:\r\n max_dist = dist\r\n farthest_point = points[j][2]\r\n print(farthest_point)\r", "n = int(input())\r\npoints = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n points.append((x, y))\r\n\r\nfor i in range(n):\r\n max_dist = 0\r\n max_id = 0\r\n for j in range(n):\r\n if i != j:\r\n dist = (points[i][0] - points[j][0]) ** 2 + (points[i][1] - points[j][1]) ** 2\r\n if dist > max_dist:\r\n max_dist = dist\r\n max_id = j + 1\r\n print(max_id)\r", "n = int(input())\r\npoints = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n points.append((x, y))\r\n\r\ndef distance(p1, p2):\r\n return ((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2) ** 0.5\r\n\r\nfor i in range(n):\r\n farthest_dist = 0\r\n farthest_id = 1\r\n for j in range(n):\r\n if i != j:\r\n d = distance(points[i], points[j])\r\n if d > farthest_dist:\r\n farthest_dist = d\r\n farthest_id = j + 1\r\n print(farthest_id)\r", "n = int(input())\r\npoints = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n points.append((x, y, i + 1))\r\n\r\nfor i in range(n):\r\n max_dist = 0\r\n farthest_id = 1\r\n for x, y, id in points:\r\n if i != id - 1:\r\n dist = (x - points[i][0]) ** 2 + (y - points[i][1]) ** 2\r\n if dist > max_dist:\r\n max_dist = dist\r\n farthest_id = id\r\n print(farthest_id)\r", "n = int(input())\r\npoints = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n points.append((x, y))\r\n\r\ndef distance(p1, p2):\r\n return ((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2) ** 0.5\r\n\r\nfor i in range(n):\r\n farthest_dist = 0\r\n farthest_id = 0\r\n for j in range(n):\r\n if i != j:\r\n dist = distance(points[i], points[j])\r\n if dist > farthest_dist or (dist == farthest_dist and j < farthest_id):\r\n farthest_dist = dist\r\n farthest_id = j + 1\r\n print(farthest_id)\r" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\na.sort(key=lambda x: x[0])\nb = []\nfor i in a:\n b.append(i[1])\nc = []\nfor i in range(n):\n if b[i] not in c:\n c.append(b[i])\nc.sort()\nd = []\nfor i in c:\n d.append(a[b.index(i)][0])\nprint(max(d))", "n = int(input())\n\ncolor_dict = {}\n\nfor i in range(n):\n a, c = map(int, input().split())\n if c not in color_dict:\n color_dict[c] = a\n else:\n color_dict[c] = min(color_dict[c], a)\n\nprint(max(color_dict.values()))", "n = int(input())\na = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append([y, x])\na.sort(key=lambda x: x[1])\nans = 0\nfor i in range(n - 1, -1, -1):\n if a[i][1] > ans:\n ans = a[i][1]\nprint(ans)", "n = int(input())\nac = []\nfor i in range(n):\n a, c = map(int, input().split())\n ac.append((a, c))\nac.sort(reverse=True)\n\ncolor = {}\nfor a, c in ac:\n if c not in color:\n color[c] = a\n\nans = 0\nfor a in color.values():\n ans = max(ans, a)\nprint(ans)", "n = int(input())\na = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append([x, y])\na.sort(key=lambda x: x[0])\n\nd = {}\nfor i in a:\n if i[1] not in d:\n d[i[1]] = i[0]\n else:\n d[i[1]] = min(d[i[1]], i[0])\n\nprint(max(d.values()))", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\na.sort(key=lambda x: x[0])\nb = []\nfor i in range(n):\n if a[i][1] not in b:\n b.append(a[i][1])\nans = 0\nfor i in b:\n j = 0\n while j < n:\n if a[j][1] == i:\n ans = max(ans, a[j][0])\n break\n j += 1\nprint(ans)", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\na.sort(key=lambda x: x[0])\nd = {}\nfor i in a:\n if i[1] not in d:\n d[i[1]] = i[0]\n else:\n d[i[1]] = min(d[i[1]], i[0])\nprint(max(d.values()))", "n = int(input())\n\nbeans = []\nfor i in range(n):\n a, c = map(int, input().split())\n beans.append((a, c))\n\nbeans.sort(reverse=True)\n\ncolor_dict = {}\nfor bean in beans:\n a, c = bean\n if c not in color_dict:\n color_dict[c] = a\n\nprint(max(color_dict.values()))", "n = int(input())\nac = []\nfor i in range(n):\n a, c = map(int, input().split())\n ac.append((a, c))\nac.sort(reverse=True)\n\ncolor = {}\nfor a, c in ac:\n if c not in color:\n color[c] = a\n\nans = 0\nfor a in color.values():\n ans = max(ans, a)\nprint(ans)", "n = int(input())\n\nbeans = []\nfor _ in range(n):\n a, c = map(int, input().split())\n beans.append((a, c))\n\nbeans.sort(reverse=True)\n\ncolor_dict = {}\nfor a, c in beans:\n if c not in color_dict:\n color_dict[c] = a\n\nprint(max(color_dict.values()))" ], "pass1_list": [ false, true, false, false, true, false, true, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\n(H, W) = map(int, input().split())\ngrid = [list(input()) for _ in range(H)]\nN = int(input())\nmeds = [list(map(int, input().split())) for _ in range(N)]\n\nstart = (None, None)\ngoal = (None, None)\nfor i in range(H):\n for j in range(W):\n if grid[i][j] == \"S\":\n start = (i, j)\n grid[i][j] = \".\"\n elif grid[i][j] == \"T\":\n goal = (i, j)\n grid[i][j] = \".\"\n\ndist = [[-1] * W for _ in range(H)]\ndist[start[0]][start[1]] = 0\nq = deque([start])\nwhile q:\n (i, j) = q.popleft()\n for ni, nj in ((i + 1, j), (i - 1, j), (i, j + 1), (i, j - 1)):\n if 0 <= ni < H and 0 <= nj < W and grid[ni][nj] == \".\":\n if dist[ni][nj] == -1 or dist[ni][nj] > dist[i][j] + 1:\n dist[ni][nj] = dist[i][j] + 1\n q.append((ni, nj))\n\nif dist[goal[0]][goal[1]] == -1:\n print(\"No\")\nelse:\n print(\"Yes\")", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = [list(input()) for _ in range(h)]\nn = int(input())\nmeds = [list(map(int, input().split())) for _ in range(n)]\n\nstart = (None, None)\ngoal = (None, None)\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \"S\":\n start = (i, j)\n grid[i][j] = \".\"\n elif grid[i][j] == \"T\":\n goal = (i, j)\n grid[i][j] = \".\"\n\ndist = [[-1] * w for _ in range(h)]\ndist[start[0]][start[1]] = 0\nq = deque([start])\nwhile q:\n (i, j) = q.popleft()\n for ni, nj in ((i + 1, j), (i - 1, j), (i, j + 1), (i, j - 1)):\n if 0 <= ni < h and 0 <= nj < w and grid[ni][nj] == \".\":\n if dist[ni][nj] == -1 or dist[ni][nj] > dist[i][j] + 1:\n dist[ni][nj] = dist[i][j] + 1\n q.append((ni, nj))\n\nfor med in meds:\n (ri, rj, re) = med\n if dist[ri][rj] != -1 and dist[goal[0]][goal[1]] > re - dist[ri][rj]:\n print(\"No\")\n break\nelse:\n print(\"Yes\" if dist[goal[0]][goal[1]] != -1 else \"No\")", "from collections import deque\n\nh, w = map(int, input().split())\ngrid = [input() for _ in range(h)]\nn = int(input())\nmed = [list(map(int, input().split())) for _ in range(n)]\n\nsy, sx, gy, gx = -1, -1, -1, -1\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \"S\":\n sy, sx = i, j\n elif grid[i][j] == \"T\":\n gy, gx = i, j\n\ndist = [[10**9] * w for _ in range(h)]\ndist[sy][sx] = 0\nq = deque([(sy, sx, 0)])\nwhile q:\n y, x, e = q.popleft()\n for i, j, d in med:\n if e + d < dist[i][j]:\n dist[i][j] = e + d\n q.append((i, j, dist[i][j]))\n for dy, dx in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n ny, nx = y + dy, x + dx\n if 0 <= ny < h and 0 <= nx < w and grid[ny][nx] != \"#\":\n if dist[y][x] + 1 < dist[ny][nx]:\n dist[ny][nx] = dist[y][x] + 1\n q.append((ny, nx, dist[ny][nx]))\n\nif dist[gy][gx] <= h + w:\n print(\"Yes\")\nelse:\n print(\"No\")", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = [input() for _ in range(h)]\nn = int(input())\nmeds = [list(map(int, input().split())) for _ in range(n)]\ns = (0, 0)\nt = (0, 0)\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \"S\":\n s = (i, j)\n elif grid[i][j] == \"T\":\n t = (i, j)\ndist = [[-1] * w for _ in range(h)]\ndist[s[0]][s[1]] = 0\nq = deque([s])\nwhile q:\n (i, j) = q.popleft()\n for ni, nj in ((i + 1, j), (i - 1, j), (i, j + 1), (i, j - 1)):\n if 0 <= ni < h and 0 <= nj < w and grid[ni][nj] != \"#\":\n if dist[ni][nj] == -1 or dist[ni][nj] > dist[i][j] + 1:\n dist[ni][nj] = dist[i][j] + 1\n q.append((ni, nj))\nans = \"No\"\nfor r, c, e in meds:\n r -= 1\n c -= 1\n if dist[r][c] != -1 and dist[t[0]][t[1]] <= dist[r][c] + e:\n ans = \"Yes\"\nprint(ans)", "from collections import deque\n\n(H, W) = map(int, input().split())\nA = [input() for _ in range(H)]\nN = int(input())\nmed = [list(map(int, input().split())) for _ in range(N)]\n\nsy = sx = -1\nty = tx = -1\nfor i in range(H):\n for j in range(W):\n if A[i][j] == \"S\":\n (sy, sx) = (i, j)\n elif A[i][j] == \"T\":\n (ty, tx) = (i, j)\n\ndist = [[-1] * W for _ in range(H)]\ndist[sy][sx] = 0\nq = deque([(sy, sx, 0)])\nwhile q:\n (y, x, e) = q.popleft()\n for i, j, k in med:\n if e >= k and (0 <= i - y <= 1) and (0 <= j - x <= 1):\n if dist[i][j] == -1 or dist[i][j] > e - k:\n dist[i][j] = e - k\n q.append((i, j, e - k))\n\n\ndef valid(y, x, e):\n if 0 <= y < H and 0 <= x < W and (A[y][x] != \"#\") and (dist[y][x] <= e):\n return True\n return False\n\n\nfor i, j, k in med:\n if valid(i, j, k) and valid(ty, tx, k):\n print(\"Yes\")\n exit()\nprint(\"No\")", "from collections import deque\n\n(H, W) = map(int, input().split())\ngrid = [list(input()) for _ in range(H)]\nN = int(input())\nmeds = [list(map(int, input().split())) for _ in range(N)]\n\nstart = (None, None)\ngoal = (None, None)\nfor i in range(H):\n for j in range(W):\n if grid[i][j] == \"S\":\n start = (i, j)\n grid[i][j] = \".\"\n elif grid[i][j] == \"T\":\n goal = (i, j)\n grid[i][j] = \".\"\n\ndist = [[-1] * W for _ in range(H)]\ndist[start[0]][start[1]] = 0\nq = deque([start])\nwhile q:\n (i, j) = q.popleft()\n for ni, nj in ((i + 1, j), (i - 1, j), (i, j + 1), (i, j - 1)):\n if 0 <= ni < H and 0 <= nj < W and grid[ni][nj] == \".\":\n if dist[ni][nj] == -1 or dist[ni][nj] > dist[i][j] + 1:\n dist[ni][nj] = dist[i][j] + 1\n q.append((ni, nj))\n\nfor r, c, e in meds:\n r -= 1\n c -= 1\n if dist[r][c] != -1 and (dist[goal[0]][goal[1]] == -1 or dist[r][c] + dist[goal[0]][goal[1]] > e):\n dist[goal[0]][goal[1]] = -1\n if dist[r][c] == -1 or dist[r][c] + 1 > e:\n dist[r][c] = -1\n\nprint(\"Yes\" if dist[goal[0]][goal[1]] != -1 else \"No\")", "from collections import deque\n\nh, w = map(int, input().split())\ngrid = [list(input()) for _ in range(h)]\nn = int(input())\nmeds = [list(map(int, input().split())) for _ in range(n)]\n\nstart, goal = None, None\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \"S\":\n start = (i, j)\n elif grid[i][j] == \"T\":\n goal = (i, j)\n\ndist = [[-1] * w for _ in range(h)]\ndist[start[0]][start[1]] = 0\nq = deque([start])\nwhile q:\n i, j = q.popleft()\n for ni, nj in ((i + 1, j), (i - 1, j), (i, j + 1), (i, j - 1)):\n if 0 <= ni < h and 0 <= nj < w and grid[ni][nj] == \".\":\n if dist[ni][nj] == -1 or dist[ni][nj] > dist[i][j] + 1:\n dist[ni][nj] = dist[i][j] + 1\n q.append((ni, nj))\n\nfor r, c, e in meds:\n r -= 1\n c -= 1\n if dist[r][c] != -1 and (dist[goal[0]][goal[1]] == -1 or dist[r][c] + dist[goal[0]][goal[1]] - 1 > e):\n dist[goal[0]][goal[1]] = -1\n if dist[goal[0]][goal[1]] != -1 and dist[r][c] + dist[goal[0]][goal[1]] - 1 < e:\n dist[r][c] = e - dist[goal[0]][goal[1]] + 1\n\nprint(\"Yes\" if dist[goal[0]][goal[1]] != -1 else \"No\")", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = [list(input()) for _ in range(h)]\nn = int(input())\nmeds = [list(map(int, input().split())) for _ in range(n)]\ns = (0, 0)\nt = (0, 0)\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \"S\":\n s = (i, j)\n elif grid[i][j] == \"T\":\n t = (i, j)\nvisited = [[False] * w for _ in range(h)]\ndist = [[float(\"inf\")] * w for _ in range(h)]\nq = deque([(s, 0)])\nwhile q:\n (i, j), e = q.popleft()\n if (i, j) == t:\n print(\"Yes\")\n exit()\n if e > 0:\n q.append((i, j))\n q.append((i, j))\n for ni, nj, ne in meds:\n if ni == i and nj == j:\n q.append(((ni, nj), ne))\n for ni, nj in [(i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1)]:\n if 0 <= ni < h and 0 <= nj < w and grid[ni][nj] != \"#\":\n if e == 0:\n continue\n if not visited[ni][nj] and dist[ni][nj] > e - 1:\n dist[ni][nj] = e - 1\n visited[ni][nj] = True\n q.append(((ni, nj), dist[ni][nj]))\nprint(\"No\")", "from collections import deque\n\nH, W = map(int, input().split())\ngrid = [input() for _ in range(H)]\nN = int(input())\nmeds = [list(map(int, input().split())) for _ in range(N)]\n\nstart = [None, None]\ngoal = [None, None]\nfor i in range(H):\n for j in range(W):\n if grid[i][j] == \"S\":\n start = [i, j]\n elif grid[i][j] == \"T\":\n goal = [i, j]\n\ndx = [-1, 0, 1, 0]\ndy = [0, 1, 0, -1]\n\n\ndef bfs():\n q = deque([(start, 0)])\n visited = set()\n while q:\n (x, y), e = q.popleft()\n if (x, y) == goal:\n return True\n if (x, y, e) in visited:\n continue\n visited.add((x, y, e))\n for k in range(4):\n nx, ny = x + dx[k], y + dy[k]\n if 0 <= nx < H and 0 <= ny < W and grid[nx][ny] == \".\":\n q.append(((nx, ny), e - 1))\n for med in meds:\n if med[0] == nx + 1 and med[1] == ny + 1:\n q.append(((nx, ny), med[2]))\n return False\n\n\nif bfs():\n print(\"Yes\")\nelse:\n print(\"No\")", "from collections import deque\n\nh, w = map(int, input().split())\ngrid = [input() for _ in range(h)]\nn = int(input())\nmed = [list(map(int, input().split())) for _ in range(n)]\n\nsy, sx = 0, 0\ngy, gx = 0, 0\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \"S\":\n sy, sx = i, j\n elif grid[i][j] == \"T\":\n gy, gx = i, j\n\ndist = [[float(\"inf\") for _ in range(w)] for _ in range(h)]\ndist[sy][sx] = 0\nq = deque([(sy, sx, 0)])\nwhile q:\n y, x, e = q.popleft()\n for i, j, k in med:\n if e + k < dist[i][j]:\n dist[i][j] = e + k\n q.append((i, j, e + k))\n for dy, dx in [(0, 1), (1, 0), (0, -1), (-1, 0)]:\n ny, nx = y + dy, x + dx\n if 0 <= ny < h and 0 <= nx < w and grid[ny][nx] != \"#\":\n if dist[y][x] + 1 < dist[ny][nx]:\n dist[ny][nx] = dist[y][x] + 1\n q.append((ny, nx, dist[y][x]))\n\nif dist[gy][gx] != float(\"inf\"):\n print(\"Yes\")\nelse:\n print(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\nn = int(input())\n\ngraph = [[] for _ in range(n + 1)]\n\nfor _ in range(n - 1):\n a, b = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\n\nc = list(map(int, input().split()))\n\nq = deque([(1, 0)])\n\nwhile q:\n v, d = q.popleft()\n for u in graph[v]:\n graph[u].remove(v)\n q.append((u, d + 1))\n\nans = float(\"inf\")\n\nfor i in range(n):\n ans = min(ans, c[i] * (n - 1) - sum(c[j] for j in range(n) if d[i][j] % 2))\n\nprint(ans)", "from collections import defaultdict\n\nn = int(input())\ngraph = defaultdict(list)\nfor _ in range(n - 1):\n a, b = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\nc = list(map(int, input().split()))\n\nstack = [(1, -1, 0)]\ndist = [0] * (n + 1)\nwhile stack:\n v, p, d = stack.pop()\n for u in graph[v]:\n if u != p:\n dist[u] = d + 1\n stack.append((u, v, dist[u]))\n\nans = float(\"inf\")\nfor i in range(1, n + 1):\n ans = min(ans, sum(c[j] * dist[i] for j in range(1, n + 1)))\nprint(ans)", "from collections import defaultdict\n\nn = int(input())\ngraph = defaultdict(list)\nfor _ in range(n - 1):\n a, b = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\nc = list(map(int, input().split()))\n\nleaves = [v for v in graph if len(graph[v]) == 1]\n\nwhile leaves:\n leaf = leaves.pop()\n parent = graph[leaf].pop()\n c[parent - 1] += c[leaf - 1]\n if len(graph[parent]) == 1:\n leaves.append(parent)\n\nprint(sum(c) // 2)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\ngraph = [[] for i in range(N)]\n\nfor i in range(N - 1):\n A, B = map(int, input().split())\n A -= 1\n B -= 1\n graph[A].append(B)\n graph[B].append(A)\n\nC = list(map(int, input().split()))\n\nfrom collections import deque\n\nq = deque()\nq.append((0, -1, 0))\n\ndist = [0] * N\n\nwhile q:\n node, prev, d = q.popleft()\n dist[node] = d\n for i in graph[node]:\n if i == prev:\n continue\n q.append((i, node, d + 1))\n\nans = 0\nfor i in range(N):\n ans += C[i] * dist[i]\n\nprint(ans)", "from collections import defaultdict\n\nn = int(input())\ngraph = defaultdict(list)\nfor _ in range(n - 1):\n a, b = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\nc = list(map(int, input().split()))\n\nstack = [(1, -1, 0)]\ndist = [0] * (n + 1)\nwhile stack:\n v, parent, d = stack.pop()\n for u in graph[v]:\n if u == parent:\n continue\n dist[u] = d + 1\n stack.append((u, v, d + 1))\n\nans = 0\nfor i in range(1, n + 1):\n ans += c[i - 1] * dist[i]\nprint(ans)", "from collections import defaultdict\n\nn = int(input())\ngraph = defaultdict(list)\nfor _ in range(n - 1):\n a, b = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\nc = list(map(int, input().split()))\n\nleaves = []\nfor i in range(1, n + 1):\n if len(graph[i]) == 1:\n leaves.append(i)\n\ndef dfs(node, parent):\n global res, c\n cnt = 0\n for child in graph[node]:\n if child != parent:\n cnt += dfs(child, node)\n res += c[node - 1] * cnt\n return cnt + 1\n\nres = 0\nfor leaf in leaves:\n dfs(leaf, 0)\nprint(res)", "from collections import defaultdict\n\nn = int(input())\ntree = defaultdict(list)\nfor _ in range(n - 1):\n a, b = map(int, input().split())\n tree[a].append(b)\n tree[b].append(a)\nc = list(map(int, input().split()))\n\nstack = [(1, 0, 0)]\nvisited = set()\nwhile stack:\n v, depth, dist = stack.pop()\n if v not in visited:\n visited.add(v)\n dist += c[v - 1] * depth\n for nv in tree[v]:\n stack.append((nv, depth + 1, dist))\n\nprint(min(dist for v, depth, dist in stack))", "from collections import deque\n\nn = int(input())\ngraph = [[] for _ in range(n + 1)]\nfor _ in range(n - 1):\n a, b = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\nc = list(map(int, input().split()))\n\nq = deque()\nq.append((1, 0))\ndist = [0] * (n + 1)\nwhile q:\n v, d = q.popleft()\n dist[v] = d\n for nv in graph[v]:\n if dist[nv] == 0:\n dist[nv] = d + 1\n q.append((nv, d + 1))\n\nans = 0\nfor i in range(n):\n ans += c[i] * dist[i + 1]\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\ngraph = [[] for _ in range(N)]\n\nfor _ in range(N - 1):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n graph[a].append(b)\n graph[b].append(a)\n\nC = list(map(int, input().split()))\n\nfrom collections import deque\n\nQ = deque()\nQ.append((0, 0))\n\ndist = [0] * N\n\nwhile Q:\n node, d = Q.popleft()\n dist[node] = d\n for i in graph[node]:\n if dist[i] == 0:\n dist[i] = d + 1\n Q.append((i, d + 1))\n\nans = 0\nfor i in range(N):\n ans += C[i] * dist[i]\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\n\ntree = [[] for i in range(N)]\n\nfor i in range(N - 1):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n tree[a].append(b)\n tree[b].append(a)\n\nC = list(map(int, input().split()))\n\ndp = [0] * N\n\nstack = [(0, 0)]\n\nwhile stack:\n node, depth = stack.pop()\n dp[node] = depth\n for next_node in tree[node]:\n stack.append((next_node, depth + 1))\n\nans = 10**18\nfor i in range(N):\n ans = min(ans, dp[i] * C[i])\n\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\na = list(map(int, input().split()))\r\nprint(sum(a))\r", "n = int(input())\na = list(map(int, input().split()))\nprint(sum(a))", "n = int(input())\r\na = list(map(int, input().split()))\r\nprint(sum(a))\r", "n = int(input())\na = list(map(int, input().split()))\nprint(sum(a))", "n = int(input())\na = list(map(int, input().split()))\nprint(sum(a))", "n = int(input())\na = list(map(int, input().split()))\nprint(sum(a))", "n = int(input())\r\na = list(map(int, input().split()))\r\nprint(sum(a))\r", "n = int(input())\r\na = list(map(int, input().split()))\r\nprint(sum(a))\r", "n = int(input())\r\na = list(map(int, input().split()))\r\nprint(sum(a))\r", "n = int(input())\r\na = list(map(int, input().split()))\r\nprint(sum(a))\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import Counter\n\ns = input()\nc = Counter(s)\nfor i in c.values():\n if i == 1:\n print(\"No\")\n exit()\n if i > 2:\n print(\"No\")\n exit()\nprint(\"Yes\")", "def main():\n s = input()\n d = {}\n for c in s:\n if c in d:\n d[c] += 1\n else:\n d[c] = 1\n c = 0\n for v in d.values():\n if v == 1:\n c += 1\n print(\"Yes\" if c == 0 or c == 2 else \"No\")\n\n\nmain()", "from collections import Counter\n\ns = input()\nc = Counter(s)\nfor i in c.values():\n if i == 1:\n print(\"No\")\n exit()\n if i > 2:\n print(\"No\")\n exit()\nprint(\"Yes\")", "from collections import Counter\n\ns = input()\nc = Counter(s)\nfor i in c.values():\n if i == 1:\n print(\"No\")\n break\nelse:\n print(\"Yes\")", "s = input()\nl = [0] * 26\nfor i in s:\n l[ord(i) - ord(\"a\")] += 1\nc = 0\nfor i in l:\n if i != 0 and i != 2:\n c += 1\nif c == 0:\n print(\"Yes\")\nelse:\n print(\"No\")", "from collections import Counter\n\ns = input()\nc = Counter(s)\nfor i in c.values():\n if i == 1:\n print(\"No\")\n exit()\n if i > 2:\n print(\"No\")\n exit()\nprint(\"Yes\")", "from collections import Counter\n\ns = input()\nc = Counter(s)\nfor i in c.values():\n if i == 1:\n print(\"No\")\n exit()\n if i > 2:\n print(\"No\")\n exit()\nprint(\"Yes\")", "from collections import Counter\n\ns = input()\nc = Counter(s)\nfor i in c.values():\n if i == 1:\n print(\"No\")\n exit()\n if i > 2:\n print(\"No\")\n exit()\nprint(\"Yes\")", "def main():\n s = input()\n freq = {}\n for c in s:\n if c in freq:\n freq[c] += 1\n else:\n freq[c] = 1\n count = [0] * (len(s) + 1)\n for f in freq.values():\n count[f] += 1\n for i in range(1, len(s) + 1):\n if count[i] != 0 and count[i] != 2:\n print(\"No\")\n return\n print(\"Yes\")\n\n\nmain()", "from collections import Counter\n\ns = input()\nc = Counter(s)\nfor i in c.values():\n if i == 1:\n print(\"No\")\n break\nelse:\n print(\"Yes\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, true, false ], "metadata_list": [] }, { "code_list": [ "s = input()\nt = input()\n\nif len(s) < 3:\n print(\"No\")\nelse:\n s1 = list(s)\n s2 = []\n for i in range(len(s1)):\n if s1[i] == t[0]:\n s2.append(s1[i])\n s1[i] = \"0\"\n if len(s2) == 1:\n break\n\n s1 = list(s)\n s2 = []\n for i in range(len(s1)):\n if s1[i] == t[1]:\n s2.append(s1[i])\n s1[i] = \"0\"\n if len(s2) == 1:\n break\n\n s1 = list(s)\n s2 = []\n for i in range(len(s1)):\n if s1[i] == t[2]:\n s2.append(s1[i])\n s1[i] = \"0\"\n if len(s2) == 1:\n break\n\n if len(s2) == 3:\n print(\"Yes\")\n else:\n s1 = list(s)\n s2 = []\n for i in range(len(s1)):\n if s1[i] == t[0]:\n s2.append(s1[i])\n s1[i] = \"0\"\n if len(s2) == 1:\n break\n\n s1 = list(s)\n s2 = []\n for i in range(len(s1)):\n if s1[i] == t[1]:\n s2.append(s1[i])\n s1[i] = \"0\"\n if len(s2) == 1:\n break\n\n if len(s2) == 2 and t[2] == \"X\":\n print(\"Yes\")\n else:\n print(\"No\")", "s = input()\nt = input()\n\nif len(s) < 3:\n print(\"No\")\n exit()\n\nif t[2] == \"X\":\n if t[0] in s and t[1] in s:\n print(\"Yes\")\n exit()\n else:\n print(\"No\")\n exit()\n\nif t[0] in s and t[1] in s and t[2] in s:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nt = input()\n\nif len(s) < 3:\n print(\"No\")\nelse:\n if t[2] == \"X\":\n if t[0] in s and t[1] in s:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n if t[0] in s and t[1] in s and t[2] in s:\n print(\"Yes\")\n else:\n print(\"No\")", "s = input()\nt = input()\n\nif len(s) < 3:\n print(\"No\")\n exit()\n\nif t[2] == \"X\":\n if t[0] in s and t[1] in s:\n print(\"Yes\")\n exit()\nelse:\n if t[0] in s and t[1] in s and t[2] in s:\n print(\"Yes\")\n exit()\n\nprint(\"No\")", "s = input()\nt = input()\nif t[2] == \"X\":\n for i in range(len(s) - 1):\n if s[i] == t[0] and s[i + 1] == t[1]:\n print(\"Yes\")\n exit()\n print(\"No\")\nelse:\n for i in range(len(s) - 2):\n if s[i] == t[0] and s[i + 1] == t[1] and s[i + 2] == t[2]:\n print(\"Yes\")\n exit()\n print(\"No\")", "s = input()\nt = input()\n\nif len(s) < 3:\n print(\"No\")\nelse:\n s1 = list(s)\n t1 = list(t)\n if t1[2] == \"X\":\n if t1[0] in s1 and t1[1] in s1:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n if t1[0] in s1 and t1[1] in s1 and t1[2] in s1:\n print(\"Yes\")\n else:\n print(\"No\")", "s = input()\nt = input()\n\nif len(s) < 3:\n print(\"No\")\nelse:\n for i in range(len(s) - 2):\n if s[i] + s[i + 1] + s[i + 2] == t or s[i] + s[i + 1] == t[:2]:\n print(\"Yes\")\n exit()\n print(\"No\")", "s = input()\nt = input()\nprint(\"Yes\" if (s.count(t[0].lower()) + s.count(t[1].lower()) + s.count(t[2].lower())) >= 2 else \"No\")", "s = input()\nt = input()\nif t[2] == \"X\":\n for i in range(len(s) - 1):\n if s[i] == t[0] and s[i + 1] == t[1]:\n print(\"Yes\")\n exit()\n print(\"No\")\nelse:\n for i in range(len(s) - 2):\n if s[i] == t[0] and s[i + 1] == t[1] and s[i + 2] == t[2]:\n print(\"Yes\")\n exit()\n print(\"No\")", "s = input()\nt = input()\n\nif len(s) < 3:\n print(\"No\")\n exit()\n\nif t[2] == \"X\":\n if t[0] in s and t[1] in s:\n print(\"Yes\")\n exit()\n else:\n print(\"No\")\n exit()\n\nif t[0] in s and t[1] in s and t[2] in s:\n print(\"Yes\")\nelse:\n print(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "def main():\n L, R = map(int, input().split())\n ans = []\n while L < R:\n if L & 1:\n ans.append((L, L + 1))\n L += 1\n x = L\n cnt = 0\n while x & 1 == 0:\n cnt += 1\n x >>= 1\n x = 1 << cnt\n y = L + x - 1\n ans.append((L, y))\n L = y + 1\n print(len(ans))\n for l, r in ans:\n print(l, r)\n\n\nmain()", "def main():\n L, R = map(int, input().split())\n ans = []\n while L < R:\n if L & 1:\n ans.append((L, L + 1))\n L += 1\n x = L\n L = R\n R = 2 * R\n while R > x:\n R //= 2\n ans.append((L, R))\n print(len(ans))\n for a, b in ans:\n print(a, b)\n\n\nmain()", "from sys import stdin\n\ninput = stdin.readline\n(L, R) = map(int, input().split())\nans = []\nwhile L < R:\n if L & 1:\n L += 1\n x = L.bit_length()\n y = (R - 1) // (1 << x) + 1\n ans.append((L, L + (1 << x) * y - 1))\n L += (1 << x) * y\nprint(len(ans))\nfor l, r in ans:\n print(l, r)", "def main():\n L, R = map(int, input().split())\n ans = []\n while L < R:\n if L & 1:\n ans.append((L, L + 1))\n L += 1\n x = L\n while x < R and not (x & 1):\n x = x + 1\n ans.append((L, x))\n L = x\n print(len(ans))\n for a, b in ans:\n print(a, b)\n\n\nmain()", "def main():\n L, R = map(int, input().split())\n ans = []\n while L < R:\n if L & 1:\n ans.append((L, L + 1))\n L += 1\n x = L\n while x & (x + 1) == 0:\n x >>= 1\n y = x\n while y & (y + 1) == 0:\n y = (y >> 1) + 1\n ans.append((L, y << (L - x).bit_length()))\n L = y << (L - x).bit_length()\n ans.append((L, R))\n print(len(ans))\n for l, r in ans:\n print(l, r)\n\n\nmain()", "import sys\n\ninput = sys.stdin.readline\n(L, R) = map(int, input().split())\nans = []\nwhile L < R:\n if L == 0:\n ans.append((L, R))\n break\n x = L.bit_length() - 1\n y = L >> x\n if y == 0:\n x -= 1\n y = 1\n else:\n y -= 1\n L2 = L + (1 << x)\n if L2 > R:\n L2 = R\n ans.append((L, L2))\n L = L2\nprint(len(ans))\nfor l, r in ans:\n print(l, r)", "def main():\n l, r = map(int, input().split())\n ans = []\n while l < r:\n if l & 1:\n l += 1\n x = l\n while x & (x + 1) == 0:\n x &= x - 1\n y = x\n while y & (y + 1) == y:\n y = (y + 1) & x\n ans.append((l, l + y))\n l += y + 1\n print(len(ans))\n for a, b in ans:\n print(a, b)\n\n\nmain()", "def main():\n L, R = map(int, input().split())\n ans = []\n while L < R:\n if L == 0:\n ans.append((0, R))\n break\n x = L.bit_length()\n y = (L + (1 << x) - 1) // (1 << x)\n ans.append((L, 1 << x * y))\n L = 1 << x * y\n print(len(ans))\n for l, r in ans:\n print(l, r)\n\n\nmain()", "def main():\n L, R = map(int, input().split())\n ans = []\n while L < R:\n if L & 1:\n ans.append((L, L + 1))\n L += 1\n x = L\n while x < R and not (x & 1):\n x = x + 1\n ans.append((L, x))\n L = x\n print(len(ans))\n for a, b in ans:\n print(a, b)\n\n\nmain()", "def main():\n L, R = map(int, input().split())\n ans = []\n while L < R:\n if L & 1:\n ans.append((L, L + 1))\n L += 1\n x = L\n while x & (x + 1) == 0:\n x += 1\n ans.append((L, x))\n L = x\n print(len(ans))\n for l, r in ans:\n print(l, r)\n\n\nmain()" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "a = []\nfor i in range(3):\n a.append(list(map(int, input().split())))\n\nif a[0][0] + a[0][1] + a[0][2] == 0:\n if a[1][0] + a[1][1] + a[1][2] == 0:\n if a[2][0] + a[2][1] + a[2][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[0][0] + a[1][0] + a[2][0] == 0:\n if a[0][1] + a[1][1] + a[2][1] == 0:\n if a[0][2] + a[1][2] + a[2][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[0][0] + a[1][1] + a[2][2] == 0:\n if a[0][1] + a[1][1] + a[2][0] == 0:\n if a[0][2] + a[1][2] + a[2][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[2][0] + a[1][1] + a[0][2] == 0:\n if a[2][1] + a[1][1] + a[0][0] == 0:\n if a[2][2] + a[1][2] + a[0][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelse:\n print(\"Takahashi\")", "a = []\nfor i in range(3):\n a.append(list(map(int, input().split())))\n\nfor i in range(3):\n for j in range(3):\n if a[i][j] < 0:\n a[i][j] = -a[i][j]\n if i > 0:\n a[i - 1][j] = -a[i - 1][j]\n if i < 2:\n a[i + 1][j] = -a[i + 1][j]\n if j > 0:\n a[i][j - 1] = -a[i][j - 1]\n if j < 2:\n a[i][j + 1] = -a[i][j + 1]\n\nif a[0][0] + a[0][1] + a[1][1] == 0 or a[0][1] + a[0][2] + a[1][2] == 0 or a[1][0] + a[1][1] + a[2][1] == 0 or a[1][1] + a[1][2] + a[2][2] == 0 or a[0][0] + a[1][0] + a[2][0] == 0 or a[1][1] + a[2][1] + a[2][2] == 0 or a[0][0] + a[1][1] + a[2][2] == 0 or a[0][2] + a[1][1] + a[2][0] == 0:\n print(\"Aoki\")\nelse:\n print(\"Takahashi\")", "a = [[int(i) for i in input().split()] for j in range(3)]\ns = sum(sum(i) for i in a)\nif s >= 0:\n print(\"Takahashi\")\nelse:\n print(\"Aoki\")", "a = []\nfor i in range(3):\n a.append(list(map(int, input().split())))\n\nif a[0][0] + a[0][1] + a[0][2] == 0:\n if a[1][0] + a[1][1] + a[1][2] == 0:\n if a[2][0] + a[2][1] + a[2][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[0][0] + a[1][0] + a[2][0] == 0:\n if a[0][1] + a[1][1] + a[2][1] == 0:\n if a[0][2] + a[1][2] + a[2][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[0][0] + a[1][1] + a[2][2] == 0:\n if a[0][1] + a[1][1] + a[2][0] == 0:\n if a[0][2] + a[1][2] + a[2][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[0][2] + a[1][1] + a[2][0] == 0:\n if a[0][1] + a[1][1] + a[2][2] == 0:\n if a[0][0] + a[1][2] + a[2][1] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[2][0] + a[1][1] + a[0][2] == 0:\n if a[2][1] + a[1][1] + a[0][0] == 0:\n if a[2][2] + a[1][2] + a[0][1] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[2][2] + a[1][1] + a[0][0] == 0:\n if a[2][1] + a[1][1] + a[0][2] == 0:\n if a[2][0] + a[1][2] + a[0][1] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[1][0] + a[1][1] + a[1][2] == 0:\n if a[0][0] + a[0][1] + a[0][2] == 0:\n if a[2][0] + a[2][1] + a[2][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[0][0] + a[1][0] + a[2][1] == 0:\n if a[0][1] + a[1][1] + a[2][2] == 0:\n if a[0][2] + a[1][2] + a[2][0] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[0][1] + a[1][1] + a[2][2] == 0:\n if a[0][0] + a[1][0] + a[2][1] == 0:\n if a[0][2] + a[1][2] + a[2][0] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[0][2] + a[1][1] + a[2][0] == 0:\n if a[0][0] + a[1][2] + a[2][1] == 0:\n if a[0][1] + a[1][0] + a[2][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelse:\n print(\"Takahashi\")", "a = [[int(i) for i in input().split()] for j in range(3)]\n\nif a[0][0] + a[0][1] + a[1][0] == 0:\n if a[1][1] + a[1][2] + a[2][1] == 0:\n if a[2][0] + a[2][2] == 0:\n print(\"Aoki\")\n elif a[2][0] + a[2][2] > 0:\n print(\"Takahashi\")\n elif a[1][1] + a[1][2] + a[2][1] > 0:\n print(\"Takahashi\")\nelif a[0][0] + a[0][1] + a[1][0] > 0:\n print(\"Takahashi\")\n\nif a[0][1] + a[0][2] + a[1][1] == 0:\n if a[1][2] + a[2][1] + a[2][2] == 0:\n if a[0][0] + a[2][0] == 0:\n print(\"Aoki\")\n elif a[0][0] + a[2][0] > 0:\n print(\"Takahashi\")\n elif a[1][2] + a[2][1] + a[2][2] > 0:\n print(\"Takahashi\")\nelif a[0][1] + a[0][2] + a[1][1] > 0:\n print(\"Takahashi\")\n\nif a[1][0] + a[1][1] + a[2][0] == 0:\n if a[0][1] + a[1][2] + a[2][2] == 0:\n if a[0][0] + a[0][2] == 0:\n print(\"Aoki\")\n elif a[0][0] + a[0][2] > 0:\n print(\"Takahashi\")\n elif a[0][1] + a[1][2] + a[2][2] > 0:\n print(\"Takahashi\")\nelif a[1][0] + a[1][1] + a[2][0] > 0:\n print(\"Takahashi\")", "a = []\nfor i in range(3):\n a.append(list(map(int, input().split())))\n\nif a[0][0] + a[0][1] + a[0][2] == 0:\n if a[1][1] == 0:\n if a[2][0] + a[2][1] + a[2][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n elif a[1][2] == 0:\n if a[2][0] + a[2][1] + a[2][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[0][0] + a[1][0] + a[2][0] == 0:\n if a[1][1] == 0:\n if a[2][1] + a[2][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n elif a[1][2] == 0:\n if a[2][1] + a[2][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[0][2] + a[1][2] + a[2][2] == 0:\n if a[1][0] == 0:\n if a[2][0] + a[2][1] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n elif a[1][1] == 0:\n if a[2][0] + a[2][1] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[0][0] + a[1][1] + a[2][2] == 0:\n if a[1][0] == 0:\n if a[2][0] + a[2][1] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n elif a[1][2] == 0:\n if a[2][0] + a[2][1] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelif a[0][2] + a[1][1] + a[2][0] == 0:\n if a[1][0] == 0:\n if a[2][1] + a[2][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n elif a[1][2] == 0:\n if a[2][1] + a[2][2] == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n print(\"Takahashi\")\nelse:\n print(\"Takahashi\")", "a = []\nfor i in range(3):\n a.append(list(map(int, input().split())))\n\nfor i in range(3):\n for j in range(3):\n if a[i][j] < 0:\n a[i][j] *= -1\n a[i][j] = -a[i][j]\n\nif a[0][0] + a[0][1] + a[0][2] > a[1][0] + a[1][1] + a[1][2]:\n if a[0][0] + a[1][0] + a[2][0] > a[0][1] + a[1][1] + a[2][1]:\n if a[0][0] + a[1][1] + a[2][2] > a[0][2] + a[1][2] + a[2][0]:\n print(\"Takahashi\")\n else:\n print(\"Aoki\")\n elif a[0][1] + a[1][1] + a[2][1] > a[0][0] + a[1][2] + a[2][0]:\n if a[0][1] + a[1][1] + a[2][2] > a[0][0] + a[1][0] + a[2][1]:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n if a[0][2] + a[1][1] + a[2][0] > a[0][0] + a[1][2] + a[2][2]:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\nelif a[0][0] + a[0][1] + a[0][2] < a[1][0] + a[1][1] + a[1][2]:\n if a[0][0] + a[1][0] + a[2][0] < a[0][1] + a[1][1] + a[2][1]:\n if a[0][0] + a[1][1] + a[2][2] < a[0][2] + a[1][2] + a[2][0]:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n elif a[0][1] + a[1][1] + a[2][1] < a[0][0] + a[1][2] + a[2][0]:\n if a[0][1] + a[1][1] + a[2][2] < a[0][0] + a[1][0] + a[2][1]:\n print(\"Takahashi\")\n else:\n print(\"Aoki\")\n else:\n if a[0][2] + a[1][1] + a[2][0] < a[0][0] + a[1][2] + a[2][2]:\n print(\"Takahashi\")\n else:\n print(\"Aoki\")\nelse:\n if a[0][0] + a[1][0] + a[2][0] > a[0][1] + a[1][1] + a[2][1]:\n if a[2][0] + a[1][1] + a[0][2] > a[0][0] + a[1][2] + a[2][2]:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n elif a[0][1] + a[1][1] + a[2][1] > a[0][0] + a[1][2] + a[2][0]:\n if a[2][1] + a[1][1] + a[0][2] > a[0][0] + a[1][2] + a[2][2]:\n print(\"Takahashi\")\n else:\n print(\"Aoki\")\n else:\n if a[0][2] + a[1][1] + a[2][2] > a[0][0] + a[1][2] + a[2][0]:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")", "a = [[int(i) for i in input().split()] for _ in range(3)]\n\ns = sum(sum(i) for i in a)\n\nif s > 0:\n print(\"Takahashi\")\nelse:\n print(\"Aoki\")", "a = [[int(i) for i in input().split()] for j in range(3)]\ns = sum(sum(i) for i in a)\nif s > 0:\n print(\"Takahashi\")\nelse:\n print(\"Aoki\")", "a = []\nfor i in range(3):\n a.append(list(map(int, input().split())))\n\nfor i in range(3):\n for j in range(3):\n if a[i][j] < 0:\n a[i][j] *= -1\n a[i][j] = -a[i][j]\n\nif a[0][0] + a[0][1] + a[0][2] > a[1][0] + a[1][1] + a[1][2]:\n if a[0][0] + a[1][0] + a[2][0] > a[0][1] + a[1][1] + a[2][1]:\n if a[0][0] + a[1][1] + a[2][2] > a[0][2] + a[1][2] + a[2][0]:\n print(\"Takahashi\")\n else:\n print(\"Aoki\")\n elif a[0][1] + a[1][1] + a[2][1] > a[0][0] + a[1][0] + a[2][0]:\n if a[0][1] + a[1][1] + a[2][2] > a[2][0] + a[1][0] + a[0][2]:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n else:\n if a[2][0] + a[1][1] + a[0][2] > a[0][0] + a[1][2] + a[2][2]:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\nelif a[0][0] + a[0][1] + a[0][2] < a[1][0] + a[1][1] + a[1][2]:\n if a[0][0] + a[1][0] + a[2][0] < a[0][1] + a[1][1] + a[2][1]:\n if a[0][0] + a[1][1] + a[2][2] < a[0][2] + a[1][2] + a[2][0]:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n elif a[0][1] + a[1][1] + a[2][1] < a[0][0] + a[1][0] + a[2][0]:\n if a[0][1] + a[1][1] + a[2][2] < a[2][0] + a[1][0] + a[0][2]:\n print(\"Takahashi\")\n else:\n print(\"Aoki\")\n else:\n if a[2][0] + a[1][1] + a[0][2] < a[0][0] + a[1][2] + a[2][2]:\n print(\"Takahashi\")\n else:\n print(\"Aoki\")\nelse:\n if a[0][0] + a[1][0] + a[2][0] > a[0][1] + a[1][1] + a[2][1]:\n if a[0][0] + a[1][1] + a[2][2] > a[0][2] + a[1][2] + a[2][0]:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n elif a[0][1] + a[1][1] + a[2][1] > a[0][0] + a[1][0] + a[2][0]:\n if a[0][1] + a[1][1] + a[2][2] > a[2][0] + a[1][0] + a[0][2]:\n print(\"Takahashi\")\n else:\n print(\"Aoki\")\n else:\n if a[2][0] + a[1][1] + a[0][2] > a[0][0] + a[1][2] + a[2][2]:\n print(\"Takahashi\")\n else:\n print(\"Aoki\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "s = input()\nif s in [\"ABC316\"]:\n print(\"No\")\nelif int(s[3:]) <= 349:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s in [\"ABC316\"]:\n print(\"No\")\nelif int(s[3:]) <= 349:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s in [\"ABC316\"]:\n print(\"No\")\nelif int(s[3:]) <= 349:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s in [\"ABC316\"]:\n print(\"No\")\nelif int(s[3:]) <= 349:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s in [\"ABC316\"]:\n print(\"No\")\nelif int(s[3:]) <= 349:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s in [\"ABC316\"]:\n print(\"No\")\nelif int(s[3:]) <= 349:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s in [\"ABC316\"]:\n print(\"No\")\nelif int(s[3:]) <= 349:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s in [\"ABC316\"]:\n print(\"No\")\nelif int(s[3:]) <= 349:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s in [\"ABC316\"]:\n print(\"No\")\nelif int(s[3:]) <= 349:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\nif s == \"ABC316\":\n print(\"No\")\nelif int(s[3:]) <= 349 and int(s[3:]) != 316:\n print(\"Yes\")\nelse:\n print(\"No\")" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, q = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na = [1] * n\r\nfor i in t:\r\n a[i - 1] = 1 - a[i - 1]\r\nprint(a.count(1))\r", "n, q = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na = [1] * n\r\nfor i in t:\r\n a[i - 1] = 1 - a[i - 1]\r\nprint(a.count(1))\r", "n, q = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na = [1] * n\r\nfor i in t:\r\n a[i - 1] = 1 - a[i - 1]\r\nprint(a.count(1))\r", "n, q = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na = [1] * n\r\nfor i in t:\r\n a[i - 1] = 1 - a[i - 1]\r\nprint(a.count(1))\r", "n, q = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na = [1] * n\r\nfor i in t:\r\n a[i - 1] = 1 - a[i - 1]\r\nprint(a.count(1))\r", "n, q = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na = [1] * n\r\nfor i in t:\r\n a[i - 1] = 1 - a[i - 1]\r\nprint(a.count(1))\r", "n, q = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na = [1] * n\r\nfor i in t:\r\n a[i - 1] = 1 - a[i - 1]\r\nprint(a.count(1))\r", "n, q = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na = [1] * n\r\nfor i in t:\r\n a[i - 1] = 1 - a[i - 1]\r\nprint(a.count(1))\r", "n, q = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na = [1] * n\r\nfor i in t:\r\n a[i - 1] = 1 - a[i - 1]\r\nprint(a.count(1))\r", "n, q = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na = [1] * n\r\nfor i in t:\r\n a[i - 1] = 1 - a[i - 1]\r\nprint(a.count(1))\r" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nswaps = []\r\nfor i in range(n):\r\n if a[i] != i + 1:\r\n j = a.index(i + 1)\r\n a[i], a[j] = a[j], a[i]\r\n swaps.append((i + 1, j + 1))\r\n\r\nprint(len(swaps))\r\nfor i, j in swaps:\r\n print(i, j)\r", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nans = []\r\nfor i in range(n):\r\n if a[i] != i + 1:\r\n j = a.index(i + 1)\r\n a[i], a[j] = a[j], a[i]\r\n ans.append([i + 1, j + 1])\r\n\r\nprint(len(ans))\r\nfor i in ans:\r\n print(*i)\r", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nswaps = []\r\nfor i in range(n):\r\n if a[i] != i + 1:\r\n j = a.index(i + 1)\r\n a[i], a[j] = a[j], a[i]\r\n swaps.append((i + 1, j + 1))\r\n\r\nprint(len(swaps))\r\nfor i, j in swaps:\r\n print(i, j)\r", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nswaps = []\r\nfor i in range(n):\r\n if a[i] != i + 1:\r\n j = a.index(i + 1)\r\n a[i], a[j] = a[j], a[i]\r\n swaps.append([i + 1, j + 1])\r\n\r\nprint(len(swaps))\r\nfor i, j in swaps:\r\n print(i, j)\r", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nops = []\r\nfor i in range(n):\r\n if a[i] != i + 1:\r\n j = i + 1\r\n while a[j - 1] != j:\r\n j += 1\r\n a[i], a[j - 1] = a[j - 1], a[i]\r\n ops.append((i + 1, j))\r\n\r\nprint(len(ops))\r\nfor i, j in ops:\r\n print(i, j)\r", "n = int(input())\na = list(map(int, input().split()))\n\nswaps = []\nfor i in range(n):\n if a[i] != i + 1:\n j = i + 1\n while a[j - 1] != j:\n j += 1\n swaps.append((i, j - 1))\n a[i], a[j - 1] = a[j - 1], a[i]\n\nprint(len(swaps))\nfor i, j in swaps:\n print(i + 1, j + 1)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nswaps = []\r\nfor i in range(n):\r\n if a[i] != i + 1:\r\n j = a.index(i + 1)\r\n a[i], a[j] = a[j], a[i]\r\n swaps.append([i + 1, j + 1])\r\n\r\nprint(len(swaps))\r\nfor i, j in swaps:\r\n print(i, j)\r", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nans = []\r\nfor i in range(n):\r\n if a[i] != i + 1:\r\n j = a.index(i + 1)\r\n a[i], a[j] = a[j], a[i]\r\n ans.append([i + 1, j + 1])\r\n\r\nprint(len(ans))\r\nfor i in ans:\r\n print(*i)\r", "n = int(input())\na = list(map(int, input().split()))\n\nswaps = []\n\nfor i in range(n):\n while a[i] != i + 1:\n j = a.index(i + 1)\n a[i], a[j] = a[j], a[i]\n swaps.append([i + 1, j + 1])\n\nprint(len(swaps))\nfor i in swaps:\n print(*i)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nans = []\r\nfor i in range(n):\r\n if a[i] != i + 1:\r\n j = a.index(i + 1)\r\n a[i], a[j] = a[j], a[i]\r\n ans.append([i + 1, j + 1])\r\n\r\nprint(len(ans))\r\nfor i in ans:\r\n print(*i)\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\nAB = [list(map(int, input().split())) for i in range(M)]\n\ngraph = [[] for i in range(N + 1)]\n\nfor a, b in AB:\n graph[a].append(b)\n graph[b].append(a)\n\ncolor = [-1] * (N + 1)\n\ndef dfs(v, c):\n color[v] = c\n for u in graph[v]:\n if color[u] == -1:\n dfs(u, c ^ 1)\n\nans = 0\nfor i in range(1, N + 1):\n if color[i] == -1:\n dfs(i, 0)\n for i in range(1, N + 1):\n if color[i] == 0:\n ans += len([u for u in graph[i] if color[u] == 1])\n else:\n ans += len([u for u in graph[i] if color[u] == 0])\n\nprint(ans // 2)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\nAB = [list(map(int, input().split())) for i in range(M)]\n\nfrom collections import deque\n\ngraph = [[] for i in range(N + 1)]\n\nfor a, b in AB:\n graph[a].append(b)\n graph[b].append(a)\n\ncolor = [-1] * (N + 1)\ncolor[0] = 0\n\nq = deque([0])\n\nwhile q:\n now = q.popleft()\n for next in graph[now]:\n if color[next] == -1:\n color[next] = 1 - color[now]\n q.append(next)\n\nans = 0\n\nfor i in range(1, N + 1):\n for j in graph[i]:\n if color[i] == color[j]:\n ans += 1\n\nprint(ans // 2)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\nE = [[] for i in range(N + 1)]\n\nfor i in range(M):\n a, b = list(map(int, input().split()))\n E[a].append(b)\n E[b].append(a)\n\nANS = 0\n\nfor i in range(1, N + 1):\n if len(E[i]) > 0:\n ANS += len(E[i]) * (len(E[i]) - 1) // 2\n\nprint(ANS)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\nAB = [list(map(int, input().split())) for i in range(M)]\n\nfrom collections import defaultdict\n\nG = defaultdict(set)\n\nfor a, b in AB:\n G[a].add(b)\n G[b].add(a)\n\nfrom collections import deque\n\nans = 0\n\nfor i in range(1, N + 1):\n if len(G[i]) == 0:\n continue\n q = deque([i])\n seen = set([i])\n while q:\n v = q.popleft()\n for nv in G[v]:\n if nv not in seen:\n seen.add(nv)\n q.append(nv)\n ans += len(G[nv]) - 1\n for v in seen:\n G[v] = set()\n\nprint(ans // 2)", "from collections import deque\n\n(n, m) = map(int, input().split())\ng = [[] for _ in range(n)]\nfor _ in range(m):\n (a, b) = map(int, input().split())\n (a, b) = (a - 1, b - 1)\n g[a].append(b)\n g[b].append(a)\n\ncolor = [-1] * n\ncolor[0] = 0\nq = deque([0])\nwhile q:\n v = q.popleft()\n for nv in g[v]:\n if color[nv] == -1:\n color[nv] = color[v] ^ 1\n q.append(nv)\n\nans = 0\nfor i in range(n):\n for nv in g[i]:\n if color[i] == color[nv]:\n ans += 1\nprint(ans // 2)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\nAB = [list(map(int, input().split())) for _ in range(M)]\n\nfrom collections import deque\n\nG = [[] for _ in range(N + 1)]\nfor a, b in AB:\n G[a].append(b)\n G[b].append(a)\n\ncolor = [-1] * (N + 1)\ncolor[1] = 0\n\nQ = deque([1])\n\nwhile Q:\n v = Q.popleft()\n for nv in G[v]:\n if color[nv] == -1:\n color[nv] = 1 - color[v]\n Q.append(nv)\n\nans = 0\nfor i in range(1, N + 1):\n for nv in G[i]:\n if color[i] == color[nv]:\n ans += 1\n\nprint(ans // 2)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\nAB = [list(map(int, input().split())) for i in range(M)]\n\nfrom collections import defaultdict\n\nG = defaultdict(set)\n\nfor a, b in AB:\n G[a].add(b)\n G[b].add(a)\n\nfrom collections import deque\n\nans = 0\n\nfor i in range(1, N + 1):\n if i not in G:\n continue\n d = deque([i])\n seen = set([i])\n while d:\n v = d.popleft()\n for nv in G[v]:\n if nv not in seen:\n seen.add(nv)\n d.append(nv)\n ans += 1\n G[nv].remove(v)\n G[i] = set()\n\nprint(ans)", "from collections import deque\n\n(n, m) = map(int, input().split())\ngraph = [[] for _ in range(n + 1)]\nfor _ in range(m):\n (a, b) = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\n\nseen = [False] * (n + 1)\ndist = [0] * (n + 1)\nq = deque()\nfor i in range(1, n + 1):\n if not seen[i]:\n q.append(i)\n seen[i] = True\n while q:\n node = q.popleft()\n for adj in graph[node]:\n if not seen[adj]:\n seen[adj] = True\n q.append(adj)\n dist[adj] = dist[node] + 1\n\nans = 0\nfor i in range(1, n + 1):\n ans += (dist[i] - 1) * (dist[i] - 2) // 2\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\nAB = [list(map(int, input().split())) for i in range(M)]\n\nfrom collections import deque\n\ngraph = [[] for i in range(N + 1)]\n\nfor a, b in AB:\n graph[a].append(b)\n graph[b].append(a)\n\ncolor = [-1] * (N + 1)\n\ncnt = 0\n\nfor i in range(1, N + 1):\n if color[i] == -1:\n q = deque()\n q.append(i)\n color[i] = 0\n while q:\n now = q.popleft()\n for j in graph[now]:\n if color[j] == -1:\n color[j] = 1 - color[now]\n q.append(j)\n elif color[j] == color[now]:\n cnt += 1\n\nprint(cnt)", "from collections import deque\n\n(n, m) = map(int, input().split())\ng = [[] for _ in range(n)]\nfor _ in range(m):\n (a, b) = map(int, input().split())\n (a, b) = (a - 1, b - 1)\n g[a].append(b)\n g[b].append(a)\n\nseen = [False] * n\ndist = [-1] * n\nq = deque()\nfor i in range(n):\n if not seen[i]:\n q.append(i)\n seen[i] = True\n dist[i] = 0\n while q:\n v = q.popleft()\n for nv in g[v]:\n if not seen[nv]:\n seen[nv] = True\n dist[nv] = dist[v] + 1\n q.append(nv)\n\nans = 0\nfor i in range(n):\n for nv in g[i]:\n if dist[i] > 0 and dist[nv] > 0:\n ans += dist[i] * dist[nv]\nprint(ans // 2)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\nfrom collections import deque\n\nN, A, X, Y = map(int, input().split())\n\nINF = 10**18 + 10\ndp = [INF] * (N + 1)\ndp[0] = 0\nq = deque([0])\nwhile q:\n n = q.popleft()\n if n * A <= N:\n q.append(n * A)\n dp[n * A] = min(dp[n * A], dp[n] + X)\n for i in range(1, 7):\n if n * i <= N:\n q.append(n * i)\n dp[n * i] = min(dp[n * i], dp[n] + Y)\nprint(dp[N])", "from sys import stdin, stdout\n\nN, A, X, Y = map(int, stdin.readline().split())\n\ndp = [float(\"inf\")] * (N + 1)\ndp[0] = 0\n\nfor i in range(1, N + 1):\n dp[i] = min(dp[i], dp[i - 1] + X + (i % A) * (Y - X) / A)\n for j in range(1, 6):\n dp[i] = min(dp[i], dp[i * j] + Y)\n\nstdout.write(str(dp[N]))", "import sys\n\ninput = sys.stdin.readline\nfrom collections import deque\n\nN, A, X, Y = map(int, input().split())\n\nINF = 10**18 + 10\ndp = [[INF] * (A + 1) for _ in range(61)]\ndp[0][1] = 0\nfor i in range(60):\n for j in range(1, A + 1):\n if dp[i][j] == INF:\n continue\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + X)\n for k in range(1, 7):\n if j % k == 0:\n dp[i + 1][j // k] = min(dp[i + 1][j // k], dp[i][j] + Y)\nans = INF\nfor i in range(61):\n ans = min(ans, dp[i][1])\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(N, A, X, Y) = map(int, input().split())\nINF = 10**18 + 1\ndp = [[INF] * 20 for _ in range(61)]\ndp[0][0] = 0\nfor i in range(60):\n for j in range(20):\n if i + 1 < 60:\n dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + X)\n if j + 1 < 20:\n dp[i][j + 1] = min(dp[i][j + 1], dp[i][j] + Y)\n if i > 0:\n dp[i - 1][j + 1] = min(dp[i - 1][j + 1], dp[i][j] + Y)\n if N % (i + 2) == 0:\n dp[N.bit_length() - 1][j + 1] = min(\n dp[N.bit_length() - 1][j + 1], dp[i][j] + Y\n )\n if N % (A * (i + 1) + 1) == 0:\n dp[N.bit_length() - 1][j] = min(\n dp[N.bit_length() - 1][j], dp[i][j] + (N // (A * (i + 1) + 1)) * X\n )\nprint(dp[N.bit_length() - 1][20])", "import sys\n\ninput = sys.stdin.readline\n(N, A, X, Y) = map(int, input().split())\nINF = 10**18 + 1\ndp = [[[INF for i in range(7)] for j in range(2)] for k in range(61)]\ndp[0][0][1] = Y * (1.0 / 6)\ndp[0][1][1] = X\nfor i in range(1, 61):\n if N >= i:\n N //= A\n dp[i][0][1] = min(dp[i][0][1], dp[i - 1][1][1] + X)\n dp[i][1][1] = min(dp[i][1][1], dp[i - 1][1][1] + Y * (1.0 / 6))\n for j in range(2, 7):\n dp[i][0][j] = min(dp[i][0][j], dp[i - 1][0][j - 1] + Y * (1.0 / 6))\n dp[i][1][j] = min(dp[i][1][j], dp[i - 1][0][j - 1] + X)\n dp[i][0][j] = min(dp[i][0][j], dp[i - 1][1][j - 1] + Y * (1.0 / 6))\n dp[i][1][j] = min(dp[i][1][j], dp[i - 1][1][j - 1] + X)\nprint(min(dp[60][0][6], dp[60][1][6]))", "import sys\n\ninput = sys.stdin.readline\n(N, A, X, Y) = map(int, input().split())\ndp = [10**20] * (N + 1)\ndp[0] = 0\nfor i in range(N, 0, -1):\n dp[i] = min(dp[i], dp[i - 1] + X, dp[i // A] + Y * (1 + (i - 1) // A) * 5 / 6)\nprint(dp[N])", "from collections import deque\n\nN, A, X, Y = map(int, input().split())\n\nINF = 10**18 + 1\ndp = [INF] * (N + 1)\ndp[0] = 0\nq = deque([0])\nwhile q:\n n = q.popleft()\n if n == 0:\n continue\n if dp[n] < dp[n // A] + X:\n continue\n dp[n // A] = min(dp[n // A], dp[n] - X)\n for i in range(1, 7):\n m = n // i\n if dp[m] > dp[n] - Y:\n dp[m] = dp[n] - Y\n q.append(m)\nprint(dp[N])", "import sys\n\ninput = sys.stdin.readline\nfrom collections import deque\n\nN, A, X, Y = map(int, input().split())\n\nINF = 10**18 + 10\ndp = [[[INF for i in range(7)] for j in range(A)] for k in range(100)]\n\nfor i in range(A):\n dp[0][i][1] = Y\n dp[0][i][A] = X\n\nfor i in range(1, 100):\n for j in range(A):\n for k in range(1, A):\n dp[i][j][k] = min(dp[i - 1][j][k], dp[i - 1][j][1] + Y)\n for k in range(A, 7):\n dp[i][j][k] = dp[i - 1][j][k]\n\nans = 0\nwhile N > 0:\n for i in range(A):\n ans += dp[99][i][N % A + 1]\n N //= A\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(N, A, X, Y) = map(int, input().split())\ndp = [10**20] * (N + 1)\ndp[0] = 0\nfor i in range(N):\n if dp[i] < 10**20:\n dp[i * A] = min(dp[i * A], dp[i] + X)\n for j in range(1, 7):\n dp[i * j] = min(dp[i * j], dp[i] + Y)\nprint(dp[N])", "import sys\n\ninput = sys.stdin.readline\n(N, A, X, Y) = map(int, input().split())\nINF = 10**18 + 1\ndp = [[INF] * 20 for _ in range(60)]\ndp[0][0] = 0\nfor i in range(60):\n for j in range(20):\n if i > 0:\n dp[i][j] = min(dp[i][j], dp[i - 1][j] + Y)\n if j > 0:\n dp[i][j] = min(dp[i][j], dp[i][j - 1] + X)\n if i > 0:\n for k in range(1, 7):\n dp[i - 1][j] = min(dp[i - 1][j], dp[i][j] + Y - dp[i - 1][j // k])\nprint(dp[59][19])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "a = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nt = sum(a)\naoki = sum(b)\n\nprint(t - aoki + 1)", "a = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nt = sum(a)\naoki = sum(b)\n\nprint(t - aoki + 1)", "a = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nt_score = sum(a)\na_score = sum(b)\n\nprint(t_score - a_score + 1)", "a = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nt_score = sum(a)\na_score = sum(b)\n\nprint(t_score - a_score + 1)", "a = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nt_score = sum(a)\na_score = sum(b)\n\nprint(t_score - a_score + 1)", "a = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nt = sum(a)\naoki = sum(b)\n\nprint(t - aoki + 1)", "a = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nt = 0\naoki = 0\nfor i in range(9):\n t += a[i]\nfor i in range(8):\n aoki += b[i]\n\nprint(t - aoki + 1)", "a = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nt = sum(a)\naoki = sum(b)\n\nprint(t - aoki + 1)", "a = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nt_score = sum(a)\na_score = sum(b)\n\nprint(t_score - a_score + 1)", "a = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nt = sum(a)\naoki = sum(b)\n\nprint(t - aoki + 1)" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = []\nb = []\nfor i in range(n):\n a.append(input())\nfor i in range(n):\n b.append(input())\nfor i in range(n):\n for j in range(n):\n if a[i][j] != b[i][j]:\n print(i+1, j+1)\n exit()", "n = int(input())\na = []\nb = []\nfor i in range(n):\n a.append(input())\nfor i in range(n):\n b.append(input())\nfor i in range(n):\n for j in range(n):\n if a[i][j] != b[i][j]:\n print(i + 1, j + 1)\n exit()", "n = int(input())\na = []\nfor i in range(n):\n a.append(input())\nb = []\nfor i in range(n):\n b.append(input())\nfor i in range(n):\n for j in range(n):\n if a[i][j] != b[i][j]:\n print(i + 1, j + 1)\n exit()", "n = int(input())\na = []\nfor i in range(n):\n a.append(input())\nb = []\nfor i in range(n):\n b.append(input())\nfor i in range(n):\n for j in range(n):\n if a[i][j] != b[i][j]:\n print(i + 1, j + 1)\n exit()", "n = int(input())\na = []\nfor i in range(n):\n a.append(input())\nb = []\nfor i in range(n):\n b.append(input())\nfor i in range(n):\n for j in range(n):\n if a[i][j] != b[i][j]:\n print(i + 1, j + 1)\n exit()", "n = int(input())\na = []\nb = []\nfor i in range(n):\n a.append(input())\nfor i in range(n):\n b.append(input())\nfor i in range(n):\n for j in range(n):\n if a[i][j] != b[i][j]:\n print(i + 1, j + 1)\n exit()", "n = int(input())\na = []\nb = []\nfor _ in range(n):\n a.append(input())\nfor _ in range(n):\n b.append(input())\nfor i in range(n):\n for j in range(n):\n if a[i][j] != b[i][j]:\n print(i + 1, j + 1)\n exit()", "n = int(input())\na = []\nb = []\nfor i in range(n):\n a.append(input())\nfor i in range(n):\n b.append(input())\nfor i in range(n):\n for j in range(n):\n if a[i][j] != b[i][j]:\n print(i + 1, j + 1)\n exit()", "n = int(input())\na = []\nb = []\nfor i in range(n):\n a.append(input())\nfor i in range(n):\n b.append(input())\nfor i in range(n):\n for j in range(n):\n if a[i][j] != b[i][j]:\n print(i + 1, j + 1)\n exit()", "n = int(input())\na = []\nb = []\nfor i in range(n):\n a.append(input())\nfor i in range(n):\n b.append(input())\nfor i in range(n):\n for j in range(n):\n if a[i][j] != b[i][j]:\n print(i + 1, j + 1)\n exit()" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = list(map(int, input().split()))\n\nballs = []\nfor i in range(n):\n balls.append(2 ** a[i])\n\ncount = 0\nwhile len(balls) > 0:\n count += 1\n if len(balls) == 1:\n break\n if balls[-1] == balls[-2]:\n balls[-2] = balls[-1] + balls[-2]\n del balls[-1]\n\nprint(count)", "n = int(input())\na = [int(i) for i in input().split()]\n\nstack = []\nfor i in a:\n if not stack:\n stack.append(i)\n elif stack[-1] == i:\n stack.pop()\n stack.append(i + 1)\n else:\n stack.append(i)\n\nprint(len(stack))", "n = int(input())\na = list(map(int, input().split()))\n\nballs = []\nfor i in range(n):\n balls.append(2 ** a[i])\n\ncount = 0\nwhile len(balls) > 0:\n count += 1\n if len(balls) == 1:\n break\n if balls[-1] != balls[-2]:\n break\n balls[-2] = balls[-1] + balls[-2]\n del balls[-1]\n\nprint(count)", "n = int(input())\na = list(map(int, input().split()))\n\nstack = []\nfor i in a:\n if not stack:\n stack.append(i)\n elif stack[-1] == i:\n stack.pop()\n stack.append(i + 1)\n\nprint(len(stack))", "n = int(input())\na = list(map(int, input().split()))\n\nballs = []\nfor i in range(n):\n balls.append(2 ** a[i])\n\ncount = 0\nwhile len(balls) > 0:\n count += 1\n if len(balls) == 1:\n break\n if balls[-1] == balls[-2]:\n balls[-2] = balls[-1] + balls[-2]\n del balls[-1]\n\nprint(count)", "n = int(input())\na = list(map(int, input().split()))\n\nballs = []\nfor i in range(n):\n balls.append(2 ** a[i])\n\ncount = 0\nwhile len(balls) > 0:\n count += 1\n if len(balls) == 1:\n break\n if balls[-1] != balls[-2]:\n break\n balls[-2:] = [balls[-2] + balls[-1]]\n\nprint(count)", "n = int(input())\na = [int(i) for i in input().split()]\n\nstack = []\nfor i in a:\n if not stack:\n stack.append(i)\n elif stack[-1] == i:\n stack.pop()\n stack.append(i + 1)\n else:\n stack.append(i)\n\nprint(len(stack))", "n = int(input())\na = list(map(int, input().split()))\n\nstack = []\nfor i in a:\n if not stack:\n stack.append(i)\n elif stack[-1] == i:\n stack.pop()\n stack.append(i + 1)\n else:\n stack.append(i)\n\nprint(len(stack))", "n = int(input())\na = list(map(int, input().split()))\n\nstack = []\nfor i in a:\n if not stack:\n stack.append(i)\n elif stack[-1] == i:\n stack.pop()\n stack.append(i + 1)\n\nprint(len(stack))", "n = int(input())\na = list(map(int, input().split()))\n\nballs = []\nfor i in range(n):\n if not balls:\n balls.append(2 ** a[i])\n else:\n if balls[-1] == balls[-2]:\n balls.pop()\n balls.pop()\n balls.append(balls[-1] + 2 ** a[i])\n\nprint(len(balls))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\n(h, w) = map(int, input().split())\ns = [input() for _ in range(h)]\ndx = [0, 0, -1, 1]\ndy = [-1, 1, 0, 0]\nans = 0\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \".\":\n q = deque([(i, j)])\n cnt = 0\n while q:\n (x, y) = q.popleft()\n cnt += 1\n for k in range(4):\n nx = x + dx[k]\n ny = y + dy[k]\n if 0 <= nx < h and 0 <= ny < w and s[nx][ny] == \".\":\n q.append((nx, ny))\n s[nx][ny] = \"#\"\n ans = max(ans, cnt)\nprint(ans)", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = [input() for _ in range(h)]\ndx = [0, 0, 1, -1]\ndy = [1, -1, 0, 0]\nmax_deg = 0\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \".\":\n q = deque([(i, j)])\n visited = [[False] * w for _ in range(h)]\n visited[i][j] = True\n deg = 0\n while q:\n (x, y) = q.popleft()\n deg += 1\n for k in range(4):\n nx = x + dx[k]\n ny = y + dy[k]\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and grid[nx][ny] == \".\":\n q.append((nx, ny))\n visited[nx][ny] = True\n max_deg = max(max_deg, deg)\nprint(max_deg)", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = [input() for _ in range(h)]\n\ndx = [-1, 0, 1, 0]\ndy = [0, -1, 0, 1]\n\nmax_area = 0\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \".\":\n area = 1\n q = deque([(i, j)])\n visited = [[False] * w for _ in range(h)]\n while q:\n (x, y) = q.popleft()\n for k in range(4):\n nx = x + dx[k]\n ny = y + dy[k]\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and grid[nx][ny] == \".\":\n visited[nx][ny] = True\n q.append((nx, ny))\n area += 1\n max_area = max(max_area, area)\n\nprint(max_area)", "from collections import deque\n\n(h, w) = map(int, input().split())\ns = []\nfor _ in range(h):\n s.append(input())\n\ndx = [0, 0, -1, 1]\ndy = [-1, 1, 0, 0]\n\nans = 0\nfor i in range(h):\n for j in range(w):\n if s[i][j] == \".\":\n q = deque([(i, j)])\n visited = [[False] * w for _ in range(h)]\n visited[i][j] = True\n cnt = 0\n while q:\n (x, y) = q.popleft()\n cnt += 1\n for k in range(4):\n nx = x + dx[k]\n ny = y + dy[k]\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and s[nx][ny] == \".\":\n visited[nx][ny] = True\n q.append((nx, ny))\n ans = max(ans, cnt)\nprint(ans)", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = [input() for _ in range(h)]\n\ndx = [-1, 0, 1, 0]\ndy = [0, 1, 0, -1]\n\nmax_area = 0\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \".\":\n area = 1\n q = deque([(i, j)])\n visited = [[False] * w for _ in range(h)]\n while q:\n (x, y) = q.popleft()\n visited[x][y] = True\n for k in range(4):\n nx = x + dx[k]\n ny = y + dy[k]\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and grid[nx][ny] == \".\":\n q.append((nx, ny))\n visited[nx][ny] = True\n area += 1\n max_area = max(max_area, area)\n\nprint(max_area)", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = []\nfor _ in range(h):\n grid.append(list(input()))\n\nmax_free = 0\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \".\":\n q = deque([(i, j)])\n visited = set([(i, j)])\n while q:\n (x, y) = q.popleft()\n for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n nx = x + dx\n ny = y + dy\n if 0 <= nx < h and 0 <= ny < w and grid[nx][ny] == \".\":\n if (nx, ny) not in visited:\n visited.add((nx, ny))\n q.append((nx, ny))\n max_free = max(max_free, len(visited))\n\nprint(max_free)", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = [input() for _ in range(h)]\ndx = [1, 0, -1, 0]\ndy = [0, 1, 0, -1]\nmax_free = 0\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \".\":\n q = deque([(i, j)])\n visited = [[False] * w for _ in range(h)]\n visited[i][j] = True\n free = 0\n while q:\n (x, y) = q.popleft()\n free += 1\n for k in range(4):\n nx = x + dx[k]\n ny = y + dy[k]\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and grid[nx][ny] == \".\":\n q.append((nx, ny))\n visited[nx][ny] = True\n max_free = max(max_free, free)\nprint(max_free)", "from collections import deque\n\n(H, W) = map(int, input().split())\nS = [input() for _ in range(H)]\n\ndx = [0, 0, -1, 1]\ndy = [-1, 1, 0, 0]\n\nans = 0\nfor i in range(H):\n for j in range(W):\n if S[i][j] == \".\":\n q = deque([(i, j)])\n visited = [[False] * W for _ in range(H)]\n visited[i][j] = True\n cnt = 0\n while q:\n (x, y) = q.popleft()\n cnt += 1\n for k in range(4):\n nx = x + dx[k]\n ny = y + dy[k]\n if 0 <= nx < H and 0 <= ny < W and (not visited[nx][ny]) and (S[nx][ny] == \".\"):\n visited[nx][ny] = True\n q.append((nx, ny))\n ans = max(ans, cnt)\nprint(ans)", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = [input() for _ in range(h)]\ndx = [0, 0, 1, -1]\ndy = [1, -1, 0, 0]\nmax_deg = 0\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \".\":\n q = deque([(i, j)])\n visited = [[False] * w for _ in range(h)]\n visited[i][j] = True\n deg = 0\n while q:\n (x, y) = q.popleft()\n deg += 1\n for k in range(4):\n nx = x + dx[k]\n ny = y + dy[k]\n if 0 <= nx < h and 0 <= ny < w and not visited[nx][ny] and grid[nx][ny] == \".\":\n visited[nx][ny] = True\n q.append((nx, ny))\n max_deg = max(max_deg, deg)\nprint(max_deg)", "from collections import deque\n\n(h, w) = map(int, input().split())\ngrid = []\nfor _ in range(h):\n grid.append(list(input()))\n\nmax_free = 0\nfor i in range(h):\n for j in range(w):\n if grid[i][j] == \".\":\n free = 1\n q = deque([(i, j)])\n while q:\n (x, y) = q.popleft()\n for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\n nx = x + dx\n ny = y + dy\n if 0 <= nx < h and 0 <= ny < w and grid[nx][ny] == \".\":\n grid[nx][ny] = \"#\"\n q.append((nx, ny))\n free += 1\n max_free = max(max_free, free)\nprint(max_free)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "def main():\n n = int(input())\n points = []\n for _ in range(n):\n x, y = map(int, input().split())\n points.append((x, y))\n points.sort(key=lambda p: p[0] + p[1])\n ans = 0\n for i in range(n - 1):\n for j in range(i + 1, n):\n dx = points[j][0] - points[i][0]\n dy = points[j][1] - points[i][1]\n if dx < 0 or dy < 0 or (dx + dy) % 2 != 0:\n continue\n dist = abs(dx // 2 + dy // 2)\n if dist % 2 == 0:\n ans += dist\n else:\n ans += dist + 1\n print(ans)\n\n\nmain()", "def main():\n n = int(input())\n points = []\n for i in range(n):\n x, y = map(int, input().split())\n points.append((x + y) % 2, x - y)\n points.sort()\n ans = 0\n for i in range(n):\n for j in range(i + 1, n):\n dx, dy = points[j][1] - points[i][1], points[j][0] - points[i][0]\n if dx < 0 or dy < 0:\n continue\n if dx % 2 != dy % 2:\n continue\n ans += (dx + dy) // 2\n print(ans)\n\n\nmain()", "def main():\n n = int(input())\n points = []\n for _ in range(n):\n x, y = map(int, input().split())\n points.append((x, y))\n points.sort(key=lambda p: p[0] + p[1])\n total_dist = 0\n for i in range(n):\n for j in range(i + 1, n):\n x_diff = abs(points[i][0] - points[j][0])\n y_diff = abs(points[i][1] - points[j][1])\n if x_diff % 2 != y_diff % 2:\n continue\n dist = (x_diff + y_diff) // 2\n if dist % 2 == 1:\n total_dist += dist\n print(total_dist)\n\n\nmain()", "def main():\n n = int(input())\n points = []\n for _ in range(n):\n x, y = map(int, input().split())\n points.append((x, y))\n points.sort(key=lambda p: p[0] + p[1])\n dist = 0\n for i in range(n):\n for j in range(i + 1, n):\n dx, dy = points[j][0] - points[i][0], points[j][1] - points[i][1]\n if dx != dy and dx != -dy:\n continue\n dist += abs(dx) // 2\n print(dist)\n\n\nmain()", "def dist(x1, y1, x2, y2):\n return max(abs(x1 - x2), abs(y1 - y2))\n\n\nn = int(input())\npoints = []\nfor _ in range(n):\n x, y = map(int, input().split())\n points.append((x, y))\npoints.sort()\n\ntotal_dist = 0\nfor i in range(n - 1):\n x1, y1 = points[i]\n for j in range(i + 1, n):\n x2, y2 = points[j]\n if dist(x1, y1, x2, y2) % 2 == 1:\n continue\n total_dist += dist(x1, y1, x2, y2) // 2\nprint(total_dist)", "def dist(p1, p2):\n return max(abs(p1[0] - p2[0]), abs(p1[1] - p2[1]))\n\n\ndef main():\n n = int(input())\n points = []\n for _ in range(n):\n x, y = map(int, input().split())\n points.append((x, y))\n points.sort(key=lambda p: p[0] + p[1])\n total_dist = 0\n for i in range(n):\n for j in range(i + 1, n):\n total_dist += dist(points[i], points[j])\n print(total_dist)\n\n\nmain()", "def main():\n n = int(input())\n points = []\n for _ in range(n):\n x, y = map(int, input().split())\n points.append((x + y) % 2, x - y)\n points.sort()\n ans = 0\n for i in range(n):\n for j in range(i + 1, n):\n dx, dy = points[j][1] - points[i][1], points[j][0] - points[i][0]\n if dx < 0 or dy < 0:\n continue\n ans += min(dx, dy)\n print(ans)\n\n\nmain()", "def main():\n n = int(input())\n points = []\n for _ in range(n):\n x, y = map(int, input().split())\n points.append((x + y) % 2, x - y)\n points.sort()\n ans = 0\n for i in range(n):\n for j in range(i + 1, n):\n dx, dy = points[j][1] - points[i][1], points[j][0] - points[i][0]\n if dx < 0 or dy < 0:\n continue\n if dx % 2 != dy % 2:\n continue\n ans += abs(dx - dy) // 2\n print(ans)\n\n\nmain()", "def main():\n n = int(input())\n points = []\n for _ in range(n):\n x, y = map(int, input().split())\n points.append((x, y))\n points.sort()\n ans = 0\n for i in range(n):\n for j in range(i + 1, n):\n x1, y1 = points[i]\n x2, y2 = points[j]\n dx = abs(x1 - x2)\n dy = abs(y1 - y2)\n if dx % 2 != dy % 2:\n continue\n if dx % 2 == 0:\n ans += min(dx // 2, dy)\n else:\n ans += (dx + 1) // 2\n print(ans)\n\n\nmain()", "def dist(x1, y1, x2, y2):\n return max(abs(x1 - x2), abs(y1 - y2))\n\n\nn = int(input())\npoints = []\nfor _ in range(n):\n x, y = map(int, input().split())\n points.append((x, y))\npoints.sort(key=lambda p: p[0] + p[1])\n\ntotal_dist = 0\nfor i in range(n):\n for j in range(i + 1, n):\n total_dist += dist(*points[i], *points[j])\nprint(total_dist)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += (n - 1 - i) * (a[i + 1] - a[i])\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += (n - 1 - i) * (a[i + 1] - a[i])\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += (n - 1 - i) * (a[i + 1] - a[i])\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nans = 0\r\nfor i in range(n - 1):\r\n ans += a[i + 1] - a[i]\r\nprint(ans)\r", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nans = 0\r\nfor i in range(n - 1):\r\n ans += (n - 1 - i) * (a[i + 1] - a[i])\r\nprint(ans)\r", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += (n - 1 - i) * (a[i + 1] - a[i])\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += (a[i + 1] - a[i]) * (n - i - 1)\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += a[i + 1] * (n - i - 1) - a[i] * (n - i - 1) - a[i]\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += (n - 1 - i) * (a[i + 1] - a[i])\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nans = 0\nfor i in range(n - 1):\n ans += (n - 1 - i) * (a[i + 1] - a[i])\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n, x, y, z = map(int, input().split())\nif x > y:\n if z > x and z < y:\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n if z > y and z < x:\n print(\"Yes\")\n else:\n print(\"No\")", "n, x, y, z = map(int, input().split())\nif min(x, y) <= z <= max(x, y):\n print(\"Yes\")\nelse:\n print(\"No\")", "n, x, y, z = map(int, input().split())\nif min(x, y) < z < max(x, y):\n print(\"Yes\")\nelse:\n print(\"No\")", "n, x, y, z = map(int, input().split())\nif x > y:\n if z > x and z < y:\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n if z > y and z < x:\n print(\"Yes\")\n else:\n print(\"No\")", "n, x, y, z = map(int, input().split())\nif x > y:\n for i in range(x, 1, -1):\n if i == z:\n print(\"Yes\")\n return\nelse:\n for i in range(x, n + 1):\n if i == z:\n print(\"Yes\")\n return\nprint(\"No\")", "n, x, y, z = map(int, input().split())\nif min(x, y) <= z <= max(x, y):\n print(\"Yes\")\nelse:\n print(\"No\")", "n, x, y, z = map(int, input().split())\nif x < y:\n if z > x and z < y:\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n if z < x and z > y:\n print(\"Yes\")\n else:\n print(\"No\")", "n, x, y, z = map(int, input().split())\nif min(x, y) <= z <= max(x, y):\n print(\"Yes\")\nelse:\n print(\"No\")", "n, x, y, z = map(int, input().split())\nif x > y:\n for i in range(x, 1, -1):\n if i == z:\n print(\"Yes\")\n break\n else:\n print(\"No\")\nelse:\n for i in range(x, n + 1):\n if i == z:\n print(\"Yes\")\n break\n else:\n print(\"No\")", "n, x, y, z = map(int, input().split())\nif x > y:\n for i in range(x, 1, -1):\n if i == z:\n print(\"Yes\")\n exit()\nelse:\n for i in range(x, n + 1):\n if i == z:\n print(\"Yes\")\n exit()\nprint(\"No\")" ], "pass1_list": [ false, true, true, false, false, true, true, true, false, false ], "metadata_list": [] }, { "code_list": [ "s = input()\nt = input()\ni = j = 0\nans = []\nwhile i < len(t):\n if s[j] == t[i]:\n ans.append(i + 1)\n j += 1\n i += 1\nprint(*ans)", "s = input()\nt = input()\n\ni = j = 0\nres = []\n\nwhile i < len(t):\n if j < len(s) and s[j] == t[i]:\n res.append(i + 1)\n j += 1\n i += 1\n\nprint(*res)", "s = input()\nt = input()\n\ni = j = 0\nres = []\nwhile i < len(t):\n if j < len(s) and s[j] == t[i]:\n res.append(i + 1)\n j += 1\n i += 1\n\nprint(*res)", "s = input()\nt = input()\n\ni = j = 0\nres = []\nwhile j < len(t):\n if i < len(s) and s[i] == t[j]:\n res.append(j + 1)\n i += 1\n j += 1\n\nprint(*res)", "s = input()\nt = input()\n\ni = j = 0\nans = []\nwhile i < len(t):\n if j < len(s) and s[j] == t[i]:\n ans.append(i + 1)\n j += 1\n i += 1\n\nprint(*ans)", "s = input()\nt = input()\n\ni = j = 0\nans = []\nwhile j < len(t):\n if i < len(s) and s[i] == t[j]:\n ans.append(j + 1)\n i += 1\n j += 1\n\nprint(*ans)", "s = input()\nt = input()\n\ni = j = 0\nres = []\nwhile j < len(t):\n if i < len(s) and s[i] == t[j]:\n res.append(j + 1)\n i += 1\n j += 1\n\nprint(*res)", "s = input()\nt = input()\n\nans = []\ni = j = 0\nwhile i < len(t):\n if j < len(s) and t[i] == s[j]:\n ans.append(i + 1)\n i += 1\n j += 1\n else:\n i += 1\n\nprint(*ans)", "s = input()\nt = input()\n\ni = j = 0\nans = []\nwhile i < len(t):\n if j < len(s) and s[j] == t[i]:\n ans.append(i + 1)\n j += 1\n i += 1\n\nprint(*ans)", "s = input()\nt = input()\n\nans = []\ni = j = 0\nwhile i < len(t):\n if j < len(s) and t[i] == s[j]:\n ans.append(i + 1)\n i += 1\n j += 1\n else:\n i += 1\n\nprint(*ans)" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\na.sort(key=lambda x: x[1] - x[0], reverse=True)\nans = 0\nfor i in range(n):\n ans += a[i][1]\nprint(ans)", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\na.sort(key=lambda x: x[1] - x[0], reverse=True)\nans = 0\nfor i in range(n):\n ans += a[i][1]\nprint(ans)", "n = int(input())\nab = []\nfor i in range(n):\n a, b = map(int, input().split())\n ab.append((b - a, a))\nab.sort(reverse=True)\nans = 0\nfor i in range(n):\n ans += ab[i][0] + ab[i][1] * i\nprint(ans)", "n = int(input())\na = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append((y - x, x))\na.sort()\nans = 0\nfor i in range(n):\n ans += a[i][0] + a[i][1]\nprint(ans)", "n = int(input())\na = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append((y - x, x))\na.sort(reverse=True)\nans = 0\nfor i in range(n):\n ans += a[i][1]\n ans += a[i][0]\nprint(ans)", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\na.sort(key=lambda x: x[1] - x[0], reverse=True)\nans = 0\nfor i in range(n):\n ans += a[i][1] - a[i][0]\nprint(ans)", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\na.sort(key=lambda x: x[1] - x[0], reverse=True)\nans = 0\nfor i in range(n):\n ans += a[i][1]\nprint(ans)", "n = int(input())\na = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append((y - x, x))\na.sort(reverse=True)\nans = 0\nfor i in range(n):\n ans += a[i][1]\n ans += a[i][0]\nprint(ans)", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\na.sort(key=lambda x: x[1] - x[0], reverse=True)\nans = 0\nfor i in range(n):\n ans += a[i][1] - a[i][0]\nprint(ans)", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\na.sort(key=lambda x: x[1] - x[0], reverse=True)\nans = 0\nfor i in range(n):\n ans += a[i][1]\nprint(ans)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import deque\n\n(n, k) = map(int, input().split())\np = list(map(int, input().split()))\nindex = [0] * (n + 1)\nfor i in range(n):\n index[p[i]] = i\nq = deque()\nfor i in range(n):\n if i < p[i] - 1:\n q.append(i)\n while q and q[0] < i - k:\n q.popleft()\n if len(q) >= k:\n print(i - q[0])\n break", "from collections import defaultdict, deque\n\n(n, k) = map(int, input().split())\np = list(map(int, input().split()))\n\nindex = {v: i for (i, v) in enumerate(p)}\n\ngraph = defaultdict(list)\nfor i in range(n):\n graph[p[i]].append(i)\n\ndist = [float(\"inf\")] * n\ndist[0] = 0\nq = deque([0])\nwhile q:\n i = q.popleft()\n for j in graph[p[i] - 1]:\n if dist[j] == float(\"inf\"):\n dist[j] = dist[i] + 1\n q.append(j)\n\nans = float(\"inf\")\nfor i in range(n - k + 1):\n ans = min(ans, dist[i + k - 1] - dist[i])\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, k) = map(int, input().split())\np = list(map(int, input().split()))\n(l, r) = (0, n)\nwhile r - l > 1:\n m = (l + r) // 2\n ok = 1\n for i in range(n):\n if p[i] >= m and p[i] - i < k:\n ok = 0\n break\n if ok:\n l = m\n else:\n r = m\nprint(k)", "import sys\n\ninput = sys.stdin.readline\n(n, k) = map(int, input().split())\np = list(map(int, input().split()))\np_idx = [0] * (n + 1)\nfor i in range(n):\n p_idx[p[i]] = i\ndp = [10**10] * (n + 1)\ndp[p[0]] = 0\nfor i in range(1, n):\n if p[i] == p[i - 1] + 1:\n dp[p[i]] = dp[p[i - 1]]\n else:\n dp[p[i]] = min(dp[p[i]], p_idx[p[i] - 1] - p_idx[p[i] - k])\nprint(min(dp[p[-1] - k + 1 :]))", "import sys\n\ninput = sys.stdin.readline\n(n, k) = map(int, input().split())\np = list(map(int, input().split()))\n(left, right) = (0, n - k + 1)\nwhile right - left > 1:\n mid = (left + right) // 2\n flag = True\n for i in range(k):\n if p[mid + i] < p[mid + i - 1]:\n flag = False\n break\n if flag:\n right = mid\n else:\n left = mid\nprint(right)", "import sys\n\ninput = sys.stdin.readline\n(n, k) = map(int, input().split())\np = list(map(int, input().split()))\n(l, r) = (0, n)\nwhile r - l > 1:\n m = (l + r) // 2\n if all((p[i] >= i + 1 for i in range(m, n - k + 1))):\n l = m\n else:\n r = m\nans = n\nfor i in range(l, n - k + 1):\n if sorted(p[i : i + k]) == list(range(p[i], p[i] + k)):\n ans = min(ans, p[i + k - 1] - p[i])\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, K = list(map(int, input().split()))\nP = list(map(int, input().split()))\n\nindex = [0] * (N + 1)\nfor i in range(N):\n index[P[i]] = i\n\nans = N\nfor i in range(N):\n if P[i] - index[P[i]] >= K:\n ans = min(ans, index[P[i] + K - 1] - index[P[i]] + 1)\n\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, k) = map(int, input().split())\np = list(map(int, input().split()))\n(l, r) = (0, n)\nwhile r - l > 1:\n m = (l + r) // 2\n ok = True\n for i in range(n):\n if p[i] >= m + k:\n ok = False\n break\n if p[i] >= m and p[i] + k > p[i + 1]:\n ok = False\n break\n if ok:\n r = m\n else:\n l = m\nprint(r)", "import sys\n\ninput = sys.stdin.readline\n(n, k) = map(int, input().split())\np = list(map(int, input().split()))\n(left, right) = (0, n)\nwhile right - left > 1:\n mid = (left + right) // 2\n if all((x >= mid or x + n - mid >= k) for x in p[:mid]):\n left = mid\n else:\n right = mid\nans = n\nfor i in range(n):\n if i + k - 1 < n:\n ans = min(ans, p[i + k - 1] - p[i])\n else:\n ans = min(ans, n - p[i] + p[i + k - 1 - n])\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\n(n, k) = map(int, input().split())\np = list(map(int, input().split()))\n(l, r) = (0, n)\nwhile r - l > 1:\n m = (l + r) // 2\n ok = True\n for i in range(n):\n if p[i] >= m + k:\n ok = False\n break\n if p[i] >= m and p[i] + k > p[i + 1]:\n ok = False\n break\n if ok:\n r = m\n else:\n l = m\nprint(r)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\nparent = [i for i in range(N + 1)]\nrank = [0] * (N + 1)\n\n\ndef find(x):\n if parent[x] == x:\n return x\n else:\n parent[x] = find(parent[x])\n return parent[x]\n\n\ndef union(x, y):\n px = find(x)\n py = find(y)\n if rank[px] > rank[py]:\n parent[py] = px\n elif rank[px] < rank[py]:\n parent[px] = py\n else:\n parent[py] = px\n rank[px] += 1\n\n\nedge = []\nfor _ in range(M):\n K, C = list(map(int, input().split()))\n A = list(map(int, input().split()))\n for i in range(K - 1):\n for j in range(i + 1, K):\n edge.append([A[i], A[j], C])\n\nedge.sort(key=lambda x: x[2])\n\nans = 0\ncnt = 0\nfor i in range(len(edge)):\n x, y, c = edge[i]\n px = find(x)\n py = find(y)\n if px != py:\n union(x, y)\n ans += c\n cnt += 1\n if cnt == N - 1:\n break\n\nif cnt == N - 1:\n print(ans)\nelse:\n print(-1)", "from collections import defaultdict\nimport heapq\n\n(n, m) = map(int, input().split())\n\ngraph = defaultdict(list)\nvisited = [False] * (n + 1)\nparent = [None] * (n + 1)\ncost = [float(\"inf\")] * (n + 1)\ncost[1] = 0\n\nfor _ in range(m):\n (k, c) = map(int, input().split())\n nodes = list(map(int, input().split()))\n\n for i in range(k - 1):\n for j in range(i + 1, k):\n graph[nodes[i]].append((nodes[j], c))\n graph[nodes[j]].append((nodes[i], c))\n\nheap = [(0, 1)]\nwhile heap:\n (cur_cost, node) = heapq.heappop(heap)\n if visited[node]:\n continue\n visited[node] = True\n\n for next_node, next_cost in graph[node]:\n if not visited[next_node] and next_cost < cost[next_node]:\n parent[next_node] = node\n cost[next_node] = next_cost\n heapq.heappush(heap, (next_cost, next_node))\n\nif not all(visited[1:]):\n print(-1)\nelse:\n total_cost = 0\n node = n\n while node:\n total_cost += cost[node]\n node = parent[node]\n print(total_cost)", "import sys\n\ninput = sys.stdin.readline\nfrom collections import defaultdict\n\nN, M = map(int, input().split())\n\nparent = [i for i in range(N + 1)]\nrank = [0] * (N + 1)\n\n\ndef find(x):\n if parent[x] == x:\n return x\n else:\n parent[x] = find(parent[x])\n return parent[x]\n\n\ndef union(x, y):\n px = find(x)\n py = find(y)\n if rank[px] > rank[py]:\n parent[py] = px\n elif rank[px] < rank[py]:\n parent[px] = py\n else:\n parent[py] = px\n rank[px] += 1\n\n\ndef kruskal():\n edges = []\n for i in range(M):\n K, C = map(int, input().split())\n A = list(map(int, input().split()))\n for j in range(K - 1):\n x = A[j]\n y = A[j + 1]\n edges.append([C, x, y])\n edges.sort()\n cost = 0\n for c, x, y in edges:\n px = find(x)\n py = find(y)\n if px != py:\n union(x, y)\n cost += c\n return cost\n\n\nif N == 1 and M == 0:\n print(0)\nelse:\n print(kruskal())", "from collections import defaultdict\nimport heapq\n\n(n, m) = map(int, input().split())\nparents = [i for i in range(n + 1)]\nrank = [0] * (n + 1)\n\n\ndef find(x):\n if parents[x] != x:\n parents[x] = find(parents[x])\n return parents[x]\n\n\ndef union(x, y):\n (xr, yr) = (find(x), find(y))\n if xr == yr:\n return\n if rank[xr] > rank[yr]:\n parents[yr] = xr\n elif rank[xr] < rank[yr]:\n parents[xr] = yr\n else:\n parents[yr] = xr\n rank[xr] += 1\n\n\nedges = defaultdict(list)\nfor _ in range(m):\n (k, c) = map(int, input().split())\n vs = list(map(int, input().split()))\n for i in range(k - 1):\n for j in range(i + 1, k):\n edges[vs[i], vs[j]].append(c)\n edges[vs[j], vs[i]].append(c)\n\nif n == 1:\n print(0)\nelse:\n total = 0\n pq = []\n for i in range(1, n + 1):\n heapq.heappush(pq, (0, i))\n while pq:\n (cost, v) = heapq.heappop(pq)\n if find(v) != v:\n continue\n for u in edges[v, 0]:\n if find(v) != find(u):\n total += u\n union(v, u)\n break\n for u in edges[v, 0]:\n if find(v) != find(u):\n heapq.heappush(pq, (u, u))\n break\n if find(1) != find(n):\n print(-1)\n else:\n print(total)", "import sys\nfrom collections import defaultdict\nfrom heapq import heappush, heappop\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\ngraph = defaultdict(list)\nvisited = [0] * (N + 1)\n\nfor _ in range(M):\n K, C = list(map(int, input().split()))\n A = list(map(int, input().split()))\n for i in range(K - 1):\n for j in range(i + 1, K):\n graph[A[i]].append((A[j], C))\n graph[A[j]].append((A[i], C))\n\nif N == 1:\n print(0)\n exit()\n\nmst = 0\n\nfor i in range(1, N + 1):\n if visited[i]:\n continue\n heap = []\n heappush(heap, (0, i))\n while heap:\n cost, node = heappop(heap)\n if visited[node]:\n continue\n visited[node] = 1\n mst += cost\n for adj, c in graph[node]:\n if not visited[adj]:\n heappush(heap, (c, adj))\n\nif sum(visited[1:]) != N:\n print(-1)\nelse:\n print(mst)", "import sys\n\ninput = sys.stdin.readline\nfrom collections import defaultdict\n\nN, M = map(int, input().split())\n\nparent = [i for i in range(N + 1)]\nrank = [0] * (N + 1)\n\n\ndef find(x):\n if parent[x] == x:\n return x\n else:\n parent[x] = find(parent[x])\n return parent[x]\n\n\ndef union(x, y):\n px = find(x)\n py = find(y)\n if rank[px] > rank[py]:\n parent[py] = px\n elif rank[px] < rank[py]:\n parent[px] = py\n else:\n parent[py] = px\n rank[px] += 1\n\n\ndef solve():\n edges = defaultdict(list)\n for _ in range(M):\n K, C = map(int, input().split())\n A = list(map(int, input().split()))\n for i in range(K - 1):\n for j in range(i + 1, K):\n edges[A[i], A[j]].append(C)\n\n total = 0\n for k, v in edges.items():\n if find(k[0]) != find(k[1]):\n union(k[0], k[1])\n total += min(v)\n\n if find(1) == find(N):\n print(total)\n else:\n print(-1)\n\n\nsolve()", "import sys\n\ninput = sys.stdin.readline\nfrom collections import defaultdict\n\nN, M = map(int, input().split())\n\ngraph = defaultdict(list)\n\nfor _ in range(M):\n K, C = map(int, input().split())\n A = list(map(int, input().split()))\n for i in range(K - 1):\n for j in range(i + 1, K):\n graph[A[i]].append((A[j], C))\n graph[A[j]].append((A[i], C))\n\nvisited = set()\ntotal = 0\n\ndef dfs(node, parent):\n global total\n visited.add(node)\n for child, weight in graph[node]:\n if child not in visited:\n dfs(child, node)\n total += weight\n\nif N == len(visited):\n dfs(1, -1)\n print(total)\nelse:\n print(-1)", "import sys\n\ninput = sys.stdin.readline\nfrom collections import defaultdict\n\nN, M = map(int, input().split())\n\ngraph = defaultdict(list)\nvisited = [0] * (N + 1)\n\nfor _ in range(M):\n K, C = map(int, input().split())\n A = list(map(int, input().split()))\n for i in range(K - 1):\n for j in range(i + 1, K):\n graph[A[i]].append((A[j], C))\n graph[A[j]].append((A[i], C))\n\nans = 0\nfor i in range(1, N + 1):\n if visited[i] == 0:\n stack = [i]\n visited[i] = 1\n while stack:\n now = stack.pop()\n for j, k in graph[now]:\n if visited[j] == 0:\n visited[j] = 1\n stack.append(j)\n ans += k\n\nif ans == 0:\n print(-1)\nelse:\n print(ans)", "import sys\n\ninput = sys.stdin.readline\nfrom collections import defaultdict\n\nN, M = map(int, input().split())\n\ngraph = defaultdict(list)\n\nfor _ in range(M):\n K, C = map(int, input().split())\n A = list(map(int, input().split()))\n for i in range(K - 1):\n for j in range(i + 1, K):\n graph[A[i]].append((A[j], C))\n graph[A[j]].append((A[i], C))\n\nvisited = [0] * (N + 1)\nstack = [1]\nvisited[1] = 1\n\nwhile stack:\n node = stack.pop()\n for nei, cost in graph[node]:\n if not visited[nei]:\n visited[nei] = 1\n stack.append(nei)\n\nif sum(visited) != N:\n print(-1)\nelse:\n ans = 0\n for i in range(1, N + 1):\n ans += min((j for j, _ in graph[i]), default=0)\n print(ans)", "import sys\n\ninput = sys.stdin.readline\n\nN, M = list(map(int, input().split()))\n\ngraph = [[] for _ in range(N + 1)]\n\nfor _ in range(M):\n K, C = list(map(int, input().split()))\n A = list(map(int, input().split()))\n for i in range(K - 1):\n for j in range(i + 1, K):\n graph[A[i]].append((A[j], C))\n graph[A[j]].append((A[i], C))\n\nvisited = [0] * (N + 1)\n\ndef dfs(v):\n visited[v] = 1\n for nv, c in graph[v]:\n if visited[nv] == 0:\n dfs(nv)\n\nans = 0\ncnt = 0\nfor i in range(1, N + 1):\n if visited[i] == 0:\n dfs(i)\n cnt += 1\n\nif cnt > 1:\n print(-1)\nelse:\n graph[0] = [(i, 0) for i in range(1, N + 1)]\n for i in range(1, N + 1):\n graph[i].append((0, 0))\n graph[0].sort(key=lambda x: x[1])\n for i in range(1, N + 1):\n graph[i].sort(key=lambda x: x[1])\n\n visited = [0] * (N + 1)\n parent = [0] * (N + 1)\n def dfs(v, p):\n visited[v] = 1\n for nv, c in graph[v]:\n if visited[nv] == 0:\n parent[nv] = v\n dfs(nv, c)\n\n dfs(0, 0)\n\n def find(v):\n if v == parent[v]:\n return v\n parent[v] = find(parent[v])\n return parent[v]\n\n def union(u, v):\n u = find(u)\n v = find(v)\n if u == v:\n return\n parent[u] = v\n\n cost = 0\n for i in range(N - 1, -1, -1):\n v, c = graph[i][0]\n u = parent[v]\n union(u, v)\n cost += c\n print(cost)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\nh = list(map(int, input().split()))\nif max(h) > h[0]:\n print((h.index(max(h))))\nelse:\n print(-1)", "n = int(input())\r\nh = list(map(int, input().split()))\r\n\r\nif h[0] == max(h):\r\n print(-1)\r\nelse:\r\n print(h.index(max(h)) + 1)\r", "n = int(input())\nh = list(map(int, input().split()))\nif h[0] == max(h):\n print(-1)\nelse:\n print(h.index(max(h)) + 1)", "n = int(input())\nh = list(map(int, input().split()))\nfirst = h[0]\nfor i in range(n):\n if h[i] > first:\n print(i + 1)\n break\nelse:\n print(-1)", "n = int(input())\nh = list(map(int, input().split()))\nif h[0] == max(h):\n print(-1)\nelse:\n print(h.index(max(h)) + 1)", "n = int(input())\r\nh = list(map(int, input().split()))\r\n\r\nfirst = h[0]\r\nindex = -1\r\n\r\nfor i in range(1, n):\r\n if h[i] > first:\r\n index = i\r\n break\r\n\r\nprint(index + 1)\r", "n = int(input())\nh = list(map(int, input().split()))\n\nfirst = h[0]\nindex = -1\n\nfor i in range(n):\n if h[i] > first:\n index = i + 1\n break\n\nprint(index)", "n = int(input())\nh = list(map(int, input().split()))\n\nfirst = h[0]\nindex = -1\n\nfor i in range(n):\n if h[i] > first:\n index = i + 1\n break\n\nprint(index)", "n = int(input())\nh = list(map(int, input().split()))\nfirst = h[0]\nfor i in range(n):\n if h[i] > first:\n print(i + 1)\n break\nelse:\n print(-1)", "n = int(input())\nh = list(map(int, input().split()))\n\nfirst = h[0]\nindex = -1\n\nfor i in range(n):\n if h[i] > first:\n index = i + 1\n break\n\nprint(index)" ], "pass1_list": [ false, false, false, true, false, false, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n, k = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\nseats = k\nfor i in a:\n if seats < i:\n ans += 1\n seats = k\n else:\n seats -= i\nprint(ans + 1)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\nseats = k\nfor i in a:\n if seats < i:\n ans += 1\n seats = k\n else:\n seats -= i\nprint(ans + 1)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\ncount = 0\nseats = k\nfor i in a:\n if seats < i:\n count += 1\n seats = k\n else:\n seats -= i\n\nprint(count + 1)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\nseats = k\nfor i in a:\n if seats < i:\n ans += 1\n seats = k\n else:\n seats -= i\n\nprint(ans + 1)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\ncount = 0\nseats = k\nfor i in a:\n if i > seats:\n count += 1\n seats = k\n else:\n seats -= i\n\nprint(count + 1)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\nseats = k\nfor i in a:\n if seats < i:\n ans += 1\n seats = k\n else:\n seats -= i\nprint(ans + 1)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\nseats = k\nfor i in a:\n if seats < i:\n ans += 1\n seats = k\n else:\n seats -= i\nprint(ans + 1)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\ncount = 0\nseats = k\nfor i in a:\n if i > seats:\n count += 1\n seats = k\n else:\n seats -= i\n\nprint(count + 1)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\ncount = 0\nseats = k\n\nfor i in a:\n if i > seats:\n count += 1\n seats = k\n else:\n seats -= i\n\nprint(count + 1)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\nseats = k\nfor i in a:\n if seats < i:\n ans += 1\n seats = k\n else:\n seats -= i\nprint(ans + 1)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\na = list(map(int, input().split()))\nprint(sum(a) * (n - 1) - sum(sorted(a)) * (2 * n - 1))", "n = int(input())\na = list(map(int, input().split()))\nprint(sum(a) * (n - 1) - sum(sorted(a)) * (2 * n - 1))", "n = int(input())\na = list(map(int, input().split()))\nprint(sum(a) * (n - 1) - sum(sorted(a)) * (2 * n - 1))", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n ans += (a[i] + a[j]) % 100000000\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nprint(sum(a) * (n - 1) - sum(sorted(a)) * (2 * n - 1))", "n = int(input())\na = list(map(int, input().split()))\nprint(sum(a) * (n - 1) - sum(sorted(a)) * (2 * n - 1))", "n = int(input())\na = list(map(int, input().split()))\nprint(sum(a) * (n - 1) - sum(sorted(a)) * (2 * n - 1))", "n = int(input())\na = list(map(int, input().split()))\nprint(sum(a) * (n - 1) - sum(sorted(a)) * (2 * n - 1))", "n = int(input())\na = list(map(int, input().split()))\nprint(sum(a) * (n - 1) - sum(a[: n - 1]) - sum(a[1:]))", "n = int(input())\na = list(map(int, input().split()))\nprint(sum(a) * (n - 1) - sum(sorted(a)) * (2 * n - 1))" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "def main():\n n = int(input())\n a = list(map(int, input().split()))\n mod = 998244353\n a.sort()\n ans = 0\n for i in range(n - 1):\n for j in range(i + 1, n):\n ans += a[i] * (10**len(str(a[j]))) + a[j]\n ans %= mod\n print(ans)\n\n\nmain()", "def main():\n n = int(input())\n a = list(map(int, input().split()))\n mod = 998244353\n a.sort()\n ans = 0\n for i in range(n - 1):\n for j in range(i + 1, n):\n ans += a[i] * 10**len(str(a[j])) + a[j]\n ans %= mod\n print(ans)\n\n\nmain()", "n = int(input())\na = list(map(int, input().split()))\nmod = 998244353\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n ans += a[i] * (10**len(str(a[j]))) + a[j]\n ans %= mod\nprint(ans)", "def main():\n n = int(input())\n a = list(map(int, input().split()))\n mod = 998244353\n a.sort()\n ans = 0\n for i in range(n - 1):\n for j in range(i + 1, n):\n ans += a[i] * pow(10, len(str(a[j]))) % mod\n ans %= mod\n print(ans)\n\n\nmain()", "n = int(input())\na = list(map(int, input().split()))\nmod = 998244353\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n ans += a[i] * (10**len(str(a[j]))) + a[j]\n ans %= mod\nprint(ans)", "def main():\n n = int(input())\n a = list(map(int, input().split()))\n MOD = 998244353\n ans = 0\n for i in range(n):\n for j in range(i + 1, n):\n ans += a[i] * pow(10, len(str(a[j]))) + a[j]\n ans %= MOD\n print(ans)\n\n\nmain()", "def main():\n n = int(input())\n a = list(map(int, input().split()))\n mod = 998244353\n a.sort()\n ans = 0\n for i in range(n - 1):\n for j in range(i + 1, n):\n ans += a[i] * pow(10, len(str(a[j]))) % mod\n ans %= mod\n print(ans)\n\n\nmain()", "def main():\n n = int(input())\n a = list(map(int, input().split()))\n MOD = 998244353\n a.sort()\n ans = 0\n for i in range(n - 1):\n for j in range(i + 1, n):\n ans += a[i] * (10**len(str(a[j]))) % MOD\n ans %= MOD\n print(ans)\n\n\nmain()", "n = int(input())\na = list(map(int, input().split()))\nm = 998244353\ns = 0\nfor i in range(n):\n for j in range(i + 1, n):\n s += a[i] * 10**len(str(a[j])) + a[j]\n s %= m\nprint(s)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmod = 998244353\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n ans += a[i] * pow(10, len(str(a[j]))) + a[j]\r\n ans %= mod\r\nprint(ans)\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "from collections import defaultdict\n\nN = int(input())\nS = [input() for _ in range(N)]\n\ntrie = defaultdict(lambda: defaultdict(int))\n\nfor s in S:\n cur = trie\n for c in s:\n cur = cur[c]\n cur[\"$\"] += 1\n\nans = 0\n\nfor s in S:\n cur = trie\n for c in s:\n cur = cur[c]\n ans += cur[\"$\"]\n cur[\"$\"] -= 1\n\nprint(ans)", "n = int(input())\r\ns = [input() for _ in range(n)]\r\ns.sort()\r\n\r\nans = 0\r\nfor i in range(1, n):\r\n j = i - 1\r\n while j > 0 and s[j][0:len(s[j])] == s[j + 1][0:len(s[j])]:\r\n j -= 1\r\n ans += (i - j) * len(s[j])\r\n\r\nprint(ans)\r", "n = int(input())\r\ns = [input() for i in range(n)]\r\ns.sort()\r\nans = 0\r\nfor i in range(1, n):\r\n ans += len(os.path.commonprefix([s[i - 1], s[i]])) * (n - i)\r\nprint(ans)\r", "import sys\n\ninput = sys.stdin.readline\n\nN = int(input())\nS = [input().rstrip() for i in range(N)]\n\nfrom collections import defaultdict\n\ntrie = defaultdict(lambda: defaultdict(int))\n\nfor s in S:\n for i, c in enumerate(s):\n trie[i][c] += 1\n\nans = 0\nfor i in range(N - 1):\n for j in range(i + 1, N):\n for k in range(min(len(S[i]), len(S[j]))):\n if S[i][k] == S[j][k]:\n ans += 1\n else:\n break\n\nprint(ans)", "from collections import defaultdict\n\nN = int(input())\nS = [input() for _ in range(N)]\n\ntrie = defaultdict(lambda: defaultdict(int))\nfor s in S:\n for i, c in enumerate(s):\n trie[i][c] += 1\n\nans = 0\nfor i, s in enumerate(S):\n for j, c in enumerate(s):\n ans += trie[j][c] - 1\n trie[i][s[i]] -= 1\nprint(ans)", "n = int(input())\r\ns = [input() for _ in range(n)]\r\ns.sort()\r\n\r\ntotal = 0\r\nfor i in range(1, n):\r\n total += len(s[i - 1]) - len(s[i - 1].rstrip(s[i]))\r\nprint(total)\r", "n = int(input())\r\ns = [input() for _ in range(n)]\r\ns.sort()\r\n\r\nans = 0\r\nfor i in range(n - 1):\r\n j = i + 1\r\n while j < n and s[i] == s[j][: len(s[i])]:\r\n ans += len(s[i])\r\n j += 1\r\n i = j - 1\r\nprint(ans)\r", "n = int(input())\r\ns = [input() for i in range(n)]\r\ns.sort()\r\nans = 0\r\nfor i in range(1, n):\r\n ans += len(os.path.commonprefix([s[i - 1], s[i]])) * (n - i)\r\nprint(ans)\r", "n = int(input())\r\ns = [input() for i in range(n)]\r\ns.sort()\r\n\r\nans = 0\r\nfor i in range(1, n):\r\n ans += len(s[i - 1]) - len(s[i - 1].lstrip(s[i]))\r\nprint(ans)\r", "n = int(input())\r\ns = [input() for _ in range(n)]\r\ns.sort()\r\n\r\nans = 0\r\nfor i in range(1, n):\r\n ans += len(s[i - 1]) - len(s[i - 1].lstrip(s[i]))\r\n\r\nprint(ans)\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "H = int(input())\nday = 0\nplant_height = 0\nwhile plant_height <= H:\n day += 1\n plant_height = plant_height * 2 + 1\nprint(day)", "H = int(input())\nday = 0\nplant_height = 0\nwhile plant_height <= H:\n day += 1\n plant_height = plant_height * 2 + 1\nprint(day)", "h = int(input())\nday = 0\nplant_height = 0\nwhile plant_height <= h:\n day += 1\n plant_height += 2 ** (day - 1)\nprint(day)", "H = int(input())\nday = 0\nplant_height = 0\nwhile plant_height <= H:\n day += 1\n plant_height = plant_height * 2 + 1\nprint(day)", "H = int(input())\ni = 0\nwhile 2**i <= H:\n i += 1\nprint(i)", "H = int(input())\nday = 0\nplant_height = 0\nwhile plant_height <= H:\n day += 1\n plant_height = plant_height * 2 + 1\nprint(day)", "H = int(input())\nday = 0\nplant_height = 0\nwhile plant_height <= H:\n day += 1\n plant_height = plant_height * 2 + 1\nprint(day)", "H = int(input())\nday = 0\nheight = 0\nwhile height <= H:\n day += 1\n height = height * 2 + 1\nprint(day)", "h = int(input())\nday = 0\nplant_height = 0\nwhile plant_height <= h:\n day += 1\n plant_height += 2 ** (day - 1)\nprint(day)", "H = int(input())\nd = 0\ns = 0\nwhile s <= H:\n d += 1\n s += 2 ** (d - 1)\nprint(d)" ], "pass1_list": [ true, true, true, true, false, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "n = int(input())\nusers = []\nfor i in range(n):\n s, c = map(str, input().split())\n users.append((s, int(c)))\nusers.sort()\nt = sum(c for s, c in users)\nprint(users[t % n][0])", "n = int(input())\n\nnames = []\nratings = []\n\nfor _ in range(n):\n name, rating = input().split()\n rating = int(rating)\n names.append(name)\n ratings.append(rating)\n\nnames.sort()\n\ntotal = sum(ratings)\nwinner_index = total % n\n\nprint(names[winner_index])", "n = int(input())\nsc = []\nfor i in range(n):\n s, c = map(str, input().split())\n sc.append((s, int(c)))\nsc.sort()\nprint((sc[(sum(c for s, c in sc) % n)][0]))", "n = int(input())\nsc = []\nfor i in range(n):\n s, c = map(str, input().split())\n sc.append((s, int(c)))\nsc.sort()\nprint((sc[sum(c for s, c in sc) % n][0]))", "n = int(input())\nusers = []\nfor i in range(n):\n s, c = map(str, input().split())\n users.append((s, int(c)))\nusers.sort()\nt = sum(c for s, c in users)\nprint(users[t % n][0])", "n = int(input())\n\nusers = []\nfor _ in range(n):\n s, c = map(str, input().split())\n users.append((s, int(c)))\n\nusers.sort()\n\ntotal = sum(c for s, c in users)\nprint(users[total % n][0])", "n = int(input())\na = []\nfor i in range(n):\n s, c = map(str, input().split())\n a.append([s, int(c)])\na.sort()\nprint(a[(sum(c for s, c in a) % n)].pop(0))", "n = int(input())\nnames = []\nratings = []\nfor _ in range(n):\n name, rating = input().split()\n rating = int(rating)\n names.append(name)\n ratings.append(rating)\n\nnames.sort()\ntotal = sum(ratings)\nprint(names[total % n])", "n = int(input())\ns = []\nfor i in range(n):\n s.append(input().split())\ns.sort()\nt = 0\nfor i in range(n):\n t += int(s[i][1])\nprint(s[t % n][0])", "n = int(input())\n\nnames = []\nratings = []\n\nfor i in range(n):\n name, rating = input().split()\n names.append(name)\n ratings.append(int(rating))\n\nnames.sort()\n\ntotal = sum(ratings)\n\nprint(names[total % n])" ], "pass1_list": [ true, true, true, true, true, true, true, true, true, true ], "metadata_list": [] }, { "code_list": [ "from bisect import bisect_left\n\nn = int(input())\nac = [list(map(int, input().split())) for _ in range(n)]\nac.sort(key=lambda x: (x[0], -x[1]))\n\nres = []\nfor a, c in ac:\n if not res or res[-1][1] > c:\n res.append((a, c))\n\nprint(len(res))\nprint(*[i + 1 for a, c in res for i in range(n) if a == ac[i][0]])", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nac = [list(map(int, input().split())) for i in range(n)]\nac.sort(key=lambda x: (x[0], -x[1]))\nans = []\nfor i in range(n):\n if not ans or ans[-1][1] > ac[i][1]:\n ans.append(ac[i])\nprint(len(ans))\nprint(*[i + 1 for a, c in ans])", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nac = [list(map(int, input().split())) for i in range(n)]\nac.sort(key=lambda x: (x[0], -x[1]))\n\nres = []\nfor i in range(n):\n if not res or res[-1][1] > ac[i][1]:\n res.append(ac[i])\n\nprint(len(res))\nprint(*[i + 1 for i in range(n) if ac[i] in res])", "n = int(input())\na = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append((x, y, i + 1))\na.sort()\nans = [0] * n\ncnt = 0\nfor i in range(n):\n if ans[a[i][2] - 1] == 0:\n ans[a[i][2] - 1] = 1\n cnt += 1\n for j in range(i + 1, n):\n if a[j][0] < a[i][0] and a[j][1] > a[i][1]:\n ans[a[j][2] - 1] = 0\nprint(cnt)\nfor i in range(n):\n if ans[i] == 1:\n print(i + 1, end=\" \")", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nac = [list(map(int, input().split())) for i in range(n)]\nac.sort(key=lambda x: (x[0], -x[1]))\nans = []\nfor i in range(n):\n if not ans or ans[-1][1] > ac[i][1]:\n ans.append(ac[i])\nprint(len(ans))\nprint(*[i + 1 for i in range(n) if ac[i] in ans])", "from bisect import *\n\nn = int(input())\na = [list(map(int, input().split())) for i in range(n)]\na.sort(key=lambda x: (x[0], -x[1]))\nb = [a[i][1] for i in range(n)]\nc = []\nfor i in range(n):\n if i == 0:\n c.append(a[i][1])\n else:\n if a[i][1] > c[-1]:\n c.append(a[i][1])\nprint(len(c))\nd = []\nfor i in c:\n d.append(bisect_left(b, i))\nprint(*d)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nac = [list(map(int, input().split())) for i in range(n)]\nac.sort(key=lambda x: (x[0], -x[1]))\n\nres = []\nfor i in range(n):\n if not res or res[-1][1] > ac[i][1]:\n res.append(ac[i])\n\nprint(len(res))\nprint(*[i + 1 for i in range(n) if ac[i] in res])", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nac = [list(map(int, input().split())) for i in range(n)]\nac.sort(key=lambda x: (x[0], -x[1]))\n\nans = []\nfor i in range(n):\n if not ans or ans[-1][1] > ac[i][1]:\n ans.append(ac[i])\n\nprint(len(ans))\nprint(*[i + 1 for a, c in ans])", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nac = [list(map(int, input().split())) for i in range(n)]\nac.sort(key=lambda x: (x[0], -x[1]))\n\nans = []\nfor i in range(n):\n if not ans or ans[-1][1] > ac[i][1]:\n ans.append(ac[i])\n\nprint(len(ans))\nprint(*[i + 1 for i in range(n) if ac[i] in ans])", "from bisect import bisect_left\n\nN = int(input())\nAC = [list(map(int, input().split())) for _ in range(N)]\nAC.sort(key=lambda x: (x[0], -x[1]))\n\nres = []\nfor i in range(N):\n if not res or res[-1][1] > AC[i][1]:\n res.append(AC[i])\n\nprint(len(res))\nprint(*[i + 1 for a, c in res])" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "a, b, c, d = map(int, input().split())\n\ndef f(x, y):\n return (x + y) % 2 == 0 and x % 2 != 0 or y % 2 != 0\n\nans = 0\nfor x in range(a, c + 1):\n for y in range(b, d + 1):\n if f(x, y):\n ans += 1\nprint(ans * 2)", "a, b, c, d = map(int, input().split())\n\ndef f(x):\n return x // 2 * 2 == x\n\n\ndef g(x, y):\n return f(x + y)\n\n\ndef h(x, y):\n return (f(x) + g(x, y)) % 2\n\n\nans = 0\nfor x in range(a, c + 1):\n for y in range(b, d + 1):\n if h(x, y):\n ans += 1\nprint(2 * ans * (c - a) * (d - b))", "a, b, c, d = map(int, input().split())\n\ndef f(x, y):\n if x % 2 == 0:\n return y % 2 == 0\n else:\n return y % 2 == 1\n\n\nans = 0\nfor i in range(a, c + 1):\n for j in range(b, d + 1):\n if f(i, j):\n ans += 1\nprint(2 * ans * (c - a) * (d - b))", "a, b, c, d = map(int, input().split())\n\ndef f(x, y):\n return (x + y) % 2 == 0 or x % 2 == 1 or y % 2 == 1\n\nans = 0\nfor x in range(a, c + 1):\n for y in range(b, d + 1):\n if f(x, y):\n ans += 1\nprint(ans * 2)", "a, b, c, d = map(int, input().split())\n\ndef f(x, y):\n return (x + y) % 2 == 0 or x % 2 == 1 or y % 2 == 1\n\nans = 0\nfor x in range(a, c + 1):\n for y in range(b, d + 1):\n if f(x, y):\n ans += 1\nprint(2 * ans * (c - a) * (d - b))", "a, b, c, d = map(int, input().split())\n\ndef f(x, y):\n return (x + y) % 2 == 0 and x % 2 != 0 or x % 2 == 0 and y % 2 == 0\n\nans = 0\nfor x in range(a, c + 1):\n for y in range(b, d + 1):\n if f(x, y):\n ans += 1\nprint(ans * 2)", "a, b, c, d = map(int, input().split())\n\ndef f(x, y):\n return (x + y) % 2 == 0 and x % 2 != 0 or (x + y) % 2 != 0 and y % 2 == 0\n\n\nans = 0\nfor i in range(a, c + 1):\n for j in range(b, d + 1):\n if f(i, j):\n ans += 1\nprint(ans * 2)", "a, b, c, d = map(int, input().split())\n\ndef f(x, y):\n return (x + y) % 2 == 0 or x % 2 == 1\n\nans = 0\nfor x in range(a, c + 1):\n for y in range(b, d + 1):\n if f(x, y):\n ans += 1\nprint(ans * 2)", "a, b, c, d = map(int, input().split())\n\ndef f(x, y):\n return (x + y) % 2 == 0 or x % 2 == 1 or y % 2 == 1\n\nans = 0\nfor x in range(a, c + 1):\n for y in range(b, d + 1):\n if f(x, y):\n ans += 1\nprint(ans * 2)", "a, b, c, d = map(int, input().split())\n\ndef f(x, y):\n return (x + y) % 2 == 0 and x % 2 != 0 or (x + y) % 2 != 0 and y % 2 == 0\n\n\nans = 0\nfor i in range(a, c + 1):\n for j in range(b, d + 1):\n if f(i, j):\n ans += 1\nprint(ans * 2)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\ncards = [list(map(int, input().split())) for _ in range(n)]\n\nfront = set(a for a, _ in cards)\nback = set(b for _, b in cards)\n\nif len(front) + len(back) == n:\n print(\"Takahashi\")\nelse:\n print(\"Aoki\")", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\nans = \"Aoki\"\nfor i in range(n):\n for j in range(i + 1, n):\n if a[i][0] == a[j][0] or a[i][1] == a[j][1]:\n a.pop(j)\n a.pop(i)\n if len(a) % 2 == 0:\n ans = \"Takahashi\"\n break\n if ans == \"Takahashi\":\n break\nprint(ans)", "def main():\n n = int(input())\n ab = [list(map(int, input().split())) for _ in range(n)]\n a = set(a for a, _ in ab)\n b = set(b for _, b in ab)\n if len(a) + len(b) < n:\n print(\"Aoki\")\n return\n if n == 1:\n print(\"Takahashi\")\n return\n if n == 2:\n print(\"Aoki\")\n return\n if n == 3:\n print(\"Takahashi\")\n return\n if n % 2 == 0:\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n\n\nmain()", "n = int(input())\ncards = []\nfor i in range(n):\n a, b = map(int, input().split())\n cards.append((a, b))\ncards.sort()\ncards.reverse()\n\ndef check(cards):\n for i in range(len(cards) - 1):\n if cards[i][0] == cards[i + 1][0] or cards[i][1] == cards[i + 1][1]:\n return False\n return True\n\n\nif check(cards):\n print(\"Aoki\")\nelse:\n for i in range(len(cards)):\n for j in range(i + 1, len(cards)):\n if cards[i][0] == cards[j][0] or cards[i][1] == cards[j][1]:\n cards.remove(cards[i])\n cards.remove(cards[j])\n if check(cards):\n print(\"Aoki\")\n else:\n print(\"Takahashi\")\n cards.append(cards[i])\n cards.append(cards[j])\n break\n else:\n print(\"Takahashi\")", "from collections import defaultdict\n\nn = int(input())\ncards = [list(map(int, input().split())) for _ in range(n)]\n\nfront = defaultdict(int)\nback = defaultdict(int)\nfor a, b in cards:\n front[a] += 1\n back[b] += 1\n\nfront_odd = sum(1 for v in front.values() if v % 2 == 1)\nback_odd = sum(1 for v in back.values() if v % 2 == 1)\n\nprint(\"Takahashi\" if front_odd * back_odd != 0 else \"Aoki\")", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n b = a[:i] + a[i + 1 : j] + a[j + 1 :]\n ans ^= n & 1 ^ nx(b)\n\nprint(\"Aoki\" if ans else \"Takahashi\")\n\n\ndef nx(a):\n n = len(a)\n if n == 0:\n return 0\n if n == 1:\n return 1\n if n == 2:\n return 0\n if n == 3:\n return 1\n if n == 4:\n return 0\n if n == 5:\n return 1\n if n == 6:\n return 0\n if n == 7:\n return 1\n if n == 8:\n return 0\n if n == 9:\n return 1\n if n == 10:\n return 0\n if n == 11:\n return 1\n if n == 12:\n return 0\n if n == 13:\n return 1\n if n == 14:\n return 0\n if n == 15:\n return 1\n if n == 16:\n return 0\n if n == 17:\n return 1\n if n == 18:\n return 0\n\n return 0", "from collections import defaultdict\n\nn = int(input())\ncards = [list(map(int, input().split())) for _ in range(n)]\n\nfront = defaultdict(int)\nback = defaultdict(int)\nfor a, b in cards:\n front[a] += 1\n back[b] += 1\n\nfront_odd = sum(1 for v in front.values() if v % 2)\nback_odd = sum(1 for v in back.values() if v % 2)\n\nprint(\"Takahashi\" if front_odd % 2 != back_odd % 2 else \"Aoki\")", "def main():\n n = int(input())\n ab = [list(map(int, input().split())) for _ in range(n)]\n a, b = [set(x) for x in zip(*ab)]\n if n % 2 == 0:\n print(\"Aoki\")\n else:\n if n == 1:\n print(\"Aoki\")\n else:\n print(\n \"Takahashi\"\n if len(a) % 2 != len(b) % 2 or len(a) % 2 == 0 and len(b) % 2 == 0\n else \"Aoki\"\n )\n\n\nmain()", "n = int(input())\nab = [list(map(int, input().split())) for _ in range(n)]\n\na = set(a[0] for a, b in ab)\nb = set(b[0] for a, b in ab)\n\nif n == 1 or (len(a) == 1 and len(b) == 1):\n print(\"Aoki\")\nelif n % 2 == 0:\n print(\"Aoki\")\nelse:\n print(\"Takahashi\")", "def main():\n n = int(input())\n ab = [list(map(int, input().split())) for _ in range(n)]\n ab.sort()\n a = [a for a, b in ab]\n b = [b for a, b in ab]\n if n % 2 == 0:\n print(\"Aoki\")\n return\n for i in range(n):\n if i > 0 and a[i] == a[i - 1]:\n continue\n if i > 0 and b[i] == b[i - 1]:\n continue\n if i < n - 1 and a[i] == a[i + 1]:\n continue\n if i < n - 1 and b[i] == b[i + 1]:\n continue\n print(\"Takahashi\")\n return\n print(\"Aoki\")\n\n\nmain()" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "a, b = map(int, input().split())\nif a == b:\n print(-1)\nelif a == 1 and b == 2:\n print(3)\nelif a == 1 and b == 3:\n print(2)\nelif a == 2 and b == 1:\n print(-1)\nelif a == 2 and b == 3:\n print(1)\nelif a == 3 and b == 1:\n print(2)\nelif a == 3 and b == 2:\n print(1)", "a, b = map(int, input().split())\nif a == b:\n print(-1)\nelse:\n print(6 - a - b)", "a, b = map(int, input().split())\nif a == b:\n print(-1)\nelse:\n print(6 - a - b)", "a, b = map(int, input().split())\nif a == b:\n print(-1)\nelse:\n print(6 - a - b)", "a, b = map(int, input().split())\nif a == b:\n print(-1)\nelse:\n print(6 - a - b)", "a, b = map(int, input().split())\nif a == b:\n print(-1)\nelif a == 1 and b == 2:\n print(3)\nelif a == 1 and b == 3:\n print(2)\nelif a == 2 and b == 1:\n print(-1)\nelif a == 2 and b == 3:\n print(1)\nelif a == 3 and b == 1:\n print(2)\nelif a == 3 and b == 2:\n print(1)", "a, b = map(int, input().split())\nif a == b:\n print(-1)\nelse:\n print(6 - a - b)", "a, b = map(int, input().split())\nif a == b:\n print(-1)\nelse:\n print(6 - a - b)", "a, b = map(int, input().split())\nif a == b:\n print(-1)\nelif a == 1 and b == 2:\n print(3)\nelif a == 1 and b == 3:\n print(2)\nelif a == 2 and b == 1:\n print(-1)\nelif a == 2 and b == 3:\n print(1)\nelif a == 3 and b == 1:\n print(2)\nelif a == 3 and b == 2:\n print(1)", "a, b = map(int, input().split())\nif a == b:\n print(-1)\nelse:\n print(6 - a - b)" ], "pass1_list": [ false, true, true, true, true, false, true, true, false, true ], "metadata_list": [] }, { "code_list": [ "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = a + b\nc.sort()\nfor i in range(n + m - 1):\n if c[i] in a and c[i + 1] in a:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = a + b\nc.sort()\nfor i in range(len(c) - 1):\n if c[i] in a and c[i + 1] in a:\n print(\"Yes\")\n break\nelse:\n print(\"No\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = sorted(a + b)\nfor i in range(len(c) - 1):\n if c[i] in a and c[i + 1] in a:\n print(\"Yes\")\n break\nelse:\n print(\"No\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\nc = a + b\nfor i in range(len(c) - 1):\n if c[i] in a and c[i + 1] in a:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = sorted(a + b)\nfor i in range(len(c) - 1):\n if c[i] in a and c[i + 1] in a:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = a + b\nc.sort()\nfor i in range(len(c) - 1):\n if c[i] in a and c[i + 1] in a:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = sorted(a + b)\nfor i in range(len(c) - 1):\n if c[i] in a and c[i + 1] in a:\n print(\"Yes\")\n exit()\nprint(\"No\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = sorted(a + b)\nfor i in range(len(c) - 1):\n if c[i] in a and c[i + 1] in a:\n print(\"Yes\")\n break\nelse:\n print(\"No\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = sorted(a + b)\nfor i in range(len(c) - 1):\n if c[i] in a and c[i + 1] in a:\n print(\"Yes\")\n break\nelse:\n print(\"No\")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = sorted(a + b)\nfor i in range(len(c) - 1):\n if c[i] in a and c[i + 1] in a:\n print(\"Yes\")\n exit()\nprint(\"No\")" ], "pass1_list": [ false, true, true, false, false, false, false, true, true, false ], "metadata_list": [] }, { "code_list": [ "n, t = map(int, input().split())\na = list(map(int, input().split()))\n\ngrid = [[0] * n for _ in range(n)]\n\nfor i in range(t):\n x = a[i] - 1\n y = (x // n) + 1\n x %= n\n\n grid[y - 1][x] = 1\n\n if sum(grid[y - 1]) == n:\n print(i + 1)\n break\n if sum(grid[i][j] for i in range(n)) == n:\n print(i + 1)\n break\n if sum(grid[i][i] for i in range(n)) == n:\n print(i + 1)\n break\n if sum(grid[i][n - 1 - i] for i in range(n)) == n:\n print(i + 1)\n break\n\nelse:\n print(-1)", "n, t = map(int, input().split())\na = list(map(int, input().split()))\n\ntable = [[0] * n for _ in range(n)]\n\nfor i in range(t):\n x, y = divmod(a[i] - 1, n)\n table[x][y] = 1\n\n if all(table[x]) or all(table[i][y] for i in range(n)) or all(table[i][i] for i in range(n)) or all(\n table[i][n - 1 - i] for i in range(n)\n ):\n print(i + 1)\n exit()\n\nprint(-1)", "n, t = map(int, input().split())\na = list(map(int, input().split()))\n\ngrid = [[0] * n for _ in range(n)]\n\nfor i in range(t):\n x, y = divmod(a[i] - 1, n)\n grid[x][y] = 1\n\n # check rows\n if all(grid[x]):\n print(i + 1)\n exit()\n\n # check columns\n if all(grid[j][y] for j in range(n)):\n print(i + 1)\n exit()\n\n # check diagonals\n if x == y and all(grid[j][j] for j in range(n) if 0 <= j < x + 1):\n print(i + 1)\n exit()\n if x + y == n - 1 and all(grid[j][n - 1 - j] for j in range(n) if 0 <= j < x + 1):\n print(i + 1)\n exit()\n\nprint(-1)", "n, t = map(int, input().split())\na = list(map(int, input().split()))\n\ngrid = [[0] * n for _ in range(n)]\n\nfor i in range(t):\n x, y = divmod(a[i] - 1, n)\n grid[x][y] = 1\n\n # check rows\n if all(grid[x]):\n print(i + 1)\n break\n\n # check columns\n if all(grid[j][y] for j in range(n)):\n print(i + 1)\n break\n\n # check diagonals\n if all(grid[j][j] for j in range(n)) or all(grid[j][n - 1 - j] for j in range(n)):\n print(i + 1)\n break\n\nelse:\n print(-1)", "n, t = map(int, input().split())\na = list(map(int, input().split()))\n\ngrid = [[0] * n for _ in range(n)]\nfor i in range(t):\n x = a[i] - 1\n y = (x // n) + 1\n x %= n\n\n grid[y - 1][x] = 1\n\n if sum(grid[y - 1]) == n or sum(grid[j][y - 1] for j in range(n)) == n:\n print(i + 1)\n break\n\n if y == x + 1 and sum(grid[i][i] for i in range(n)) == n:\n print(i + 1)\n break\n\n if y == n - x and sum(grid[i][n - i - 1] for i in range(n)) == n:\n print(i + 1)\n break\n\nelse:\n print(-1)", "n, t = map(int, input().split())\na = list(map(int, input().split()))\n\ngrid = [[0] * n for _ in range(n)]\n\nfor i in range(t):\n x = a[i] - 1\n y = (x // n) + 1\n x %= n\n\n grid[y - 1][x] = 1\n\n if sum(grid[y - 1]) == n:\n print(i + 1)\n break\n if sum(grid[i][y - 1] for i in range(n)) == n:\n print(i + 1)\n break\n if sum(grid[i][i] for i in range(n)) == n:\n print(i + 1)\n break\n if sum(grid[i][n - 1 - i] for i in range(n)) == n:\n print(i + 1)\n break\n\nelse:\n print(-1)", "n, t = map(int, input().split())\na = list(map(int, input().split()))\n\ntable = [[0] * n for _ in range(n)]\n\nfor i in range(t):\n table[((a[i] - 1) // n)][(a[i] - 1) % n] = 1\n\nfor i in range(n):\n if sum(table[i]) == n:\n print(i + 1)\n exit()\n\nfor i in range(n):\n if sum([table[j][i] for j in range(n)]) == n:\n print(i + 1)\n exit()\n\nif sum([table[i][i] for i in range(n)]) == n:\n print(n + 1)\n exit()\n\nif sum([table[i][n - 1 - i] for i in range(n)]) == n:\n print(n + 1)\n exit()\n\nprint(-1)", "n, t = map(int, input().split())\na = list(map(int, input().split()))\n\ntable = [[0] * n for _ in range(n)]\n\nfor i in range(t):\n table[((a[i] - 1) // n)][(a[i] - 1) % n] = 1\n\nfor i in range(n):\n if sum(table[i]) == n:\n print(i + 1)\n exit()\n\nfor i in range(n):\n if sum([table[j][i] for j in range(n)]) == n:\n print(i + 1)\n exit()\n\nif sum([table[i][i] for i in range(n)]) == n:\n print(n + 1)\n exit()\n\nif sum([table[i][n - 1 - i] for i in range(n)]) == n:\n print(n + 1)\n exit()\n\nprint(-1)", "import sys\n\ninput = sys.stdin.readline\n\nN, T = map(int, input().split())\n\nA = [int(a) - 1 for a in input().split()]\n\ntable = [[0] * N for _ in range(N)]\n\nfor a in A:\n i, j = divmod(a, N)\n table[i][j] = 1\n\nfor i in range(N):\n if sum(table[i]) == N:\n print(i + 1)\n exit()\n\nfor j in range(N):\n if sum(table[i][j] for i in range(N)) == N:\n print(j + 1)\n exit()\n\nif sum(table[i][i] for i in range(N)) == N:\n print(N + 1)\n exit()\n\nif sum(table[i][N - i - 1] for i in range(N)) == N:\n print(2 * N + 1)\n exit()\n\nprint(-1)", "n, t = map(int, input().split())\na = [int(x) for x in input().split()]\n\ngrid = [[0] * n for _ in range(n)]\n\nfor i in range(t):\n x = a[i] - 1\n r = x // n\n c = x % n\n grid[r][c] = 1\n\n if sum(grid[r]) == n or sum(grid[c]) == n or sum(grid[i][i] for i in range(n)) == n or sum(grid[i][n - i - 1] for i in range(n)) == n:\n print(i + 1)\n break\nelse:\n print(-1)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(list(map(int, input().split())))\r\nl.sort(key=lambda x: x[1])\r\nans = 0\r\nlast = -1\r\nfor i in l:\r\n if i[0] > last:\r\n last = i[1]\r\n else:\r\n ans += 1\r\n last = i[1]\r\nprint(ans)\r", "n = int(input())\nlr = []\nfor i in range(n):\n l, r = map(int, input().split())\n lr.append((l, r))\nlr.sort(key=lambda x: x[1])\nans = 0\ncnt = 0\nfor l, r in lr:\n if r > lr[cnt][0]:\n ans += 1\n else:\n cnt += 1\nprint(ans)", "import sys\n\ninput = sys.stdin.readline\nn = int(input())\nlr = [list(map(int, input().split())) for i in range(n)]\nlr.sort(key=lambda x: x[1])\nans = 0\nr = 0\nfor l, R in lr:\n if l < r:\n ans += 1\n r = max(r, R)\nprint(ans)", "n = int(input())\nintervals = []\nfor i in range(n):\n l, r = map(int, input().split())\n intervals.append((l, r))\nintervals.sort(key=lambda x: x[1])\nans = 0\nlast_r = -1\nfor l, r in intervals:\n if r > last_r:\n ans += 1\n last_r = r\nprint(ans * (n - ans))", "n = int(input())\nintervals = []\nfor i in range(n):\n l, r = map(int, input().split())\n intervals.append((l, r))\n\nintervals.sort(key=lambda x: x[1])\n\ncount = 0\nlast_r = -1\nfor l, r in intervals:\n if r > last_r:\n count += 1\n last_r = r\n\nprint(count * (n - count))", "n = int(input())\r\nintervals = []\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n intervals.append([l, r])\r\n\r\nintervals.sort(key=lambda x: x[1])\r\n\r\ncount = 0\r\nlast_r = -1\r\nfor l, r in intervals:\r\n if r > last_r:\r\n count += 1\r\n last_r = r\r\n\r\nprint(count * (n - count))\r", "import sys\n\ninput = sys.stdin.readline\nN = int(input())\ndata = [list(map(int, input().split())) for i in range(N)]\ndata.sort(key=lambda x: x[1])\nans = 0\nr = 0\nfor l, R in data:\n if l > r:\n r = R\n continue\n ans += N - (data.index([l, R]) + 1)\n r = R\nprint(ans)", "N = int(input())\r\n\r\nintervals = []\r\nfor _ in range(N):\r\n l, r = map(int, input().split())\r\n intervals.append((l, r))\r\n\r\nintervals.sort(key=lambda x: x[1])\r\n\r\ncount = 0\r\nlast_r = -1\r\nfor l, r in intervals:\r\n if r > last_r:\r\n count += 1\r\n last_r = r\r\n\r\nprint(count * (N - count))\r", "n = int(input())\r\nintervals = []\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n intervals.append([l, r])\r\n\r\nintervals.sort(key=lambda x: x[1])\r\n\r\ncount = 0\r\nlast_r = intervals[0][1]\r\nfor i in range(1, n):\r\n if intervals[i][0] < last_r:\r\n count += 1\r\n else:\r\n last_r = intervals[i][1]\r\n\r\nprint(count)\r", "n = int(input())\r\n\r\nintervals = []\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n intervals.append([l, r])\r\n\r\nintervals.sort(key=lambda x: x[1])\r\n\r\ncount = 0\r\nlast_r = -1\r\nfor l, r in intervals:\r\n if r > last_r:\r\n count += 1\r\n last_r = r\r\n\r\nprint(count * (n - count))\r" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] }, { "code_list": [ "import sys\n\ninput = sys.stdin.readline\n\nN, L, R = map(int, input().split())\n\nL = L.bit_length() - 1\nR = R.bit_length()\n\nwhile L < R:\n print(\"?\", L, 0)\n sys.stdout.flush()\n T = int(input())\n L += 1\n\nprint(\"!\", T)", "import sys\n\ninput = sys.stdin.readline\n\nN, L, R = map(int, input().split())\n\nL_bin = bin(L)[2:]\nR_bin = bin(R + 1)[2:]\n\nL_bin = '0' * (N - len(L_bin)) + L_bin\nR_bin = '0' * (N - len(R_bin)) + R_bin\n\nans = 0\n\nwhile True:\n for i in range(N):\n if L_bin[i] == '0' and R_bin[i] == '1':\n print('?', i, int(L_bin[:i] + '1', 2))\n sys.stdout.flush()\n ans += int(input())\n L_bin = L_bin[:i] + '1' + L_bin[i + 1:]\n break\n else:\n break\n\nprint('!', ans % 100)", "import sys\n\ninput = sys.stdin.readline\n\nN, L, R = map(int, input().split())\n\nans = 0\n\nwhile L <= R:\n mid = (L + R) // 2\n print(\"?\", N - 1, mid // (2 ** (N - 1)))\n sys.stdout.flush()\n ans += int(input())\n if L == R:\n break\n if mid % 2 == 0:\n L = mid + 1\n else:\n R = mid - 1\n\nprint(\"!\", ans % 100)", "import sys\n\ninput = sys.stdin.readline\n\nN, L, R = map(int, input().split())\n\nans = 0\n\nwhile L <= R:\n mid = (L + R) // 2\n print(\"?\", N - 1, mid // (2 ** (N - 1)))\n sys.stdout.flush()\n ans += int(input())\n if L == R:\n break\n if mid % 2 == 0:\n L = mid + 1\n else:\n R = mid - 1\n\nprint(\"!\", ans % 100)", "import sys\n\ninput = sys.stdin.readline\n\nN, L, R = map(int, input().split())\n\nL_bin = bin(L)[2:]\nR_bin = bin(R + 1)[2:]\n\nL_len = len(L_bin)\nR_len = len(R_bin)\n\nif L_len < R_len:\n L_bin = \"0\" * (R_len - L_len) + L_bin\nelif L_len > R_len:\n R_bin = \"0\" * (L_len - R_len) + R_bin\n\nans = 0\n\nfor i in range(R_len):\n if L_bin[i] == R_bin[i]:\n ans += int(L_bin[i]) * (2 ** (R_len - i - 1))\n\nif L_bin == R_bin:\n print(\"!\", ans % 100)\n exit()\n\nfor i in range(R_len):\n if L_bin[i] != R_bin[i]:\n print(\"?\", R_len - i - 1, int(L_bin[i]))\n sys.stdout.flush()\n ans += int(input()) * (2 ** (R_len - i - 1))\n\nprint(\"!\", ans % 100)", "import sys\n\ninput = sys.stdin.readline\n\nN, L, R = map(int, input().split())\n\nL, R = bin(L)[2:], bin(R)[2:]\n\nif len(L) < len(R):\n L = '0'*(len(R) - len(L)) + L\nelse:\n R = '0'*(len(L) - len(R)) + R\n\nans = 0\n\nfor i in range(N):\n if L[i] == '1' or R[i] == '1':\n print('?', i, int(L[i])//2)\n sys.stdout.flush()\n ans += int(input())\n if L[i] == '1':\n L = L[:i] + '0' + L[i+1:]\n if R[i] == '1':\n R = R[:i] + '0' + R[i+1:]\n\nprint('!', ans%100)", "import sys\n\ninput = sys.stdin.readline\n\nN, L, R = map(int, input().split())\n\nif L == R:\n print('!', L % 100)\n exit()\n\nans = 0\n\nfor i in range(N + 1):\n if 2 ** i * 2 > 2 ** N:\n continue\n if L % (2 ** i) == 0 and R % (2 ** i) == (2 ** i) - 1:\n print('?', i, L // (2 ** i))\n sys.stdout.flush()\n ans += int(input())\n elif L % (2 ** i) == 0:\n print('?', i, L // (2 ** i))\n sys.stdout.flush()\n ans += int(input())\n L += 2 ** i - 1\n elif R % (2 ** i) == (2 ** i) - 1:\n print('?', i, R // (2 ** i))\n sys.stdout.flush()\n ans -= int(input())\n R -= 2 ** i - 1\n else:\n print('?', i, L // (2 ** i))\n sys.stdout.flush()\n tmp = int(input())\n L += 2 ** i - 1\n R -= 2 ** i - 1\n ans += tmp\n print('?', i, R // (2 ** i))\n sys.stdout.flush()\n ans -= int(input())\n\nprint('!', ans % 100)", "import sys\n\ninput = sys.stdin.readline\n\nN, L, R = map(int, input().split())\n\nL_bin = bin(L)[2:]\nR_bin = bin(R + 1)[2:]\n\nL_len = len(L_bin)\nR_len = len(R_bin)\n\nif L_len < R_len:\n L_bin = \"0\" * (R_len - L_len) + L_bin\nelif L_len > R_len:\n R_bin = \"0\" * (L_len - R_len) + R_bin\n\nans = 0\n\nfor i in range(R_len):\n if L_bin[i] == R_bin[i]:\n continue\n print(\"?\", i, int(L_bin[i]))\n sys.stdout.flush()\n ans += int(input()) * (2 ** (R_len - i - 1))\n\nprint(\"!\", ans % 100)", "import sys\n\ninput = sys.stdin.readline\n\nN, L, R = map(int, input().split())\n\nL_bin = bin(L)[2:]\nR_bin = bin(R)[2:]\n\nL_len = len(L_bin)\nR_len = len(R_bin)\n\nif L_len < R_len:\n L_bin = '0' * (R_len - L_len) + L_bin\nelif L_len > R_len:\n R_bin = '0' * (L_len - R_len) + R_bin\n\nans = 0\n\nfor i in range(N + 1):\n if L_bin[:i] + '1' * (N - i) <= R_bin:\n print('?', i, int(L_bin[:i], 2))\n sys.stdout.flush()\n ans += int(input())\n if L_bin[:i] + '0' * (N - i) <= R_bin:\n print('?', i, int(R_bin[:i], 2) + 1)\n sys.stdout.flush()\n ans -= int(input())\n\nprint('!', ans % 100)", "import sys\n\ninput = sys.stdin.readline\n\nN, L, R = map(int, input().split())\n\nL, R = bin(L)[2:], bin(R)[2:]\n\nL = '0' * (N - len(L)) + L\nR = '0' * (N - len(R)) + R\n\nans = 0\n\nfor i in range(N):\n if L[i] == '0' and R[i] == '1':\n print('?', i, int(L[i:].replace('0', ''), 2))\n sys.stdout.flush()\n ans += int(input()) % 100\n elif L[i] == '1' and R[i] == '0':\n print('?', i, int(R[i:].replace('0', ''), 2))\n sys.stdout.flush()\n ans += int(input()) % 100\n\nprint('!', ans % 100)" ], "pass1_list": [ false, false, false, false, false, false, false, false, false, false ], "metadata_list": [] } ] }