Datasets:

Asap7772

/

code_contests_yi_coder_9b_chat_passk-part1-of-1_graded

like 0

{"input":["0\n","_XX\n","_00\n","0_25\n","25\n","X\n","6X\n","585X27X5\n","XX_X_3_X\n","_5\n","050\n(...TRUNCATED)

[" \n```python\nfrom itertools import product\n\ndef solve(s):\n n = len(s)\n cnt = [0] * 10\n(...TRUNCATED)

[false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,fal(...TRUNCATED)

{"input":["4\n4 2 3 1\n","7\n2 1 4 2 5 3 7\n","1\n1\n","1\n200000\n","1\n2\n","1\n001\n","1\n69861\n(...TRUNCATED)

[" [4, 2, 3, 1] -> [2, 3, 1]\n\nMr. Chanek guarantees that there will be a unique answer for each te(...TRUNCATED)

[false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,fal(...TRUNCATED)

{"input":["6\nABACAB\nABBA\nAC\nABC\nCABCBB\nBCBCBCBCBCBCBCBC\n","6\nABACAB\nABBA\nAC\nABC\nCABCBB\n(...TRUNCATED)

[" \n```python\ndef solve():\n t = int(input())\n for _ in range(t):\n s = input()\n (...TRUNCATED)

[false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,fal(...TRUNCATED)

{"input":["4\n2\n2 1\n3\n1 2 1\n4\n2 4 1 3\n5\n2 5 1 4 3\n","4\n2\n2 1\n3\n1 2 1\n4\n2 4 1 3\n5\n2 5(...TRUNCATED)

["\n```python\ndef solve(n, arr):\n actions = []\n for i in range(n):\n min_idx = i + a(...TRUNCATED)

[true,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,false(...TRUNCATED)

{"input":["8\n2\n2 3\n3\n1 2 3\n4\n1 2 3 4\n3\n0 0 2\n2\n6 2\n3\n0 0 2\n5\n8 2 0 1 1\n5\n0 1 0 0 6\n(...TRUNCATED)

["\ndef solve():\n n = int(input())\n a = list(map(int, input().split()))\n a.sort(reverse=(...TRUNCATED)

[false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,fal(...TRUNCATED)

{"input":["6\n4\n3 7 5 5\n3\n3 2 1\n3\n3 1 2\n4\n-1 2 2 -1\n4\n4 5 1 3\n5\n1 3 1 3 2\n","1\n1\n-1000(...TRUNCATED)

["\n```python\ndef solve():\n n = int(input())\n a = list(map(int, input().split()))\n \n (...TRUNCATED)

[false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,fal(...TRUNCATED)

{"input":["5\n2 1\n0 1\n3 2\n0 1 0\n5 2\n1 1 0 1 0\n4 2\n0 1 0 1\n1 1\n0\n","5\n2 1\n0 1\n3 2\n0 1 0(...TRUNCATED)

["\n```python\nt = int(input())\nfor _ in range(t):\n n, d = map(int, input().split())\n a = l(...TRUNCATED)

[false,false,false,false,false,false,false,false,true,false,false,false,false,true,false,false,false(...TRUNCATED)

{"input":["6\n2\n1 3\n3\n1 2 3\n4\n6 2 3 9\n4\n6 8 4 5\n7\n1 2 4 6 7 7 3\n8\n8 6 5 1 2 2 3 6\n","6\n(...TRUNCATED)

["\n```python\ndef solve(arr):\n arr.sort()\n ans = arr[0]\n for a, b in zip(arr, arr[1:]):(...TRUNCATED)

[false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,fal(...TRUNCATED)

{"input":["1\n9 9\n001010001\n101110100\n000010011\n100000001\n101010101\n110001111\n000001111\n1111(...TRUNCATED)

[" CQXYM can change block A_{1,1}, A_{4,1}, A_{1,3}, A_{4,3}, A_{1,4}, A_{4,4} to obsidian blocks, a(...TRUNCATED)

[false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,fal(...TRUNCATED)

{"input":["4\n1\n2\n9\n91234\n","2\n99997\n3\n","14\n13633\n739\n4\n1\n23481\n279\n5113\n2013\n48785(...TRUNCATED)

[" Python code\n\n```python\nmod = 1000000007\nMAX = 200010\nfact = [0]*MAX\ninv = [0]*MAX\n\ndef mu(...TRUNCATED)

[false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,fal(...TRUNCATED)